Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Lenhart, William"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On representing graphs by touching cuboids
David Bremner
,
William Evans
,
Fabrizio Frati
,
Laurie Heyer
,
Stephen G. Kobourov
,
William J. Lenhart
,
Giuseppe Liotta
,
David Rappaport
,
Sue H. Whitesides
Lecture Notes in Computer Science
7704
, 2013, pp. 187-198
Point-set embeddability of 2-colored trees
Fabrizio Frati
,
Marc Glisse
,
William J. Lenhart
,
Giuseppe Liotta
,
Tamara Mchedlidze
,
Rahmuma Islam Nishat
Lecture Notes in Computer Science
7704
, 2013, pp. 291-302
Planar and plane slope number of partial 2-trees
William Lenhart
,
Giuseppe Liotta
,
Debajyoti Mondal
,
Rahnuma Islam Nishat
Lecture Notes in Computer Science
8242
, 2013, pp. 412-423
On point-sets that support planar graphs
Vida Dujmovic
,
William Evans
,
Sylvain Lazard
,
William Lenhart
,
Giuseppe Liotta
,
David Rappaport
,
Stephen Wismath
Lecture Notes in Computer Science
7034
, 2012, pp. 64-74
The drawability problem for minimum weight triangulation
William Lenhart
,
Giuseppe Liotta
Theoretical Computer Science
270
(1-2), 2002, pp. 261-286
Minimum weight drawings of maximal triangulations
William Lenhart
,
Giuseppe Liotta
Lecture Notes in Computer Science
1984
, 2001, pp. 338-349
Drawable and forbidden minimum weight triangulations
William Lenhart
,
Giuseppe Liotta
Lecture Notes in Computer Science
1353
, 1998, pp. 1-12
Proximity drawings of outerplanar graphs
William Lenhart
,
Giuseppe Liotta
Lecture Notes in Computer Science
1190
, 1997, pp. 286-302
Hamiltonian cycles in solid grid graphs
Christopher Umans
,
William Lenhart
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 496-505
Drawing outerplanar minimum weight triangulations
William Lenhart
,
Giuseppe Liotta
Information Processing Letters
57
(5), 1996, pp. 253-260
How to draw outerplanar minimum weight triangulations
William Lenhart
,
Giuseppe Liotta
Lecture Notes in Computer Science
1027
, 1996, pp. 373-384
Proximity constraints and representable trees
Prosenjit Bose
,
Giuseppe Di Battista
,
William Lenhart
,
Giuseppe Liotta
Proceedings of the DIMACS International Workshop, GD'94. Graph Drawing (Princeton, New Jersey, USA, October 10-12, 1994)
LNCS 894
, 1995, pp. 340-351
Proximity drawability: A survey
Giuseppe Di Battista
,
William Lenhart
,
Giuseppe Liotta
Proceedings of the DIMACS International Workshop, GD'94. Graph Drawing (Princeton, New Jersey, USA, October 10-12, 1994)
LNCS 894
, 1995, pp. 328-339
Two-colourings that decompose perfect graphs
Vas̑ek Chvátal
,
William J. Lenhart
,
Najiba Sbihi
Journal of Combinatorial Theory Series B
49
, 1990, pp. 1-9
On the
P_4
-structure of perfect graphs. IV. Partner graphs
Ryan B. Hayward
,
William J. Lenhart
Journal of Combinatorial Theory Series B
48
, 1990, pp. 135-139