The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rolf Niedermeier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  93. Exact Algorithms and Experiments for Hierarchical Tree Clustering. [Citation Graph (, )][DBLP]


  94. Fixed-Parameter Algorithms for Kemeny Scores. [Citation Graph (, )][DBLP]


  95. A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. [Citation Graph (, )][DBLP]


  96. How similarity helps to efficiently compute Kemeny rankings. [Citation Graph (, )][DBLP]


  97. Graph-Based Data Clustering with Overlaps. [Citation Graph (, )][DBLP]


  98. Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. [Citation Graph (, )][DBLP]


  99. Deconstructing Intractability: A Case Study for Interval Constrained Coloring. [Citation Graph (, )][DBLP]


  100. Extended Islands of Tractability for Parsimony Haplotyping. [Citation Graph (, )][DBLP]


  101. Iterative Compression for Exactly Solving NP-Hard Minimization Problems. [Citation Graph (, )][DBLP]


  102. A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. [Citation Graph (, )][DBLP]


  103. Parameterized Complexity of Arc-Weighted Directed Steiner Problems. [Citation Graph (, )][DBLP]


  104. Kernelization through Tidying. [Citation Graph (, )][DBLP]


  105. Fixed-Parameter Algorithms for Cluster Vertex Deletion. [Citation Graph (, )][DBLP]


  106. Average Parameterization and Partial Kernelization for Computing Medians. [Citation Graph (, )][DBLP]


  107. A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. [Citation Graph (, )][DBLP]


  108. A Generalization of Nemhauser and Trotter's Local Optimization Theorem. [Citation Graph (, )][DBLP]


  109. Reflections on Multivariate Algorithmics and Problem Parameterization. [Citation Graph (, )][DBLP]


  110. Parameterized Computational Complexity of Dodgson and Young Elections. [Citation Graph (, )][DBLP]


  111. Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems. [Citation Graph (, )][DBLP]


  112. Incremental List Coloring of Graphs, Parameterized by Conservation. [Citation Graph (, )][DBLP]


  113. On Making Directed Graphs Transitive. [Citation Graph (, )][DBLP]


  114. Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. [Citation Graph (, )][DBLP]


  115. Enumerating Isolated Cliques in Synthetic and Financial Networks. [Citation Graph (, )][DBLP]


  116. Improved Algorithms and Complexity Results for Power Domination in Graphs. [Citation Graph (, )][DBLP]


  117. Techniques for Practical Fixed-Parameter Algorithms. [Citation Graph (, )][DBLP]


  118. A Generalization of Nemhauser and Trotter's Local Optimization Theorem [Citation Graph (, )][DBLP]


  119. Closest 4-leaf power is fixed-parameter tractable. [Citation Graph (, )][DBLP]


Search in 0.156secs, Finished in 0.160secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002