Publikationen
Erscheinungsjahr:
| 2010 |
Walter, D.
Optimierung von ÖPNV-Fahrplänen unter Berücksichtigung verkehrsplanerischer Vorgaben Diplomarbeit, Univ. Köln, 2010 |
| 2009 |
Porschen, S.
On rectangular covering problems Int. Journal Comp. Geometry & Appl. 19, 325-340 (2009) |
Porschen, S., Schmidt, T., Speckenmeyer, E.
On Some Aspects of Mixed Horn Formulas Lecture Notes in Computer Science, Vol. 5584, 86-100 (2009) |
Porschen, S., Speckenmeyer, E., Zhao, X.
Linear CNF formulas and satisfiability Discrete Appl. Math. 157, 1046-1068 (2009) |
Porschen, S., Schmidt, T.
On Some SAT-Variants over Linear Formulas Lecture Notes in Computer Science, Vol. 5404, 449-460 (2009) |
| 2008 |
Porschen, S., Speckenmeyer, E.
A CNF Class Generalizing Exact Linear Formulas Lecture Notes in Computer Science, Vol. 4996, 231-245 (2008) |
Ullrich, O., Speckenmeyer, E.
Parallelisierung der Simulation von ÖPNV-Netzen 5. ASIM-Treffen Grundlagen und Methoden von Modellierung und Simulation, 18.-20. Februar 2008 |
Niepel, S.
Ganztagesfahrplanoptimierung im ÖPNV mit naturanalogen Methoden Diplomarbeit, Univ. Köln, 2008 |
Plagge, G., Porschen, S.
Über Variablen-Gewichtete X3SAT-Probleme 54. Workshop über Algorithmen und Komplexität, Universität Hannover, 5. März 2008 |
| 2007 |
Porschen, S.
On variable-weighted exact satisfiability problems Ann. Math. Artif. Intell., Vol. 51, 27 - 54 (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., Speckenmeyer, E.
Clause set structures and satisfiability Techn. Report zaik2007-532, 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 |
Schön, A.
Optimierung von Stadtbahnfahrplänen - Ein Genetischer Algorithmus sowie Simulation der Optimalfahrpläne unter Einbeziehung des n Diplomarbeit, Univ. Köln, 2007 |
Porschen, S.
On generalizations of the shadow independent set problem Discrete Math., Vol. 37, 1473 - 1485 (2007) |
Porschen, S., Speckenmeyer, E.
Satisfiability of mixed Horn formulas Discrete Appl. Math., Vol. 155, 1408 - 1419 (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.
Structural and computational aspects of restricted Boolean formulas Habilitationsschrift, Univ. Köln, 2007 |
| 2006 |
Porschen, S.
Algorithms for Rectangular Covering Problems Lecture Notes in Computer Science, Vol. 3980, 40-49 (2006) |
Porschen, S.
Counting All Solutions of Minimum Weight Exact Satisfiability Lecture Notes in Computer Science, Vol. 3998, 50-59 (2006) |
Ullrich, O.
CATSview - Eine Benutzerschnittstelle zur Steuerung, Visualisierung und Ergebnisauswertung von Fahrplansimulationen im 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) |
Plagge, G.
Über Variablen-Gewichtete X3SAT Optimierungsprobleme Diplomarbeit, Univ. Köln, 2006 |
Porschen, S, Speckenmeyer, E.
Linear CNF formulas and satisfiability Techn. Report zaik2006-520, Univ. Köln, 2006 |
Porschen, S.
On variable-weighted exact satisfiability problems Techn. Report zaik2006-526, Univ. Köln, 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., 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 |
| 2005 |
Porschen, S.
Counting All Solutions of Minimum Weight Exact Satisfiability Technical Report: zaik2005-500, Universität zu Köln (2005) |
Porschen, S.
A New Parameterization of the Shadow Problem Technical Report: zaik2005-501, Universität zu Köln (2005) |
Achter, V.
Radial Level Planarity in a Propositional Logic Framework 2005, Universität zu Köln, Diplomarbeit (2005) |
Porschen, S.
Solving Minimum Weight Exact Satisfiability in Time O(2 |
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., 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) |
Rühmkorf, J.
Entwicklung eines leistungsfähigen Lösers für Quantifizierte Boolesche Formeln 2005, Universität zu Köln, Diplomarbeit (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(2^0.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) |
| 2004 |
Randerath, B., Schiermeyer, I.
Vertex-Colouring and Forbidden Subgraphs - a Survey Graphs and Combinatorics, Vol. 20(1), 1-40 (2004) |
Randerath, B., Schiermeyer, I.
3-Colorability is in P for P |
Randerath, B.
3-Colorability and Forbidden Subgraphs. I: Characterizing Pairs Discrete Mathematics, Vol. 276(1-3), 313-325 (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) |
Porschen, S.
On the Time Complexity of Rectangular Covering Problems in Discrete Plane Lecture Notes in Computer Science, Vol. 3045, 137-146 (2004) |
Holz, P.
Online-Colouring of Claw-Free Graphs by Using the Strategy of First-Fit 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) |
Kesavan Cheemplavam, P.
Optimierung der LBC auf Switched Ethernet 2004, Universität zu Köln, Diplomarbeit (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 |
Randerath, B.
Graph Colouring and Satisfiability Problems for Restricted Classes of Instances 2004, Habilitationsschrift, Universität zu Köln (2004) |
| 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) |
Franco, J., Kleine Büning, H., Speckenmeyer, E. (Editors)
Results on Satisfiability in Propositional Logic http://springerlink.metapress.com/link.asp?id=g3fqvrf2fpdr |
Speckenmeyer, E., Franco, J., van Maaren, H. (Editors)
The Renesse Issue on Satisfiability http://www.sciencedirect.com/science/journal/0166218X |
Porschen, S.
On the Rectangular Grid Hull of Point Sets and DAG's in the Plane zaik2004-463 |
Heusch, P., Porschen, S., Speckenmeyer, E.
Improving a fixed parameter tractability time bound for the shadow problem 10.1016/S0022-0000(03)00079-5 |
Genç, Z.
Ein neuer Ansatz zur Fahrplanoptimierung im ÖPNV: Maximierung von zeitlichen Sicherheitabständen. urn:nbn:de:hbz:38-9505 |
Randerath, B., Schiermeyer, I.
Vertex-colouring and forbidden subgraphs - a survey zaik2003-453 |
Porschen, S.
A New Duality Principle for Hypergraphs and Propositional Formulas zaik2004-464 |
Le, V. B., Randerath, B.
On Stable Cutsets in Line Graphs 10.1016/S0304-3975(03)00048-3 |
Kochol, M., Lozin, V., Randerath, B.
The 3-colorability problem on graphs with maximal degree 4 10.1137/S0097539702418759 |
Porschen, S.
Time Complexity of Rectangular Covering Problems in the Discrete Plane zaik2004-462 |
| 2002 |
Randerath, B., Vestergaard, P. D.
On Well-Covered Graphs of Odd Girth 7or Greater http://www.uz.zgora.pl/discuss/gt/22_1/gt22rand.htm |
Randerath, B., Schiermeyer, I.
A Note on Brooks' Theorem forTriangle-Free Graphs http://ajc.math.auckland.ac.nz/volume_contents.php3?vol=26 |
Randerath, B., Schiermeyer, I., Tewes, M.
3-Colourability and Forbidden Subgraphs. II: Polynomial Algorithms 10.1016/S0012-365X(01)00335-1 |
Randerath, B., Schiermeyer, I., Tewes, M., Volkmann, L.
Vertex-Pancyclic Graphs 10.1016/S0166-218X(01)00292-X |
Porschen, S., Randerath, B., Speckenmeyer, E.
Exact 3-Satisfiability is decidable in time 0(2 |
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) |
Mellin, S.
Polynomielle Färbungsalgorithmen für P |
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.
Well-Covered Graphs and Factors http://www.math.auc.dk/research/reports/2002.htm |
Schwikowski, B., Speckenmeyer, E.
On Computing all Minimal Solutions for Feedback Problems 10.1016/S0166-218X(00)00339-5 |
Porschen, S.
On Generalizations of the Shadow Independent Set Problem zaik2004-461 |
Joisten, M.
Simulation von Fahrplänen für den ÖPNV mittels Zellularautomaten 2002, Universität zu Köln, Diplomarbeit (2002) |
| 2001 |
Harant, J., Jendrol, S., Randerath, B., Ryjacek, Z., Schiermeyer, I., Voigt, M.
On Weights of Induced Paths and Cycles in Claw-Free and K |
Porschen, S.
Upper Bounds for Rectangular Covering Problems on Integer Lattices zaik2001-424 |
Randerath, B., Speckenmeyer, E., Boros, E., Cepek, O., Hammer, P., Kogan, A., Makino, A., Simeone, B.
A Satisfiability Formulation of Problems on Level Graphs 10.1016/S1571-0653(04)00327-0 |
Genç, Z., Speckenmeyer, E.
Fahrplanoptimierung im ÖPNV zaik2001-426 |
Porschen, S.
On Covering Z-Grid Points by Rectangles http://www.sciencedirect.com/science/journal/15710653 |
| 2000 |
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) |
| 1999 |
Franco, J., Goldsmith, J., Schlipf, J., Speckenmeyer, E., Swaminathan, R. P.
An Algorithm for the Class of Pure Implicational Formulas 10.1016/S0166-218X(99)00038-4 |
Randerath, B., Vestergaard, P.D.
A Note on Well-Covered Graphs with Odd Girth http://www.math.auc.dk/research/reports/1999.htm |
Randerath, B., Schiermeyer, I., Wang, H.
On Quadrilaterals in a Graph 10.1016/S0012-365X(99)00053-9 |
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) |
| 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) |
Randerath, B., Schiermeyer, I.
Colouring Graphs with Prescribed Induced Cycle Lengths zpr98-341 |
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 10.1016/S0012-365X(98)00103-4 |
Niessen, T., Randerath, B.
Regular Factors of Simple Regular Graphs, and Factor Spectra 10.1016/S0012-365X(97)00166-0 |
Meisgen, F.
Dynamische Lastausgleichsverfahren in heterogenen Netzwerken -- Entwurf und Implementierung einer Klassenbibliothek zu 3-8265-4434-X |
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) |
| 1997 |
Seifert, Th.
Routingprobleme und die gruppenspezifische Simulation von Shared Memory auf verteilten Systemen 3-8265-3561-8 |
Schwikowski, B., Speckenmeyer, E.
On Computing all Minimal Solutions for Feedback Problems zpr97-287 |
Meisgen, F.
Dynamic Load Balancing for Simulations of Biological Aging zpr97-269 |
Meisgen, F., Speckenmeyer, E.
Dynamic Load Balancing on Heterogenous Workstation Clusters zpr97-261 |
Heusch, P., Meisgen, F., Speckenmeyer, E.
CATS-Computer Aided Tram Scheduling zpr97-262 |
Franco, J., Goldsmith, J., Schlipf, J., Speckenmeyer, E., Swaminathan, R. P.
An Algorithm for the Class of Pure Implicational Formulas zpr97-270 |
Böhm, M., Speckenmeyer, E.
Precomputation-Based Load Balancing Proceedings of the 4th PASA Workshop,1996, World Scientific, 177-194, 1997, Editors: F. Hoßfeld and E. Maehle and E. W. Mayer (1997) |
Randerath, B., Volkmann, L.
Simplicial Graphs and Relationships to Different Graph Invariants http://bkocay.cs.umanitoba.ca/ArsComb/Vol46.html |
| 1996 |
Meisgen, F., Speckenmeyer, E.
Precomputation-based Load Balancing zur Parallelisierung von Best-First Search Algorithmen Paralleles und Verteiltes Rechnen. Beiträge zum 4. Workshop über Wissenschaftliches Rechnen, Shaker Verlag, 39-48, 1996, Editors: Matthies, H., Schüle, J. (1996) |
Franco, J., Gallo, G., Kleine Büning, H., Speckenmeyer, E., Spera, C.
Workshop on the Satisfiability Problem zpr96-230 |
Seifert, Th., Speckenmeyer, E.
Optimal Oblivious Permutation Routing in Small Hypercubes zpr96-218 |
Böhm, M.
Verteilte Lösung harter Probleme: Schneller Lastausgleich 3-8265-1325-8 |
Böhm, M., Speckenmeyer, E.
Precomputation-Based Load Balancing zpr96-219 |
Böhm, M., Speckenmeyer, E.
A Fast Parallel SAT-Solver -- Efficient Workload Balancing http://www.kluweronline.com/issn/1012-2443 |
Speckenmeyer, E., Böhm, M., Heusch, P.
On the Imbalance of Distributions of Solutions of CNF-Formulas and its Impact on Satisfiability Solvers http://dimacs.rutgers.edu/Volumes/Vol35.html |
| 1995 |
Seifert, Th., Speckenmeyer, E.
Simulation of Shared Memory Operations on Distributed Memory Machines SAMS, Vol. 17, 45-66 (1995) |
Heusch, P.
The Complexity of the Falsifiability Problem for Pure Implicational Formulas zpr95-189 |
| 1994 |
Böhm, M., Speckenmeyer, E.
Effiziente Lastausgleichsalgorithmen Parallele Datenverarbeitung aktuell: TAT'94, IOS Press, 53-60, 1994, Editors: R. Grebe and R. Flieger (1994) |
Randerath, B., Volkmann, L.
A Characterization of Well Coverd Block-Cactus Graphs Australas. J. Combin., Vol. 9, 307-314 (1994) |
Böhm, M., Seifert, Th., Speckenmeyer, E.
Workload Balancing on Trees, Grids, Hypercubes and Cliques 1994, University of Düsseldorf, Germany (1994) |
| 1993 |
Böhm, M., Speckenmeyer, E.
A Fast Parallel SAT-Solver -- Efficient Workload Balancing 1993, Heinrich-Heine-Universität Düsseldorf (1993) |
Böhm, M., Speckenmeyer, E.
Ein Paralleler SAT-Solver auf Transputern Parallele Datenverarbeitung mit dem Transputer, Proc. 4. Transputer-Anwender-Treffen 1992, Aachen, Springer Verlag (Reihe Informatik aktuell), 235-244, 1993, Editors: R. Grebe and C. Ziemann (1993) |
Heusch, P.
Implikationen der Implikation 1993, Heinrich-Heine-Universität Düsseldorf, Doktorarbeit (1993) |
Seifert, Th., Speckenmeyer, E.
A Simple Simulation of Concurrent Write Operations on Distributed Memory Machines Transputer Applications and Systems '93, Vol. 2, IOS Press, 1076-1082, 1993, Editors: R. Grebe and C. Ziemann (1993) |
Seifert, Th., Speckenmeyer, E.
Simulation von Shared-Memory-Operationen auf verteilten Systemen 8. Symposium zur Simulationstechnik, Band 6, Vieweg, 421-424, 1993, Editor: Achim Sydow (1993) |
Seifert, Th., Speckenmeyer, E.
Zur Simulation von Shared-Memory auf Transputernetzwerken Parallele Datenverarbeitung mit dem Transputer, Proc. 4. Transputer-Anwender-Treffen 1992, Aachen, Springer (Reihe Informatik aktuell), 51-60, 1993, Editors: R. Grebe and C. Ziemann (1993) |
Seifert, Th.
Das Library-Paket parC 1993, Heinrich-Heine-Universität Düsseldorf (1993) |
Randerath, B.
Well-Coverdness in Simplicial and Block-Cactus Graphs 1993, RWTH Aachen, Diplomarbeit (1993) |
| 1992 |
Heusch, P., Speckenmeyer, E.
Some Aspects of the Probabilistic Behaviour of Variants of Resolution Proc. Computer Science Logic 1991 (CSL '91), Springer Verlag (LNCS 626), 164-172 (1992) |
Rosenthal, J. W., Speckenmeyer, E., Kemp, R.
Exact-Satisfiability, a Natural Extension of Set Partitioning Annals of Mathematics and Artificial Intelligence, Vol. 6, 185-200 (1992) |
Seifert, Th.
Syntax und Semantik der parallelen Programmiersprache PRAM 1992, Heinrich-Heine-Universität Düsseldorf (1992) |
| 1991 |
Seifert, Th., Speckenmeyer, E.
Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM (Hauptvortrag) Parallele Datenverarbeitung mit dem Transputer, Proc. 2. Transputer-Anwender-Treffen 1990, Aachen, Springer (Informatik Fachberichte 272), 103-110, 1991, Editors: R. Grebe and C. Ziemann (1991) |
Böhm, M., Speckenmeyer, E.
Parallele Dynamische Spielbaumauswertung auf Transputern Parallele Datenverarbeitung mit dem Transputer, Proc. 2. Transputer-Anwender-Treffen 1990, Aachen, Springer Verlag (Informatik Fachberichte 272), 80-87, 1991, Editors: R. Grebe and C. Ziemann (1991) |
| 1990 |
Seifert, Th.
Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM 1990, Universität Dortmund, Diplomarbeit (1990) |
Speckenmeyer, E., Kemp, R.
On the Average Time Behavior of Set Partioning Proc. Computer Science Logic 1989 (CSL '89), Springer Verlag (LNCS 440), 369-381 (1990) |
Böhm, M., Speckenmeyer, E.
A Dynamic Processor Tree for Solving Game Trees in Parallel Methods of Operations Research, Vol. 63, 479-489 (1990) |
Speckenmeyer, E., Siemon, H.-P.
Parallelisierung algorithmischer Paradigmen auf Transputernetzwerken University of Dortmund, FB Informatik, Abschlußbericht der Projektgruppe PAPT (SS 1989 und WS 1989/90) (1990) |
| 1989 |
Speckenmeyer, E.
On Feedback Problems in Digraphs 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, 218-231, 1989, Editor: Nagl, M. (1989) |
Speckenmeyer, E.
Is Average Superlinear Speedup Possible? Proc. Computer Science Logic 1988 (CSL '88), Springer Verlag (LNCS 385), 301-312 (1989) |
| 1988 |
Speckenmeyer, E.
On the Average Case Behavior of Backtracking for the Satisfiability and Exact Satisfiability Problem 1988, Universität-GH Paderborn, Habilitationsschrift, Reihe Informatik, Bericht Nr. 50 (1988) |
Speckenmeyer, E.
On Feedback Vertex Sets and Nonseparating Independent Sets in Cubic Graphs J. Graph Theory, Vol. 12, No. 3, 405-412 (1988) |
Speckenmeyer, E.
Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact Satisfiablity Proc. 13th Conf. Math. Foundations of Computer Science 1988 (MFCS '88), Springer Verlag (LNCS 324), 529-537 (1988) |
| 1987 |
Speckenmeyer, E.
On the Average Case Complexity of Backtracking for the Exact Satisfiability Problem Proc. Computer Science Logic 1987 (CSL '87), Springer Verlag (LNCS 329), 281-288, 1987 full version in: Forschungsbericht Nr. 244/1987, Abt. Informatik, Universität Dortmund (1987) |
Speckenmeyer, E., Monien, B., Vornberger, O.
Superlinear Speedup for Parallel Backtracking Proc. Supercomputing 1987 (ICS '87), Springer Verlag (LNCS 292), 985-993 (1987) |
| 1986 |
Speckenmeyer, E.
Bounds of Feedback Vertex Sets of Undirected Cubic Graphs Colloquia Mathematica Societatis Janos Bolyai, 42. Algebra, Combinatorics and Logic in Computer Science 1983 in Györ (Hungary), 719-729 (1986) |
| 1985 |
Monien, B., Speckenmeyer, E.
Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem Acta Informatica, Vol. 22, No. 1, 115-123 (1985) |
Monien, B., Speckenmeyer, E.
Solving Satisfiability in Less than 2^n North-Holland Publishing Company, Discrete Appl. Math., Vol. 10, No. 3, 287-295 (1985) |
| 1984 |
Monien, B., Speckenmeyer, E.
Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem Proc. Int. Frege Conf. 1984, Akademie-Verlag, 345-353 (1984) |
| 1983 |
Speckenmeyer, E.
Untersuchungen zum Feedback Vertex Set Problem in ungerichteten Graphen 1983, Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 16, Doktorarbeit (1983) |
Monien, B., Speckenmeyer, E.
Some Further Approximation Algorithms for the Vertex Cover Problem Proc. 8th Coll. on Trees in Algebra and Programming (CAAP '83),Springer Verlag (LNCS 159), 341-349, 1983, Editors: G. Goos and J. Hartmanis (1983) |
| 1982 |
Monien, B., Speckenmeyer, E., Vornberger, O.
Upper Bounds for Covering Problems Methods of Operations Research, Vol. 43, 341-349 (1982) |
| 1980 |
Monien, B., Speckenmeyer, E., Vornberger, O.
Upper Bounds for Covering Problems (full version) 1980, Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 7 (1980) |
| 1979 |
Monien, B., Speckenmeyer, E.
3-Satisfiability is Testable in O(1,62^r) 1979, Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 3 (1979) |