| Efficient algorithms for model checking pushdown systems J Esparza, D Hansel, P Rossmanith, S Schwoon International Conference on Computer Aided Verification, 232-247, 2000 | 474 | 2000 |
| Fixed-parameter algorithms for closest string and related problems Gramm, Niedermeier, Rossmanith Algorithmica 37, 25-42, 2003 | 195 | 2003 |
| An efficient fixed-parameter algorithm for 3-Hitting Set R Niedermeier, P Rossmanith Journal of Discrete Algorithms 1 (1), 89-102, 2003 | 192 | 2003 |
| Upper bounds for vertex cover further improved R Niedermeier, P Rossmanith STACS 99: 16th Annual Symposium on Theoretical Aspects of Computer Science …, 1999 | 184 | 1999 |
| Dynamic programming on tree decompositions using generalised fast subset convolution JMM Van Rooij, HL Bodlaender, P Rossmanith Algorithms-ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark …, 2009 | 176 | 2009 |
| A general method to speed up fixed-parameter-tractable algorithms R Niedermeier, P Rossmanith Information Processing Letters 73 (3-4), 125-129, 2000 | 169 | 2000 |
| On efficient fixed-parameter algorithms for weighted vertex cover R Niedermeier, P Rossmanith Journal of Algorithms 47 (2), 63-77, 2003 | 138 | 2003 |
| 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 | 126 | 2003 |
| 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 | 122 | 2015 |
| New upper bounds for maximum satisfiability R Niedermeier, P Rossmanith Journal of Algorithms 36 (1), 63-88, 2000 | 114 | 2000 |
| Divide-and-color J Kneis, D Mölle, S Richter, P Rossmanith Graph-Theoretic Concepts in Computer Science: 32nd International Workshop …, 2006 | 95 | 2006 |
| Dynamic programming for minimum Steiner trees B Fuchs, W Kern, D Molle, S Richter, P Rossmanith, X Wang Theory of Computing Systems 41, 493-500, 2007 | 94 | 2007 |
| Parameterized power domination complexity J Kneis, D Mölle, S Richter, P Rossmanith Information Processing Letters 98 (4), 145-149, 2006 | 90 | 2006 |
| Exact solutions for closest string and related problems J Gramm, R Niedermeier, P Rossmanith International Symposium on Algorithms and Computation, 441-453, 2001 | 90 | 2001 |
| 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 | 83 | 2009 |
| 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 | 73 | 2017 |
| A faster parameterized algorithm for treedepth F Reidl, P Rossmanith, FS Villaamil, S Sikdar International Colloquium on Automata, Languages, and Programming, 931-942, 2014 | 70 | 2014 |
| An exact algorithm for the maximum leaf spanning tree problem H Fernau, J Kneis, D Kratsch, A Langer, M Liedloff, D Raible, ... Theoretical Computer Science 412 (45), 6290-6302, 2011 | 68 | 2011 |
| The online knapsack problem: Advice and randomization HJ Böckenhauer, D Komm, R Královič, P Rossmanith Theoretical Computer Science 527, 61-72, 2014 | 61 | 2014 |
| Courcelle’s theorem—A game-theoretic approach J Kneis, A Langer, P Rossmanith Discrete Optimization 8 (4), 568-594, 2011 | 60 | 2011 |
Alexander LangerRWTH Aachen UniversityAdresse e-mail validée de cs.rwth-aachen.de
