Hajo Broersma
Cited by
Cited by
Evolution of a designless nanoparticle network into reconfigurable Boolean logic
SK Bose, CP Lawrence, Z Liu, KS Makarenko, RMJ van Damme, ...
Nature nanotechnology 10 (12), 1048-1052, 2015
Toughness in graphs–a survey
D Bauer, H Broersma, E Schmeichel
Graphs and Combinatorics 22, 1-35, 2006
Not every 2-tough graph is hamiltonian
D Bauer, HJ Broersma, HJ Veldman
Discrete Applied Mathematics 99 (1-3), 317-321, 2000
Independent sets in asteroidal triple-free graphs
H Broersma, T Kloks, D Kratsch, H Müller
SIAM Journal on Discrete Mathematics 12 (2), 276-287, 1999
Paths and cycles in colored graphs
H Broersma, X Li, G Woeginger, S Zhang
Australasian journal of combinatorics 31 (1), 299-311, 2005
Stars and bunches in planar graphs (part Ⅱ): general planar graphs and colorings
OV Borodin, HJ Broersma, A Glebov, J Van Den Iteuvel
Diskret Anal Issled Oper Ser 1, 8, 2001
Classification with a disordered dopant-atom network in silicon
T Chen, J van Gelder, B van de Ven, SV Amitonov, B De Wilde, ...
Nature 577 (7790), 341-345, 2020
Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of K1, 3-free graphs
HJ Broersma, HJ Veldman
Contemporary methods in graph theory: In honour of Prof. Dr. Klaus Wagner …, 1990
Path graphs
HJ Broersma, C Hoede
Journal of graph theory 13 (4), 427-444, 1989
Run-time assignment of tasks to multiple heterogeneous processors
LT Smit, GJM Smit, JL Hurink, HJ Broersma, D Paulusma, PT Wolkotte
5th PROGRESS Symposium on Embedded Systems 2004, 185-192, 2004
Independence trees and Hamilton cycles
H Broersma, H Tuinstra
Journal of Graph Theory 29 (4), 227-237, 1998
Spanning trees with many or few colors in edge-colored graphs
H Broersma, X Li
Discussiones mathematicae. Graph theory 17 (2), 259-270, 1997
Updating the complexity status of coloring graphs without a fixed induced linear forest
H Broersma, PA Golovach, D Paulusma, J Song
Theoretical Computer Science 414 (1), 9-19, 2012
A graph covering algorithm for a coarse grain reconfigurable system
Y Guo, GJM Smit, H Broersma, PM Heysters
ACM SIGPLAN Notices 38 (7), 199-208, 2003
Three Complexity Results on Coloring P k -Free Graphs
H Broersma, FV Fomin, PA Golovach, D Paulusma
Combinatorial Algorithms: 20th International Workshop, IWOCA 2009, Hradec …, 2009
Backbone colorings for graphs: tree and path backbones
H Broersma, FV Fomin, PA Golovach, GJ Woeginger
Journal of Graph Theory 55 (2), 137-152, 2007
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
HJ Broersma, E Dahlhaus, T Kloks
Discrete Applied Mathematics 99 (1-3), 367-400, 2000
A deep-learning approach to realizing functionality in nanoelectronic devices
HC Ruiz Euler, MN Boon, JT Wildeboer, B van de Ven, T Chen, ...
Nature nanotechnology 15 (12), 992-998, 2020
Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture
LT Smit, GJM Smit, JL Hurink, H Broersma, D Paulusma, PT Wolkotte
Proceedings. 2004 IEEE International Conference on Field-Programmable …, 2004
On factors of 4‐connected claw‐free graphs
HJ Broersma, M Kriesell, Z Ryjácek
Journal of graph theory 37 (2), 125-136, 2001
The system can't perform the operation now. Try again later.
Articles 1–20