Publications
|
 |
|
Please choose a year
|
|
| 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 | | |
|
|
|
| Complete list of publications |
|
|
|
| Publications of the year 2003 |
|
|
Genç, Z.
|
|
|
Ein neuer Ansatz zur Fahrplanoptimierung im ÖPNV:
Maximierung von zeitlichen Sicherheitabständen.
|
|
|
2003, Universität zu Köln, Doktorarbeit (2003)
|
|
|
|
|
|
Heusch, P., Porschen, S., Speckenmeyer, E.
|
|
|
Improving a fixed parameter tractability time bound for the shadow problem
|
|
|
Journal of Computer and System Sciences (JCSS), Volue 67, Issue 4 (2003)
|
|
|
|
|
|
Porschen, S.
|
|
|
On the Rectangular Grid Hull of Point Sets and DAG's in the Plane
|
|
|
Technical Report: zaik2004-463, Universität zu Köln (2003)
|
|
|
|
|
|
Speckenmeyer, E., Franco, J., van Maaren, H. (Editors)
|
|
|
The Renesse Issue on Satisfiability
|
|
|
Discrete Appl. Math., Volume 130, Number 2, Elsevier, Amsterdam (2003)
|
|
|
|
|
|
Franco, J., Kleine Büning, H., Speckenmeyer, E. (Editors)
|
|
|
Results on Satisfiability in Propositional Logic
|
|
|
Annals of Mathematics and Artificial Intelligence, Volume 37 No. 3, Kluwer Academic Publishing, Dordrecht (2003)
|
|
|
|
|
|
Porschen, S., Randerath, B., Speckenmeyer, E.
|
|
| Linear time algorithmus for some Not-All-Equal Satisfiability Problems |
|
|
Accepted for publication in LNAI, Springer-Verlag,
short version in: Proc. 6th Int. conf. on Theory and Appl. of Satisfiability-Testing (SAT 2003), 72-80,
St. Margaritha Ligure-Portofino (Italy) (2003)
|
|
|
|
|
|
Randerath, B., Schiermeyer, I.
|
|
|
Vertex-colouring and forbidden subgraphs - a survey
|
|
| Technical Report: zaik2003-453, Universität zu Köln (2003) |
|
|
|
|
|
Porschen, S.
|
|
|
A New Duality Principle for Hypergraphs and Propositional Formulas
|
|
|
Technical Report: zaik2004-464, Universität zu Köln (2003)
|
|
|
|
|
|
Le, V. B., Randerath, B.
|
|
|
On Stable Cutsets in Line Graphs
|
|
|
Theoret. Comput. Sci., Vol. 301, 463-475 (2003)
|
|
|
|
|
|
Kochol, M., Lozin, V., Randerath, B.
|
|
|
The 3-colorability problem on graphs
with maximal degree 4
|
|
|
SIAM J. Comp., Vol. 32(5), 1128-1139 (2003)
|
|
|
|
|
|
Porschen, S.
|
|
|
Time Complexity of Rectangular Covering Problems in the Discrete Plane
|
|
|
Technical Report: zaik2004-462, Universität zu Köln (2003)
|
|
|
|
