You can find here our publications in journals, conference proceedings, and our technical reports.

Articles in Journals

Contributions in Refereed Conference Proceedings

Technical Reports

  • Derandomizing non-uniform color-coding I.
    Technical Report AIB-2009-07, RWTH Aachen University, March 2009.
  • Satellites and mirrors for solving independent set on sparse graphs.
    Technical Report AIB-2009-08, RWTH Aachen University, April 2009.
  • L. Brankovic, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, D. Raible, and P. Rossmanith.
    Breaking the 2n-barrier for irredundance: A parameterized route to solving exact puzzles.
    Technical Report abs/0909.4224, CoRR, 2009.
  • A new algorithm for finding trees with many leaves.
    Technical Report AIB-2008-15, Dept. of Computer Science, RWTH Aachen University, July 2008.
  • Divide-and-color.
    Technical Report AIB-2006-06, RWTH Aachen University, May 2006.
  • A faster algorithm for the Steiner tree problem.
    Technical Report AIB-2005-04, Dept. of Computer Science, RWTH Aachen University, March 2005.
  • A new satisfiability algorithm with applications to Max-Cut.
    Technical Report AIB-2005-08, Dept. of Computer Science, RWTH Aachen University, April 2005. A short version to appear in Proc. of WG2005.
  • Maximum exact satisfiability: NP-completeness proofs and exact algorithms.
    Technical Report RS-04-19, BRICS, October 2004.
  • Parameterized power domination complexity.
    Technical Report AIB-2004-09, Dept. of Computer Science, RWTH Aachen University, December 2004.
  • Efficient algorithms for model checking pushdown systems.
    Technical Report TUM-I0002, SFB-Bericht 342/1/00 A, Technische Universität München, Institut für Informatik, February 2000.
  • A general method to speed up fixed-parameter-tractable algorithms.
    Technical Report TUM-I9913, Institut für Informatik, Technische Universität München,Fed. Rep. of Germany, June 1999. Revised version to appear in Information Processing Letters.
  • An efficient fixed parameter algorithm for 3-Hitting Set.
    Technical Report WSI-99-18, WSI für Informatik, Universität Tübingen, Fed. Rep. of Germany, October 1999. Revised version accepted for publication in Journal of Discrete Algorithms.
  • Learning k-variable pattern languages efficiently stochastic finite on average from positive data.
    DOI Technical Report DOI-TR-145, Department of Informatics, Kyushu University, January 1998.
  • Upper bounds for vertex cover further improved.
    Technical Report KAM-DIMATIA Series 98-411, Faculty of Mathematics and Physics, Charles University, Prague, November 1998.
  • New upper bounds for MaxSat.
    Technical Report KAM-DIMATIA Series 98-401, Faculty of Mathematics and Physics, Charles University, Prague, July 1998. Extended abstract to appear at 26th International Colloquium on Automata, Languages, and Programming (ICALP'99), Prague, July 1999.
  • Extended locally definable acceptance types.
    Technical Report WSI-96-25, Universität Tübingen, August 1996.
  • Optimal deterministic sorting and routing on grids and tori with diagonals.
    Technical Report TUM-I9629, Technische Universität München, Institut für Informatik, July 1996.
  • Efficient learning of one-variable pattern languages from positive examples.
    DOI Technical Report DOI-TR-128, Department of Informatics, Kyushu University, December 1996.
  • Expressing uniformity via oracles.
    Technical Report 95-01, Universität Trier, Fachbereich IV-Informatik und Mathematik, 54286 Trier, Fed. Rep. of Germany, January 1995.
  • Faster sorting and routing on grids with diagonals.
    Technical Report TUM-I9313, SFB-Bericht Nr. 342/5/93 A, Institut für Informatik, Technische Universität München, June 1993.
  • Optimal parallel algorithms for computing recursively defined functions.
    Technical Report TUM-I9218, SFB-Bericht Nr. 342/12/92 A, Technische Universität München, June 1992.
  • The owner concept for PRAMs.
    SFB-Bericht 342/15/90 A, I9028, Institut für Informatik, Technische Universität München, August 1990.
  • I. Niepel and P. Rossmanith.
    Uniform circuits and exclusive read PRAMs.
    SFB-Bericht 342/31/90 A, I9055, Institut für Informatik, Technische Universität München, December 1990.
  • Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits.
    SFB-Bericht 342/31/90 A, I9054, Institut für Informatik, Technische Universität München, December 1990.
  • Two Results on Unambiguous Circuits.
    SFB-Bericht 342/3/90 A, I9006, Institut für Informatik, Technische Universität München, 1990.