Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	William J.
Last name:	Lenhart
DBLP:	l/WilliamJLenhart
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 25  

Select a publication
Show	Title	Venue	Rating	Date
	Journal article Vida Dujmovic, William Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath. On point-sets that support planar graphs.	Comput. Geom. 2013, Volume 46	(0)	2013
	Conference paper Fabrizio Frati, Marc Glisse, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat. Point-Set Embeddability of 2-Colored Trees.	Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers 2013	(0)	2012
	Conference paper David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides. On Representing Graphs by Touching Cuboids.	Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers 2013	(0)	2012
	Conference paper Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath. On Point-Sets That Support Planar Graphs.	Graph Drawing - 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011, Revised Selected Papers 2012	(0)	2011
	Conference paper Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang. On the degree of standard geometric predicates for line transversals in 3D.	Comput. Geom. 2009, Volume 42	(0)	2009
	Conference paper Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang. Predicates for Line Transversals in 3D.	Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006, August 14-16, 2006, Queen's University, Ontario, Canada 2006	(0)	2006
	Conference paper Ryan B. Hayward, William J. Lenhart. Bichromatic P	Discrete Applied Mathematics 2004, Volume 141	(0)	2004
	Conference paper William J. Lenhart, Giuseppe Liotta. The drawability problem for minimum weight triangulations.	Theor. Comput. Sci. 2002, Volume 270	(0)	2002
	Conference paper Ryan B. Hayward, William J. Lenhart. Perfectly Orderable P	Electronic Notes in Discrete Mathematics 2001, Volume 7	(0)	2001
	Conference paper William J. Lenhart, Giuseppe Liotta. Minimum Weight Drawings of Maximal Triangulations (Extended Abstract).	Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings 2001	(0)	2000
	Conference paper Christopher Umans, William J. Lenhart. Hamiltonian Cycles in Solid Grid Graphs.	FOCS 1997	(0)	1997
	Conference paper William J. Lenhart, Giuseppe Liotta. Drawable and Forbidden Minimum Weight Triangulations.	Graph Drawing, 5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997, Proceedings 1997	(0)	1997
	Conference paper William J. Lenhart, Giuseppe Liotta. Proximity Drawings of Outerplanar Graphs.	Graph Drawing, Symposium on Graph Drawing, GD '96, Berkeley, California, USA, September 18-20, Proceedings 1997	(0)	1996
	Conference paper Prosenjit Bose, William J. Lenhart, Giuseppe Liotta. Characterizing Proximity Trees.	Algorithmica 1996, Volume 16	(0)	1996
	Conference paper William J. Lenhart, Giuseppe Liotta. Drawing Outerplanar Minimum Weight Triangulations.	Inf. Process. Lett. 1996, Volume 57	(0)	1996
	Conference paper William J. Lenhart, Giuseppe Liotta. How to Draw Outerplanar Minimum Weight Triangulations.	Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, Germany, September 20-22, 1995, Proceedings 1996	(0)	1995
	Conference paper William J. Lenhart, Sue Whitesides. Reconfigurating Closed Polygonal Chains in Euclidean d-Space.	Discrete Computational Geometry 1995, Volume 13	(0)	1995
	Conference paper Prosenjit Bose, Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta. Proximity Constraints and Representable Trees.	Graph Drawing, DIMACS International Workshop, GD '94, Princeton, New Jersey, USA, October 10-12, 1994, Proceedings 1995	(0)	1994
	Conference paper Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta. Proximity Drawability: a Survey.	Graph Drawing, DIMACS International Workshop, GD '94, Princeton, New Jersey, USA, October 10-12, 1994, Proceedings 1995	(0)	1994
	Conference paper Hossam A. ElGindy, Michael E. Houle, William J. Lenhart, Mirka Miller, David Rappaport, Sue Whitesides. Dominance Drawings of Bipartite Graphs.	CCCG 1993	(0)	1993
	Conference paper George F. Jennings, William J. Lenhart. An art gallery theorem for line segments in the plane.	Pattern Recognition Letters 1993, Volume 14	(0)	1993
	Conference paper Vasek Chvátal, William J. Lenhart, Najiba Sbihi. Two-colourings that decompose perfect graphs.	J. Comb. Theory, Ser. B 1990, Volume 49	(0)	1990
	Conference paper Ryan B. Hayward, William J. Lenhart. On the	J. Comb. Theory, Ser. B 1990, Volume 48	(0)	1990
	Conference paper 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.	Discrete Computational Geometry 1988, Volume 3	(0)	1988
	Conference paper 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.	Symposium on Computational Geometry 1987	(0)	1987

Show item 1 to 25 of 25  

Your query returned 25 matches in the database.