| 2007 |
|---|
| 60 | EE | Hajo Broersma,
Matthew Johnson,
Daniël Paulusma:
Upper Bounds and Algorithms for Parallel Knock-Out Numbers.
SIROCCO 2007: 328-340 |
| 59 | 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 |
| 58 | EE | Ligong Wang,
Hajo Broersma,
Cornelis Hoede,
Xueliang Li,
Georg Still:
Integral trees of diameter 6.
Discrete Applied Mathematics 155(10): 1254-1266 (2007) |
| 57 | EE | 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.
Discrete Applied Mathematics 155(10): 1336-1343 (2007) |
| 56 | 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) |
| 55 | EE | Hajo Broersma,
Liming Xiong,
Kiyoshi Yoshimoto:
Toughness and hamiltonicity in k-trees.
Discrete Mathematics 307(7-8): 832-838 (2007) |
| 54 | EE | A. N. M. Salman,
Hajo Broersma:
On Ramsey numbers for paths versus wheels.
Discrete Mathematics 307(7-8): 975-982 (2007) |
| 53 | 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) |
| 52 | 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 |
|---|
| 51 | | 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 |
| 50 | EE | Hajo Broersma,
Agostino Capponi,
Daniël Paulusma:
On-Line Coloring of H-Free Bipartite Graphs.
CIAC 2006: 284-295 |
| 49 | EE | Hajo Broersma,
Matthew Johnson,
Daniël Paulusma,
Iain A. Stewart:
The Computational Complexity of the Parallel Knock-Out Problem.
LATIN 2006: 250-261 |
| 48 | 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) |
| 47 | 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) |
| 46 | EE | A. N. M. Salman,
Hajo Broersma:
Path-fan Ramsey numbers.
Discrete Applied Mathematics 154(9): 1429-1436 (2006) |
| 45 | EE | Liming Xiong,
Hajo Broersma:
Subpancyclicity of line graphs and degree sums along paths.
Discrete Applied Mathematics 154(9): 1453-1463 (2006) |
| 44 | EE | Douglas Bauer,
Hajo Broersma,
Edward F. Schmeichel:
Toughness in Graphs - A Survey.
Graphs and Combinatorics 22(1): 1-35 (2006) |
| 2005 |
|---|
| 43 | | 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 |
| 42 | 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 |
|---|
| 41 | EE | Hajo Broersma,
Fedor V. Fomin,
Gerhard J. Woeginger:
Parallel Knock-Out Schemes in Networks.
MFCS 2004: 204-214 |
| 40 | 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 |
| 39 | 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) |
| 38 | 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) |
| 2003 |
|---|
| 37 | 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 |
| 36 | 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 |
| 35 | EE | Hajo Broersma:
A General Framework for Coloring Problems: Old Results, New Results, and Open Problems.
IJCCGGT 2003: 65-79 |
| 34 | EE | Yuanqing Guo,
Gerard J. M. Smit,
Hajo Broersma,
Paul M. Heysters:
Template Generation and Selection Algorithms.
IWSOC 2003: 2-6 |
| 33 | 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 |
| 32 | EE | Hajo Broersma,
Fedor V. Fomin,
Petr A. Golovach,
Gerhard J. Woeginger:
Backbone Colorings for Networks.
WG 2003: 131-142 |
| 31 | | 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 |
|---|
| 30 | 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 |
| 29 | 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 |
| 28 | EE | Hajo Broersma,
Fedor V. Fomin,
Jaroslav Nesetril,
Gerhard J. Woeginger:
More about Subcolorings.
WG 2002: 68-79 |
| 27 | 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) |
| 26 | EE | Hajo Broersma,
Fedor V. Fomin,
Jaroslav Nesetril,
Gerhard J. Woeginger:
More About Subcolorings.
Computing 69(3): 187-203 (2002) |
| 25 | | 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) |
| 24 | | Hajo Broersma,
Liming Xiong:
A note on minimum degree conditions for supereulerian graphs.
Discrete Applied Mathematics 120(1-3): 35-43 (2002) |
| 23 | | Hajo Broersma,
Xueliang Li:
Some approaches to a conjecture on short cycles in digraphs.
Discrete Applied Mathematics 120(1-3): 45-53 (2002) |
| 22 | EE | Liming Xiong,
Hajo Broersma,
Cornelis Hoede,
Xueliang Li:
Degree sums and subpancyclicity in line graphs.
Discrete Mathematics 242(1-3): 255-267 (2002) |
| 21 | EE | Hajo Broersma:
On some intriguing problems in hamiltonian graph theory--a survey.
Discrete Mathematics 251(1-3): 47-69 (2002) |
| 20 | 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 |
|---|
| 19 | EE | Hajo Broersma,
Zdenek Ryjácek:
Strengthening the closure concept in claw-free graphs.
Discrete Mathematics 233(1-3): 55-63 (2001) |
| 2000 |
|---|
| 18 | EE | Douglas Bauer,
Hajo Broersma,
Henk Jan Veldman:
Not Every 2-tough Graph Is Hamiltonian.
Discrete Applied Mathematics 99(1-3): 317-321 (2000) |
| 17 | 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) |
| 16 | EE | Shenggui Zhang,
Xueliang Li,
Hajo Broersma:
Heavy paths and cycles in weighted graphs.
Discrete Mathematics 223(1-3): 327-336 (2000) |
| 15 | 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 |
|---|
| 14 | | Hajo Broersma,
Cornelis Hoede:
Another equivalent of the graceful tree conjecture.
Ars Comb. 51: (1999) |
| 13 | EE | Hajo Broersma,
Erik Engbers,
Huib Trommel:
Various results on the toughness of graphs.
Networks 33(3): 233-238 (1999) |
| 12 | 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 |
|---|
| 11 | EE | Hajo Broersma,
Andreas Huck,
Ton Kloks,
Otto R. Koppius,
Dieter Kratsch,
Haiko Müller,
Hilde Tuinstra:
Degree-Preserving Forests.
MFCS 1998: 713-721 |
| 10 | | 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 |
| 9 | EE | Hajo Broersma,
Huib Trommel:
Closure concepts for claw-free graphs.
Discrete Mathematics 185(1-3): 231-238 (1998) |
| 1997 |
|---|
| 8 | | Hajo Broersma,
Ton Kloks,
Dieter Kratsch,
Haiko Müller:
Independent Sets in Asteroidal Triple-Free Graphs.
ICALP 1997: 760-770 |
| 7 | | Hajo Broersma,
Elias Dahlhaus,
Ton Kloks:
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.
WG 1997: 109-117 |
| 6 | 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) |
| 5 | 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 |
|---|
| 4 | | Hajo Broersma,
Xueliang Li:
The connectivity of the leaf-exchange spanning tree graph of a graph.
Ars Comb. 43: (1996) |
| 1994 |
|---|
| 3 | EE | Hajo Broersma,
Ingo Schiermeyer:
Subgraphs, Closures and Hamiltonicity.
Discrete Applied Mathematics 51(1-2): 39-46 (1994) |
| 1993 |
|---|
| 2 | EE | Hajo Broersma,
Xueliang Li:
On "The Matching Polynomial of a Polygraph".
Discrete Applied Mathematics 46(1): 79-86 (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) |
