With 133 registered participants from 27 countries, including 19 participants fromindustry,theInternationalSymposiumonGraphDrawing2001(GD2001) that took place in Vienna, September 23-26, 2001, clearly demonstrated that the graph drawing community is still growing. The 31 contributed talks that hadbeenselectedoutof66papersubmissionsbytheprogramcommitteere?ect themanyfacetsofgraphdrawingandthehighactivityinourscienti?cdiscipline. In addition, we had the pleasure of enjoying invited presentations by Alexander Schrijver and ...
Read More
With 133 registered participants from 27 countries, including 19 participants fromindustry,theInternationalSymposiumonGraphDrawing2001(GD2001) that took place in Vienna, September 23-26, 2001, clearly demonstrated that the graph drawing community is still growing. The 31 contributed talks that hadbeenselectedoutof66papersubmissionsbytheprogramcommitteere?ect themanyfacetsofgraphdrawingandthehighactivityinourscienti?cdiscipline. In addition, we had the pleasure of enjoying invited presentations by Alexander Schrijver and Eduard Gr. oller that mark extreme points of the wide spectrum of graph drawing, the mathematical foundations and the computer graphics, respectively.Wehavecompiledthewrittenversionsofthesecontributionsinthe same order as they were presented during the conference. WehaveaddedacorrectversionofJoanP.Hutchinson'scontributiontoGD 2000 that had been misprinted in the GD 2000 proceedings. GD 2001 hosted a software exhibition that gave participants and guests the opportunity for hands-on experience with state-of-the-art graph drawing tools. Outofthe26submittedsoftwaretools,24werepresentedattheconferenceand received considerable attention by the participants. Each of them is represented here by a two-page-summary. Inaspecialsessionongraphexchangeformats,organizedbyGiuseppeLiotta, theGXLandtheGraphMLprojectswerepresentedbyAndreasWinterandUlrik Brandes,respectively,andthenalivelydiscussionfollowed.Thewrittenversions of the two reports are also included here. The ?nal contribution in this volume is a report on a traditional component of all graph drawing conferences that is a serious and a fun event at the same time: the Graph Drawing Contest 2001 organized by Franz Brandenburg. We would like to thank all contributors for the pleasant cooperation.
Read Less
Add this copy of Graph Drawing: 9th International Symposium, GD 2001 to cart. $103.32, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2002 by Springer.
Add this copy of Graph Drawing: 9th International Symposium, GD 2001 to cart. $120.08, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2002 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Trade paperback (US). Glued binding. 528 p. Contains: Unspecified. Lecture Notes in Computer Science, 2265. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Graph Drawing: 9th International Symposium, GD 2001 to cart. $120.33, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2002 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 528 p. Contains: Unspecified. Lecture Notes in Computer Science, 2265. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.