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="Klostermeyer, William"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximum orbit weights in the
\sigma
-game and lit-only
\sigma
-game on grids and graphs
John L. Goldwasser
,
William F. Klostermeyer
Graphs and Combinatorics
25
(3), 2009, pp. 309-326
Fibonacci polynomials and parity domination in grid graphs
John Goldwasser
,
William Klostermeyer
,
Henry Ware
Graphs and Combinatorics
18
(2), 2002, pp. 271-283
n
-tuple coloring of planar graphs with large odd girth
William Klostermeyer
,
Cun Quan Zhang
Graphs and Combinatorics
18
(1), 2002, pp. 119-132
(2+\epsilon)
-coloring of planar graphs with large odd-girth
William Klostermeyer
,
Cun Quan Zhang
Journal of Graph Theory
33
(2), 2000, pp. 109-119
Hamiltonicity and reversing arcs in digraphs
William F. Klostermeyer
,
L̑ubomír S̑oltés
Journal of Graph Theory
28
(1), 1998, pp. 13-30
Scheduling two salesmen in a network
William F. Klostermeyer
International Journal of Foundations of Computer Science
7
(4), 1996, pp. 353-358
Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs
Kenneth Luo
,
William Klostermeyer
,
Yuan-Chieh Chow
,
Richard Newman-Wolfe
Information Processing Letters
38
, 1991, pp. 307-313