Hajo Broersma
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
25
Venues
14
Active years
1997–2020
Best venue rank
A*
Where they publish
Papers
25 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2020 | PDCAT | Optimal Algorithm of Isolated Toughness for Interval Graphs. | Fengwei Li, Qingfang Ye, Hajo Broersma, Xiaoyan Zhang |
| 2016 | CEC | A simulation tool for evolving functionalities in disordered nanoparticle networks. | Ruud van Damme, Hajo Broersma, Julia Mikhal, Celestine Lawrence, Wilfred G. van der Wiel |
| 2015 | GECCO | Computational Matter: Evolving Computational Solutions in Materials. | Julian Francis Miller, Hajo Broersma |
| 2013 | MEMOCODE | Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs. | Robert de Groote, Philip K. F. Hlzenspies, Jan Kuper, Hajo Broersma |
| 2013 | WG | Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. | Hajo Broersma, Jir Fiala, Petr A. Golovach, Toms Kaiser, Danil Paulusma, Andrzej Proskurowski |
| 2010 | ISAAC | On Coloring Graphs without Induced Forests. | Hajo Broersma, Petr A. Golovach, Danil Paulusma, Jian Song |
| 2010 | IWOCA | The Complexity Status of Problems Related to Sparsest Cuts. | Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin |
| 2010 | WG | Narrowing Down the Gap on the Complexity of Coloring | Hajo Broersma, Petr A. Golovach, Danil Paulusma, Jian Song |
| 2009 | IWOCA | Three Complexity Results on Coloring | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Danil Paulusma |
| 2009 | IWOCA | Fully Decomposable Split Graphs. | Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger |
| 2009 | WG | Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. | Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Danil Paulusma |
| 2008 | MFCS | Computing Sharp 2-Factors in Claw-Free Graphs. | Hajo Broersma, Danil Paulusma |
| 2007 | SIROCCO | Upper Bounds and Algorithms for Parallel Knock-Out Numbers. | Hajo Broersma, Matthew Johnson, Danil Paulusma |
| 2007 | SOFSEM | Improved Upper Bounds for | Hajo Broersma, Bert Marchal, Danil Paulusma, A. N. M. Salman |
| 2006 | CIAC | On-Line Coloring of H-Free Bipartite Graphs. | Hajo Broersma, Agostino Capponi, Danil Paulusma |
| 2006 | LATIN | The Computational Complexity of the Parallel Knock-Out Problem. | Hajo Broersma, Matthew Johnson, Danil Paulusma, Iain A. Stewart |
| 2004 | MFCS | Parallel Knock-Out Schemes in Networks. | Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger |
| 2004 | WG | The Computational Complexity of the Minimum Weight Processor Assignment Problem. | Hajo Broersma, Danil Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger |
| 2003 | WG | Backbone Colorings for Networks. | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
| 2002 | ESA | Radio Labeling with Pre-assigned Frequencies. | Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger |
| 2002 | WG | More about Subcolorings. | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
| 1998 | MFCS | Degree-Preserving Forests. | Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Mller, Hilde Tuinstra |
| 1998 | WG | A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1997 | ICALP | Independent Sets in Asteroidal Triple-Free Graphs. | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1997 | WG | Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. | Hajo Broersma, Elias Dahlhaus, Ton Kloks |