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 2004 |
|
|
Randerath, B.
|
|
|
Graph Colouring and Satisfiability Problems for Restricted Classes of Instances
|
|
|
2004, Habilitationsschrift, Universität zu Köln (2004)
|
|
|
|
|
|
Kesavan Cheemplavam, P.
|
|
|
Optimierung der LBC auf Switched Ethernet
|
|
|
2004, Universität zu Köln, Diplomarbeit (2004)
|
|
|
|
|
|
Randerath, B., Schiermeyer, I.
|
|
|
Exact Algorithms for Minimum Dominating Set
|
|
|
Technical Report: zaik2005-501, Universität zu Köln (2005)
|
|
|
|
|
|
Holz, P.
|
|
|
Online-Colouring of Claw-Free Graphs by Using the Strategy of First-Fit
|
|
|
2004, Universität zu Köln, Diplomarbeit (2004)
|
|
|
|
|
|
Porschen, S.
|
|
|
On the Time Complexity of Rectangular Covering Problems in Discrete Plane
|
|
|
Lecture Notes in Computer Science, Vol. 3045, 137-146 (2004)
|
|
|
|
|
|
Porschen, S., Speckenmeyer, E.
|
|
|
Satisfiability Problems for Mixed Horn Formulas
|
|
|
Proceedings of the Guangzhou Symposium on Satisfiability and its Applications,
Guangzhou, China, September 2004, 106-113 (2004)
|
|
|
|
|
|
Randerath, B.
|
|
|
3-Colorability and Forbidden Subgraphs. I: Characterizing Pairs
|
|
|
Discrete Mathematics, Vol. 276(1-3), 313-325 (2004)
|
|
|
|
|
|
Randerath, B., Schiermeyer, I.
|
|
|
3-Colorability is in P for P6-Free Graphs
|
|
|
Discrete Applied Mathematics, Vol. 136(2-3) (2004)
|
|
|
|
|
|
Randerath, B., Schiermeyer, I.
|
|
|
Vertex-Colouring and Forbidden Subgraphs - a Survey
|
|
|
Graphs and Combinatorics, Vol. 20(1), 1-40 (2004)
|
|
|
|
|
|
Porschen, S., Speckenmeyer, E., Randerath, B., Gärtner, M.
|
|
|
Tabusat and WalkSat for Level Graph Formulas
|
|
|
Technical Report: zaik2004-476, Universität zu Köln (2004)
|
|
|
|
|
|
Porschen, S., Speckenmeyer, E.
|
|
|
Worst Case Bounds for Some Modified NP-Complete Horn-SAT Problems
|
|
|
accepted for publication in Lecture Notes in Computer Science,
Technical Report: zaik2004-473, Universität zu Köln (2004)
|
|
|
|
|
|
Porschen, S., Randerath, B., Speckenmeyer, E.
|
|
|
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems
|
|
|
Lecture Notes in Computer Science, Vol. 2919, 172-187 (2004)
|
|
|
|
|
|
Speckenmeyer, E.
|
|
|
Robuste Straßenbahnfahrpläne - Reduktion der
Verspätungsanfälligkeit
|
|
|
Vortragsreihe Universität im Rathaus,
29. November 2004
|
|
|
|
