Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Haiko
    Last name: Müller
    DBLP: m/HaikoMuller
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 72 of 72  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Martin E. Dyer, Haiko Müller.
    Counting perfect matchings and the switch chain.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Martin E. Dyer, Mark Jerrum, Haiko Müller.
    On the Switch Markov Chain for Perfect Matchings.
    J. ACM 2017, Volume 64 (0) 2017
    Conference paper
    Martin E. Dyer, Mark Jerrum, Haiko Müller.
    On the switch Markov chain for perfect matchings.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic.
    On rank-width of even-hole-free graphs.
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Martin E. Dyer, Mark Jerrum, Haiko Müller.
    On the switch Markov chain for perfect matchings.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Faisal N. Abu-Khzam, Carl Feghali, Haiko Müller.
    Partitioning a graph into disjoint cliques and a triangle-free graph.
    Discrete Applied Mathematics 2015, Volume 190 (0) 2015
    Journal article
    Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller.
    Forbidden subgraph characterization of (P
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller.
    NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Haiko Müller, Samuel Wilson.
    Characterising subclasses of perfect graphs with respect to partial orders related to edge contraction.
    12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013. 2013 (0) 2013
    Conference paper
    Haiko Müller, Samuel Wilson.
    An FPT Certifying Algorithm for the Vertex-Deletion Problem.
    Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers 2013 (0) 2013
    Journal article
    Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach.
    Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number.
    J. Discrete Algorithms 2012, Volume 14 (0) 2012
    Conference paper
    Dieter Kratsch, Haiko Müller.
    Colouring AT-Free Graphs.
    Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Haiko Müller.
    On the Stable Degree of Graphs.
    Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers 2012 (0) 2012
    Conference paper
    Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach.
    Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes.
    Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers 2011 (0) 2010
    Conference paper
    Haiko Müller, Ruth Urner.
    On a disparity between relative cliquewidth and relative NLC-width.
    Discrete Applied Mathematics 2010, Volume 158 (0) 2010
    Conference paper
    Ton Kloks, Haiko Müller, Kristina Vuskovic.
    Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences.
    J. Comb. Theory, Ser. B 2009, Volume 99 (0) 2009
    Conference paper
    Dieter Kratsch, Haiko Müller.
    On a property of minimal triangulations.
    Discrete Mathematics 2009, Volume 309 (0) 2009
    Conference paper
    Dieter Kratsch, Haiko Müller, Ioan Todinca.
    Feedback vertex set on AT-free graphs.
    Discrete Applied Mathematics 2008, Volume 156 (0) 2008
    Conference paper
    Van Bang Le, Raffaele Mosca, Haiko Müller.
    On stable cutsets in claw-free graphs and planar graphs.
    J. Discrete Algorithms 2008, Volume 6 (0) 2008
    Conference paper
    Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie.
    Random walks on the vertices of transportation polytopes with constant number of sources.
    Random Struct. Algorithms 2008, Volume 33 (0) 2008
    Conference paper
    Van Bang Le, Raffaele Mosca, Haiko Müller.
    On Stable Cutsets in Claw-Free Graphs and Planar Graphs.
    Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers 2005 (0) 2005
    Conference paper
    Ton Kloks, Jan Kratochvíl, Haiko Müller.
    Computing the branchwidth of interval graphs.
    Discrete Applied Mathematics 2004, Volume 145 (0) 2005
    Conference paper
    Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca.
    On treewidth approximations.
    Discrete Applied Mathematics 2004, Volume 136 (0) 2004
    Conference paper
    Fedor V. Fomin, Dieter Kratsch, Haiko Müller.
    Algorithms for graphs with small octopus.
    Discrete Applied Mathematics 2004, Volume 134 (0) 2004
    Conference paper
    Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie.
    Random walks on the vertices of transportation polytopes with constant number of sources.
    SODA 2003 (0) 2003
    Conference paper
    Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller.
    On the Recognition of General Partition Graphs.
    Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers 2003 (0) 2003
    Conference paper
    Dieter Kratsch, Haiko Müller, Ioan Todinca.
    Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.
    Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers 2003 (0) 2003
    Conference paper
    Fedor V. Fomin, Dieter Kratsch, Haiko Müller.
    On the Domination Search Number.
    Discrete Applied Mathematics 2003, Volume 127 (0) 2003
    Conference paper
    Hoàng-Oanh Le, Van Bang Le, Haiko Müller.
    Splitting a graph into disjoint induced paths or cycles.
    Discrete Applied Mathematics 2003, Volume 131 (0) 2003
    Conference paper
    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, Volume 32 (0) 2002
    Conference paper
    Maw-Shang Chang, Haiko Müller.
    On the Tree-Degree of Graphs.
    Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu.
    Efficient algorithms for graphs with few
    Discrete Mathematics 2001, Volume 235 (0) 2001
    Conference paper
    Ton Kloks, Dieter Kratsch, Haiko Müller.
    On the Structure of Graphs with Bounded Asteroidal Number.
    Graphs and Combinatorics 2001, Volume 17 (0) 2001
    Conference paper
    Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca.
    On treewidth approximations.
    Electronic Notes in Discrete Mathematics 2001, Volume 8 (0) 2001
    Conference paper
    Fedor V. Fomin, Dieter Kratsch, Haiko Müller.
    On the Domination Search Number.
    Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings 2000 (0) 2000
    Conference paper
    Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller.
    Bandwidth of Split and Circular Permutation Graphs.
    Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings 2000 (0) 2000
    Conference paper
    Ton Kloks, Dieter Kratsch, Haiko Müller.
    Finding and counting small induced subgraphs efficiently.
    Inf. Process. Lett. 2000, Volume 74 (0) 2000
    Conference paper
    Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller.
    Degree-preserving trees.
    Networks 2000, Volume 35 (0) 2000
    Conference paper
    Haiko Müller, Jean-Xavier Rampon.
    Partial Orders on Weak Orders Convex Subsets.
    Order 2000, Volume 17 (0) 2000
    Conference paper
    Ton Kloks, Jan Kratochvíl, Haiko Müller.
    New Branchwidth Territories.
    STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings 1999 (0) 1999
    Conference paper
    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 2000, Volume 98 (0) 1999
    Conference paper
    Ton Kloks, Dieter Kratsch, Haiko Müller.
    Approximating the Bandwidth for Asteroidal Triple-Free Graphs.
    J. Algorithms 1999, Volume 32 (0) 1999
    Conference paper
    Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller.
    Independent Sets in Asteroidal Triple-Free Graphs.
    SIAM J. Discrete Math. 1999, Volume 12 (0) 1999
    Conference paper
    Ton Kloks, Dieter Kratsch, Haiko Müller.
    On the structure of graphs with bounded asteroidal number.
    Electronic Notes in Discrete Mathematics 1999, Volume 3 (0) 1999
    Conference paper
    Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra.
    Degree-Preserving Forests.
    Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings 1998 (0) 1998
    Conference paper
    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.
    Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings 1998 (0) 1998
    Conference paper
    Ton Kloks, Dieter Kratsch, Haiko Müller.
    Bandwidth of Chain Graphs.
    Inf. Process. Lett. 1998, Volume 68 (0) 1998
    Conference paper
    Ton Kloks, Haiko Müller, Chak-Kuen Wong.
    Vertex Ranking of Asteroidal Triple-Free Graphs.
    Inf. Process. Lett. 1998, Volume 68 (0) 1998
    Conference paper
    Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller.
    Treewidth and Minimum Fill-in on d-Trapezoid Graphs.
    J. Graph Algorithms Appl. 1998, Volume 2 (0) 1998
    Conference paper
    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, Volume 11 (0) 1998
    Conference paper
    Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller.
    Independent Sets in Asteroidal Triple-Free Graphs.
    Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings 1997 (0) 1997
    Conference paper
    Ton Kloks, Dieter Kratsch, Haiko Müller.
    Asteroidal Sets in Graphs.
    Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings 1997 (0) 1997
    Conference paper
    Dieter Kratsch, Ton Kloks, Haiko Müller.
    Measuring the Vulnerability for Classes of Intersection Graphs.
    Discrete Applied Mathematics 1997, Volume 77 (0) 1997
    Conference paper
    Haiko Müller.
    Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time.
    Discrete Applied Mathematics 1997, Volume 78 (0) 1997
    Conference paper
    Haiko Müller, Jean-Xavier Rampon.
    Partial orders and their convex subsets.
    Discrete Mathematics 1997, Volume 165 (0) 1997
    Conference paper
    Ton Kloks, Haiko Müller, Chak-Kuen Wong.
    Vertex Ranking of Asteroidal Triple-Free Graphs.
    Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings 1996 (0) 1996
    Conference paper
    Haiko Müller.
    On edge perfectness and classes of bipartite graphs.
    Discrete Mathematics 1996, Volume 149 (0) 1996
    Conference paper
    Dieter Kratsch, Jenö Lehel, Haiko Müller.
    Toughness, hamiltonicity and split graphs.
    Discrete Mathematics 1996, Volume 150 (0) 1996
    Conference paper
    Haiko Müller.
    Hamiltonian circuits in chordal bipartite graphs.
    Discrete Mathematics 1996, Volume 156 (0) 1996
    Conference paper
    Ton Kloks, Dieter Kratsch, Haiko Müller.
    Approximating the Bandwidth for Asteroidal Triple-Free Graphs.
    Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings 1995 (0) 1995
    Conference paper
    Ton Kloks, Dieter Kratsch, Haiko Müller.
    Finding and Counting Small Induced Subgraphs Efficiently.
    Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings 1995 (0) 1995
    Conference paper
    Klaus Jansen, Haiko Müller.
    The Minimum Broadcast Time Problem for Several Processor Networks.
    Theor. Comput. Sci. 1995, Volume 147 (0) 1995
    Conference paper
    Klaus Jansen, Haiko Müller.
    The Minimum Broadcast Time Problem.
    Parallel and Distributed Computing, First Canada-France Conference, Montréal, Canada, May 19-21, 1994, Proceedings 1994 (0) 1994
    Conference paper
    Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch.
    Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.
    Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings 1994 (0) 1994
    Conference paper
    Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller.
    On Vertex Ranking for Permutations and Other Graphs.
    STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings 1994 (0) 1994
    Conference paper
    Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza.
    Ranking of Graphs.
    Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings 1995 (0) 1994
    Conference paper
    Ton Kloks, Dieter Kratsch, Haiko Müller.
    Dominoes.
    Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings 1995 (0) 1994
    Conference paper
    Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch.
    Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.
    Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings 1993 (0) 1993
    Conference paper
    Haiko Müller, Falk Nicolai.
    Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs.
    Inf. Process. Lett. 1993, Volume 46 (0) 1993
    Conference paper
    Haiko Müller.
    A Note on Balanced Immunity.
    Mathematical Systems Theory 1993, Volume 26 (0) 1993
    Conference paper
    Peter Damaschke, Haiko Müller, Dieter Kratsch.
    Domination in Convex and Chordal Bipartite Graphs.
    Inf. Process. Lett. 1990, Volume 36 (0) 1990
    Conference paper
    Haiko Müller, Andreas Brandstädt.
    The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs.
    Theor. Comput. Sci. 1987, Volume 53 (0) 1987
    Show item 1 to 72 of 72  

    Your query returned 72 matches in the database.