The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hajo Broersma: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Michèl A. J. Rosien, Paul M. Heysters
    Mapping Applications to a Coarse Grain Reconfigurable System. [Citation Graph (0, 0)][DBLP]
    Asia-Pacific Computer Systems Architecture Conference, 2003, pp:221-235 [Conf]
  2. Hajo Broersma, Agostino Capponi, Daniël Paulusma
    On-Line Coloring of H-Free Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:284-295 [Conf]
  3. Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
    Radio Labeling with Pre-assigned Frequencies. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:211-222 [Conf]
  4. 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]
  5. Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters
    Template Generation and Selection Algorithms. [Citation Graph (0, 0)][DBLP]
    IWSOC, 2003, pp:2-6 [Conf]
  6. Hajo Broersma
    A General Framework for Coloring Problems: Old Results, New Results, and Open Problems. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:65-79 [Conf]
  7. Surahmat, Edy Tri Baskoro, Saladin Uttunggadewa, Hajo Broersma
    An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:181-184 [Conf]
  8. Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart
    The Computational Complexity of the Parallel Knock-Out Problem. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:250-261 [Conf]
  9. Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters
    A graph covering algorithm for a coarse grain reconfigurable system. [Citation Graph (0, 0)][DBLP]
    LCTES, 2003, pp:199-208 [Conf]
  10. Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger
    Parallel Knock-Out Schemes in Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:204-214 [Conf]
  11. 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]
  12. Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
    Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:160-169 [Conf]
  13. Hajo Broersma, Elias Dahlhaus, Ton Kloks
    Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:109-117 [Conf]
  14. Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
    Backbone Colorings for Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:131-142 [Conf]
  15. Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
    More about Subcolorings. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:68-79 [Conf]
  16. 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]
  17. Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger
    The Computational Complexity of the Minimum Weight Processor Assignment Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:189-200 [Conf]
  18. Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
    Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:4, pp:343-361 [Journal]
  19. 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]
  20. Hajo Broersma, Cornelis Hoede
    Another equivalent of the graceful tree conjecture. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:51, n:, pp:- [Journal]
  21. Hajo Broersma, Xueliang Li
    The connectivity of the leaf-exchange spanning tree graph of a graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:43, n:, pp:- [Journal]
  22. Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell
    Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:1, pp:17-36 [Journal]
  23. Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
    More About Subcolorings. [Citation Graph (0, 0)][DBLP]
    Computing, 2002, v:69, n:3, pp:187-203 [Journal]
  24. Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
    Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:13-23 [Journal]
  25. Douglas Bauer, Hajo Broersma, Henk Jan Veldman
    Not Every 2-tough Graph Is Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:317-321 [Journal]
  26. Hajo Broersma, Elias Dahlhaus, Ton Kloks
    A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:367-400 [Journal]
  27. Hajo Broersma, Xueliang Li
    Some approaches to a conjecture on short cycles in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:45-53 [Journal]
  28. Hajo Broersma, Ingo Schiermeyer
    Subgraphs, Closures and Hamiltonicity. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:39-46 [Journal]
  29. Hajo Broersma, Liming Xiong
    A note on minimum degree conditions for supereulerian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:35-43 [Journal]
  30. Hajo Broersma, Xueliang Li
    On "The Matching Polynomial of a Polygraph". [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:46, n:1, pp:79-86 [Journal]
  31. Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann Hurink
    Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:159-160 [Journal]
  32. A. N. M. Salman, Hajo Broersma
    Path-fan Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:9, pp:1429-1436 [Journal]
  33. Liming Xiong, Hajo Broersma
    Subpancyclicity of line graphs and degree sums along paths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:9, pp:1453-1463 [Journal]
  34. Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger
    Eliminating graphs by means of parallel knock-out schemes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:92-102 [Journal]
  35. Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still
    Integral trees of diameter 6. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1254-1266 [Journal]
  36. Douglas Bauer, Hajo Broersma, N. Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec
    Tutte sets in graphs II: The complexity of finding maximum Tutte sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1336-1343 [Journal]
  37. Hajo Broersma
    On some intriguing problems in hamiltonian graph theory--a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:47-69 [Journal]
  38. Hajo Broersma, Zdenek Ryjácek
    Strengthening the closure concept in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:55-63 [Journal]
  39. Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li
    Degree sums and subpancyclicity in line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:255-267 [Journal]
  40. Liming Xiong, Hajo Broersma, Xueliang Li, MingChu Li
    The hamiltonian index of a graph and its branch-bonds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:279-288 [Journal]
  41. Shenggui Zhang, Xueliang Li, Hajo Broersma
    Heavy paths and cycles in weighted graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:223, n:1-3, pp:327-336 [Journal]
  42. Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto
    Toughness and hamiltonicity in k-trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:832-838 [Journal]
  43. A. N. M. Salman, Hajo Broersma
    On Ramsey numbers for paths versus wheels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:975-982 [Journal]
  44. Douglas Bauer, Hajo Broersma, Edward F. Schmeichel
    Toughness in Graphs - A Survey. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:1, pp:1-35 [Journal]
  45. Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang
    A Fan Type Condition For Heavy Cycles in Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:1, pp:193-200 [Journal]
  46. A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro
    Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:4, pp:675-681 [Journal]
  47. Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao
    A generalization of a result of Häggkvist and Nicoghossian. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:2, pp:237-243 [Journal]
  48. Hajo Broersma, Erik Engbers, Huib Trommel
    Various results on the toughness of graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:3, pp:233-238 [Journal]
  49. 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]
  50. 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]
  51. Liming Xiong, Zdenek Ryjácek, Hajo Broersma
    On stability of the hamiltonian index under contractions and closures. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:2, pp:104-115 [Journal]
  52. Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, J. van den Heuvel
    A new upper bound on the cyclic chromatic number. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:1, pp:58-72 [Journal]
  53. Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma
    Upper Bounds and Algorithms for Parallel Knock-Out Numbers. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:328-340 [Conf]
  54. Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman
    Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:188-199 [Conf]
  55. Hajo Broersma, Huib Trommel
    Closure concepts for claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:185, n:1-3, pp:231-238 [Journal]
  56. Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman
    Cycles through subsets with large degree sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:43-54 [Journal]
  57. Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
    Spanning trees with pairwise nonadjacent endvertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:219-222 [Journal]
  58. Hajo Broersma, Xueliang Li
    On the complexity of dominating set problems related to the minimum all-ones problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:60-70 [Journal]

  59. Computing Sharp 2-Factors in Claw-Free Graphs. [Citation Graph (, )][DBLP]


  60. Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. [Citation Graph (, )][DBLP]


  61. Fully Decomposable Split Graphs. [Citation Graph (, )][DBLP]


  62. Three Complexity Results on Coloring Pk-Free Graphs. [Citation Graph (, )][DBLP]


  63. Complexity of conditional colorability of graphs. [Citation Graph (, )][DBLP]


  64. Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. [Citation Graph (, )][DBLP]


  65. Some families of integral graphs. [Citation Graph (, )][DBLP]


Search in 1.141secs, Finished in 1.144secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002