Haiko Müller - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 77 from 77

2022

Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482)Holger Dell, Mark Richard Jerrum, Haiko Müller, Konrad Anand, Marcus Pappik. dagstuhl-reports, 12(11):124-145, November 2022. [doi]

2021

2019

Counting independent sets in cocomparability graphsMartin E. Dyer, Haiko Müller. ipl, 144:31-36, 2019. [doi]

Counting Perfect Matchings and the Switch ChainMartin E. Dyer, Haiko Müller. siamdm, 33(3):1146-1174, 2019. [doi]

Quasimonotone graphsMartin E. Dyer, Haiko Müller. DAM, 271:25-48, 2019. [doi]

Counting Independent Sets in Graphs with Bounded Bipartite PathwidthMartin E. Dyer, Catherine S. Greenhill, Haiko Müller. wg 2019: 298-310 [doi]

2018

Quasimonotone GraphsMartin E. Dyer, Haiko Müller. wg 2018: 190-202 [doi]

2017

On rank-width of even-hole-free graphsIsolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic. dmtcs, 19(1), 2017. [doi]

On the Switch Markov Chain for Perfect MatchingsMartin E. Dyer, Mark Jerrum, Haiko Müller. JACM, 64(2), 2017. [doi]

2016

On the switch Markov chain for perfect matchingsMartin E. Dyer, Mark Jerrum, Haiko Müller. soda 2016: 1972-1983 [doi]

2015

Partitioning a graph into disjoint cliques and a triangle-free graphFaisal N. Abu-Khzam, Carl Feghali, Haiko Müller. DAM, 190:1-12, 2015. [doi]

2013

An FPT Certifying Algorithm for the Vertex-Deletion ProblemHaiko Müller, Samuel Wilson. iwoca 2013: 468-472 [doi]

Characterising subclasses of perfect graphs with respect to partial orders related to edge contractionHaiko Müller, Samuel Wilson. colognetwente 2013: 183-186

2012

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique numberKonrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach. jda, 14:207-213, 2012. [doi]

Colouring AT-Free GraphsDieter Kratsch, Haiko Müller. esa 2012: 707-718 [doi]

On the Stable Degree of GraphsHaiko Müller. wg 2012: 148-159 [doi]

2010

Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph ClassesKonrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach. iwoca 2011: 1-9 [doi]

On a disparity between relative cliquewidth and relative NLC-widthHaiko Müller, Ruth Urner. DAM, 158(7):828-840, 2010. [doi]

2009

On a property of minimal triangulationsDieter Kratsch, Haiko Müller. DM, 309(6):1724-1729, 2009. [doi]

2008

Random walks on the vertices of transportation polytopes with constant number of sourcesMary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie. rsa, 33(3):333-355, 2008. [doi]

Feedback vertex set on AT-free graphsDieter Kratsch, Haiko Müller, Ioan Todinca. DAM, 156(10):1936-1947, 2008. [doi]

On stable cutsets in claw-free graphs and planar graphsVan Bang Le, Raffaele Mosca, Haiko Müller. jda, 6(2):256-276, 2008. [doi]

2005

Computing the branchwidth of interval graphsTon Kloks, Jan Kratochvíl, Haiko Müller. DAM, 145(2):266-275, 2005. [doi]

On Stable Cutsets in Claw-Free Graphs and Planar GraphsVan Bang Le, Raffaele Mosca, Haiko Müller. criwg 2005: 163-174 [doi]

2004

On treewidth approximationsVincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca. DAM, 136(2-3):183-196, 2004. [doi]

Algorithms for graphs with small octopusFedor V. Fomin, Dieter Kratsch, Haiko Müller. DAM, 134(1-3):105-128, 2004. [doi]

2003

2002

A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation ProblemsHajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller. algorithmica, 32(4):594-610, 2002. [doi]

2001

Efficient algorithms for graphs with few ::::P::::::4:: sLuitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu. DM, 235(1-3):29-51, 2001. [doi]

On treewidth approximationsVincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca. endm, 8:98-101, 2001. [doi]

On the Tree-Degree of GraphsMaw-Shang Chang, Haiko Müller. criwg 2001: 44-54 [doi]

On the Structure of Graphs with Bounded Asteroidal NumberTon Kloks, Dieter Kratsch, Haiko Müller. gc, 17(2):295-306, 2001. [doi]

2000

Degree-preserving treesHajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller. networks, 35(1):26-39, 2000. [doi]

On the Domination Search NumberFedor V. Fomin, Dieter Kratsch, Haiko Müller. criwg 2000: 161-171 [doi]

Bandwidth of Split and Circular Permutation GraphsTon Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller. criwg 2000: 243-254 [doi]

Finding and counting small induced subgraphs efficientlyTon Kloks, Dieter Kratsch, Haiko Müller. ipl, 74(3-4):115-121, 2000. [doi]

Partial Orders on Weak Orders Convex SubsetsHaiko Müller, Jean-Xavier Rampon. order, 17(2):103-123, 2000. [doi]

1999

1998

Treewidth and Minimum Fill-in on d-Trapezoid GraphsHans Leo Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller. jgaa, 2(2):1-23, 1998. [doi]

Rankings of GraphsHans Leo Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza. siamdm, 11(1):168-181, 1998. [doi]

A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex RankingHajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller. criwg 1998: 88-99

Degree-Preserving ForestsHajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra. mfcs 1998: 713-721 [doi]

Vertex Ranking of Asteroidal Triple-Free GraphsTon Kloks, Haiko Müller, C. K. Wong. ipl, 68(4):201-206, 1998. [doi]

Bandwidth of Chain GraphsTon Kloks, Dieter Kratsch, Haiko Müller. ipl, 68(6):313-315, 1998. [doi]

1997

Independent Sets in Asteroidal Triple-Free GraphsHajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller. icalp 1997: 760-770

Asteroidal Sets in GraphsTon Kloks, Dieter Kratsch, Haiko Müller. criwg 1997: 229-241

Measuring the Vulnerability for Classes of Intersection GraphsDieter Kratsch, Ton Kloks, Haiko Müller. DAM, 77(3):259-270, 1997. [doi]

Partial orders and their convex subsetsHaiko Müller, Jean-Xavier Rampon. DM, 165-166:507-517, 1997. [doi]

Recognizing Interval Digraphs and Interval Bigraphs in Polynomial TimeHaiko Müller. DAM, 78(1-3):189-205, 1997. [doi]

1996

Vertex Ranking of Asteroidal Triple-Free GraphsTon Kloks, Haiko Müller, C. K. Wong. isaac 1996: 174-182

Toughness, hamiltonicity and split graphsDieter Kratsch, Jenö Lehel, Haiko Müller. DM, 150(1-3):231-245, 1996. [doi]

Hamiltonian circuits in chordal bipartite graphsHaiko Müller. DM, 156(1-3):291-298, 1996. [doi]

On edge perfectness and classes of bipartite graphsHaiko Müller. DM, 149(1-3):159-187, 1996. [doi]

1995

The Minimum Broadcast Time Problem for Several Processor NetworksKlaus Jansen, Haiko Müller. TCS, 147(1&2):69-85, 1995. [doi]

Approximating the Bandwidth for Asteroidal Triple-Free GraphsTon Kloks, Dieter Kratsch, Haiko Müller. esa 1995: 434-447

Finding and Counting Small Induced Subgraphs EfficientlyTon Kloks, Dieter Kratsch, Haiko Müller. criwg 1995: 14-23

1994

1993

Computing Treewidth and Minimum Fill-In: All You Need are the Minimal SeparatorsTon Kloks, Hans Leo Bodlaender, Haiko Müller, Dieter Kratsch. esa 1993: 260-271

A Note on Balanced ImmunityHaiko Müller. mst, 26(2):157-167, 1993.

Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary GraphsHaiko Müller, Falk Nicolai. ipl, 46(5):225-230, 1993.

1991

Die Kompliziertheitsklassen raumbeschränkter Turingmaschinen: Relativierungen, Inklusionen, Separationen und ImmunitätenHaiko Müller. PhD thesis, University of Jena, Germany, 1991. [doi]

1990

Domination in Convex and Chordal Bipartite GraphsPeter Damaschke, Haiko Müller, Dieter Kratsch. ipl, 36(5):231-236, 1990.

1987

The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite GraphsHaiko Müller, Andreas Brandstädt. TCS, 53:257-265, 1987.

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Haiko Müller'

Viewing Publication 1 - 77 from 77

2022

2021

2019

2018

2017

2016

2015

2013

2012

2010

2009

2008

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1991

1990

1987

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Haiko Müller'

Viewing Publication 1 - 77 from 77

2022

2021

2019

2018

2017

2016

2015

2013

2012

2010

2009

2008

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1991

1990

1987

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1