Siegel und Leitseite der Universität zu KölnSiegel und Leitseite der Mathematisch-Naturwissenschaftlichen Fakultät
Leitseite
Mitarbeiter
Lehrstuhl
Ehemalige
Lehre
Aktuelle Veranstaltungen
Geplante Veranstaltungen
Frühere Veranstaltungen
Studentische Hilfskräfte
Diplomarbeitsthemen
Vorträge
Kolloquium und Oberseminar
Kolloquium über Parallelverarbeitung
Forschungsprojekte
ÖPNV-Fahrplanung
Erfüllbarkeit
Publikationen
Stellenangebote
Anreiseplan
Universität zu Köln
Math.-Nat. Fakultät
ZAIK
Institut für Informatik
Impressum
english
Valid HTML 4.01!

Publikationen
Bitte wählen Sie ein Jahr aus
20072006200520042003
20022001200019991998
19971996199519941993
19921991199019891988
19871986198519841983
198219801979
Liste aller Publikationen
Publikationen der Jahre 1979-2007
Porschen, S.
A CNF Formula Hierarchy over the Hypercube
Lecture Notes in Computer Science (LNAI), Vol. 4830, 234-243 (2007)
Porschen, S.
Optimal Parameterized Rectangular Coverings
Lecture Notes in Computer Science, Vol. 4705, 96-109 (2007)
Porschen, S.
Structural and computational aspects of restricted Boolean formulas
Habilitationsschrift, Univ. Köln, 2007
Porschen, S., Speckenmeyer, E.
Algorithms for Variable-Weighted 2-SAT and Dual Problems
Lecture Notes in Computer Science, Vol. 4501, 173-186 (2007)
Porschen, S., Speckenmeyer, E.
Satisfiability of mixed Horn formulas
Discrete Appl. Math., Vol. 155, 1408 - 1419 (2007)
Porschen, S.
On generalizations of the shadow independent set problem
Discrete Math., Vol. 37, 1473 - 1485 (2007)
Schön, A.
Optimierung von Stadtbahnfahrplänen - Ein Genetischer Algorithmus sowie Simulation der Optimalfahrpläne unter Einbeziehung des neuen Kölner Nord-Süd-Stadtbahnnetzes
Diplomarbeit, Univ. Köln, 2007
Ullrich, O.
Mehr Pünktlichkeit im ÖPNV: Optimierung und Simulation des Kölner Stadtbahn-Fahrplans
Vortragsreihe Wissenschaft im Rathaus, 25. April 2007
Porschen, S., Speckenmeyer, E.
Clause set structures and satisfiability
Techn. Report zaik2007-532, Univ. Köln, 2007
Porschen, S., Speckenmeyer, E.
NP-completeness for Restricted Linear Formula Classes
Proc. Guangzhou Symposium on Satisfiability in Logical-Based Modeling Tech. Report Sun Yat-sen University, pp. 111-123, Guangzhou, China, 2006
Lückemeyer, G., Speckenmeyer, E.
Comparing Applicability of Two Simulation Models, in Public Transport Simulation
Proc. 19. Symposium Simulationstechnik, Hannover, SCS Publishing House, San Diego, pp. 9-14, 2006
Porschen, S.
On variable-weighted exact satisfiability problems
Techn. Report zaik2006-526, Univ. Köln, 2006
Porschen, S, Speckenmeyer, E.
Linear CNF formulas and satisfiability
Techn. Report zaik2006-520, Univ. Köln, 2006
Plagge, G.
Über Variablen-Gewichtete X3SAT Optimierungsprobleme
Diplomarbeit, Univ. Köln, 2006
Porschen, S., Speckenmeyer, E., Randerath, B.
On Linear CNF Formulas
Lecture Notes in Computer Science, Vol. 4121, 212 - 225 (2006)
Ullrich, O.
CATSview - Eine Benutzerschnittstelle zur Steuerung, Visualisierung und Ergebnisauswertung von Fahrplansimulationen im Öffentlichen Personennahverkehr
Diplomarbeit, Univ. Köln, 2006
Porschen, S.
Counting All Solutions of Minimum Weight Exact Satisfiability
Lecture Notes in Computer Science, Vol. 3998, 50-59 (2006)
Porschen, S.
Algorithms for Rectangular Covering Problems
Lecture Notes in Computer Science, Vol. 3980, 40-49 (2006)
Lückemeyer, G.
A Traffic Simulation System Increasing the Efficiency of Schedule Design for Public Transport Systems Based on Scarce Data
2005, Universität zu Köln, Doktorarbeit (2005)
Porschen, S.
Solving Minimum Weight Exact Satisfiability in Time O(20.2441n)
Lecture Notes in Computer Science, Vol. 3827, 654-664 (2005)
Achter, V.
Radial Level Planarity in a Propositional Logic Framework
2005, Universität zu Köln, Diplomarbeit (2005)
Porschen, S.
A New Parameterization of the Shadow Problem
Technical Report: zaik2005-501, Universität zu Köln (2005)
Porschen, S.
Counting All Solutions of Minimum Weight Exact Satisfiability
Technical Report: zaik2005-500, Universität zu Köln (2005)
Porschen, S., Speckenmeyer, E.
Satisfiability of Mixed Horn Formulas
Technical Report: zaik2005-499, Universität zu Köln (2005)
Porschen, S., Speckenmeyer, E.
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems
Lecture Notes in Computer Science, Vol. 3542, 251-262 (2005)
Porschen, S.
On the Rectangular Subset Closure of Point Sets
Lecture Notes in Computer Science, Vol. 3480, 796-805 (2005)
Porschen, S.
On Some Weighted Satisfiability and Graph Problems
Lecture Notes in Computer Science, Vol. 3381, 278-287 (2005)
Porschen, S., Randerath, B., Speckenmeyer, E.
Exact Satisfiability is Decidable in Time O(20.16254n)
Annals of Mathematics and Artifical Intelligence, Vol. 43(1-4), 173-193 (2005)
Randerath, B., Vestergaard, P. D.
Well-Covered Graphs and Factors
accepted for publication in Discrete Applied Mathematics (2005)
Randerath, B.
Domination Cookies
Sonderband zum Ersten Aachener Tag der Graphentheorie, Shaker Verlag (2005)
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
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)
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)
Porschen, S.
Upper Bounds for Rectangular Covering Problems on Integer Lattices
Technical Report: zaik2003-424, Universität zu Köln (2001)
Randerath, B., Speckenmeyer, E., Boros, E., Cepek, O., Hammer, P., Kogan, A., Makino, A., Simeone, B.
A Satisfiability Formulation of Problems on Level Graphs
Proceedings of the LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), Boston/Massachusetts, June 14-15, H. Kautz and B. Selman, editors, Electronic Notes in Discrete Math. 9, 1-9 (2001)
Porschen, S.
On Covering Z-Grid Points by Rectangles
Electronic Notes in Discrete Mathematics, Vol. 8 (2001)
Genç, Z., Speckenmeyer, E.
Fahrplanoptimierung im ÖPNV
Technical Report: zaik2001-426, Universität zu Köln (2001)
Harant, J., Jendrol, S., Randerath, B., Ryjacek, Z., Schiermeyer, I., Voigt, M.
On Weights of Induced Paths and Cycles in Claw-Free and K1,r-Free Graphs
J. of Graph Theory, Vol.36 (3), 131-143 (2001)
Franco, J., Gallo, G., Kleine Büning, H., Speckenmeyer, E. (Editors)
Topics in Discrete Mathematics 10: The Satisfiability Problem
Elsevier, Amsterdam (2000)
Lückemeyer, G.
Datenmodellierung und Datenschnittstellen - Basis einer effizienten Fahrplangestaltung für den ÖPNV
2000, Universität zu Köln, Diplomarbeit (2000)
Franco, J., Goldsmith, J., Schlipf, J., Speckenmeyer, E., Swaminathan, R. P.
An Algorithm for the Class of Pure Implicational Formulas
Discrete Applied Mathematics, Vol. 96-97, 89-106 (1999)
Randerath, B., Vestergaard, P.D.
A Note on Well-Covered Graphs with Odd Girth
Tech. Report R-99-2019, 1999, Aalborg University (1999)
Randerath, B., Schiermeyer, I., Wang, H.
On Quadrilaterals in a Graph
Discrete Math., Vol. 203, 229-237 (1999)
Randerath, B., Volkmann, L.
Characterization of Graphs with Equal Domination and Matching Number
Utilitas Math., Vol. 55, 65-72 (1999)
Meisgen, F., Speckenmeyer, E.
Dynamic Load Balancing on Heterogeneous Networks
in: Proceedings of JIM'99, Journée de l'Informatique Messine, Metz France, M. Margenstern and D. Singer, editors, 191-206 (1999)
Genc, Z.
Ein Aspekt der Fahrplanoptimierung im ÖPNV: Maximierung minimaler Sicherheitsabstände
1999, Universität zu Köln, Diplomarbeit (1999)
Randerath, B., Schiermeyer, I.
Colouring Graphs with Prescribed Induced Cycle Lengths
Tech. Report 98.341, 1998, Universität zu Köln (1998)
Randerath, B.
The Vizing Bound for the Chromatic Number based on Forbidden Pairs
Shaker Verlag, 1998, RWTH Aachen, Doktorarbeit (1998)
Randerath, B., Volkmann, L.
Characterization of Graphs with equal Domination and Covering Number
Discrete Math., Vol. 191, 159-169 (1998)
Niessen, T., Randerath, B.
Regular Factors of Simple Regular Graphs, and Factor Spectra
Discrete Math., Vol. 185, 89-103 (1998)
Meisgen, F.
Dynamische Lastausgleichsverfahren in heterogenen Netzwerken -- Entwurf und Implementierung einer Klassenbibliothek zur Lastbalancierung paralleler Programme
1998, Universität zu Köln, Doktorarbeit (1998)
Holland-Moritz, A.
Simulation von Schienenverkehr im ÖPNV
1998, Universität zu Köln, Diplomarbeit (1998)
Meisgen, F., Speckenmeyer, E.
The PLB-Library: Dynamic Load Balancing on NOWs
Anwendungsbezogene Lastverteilung ALV'98, SFB-342 TU München, 89-99, 1998, Editors: A. Bode and A. Ganz et al (1998)
Franco, J., Gallo, G., Kleine Büning, H., Speckenmeyer, E.
2nd Workshop on the Satisfiability Problem
Tech. Report tr-ri-98-196, 1998, Universität-GH Paderborn (1998)