Next: Accepted Up: Haiko Müller - list Previous: In Proceedings

Technical Reports

  1. On a Disparity Between Relative Cliquewidth and Relative NLC-width, joint work with Ruth Urner, University of Leeds, School of Computing Research Report Series No. 2008.07 Leeds, December 2008.

  2. On a property of minimal triangulations, joint work with Dieter Kratsch, University of Leeds, School of Computing Research Report Series No. 2007.04 Leeds, July 2007.
    to appear in Discrete Mathematics.

  3. Blanketing general partition graphs, joint work with Ton Kloks, Chuan-Min Lee and Jiping Liu, University of Lethbridge Report TR-MA-02-01, Lethbridge 2002.
    Proceedings version: Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), Springer-Verlag Lecture Notes in Computer Science 2880 (2003) 273-283.

  4. Random walks on the vertices of transportation polytops with constant number of sources, joint work with Mary Cryan, Martin Dyer and Leen Stougie, Technische Universiteit Eindhoven SPOR-Report 2002-14, Eindhoven 2002.
    Proceedings version: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) 330-339.

  5. Algorithms for graphs with small octopus, joint work with Fedor V. Fomin and Dieter Kratsch, University of Leeds, School of Computing Research Report Series No. 2001.12, Leeds 2001.
    Journal version: Discrete Applied Mathematics 134(2004) 105-128.

  6. On the domination search number, joint work with Fedor V. Fomin and Dieter Kratsch, Friedrich-Schiller-Universität, Jenaer Schriften zur Mathematik und Informatik Math/Inf/00/08, Jena 2000.
    Proceedings version: Springer-Verlag Lecture Notes in Computer Science 1928 (2000) 161-171.
    Journal version: Discrete Applied Mathematics 127 (2003) 565-580.

  7. Degree-preserving forests, joint work with Hajo Broersma, Andreas Huck, Ton Kloks, Otto Koppius, Dieter Kratsch and Hilde Tuinstra, Universitas Carolina KAM-DIMATIA Series No. 98-402, Praha 1998.
    Proceedings version: Springer-Verlag Lecture Notes in Computer Science 1450 (1998) 713-721.
    Journal version: Networks 35 (2000) 26-39.

  8. A generalization of AT-free graphs and a generic algorithm for solving triangulation problems, joint work with Hajo Broersma, Ton Kloks and Dieter Kratsch, Universitas Carolina KAM-DIMATIA Series No. 98-399, Praha 1998.
    Proceedings version: Springer-Verlag Lecture Notes in Computer Science 1517 (1998) 88-99.
    Journal version: Algorithmica 32 (2002) 594-610.

  9. Additive tree spanners, joint work with Dieter Kratsch, Hoàng-Oanh Le, Erich Prisner and Dorothea Wagner, Konstanzer Schriften in Mathematik und Informatik No. 52, Konstanz, January 1998.
    Journal version: SIAM Journal on Discrete Mathematics 17 (2003) 332-340.

  10. On the structure of graphs with bounded asteroidal number, joint work with Ton Kloks and Dieter Kratsch, Friedrich-Schiller-Universität Forschungsergebnisse Math/Inf/97/22, Jena 1997.
    Proceedings version: Electronic Notes in Discrete Mathematics 3.
    Journal version: Graphs and Combinatorics 17 (2001) 295-306.

  11. Partial orders on weak orders convex subsets, joint work with Jean-Xavier Rampon, Friedrich-Schiller-Universität Forschungsergebnisse Math/Inf/97/01, Jena 1997.
    Journal version: Order 17 (2000) 103-123.

  12. Independent sets in asteroidal triple-free graphs, joint work with Hajo Broersma, Ton Kloks and Dieter Kratsch, Universiteit Twente Memorandum No. 1359, Enschede 1996.
    Proceedings version: Springer-Verlag Lecture Notes in Computer Science 1256 (1997) 760-770.
    Journal version: SIAM Journal on Discrete Mathematics 12 (1999) 276-287.

  13. Asteroidal sets in graphs, joint work with Dieter Kratsch and Ton Kloks, Universiteit Twente Memorandum No. 1347, Enschede 1996.
    Proceedings version: Springer-Verlag Lecture Notes in Computer Science 1335 (1997) 227-241.

  14. Treewidth and minimum fill-in on d-trapezoid graphs, joint work with Hans L. Bodlaender, Ton Kloks and Dieter Kratsch, Universiteit Utrecht Technical Report UU-CS-1995-34, Utrecht 1995.
    Journal version: Journal of Graph Algorithms and Applications 2 (1998) 1-23.

  15. Ranking of graphs joint work with Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch and Zsolt Tuza, Universiteit Utrecht technical report UU CS 1995 03, Utrecht 1995.
    Journal version: SIAM Journal on Discrete Mathematics 11 (1998) 168-181.

  16. Approximating the bandwidth for asteroidal triple-free graphs, joint work with Dieter Kratsch and Ton Kloks, Friedrich-Schiller-Universität Forschungsergebnisse Math/95/6, Jena 1995.
    Proceedings version: Springer-Verlag Lecture Notes in Computer Science 979 (1995) 434-447.

  17. Measuring the vulnerability for classes of intersection graphs, joint work with Dieter Kratsch and Ton Kloks, Friedrich-Schiller-Universität Forschungsergebnisse Math/94/7, Jena 1994.
    Journal version: Discrete Applied Mathematics 77 (1997) 259-270.

  18. Computing the toughness and the scattering number for interval and other graphs, joint work with Dieter Kratsch and Ton Kloks, INRIA rapport de recherche No. 2237, and IRISA publication interne No. 806, Rennes 1994.
    Journal version: Discrete Applied Mathematics 77 (1997) 259-270.

  19. Dominoes, joint work with Ton Kloks and Dieter Kratsch, Technische Universiteit Eindhoven Computing Science Note 94/12, Eindhoven 1994.
    Proceedings version: Springer-Verlag Lecture Notes in Computer Science 903 (1995) 106-120.

  20. Toughness, hamiltonicity and special classes of graphs, joint work with Dieter Kratsch and Jenö Lehel, Friedrich-Schiller-Universität Forschungsergebnisse Math/93/5, Jena 1993.
    Journal version: Discrete Mathematics 150 (1996) 231-245.

  21. On edge perfectness and classes of bipartite graphs, Rheinische Friedrich-Wilhelms-Universität Forschungsinstitut für Diskrete Mathematik Report 92746, Bonn 1992.
    Journal version: Discrete Mathematics 149 (1996) 159-187.

  22. HAMILTONIAN CIRCUIT in chordal bipartite graphs, Friedrich-Schiller-Universität Forschungsergebnisse Math/87/36, Jena 1987.
    Journal version: Discrete Mathematics 156 (1996) 291-298.

  23. The NP-completeness of STEINER TREE and DOMINATING SET for chordal bipartite graphs, joint work with Andreas Brandstädt, Friedrich-Schiller-Universität Forschungsergebnisse N/86/32, Jena 1986.
    Journal version: Theoretical Computer Science 53 (1987) 257-265.

Next: Accepted Up: Haiko Müller - list Previous: In Proceedings
Haiko Müller