No photo of Hajo Broersma

Hajo Broersma

prof.dr.ir.

1987 …2019
If you made any changes in Pure these will be visible here soon.

Research Output 1987 2019

Filter
Chapter
2018

Computability and Complexity of Unconventional Computing Devices

Broersma, H., Stepney, S. & Wendin, G., 20 Jul 2018, Computational Matter. p. 185-229 (Computational Matter).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Computability
Turing
Computing
Polynomial time
NP-complete problem

Evolution in Nanomaterio: The NASCENCE Project

Broersma, H., 2018, Inspired by Nature: Essays Presented to Julian F. Miller on the Occasion of his 60th Birthday. Stepney, S. & Adamatzky, A. (eds.). Cham: Springer, p. 87-111 25 p. (Emergence, Complexity and Computation; vol. 28).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

File
dials
readers
nanotechnology
carbon nanotubes
nanoparticles

Philosophy of Computation

Konkoli, Z., Stepney, S., Broersma, H., Dini, P., Nehaniv, C. L. & Nichele, S., 20 Jul 2018, Computational Matter. Springer, p. 153-184 (Computational Matter).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

information processing
machinery
rock
trend
2016

Computational matter: evolving computational functions in nanoscale materials

Broersma, H. J., Miller, J. F. & Nichele, S., 2016, Advances in Unconventional Computing, Volume 2: Prototypes, Models and Algorithms. Adamatzky, A. (ed.). London: Springer, p. 397-428 32 p. (Emergence, Complexity and Computation; vol. 23, no. 23).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

2005
3 Citations

Mapping applications to a coarse grain reconfigurable system

Guo, Y., Smit, G. J. M., Broersma, H. J., Rosien, M. A. J., Heysters, P. M. & Krol, T., Jul 2005, New Algorithms, Architectures and Applications for Reconfigurable Computing. Lysaght, P. & Rosenstiel, W. (eds.). Dordrecht: Kluwer Academic Publishers, p. 93-104 12 p.

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

File
1998
9 Citations

A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking

Broersma, H. J., Kloks, T., Kloks, A. J. J., Kratsch, D. & Müller, H., 1998, Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG’98, Smolenice Castle, Slovak Republic, June 18-20, 1998. Berlin: Springer, p. 88-99 12 p. (Lecture notes in computer science; vol. 1517, no. 1517).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

Degree-preserving forests

Broersma, H. J., Huck, A., Kloks, A. J. J., Kloks, T., Koppius, O., Kratsch, D., Müller, H. & Tuinstra, H., 1998, Mathematical Foundations of Computer Science : 23rd International Symposium, MFCS '98. Berlin: Springer, p. 713-721 10 p. (Lecture Notes in Computer Science; vol. 1450, no. 1450).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

1990

Around three lemmas in hamiltonian graph theory

Bauer, D., Broersma, H. J. & Veldman, H. J., 1990, Topics in Combinatorics and Graph Theory.. Heidelberg: R. Bodendiek and R. Henn, p. 101-110 10 p.

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

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

Broersma, H. J. & Veldman, H. J., 1990, Festschrift in honour of Klaus Wagner. p. -

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic