zum Inhalt springen

Publikationen

2016

  • Ullrich, Oliver; Brandt, Benjamin; Lückerath, Daniel; Rishe, Naphtali: A Simple Model of Cruising for Garage Parking. In: Proceedings of ASIM-Workshop STS/GMMS 2016, ARGESIM Report 51, ASIM-Mitteilung AM 158, ARGESIM/ASIM Pub., TU Vienna/Austria, Tikhomirov, D.; Mammen, T.-H.; Pawletta, T. (Ed.), März 2016, pp. 223-229.
  • Ullrich, Oliver; Lückerath, Daniel; Speckenmeyer, Ewald: Do regular time tables help to reduce delays in tram networks? - It depends! In: Public Transport, Springer-Verlag Berlin Heidelberg, Volume 8, Number 1, März 2016, pp. 39-56, ISSN 1866-749X, DOI 10.1007/s12469-015-0115-6.
  • Hecker, Alexander: Entwurf und Entwicklung einer Heuristik zur Lösung des Job Pairing Problems. Masterarbeit, Univ. Köln, 2016.

2015

  • Klinke, Phillip: Entwicklung eines effizienten Managementsystems für Übungsgruppen und Bonuspunkte. Bachelorarbeit, Univ. Köln, 2015
  • Stahlberg, Mette: Ein Verfahren zum Lösen des Fahrplan-Problems mit verkehrsplanerischen Vorgaben bei nicht-konvexem Lösungsraum. Masterarbeit, Univ. Köln, 2015.
  • Ullrich, Oliver; Lückerath, Daniel; Speckenmeyer, Ewald: A robust schedule for Montpellier's Tramway network. In: Simulation Notes Europe (SNE), ARGESIM/ Asim Pub., TU Vienna/Austria, Volume 25, Number 1, 2015, pp. 1-8, ISSN 2306-0271, DOI 10.11128/sne.25.tn.102271.
  • Lohmann, Matthias; Ullrich, Oliver; Molina Madrid, Manuel; Lückerath, Daniel; Speckenmeyer, Ewald: The team priority assignment problem. Technical Report, Univ. Köln, 2015, 12 pg.

2014

  • Lohmann, Matthias: Das Team Priority Assignment Problem. Bachelorarbeit, Univ. Köln, 2014.
  • Ullrich, Oliver; Lückerath, Daniel; Speckenmeyer, Ewald: A robust schedule for Montpellier's Tramway network. In: Proceedings of ASIM 2014 - 22. Symposium Simulationstechnik, Berlin, ARGESIM Report 43, ASIM-Mitteilung AM 151, ARGESIM/ASIM Pub., TU Vienna/Austria, Wittmann, J.; Deatcu, C. (Ed.), September 2014, pp. 229-238.
  • Ullrich, Oliver; Lückerath, Daniel; Speckenmeyer, Ewald: Model-based parallelization of discrete simulation models. In: Simulation Notes Europe (SNE), ARGESIM/ Asim Pub., TU Vienna/Austria Volume 24, Number 3-4, 2014, pp. 115-122, ISSN 2306-0271, DOI 10.11128/sne.24.tn.102251. 
  • Osmanbeyoglu, Hatice Merve: Vergleich von Robustheitskonzepten für die Fahrplangenerierung. Bachelorarbeit, Univ. Köln, 2014.
  • van der Grinten, Alexander; Wotzlaw, Andreas; Speckenmeyer, Ewald: satUZK: Solver Description. In: Belov, A.; Diepold, D.; Heule, M. J. H.; Järvisalo, M. (Ed.), Proceedings of SAT Competition 2014: Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, Volume B-2014-2, University of Helsinki.
  • Porschen, Stefan; Schmidt, Tatjana; Speckenmeyer, Ewald; Wotzlaw, Andreas: XSAT and NAE-SAT of linear CNF classes, In: Discrete Applied Mathematics 167, April 2014, pp. 1-14.
  • Wotzlaw, Andreas: On Solving the Maximum k-club Problem. CoRR abs/1403.5111, 2014.
  • Wotzlaw, Andreas; Speckenmeyer, Ewald; Porschen, Stefan: Probabilistic Analysis of Random Mixed Horn Formulas, In: Proceedings of the 13th International Symposium on Artificial Intelligence and Mathematics  (ISAIM'14), Fort Lauderdale, USA, 2014.
  • Gómez, Pedro: A robust schedule for Montpelier's extended Tramway network of 2017. Bacheloararbeit, Univ. Köln, 2014.
  • Ullrich, Oliver; Lückerath, Daniel; Speckenmeyer, Ewald: Reduzieren robuste Fahrpläne Verspätungen in Stadtbahnnetzen? - Es kommt drauf an!. In: Heureka' 14 Optimierung in Verkehr und Transport, FGSV Verlag, Stuttgart, April 2014, pp. 448-465.
  • Kuckertz, Patrick; Randerath, Hubert: A model for airline personnel schedule simulation. In: Proceedings of ASIM-Workshop STS/GMMS 2014, ARGESIM Report 42, ASIM Mitteilung AM 149, ARGESIM/ASIM Pub., TU Vienna/Austria, Scheible, J.; Bausch-Gall, I., Deatcu, C. (Ed.), Februar 2014, pp. 171-180.
  • Lückerath, Daniel; Ullrich, Oliver; Kupicha, Aleksander; Speckenmeyer, Ewald: Multi-depot multi-vehicle-type vehicle scheduling for Cologne's tram network. In: Proceedings of ASIM-Workshop STS/GMMS 2014, ARGESIM Report 42, ASIM-Mitteilung AM 149, ARGESIM/ASIM Pub., TU Vienna/Austria, Scheible, J.; Bausch-Gall, I., Deatcu, C. (Ed.), Februar 2014, pp. 191-197.

2013

  • Kupicha, Aleksander: Entwurf und Entwicklung eines Optimierungsverfahrens zur Umlaufplanung von Stadtbahnfahrplänen. Masterarbeit, Univ. Köln, 2013.
  • Speckenmeyer, Ewald; Lückerath, Daniel; Ullrich, Oliver: Simulation and optimization of light rail rapid transit schedules. Vortrag, Symposium on Computational Sciences Cologne, Univ. Köln, 25. Oktober, 2013.
  • Ullrich, Oliver; Proff, Ingo; Lückerath, Daniel; Kuckertz, Patrick; Speckenmeyer, Ewald: Agent-based modeling and simulation of individual traffic as an environment for bus schedule simulation. In: ITS for Connected Mobility - Selected Papers from the mobil.TUM 2013 International Conference on Mobility and Transport, Hrsg: Busch, F., Spangler, M., 2014, pp. 89-98.
  • van der Grinten, Alexander; Wotzlaw, Andreas; Speckenmeyer, Ewald; Porschen, Stefan: satUZK: Solver Description. In: Balint, A.; Belov, A.; Heule, M. J. H.; Järvisalo, M. (Ed.), Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, Volume B-2013-1, University of Helsinki.
  • Ullrich, Oliver; Lückerath, Daniel; Speckenmeyer, Ewald: A robust schedule for Montpellier's Tramway network. Technical Report, Univ. Köln, 2013, 17 pg.
  • Wotzlaw, Andreas; von der Grinten, Alexander; Speckenmeyer, Ewald: Effectiveness of pre- and inprocessing for CDCL-based SAT solving. Technical Report, Univ. Köln, 2013, 9 pg.
  • Lückerath, Daniel; Ullrich, Oliver; Speckenmeyer, Ewald: Applicability of rescheduling strategies in tram networks. In: Proceedings of ASIM-Treffen STS/GMMS 2013, ARGESIM Report 41, ASIM-Mitteilung AM 145, ARGESIM/ASIM Pub., TU Vienna/Austria, Reichardt, R. (Ed.), Februar 2013, 7 pg.

2012

  • Proff, Ingo: Entwurf eines mathematischen Modells zur Optimierung des Crew-Pairing bei Fluggesellschaften. Bachelorarbeit, Univ. Köln, 2012.
  • Ullrich, Oliver; Lückerath, Daniel (Ed.): Proceedings of Sommertreffen Verkehrssimulation 2012. ASIM-Mitteilung AM 143, ARGESIM/ASIM Pub., TU Vienna/Austria.
  • Kuckertz, Patrick: Current work on the optimization of flight personnel schedules within project DOGS. In: Proceedings of Sommertreffen Verkehrssimulation 2012, ASIM-Mitteilung AM 143, ARGESIM/ASIM Pub., TU Vienna/Austria, Ullrich, O.; Lückerath, D. (Ed.), 2012, pp. 19-22.
  • Lückerath, Daniel: Thoughts on restauration of regular tram operation. In: Proceedings of Sommertreffen Verkehrssimulation 2012, ASIM-Mitteilung AM 143, ARGESIM/ASIM Pub., TU Vienna/Austria, Ullrich, O.; Lückerath, D. (Ed.), 2012, pp. 5-7.
  • Ullrich, Oliver; Lückerath, Daniel; Speckenmeyer, Ewald: Simulation and optimization of Cologne's tram schedule. In: Simulation Notes Europe (SNE), ARGESIM/ASIM Pub., TU Vienna/Austria, Volume 22, Number 2, August 2012, pp. 69-76, ISSN 2305-9974, DOI 10.11128/sne.22.tn.10123.
  • Kuckertz, Patrick; Ullrich, Oliver; Randerath, Bert: A simulation based approach on robust airline job pairing. In: Simulation Notes Europe (SNE), ARGESIM/ASIM Pub., TU Vienna/Austria, Volume 22, Number 2, August 2012, pp. 77-82, ISSN 2305-9974, DOI 10.11128/sne.22.tn.10125.
  • Lückerath, Daniel; Ullrich, Oliver; Speckenmeyer, Ewald: Modeling time table based tram traffic. In: Simulation Notes Europe (SNE), ARGESIM/ASIM Pub., TU Vienna/Austria, Volume 22, Number 2, August 2012, pp. 61-68, ISSN 2305-9974, DOI 10.11128/sne.22.tn.10121.
  • Speckenmeyer, Ewald; Li, Nianhua; Lückerath, Daniel; Ullrich, Oliver: Socio-economic Objectives in Tram Scheduling. Technical Report, Univ. Köln, 2012, 17 pg.
  • Wotzlaw, Andreas; van der Grinten, Alexander; Speckenmeyer, Ewald; Porschen, Stefan: pfolioUZK: Solver Description. In: Balint, A.; Belov, A.; Diepold, D.; Gerber, S.; Järvisalo, M.; Sinz, C. (Ed.), Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions, Volume B-2012-2 of Department of Computer Science Series of Publications B, University of Helsinki.
  • van der Grinten, Alexander; Wotzlaw, Andreas; Speckenmeyer, Ewald; Porschen, Stefan: satUZK: Solver Description. In: Balint, A.; Belov, A.; Diepold, D.; Gerber, S.; Järvisalo, M.; Sinz, C. (Ed.), Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions, Volume B-2012-2 of Department of Computer Science Series of Publications B, University of Helsinki.
  • Wotzlaw, Andreas; Speckenmeyer, Ewald; Porschen, Stefan: Probabilistic Analysis of Random Mixed Horn Formulas. Technical Report zaik2012-678, Univ. Köln, 2012.

2011

  • Franz, Sebastian: Entwurf und Entwicklung eines mehrstufigen Optimierungsverfahrens für Stadtbahnfahrpläne unter Berücksichtigung verkehrsplanerischer Vorgaben. Diplomarbeit, Univ. Köln, 2011.
  • Porschen, Stefan; Schmidt, Tatjana; Speckenmeyer, Ewald; Wotzlaw, Andreas: XSAT and NAE-SAT of linear CNF classes. In Discrete Applied Mathematics, to appear.
  • Wotzlaw, Andreas; Speckenmeyer, Ewald; Porschen, Stefan: Generalized k-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation. In: Discrete Applied Mathematics, to appear.
  • Petzold, Martin, Ullrich, Oliver; Speckenmeyer, Ewald: Dynamic Distributed Simulation of DEVS Models on the OSGi Service Platform. In: Simulation Notes Europe (SNE), ARGESIM/ASIM Pub., TU Vienna/Austria, Volume 21, Number 3-4, Dezember 2011, pp. 159-164.
  • Kuckertz, Patrick; Ullrich, Oliver; Lindstädter, Anja; Speckenmeyer, Ewald: Agent based modeling and simulation of a pastoral-nomadic land use system. In: Simulation Notes Europe (SNE), ARGESIM/ASIM Pub., TU Vienna/Austria, Volume 21, Number 3-4, Dezember 2011, pp. 147-152.
  • Werth, Felix; Ullrich, Oliver; Speckenmeyer, Ewald: Reducing blocking effects in multi-block layouts. In: 21. Symposium Simulationstechnik: ASIM 2011; Grundlagen, Methoden und Anwendungen in Modellbildung und Simulation, 7. - 9. September 2011, ZHAW, Winterthur/Schweiz, Pabst Science Publ., Bödi, R.; Maurer, W. (Ed.), 2011, 10 pg.
  • Lückerath, Daniel: Entwurf und Entwicklung einer Anwendung zur parallelen Simulation von schienengebundenem Öffentlichen Personennahverkehr. Diplomarbeit, Univ. Köln, 2011.
  • Speckenmeyer, Ewald; Wotzlaw, Andreas; Proschen, Stefan: A Satisfiability-based Approach for Embedding Generalized Tanglegrams in Level Graphs. In: Lecture Notes in Computer Science, Volume 6695, 2011, pp 134-144.
  • Werth, Felix; Ullrich, Oliver: Simulation ausgewählter Heuristiken zur Tourenplanung in manuellen Kommissionierstationen. In: ASIM-Treffen 2011 - Simulation technischer Systeme und Grundlagen und Methoden in Modellbildung und Simulation, Shaker Verlag, Brenke, A. (Ed.), 2011, pp. 161-166.
  • Lang, Martin: Entwicklung einer Modellierungssprache und eines Solvers für kombinatorische Optimierungsprobleme. Diplomarbeit, Univ. Köln, 2011.

2010

  • Trajt, Valerij: Entwicklung eines Datenkompressionsprogramms und Vergleich verschiedener Kompressionsmethoden. Diplomarbeit, Univ. Köln, 2010.
  • Li, Nianhua: Designing and Analyzing Simulated Annealing Based Metro Schedules. Diplomarbeit, Univ. Köln, 2010.
  • Werth, Felix; Beckers, Martin; Ullrich, Oliver; Speckenmeyer, Ewald: Simulation zur Verbesserung der Logistikprozesse eines Pharmagroßhandels. In: Integrationsaspekte der Simulation - Technik, Organisation und Personal, KIT Scientific Publishing, Zülich, G., Stock, P. (Ed.), 2010, pp. 261-268.
  • Speckenmeyer, Ewald; Porschen, Stefan: PARTIAL MAX-SAT of Level Graph (Mixed-Horn)Formulas. In: Studies in Logic 3, 2010, pp. 24-43.
  • Kuckertz, Patrick: Entwurf und Entwicklung einer Anwendung zur Simulation des Weidemanagements des Volks der Hiba in Namibia. Diplomarbeit, Univ. Köln, 2010.
  • Beckers, Martin: Entwurf und Entwicklung einer Anwendung zur SImulation des Pharmagro0handels GEHE GmbH in Troisdorf. Diplomarbeit, Univ. Köln, 2010.
  • Speckenmeyer, Ewald; Porschen, Stefan: MAX-SAT of level graph formulas. In: Proceedings of Guangzhou Symposium on SAT in Logic-Based Modeling, Sun Yat-sen University, Guangzhou, China, to appear, 2010.
  • Porschen, Stefan; Schmidt, Tatjana; Speckenmeyer, Ewald: Complexity Results for Linear XSAT Problems. In: Lecture Notes in Computer Sciences, Volume 6175, 2010, pp. 251-263.
  • Werth, Felix; Beckers, Martin; Ullrich, Oliver: Modellierung uns Simulation eines Pharmagroßhandels. In: Proceedings of ASIM/GI Workshop STS/GMMS, Commerell, W. (Ed.), Ulm, März 2010, pp. 141-146, ISBN 978-3-9810998-3-6.
  • Porschen, Stefan; Plagge, Galyna: Minimizing variable-weighted X3SAT. In: Proceedings of ICCS 2010, Hong Kong, 2010, pp. 449-454.
  • Lemaic, Mile; Speckenmeyer, Ewald: Markov-Chain-Based Heuristics for the Minimum Feedback Vertex Set Problem. Technical Report zaik2010-596, Univ. Köln, 2010.
  • Walter, Dominique: Optimierung von ÖPNV-Fahrplänen unter Berücksichtigung verkehrsplanerischer Vorgaben. Diplomarbeit, Univ. Köln, 2010.

2009

  • Porschen, Stefan: On rectangular covering problems. In: International Journal of Computational Geometry & Applications, Volume 19, 2009, pp. 325-340.
  • Porschen, Stefan; Schmidt, Tatjana; Speckenmeyer, Ewald: On Some Aspects of Mixed-Horn formulas. In: Lecture Notes in Computer Science, Volume 5584, 2009, pp. 86-100.
  • Porschen, Stefan; Speckenmeyer, Ewald; Zhao, Xishun: Linear CNF formulas and satisfiability. In: Discrete Applied Mathematics 157, 2009, pp. 1046-1068.
  • Porschen, Stefan; Schmidt, Tatjana: On Some SAT-variants over Linear Formulas. In: Lecture Notes in Computer Science, Volume 5404, 2009, pp. 449-460.
  • Porschen, Stefan: An FPT-variant of the Shadow Problem with kernelization. In: Proceedings of ICCS 2009, Hong Kong, 2009, pp. 432-439.

2008

  • Speckenmeyer, Ewald; Li, Chu Min; Manquinho, Vasco; Tacchella, Armando (Ed.): Special Issue in the 2007 Competitions. In: Journal on Satisfiability, Boolean Modeling and Computation, Volume 4, 2008.
  • Porschen, Stefan; Speckenmeyer, Ewald: A CNF Class Generalizing Exact Linear Formulas. In: Lecture Notes in Computer Science, Volume 4996, 2008, pp. 231-245.
  • Ullrich, Oliver; Speckenmeyer, Ewald: Parallelisierung der Simulation von ÖPNV-Netzen. Poster, 5. ASIM-Treffen Grundlagen und Methoden von Modellierung und Simulation, 18.-20. Februar 2008.
  • Niepel, Sebastian: Ganztagesfahrplanoptimierung im ÖPNV mit naturanalogen Methoden. Diplomarbeit, Univ. Köln, 2008.
  • Plagge, Galyna; Porschen, Stefan: Über Variablen-Gewichtete X3SAT-Probleme. In: Proceedings of 54. Workshop über Algorithmen und Komplexität, Universität Hannover, 5. März 2008.

2007

  • Porschen, Stefan; Speckenmeyer, Ewald: Algorithms for Variable-Weighted 2-SAT and Dual Problems. In: Lecture Notes in Computer Science, Volume 4501, 2007, pp. 173-186.
  • Porschen, Stefan: Structural and computational aspects of restricted Boolean formulas. Habilitationsschrift, Univ. Köln, 2007.
  • Porschen, Stefan: Optimal Parameterized Rectangular Coverings. In: Lecture Notes in Computer Science, Volume 4705, 2007, pp. 96-109.
  • Porschen, Stefan: On variable-weighted exact satisfiability problems. In: Annals of Mathematics and Artificial Intelligence, Volume 51, 2007, pp. 27-54.
  • Porschen, Stefan: A CNF Formula Hierarchy over the Hypercube. In: Lecture Notes in Computer Science, Volume 4830, 2007, pp. 234-243.
  • Porschen, Stefan; Speckenmeyer, Ewald: Clause set structures and satisfiability. Technical Report zaik2007-532, Univ. Köln, 2007.
  • Ullrich, Oliver: Mehr Pünktlichkeit im ÖPNV: Optimierung und Simulation des Kölner Stadtbahn-Fahrplans. Vortrag, Wissenschaft im Rathaus, Köln, 25. April 2007.
  • Schön, Andreas: Optimierung von Stadtbahnfahrplänen - Ein Genetischer Algorithmus sowie Simulation der Optimalfahrpläne unter Einbeziehung des neuen Kölner Nord-Süd-Stadtbahntunnels. Diplomarbeit, Univ. Köln, 2007.
  • Porschen, Stefan: On generalizations of the shadow independent set problem. In: Discrete Mathematics, Volume 37, 2007, pp. 1473-1785.
  • Porschen, Stefan; Speckenmeyer, Ewald: Satisfiability of mixed Horn formulas. In: Discrete Applied Mathematics, Volume 155, 2007, pp. 1408-1419.

2006

  • Porschen, Stefan: Algorithms for Rectangular Covering Problems. In: Lecture Notes in Computer Science, Volume 3980, 2006, pp. 40-49.
  • Ullrich, Oliver: CATSview - Eine Benutzerschnittstelle zur Steuerung, Visualisierung und Ergebnisauswertung von Fahrplansimulationen im ÖPNV. Diplomarbeit, Univ. Köln, 2006.
  • Porschen, Stefan; Speckenmeyer, Ewald; Randerath, Bert: On Linear CNF Formulas. In: Lecture Notes in Computer Science, Volume 4121, 2006, pp. 212-225.
  • Plagge, Galyna: Über Variablen-Gewichtete X3SAT Optimierungsprobleme. Diplomarbeit, Univ. Köln, 2006.
  • Porschen, Stefan; Speckenmeyer, Ewald: Linear CNF formulas and satisfiability. Technical Report zaik2006-520, Univ. Köln, 2006.
  • Porschen, Stefan: On variable-weighted exact satisfiability problems. Technical Report zaik2006-526, Univ. Köln, 2006.
  • Lückemeyer, Gero; Speckenmeyer, Ewald: Comparing Applicability of Two Simulation Models in Public Transport Simulation. In: Proceedings of 19. Symposium Simulationstechnik, Hannover, SCS Publishing House, San Diego,2006, pp. 9-14.
  • Porschen, Stefan; Speckenmeyer, Ewald: NP-completeness for Restricted Linear Formular Classes. In: Proceedings of Guangzhou Symposium on Satisfiability in Logical-Based Modeling, Technical Report, Sun Yat-sen University, Guangzhou, China, 2006, pp. 111-123.
  • Porschen, Stefan: Counting All Solutions of Minimum Weight Exact Satisfiability. In: Lecture Notes in Computer Science, Volume 3998, 2006, pp. 50-59.

2005

  • Porschen, Stefan; Speckenmeyer, Ewald: Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. In: Lecture Notes in Computer Science, Volume 3542, 2005, pp. 251-262.
  • Porschen, Stefan; Speckenmeyer, Ewald: Satisfiability of Mixed Horn Formulas. Technical Report zaik2005-499, Univ. Köln, 2005.
  • Porschen, Stefan: Counting All Solutions of Minimum Weight Exact Satisfiability. Technical Report zaik2005-500, Univ. Köln, 2005.
  • Porschen, Stefan: A New Parameterization of the Shadow Problem. Technical Report zaik2005-501, Univ. Köln, 2005.
  • Achter, Viktor: Radial Level Planarity in a Propositional Logic Framework. Diplomarbeit, Univ. Köln, 2005.
  • Porschen, Stefan: Solving Minimum Weight Exact Satisfiability in Time O(2^0.2441n). In: Lecture Notes in Computer Science, Volume 3827, 2005, pp. 654-664.
  • Lückemeyer, Gero: A Traffic Simulation System Increasing the Efficiency of Schedule Design for Public Transport Systems Based on Scarce Data. Dissertation, Univ. Köln, 2005.
  • Randerath, Bert: Domination Cookies. In: Sonderband zum Ersten Aachener Tag der Graphentheorie, Shaker Verlag, 2005.
  • Randerath, Bert; Vestergaard, P. D.: Well-Covered Graphs and Factors. Accepted for publication in Discrete Applied Mathematics, 2005.
  • Porschen, Stefan; Randerath, Bert; Speckenmeyer, Ewald: Exact Satisfiability is Decidable in Time O(2^0.16254n). In: Annals of Mathematics and Artifical Intelligence, Volume 43(1-4), 2005, pp. 173-193.
  • Porschen, Stefan: On Some Weighted Satisfiability and Graph Problems. In: Lecture Notes in Computer Science, Volume 3381, 2005, pp. 278-287.
  • Porschen, Stefan: On the Rectangular Subset Closure of Point Sets. In: Lecture Notes in Computer Science, Volume 3480, 2005, pp. 796-805.
  • Rühmkorf, Jens: Entwicklung eines leistungsfähigen Lösers für Quantifizierte Boolesche Formeln. Diplomarbeit, Univ. Köln, 2005.
  • Randerath, B.; Schiermeyer, I.: Exact Algorithms for Minimum Dominating Set. Technical Report zaik2005-501, Univ. Köln, 2005.

2004

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

2003

  • Randerath, B.; Schiermeyer, I.: Vertex-colouring and forbidden subgraphs - a survey. Technical Report zaik2003-453, Univ. Köln, 2003.
  • Porschen, Stefan; Randerath, Bert; Speckenmeyer, Ewald: Linear time algorithmus for some Not-All-Equal Satisfiability Problems. Accepted for publication in LNAI, Springer-Verlag, short version in: Proceedings of 6th international conference on Theory and Application of Satisfiability-Testing (SAT 2003), St. Margaritha Ligure-Portofino (Italy), 2003, pp. 72-80.
  • Franco, J.; Kleine Büning, H.; Speckenmeyer, E. (Editors): Results on Satisfiability in Propositional Logic. In: Annals of Mathematics and Artificial Intelligence, Volume 37, Number 3, Kluwer Academic Publishing, Dordrecht, 2003.
  • Speckenmeyer, E.; Franco, J.; van Maaren, H. (Editors): The Renesse Issue on Satisfiability. In: Discrete Applied Mathematics, Volume 130, Number 2, Elsevier, Amsterdam, 2003.
  • Porschen, Stefan: On the Rectangular Grid Hull of Point Sets and DAG's in the Plane. Technical Report zaik2004-463, Univ. Köln, 2003.
  • Heusch, Peter; Porschen, Stefan; Speckenmeyer, Ewald: Improving a fixed parameter tractability time bound for the shadow problem. In: Journal of Computer and System Sciences (JCSS), Volume 67, Number 4, 2003.
  • Genç, Zülfükar: Ein neuer Ansatz zur Fahrplanoptimierung im ÖPNV: Maximierung von zeitlichen Sicherheitabständen. Doktorarbeit, Univ. Köln, 2003.
  • Porschen, Stefan: Time Complexity of Rectangular Covering Problems in the Discrete Plane. Technical Report zaik2004-462, Univ. Köln, 2003.
  • Kochol, M.; Lozin, V.; Randerath, B.: The 3-colorability problem on graphs with maximal degree 4. In: SIAM Journal of Computing, Volume 32(5), 2003, pp. 1128-1139.
  • Le, V. B.; Randerath, B.: On Stable Cutsets in Line Graphs. In: Theoretical Computer Science, Volume 301, 2003, pp. 463-475.
  • Porschen, Stefan: A New Duality Principle for Hypergraphs and Propositional Formulas. Technical Report zaik2004-464, Univ. Köln, 2003.

2002

  • Randerath, B.; Schiermeyer, I.; Tewes, M.; Volkmann, L.: Vertex-Pancyclic Graphs. In: Discrete Applied Mathematics, Volume 120 (1-3), 2002, pp. 219-237.
  • Porschen, Stefan; Randerath, Bert; Speckenmeyer, Ewald: Exact 3-Satisfiability is decidable in time 0(2^0.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), Cincinnati/Ohio, 2002, pp. 231-235.
  • Meisgen, Frank; Speckenmeyer, Ewald: A Dynamic Load Balancing Algorithmus with Adjustable Degree of Imbalance on Heterogeneous Network. In: Proceedings of 6th Workshop on Parallel Systems and Algorithms (PASA 2002), Karlsruhe, VDE, 2002, pp. 161-168.
  • Mellin, S.: Polynomielle Färbungsalgorithmen für Pk. Diplomarbeit, Univ. Köln, 2002.
  • Joisten, Martina: Simulation von Fahrplänen für den ÖPNV mittels Zellularautomaten. Diplomarbeit, Univ. Köln, 2002.
  • Porschen, Stefan: On Generalizations of the Shadow Independent Set Problem. Accepted for publication in Discrete Mathematics, Technical Report zaik2004-461, Univ. Köln, 2002.
  • Schwikowski, B.; Speckenmeyer, E.: On Computing all Minimal Solutions for Feedback Problems. In: Discrete Applied Mathematics, Volume 117, 2002, pp. 253-265.
  • Randerath, B., Vestergaard, P. D.: Well-Covered Graphs and Factors. Technical Report R-02-2017, Aalborg University, 2002.
  • Randerath, B., Vestergaard, P. D.: On Well-Covered Graphs of Odd Girth 7 or Greater. In: Discussiones Mathematicae Graph Theory, Volume 22, 2002, pp. 159-172.
  • Randerath, B., Schiermeyer, I.: Chromatic Number of Graphs Each Path of Which is 3-Colourable. In: Results in Mathematics, Volume 41, 2002, pp. 150-155.
  • Randerath, B., Schiermeyer, I.: A Note on Brooks' Theorem for Triangle-Free Graphs. In: Australasian Journal of Combinatorics, Volume 26, 2002, pp. 3-9.
  • Randerath, B., Schiermeyer, I., Tewes, M.: 3-Colourability and Forbidden Subgraphs. II: Polynomial Algorithms. In: Discrete Mathematics, Volume 251 (1-3), 2002, pp. 137-153.

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. In: Journal of Graph Theory, Volume 36, Number 3, 2001, pp. 131-143.
  • Genç, Zülfükar; Speckenmeyer, Ewald: Fahrplanoptimierung im ÖPNV. Technical Report zaik2001-426, Univ. Köln, 2001.
  • Porschen, Stefan: On Covering Z-Grid Points by Rectangles. In: Electronic Notes in Discrete Mathematics, Volume 8, 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. In: Proceedings of the LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), Boston/Massachusetts, June 14-15 2001, Kautz, H.; Selman, B. (Ed.), Electronic Notes in Discrete Mathematics, Volume 9, pp. 1-9.
  • Porschen, Stefan: Upper Bounds for Rectangular Covering Problems on Integer Lattices. Technical Report zaik2003-424, Univ. Köln, 2001.

2000

  • Lückemeyer, Gero: Datenmodellierung und Datenschnittstellen - Basis einer effizienten Fahrplangestaltung für den ÖPNV. Diplomarbeit, Univ. Köln, 2000.
  • Franco, J.; Gallo, G.; Kleine Büning, H.; Speckenmeyer, E. (Editors): Topics in Discrete Mathematics 10: The Satisfiability Problem. Elsevier, Amsterdam, 2000.

1999

  • Genç, Zülfükar: Ein Aspekt der Fahrplanoptimierung im ÖPNV: Maximierung minimaler Sicherheitsabstände. Diplomarbeit, Univ. Köln, 1999.
  • Meisgen, Frank; Speckenmeyer, Ewald: Dynamic Load Balancing on Heterogeneous Networks. In: Proceedings of JIM'99, Journée de l'Informatique Messine, Metz France, Margenstern, M.; Singer, D. (Ed.), 1999, pp. 191-206.
  • Randerath, B.; Volkmann, L.: Characterization of Graphs with Equal Domination and Matching Number. In: Utilitas Mathematica, Volume 55, 1999, pp. 65-72.
  • Randerath, B.; Schiermeyer, I.; Wang, H.: On Quadrilaterals in a Graph. In: Discrete Mathematics, Volume 203, 1999, pp. 229-237.
  • Randerath, B.; Vestergaard, P.D.: A Note on Well-Covered Graphs with Odd Girth. Technical Report R-99-2019, 1999, Aalborg University.
  • Franco, J.; Goldsmith, J.; Schlipf, J.; Speckenmeyer, E.; Swaminathan, R. P.: An Algorithm for the Class of Pure Implicational Formulas. In: Discrete Applied Mathematics, Volume 96-97, 1999, pp. 89-106.

1998

  • Meisgen, Frank; Speckenmeyer, Ewald: The PLB-Library: Dynamic Load Balancing on NOWs. In: Anwendungsbezogene Lastverteilung ALV'98, SFB-342 TU München, Bode, A.; Ganz, A.; et al (Ed.), 1998, pp. 89-99. 
  • Holland-Moritz, A.: Simulation von Schienenverkehr im ÖPNV. Diplomarbeit, Univ. Köln, 1998.
  • Meisgen, Frank: Dynamische Lastausgleichsverfahren in heterogenen Netzwerken - Entwurf und Implementierung einer Klassenbibliothek zur Lastbalancierung paralleler Programme. Doktorarbeit, Univ. Köln, 1998.
  • Niessen, T.; Randerath, B.: Regular Factors of Simple Regular Graphs, and Factor Spectra. In: Discrete Mathematics, Volume 185, 1998, pp. 89-103.
  • Randerath, B.; Volkmann, L.: Characterization of Graphs with equal Domination and Covering Number. In: Discrete Mathematics, Volume 191, pp. 159-169.
  • Randerath, Bert: The Vizing Bound for the Chromatic Number based on Forbidden Pairs. Doktorarbeit, Shaker Verlag, RWTH Aachen, 1998.
  • Randerath, B.; Schiermeyer, I.: Colouring Graphs with Prescribed Induced Cycle Lengths. Technical Report 98.341, Univ. Köln, 1998.
  • Franco, J.; Gallo, G.; Kleine Büning, H.; Speckenmeyer, E.: 2nd Workshop on the Satisfiability Problem. Technical Report tr-ri-98-196, Universität-GH Paderborn, 1998.

1997

  • Franco, J.; Goldsmith, J.; Schlipf, J.; Speckenmeyer, E.; Swaminathan, R. P.: An Algorithm for the Class of Pure Implicational Formulas. Technical Report 97.270, Univ. Köln, to appear in: Discrete Applied Mathematics, 1997.
  • Heusch, Peter; Meisgen, Frank; Speckenmeyer, Ewald: CATS - Computer Aided Tram Scheduling. Technical Report 97.262, Univ. Köln, 1997.
  • Meisgen, Frank; Speckenmeyer, Ewald: Dynamic Load Balancing on Heterogenous Workstation Clusters. Technical Report 97.261, Univ. Köln, 1997.
  • Meisgen, Frank: Dynamic Load Balancing for Simulations of Biological Aging. In: International Journal of Modern Physics C, Volume 8, Number 3, 1997, pp. 575-582.
  • Schwikowski, B.; Speckenmeyer, E.: On Computing all Minimal Solutions for Feedback Problems. Technical Report 97.287, Univ. Köln, 1997.
  • Seifert, Thomas: Routingprobleme und die gruppenspezifische Simulation von Shared Memory auf verteilten Systemen. Doktorarbeit, Univ. Köln, 1997.
  • Randerath, B.; Volkmann, L.: Simplicial Graphs and Relationships to Different Graph Invariants. In: Ars Combinatoria, Volume 46, 1997, pp. 211-217.
  • Böhm, M.; Speckenmeyer, E.: Precomputation-Based Load Balancing. In: Proceedings of the 4th PASA Workshop, World Scientific, Hoßfeld, D; Maehle, E.; Mayer, E. W. (Ed.), 1997, pp. 177-194.

1996

  • Böhm, M.; Speckenmeyer, E.: A Fast Parallel SAT-Solver - Efficient Workload Balancing. In: Annals of Mathematics and Artificial Intelligence, Volume 17, 1996, pp. 381-400.
  • Böhm, M.; Speckenmeyer, E.: Precomputation-Based Load Balancing. Technical Report 96.219, Univ. Köln, to appear in: Proceedings of the 4th PASA Workshop, 1996.
  • Böhm, M.: Verteilte Lösung harter Probleme: Schneller Lastausgleich. Doktorarbeit, Univ. Köln, Shaker Verlag, Aachen, 1996.
  • Franco, J.; Gallo, G.; Kleine Büning, H.; Speckenmeyer, E.; Spera, C.: Workshop on the Satisfiability Problem. Technical Report 96.230, Univ. Köln, 1996.
  • Meisgen, Frank; Speckenmeyer, Ewald: Precomputation-based Load Balancing zur Parallelisierung von Best-First Search Algorithmen. In: Paralleles und Verteiltes Rechnen. Beiträge zum 4. Workshop über Wissenschaftliches Rechnen, Shaker Verlag, Matthies, H.; Schüle, J. (Ed.), 1996, pp. 39-48.
  • Seifert, Thomas; Speckenmeyer, Ewald: Optimal Oblivious Permutation Routing in Small Hypercubes. In: Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware, Proc. 4. PASA Workshop, Jülich, 1996, pp. 53-66, also available as: Technical Report 96.218, Univ. Köln, 1996.
  • Speckenmeyer, E.; Böhm, M.; Heusch, P.: On the Imbalance of Distributions of Solutions of CNF-Formulas and its Impact on Satisfiability Solvers. In: Satisfiability Problem: Theory and Application, DIMACS Series in discrete mathematics and theoretical computer science, Volume 35, Du, D.; Gu, J.; Pardalos, P. M. (Ed.), 1996, pp. 669-676.

1995

  • Heusch, Peter: The Complexity of the Falsifiability Problem for Pure Implicational Formulas. In: Proceedings of the 20th Conference on Mathematical Foundations of Computer Science 1995 (MFCS '95), Springer Verlag (LNCS~969), 1995, pp. 221-227.
  • Seifert, Thomas; Speckenmeyer, Ewald: Simulation of Shared Memory Operations on Distributed Memory Machines. In: SAMS, Volume 17, 1995, pp. 45-66.

1994

  • Böhm, M.; Seifert, Th.; Speckenmeyer, E.: Workload Balancing on Trees, Grids, Hypercubes and Cliques. University of Düsseldorf, Germany, 1994.
  • Böhm, M.; Speckenmeyer, E.: Effiziente Lastausgleichsalgorithmen. In: Parallele Datenverarbeitung aktuell: TAT'94, IOS Press, Grebe, R.; Flieger, R. (Ed.), 1994, pp. 53-60.
  • Randerath, B.; Volkmann, L.: A Characterization of Well Coverd Block-Cactus Graphs. In: Australasian Journal of Combinatorics, Volume 9, 1994, pp. 307-314.

1993

  • Böhm, M.; Speckenmeyer, E.: Ein Paralleler SAT-Solver auf Transputern. In: Parallele Datenverarbeitung mit dem Transputer, Proceecings des 4. Transputer-Anwender-Treffen 1992, Aachen, Springer Verlag (Reihe Informatik aktuell), Grebe, R.; Ziemann, C. (Ed.), 1993, pp. 235-244.
  • Heusch, Peter: Implikationen der Implikation. Doktorarbeit, Heinrich-Heine-Universität Düsseldorf, 1993.
  • Seifert, Thomas; Speckenmeyer, Ewald: A Simple Simulation of Concurrent Write Operations on Distributed Memory Machines. In: Transputer Applications and Systems '93, Volume 2, IOS Press, Grebe, R.; Ziemann, C. (Ed.), 1993, pp. 1076-1082.
  • Seifert, Thomas; Speckenmeyer, Ewald: Simulation von Shared-Memory-Operationen auf verteilten Systemen. In: 8. Symposium zur Simulationstechnik, Band 6, Vieweg, Achim Sydow (Ed.), 1993, pp. 421-424.
  • Seifert, Thomas; Speckenmeyer, Ewald: Zur Simulation von Shared-Memory auf Transputernetzwerken. In: Parallele Datenverarbeitung mit dem Transputer, Proceedings des 4. Transputer-Anwender-Treffen 1992, Aachen, Springer (Reihe Informatik aktuell), Grebe, R.; Ziemann, C. (Ed.), 1993, pp. 51-60.
  • Seifert, Thomas: Das Library-Paket parC. Heinrich-Heine-Universität Düsseldorf, 1993.
  • Randerath, Bert: Well-Coverdness in Simplicial and Block-Cactus Graphs. Diplomarbeit, RWTH Aachen, 1993.
  • Böhm, M.; Speckenmeyer, E.: A Fast Parallel SAT-Solver - Efficient Workload Balancing. Heinrich-Heine-Universität Düsseldorf, 1993.

1992

  • Heusch, Peter; Speckenmeyer, Ewald: Some Aspects of the Probabilistic Behaviour of Variants of Resolution. In: Procceedings of Computer Science Logic 1991 (CSL '91), Springer Verlag (LNCS 626), 1992, pp. 164-172.
  • Rosenthal, J. W.; Speckenmeyer, E.; Kemp, R.: Exact-Satisfiability, a Natural Extension of Set Partitioning. In: Annals of Mathematics and Artificial Intelligence, Volume 6, 1992, pp. 185-200.
  • Seifert, Thomas: Syntax und Semantik der parallelen Programmiersprache PRAM. Heinrich-Heine-Universität Düsseldorf, 1992.

1991

  • Böhm, M.; Speckenmeyer, E.: Parallele Dynamische Spielbaumauswertung auf Transputern. In: Parallele Datenverarbeitung mit dem Transputer, Proceedings des 2. Transputer-Anwender-Treffen 1990, Aachen, Springer Verlag (Informatik Fachberichte 272), Grebe, R.; Ziemann, C. (Ed.), 1991, pp. 80-87.
  • Seifert, Thomas; Speckenmeyer, Ewald: Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM (Hauptvortrag). In: Parallele Datenverarbeitung mit dem Transputer, Proceedings des 2. Transputer-Anwender-Treffen 1990, Aachen, Springer (Informatik Fachberichte 272), Grebe, R.; Ziemann, C. (Ed.), 1991, pp. 103-110.

1990

  • Böhm, M.; Speckenmeyer, E.: A Dynamic Processor Tree for Solving Game Trees in Parallel. In: Methods of Operations Research, Volume 63, 1990, pp. 479-489.
  • Seifert, Thomas: Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM. Diplomarbeit, Univ. Dortmund, 1990.
  • Speckenmeyer, E.; Kemp, R.: On the Average Time Behavior of Set Partioning. In: Proceedings of Computer Science Logic 1989 (CSL '89), Springer Verlag (LNCS 440), 1990, pp. 369-381.
  • Speckenmeyer, E.; Siemon, H.-P.: Parallelisierung algorithmischer Paradigmen auf Transputernetzwerken. Abschlußbericht der Projektgruppe PAPT (SS 1989 und WS 1989/90), Univ. Dortmund, FB Informatik.

1989

  • Speckenmeyer, Ewald: Is Average Superlinear Speedup Possible? In: Proceedings of Computer Science Logic 1988 (CSL '88), Springer Verlag (LNCS 385), 1989, pp. 301-312.
  • Speckenmeyer, Ewald: On Feedback Problems in Digraphs. In: Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science WG '89 (Castle Rolduc, The Netherlands, June 1989), Springer-Verlag, LNCS 411, Nagel, M. (Ed.), 1989, pp. 218-231.

1988

  • Speckenmeyer, Ewald: Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact Satisfiablity. In: Proceedings of 13th Conference of Mathematical Foundations of Computer Science 1988 (MFCS '88), Springer Verlag (LNCS 324), 1988, pp. 529-537.
  • Speckenmeyer, Ewald: On Feedback Vertex Sets and Nonseparating Independent Sets in Cubic Graphs. In: Journal of Graph Theory, Volume 12, Number 3, 1988, pp. 405-412.
  • Speckenmeyer, Ewald: On the Average Case Behavior of Backtracking for the Satisfiability and Exact Satisfiability Problem. Habilitationsschrift, Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 50, 1988.

1987

  • Speckenmeyer, E.; Monien, B.; Vornberger, O.: Superlinear Speedup for Parallel Backtracking. In: Proceedings of Supercomputing 1987 (ICS '87), Springer Verlag (LNCS 292), 1987, pp. 985-993.
  • Speckenmeyer, Ewald: On the Average Case Complexity of Backtracking for the Exact Satisfiability Problem. In: Proceedings of Computer Science Logic 1987 (CSL '87), Springer Verlag (LNCS 329), 1987, pp. 281-288, full version in: Forschungsbericht Nr. 244/1987, Abt. Informatik, Universität Dortmund.

1986

  • Speckenmeyer, Ewald: Bounds of Feedback Vertex Sets of Undirected Cubic Graphs. In: Colloquia Mathematica Societatis Janos Bolyai, 42. Algebra, Combinatorics and Logic in Computer Science 1983 in Györ (Hungary), pp. 719-729.

1985

  • Monien, B.; Speckenmeyer, E.: Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. In: Acta Informatica, Volume 22, Number 1, 1985, pp. 115-123.
  • Monien, B.; Speckenmeyer, E.: Solving Satisfiability in Less than 2^n. In: Discrete Applied Mathematics, North-Holland Publishing Company, Volume 10, Number 3, 1985, pp. 287-295.

1984

  • Monien, B.; Speckenmeyer, E.: Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. In: Proceedings of International Frege Conference 1984, Akademie-Verlag, 1984, pp. 345-353.

1983

  • Monien, B.; Speckenmeyer, E.: Some Further Approximation Algorithms for the Vertex Cover Problem. In: Proceedings of 8th Coll. on Trees in Algebra and Programming (CAAP '83),Springer Verlag (LNCS 159), Goos, G.; Hartmanis, J. (Ed.), 1983, pp. 341-349.
  • Speckenmeyer, Ewald: Untersuchungen zum Feedback Vertex Set Problem in ungerichteten Graphen. Doktorarbeit, Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 16, 1983.

1982

  • Monien, B.; Speckenmeyer, E.; Vornberger, O.: Upper Bounds for Covering Problems. In: Methods of Operations Research, Volume 43, 1982, pp. 341-349.

1980

  • Monien, B.; Speckenmeyer, E.; Vornberger, O.: Upper Bounds for Covering Problems (full version). Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 7, 1980.

1979

  • Monien, B.; Speckenmeyer, E.: 3-Satisfiability is Testable in O(1,62^r). Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 3, 1979.