default search action
William J. Lenhart
Person information
- affiliation: Williams College, Williamstown, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg
, Antonios Symvonis:
On the complexity of the storyplan problem. J. Comput. Syst. Sci. 139: 103466 (2024) - 2023
- [j21]William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat
Drawing Partial 2-Trees with Few Slopes. Algorithmica 85(5): 1156-1175 (2023) - [j20]William J. Lenhart, Giuseppe Liotta
Mutual witness Gabriel drawings of complete bipartite graphs. Theor. Comput. Sci. 974: 114115 (2023) - [c21]Carolina Haase
Mutual Witness Proximity Drawings of Isomorphic Trees. GD (1) 2023: 304-319 - [i8]Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta:
Mutual Witness Proximity Drawings of Isomorphic Trees. CoRR abs/2309.01463 (2023) - 2022
- [c20]William J. Lenhart
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs. GD 2022: 25-39 - [c19]Carla Binucci
On the Complexity of the Storyplan Problem. GD 2022: 304-318 - [i7]Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis:
On the Complexity of the Storyplan Problem. CoRR abs/2209.00453 (2022) - [i6]William J. Lenhart, Giuseppe Liotta:
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs. CoRR abs/2209.01004 (2022) - 2021
- [j19]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini
Packing Trees into 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 605-624 (2021) - [j18]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini
(k, p)-planarity: A relaxation of hybrid planarity. Theor. Comput. Sci. 896: 19-30 (2021) - 2020
- [j17]Olivier Devillers, Sylvain Lazard, William J. Lenhart:
Rounding Meshes in 3D. Discret. Comput. Geom. 64(1): 37-62 (2020) - [j16]Sylvain Lazard, William J. Lenhart, Giuseppe Liotta:
Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94]. Theor. Comput. Sci. 806: 689 (2020) - [c18]Felice De Luca
Packing Trees into 1-Planar Graphs. WALCOM 2020: 81-93
2010 – 2019
- 2019
- [j15]Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
On the edge-length ratio of outerplanar graphs. Theor. Comput. Sci. 770: 88-94 (2019) - [c17]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini
(k, p)-Planarity: A Relaxation of Hybrid Planarity. WALCOM 2019: 148-159 - [i5]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. CoRR abs/1911.01761 (2019) - 2018
- [c16]Olivier Devillers, Sylvain Lazard, William J. Lenhart:
3D Snap Rounding. SoCG 2018: 30:1-30:14 - [i4]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini:
(k, p)-Planarity: A Generalization of Hybrid Planarity. CoRR abs/1806.11413 (2018) - 2017
- [j14]William J. Lenhart
On partitioning the edges of 1-plane graphs. Theor. Comput. Sci. 662: 59-65 (2017) - [c15]Sylvain Lazard, William J. Lenhart, Giuseppe Liotta:
On the Edge-Length Ratio of Outerplanar Graphs. GD 2017: 17-23 - [i3]Sylvain Lazard, William J. Lenhart, Giuseppe Liotta:
On the Edge-length Ratio of Outerplanar Graphs. CoRR abs/1709.00043 (2017) - 2015
- [i2]William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani:
On Partitioning the Edges of 1-Planar Graphs. CoRR abs/1511.07303 (2015) - 2014
- [j13]William S. Evans, Michael Kaufmann, William J. Lenhart, Tamara Mchedlidze
Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. J. Graph Algorithms Appl. 18(5): 721-739 (2014) - 2013
- [j12]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
On point-sets that support planar graphs. Comput. Geom. 46(1): 29-50 (2013) - [c14]William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat
Planar and Plane Slope Number of Partial 2-Trees. GD 2013: 412-423 - [i1]William S. Evans, Michael Kaufmann, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Stephen K. Wismath:
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. CoRR abs/1312.5520 (2013) - 2012
- [c13]David Bremner, William S. Evans, Fabrizio Frati
On Representing Graphs by Touching Cuboids. GD 2012: 187-198 - [c12]Fabrizio Frati
Point-Set Embeddability of 2-Colored Trees. GD 2012: 291-302 - 2011
- [c11]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
On Point-Sets That Support Planar Graphs. GD 2011: 64-74
2000 – 2009
- 2009
- [j11]Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang:
On the degree of standard geometric predicates for line transversals in 3D. Comput. Geom. 42(5): 484-494 (2009) - 2006
- [c10]Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang:
Predicates for Line Transversals in 3D. CCCG 2006 - 2004
- [j10]Ryan B. Hayward, William J. Lenhart:
Bichromatic P4-composition schemes for perfect orderability. Discret. Appl. Math. 141(1-3): 161-183 (2004) - 2002
- [j9]William J. Lenhart, Giuseppe Liotta
The drawability problem for minimum weight triangulations. Theor. Comput. Sci. 270(1-2): 261-286 (2002) - 2001
- [j8]Ryan B. Hayward, William J. Lenhart:
Perfectly Orderable P4 Composition. Electron. Notes Discret. Math. 7: 190-193 (2001) - 2000
- [c9]William J. Lenhart, Giuseppe Liotta:
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). GD 2000: 338-349
1990 – 1999
- 1997
- [c8]Christopher Umans, William J. Lenhart:
Hamiltonian Cycles in Solid Grid Graphs. FOCS 1997: 496-505 - [c7]William J. Lenhart, Giuseppe Liotta:
Drawable and Forbidden Minimum Weight Triangulations. GD 1997: 1-12 - 1996
- [j7]Prosenjit Bose, William J. Lenhart, Giuseppe Liotta:
Characterizing Proximity Trees. Algorithmica 16(1): 83-110 (1996) - [j6]William J. Lenhart, Giuseppe Liotta
Drawing Outerplanar Minimum Weight Triangulations. Inf. Process. Lett. 57(5): 253-260 (1996) - [c6]William J. Lenhart, Giuseppe Liotta:
Proximity Drawings of Outerplanar Graphs. GD 1996: 286-302 - 1995
- [j5]William J. Lenhart, Sue Whitesides:
Reconfigurating Closed Polygonal Chains in Euclidean d-Space. Discret. Comput. Geom. 13: 123-140 (1995) - [c5]William J. Lenhart, Giuseppe Liotta:
How to Draw Outerplanar Minimum Weight Triangulations. GD 1995: 373-384 - 1994
- [c4]Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta:
Proximity Drawability: a Survey. GD 1994: 328-339 - [c3]Prosenjit Bose
Proximity Constraints and Representable Trees. GD 1994: 340-351 - 1993
- [j4]George F. Jennings, William J. Lenhart:
An art gallery theorem for line segments in the plane. Pattern Recognit. Lett. 14(9): 727-732 (1993) - [c2]Hossam A. ElGindy, Michael E. Houle, William J. Lenhart, Mirka Miller, David Rappaport, Sue Whitesides:
Dominance Drawings of Bipartite Graphs. CCCG 1993: 187-191 - 1990
- [j3]Ryan B. Hayward, William J. Lenhart:
On the P4-structure of Perfect Graphs. IV. Partner graphs. J. Comb. Theory B 48(1): 135-139 (1990) - [j2]Vasek Chvátal, William J. Lenhart, Najiba Sbihi:
Two-colourings that decompose perfect graphs. J. Comb. Theory B 49(1): 1-9 (1990)
1980 – 1989
- 1988
- [j1]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack
Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 3: 281-293 (1988) - 1987
- [c1]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. SCG 1987: 1-10
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: