Buy Graph Drawing Book by David Eppstein - Bookswagon
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Maths for computer scientists > Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers(5849 Lecture Notes in Computer Science)
Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers(5849 Lecture Notes in Computer Science)

Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers(5849 Lecture Notes in Computer Science)


     0     
5
4
3
2
1



International Edition


X
About the Book

The 17th International Symposium on Graph Drawing (GD 2009) was held in Chicago, USA, September 22-25, 2009, and was attended by 91 participants from 19 countries. In response to the call for papers, the Program Committee received 79 s- missions. Each submission was reviewed by at least three Program Committee members. Following substantial discussions, the committee accepted 31 long - pers and 4 short papers. All authors received detailed reviewers' comments. In a separate submission process, 10 posters were accepted. These were described during the conference,and displayedatthe conferencesite. Eachposter was also granted a two-page description in the conference proceedings. Two invited speakers, J' anos Pach from EPFL Lausanne and R' eny Institute, and Martin Wattenberg from IBM Research, gave absorbing talks during the conference. Prof. Pach looked at the class of string graphs, and tantalized us to consider why their properties are so mathematically beautiful. Dr. Watt- berg showed how sometimes twisting the standard rules of graph drawing can illuminate unexpected information contained in graphs. Keepingwithtradition,the symposiumhostedthe 15thAnnualGraphDr- ingContest,including aGraphDrawingChallengeforconferenceattendees.The contest elicited robust participation from the community with 27 submissions. These proceedings end with a detailed report of the contest. As always, the success of a conference such as this relies on the help of many people. Our thanks to the Program Committee and all of the external referees who worked so hard to sift for the best among the submitted papers. The OrganizingCommittee providedus with admirablefacilities,a ?ne banquet, andtookcareofsomanyotherdetailsthatitwashardtobelievetherewereonly threemembers:Jennifer McClelland,MichaelJ.PelsmajerandMarcusSchaefer.

Table of Contents:
Invited Talks.- Why Are String Graphs So Beautiful?.- The Art of Cheating When Drawing a Graph.- Papers.- Drawing Hamiltonian Cycles with No Large Angles.- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings.- On the Perspectives Opened by Right Angle Crossing Drawings.- Drawing 3-Polytopes with Good Vertex Resolution.- Planar Drawings of Higher-Genus Graphs.- Splitting Clusters to Get C-Planarity.- On the Characterization of Level Planar Trees by Minimal Patterns.- Characterization of Unlabeled Radial Level Planar Graphs.- Upward Planarization Layout.- More Flexible Radial Layout.- WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations.- Port Constraints in Hierarchical Layout of Data Flow Diagrams.- Fast Edge-Routing for Large Graphs.- Leftist Canonical Ordering.- Succinct Greedy Drawings Do Not Always Exist.- Geometric Simultaneous Embeddings of a Graph and a Matching.- Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs.- Removing Independently Even Crossings.- Manhattan-Geodesic Embedding of Planar Graphs.- Orthogonal Connector Routing.- On Rectilinear Drawing of Graphs.- Semi-bipartite Graph Visualization for Gene Ontology Networks.- On Open Problems in Biological Network Visualization.- A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View.- Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs.- Drawing Trees in a Streaming Model.- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.- Drawing Planar 3-Trees with Given Face-Areas.- 3D Visibility Representations by Regular Polygons.- Complexity of Some Geometric and Topological Problems.- On Planar Supports for Hypergraphs.- DAGmaps and ?-Visibility Representations ofDAGs.- Drawing Directed Graphs Clockwise.- An Improved Algorithm for the Metro-line Crossing Minimization Problem.- Layout with Circular and Other Non-linear Constraints Using Procrustes Projection.- Posters.- GMap: Drawing Graphs as Maps.- Using High Dimensions to Compare Drawings of Graphs.- On ?-Constrained Upward Topological Book Embeddings.- 4-Labelings and Grid Embeddings of Plane Quadrangulations.- IBM ILOG Graph Layout for Eclipse.- Layout Techniques Coupled with Web2.0-Based Business Process Modeling.- Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles.- Visualization of Complex BPEL Models.- DAGmaps and Dominance Relationships.- Scaffold Hunter – Interactive Exploration of Chemical Space.- Graph Drawing Contest.- Graph Drawing Contest Report.


Best Sellers


Product Details
  • ISBN-13: 9783642118043
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 426
  • Returnable: Y
  • Series Title: 5849 Lecture Notes in Computer Science
  • Width: 155 mm
  • ISBN-10: 3642118046
  • Publisher Date: 24 Mar 2010
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 5849 Lecture Notes in Computer Science
  • Sub Title: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers(5849 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers(5849 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers(5849 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!