Publikationen
|
 |
|
Bitte wählen Sie ein Jahr aus
|
 |
| 2007 | 2006 | 2005 | 2004 | 2003 |
 |
| 2002 | 2001 | 2000 | 1999 | 1998 |
 |
| 1997 | 1996 | 1995 | 1994 | 1993 |
 |
| 1992 | 1991 | 1990 | 1989 | 1988 |
 |
| 1987 | 1986 | 1985 | 1984 | 1983 |
 |
| 1982 | 1980 | 1979 | | |
 |
 |
 |
| Liste aller Publikationen |
 |
 |
 |
| Publikationen des Jahres 2002 |
 |
|
Schwikowski, B., Speckenmeyer, E.
|
 |
| On Computing all Minimal Solutions for Feedback Problems |
 |
| Discrete Appl. Math. 117, 253-265 (2002) |
 |
 |
 |
 |
|
Porschen, S.
|
 |
|
On Generalizations of the Shadow Independent Set Problem
|
 |
|
accepted for publication in Discrete Math.,
Technical Report: zaik2004-461, Universität zu Köln (2002)
|
 |
 |
 |
 |
|
Joisten, M.
|
 |
|
Simulation von Fahrplänen für den ÖPNV mittels Zellularautomaten
|
 |
| 2002, Universität zu Köln, Diplomarbeit (2002) |
 |
 |
 |
 |
|
Mellin, S.
|
 |
|
Polynomielle Färbungsalgorithmen für Pk-freie Graphen
|
 |
| 2002, Universität zu Köln, Diplomarbeit (2002) |
 |
 |
 |
 |
|
Meisgen, F., Speckenmeyer, E.
|
 |
|
A Dynamic Load Balancing Algorithmus with Adjustable Degree of Imbalance on Heterogeneous Network
|
 |
|
6th Workshop on Parallel Systems and Algorithms (PASA 2002), Karlsruhe, VDE, 161-168 (2002)
|
 |
 |
 |
 |
|
Porschen, S., Randerath, B., Speckenmeyer, E.
|
 |
|
Exact 3-Satisfiability is decidable in time 0(20.16254n)
|
 |
|
accepted for publication in: Annals of Mathematics and Artificial Intelligence,
short version in: Proceedings of the 5th
International Symposium on the Theory and Applications of Satisfiability Testing
(SAT 2002), 231-235, Cincinnati/Ohio (2002)
|
 |
 |
 |
 |
|
Randerath, B., Schiermeyer, I., Tewes, M., Volkmann, L.
|
 |
|
Vertex-Pancyclic Graphs
|
 |
|
Discrete Appl. Math., Vol. 120 (1-3), 219-237 (2002)
|
 |
 |
 |
 |
|
Randerath, B., Schiermeyer, I., Tewes, M.
|
 |
|
3-Colourability and Forbidden Subgraphs. II: Polynomial Algorithms
|
 |
|
Discrete Math., Vol. 251 (1-3), 137-153 (2002)
|
 |
 |
 |
 |
|
Randerath, B., Schiermeyer, I.
|
 |
|
A Note on Brooks' Theorem for Triangle-Free Graphs
|
 |
|
Australas. J. Combin., Vol. 26, 3-9 (2002)
|
 |
 |
 |
 |
|
Randerath, B., Schiermeyer, I.
|
 |
|
Chromatic Number of Graphs Each Path of Which is 3-Colourable
|
 |
|
Result. Math. 41, 150-155 (2002)
|
 |
 |
 |
 |
|
Randerath, B., Vestergaard, P. D.
|
 |
|
On Well-Covered Graphs of Odd Girth 7 or Greater
|
 |
|
Discussiones Mathematicae Graph Theory, Vol.22, 159-172 (2002)
|
 |
 |
 |
 |
|
Randerath, B., Vestergaard, P. D.
|
 |
|
Well-Covered Graphs and Factors
|
 |
|
Technical Report R-02-2017, Aalborg University (2002)
|
 |
 |
 |