Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Graph-Theoretic Concepts in Computer Science: 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers > Drawing Planar Graphs on a Curve
Graph-Theoretic Concepts in Computer Science: 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers |
Hans L. Bodlaender
Springer Berlin Heidelberg
Graph-Theoretic Concepts in Computer Science: 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers
Drawing Planar Graphs on a Curve
Authors

E. Di Giacomo; W. Didimo; G. Liotta; S. K. Wismath

ARI Id

1664793875038_3247608

Access

Not Available Free

Pages

192-204

DOI

10.1007/978-3-540-39890-5_17

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-39890-5_17

Table of Contents of Book
Showing 1 to 20 of 35 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT
Michael R. Fellows
1-12
Matching, Edge-Colouring, and Dimers
Alexander Schrijver
13-22
Minimum Flow Time Graph Ordering
Claudio Arbib; Michele Flammini; Fabrizio Marinelli
23-33
Searching Is Not Jumping
Lali Barrière; Pierre Fraigniaud; Nicola Santoro; Dimitrios M. Thilikos
34-45
Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars
Simon M. Becker; Bernhard Westfechtel
46-57
The Minimum Degree Heuristic and the Minimal Triangulation Process
Anne Berry; Pinar Heggernes; Geneviève Simonet
58-70
Generalized Parametric Multi-terminal Flows Problem
Pascal Berthomé; Madiagne Diallo; Afonso Ferreira
71-80
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation
Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse
81-92
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes
Paul Bonsma
93-105
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
Andreas Brandstädt; Feodor F. Dragan; Hoang-Oanh Le; Van Bang Le; Ryuhei Uehara
106-118
A Simple Linear Time LexBFS Cograph Recognition Algorithm
Anna Bretscher; Derek Corneil; Michel Habib; Christophe Paul
119-130
Backbone Colorings for Networks
Hajo Broersma; Fedor V. Fomin; Petr A. Golovach; Gerhard J. Woeginger
131-142
Greedy Edge-Disjoint Paths in Complete Graphs
Paz Carmi; Thomas Erlebach; Yoshio Okamoto
143-155
Graph-Based Approaches to Software Watermarking
Christian Collberg; Stephen Kobourov; Edward Carter; Clark Thomborson
156-167
Completely Connected Clustered Graphs
Sabine Cornelsen; Dorothea Wagner
168-179
An FPT Algorithm for Set Splitting
Frank Dehne; Michael R. Fellows; Frances A. Rosamond
180-191
Drawing Planar Graphs on a Curve
E. Di Giacomo; W. Didimo; G. Liotta; S. K. Wismath
192-204
Tree-Partitions of k-Trees with Applications in Graph Layout
Vida Dujmović; David R. Wood
205-217
Resource Allocation Problems in Multifiber WDM Tree Networks
Thomas Erlebach; Aris Pagourtzis; Katerina Potika; Stamatis Stefanakos
218-229
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 35 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings