William J. Lenhart

54 papers A* 2A 14B 2Journal 31Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Simultaneous Embedding of Two Paths on the Grid.
CoRR
Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Daniel Perz, Pavel Valtr, Johannes Zink
2025 A conf
Separability of Witness Gabriel Drawings.
GD
Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta
2024 — conf
On 3-layered Cornerhedra: Optimum Box Partitions for Niches.
CCCG
Ulrike Stege, Sue Whitesides, Laurie J. Heyer, William J. Lenhart
2024 J jnl
On the complexity of the storyplan problem.
J. Comput. Syst. Sci.
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
2023 J jnl
Drawing Partial 2-Trees with Few Slopes.
Algorithmica
William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat
2023 — conf
Mutual Witness Proximity Drawings of Isomorphic Trees.
GD (1)
Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta
2023 J jnl
Mutual Witness Proximity Drawings of Isomorphic Trees.
CoRR
Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta
2023 J jnl
Mutual witness Gabriel drawings of complete bipartite graphs.
Theor. Comput. Sci.
William J. Lenhart, Giuseppe Liotta
2022 A conf
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs.
GD
William J. Lenhart, Giuseppe Liotta
2022 J jnl
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs.
CoRR
William J. Lenhart, Giuseppe Liotta
2022 A conf
On the Complexity of the Storyplan Problem.
GD
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
2022 J jnl
On the Complexity of the Storyplan Problem.
CoRR
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
2021 J jnl
(
Theor. Comput. Sci.
Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini
2021 J jnl
Packing Trees into 1-planar Graphs.
J. Graph Algorithms Appl.
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
2020 J jnl
Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94].
Theor. Comput. Sci.
Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
2020 B conf
Packing Trees into 1-Planar Graphs.
WALCOM
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
2020 J jnl
Rounding Meshes in 3D.
Discret. Comput. Geom.
Olivier Devillers, Sylvain Lazard, William J. Lenhart
2019 B conf
(k, p)-Planarity: A Relaxation of Hybrid Planarity.
WALCOM
Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini
2019 J jnl
On the edge-length ratio of outerplanar graphs.
Theor. Comput. Sci.
Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
2019 J jnl
Packing Trees into 1-planar Graphs.
CoRR
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
2018 J jnl
(k, p)-Planarity: A Generalization of Hybrid Planarity.
CoRR
Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini
2018 A* conf
3D Snap Rounding.
SoCG
Olivier Devillers, Sylvain Lazard, William J. Lenhart
2017 J jnl
On partitioning the edges of 1-plane graphs.
Theor. Comput. Sci.
William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani
2017 A conf
On the Edge-Length Ratio of Outerplanar Graphs.
GD
Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
2017 J jnl
On the Edge-length Ratio of Outerplanar Graphs.
CoRR
Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
2015 J jnl
On Partitioning the Edges of 1-Planar Graphs.
CoRR
William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani
2014 J jnl
Bar 1-Visibility Graphs vs. other Nearly Planar Graphs.
J. Graph Algorithms Appl.
William S. Evans, Michael Kaufmann, William J. Lenhart, Tamara Mchedlidze, Stephen K. Wismath
2013 J jnl
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs.
CoRR
William S. Evans, Michael Kaufmann, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Stephen K. Wismath
2013 J jnl
On point-sets that support planar graphs.
Comput. Geom.
Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
2013 A conf
Planar and Plane Slope Number of Partial 2-Trees.
GD
William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat
2012 A conf
On Representing Graphs by Touching Cuboids.
GD
David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides
2012 A conf
Point-Set Embeddability of 2-Colored Trees.
GD
Fabrizio Frati, Marc Glisse, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat
2011 A conf
On Point-Sets That Support Planar Graphs.
GD
Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
2009 J jnl
On the degree of standard geometric predicates for line transversals in 3D.
Comput. Geom.
Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang
2006 — conf
Predicates for Line Transversals in 3D.
CCCG
Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang
2004 J jnl
Bichromatic P
Discret. Appl. Math.
Ryan B. Hayward, William J. Lenhart
2002 J jnl
The drawability problem for minimum weight triangulations.
Theor. Comput. Sci.
William J. Lenhart, Giuseppe Liotta
2001 J jnl
Perfectly Orderable P
Electron. Notes Discret. Math.
Ryan B. Hayward, William J. Lenhart
2000 A conf
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract).
GD
William J. Lenhart, Giuseppe Liotta
1997 A conf
Drawable and Forbidden Minimum Weight Triangulations.
GD
William J. Lenhart, Giuseppe Liotta
1997 A* conf
Hamiltonian Cycles in Solid Grid Graphs.
FOCS
Christopher Umans, William J. Lenhart
1996 J jnl
Characterizing Proximity Trees.
Algorithmica
Prosenjit Bose, William J. Lenhart, Giuseppe Liotta
1996 J jnl
Drawing Outerplanar Minimum Weight Triangulations.
Inf. Process. Lett.
William J. Lenhart, Giuseppe Liotta
1996 A conf
Proximity Drawings of Outerplanar Graphs.
GD
William J. Lenhart, Giuseppe Liotta
1995 A conf
How to Draw Outerplanar Minimum Weight Triangulations.
GD
William J. Lenhart, Giuseppe Liotta
1995 J jnl
Reconfigurating Closed Polygonal Chains in Euclidean d-Space.
Discret. Comput. Geom.
William J. Lenhart, Sue Whitesides
1994 A conf
Proximity Constraints and Representable Trees.
GD
Prosenjit Bose, Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta
1994 A conf
Proximity Drawability: a Survey.
GD
Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta
1993 J jnl
An art gallery theorem for line segments in the plane.
Pattern Recognit. Lett.
George F. Jennings, William J. Lenhart
1993 — conf
Dominance Drawings of Bipartite Graphs.
CCCG
Hossam A. ElGindy, Michael E. Houle, William J. Lenhart, Mirka Miller, David Rappaport, Sue Whitesides
1990 J jnl
On the
J. Comb. Theory B
Ryan B. Hayward, William J. Lenhart
1990 J jnl
Two-colourings that decompose perfect graphs.
J. Comb. Theory B
Vasek Chvátal, William J. Lenhart, Najiba Sbihi
1988 J jnl
Computing the Link Center of a Simple Polygon.
Discret. Comput. Geom.
William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1987 — conf
Computing the Link Center of a Simple Polygon.
SCG
William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap