- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j77 |      | Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller: Efficient Algorithms for Eulerian Extension and Rural Postman. SIAM J. Discrete Math. 27(1): 75-94 (2013) |
| c102 | | Robert Bredereck, André Nichterlein, Rolf Niedermeier: Pattern-Guided k-Anonymity. FAW-AAIM 2013: 350-361 |
| c101 | | Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, Rolf Niedermeier: Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. ISBRA 2013: 99-111 |
| c100 | | Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier: Evaluation of ILP-Based Approaches for Partitioning into Colorful Components. SEA 2013: 176-187 |
| 2012 | ||
| j76 | | René van Bevern, Hannes Moser, Rolf Niedermeier: Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion. Algorithmica 62(3-4): 930-950 (2012) |
| j75 | | Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann: On Bounded-Degree Vertex Deletion parameterized by treewidth. Discrete Applied Mathematics 160(1-2): 53-60 (2012) |
| j74 | | Hannes Moser, Rolf Niedermeier, Manuel Sorge: Exact combinatorial algorithms and experiments for finding maximum k-plexes. J. Comb. Optim. 24(3): 347-373 (2012) |
| j73 | | Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: On making directed graphs transitive. J. Comput. Syst. Sci. 78(2): 559-574 (2012) |
| j72 | | Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller: A new view on Rural Postman based on Eulerian Extension and Matching. J. Discrete Algorithms 16: 12-33 (2012) |
| j71 | | Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Parameterized computational complexity of finding small-diameter subgraphs. Optimization Letters 6(5): 883-891 (2012) |
| c99 | | Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch: A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. AAAI 2012 |
| c98 | | Nadja Betzler, Robert Bredereck, Jiehua Chen, Rolf Niedermeier: Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. The Multivariate Algorithmic Revolution and Beyond 2012: 318-363 |
| c97 | | Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge: Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. CiE 2012: 193-202 |
| c96 | | Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann: Partitioning into Colorful Components by Minimum Edge Deletions. CPM 2012: 56-69 |
| c95 | | René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller: Interval Scheduling and Colorful Independent Sets. ISAAC 2012: 247-256 |
| c94 | | Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller: Exploiting a Hypergraph Model for Finding Golomb Rulers. ISCO 2012: 368-379 |
| c93 | | Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller: Constant Thresholds Can Make Target Set Selection Tractable. MedAlg 2012: 120-133 |
| c92 | | |
| 2011 | ||
| j70 | | Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann: Exploiting bounded signal flow for graph orientation based on cause-effect pairs. Algorithms for Molecular Biology 6: 21 (2011) |
| j69 | | Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Graph-based data clustering with overlaps. Discrete Optimization 8(1): 2-17 (2011) |
| j68 | | Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier: Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. 77(4): 774-789 (2011) |
| j67 | | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A generalization of Nemhauser and Trotterʼs local optimization theorem. J. Comput. Syst. Sci. 77(6): 1141-1158 (2011) |
| j66 | | Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring. J. Discrete Algorithms 9(1): 137-151 (2011) |
| j65 | | André Nichterlein, Michael Dom, Rolf Niedermeier: Aspects of a multivariate complexity analysis for Rectangle Tiling. Oper. Res. Lett. 39(5): 346-351 (2011) |
| j64 | | Jiong Guo, Rolf Niedermeier, Ondrej Suchý: Parameterized Complexity of Arc-Weighted Directed Steiner Problems. SIAM J. Discrete Math. 25(2): 583-599 (2011) |
| j63 | | Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier: Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE/ACM Trans. Comput. Biology Bioinform. 8(5): 1296-1308 (2011) |
| j62 | | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. TOCT 2(2): 5 (2011) |
| p2 | | Michael Dom, Falk Hüffner, Rolf Niedermeier: Depth-First Search (Ariadne & Co.). Algorithms Unplugged 2011: 57-68 |
| c91 | | Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip: The Effect of Homogeneity on the Complexity of k-Anonymity. FCT 2011: 53-64 |
| c90 | | Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger: Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. IJCAI 2011: 55-60 |
| c89 | | Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý: The Parameterized Complexity of Local Search for TSP, More Refined. ISAAC 2011: 614-623 |
| c88 | | Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller: A New View on Rural Postman Based on Eulerian Extension and Matching. IWOCA 2011: 310-323 |
| c87 | | René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller: Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. IPEC 2011: 194-206 |
| c86 | | Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip: Pattern-Guided Data Anonymization and Clustering. MFCS 2011: 182-193 |
| c85 | | Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann: On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. SOFSEM 2011: 123-134 |
| c84 | | Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann: Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs. TAPAS 2011: 104-115 |
| c83 | | Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller: From Few Components to an Eulerian Graph by Adding Arcs. WG 2011: 307-318 |
| 2010 | ||
| j61 | | Nadja Betzler, Jiong Guo, Rolf Niedermeier: Parameterized computational complexity of Dodgson and Young elections. Inf. Comput. 208(2): 165-177 (2010) |
| j60 | | Falk Hüffner, Nadja Betzler, Rolf Niedermeier: Separator-based data reduction for signed graph balancing. J. Comb. Optim. 20(4): 335-360 (2010) |
| j59 | | Michael Dom, Jiong Guo, Rolf Niedermeier: Approximation and fixed-parameter algorithms for consecutive ones submatrix problems. J. Comput. Syst. Sci. 76(3-4): 204-221 (2010) |
| j58 | | Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß: Fixed-parameter tractability results for feedback set problems in tournaments. J. Discrete Algorithms 8(1): 76-86 (2010) |
| j57 | | Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Fixed-Parameter Algorithms for Cluster Vertex Deletion. Theory Comput. Syst. 47(1): 196-217 (2010) |
| j56 | | Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Fixed-parameter tractability results for full-degree spanning tree and its dual. Networks 56(2): 116-130 (2010) |
| j55 | | Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing. SIAM J. Discrete Math. 24(4): 1662-1683 (2010) |
| c82 | | Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI 2010 |
| c81 | | Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller, Xi Wu: Extended Islands of Tractability for Parsimony Haplotyping. CPM 2010: 214-226 |
| c80 | | André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller: On Tractable Cases of Target Set Selection. ISAAC (1) 2010: 378-389 |
| c79 | | Nadja Betzler, Robert Bredereck, Rolf Niedermeier: Partial Kernelization for Rank Aggregation: Theory and Experiments. IPEC 2010: 26-37 |
| c78 | | Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier: Average Parameterization and Partial Kernelization for Computing Medians. LATIN 2010: 60-71 |
| c77 | | |
| c76 | | Rolf Niedermeier: Reflections on Multivariate Algorithmics and Problem Parameterization. STACS 2010: 17-32 |
| c75 | | Sepp Hartung, Rolf Niedermeier: Incremental List Coloring of Graphs, Parameterized by Conservation. TAMC 2010: 258-270 |
| c74 | | Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller: Efficient Algorithms for Eulerian Extension. WG 2010: 100-111 |
| c73 | | René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Measuring Indifference: Unit Interval Vertex Deletion. WG 2010: 232-243 |
| 2009 | ||
| j54 | | Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier: Isolation concepts for efficiently enumerating dense subgraphs. Theor. Comput. Sci. 410(38-40): 3640-3654 (2009) |
| j53 | | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. 410(45): 4554-4570 (2009) |
| j52 | | Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Isolation concepts for clique enumeration: Comparison and computational experiments. Theor. Comput. Sci. 410(52): 5384-5397 (2009) |
| c72 | | Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. AAIM 2009: 226-239 |
| c71 | | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: How similarity helps to efficiently compute Kemeny rankings. AAMAS (1) 2009: 657-664 |
| c70 | | Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526 |
| c69 | | Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: Deconstructing Intractability: A Case Study for Interval Constrained Coloring. CPM 2009: 207-220 |
| c68 | | Jiong Guo, Hannes Moser, Rolf Niedermeier: Iterative Compression for Exactly Solving NP-Hard Minimization Problems. Algorithmics of Large and Complex Networks 2009: 65-80 |
| c67 | | Nadja Betzler, Susanne Hemmann, Rolf Niedermeier: A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. IJCAI 2009: 53-58 |
| c66 | | Jiong Guo, Rolf Niedermeier, Ondrej Suchý: Parameterized Complexity of Arc-Weighted Directed Steiner Problems. ISAAC 2009: 544-553 |
| c65 | | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS 2009: 319-330 |
| c64 | | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS 2009: 409-420 |
| c63 | | Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann: On Making Directed Graphs Transitive. WADS 2009: 542-553 |
| c62 | | Hannes Moser, Rolf Niedermeier, Manuel Sorge: Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. SEA 2009: 233-244 |
| i5 | | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. CoRR abs/0902.2149 (2009) |
| 2008 | ||
| j51 | | Jiong Guo, Rolf Niedermeier, Daniel Raible: Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica 52(2): 177-202 (2008) |
| j50 | | Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke: Techniques for Practical Fixed-Parameter Algorithms. Comput. J. 51(1): 7-25 (2008) |
| j49 | | Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Closest 4-leaf power is fixed-parameter tractable. Discrete Applied Mathematics 156(18): 3345-3361 (2008) |
| j48 | | Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann: Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. European Journal of Operational Research 186(2): 542-553 (2008) |
| j47 | | 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) |
| j46 | | Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Red-blue covering problems and the consecutive ones property. J. Discrete Algorithms 6(3): 393-407 (2008) |
| j45 | | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics 13 (2008) |
| c61 | | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71 |
| c60 | | Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA 2008: 405-416 |
| c59 | | Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier: Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM 2008: 31-43 |
| c58 | | Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN 2008: 711-722 |
| c57 | | Nadja Betzler, Jiong Guo, Rolf Niedermeier: Parameterized Computational Complexity of Dodgson and Young Elections. SWAT 2008: 402-413 |
| c56 | | Oriana Ponta, Falk Hüffner, Rolf Niedermeier: Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems. TAMC 2008: 490-501 |
| p1 | | Michael Dom, Falk Hüffner, Rolf Niedermeier: Tiefensuche (Ariadne und Co.). Taschenbuch der Algorithmen 2008: 61-73 |
| r1 | | |
| e1 |  | Martin Grohe, Rolf Niedermeier (Eds.): Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings. Lecture Notes in Computer Science 5018, Springer 2008, isbn 978-3-540-79722-7 |
| 2007 | ||
| j44 | | 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) |
| j43 | | Rolf Niedermeier, Jörg Vogel, Michael Fothe, Mirko König: Das Knotenüberdeckungsproblem - Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 1). LOG IN 27(146/147): 53-59 (2007) |
| j42 | | Rolf Niedermeier, Jörg Vogel, Michael Fothe, Mirko König: Das Knotenüberdeckungsproblem Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 2). LOG IN 27(148): 81-89 (2007) |
| j41 | | Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Parameterized Complexity of Vertex Cover Variants. Theory Comput. Syst. 41(3): 501-520 (2007) |
| j40 | | Jiong Guo, Rolf Niedermeier: Invitation to data reduction and problem kernelization. SIGACT News 38(1): 31-45 (2007) |
| c55 | | David B. Chandler, Jiong Guo, Ton Kloks, Rolf Niedermeier: Probe Matrix Problems: Totally Balanced Matrices. AAIM 2007: 368-377 |
| c54 | | Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier: Isolation Concepts for Enumerating Dense Subgraphs. COCOON 2007: 140-150 |
| c53 | | Jiong Guo, Rolf Niedermeier: Linear Problem Kernels for NP-Hard Problems on Planar Graphs. ICALP 2007: 375-386 |
| c52 | | Michael Dom, Jiong Guo, Rolf Niedermeier: Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. TAMC 2007: 680-691 |
| c51 | | Falk Hüffner, Nadja Betzler, Rolf Niedermeier: Optimal Edge Deletions for Signed Graph Balancing. WEA 2007: 297-310 |
| 2006 | ||
| j39 | | Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Error Compensation in Leaf Power Problems. Algorithmica 44(4): 363-381 (2006) |
| j38 | | Jochen Alber, Nadja Betzler, Rolf Niedermeier: Experiments on data reduction for optimal domination in networks. Annals OR 146(1): 105-117 (2006) |
| j37 | | Michael R. Fellows, Jens Gramm, Rolf Niedermeier: On The Parameterized Intractability Of Motif Search Problems. Combinatorica 26(2): 141-167 (2006) |
| j36 | | Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann: Tree decompositions of graphs: Saving memory in dynamic programming. Discrete Optimization 3(3): 220-229 (2006) |
| j35 | | 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) |
| j34 | | Jiong Guo, Rolf Niedermeier: A fixed-parameter tractability result for multicommodity demand flow in trees. Inf. Process. Lett. 97(3): 109-114 (2006) |
| j33 | | 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) |
| j32 | | Jiong Guo, Rolf Niedermeier: Exact algorithms and applications for Tree-like Weighted Set Cover. J. Discrete Algorithms 4(4): 608-622 (2006) |
| j31 | | Jens Gramm, Jiong Guo, Rolf Niedermeier: Parameterized Intractability of Distinguishing Substring Selection. Theory Comput. Syst. 39(4): 545-560 (2006) |
| j30 | | Jens Gramm, Jiong Guo, Rolf Niedermeier: Pattern matching for arc-annotated sequences. ACM Transactions on Algorithms 2(1): 44-65 (2006) |
| j29 | | Rod Downey, Michael A. Langston, Rolf Niedermeier: Editorial. Theor. Comput. Sci. 351(3): 295 (2006) |
| c50 | | Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier: Matrix Robustness, with an Application to Power System Observability. ACiD 2006: 37-48 |
| c49 | | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Data Reduction, Exact, and Heuristic Algorithms for Clique Cover. ALENEX 2006: 86-94 |
| c48 | | 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 |
| c47 | | Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. IWPEC 2006: 203-214 |
| c46 | | Jochen Alber, Britta Dorn, Rolf Niedermeier: A General Data Reduction Scheme for Domination in Graphs. SOFSEM 2006: 137-147 |
| c45 | | Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann: Complexity and Exact Algorithms for Multicut. SOFSEM 2006: 303-312 |
| c44 | | Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Minimum Membership Set Covering and the Consecutive Ones Property. SWAT 2006: 339-350 |
| 2005 | ||
| j28 | | 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) |
| j27 | | 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) |
| j26 | | 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) |
| j25 | | Jiong Guo, Rolf Niedermeier: Fixed-parameter tractability and data reduction for multicut in trees. Networks 46(3): 124-135 (2005) |
| c43 | | Michael Dom, Jiong Guo, Rolf Niedermeier: Bounded Degree Closest k-Tree Power Is NP-Complete. COCOON 2005: 757-766 |
| c42 | | Jiong Guo, Rolf Niedermeier, Daniel Raible: Improved Algorithms and Complexity Results for Power Domination in Graphs. FCT 2005: 172-184 |
| c41 | | Jiong Guo, Rolf Niedermeier, Sebastian Wernicke: Parameterized Complexity of Generalized Vertex Cover Problems. WADS 2005: 36-48 |
| c40 | | Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke: Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. WADS 2005: 158-168 |
| c39 | | Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Extending the Tractability Border for Closest Leaf Powers. WG 2005: 397-408 |
| 2004 | ||
| j24 | | 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) |
| j23 | | Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann: Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Electronic Notes in Discrete Mathematics 17: 57-62 (2004) |
| j22 | | Jochen Alber, Michael R. Fellows, Rolf Niedermeier: Polynomial-time data reduction for dominating set. J. ACM 51(3): 363-384 (2004) |
| j21 | | Jochen Alber, Henning Fernau, Rolf Niedermeier: Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52(1): 26-56 (2004) |
| j20 | | 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) |
| c38 | | Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann: Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. CTW 2004: 56-60 |
| c37 | | Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Error Compensation in Leaf Root Problems. ISAAC 2004: 389-401 |
| c36 | | Jiong Guo, Falk Hüffner, Rolf Niedermeier: A Structural View on Parameterizing Problems: Distance from Triviality. IWPEC 2004: 162-173 |
| c35 | | Rolf Niedermeier: Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms. MFCS 2004: 84-103 |
| c34 | | Sebastian Wernicke, Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier: Avoiding Forbidden Submatrices by Row Deletions. SOFSEM 2004: 349-360 |
| c33 | | 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 |
| 2003 | ||
| j19 | | Jens Gramm, Rolf Niedermeier, Peter Rossmanith: Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. Algorithmica 37(1): 25-42 (2003) |
| j18 | | 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) |
| j17 | | Rolf Niedermeier, Peter Rossmanith: On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms 47(2): 63-77 (2003) |
| j16 | | Jens Gramm, Rolf Niedermeier: A fixed-parameter algorithm for minimum quartet inconsistency. J. Comput. Syst. Sci. 67(4): 723-741 (2003) |
| j15 | | Jochen Alber, Henning Fernau, Rolf Niedermeier: Graph separators: a parameterized view. J. Comput. Syst. Sci. 67(4): 808-832 (2003) |
| j14 | | Rolf Niedermeier, Peter Rossmanith: An efficient fixed-parameter algorithm for 3-Hitting Set. J. Discrete Algorithms 1(1): 89-102 (2003) |
| c32 | | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. CIAC 2003: 108-119 |
| c31 | | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Automated Generation of Search Tree Algorithms for Graph Modification Problems. ESA 2003: 642-653 |
| c30 | | Jens Gramm, Jiong Guo, Rolf Niedermeier: On Exact and Approximation Algorithms for Distinguishing Substring Selection. FCT 2003: 195-209 |
| 2002 | ||
| j13 | | 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) |
| j12 | | Rolf Niedermeier, Klaus Reinhardt, Peter Sanders: Towards optimal locality in mesh-indexings. Discrete Applied Mathematics 117(1-3): 211-237 (2002) |
| c29 | | 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 |
| c28 | | Jens Gramm, Rolf Niedermeier: Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach. ECCB 2002: 128-139 |
| c27 | | Jens Gramm, Jiong Guo, Rolf Niedermeier: Pattern Matching for Arc-Annotated Sequences. FSTTCS 2002: 182-193 |
| c26 | | Jochen Alber, Rolf Niedermeier: Improved Tree Decomposition Based Algorithms for Domination-like Problems. LATIN 2002: 613-628 |
| c25 | | Michael R. Fellows, Jens Gramm, Rolf Niedermeier: On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. STACS 2002: 262-273 |
| c24 | | 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 |
| i4 | | Michael R. Fellows, Jens Gramm, Rolf Niedermeier: Parameterized Intractability of Motif Search Problems. CoRR cs.CC/0205056 (2002) |
| i3 | | Jochen Alber, Michael R. Fellows, Rolf Niedermeier: Polynomial Time Data Reduction for Dominating Set. CoRR cs.DS/0207066 (2002) |
| 2001 | ||
| j11 | | 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) |
| j10 | | Henning Fernau, Rolf Niedermeier: An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. J. Algorithms 38(2): 374-410 (2001) |
| c23 | | Jochen Alber, Henning Fernau, Rolf Niedermeier: Graph Separators: A Parameterized View. COCOON 2001: 318-327 |
| c22 | | Jens Gramm, Rolf Niedermeier: Minimum Quartet Inconsistency Is Fixed Parameter Tractable. CPM 2001: 241-256 |
| c21 | | Jochen Alber, Henning Fernau, Rolf Niedermeier: Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. ICALP 2001: 261-272 |
| c20 | | Jens Gramm, Rolf Niedermeier, Peter Rossmanith: Exact Solutions for CLOSEST STRING and Related Problems. ISAAC 2001: 441-453 |
| c19 | | Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier: Finding Optimal Solutions to Atomix. KI/ÖGAI 2001: 229-243 |
| c18 | | 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 |
| i2 | | Jochen Alber, Henning Fernau, Rolf Niedermeier: Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. Electronic Colloquium on Computational Complexity (ECCC) 8(23) (2001) |
| 2000 | ||
| j9 | | Rolf Niedermeier, Peter Rossmanith: A general method to speed up fixed-parameter-tractable algorithms. Inf. Process. Lett. 73(3-4): 125-129 (2000) |
| j8 | | Rolf Niedermeier, Peter Rossmanith: New Upper Bounds for Maximum Satisfiability. J. Algorithms 36(1): 63-88 (2000) |
| j7 | | 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) |
| j6 | | Jochen Alber, Rolf Niedermeier: On Multidimensional Curves with Hilbert Property. Theory Comput. Syst. 33(4): 295-312 (2000) |
| c17 | | |
| c16 | | Rolf Niedermeier, Peter Rossmanith: On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. ISAAC 2000: 180-191 |
| c15 | | Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier: Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT 2000: 97-110 |
| i1 | | 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) |
| 1999 | ||
| j5 | | 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) |
| j4 | | Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier: SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s. Electronic Notes in Discrete Mathematics 3: 19-26 (1999) |
| c14 | | |
| c13 | | Henning Fernau, Rolf Niedermeier: An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. MFCS 1999: 387-397 |
| c12 | | Rolf Niedermeier, Peter Rossmanith: Upper Bounds for Vertex Cover Further Improved. STACS 1999: 561-570 |
| 1998 | ||
| j3 | | Rolf Niedermeier, Peter Rossmanith: Unambiguous Computations and Locally Definable Acceptance Types. Theor. Comput. Sci. 194(1-2): 137-161 (1998) |
| c11 | | |
| c10 | | |
| 1997 | ||
| c9 | | Rolf Niedermeier, Klaus Reinhardt, Peter Sanders: Towards Optimal Locality in Mesh-Indexings. FCT 1997: 364-375 |
| 1996 | ||
| c8 | | |
| 1995 | ||
| j2 | | Rolf Niedermeier, Peter Rossmanith: Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits. Inf. Comput. 118(2): 227-245 (1995) |
| j1 | | Rolf Niedermeier, Peter Rossmanith: On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions. Parallel Processing Letters 5: 299-309 (1995) |
| c7 | | |
| c6 | | Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith: Optimal Average Case Sorting on Arrays. STACS 1995: 503-514 |
| 1994 | ||
| c5 | | Manfred Kunde, Rolf Niedermeier, Peter Rossmanith: Faster Sorting and Routing on Grids with Diagonals. STACS 1994: 225-236 |
| 1993 | ||
| c4 | | Klaus-Jörn Lange, Rolf Niedermeier: Data-Independences of Parallel Random Access Machines. FSTTCS 1993: 104-113 |
| c3 | | Rolf Niedermeier, Peter Rossmanith: On the Power of Reading and Writing Simultaneously in Parallel Computation. ISAAC 1993: 240-249 |
| c2 | | Rolf Niedermeier, Peter Rossmanith: Extended Locally Definable Acceptance Types (Extended Abstract). STACS 1993: 473-483 |
| 1992 | ||
| c1 | | Rolf Niedermeier, Peter Rossmanith: Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). LATIN 1992: 387-400 |
Colors in the list of coauthors
Last update Sat May 25 18:58:46 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page