Haiko Müller

CoRR, 2023

2022

Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482).

[BibT_eX]

[DOI]

Dagstuhl Reports, November, 2022

2021

Counting Weighted Independent Sets beyond the Permanent.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Counting independent sets in graphs with bounded bipartite pathwidth.

[BibT_eX]

[DOI]

Catherine S. Greenhill

Random Struct. Algorithms, 2021

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Counting independent sets in strongly orderable graphs.

[BibT_eX]

[DOI]

Marc Heinrich

CoRR, 2021

2019

Counting Perfect Matchings and the Switch Chain.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Counting independent sets in cocomparability graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Quasimonotone graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2017

On the Switch Markov Chain for Perfect Matchings.

[BibT_eX]

[DOI]

Mark Jerrum

J. ACM, 2017

On rank-width of even-hole-free graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2017

2015

Partitioning a graph into disjoint cliques and a triangle-free graph.

[BibT_eX]

[DOI]

Faisal N. Abu-Khzam

Carl Feghali

Discret. Appl. Math., 2015

2014

Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs.

[BibT_eX]

[DOI]

Carl Feghali

Faisal N. Abu-Khzam

CoRR, 2014

2013

An FPT Certifying Algorithm for the Vertex-Deletion Problem.

[BibT_eX]

[DOI]

Samuel Wilson

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Characterising subclasses of perfect graphs with respect to partial orders related to edge contraction.

[BibT_eX]

Samuel Wilson

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On the Stable Degree of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Colouring AT-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2010

On a disparity between relative cliquewidth and relative NLC-width.

[BibT_eX]

[DOI]

Ruth Urner

Discret. Appl. Math., 2010

Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences.

[BibT_eX]

[DOI]

Kristina Vuskovic

J. Comb. Theory, Ser. B, 2009

On a property of minimal triangulations.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

Random walks on the vertices of transportation polytopes with constant number of sources.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

On stable cutsets in claw-free graphs and planar graphs.

[BibT_eX]

[DOI]

Van Bang Le

Raffaele Mosca

J. Discrete Algorithms, 2008

Feedback vertex set on AT-free graphs.

[BibT_eX]

[DOI]

Ioan Todinca

Discret. Appl. Math., 2008

2005

Computing the branchwidth of interval graphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Discret. Appl. Math., 2005

2004

Algorithms for graphs with small octopus.

[BibT_eX]

[DOI]

Fedor V. Fomin

Discret. Appl. Math., 2004

2003

Splitting a graph into disjoint induced paths or cycles.

[BibT_eX]

[DOI]

Hoàng-Oanh Le

Van Bang Le

Discret. Appl. Math., 2003

On the Domination Search Number.

[BibT_eX]

[DOI]

Fedor V. Fomin

Discret. Appl. Math., 2003

Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.

[BibT_eX]

[DOI]

Ioan Todinca

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

On the Recognition of General Partition Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2002

A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems.

[BibT_eX]

[DOI]

Algorithmica, 2002

2001

On treewidth approximations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Efficient algorithms for graphs with few P4's.

[BibT_eX]

[DOI]

Discret. Math., 2001

On the Tree-Degree of Graphs.

[BibT_eX]

[DOI]

Maw-Shang Chang

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000

Partial Orders on Weak Orders Convex Subsets.

[BibT_eX]

[DOI]

Jean-Xavier Rampon

Order, 2000

Degree-preserving trees.

[BibT_eX]

[DOI]

Networks, 2000

Finding and counting small induced subgraphs efficiently.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Bandwidth of Split and Circular Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

1999

Independent Sets in Asteroidal Triple-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

Approximating the Bandwidth for Asteroidal Triple-Free Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1999

On the structure of graphs with bounded asteroidal number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

New Branchwidth Territories.

[BibT_eX]

[DOI]

Jan Kratochvíl

Proceedings of the STACS 99, 1999

1998

Rankings of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

Treewidth and Minimum Fill-in on d-Trapezoid Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1998

Vertex Ranking of Asteroidal Triple-Free Graphs.

[BibT_eX]

[DOI]

C. K. Wong

Inf. Process. Lett., 1998

Bandwidth of Chain Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Degree-Preserving Forests.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Partial orders and their convex subsets.

[BibT_eX]

[DOI]

Jean-Xavier Rampon

Discret. Math., 1997

Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Measuring the Vulnerability for Classes of Intersection Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Asteroidal Sets in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996

Hamiltonian circuits in chordal bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

On edge perfectness and classes of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

Toughness, hamiltonicity and split graphs.

[BibT_eX]

[DOI]

Jenö Lehel

Discret. Math., 1996

1995

The Minimum Broadcast Time Problem for Several Processor Networks.

[BibT_eX]

[DOI]

Klaus Jansen

Theor. Comput. Sci., 1995

1994

Dominoes.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Ranking of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

On Vertex Ranking for Permutations and Other Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

The Minimum Broadcast Time Problem.

[BibT_eX]

[DOI]

Klaus Jansen

Proceedings of the Parallel and Distributed Computing, 1994

1993

A Note on Balanced Immunity.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1993

Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

Falk Nicolai

Inf. Process. Lett., 1993

Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1991

Die Kompliziertheitsklassen raumbeschränkter Turingmaschinen: Relativierungen, Inklusionen, Separationen und Immunitäten.

[BibT_eX]

[DOI]

PhD thesis, 1991

1990

Domination in Convex and Chordal Bipartite Graphs.

[BibT_eX]

[DOI]

Peter Damaschke

Inf. Process. Lett., 1990

1987

The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs.

[BibT_eX]

[DOI]