William J. Lenhart

Theor. Comput. Sci., September, 2023

Drawing Partial 2-Trees with Few Slopes.

[BibT_eX]

[DOI]

Algorithmica, May, 2023

Mutual Witness Proximity Drawings of Isomorphic Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2021

(k, p)-planarity: A relaxation of hybrid planarity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Packing Trees into 1-planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

2020

Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Rounding Meshes in 3D.

[BibT_eX]

[DOI]

Olivier Devillers

Discret. Comput. Geom., 2020

2019

On the edge-length ratio of outerplanar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

(k, p)-Planarity: A Relaxation of Hybrid Planarity.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2018

(k, p)-Planarity: A Generalization of Hybrid Planarity.

[BibT_eX]

[DOI]

CoRR, 2018

3D Snap Rounding.

[BibT_eX]

[DOI]

Olivier Devillers

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

On partitioning the edges of 1-plane graphs.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Theor. Comput. Sci., 2017

2015

On Partitioning the Edges of 1-Planar Graphs.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

CoRR, 2015

2014

Bar 1-Visibility Graphs vs. other Nearly Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

2013

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

On point-sets that support planar graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Planar and Plane Slope Number of Partial 2-Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

Point-Set Embeddability of 2-Colored Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

On Representing Graphs by Touching Cuboids.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2009

On the degree of standard geometric predicates for line transversals in 3D.

[BibT_eX]

[DOI]

Comput. Geom., 2009

2006

Predicates for Line Transversals in 3D.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2004

Bichromatic P4-composition schemes for perfect orderability.

[BibT_eX]

[DOI]

Ryan B. Hayward

Discret. Appl. Math., 2004

2002

The drawability problem for minimum weight triangulations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2001

Perfectly Orderable P4 Composition.

[BibT_eX]

[DOI]

Ryan B. Hayward

Electron. Notes Discret. Math., 2001

2000

Minimum Weight Drawings of Maximal Triangulations (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1997

Drawable and Forbidden Minimum Weight Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Hamiltonian Cycles in Solid Grid Graphs.

[BibT_eX]

[DOI]

Christopher Umans

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Drawing Outerplanar Minimum Weight Triangulations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

Characterizing Proximity Trees.

[BibT_eX]

[DOI]

Prosenjit Bose

Algorithmica, 1996

Proximity Drawings of Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995

Reconfigurating Closed Polygonal Chains in Euclidean d-Space.

[BibT_eX]

[DOI]

Sue Whitesides

Discret. Comput. Geom., 1995

How to Draw Outerplanar Minimum Weight Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994

Proximity Constraints and Representable Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Proximity Drawability: a Survey.

[BibT_eX]

[DOI]

Giuseppe Di Battista

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

An art gallery theorem for line segments in the plane.

[BibT_eX]

[DOI]

George F. Jennings

Pattern Recognit. Lett., 1993

Dominance Drawings of Bipartite Graphs.

[BibT_eX]

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1990

On the P4-structure of Perfect Graphs. IV. Partner graphs.

[BibT_eX]

[DOI]

Ryan B. Hayward

J. Comb. Theory B, 1990

Two-colourings that decompose perfect graphs.

[BibT_eX]

[DOI]

Vasek Chvátal