| 2008 |
|---|
| 103 | | Martin Grohe,
Rolf Niedermeier:
Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings
Springer 2008 |
| 102 | EE | Nadja Betzler,
Michael R. Fellows,
Jiong Guo,
Rolf Niedermeier,
Frances A. Rosamond:
Fixed-Parameter Algorithms for Kemeny Scores.
AAIM 2008: 60-71 |
| 101 | EE | Nadja Betzler,
Michael R. Fellows,
Christian Komusiewicz,
Rolf Niedermeier:
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.
CPM 2008: 31-43 |
| 100 | EE | Falk Hüffner,
Christian Komusiewicz,
Hannes Moser,
Rolf Niedermeier:
Fixed-Parameter Algorithms for Cluster Vertex Deletion.
LATIN 2008: 711-722 |
| 99 | EE | Nadja Betzler,
Jiong Guo,
Rolf Niedermeier:
Parameterized Computational Complexity of Dodgson and Young Elections.
SWAT 2008: 402-413 |
| 98 | EE | Oriana Ponta,
Falk Hüffner,
Rolf Niedermeier:
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems.
TAMC 2008: 490-501 |
| 97 | EE | Falk Hüffner,
Rolf Niedermeier,
Sebastian Wernicke:
Techniques for Practical Fixed-Parameter Algorithms.
Comput. J. 51(1): 7-25 (2008) |
| 96 | EE | Jiong Guo,
Rolf Niedermeier,
Johannes Uhlmann:
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees.
Inf. Process. Lett. 106(2): 81-86 (2008) |
| 2007 |
|---|
| 95 | EE | David B. Chandler,
Jiong Guo,
Ton Kloks,
Rolf Niedermeier:
Probe Matrix Problems: Totally Balanced Matrices.
AAIM 2007: 368-377 |
| 94 | EE | Christian Komusiewicz,
Falk Hüffner,
Hannes Moser,
Rolf Niedermeier:
Isolation Concepts for Enumerating Dense Subgraphs.
COCOON 2007: 140-150 |
| 93 | EE | Jiong Guo,
Rolf Niedermeier:
Linear Problem Kernels for NP-Hard Problems on Planar Graphs.
ICALP 2007: 375-386 |
| 92 | EE | Michael Dom,
Jiong Guo,
Rolf Niedermeier:
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems.
TAMC 2007: 680-691 |
| 91 | EE | Falk Hüffner,
Nadja Betzler,
Rolf Niedermeier:
Optimal Edge Deletions for Signed Graph Balancing.
WEA 2007: 297-310 |
| 90 | EE | Jens Gramm,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier,
Hans-Peter Piepho,
Ramona Schmid:
Algorithms for compact letter displays: Comparison and evaluation.
Computational Statistics & Data Analysis 52(2): 725-736 (2007) |
| 89 | EE | Jiong Guo,
Rolf Niedermeier:
Invitation to data reduction and problem kernelization.
SIGACT News 38(1): 31-45 (2007) |
| 88 | EE | Jiong Guo,
Rolf Niedermeier,
Sebastian Wernicke:
Parameterized Complexity of Vertex Cover Variants.
Theory Comput. Syst. 41(3): 501-520 (2007) |
| 2006 |
|---|
| 87 | | Matthias Brosemann,
Jochen Alber,
Falk Hüffner,
Rolf Niedermeier:
Matrix Robustness, with an Application to Power System Observability.
ACiD 2006: 37-48 |
| 86 | EE | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier,
Anke Truß:
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments.
CIAC 2006: 320-331 |
| 85 | EE | Jiong Guo,
Rolf Niedermeier,
Sebastian Wernicke:
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual.
IWPEC 2006: 203-214 |
| 84 | EE | Jochen Alber,
Britta Dorn,
Rolf Niedermeier:
A General Data Reduction Scheme for Domination in Graphs.
SOFSEM 2006: 137-147 |
| 83 | EE | Jiong Guo,
Falk Hüffner,
Erhan Kenar,
Rolf Niedermeier,
Johannes Uhlmann:
Complexity and Exact Algorithms for Multicut.
SOFSEM 2006: 303-312 |
| 82 | EE | Michael Dom,
Jiong Guo,
Rolf Niedermeier,
Sebastian Wernicke:
Minimum Membership Set Covering and the Consecutive Ones Property.
SWAT 2006: 339-350 |
| 81 | EE | Jens Gramm,
Jiong Guo,
Rolf Niedermeier:
Pattern matching for arc-annotated sequences.
ACM Transactions on Algorithms 2(1): 44-65 (2006) |
| 80 | EE | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Error Compensation in Leaf Power Problems.
Algorithmica 44(4): 363-381 (2006) |
| 79 | EE | Michael R. Fellows,
Jens Gramm,
Rolf Niedermeier:
On The Parameterized Intractability Of Motif Search Problems.
Combinatorica 26(2): 141-167 (2006) |
| 78 | EE | Jiong Guo,
Rolf Niedermeier:
A fixed-parameter tractability result for multicommodity demand flow in trees.
Inf. Process. Lett. 97(3): 109-114 (2006) |
| 77 | EE | Sebastian Wernicke,
Jochen Alber,
Jens Gramm,
Jiong Guo,
Rolf Niedermeier:
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions.
Int. J. Found. Comput. Sci. 17(6): 1467-1484 (2006) |
| 76 | EE | Jiong Guo,
Jens Gramm,
Falk Hüffner,
Rolf Niedermeier,
Sebastian Wernicke:
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization.
J. Comput. Syst. Sci. 72(8): 1386-1396 (2006) |
| 75 | EE | Jiong Guo,
Rolf Niedermeier:
Exact algorithms and applications for Tree-like Weighted Set Cover.
J. Discrete Algorithms 4(4): 608-622 (2006) |
| 74 | EE | Rod Downey,
Michael A. Langston,
Rolf Niedermeier:
Editorial.
Theor. Comput. Sci. 351(3): 295 (2006) |
| 73 | EE | Jens Gramm,
Jiong Guo,
Rolf Niedermeier:
Parameterized Intractability of Distinguishing Substring Selection.
Theory Comput. Syst. 39(4): 545-560 (2006) |
| 2005 |
|---|
| 72 | EE | Michael Dom,
Jiong Guo,
Rolf Niedermeier:
Bounded Degree Closest k-Tree Power Is NP-Complete.
COCOON 2005: 757-766 |
| 71 | EE | Jiong Guo,
Rolf Niedermeier,
Daniel Raible:
Improved Algorithms and Complexity Results for Power Domination in Graphs.
FCT 2005: 172-184 |
| 70 | EE | Jiong Guo,
Jens Gramm,
Falk Hüffner,
Rolf Niedermeier,
Sebastian Wernicke:
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems.
WADS 2005: 158-168 |
| 69 | EE | Jiong Guo,
Rolf Niedermeier,
Sebastian Wernicke:
Parameterized Complexity of Generalized Vertex Cover Problems.
WADS 2005: 36-48 |
| 68 | EE | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Extending the Tractability Border for Closest Leaf Powers.
WG 2005: 397-408 |
| 67 | EE | Jochen Alber,
Frederic Dorn,
Rolf Niedermeier:
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs.
Discrete Applied Mathematics 145(2): 219-231 (2005) |
| 66 | EE | Jochen Alber,
Hongbing Fan,
Michael R. Fellows,
Henning Fernau,
Rolf Niedermeier,
Frances A. Rosamond,
Ulrike Stege:
A refined search tree technique for Dominating Set on planar graphs.
J. Comput. Syst. Sci. 71(4): 385-405 (2005) |
| 65 | EE | Jiong Guo,
Rolf Niedermeier:
Fixed-parameter tractability and data reduction for multicut in trees.
Networks 46(3): 124-135 (2005) |
| 64 | EE | Jens Gramm,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.
Theory Comput. Syst. 38(4): 373-392 (2005) |
| 2004 |
|---|
| 63 | EE | Michael Dom,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Error Compensation in Leaf Root Problems.
ISAAC 2004: 389-401 |
| 62 | EE | Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
A Structural View on Parameterizing Problems: Distance from Triviality.
IWPEC 2004: 162-173 |
| 61 | EE | Rolf Niedermeier:
Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms.
MFCS 2004: 84-103 |
| 60 | EE | Sebastian Wernicke,
Jochen Alber,
Jens Gramm,
Jiong Guo,
Rolf Niedermeier:
Avoiding Forbidden Submatrices by Row Deletions.
SOFSEM 2004: 349-360 |
| 59 | EE | Hans L. Bodlaender,
Celina M. Herrera de Figueiredo,
Marisa Gutierrez,
Ton Kloks,
Rolf Niedermeier:
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's.
WEA 2004: 87-99 |
| 58 | EE | Jens Gramm,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems.
Algorithmica 39(4): 321-347 (2004) |
| 57 | EE | Jochen Alber,
Michael R. Fellows,
Rolf Niedermeier:
Polynomial-time data reduction for dominating set.
J. ACM 51(3): 363-384 (2004) |
| 56 | EE | Jochen Alber,
Henning Fernau,
Rolf Niedermeier:
Parameterized complexity: exponential speed-up for planar graph problems.
J. Algorithms 52(1): 26-56 (2004) |
| 55 | EE | Jochen Alber,
Jens Gramm,
Jiong Guo,
Rolf Niedermeier:
Computing the similarity of two sequences with nested arc annotations.
Theor. Comput. Sci. 312(2-3): 337-358 (2004) |
| 2003 |
|---|
| 54 | EE | Jens Gramm,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation.
CIAC 2003: 108-119 |
| 53 | EE | Jens Gramm,
Jiong Guo,
Falk Hüffner,
Rolf Niedermeier:
Automated Generation of Search Tree Algorithms for Graph Modification Problems.
ESA 2003: 642-653 |
| 52 | EE | Jens Gramm,
Jiong Guo,
Rolf Niedermeier:
On Exact and Approximation Algorithms for Distinguishing Substring Selection.
FCT 2003: 195-209 |
| 51 | EE | Jens Gramm,
Rolf Niedermeier,
Peter Rossmanith:
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems.
Algorithmica 37(1): 25-42 (2003) |
| 50 | EE | Jens Gramm,
Edward A. Hirsch,
Rolf Niedermeier,
Peter Rossmanith:
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
Discrete Applied Mathematics 130(2): 139-155 (2003) |
| 49 | EE | Rolf Niedermeier,
Peter Rossmanith:
On efficient fixed-parameter algorithms for weighted vertex cover.
J. Algorithms 47(2): 63-77 (2003) |
| 48 | EE | Jens Gramm,
Rolf Niedermeier:
A fixed-parameter algorithm for minimum quartet inconsistency.
J. Comput. Syst. Sci. 67(4): 723-741 (2003) |
| 47 | EE | Jochen Alber,
Henning Fernau,
Rolf Niedermeier:
Graph separators: a parameterized view.
J. Comput. Syst. Sci. 67(4): 808-832 (2003) |
| 46 | EE | Rolf Niedermeier,
Peter Rossmanith:
An efficient fixed-parameter algorithm for 3-Hitting Set.
J. Discrete Algorithms 1(1): 89-102 (2003) |
| 2002 |
|---|
| 45 | EE | Jochen Alber,
Jens Gramm,
Jiong Guo,
Rolf Niedermeier:
Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time.
CPM 2002: 99-114 |
| 44 | | Jens Gramm,
Rolf Niedermeier:
Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach.
ECCB 2002: 128-139 |
| 43 | EE | Jens Gramm,
Jiong Guo,
Rolf Niedermeier:
Pattern Matching for Arc-Annotated Sequences.
FSTTCS 2002: 182-193 |
| 42 | EE | Jochen Alber,
Rolf Niedermeier:
Improved Tree Decomposition Based Algorithms for Domination-like Problems.
LATIN 2002: 613-628 |
| 41 | EE | Michael R. Fellows,
Jens Gramm,
Rolf Niedermeier:
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems.
STACS 2002: 262-273 |
| 40 | EE | Jochen Alber,
Michael R. Fellows,
Rolf Niedermeier:
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case.
SWAT 2002: 150-159 |
| 39 | EE | Jochen Alber,
Hans L. Bodlaender,
Henning Fernau,
Ton Kloks,
Rolf Niedermeier:
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs.
Algorithmica 33(4): 461-493 (2002) |
| 38 | EE | Michael R. Fellows,
Jens Gramm,
Rolf Niedermeier:
Parameterized Intractability of Motif Search Problems
CoRR cs.CC/0205056: (2002) |
| 37 | EE | Jochen Alber,
Michael R. Fellows,
Rolf Niedermeier:
Polynomial Time Data Reduction for Dominating Set
CoRR cs.DS/0207066: (2002) |
| 36 | | Rolf Niedermeier,
Klaus Reinhardt,
Peter Sanders:
Towards optimal locality in mesh-indexings.
Discrete Applied Mathematics 117(1-3): 211-237 (2002) |
| 2001 |
|---|
| 35 | EE | Jochen Alber,
Henning Fernau,
Rolf Niedermeier:
Graph Separators: A Parameterized View.
COCOON 2001: 318-327 |
| 34 | EE | Jens Gramm,
Rolf Niedermeier:
Minimum Quartet Inconsistency Is Fixed Parameter Tractable.
CPM 2001: 241-256 |
| 33 | EE | Jochen Alber,
Henning Fernau,
Rolf Niedermeier:
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems.
ICALP 2001: 261-272 |
| 32 | EE | Jens Gramm,
Rolf Niedermeier,
Peter Rossmanith:
Exact Solutions for CLOSEST STRING and Related Problems.
ISAAC 2001: 441-453 |
| 31 | EE | Falk Hüffner,
Stefan Edelkamp,
Henning Fernau,
Rolf Niedermeier:
Finding Optimal Solutions to Atomix.
KI/ÖGAI 2001: 229-243 |
| 30 | EE | Jochen Alber,
Hongbing Fan,
Michael R. Fellows,
Henning Fernau,
Rolf Niedermeier,
Frances A. Rosamond,
Ulrike Stege:
Refined Search Tree Technique for DOMINATING SET on Planar Graphs.
MFCS 2001: 111-122 |
| 29 | EE | Jochen Alber,
Jens Gramm,
Rolf Niedermeier:
Faster exact algorithms for hard problems: A parameterized point of view.
Discrete Mathematics 229(1-3): 3-27 (2001) |
| 28 | EE | Jochen Alber,
Henning Fernau,
Rolf Niedermeier:
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
Electronic Colloquium on Computational Complexity (ECCC) 8(23): (2001) |
| 27 | | Henning Fernau,
Rolf Niedermeier:
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.
J. Algorithms 38(2): 374-410 (2001) |
| 2000 |
|---|
| 26 | EE | Jens Gramm,
Rolf Niedermeier:
Faster Exact Solutions for MAX2SAT.
CIAC 2000: 174-186 |
| 25 | EE | Rolf Niedermeier,
Peter Rossmanith:
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER.
ISAAC 2000: 180-191 |
| 24 | EE | Jochen Alber,
Hans L. Bodlaender,
Henning Fernau,
Rolf Niedermeier:
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems.
SWAT 2000: 97-110 |
| 23 | EE | Jens Gramm,
Edward A. Hirsch,
Rolf Niedermeier,
Peter Rossmanith:
New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC) 7(37): (2000) |
| 22 | EE | Rolf Niedermeier,
Peter Rossmanith:
A general method to speed up fixed-parameter-tractable algorithms.
Inf. Process. Lett. 73(3-4): 125-129 (2000) |
| 21 | | Rolf Niedermeier,
Peter Rossmanith:
New Upper Bounds for Maximum Satisfiability.
J. Algorithms 36(1): 63-88 (2000) |
| 20 | | Klaus-Jörn Lange,
Rolf Niedermeier:
Data Independence of Read, Write, and Control Structures in PRAM Computations.
J. Comput. Syst. Sci. 60(1): 109-144 (2000) |
| 19 | EE | Jochen Alber,
Rolf Niedermeier:
On Multidimensional Curves with Hilbert Property.
Theory Comput. Syst. 33(4): 295-312 (2000) |
| 1999 |
|---|
| 18 | EE | Rolf Niedermeier,
Peter Rossmanith:
New Upper Bounds for MaxSat.
ICALP 1999: 575-584 |
| 17 | | Henning Fernau,
Rolf Niedermeier:
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.
MFCS 1999: 387-397 |
| 16 | EE | Rolf Niedermeier,
Peter Rossmanith:
Upper Bounds for Vertex Cover Further Improved.
STACS 1999: 561-570 |
| 15 | EE | Manfred Kunde,
Rolf Niedermeier,
Klaus Reinhardt,
Peter Rossmanith:
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals.
Algorithmica 25(4): 438-458 (1999) |
| 1998 |
|---|
| 14 | EE | Jochen Alber,
Rolf Niedermeier:
On Multi-dimensional Hilbert Indexings.
COCOON 1998: 329-338 |
| 13 | EE | Rolf Niedermeier:
Some Prospects for Efficient Fixed Parameter Algorithms.
SOFSEM 1998: 168-185 |
| 12 | EE | Rolf Niedermeier,
Peter Rossmanith:
Unambiguous Computations and Locally Definable Acceptance Types.
Theor. Comput. Sci. 194(1-2): 137-161 (1998) |
| 1997 |
|---|
| 11 | | Rolf Niedermeier,
Klaus Reinhardt,
Peter Sanders:
Towards Optimal Locality in Mesh-Indexings.
FCT 1997: 364-375 |
| 1996 |
|---|
| 10 | | Rolf Niedermeier:
Recursively Divisible Problems.
ISAAC 1996: 183-192 |
| 1995 |
|---|
| 9 | | Rolf Niedermeier,
Peter Rossmanith:
PRAM's Towards Realistic Parallelism: BRAM's.
FCT 1995: 363-373 |
| 8 | | Manfred Kunde,
Rolf Niedermeier,
Klaus Reinhardt,
Peter Rossmanith:
Optimal Average Case Sorting on Arrays.
STACS 1995: 503-514 |
| 7 | | Rolf Niedermeier,
Peter Rossmanith:
Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits
Inf. Comput. 118(2): 227-245 (1995) |
| 6 | | Rolf Niedermeier,
Peter Rossmanith:
On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions.
Parallel Processing Letters 5: 299-309 (1995) |
| 1994 |
|---|
| 5 | | Manfred Kunde,
Rolf Niedermeier,
Peter Rossmanith:
Faster Sorting and Routing on Grids with Diagonals.
STACS 1994: 225-236 |
| 1993 |
|---|
| 4 | | Klaus-Jörn Lange,
Rolf Niedermeier:
Data-Independences of Parallel Random Access Machines.
FSTTCS 1993: 104-113 |
| 3 | | Rolf Niedermeier,
Peter Rossmanith:
On the Power of Reading and Writing Simultaneously in Parallel Computation.
ISAAC 1993: 240-249 |
| 2 | | Rolf Niedermeier,
Peter Rossmanith:
Extended Locally Definable Acceptance Types (Extended Abstract).
STACS 1993: 473-483 |
| 1992 |
|---|
| 1 | | Rolf Niedermeier,
Peter Rossmanith:
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract).
LATIN 1992: 387-400 |
