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
[1]
Hilfe
Suche: Author="Lenhart, William J."
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
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