| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jean-François Couturier, Dieter Kratsch |
Bicolored independent sets and bicliques.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
On Independent Sets and Bicliques in Graphs. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos |
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. |
Theory Comput. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch |
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. |
SOFSEM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
Bandwidth on AT-free graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith |
An exact algorithm for the Maximum Leaf Spanning Tree problem. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Branch and Recharge: Exact Algorithms for Generalized Domination. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Exact Algorithms for L(2, 1)-Labeling of Graphs. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk |
Breaking the 2n-barrier for Irredundance: Two lines of attack. |
J. Discrete Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Dieter Kratsch |
Exact Algorithms for Kayles. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma |
List Coloring in the Absence of a Linear Forest. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger |
Enumerating Minimal Subset Feedback Vertex Sets. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Couturier, Dieter Kratsch |
Bicolored independent sets and bicliques. |
CTW |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh |
Parameterized algorithm for eternal vertex cover. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh |
Iterative compression and exact algorithms. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Dieter Kratsch, Jean-François Couturier |
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith |
A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Sort and Search: Exact algorithms for generalized domination. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Haiko Müller |
On a property of minimal triangulations. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca |
Exponential time algorithms for the minimum dominating set problem on some graph classes. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
A measure & conquer approach for the analysis of exact algorithms. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
Dominating set, exact algorithm, independent set |
| 1 | Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith |
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pinar Heggernes, Dieter Kratsch, Daniel Meister |
Bandwidth of bipartite permutation graphs in polynomial time. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith |
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible |
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | Iyad A. Kanj, Dieter Kratsch |
Convex Recoloring Revisited: Complexity and Exact Algorithms. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
Bandwidth on AT-Free Graphs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger |
Fully Decomposable Split Graphs. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
computational complexity, graph decomposition, integer partition |
| 1 | Dieter Kratsch, Jeremy Spinrad, R. Sritharan |
A new characterization of HH-free graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
Solving Connected Dominating Set Faster than 2 n . |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Exponential-time exact algorithm, Maximum leaf spanning tree, Connected dominating set, NP-hard problem |
| 1 | Dieter Kratsch, Haiko Müller, Ioan Todinca |
Feedback vertex set on AT-free graphs. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger |
Exact Algorithms for Treewidth and Minimum Fill-In. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni |
Exact Algorithms for Dominating Set. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
On Independent Sets and Bicliques in Graphs. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
Faster Steiner Tree Computation in Polynomial-Space. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh |
Iterative Compression and Exact Algorithms. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Dieter Kratsch, Daniel Meister |
Bandwidth of Bipartite Permutation Graphs in Polynomial Time. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Mathieu Liedloff |
An exact algorithm for the minimum dominating clique problem. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
Exact Algorithms for Graph Homomorphisms. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Dieter Kratsch |
Linear-time certifying recognition algorithms and forbidden induced subgraphs. |
Nord. J. Comput. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.) |
Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers |
WG |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Exact Algorithms for L (2, 1)-Labeling of Graphs. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad |
07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. |
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad (eds.) |
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007 |
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes |
2007 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Branch and Recharge: Exact Algorithms for Generalized Domination. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Jeremy Spinrad |
Minimal fill in O(n2.69) time. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu |
Improved bottleneck domination algorithms. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad |
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Jeremy Spinrad |
Between O(nm) and O(nalpha). |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos |
On Exact Algorithms for Treewidth. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
Measure and conquer: a simple O(20.288n) independent set algorithm. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
exponential-time exact algorithms, independent set problem, NP-hard problems, algorithms and data structures |
| 1 | Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov |
Optimal Linear Arrangement of Interval Graphs. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Mathieu Liedloff |
An Exact Algorithm for the Minimum Dominating Clique Problem. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
Solving Connected Dominating Set Faster Than 2n. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad |
On algorithms for (P5, gem)-free graphs. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. |
Bulletin of the EATCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Dieter Kratsch |
On the structure of (P5, gem)-free graphs. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch (eds.) |
Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers |
WG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
Measure and Conquer: Domination - A Case Study. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
Exact Algorithms for Graph Homomorphisms. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 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. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Dieter Kratsch, Haiko Müller |
Algorithms for graphs with small octopus. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca |
On treewidth approximations. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger |
Exact (Exponential) Algorithms for the Dominating Set Problem. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Dieter Kratsch, Ioan Todinca |
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Dieter Kratsch, Haiko Müller |
On the Domination Search Number. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Haiko Müller, Ioan Todinca |
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad |
Certifying algorithms for recognizing interval graphs and permutation graphs. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Jeremy Spinrad |
Between O(nm) and O(n alpha). |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli |
Approximating minimum cocolorings. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller |
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Asteroidal triple, Minimum fill-in, Vertex ranking, Algorithm, Complexity, Graph, Treewidth |
| 1 | Hans L. Bodlaender, Dieter Kratsch |
Kayles and Nimbers. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Lorna Stewart |
Approximating Bandwidth by Mixing Layouts of Interval Graphs. |
SIAM J. Discrete Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jitender S. Deogun, Dieter Kratsch |
Dominating Pair Graphs. |
SIAM J. Discrete Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Hempel, Dieter Kratsch |
On claw-free asteroidal triple-free graphs. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca |
On treewidth approximations. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu |
Efficient algorithms for graphs with few P4's. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Dieter Kratsch, Haiko Müller |
On the Structure of Graphs with Bounded Asteroidal Number. |
Graphs and Combinatorics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli |
Approximating Minimum Cocolourings. |
FCT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Dieter Kratsch, Haiko Müller |
Finding and counting small induced subgraphs efficiently. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller |
Degree-preserving trees. |
Networks |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch |
Domination and Total Domination on Asteroidal Triple-free Graphs. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman |
Chordality and 2-factors in Tough Graphs. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Dieter Kratsch, Haiko Müller |
On the Domination Search Number. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller |
Bandwidth of Split and Circular Permutation Graphs. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Lorna Stewart |
Approximating Bandwidth by Mixing Layouts of Interval Graphs. |
Electronic Notes in Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Dieter Kratsch, Haiko Müller |
On the structure of graphs with bounded asteroidal number. |
Electronic Notes in Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Dieter Kratsch, Haiko Müller |
Approximating the Bandwidth for Asteroidal Triple-Free Graphs. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller |
Independent Sets in Asteroidal Triple-Free Graphs. |
SIAM J. Discrete Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller |
On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Hempel, Dieter Kratsch |
On Claw-Free Asteroidal Triple-Free Graphs. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Lorna Stewart |
Approximating Bandwidth by Mixing Layouts of Interval Graphs. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Dieter Kratsch, Haiko Müller |
Bandwidth of Chain Graphs. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Jean-Xavier Rampon |
Tree-visibility orders. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Dieter Kratsch, C. K. Wong |
Minimum Fill-in on Circle and Circular-Arc Graphs. |
J. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza |
Rankings of Graphs. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Dieter Kratsch |
Listing All Minimal Separators of a Graph. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")