| |
H. J. Broersma
List of publications from the DBLP Bibliography Server - FAQ
| 2009 | ||
|---|---|---|
| 89 | EE | Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma: Complexity of conditional colorability of graphs. Appl. Math. Lett. 22(3): 320-324 (2009) |
| 88 | EE | Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. 410(14): 1319-1327 (2009) |
| 2008 | ||
| 87 | Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers WG 2008 | |
| 86 | EE | Hajo Broersma, Daniël Paulusma: Computing Sharp 2-Factors in Claw-Free Graphs. MFCS 2008: 193-204 |
| 85 | EE | MingChu Li, Liming Xiong, H. J. Broersma: Connected even factors in claw-free graphs. Discrete Mathematics 308(11): 2282-2284 (2008) |
| 84 | EE | Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána: Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Discrete Mathematics 308(24): 6064-6077 (2008) |
| 83 | EE | Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still: Some families of integral graphs. Discrete Mathematics 308(24): 6383-6391 (2008) |
| 82 | EE | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Preface. J. Discrete Algorithms 6(4): 539 (2008) |
| 81 | EE | Hajo Broersma, Agostino Capponi, Daniël Paulusma: A New Algorithm for On-line Coloring Bipartite Graphs. SIAM J. Discrete Math. 22(1): 72-91 (2008) |
| 80 | EE | Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. 393(1-3): 182-195 (2008) |
| 2007 | ||
| 79 | EE | Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO 2007: 328-340 |
| 78 | EE | Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman: Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. SOFSEM (1) 2007: 188-199 |
| 77 | EE | Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still: Integral trees of diameter 6. Discrete Applied Mathematics 155(10): 1254-1266 (2007) |
| 76 | EE | Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec: Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discrete Applied Mathematics 155(10): 1336-1343 (2007) |
| 75 | EE | A. N. M. Salman, H. J. Broersma: Path-kipas Ramsey numbers. Discrete Applied Mathematics 155(14): 1878-1884 (2007) |
| 74 | EE | Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger: Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics 155(2): 92-102 (2007) |
| 73 | EE | Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto: Toughness and hamiltonicity in k-trees. Discrete Mathematics 307(7-8): 832-838 (2007) |
| 72 | EE | A. N. M. Salman, Hajo Broersma: On Ramsey numbers for paths versus wheels. Discrete Mathematics 307(7-8): 975-982 (2007) |
| 71 | EE | Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána: Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. Electronic Notes in Discrete Mathematics 28: 55-59 (2007) |
| 70 | EE | Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto: On components of 2-factors in claw-free graphs. Electronic Notes in Discrete Mathematics 29: 289-293 (2007) |
| 69 | EE | Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, J. van den Heuvel: A new upper bound on the cyclic chromatic number. Journal of Graph Theory 54(1): 58-72 (2007) |
| 68 | EE | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone colorings for graphs: Tree and path backbones. Journal of Graph Theory 55(2): 137-152 (2007) |
| 67 | EE | Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel: Tutte sets in graphs I: Maximal tutte sets and D-graphs. Journal of Graph Theory 55(4): 343-358 (2007) |
| 66 | EE | Hajo Broersma, Xueliang Li: On the complexity of dominating set problems related to the minimum all-ones problem. Theor. Comput. Sci. 385(1-3): 60-70 (2007) |
| 2006 | ||
| 65 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK King's College, London 2006 | |
| 64 | EE | Hajo Broersma, Agostino Capponi, Daniël Paulusma: On-Line Coloring of H-Free Bipartite Graphs. CIAC 2006: 284-295 |
| 63 | EE | Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261 |
| 62 | EE | Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger: Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica 44(4): 343-361 (2006) |
| 61 | EE | Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell: Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Combinatorica 26(1): 17-36 (2006) |
| 60 | EE | A. N. M. Salman, Hajo Broersma: Path-fan Ramsey numbers. Discrete Applied Mathematics 154(9): 1429-1436 (2006) |
| 59 | EE | Liming Xiong, Hajo Broersma: Subpancyclicity of line graphs and degree sums along paths. Discrete Applied Mathematics 154(9): 1453-1463 (2006) |
| 58 | EE | Douglas Bauer, Hajo Broersma, Edward F. Schmeichel: Toughness in Graphs - A Survey. Graphs and Combinatorics 22(1): 1-35 (2006) |
| 2005 | ||
| 57 | Hajo Broersma, Matthew Johnson, Stefan Szeider: Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK King's College, London 2005 | |
| 56 | EE | Liming Xiong, Zdenek Ryjácek, Hajo Broersma: On stability of the hamiltonian index under contractions and closures. Journal of Graph Theory 49(2): 104-115 (2005) |
| 2004 | ||
| 55 | EE | Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger: Parallel Knock-Out Schemes in Networks. MFCS 2004: 204-214 |
| 54 | EE | Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger: The Computational Complexity of the Minimum Weight Processor Assignment Problem. WG 2004: 189-200 |
| 53 | EE | Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann Hurink: Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Discrete Applied Mathematics 136(2-3): 159-160 (2004) |
| 52 | EE | Liming Xiong, Hajo Broersma, Xueliang Li, MingChu Li: The hamiltonian index of a graph and its branch-bonds. Discrete Mathematics 285(1-3): 279-288 (2004) |
| 51 | EE | A. N. M. Salman, H. J. Broersma: The Ramsey Numbers of Paths Versus Kipases. Electronic Notes in Discrete Mathematics 17: 251-255 (2004) |
| 2003 | ||
| 50 | EE | Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Michèl A. J. Rosien, Paul M. Heysters: Mapping Applications to a Coarse Grain Reconfigurable System. Asia-Pacific Computer Systems Architecture Conference 2003: 221-235 |
| 49 | EE | Surahmat, Edy Tri Baskoro, Saladin Uttunggadewa, Hajo Broersma: An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels. IJCCGGT 2003: 181-184 |
| 48 | EE | Hajo Broersma: A General Framework for Coloring Problems: Old Results, New Results, and Open Problems. IJCCGGT 2003: 65-79 |
| 47 | EE | Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters: Template Generation and Selection Algorithms. IWSOC 2003: 2-6 |
| 46 | EE | Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters: A graph covering algorithm for a coarse grain reconfigurable system. LCTES 2003: 199-208 |
| 45 | EE | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142 |
| 44 | EE | A. N. M. Salman, H. J. Broersma: The Ramsey Numbers of Paths Versus Fans. Electronic Notes in Discrete Mathematics 13: 103-107 (2003) |
| 43 | EE | Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl, Gerhard J. Woeginger: Preface: Volume 13. Electronic Notes in Discrete Mathematics 13: 128 (2003) |
| 42 | A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro: Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs. Journal of Automata, Languages and Combinatorics 8(4): 675-681 (2003) | |
| 2002 | ||
| 41 | EE | Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222 |
| 40 | EE | Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger: Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. SWAT 2002: 160-169 |
| 39 | EE | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More about Subcolorings. WG 2002: 68-79 |
| 38 | EE | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. Algorithmica 32(4): 594-610 (2002) |
| 37 | EE | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More About Subcolorings. Computing 69(3): 187-203 (2002) |
| 36 | Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel: Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discrete Applied Mathematics 120(1-3): 13-23 (2002) | |
| 35 | Hajo Broersma, Liming Xiong: A note on minimum degree conditions for supereulerian graphs. Discrete Applied Mathematics 120(1-3): 35-43 (2002) | |
| 34 | Hajo Broersma, Xueliang Li: Some approaches to a conjecture on short cycles in digraphs. Discrete Applied Mathematics 120(1-3): 45-53 (2002) | |
| 33 | EE | Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li: Degree sums and subpancyclicity in line graphs. Discrete Mathematics 242(1-3): 255-267 (2002) |
| 32 | EE | Hajo Broersma: On some intriguing problems in hamiltonian graph theory--a survey. Discrete Mathematics 251(1-3): 47-69 (2002) |
| 31 | EE | Douglas Bauer, Hajo Broersma, Edward F. Schmeichel: More Progress on Tough Graphs - The Y2K Report. Electronic Notes in Discrete Mathematics 11: 63-80 (2002) |
| 30 | EE | Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang: A Fan Type Condition For Heavy Cycles in Weighted Graphs. Graphs and Combinatorics 18(1): 193-200 (2002) |
| 2001 | ||
| 29 | EE | Hajo Broersma, Zdenek Ryjácek: Strengthening the closure concept in claw-free graphs. Discrete Mathematics 233(1-3): 55-63 (2001) |
| 28 | EE | Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl: Preface: Volume 8. Electronic Notes in Discrete Mathematics 8: 1 (2001) |
| 27 | EE | Xueliang Li, Shenggui Zhang, Hajo Broersma: Paths and Cycles in Colored Graphs. Electronic Notes in Discrete Mathematics 8: 128-132 (2001) |
| 2000 | ||
| 26 | EE | Douglas Bauer, Hajo Broersma, Henk Jan Veldman: Not Every 2-tough Graph Is Hamiltonian. Discrete Applied Mathematics 99(1-3): 317-321 (2000) |
| 25 | EE | Hajo Broersma, Elias Dahlhaus, Ton Kloks: A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. Discrete Applied Mathematics 99(1-3): 367-400 (2000) |
| 24 | EE | Shenggui Zhang, Xueliang Li, Hajo Broersma: Heavy paths and cycles in weighted graphs. Discrete Mathematics 223(1-3): 327-336 (2000) |
| 23 | EE | Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller: Degree-preserving trees. Networks 35(1): 26-39 (2000) |
| 1999 | ||
| 22 | Hajo Broersma, Cornelis Hoede: Another equivalent of the graceful tree conjecture. Ars Comb. 51: (1999) | |
| 21 | EE | Hajo Broersma, Erik Engbers, Huib Trommel: Various results on the toughness of graphs. Networks 33(3): 233-238 (1999) |
| 20 | EE | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. SIAM J. Discrete Math. 12(2): 276-287 (1999) |
| 1998 | ||
| 19 | EE | Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra: Degree-Preserving Forests. MFCS 1998: 713-721 |
| 18 | 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. WG 1998: 88-99 | |
| 17 | EE | Hajo Broersma, Huib Trommel: Closure concepts for claw-free graphs. Discrete Mathematics 185(1-3): 231-238 (1998) |
| 1997 | ||
| 16 | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. ICALP 1997: 760-770 | |
| 15 | Hajo Broersma, Elias Dahlhaus, Ton Kloks: Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. WG 1997: 109-117 | |
| 14 | EE | H. J. Broersma: A note on the minimum size of a vertex pancyclic graph. Discrete Mathematics 164(1-3): 29-32 (1997) |
| 13 | EE | H. J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer: Dirac's minimum degree condition restricted to claws. Discrete Mathematics 167-168: 155-166 (1997) |
| 12 | EE | Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz: Spanning trees with pairwise nonadjacent endvertices. Discrete Mathematics 170(1-3): 219-222 (1997) |
| 11 | EE | Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman: Cycles through subsets with large degree sums. Discrete Mathematics 171(1-3): 43-54 (1997) |
| 1996 | ||
| 10 | Hajo Broersma, Xueliang Li: The connectivity of the leaf-exchange spanning tree graph of a graph. Ars Comb. 43: (1996) | |
| 1995 | ||
| 9 | EE | Douglas Bauer, H. J. Broersma, J. van den Heuvel, Henk Jan Veldman: Long cycles in graphs with prescribed toughness and minimum degree. Discrete Mathematics 141(1-3): 1-10 (1995) |
| 1994 | ||
| 8 | EE | Hajo Broersma, Ingo Schiermeyer: Subgraphs, Closures and Hamiltonicity. Discrete Applied Mathematics 51(1-2): 39-46 (1994) |
| 7 | EE | H. J. Broersma, Ingo Schiermeyer: A closure concept based on neighborhood unions of independent triples. Discrete Mathematics 124(1-3): 37-47 (1994) |
| 1993 | ||
| 6 | EE | Hajo Broersma, Xueliang Li: On "The Matching Polynomial of a Polygraph". Discrete Applied Mathematics 46(1): 79-86 (1993) |
| 5 | EE | H. J. Broersma, F. Göbel: Coloring a graph optimally with two colors. Discrete Mathematics 118(1-3): 23-31 (1993) |
| 4 | EE | H. J. Broersma: A note on K4-closures in hamiltonian graph theory. Discrete Mathematics 121(1-3): 19-23 (1993) |
| 3 | EE | H. J. Broersma, J. van den Heuvel, Henk Jan Veldman: Long cycles, degree sums and neighborhood unions. Discrete Mathematics 121(1-3): 25-35 (1993) |
| 2 | EE | H. J. Broersma, J. van den Heuvel, Henk Jan Veldman: A generalization of Ore's Theorem involving neighborhood unions. Discrete Mathematics 122(1-3): 37-49 (1993) |
| 1989 | ||
| 1 | EE | Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao: A generalization of a result of Häggkvist and Nicoghossian. J. Comb. Theory, Ser. B 47(2): 237-243 (1989) |