Author of the publication

Tight Bounds on Maximal and Maximum Matchings.

, , , , and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 308-319. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Optimal Orthogonal Drawings of Triconnected Plane Graphs.. SWAT, volume 1097 of Lecture Notes in Computer Science, page 333-344. Springer, (1996)Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections., , and . FSTTCS, volume 4855 of Lecture Notes in Computer Science, page 400-411. Springer, (2007)Bounds for Orthogonal 3-D Graph Drawing., , , and . J. Graph Algorithms Appl., 3 (4): 63-79 (1999)Bounded-Degree Independent Sets in Planar Graphs., and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 416-427. Springer, (2002)Reconstructing Polygons from Scanner Data., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 862-871. Springer, (2009)1-bend 3-D orthogonal drawings: two open problems solved.. CCCG, (2000)Rectangle of Influence Drawings of Graphs without Filled 3-Cycles., , and . GD, volume 1731 of Lecture Notes in Computer Science, page 359-368. Springer, (1999)New Lower Bounds for Orthogonal Graph Drawings.. GD, volume 1027 of Lecture Notes in Computer Science, page 28-39. Springer, (1995)The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing., , and . GD, volume 1353 of Lecture Notes in Computer Science, page 391-402. Springer, (1997)Orthogonal 3-D Graph Drawing., , , and . GD, volume 1353 of Lecture Notes in Computer Science, page 76-86. Springer, (1997)