The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Haiko Müller: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Klaus Jansen, Haiko Müller
    The Minimum Broadcast Time Problem. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:219-234 [Conf]
  2. Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
    Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:260-271 [Conf]
  3. Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
    Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:508- [Conf]
  4. Ton Kloks, Dieter Kratsch, Haiko Müller
    Approximating the Bandwidth for Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:434-447 [Conf]
  5. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    Independent Sets in Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:760-770 [Conf]
  6. Ton Kloks, Haiko Müller, C. K. Wong
    Vertex Ranking of Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:174-182 [Conf]
  7. Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra
    Degree-Preserving Forests. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:713-721 [Conf]
  8. Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie
    Random walks on the vertices of transportation polytopes with constant number of sources. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:330-339 [Conf]
  9. Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
    On Vertex Ranking for Permutations and Other Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:747-758 [Conf]
  10. Ton Kloks, Jan Kratochvíl, Haiko Müller
    New Branchwidth Territories. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:173-183 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:88-99 [Conf]
  12. Maw-Shang Chang, Haiko Müller
    On the Tree-Degree of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:44-54 [Conf]
  13. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
    Ranking of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:292-304 [Conf]
  14. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
    On the Domination Search Number. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:161-171 [Conf]
  15. Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller
    Bandwidth of Split and Circular Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:243-254 [Conf]
  16. Ton Kloks, Dieter Kratsch, Haiko Müller
    Dominoes. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:106-120 [Conf]
  17. Ton Kloks, Dieter Kratsch, Haiko Müller
    Finding and Counting Small Induced Subgraphs Efficiently. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:14-23 [Conf]
  18. Ton Kloks, Dieter Kratsch, Haiko Müller
    Asteroidal Sets in Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:229-241 [Conf]
  19. Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller
    On the Recognition of General Partition Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:273-283 [Conf]
  20. Dieter Kratsch, Haiko Müller, Ioan Todinca
    Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:309-321 [Conf]
  21. Van Bang Le, Raffaele Mosca, Haiko Müller
    On Stable Cutsets in Claw-Free Graphs and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:163-174 [Conf]
  22. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:4, pp:594-610 [Journal]
  23. Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
    On treewidth approximations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:183-196 [Journal]
  24. Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
    On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:39-63 [Journal]
  25. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
    On the Domination Search Number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:3, pp:565-580 [Journal]
  26. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
    Algorithms for graphs with small octopus. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:105-128 [Journal]
  27. Ton Kloks, Jan Kratochvíl, Haiko Müller
    Computing the branchwidth of interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:266-275 [Journal]
  28. Dieter Kratsch, Ton Kloks, Haiko Müller
    Measuring the Vulnerability for Classes of Intersection Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:77, n:3, pp:259-270 [Journal]
  29. Hoàng-Oanh Le, Van Bang Le, Haiko Müller
    Splitting a graph into disjoint induced paths or cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:199-212 [Journal]
  30. Haiko Müller
    Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:189-205 [Journal]
  31. Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
    Efficient algorithms for graphs with few P4's. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:29-51 [Journal]
  32. Ton Kloks, Dieter Kratsch, Haiko Müller
    On the Structure of Graphs with Bounded Asteroidal Number. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:2, pp:295-306 [Journal]
  33. Peter Damaschke, Haiko Müller, Dieter Kratsch
    Domination in Convex and Chordal Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:5, pp:231-236 [Journal]
  34. Ton Kloks, Dieter Kratsch, Haiko Müller
    Finding and counting small induced subgraphs efficiently. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:3-4, pp:115-121 [Journal]
  35. Ton Kloks, Dieter Kratsch, Haiko Müller
    Bandwidth of Chain Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:6, pp:313-315 [Journal]
  36. Ton Kloks, Haiko Müller, C. K. Wong
    Vertex Ranking of Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:4, pp:201-206 [Journal]
  37. Haiko Müller, Falk Nicolai
    Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:5, pp:225-230 [Journal]
  38. Ton Kloks, Dieter Kratsch, Haiko Müller
    Approximating the Bandwidth for Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:32, n:1, pp:41-57 [Journal]
  39. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller
    Treewidth and Minimum Fill-in on d-Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  40. Haiko Müller
    A Note on Balanced Immunity. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1993, v:26, n:2, pp:157-167 [Journal]
  41. Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller
    Degree-preserving trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:1, pp:26-39 [Journal]
  42. Haiko Müller, Jean-Xavier Rampon
    Partial Orders on Weak Orders Convex Subsets. [Citation Graph (0, 0)][DBLP]
    Order, 2000, v:17, n:2, pp:103-123 [Journal]
  43. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
    Rankings of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:1, pp:168-181 [Journal]
  44. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    Independent Sets in Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:2, pp:276-287 [Journal]
  45. Klaus Jansen, Haiko Müller
    The Minimum Broadcast Time Problem for Several Processor Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:69-85 [Journal]
  46. Haiko Müller, Andreas Brandstädt
    The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:257-265 [Journal]
  47. Haiko Müller, Jean-Xavier Rampon
    Partial orders and their convex subsets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:507-517 [Journal]
  48. Haiko Müller
    On edge perfectness and classes of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:159-187 [Journal]
  49. Dieter Kratsch, Jenö Lehel, Haiko Müller
    Toughness, hamiltonicity and split graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:231-245 [Journal]
  50. Haiko Müller
    Hamiltonian circuits in chordal bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:291-298 [Journal]

  51. Feedback vertex set on AT-free graphs. [Citation Graph (, )][DBLP]


  52. On a disparity between relative cliquewidth and relative NLC-width. [Citation Graph (, )][DBLP]


  53. On a property of minimal triangulations. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002