Hajo Broersma

Best Publications

• Evolution of a designless nanoparticle network into reconfigurable Boolean logic

  S.K. Bose;C.P. Lawrence;Zhihua Liu;K.S. Makarenko

  184
  Citations

• Toughness in Graphs – A Survey

  Unknown

  131
  Citations

• Not every 2-tough graph is Hamiltonian

  Unknown

  122
  Citations

• Independent Sets in Asteroidal Triple-Free Graphs

  Hajo Broersma;Ton Kloks;Dieter Kratsch;Haiko Müller

  115
  Citations

• Paths and cycles in colored graphs

  Haitze J. Broersma;Xueliang Li;Gerhard Woeginger;Shenggui Zhang

  111
  Citations

• Classification with a disordered dopant-atom network in silicon

  Tao Chen;Jeroen van Gelder;Bram van de Ven;Sergey V. Amitonov

  98
  Citations

• A graph covering algorithm for a coarse grain reconfigurable system

  Yuanqing Guo;Gerard J.M. Smit;Hajo Broersma;Paul M. Heysters

  81
  Citations

• Stars and bunches in planar graphs. Part II: General planar graphs and colourings

  O.V. Borodin;H.J. Broersma;A. Glebov;J. van den Heuvel

  80
  Citations

• Three Complexity Results on Coloring Pk-Free Graphs

  Hajo Broersma;Fedor V. Fomin;Petr A. Golovach;Daniël Paulusma

  79
  Citations

• Updating the complexity status of coloring graphs without a fixed induced linear forest

  Hajo Broersma;Petr A. Golovach;Daniël Paulusma;Jian Song

  76
  Citations

• A deep-learning approach to realizing functionality in nanoelectronic devices

  Hans-Christian Ruiz Euler;Marcus Nicolaas Boon;Jochem. T. Wildeboer;Bram van de Ven

  72
  Citations

• Spanning trees with many or few colors in edge-colored graphs

  Unknown

  71
  Citations

• Independence trees and Hamilton cycles

  Hajo Broersma;Hilde Tuinstra

  69
  Citations

• Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture

  L.T. Smit;G.J.M. Smit;J.L. Hurink;H. Broersma

  59
  Citations

• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs

  H. J. Broersma;E. Dahlhaus;T. Kloks

  57
  Citations

• A graph covering algorithm for a coarse grain reconfigurable system

  Unknown

  56
  Citations

• Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of K1,3-free graphs

  Unknown

  50
  Citations

• Nascence project: nanoscale engineering for novel computation using evolution

  Haitze J. Broersma;Faustino Gomez;Julian Miller;Mike Petty

  46
  Citations

• Three complexity results on coloring Pk-free graphs

  Hajo Broersma;Fedor V. Fomin;Petr A. Golovach;DaniëL Paulusma

  40
  Citations

• Backbone colorings for graphs: Tree and path backbones

  Unknown

  38
  Citations