Peter Rossmanith
Peter Rossmanith
Professor of Computer Science, RWTH Aachen University
Verified email at cs.rwth-aachen.de - Homepage
Title
Cited by
Cited by
Year
Efficient algorithms for model checking pushdown systems
J Esparza, D Hansel, P Rossmanith, S Schwoon
International Conference on Computer Aided Verification, 232-247, 2000
4402000
An efficient fixed-parameter algorithm for 3-Hitting Set
R Niedermeier, P Rossmanith
Journal of Discrete Algorithms 1 (1), 89-102, 2003
1842003
Fixed-parameter algorithms for closest string and related problems
J Gramm, R Niedermeier, P Rossmanith
Algorithmica 37 (1), 25-42, 2003
1752003
Upper bounds for vertex cover further improved
R Niedermeier, P Rossmanith
Annual Symposium on Theoretical Aspects of Computer Science, 561-570, 1999
1721999
A general method to speed up fixed-parameter-tractable algorithms
R Niedermeier, P Rossmanith
Information Processing Letters 73 (3-4), 125-129, 2000
1672000
Dynamic programming on tree decompositions using generalised fast subset convolution
JMM Van Rooij, HL Bodlaender, P Rossmanith
European Symposium on Algorithms, 566-577, 2009
1452009
On efficient fixed-parameter algorithms for weighted vertex cover
R Niedermeier, P Rossmanith
Journal of Algorithms 47 (2), 63-77, 2003
1252003
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
J Gramm, EA Hirsch, R Niedermeier, P Rossmanith
Discrete Applied Mathematics 130 (2), 139-155, 2003
1232003
Linear kernels and single-exponential algorithms via protrusion decompositions
EJ Kim, A Langer, C Paul, F Reidl, P Rossmanith, I Sau, S Sikdar
ACM Transactions on Algorithms (TALG) 12 (2), 1-41, 2015
1042015
New upper bounds for maximum satisfiability
R Niedermeier, P Rossmanith
Journal of Algorithms 36 (1), 63-88, 2000
982000
Divide-and-color
J Kneis, D Mölle, S Richter, P Rossmanith
International Workshop on Graph-Theoretic Concepts in Computer Science, 58-67, 2006
892006
Exact solutions for closest string and related problems
J Gramm, R Niedermeier, P Rossmanith
International Symposium on Algorithms and Computation, 441-453, 2001
812001
Parameterized power domination complexity
J Kneis, D Mölle, S Richter, P Rossmanith
Information Processing Letters 98 (4), 145-149, 2006
802006
Randomized divide-and-conquer: Improved path, matching, and packing algorithms
J Chen, J Kneis, S Lu, D Mölle, S Richter, P Rossmanith, SH Sze, F Zhang
SIAM Journal on Computing 38 (6), 2526-2547, 2009
752009
Dynamic programming for minimum Steiner trees
B Fuchs, W Kern, D Molle, S Richter, P Rossmanith, X Wang
Theory of Computing Systems 41 (3), 493-500, 2007
752007
Kernelization using structural parameters on sparse graph classes
J Gajarský, P Hliněný, J Obdržálek, S Ordyniak, F Reidl, P Rossmanith, ...
Journal of Computer and System Sciences 84, 219-242, 2017
612017
Courcelle’s theorem—a game-theoretic approach
J Kneis, A Langer, P Rossmanith
Discrete Optimization 8 (4), 568-594, 2011
592011
A faster algorithm for the Steiner tree problem
D Mölle, S Richter, P Rossmanith
Annual Symposium on Theoretical Aspects of Computer Science, 561-570, 2006
562006
Are there any good digraph width measures?
R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ...
International Symposium on Parameterized and Exact Computation, 135-146, 2010
542010
A fine-grained analysis of a simple independent set algorithm
J Kneis, A Langer, P Rossmanith
IARCS Annual Conference on Foundations of Software Technology and …, 2009
532009
The system can't perform the operation now. Try again later.
Articles 1–20