The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dieter Kratsch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng
    On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:808-817 [Conf]
  2. Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
    On Exact Algorithms for Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:672-683 [Conf]
  3. Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
    Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:260-271 [Conf]
  4. Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
    Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:508- [Conf]
  5. Ton Kloks, Dieter Kratsch, Haiko Müller
    Approximating the Bandwidth for Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:434-447 [Conf]
  6. Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
    Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:61-72 [Conf]
  7. Andreas Brandstädt, Dieter Kratsch
    On the restriction of some NP-complete graph problems to permutation graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:53-62 [Conf]
  8. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
    Exact Algorithms for Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:161-171 [Conf]
  9. Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli
    Approximating Minimum Cocolourings. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:118-125 [Conf]
  10. Dieter Kratsch, Lane A. Hemachandra
    On the Complexity of Graph Reconstruction. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:318-328 [Conf]
  11. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Solving Connected Dominating Set Faster Than 2n. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:152-163 [Conf]
  12. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
    Treewidth and Pathwidth of Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:114-125 [Conf]
  13. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    Independent Sets in Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:760-770 [Conf]
  14. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Measure and Conquer: Domination - A Case Study. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:191-203 [Conf]
  15. Fedor V. Fomin, Dieter Kratsch, Ioan Todinca
    Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:568-580 [Conf]
  16. Ton Kloks, Dieter Kratsch, C. K. Wong
    Minimum Fill-In on Circle and Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:256-267 [Conf]
  17. Dieter Kratsch, Mathieu Liedloff
    An Exact Algorithm for the Minimum Dominating Clique Problem. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:130-141 [Conf]
  18. Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra
    Degree-Preserving Forests. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:713-721 [Conf]
  19. Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov
    Optimal Linear Arrangement of Interval Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:267-279 [Conf]
  20. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Measure and conquer: a simple O(20.288n) independent set algorithm. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:18-25 [Conf]
  21. Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad
    Certifying algorithms for recognizing interval graphs and permutation graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:158-167 [Conf]
  22. Dieter Kratsch, Jeremy Spinrad
    Between O(nm) and O(n alpha). [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:709-716 [Conf]
  23. Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
    On Vertex Ranking for Permutations and Other Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:747-758 [Conf]
  24. Ton Kloks, Dieter Kratsch
    Treewidth of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:80-89 [Conf]
  25. Ton Kloks, Dieter Kratsch
    Finding All Minimal Separators of a Graph. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:759-768 [Conf]
  26. Dieter Kratsch, Lorna Stewart
    Approximating Bandwidth by Mixing Layouts of Interval Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:248-258 [Conf]
  27. Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
    Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:148-159 [Conf]
  28. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:88-99 [Conf]
  29. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
    Ranking of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:292-304 [Conf]
  30. Jitender S. Deogun, Dieter Kratsch
    Diametral Path Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:344-357 [Conf]
  31. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
    On the Domination Search Number. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:161-171 [Conf]
  32. Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger
    Exact (Exponential) Algorithms for the Dominating Set Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:245-256 [Conf]
  33. Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller
    Bandwidth of Split and Circular Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:243-254 [Conf]
  34. Ton Kloks, Dieter Kratsch, Haiko Müller
    Dominoes. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:106-120 [Conf]
  35. Ton Kloks, Dieter Kratsch, Haiko Müller
    Finding and Counting Small Induced Subgraphs Efficiently. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:14-23 [Conf]
  36. Ton Kloks, Dieter Kratsch, Haiko Müller
    Asteroidal Sets in Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:229-241 [Conf]
  37. Harald Hempel, Dieter Kratsch
    On Claw-Free Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:377-390 [Conf]
  38. Dieter Kratsch, Haiko Müller, Ioan Todinca
    Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:309-321 [Conf]
  39. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:4, pp:594-610 [Journal]
  40. Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman
    Chordality and 2-factors in Tough Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:323-329 [Journal]
  41. Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
    On treewidth approximations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:183-196 [Journal]
  42. Andreas Brandstädt, Dieter Kratsch
    On the structure of (P5, gem)-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:155-166 [Journal]
  43. Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
    On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:39-63 [Journal]
  44. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
    On the Domination Search Number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:3, pp:565-580 [Journal]
  45. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
    Algorithms for graphs with small octopus. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:105-128 [Journal]
  46. John G. Gimbel, Dieter Kratsch, Lorna Stewart
    On Cocolourings and Cochromatic Numbers of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:48, n:2, pp:111-127 [Journal]
  47. Harald Hempel, Dieter Kratsch
    On claw-free asteroidal triple-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:155-180 [Journal]
  48. Dieter Kratsch
    Domination and Total Domination on Asteroidal Triple-free Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:111-123 [Journal]
  49. Dieter Kratsch, Ton Kloks, Haiko Müller
    Measuring the Vulnerability for Classes of Intersection Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:77, n:3, pp:259-270 [Journal]
  50. Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu
    Improved bottleneck domination algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:11, pp:1578-1592 [Journal]
  51. Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
    Efficient algorithms for graphs with few P4's. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:29-51 [Journal]
  52. Dieter Kratsch, Jeremy Spinrad
    Minimal fill in O(n2.69) time. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:3, pp:366-371 [Journal]
  53. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:87, n:, pp:47-77 [Journal]
  54. Andreas Brandstädt, Dieter Kratsch
    On Partitions of Permutations into Increasing and Decreasing Subsequences. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1986, v:22, n:5/6, pp:263-273 [Journal]
  55. Ton Kloks, Dieter Kratsch, Haiko Müller
    On the Structure of Graphs with Bounded Asteroidal Number. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:2, pp:295-306 [Journal]
  56. Dieter Kratsch
    Finding the Minimum Bandwidth of an Interval Graphs [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:74, n:2, pp:140-158 [Journal]
  57. Peter Damaschke, Haiko Müller, Dieter Kratsch
    Domination in Convex and Chordal Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:5, pp:231-236 [Journal]
  58. Jitender S. Deogun, Dieter Kratsch, George Steiner
    An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:3, pp:121-127 [Journal]
  59. Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli
    Approximating minimum cocolorings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:5, pp:285-290 [Journal]
  60. Ton Kloks, Dieter Kratsch
    Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:1, pp:11-16 [Journal]
  61. Ton Kloks, Dieter Kratsch, Haiko Müller
    Finding and counting small induced subgraphs efficiently. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:3-4, pp:115-121 [Journal]
  62. Ton Kloks, Dieter Kratsch, Haiko Müller
    Bandwidth of Chain Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:6, pp:313-315 [Journal]
  63. Dieter Kratsch, Lorna Stewart
    Total Domination and Transformation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:3, pp:167-170 [Journal]
  64. Hans L. Bodlaender, Dieter Kratsch
    Kayles and Nimbers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:1, pp:106-119 [Journal]
  65. Ton Kloks, Dieter Kratsch
    Treewidth of Chordal Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:2, pp:266-281 [Journal]
  66. Ton Kloks, Dieter Kratsch, Haiko Müller
    Approximating the Bandwidth for Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:32, n:1, pp:41-57 [Journal]
  67. Ton Kloks, Dieter Kratsch, C. K. Wong
    Minimum Fill-in on Circle and Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:2, pp:272-289 [Journal]
  68. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller
    Treewidth and Minimum Fill-in on d-Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  69. Dieter Kratsch, Lane A. Hemaspaandra
    On the Complexity of Graph Reconstruction. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:3, pp:257-273 [Journal]
  70. Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller
    Degree-preserving trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:1, pp:26-39 [Journal]
  71. Ton Kloks, Dieter Kratsch
    Listing All Minimal Separators of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:605-613 [Journal]
  72. Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad
    Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:326-353 [Journal]
  73. Dieter Kratsch, Jeremy Spinrad
    Between O(nm) and O(nalpha). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:310-325 [Journal]
  74. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
    Rankings of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:1, pp:168-181 [Journal]
  75. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
    Treewidth and Pathwidth of Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:4, pp:606-616 [Journal]
  76. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    Independent Sets in Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:2, pp:276-287 [Journal]
  77. Jitender S. Deogun, Dieter Kratsch
    Dominating Pair Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:3, pp:353-366 [Journal]
  78. Dieter Kratsch, Lorna Stewart
    Approximating Bandwidth by Mixing Layouts of Interval Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:4, pp:435-449 [Journal]
  79. Dieter Kratsch, Lorna Stewart
    Domination on Cocomparability Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:3, pp:400-417 [Journal]
  80. Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
    On algorithms for (P5, gem)-free graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:2-21 [Journal]
  81. Hans L. Bodlaender, Dieter Kratsch
    The Complexity of Coloring Games on Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:2, pp:309-326 [Journal]
  82. Andreas Brandstädt, Dieter Kratsch
    On Domination Problems for Permutation and Other Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:54, n:, pp:181-198 [Journal]
  83. Ton Kloks, Dieter Kratsch, Jeremy Spinrad
    On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:2, pp:309-335 [Journal]
  84. Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
    Exact Algorithms for L (2, 1)-Labeling of Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:513-524 [Conf]
  85. Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
    Branch and Recharge: Exact Algorithms for Generalized Domination. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:507-518 [Conf]
  86. Dieter Kratsch, Jean-Xavier Rampon
    Tree-visibility orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:190, n:1-3, pp:163-175 [Journal]
  87. Dieter Kratsch, Jean-Xavier Rampon
    Width two posets are reconstructible. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:305-310 [Journal]
  88. Jitender S. Deogun, Dieter Kratsch, George Steiner
    1-Tough cocomparability graphs are hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:99-106 [Journal]
  89. Dieter Kratsch
    Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:86, n:1-3, pp:225-238 [Journal]
  90. Dieter Kratsch, Jenö Lehel, Haiko Müller
    Toughness, hamiltonicity and split graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:231-245 [Journal]
  91. Dieter Kratsch, Peter Damaschke, Anna Lubiw
    Dominating cliques in chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:128, n:1-3, pp:269-275 [Journal]
  92. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
    Exact Algorithms for Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:41, n:2, pp:381-393 [Journal]
  93. Dieter Kratsch, Mathieu Liedloff
    An exact algorithm for the minimum dominating clique problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:226-240 [Journal]

  94. A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. [Citation Graph (, )][DBLP]


  95. Convex Recoloring Revisited: Complexity and Exact Algorithms. [Citation Graph (, )][DBLP]


  96. 07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. [Citation Graph (, )][DBLP]


  97. Faster Steiner Tree Computation in Polynomial-Space. [Citation Graph (, )][DBLP]


  98. Bandwidth on AT-Free Graphs. [Citation Graph (, )][DBLP]


  99. An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. [Citation Graph (, )][DBLP]


  100. Bandwidth of Bipartite Permutation Graphs in Polynomial Time. [Citation Graph (, )][DBLP]


  101. Iterative Compression and Exact Algorithms. [Citation Graph (, )][DBLP]


  102. Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. [Citation Graph (, )][DBLP]


  103. On Independent Sets and Bicliques in Graphs. [Citation Graph (, )][DBLP]


  104. Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. [Citation Graph (, )][DBLP]


  105. Fully Decomposable Split Graphs. [Citation Graph (, )][DBLP]


  106. Solving Connected Dominating Set Faster than 2 n . [Citation Graph (, )][DBLP]


  107. Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles [Citation Graph (, )][DBLP]


  108. Feedback vertex set on AT-free graphs. [Citation Graph (, )][DBLP]


  109. A new characterization of HH-free graphs. [Citation Graph (, )][DBLP]


  110. On a property of minimal triangulations. [Citation Graph (, )][DBLP]


Search in 0.097secs, Finished in 0.100secs
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