William Lenhart - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2021

Packing Trees into 1-planar GraphsFelice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath. jgaa, 25(2):605-624, 2021. [doi]

2020

Packing Trees into 1-Planar GraphsFelice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath. walcom 2020: 81-93 [doi]

2017

On the Edge-Length Ratio of Outerplanar GraphsSylvain Lazard, William Lenhart, Giuseppe Liotta. gd 2018: 17-23 [doi]

2014

Bar 1-Visibility Graphs vs. other Nearly Planar GraphsWilliam S. Evans, Michael Kaufmann 0001, William Lenhart, Tamara Mchedlidze, Stephen K. Wismath. jgaa, 18(5):721-739, 2014. [doi]

2013

On point-sets that support planar graphsVida Dujmovic, William S. Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath. comgeo, 46(1):29-50, 2013. [doi]

Planar and Plane Slope Number of Partial 2-TreesWilliam Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat. gd 2013: 412-423 [doi]

2011

On Point-Sets That Support Planar GraphsVida Dujmovic, William S. Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath. gd 2012: 64-74 [doi]

2009

On the degree of standard geometric predicates for line transversals in 3DHazel Everett, Sylvain Lazard, William Lenhart, Linqiao Zhang. comgeo, 42(5):484-494, 2009. [doi]

2002

The drawability problem for minimum weight triangulationsWilliam Lenhart, Giuseppe Liotta. TCS, 270(1-2):261-286, 2002. [doi]

2000

Minimum Weight Drawings of Maximal Triangulations (Extended Abstract)William Lenhart, Giuseppe Liotta. gd 2001: 338-349 [doi]

1997

Drawable and Forbidden Minimum Weight TriangulationsWilliam Lenhart, Giuseppe Liotta. gd 1997: 1-12

Hamiltonian Cycles in Solid Grid GraphsChristopher Umans, William Lenhart. focs 1997: 496-505 [doi]

1996

Characterizing Proximity TreesProsenjit Bose, William Lenhart, Giuseppe Liotta. algorithmica, 16(1):83-110, 1996.

Drawing Outerplanar Minimum Weight TriangulationsWilliam Lenhart, Giuseppe Liotta. ipl, 57(5):253-260, 1996. [doi]

Proximity Drawings of Outerplanar GraphsWilliam Lenhart, Giuseppe Liotta. gd 1997: 286-302

1995

Reconfigurating Closed Polygonal Chains in Euclidean d-SpaceWilliam Lenhart, Sue Whitesides. dcg, 13:123-140, 1995.

How to Draw Outerplanar Minimum Weight TriangulationsWilliam Lenhart, Giuseppe Liotta. gd 1996: 373-384

1994

Proximity Drawability: a SurveyGiuseppe Di Battista, William Lenhart, Giuseppe Liotta. gd 1995: 328-339

Proximity Constraints and Representable TreesProsenjit Bose, Giuseppe Di Battista, William Lenhart, Giuseppe Liotta. gd 1995: 340-351

1993

Dominance Drawings of Bipartite GraphsHossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides. cccg 1993: 187-191

1988

Computing the Link Center of a Simple PolygonWilliam Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. dcg, 3:281-293, 1988.

1987

Computing the Link Center of a Simple PolygonWilliam Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. compgeom 1987: 1-10 [doi]

Sign in or sign up to see more results.

runs on WebDSL