Welcome...

prof.dr.ir. H.J. Broersma (Hajo)

Full Professor

About Me

I got a PhD at the UT back in 1988 in Graph Theory, a subarea of Discrete Mathematics. After that, I stayed at the UT as a lecturer, senior lecturer and professor in Discrete Mathematics until 2004. That year I moved to Durham University in the Northeast of England to take up a position as a Chair (full professor) in Theoretical Computer Science. There I have helped to build up the strong ACiD group in Algorithms and Complexity. In 2011, I returned to the UT as a professor in Programmable Nanosystems. My current research is a mixture of Structural Graph Theory, Algorithmic Graph Theory, Applications of Graph Theory, Computational Complexity, and Unconventional Computing, in particular Neuromorphic Computing and Brain Inspired Computing. 

Expertise

Graph In Graph Theory
Cycle
Path
Subgraph
Hamiltonians
Ramsey Number
Polynomials
Claw-Free Graphs

Research

My current research is a mixture of Structural Graph Theory, Algorithmic Graph Theory, Applications of Graph Theory, Computational Complexity, and Unconventional Computing, in particular Neuromorphic Computing and Brain Inspired Computing. 

Publications

Recent
Li, B., Broersma, H., & Zhang, S. (2018). Conditions for graphs to be path partition optimal. Discrete mathematics, 341(5), 1350-1358. DOI: 10.1016/j.disc.2018.02.011
Broersma, H. (2018). Evolution in Nanomaterio: The NASCENCE Project. In S. Stepney, & A. Adamatzky (Eds.), Inspired by Nature: Essays Presented to Julian F. Miller on the Occasion of his 60th Birthday (pp. 87-111). (Emergence, Complexity and Computation; Vol. 28). Cham: Springer International Publishing Switzerland. DOI: 10.1007/978-3-319-67997-6_4
Zhang, Z-B., Zhang, X., Broersma, H., & Lou, D. (2017). Extremal and Degree Conditions for Path Extendability in Digraphs. SIAM J. Discrete Math., 31(3), 1990-2014. DOI: 10.1137/16M1077453
Li, R., Broersma, H. J., Xu, C., & Zhang, S. (2017). Cycle extension in edge-colored complete graphs. Discrete mathematics, 340(6), 1235-1241. DOI: 10.1016/j.disc.2017.01.023
Li, B., Zhang, Y., & Broersma, H. (2017). An exact formula for all star-kipas Ramsey numbers. Graphs and combinatorics, 33(1), 141-148. DOI: 10.1007/s00373-016-1746-3
Greff, K., van Damme, R. M. J., Koutnik, J., Broersma, H. J., Mikhal, J. O., Lawrence, C. P., ... Schmidhuber, J. (2017). Using neural networks to predict the functionality of reconfigurable nano-material networks. International journal on advances in intelligent systems, 9(3&4), 339-351.
Zhang, Y., Broersma, H. J., & Chen, Y. (2016). Narrowing down the gap on cycle-star Ramsey numbers. Journal of combinatorics (Somerville), 7(2-3), 481-493. DOI: 10.4310/JOC.2016.v7.n2.a13
Zhang, X., Zhang, Z., Broersma, H. J., & Wen, X. (2016). On the complexity of edge-colored subgraph partitioning problems in network optimization. Discrete mathematics and theoretical computer science, 17(3), 227-244.
Chen, X., Li, M., Liao, W., & Broersma, H. J. (2016). Hamiltonian properties of almost locally connected claw-free graphs. Ars combinatoria, 124, 95-109.
Zhang, Y., Zhang, Y., Broersma, H. J., & Chen, Y. (2016). On fan-wheel and tree-wheel Ramsey numbers. Discrete mathematics, 339(9), 2284-2287. DOI: 10.1016/j.disc.2016.03.013

UT Research Information System

Google Scholar Link

Contact Details

Visiting Address

University of Twente
Faculty of Electrical Engineering, Mathematics & Computer Science
Zilverling (building no. 11), room 3067
Hallenweg 19
7522NH  Enschede
The Netherlands

Navigate to location

Mailing Address

University of Twente
Faculty of Electrical Engineering, Mathematics & Computer Science
Zilverling  3067
P.O. Box 217
7500 AE Enschede
The Netherlands