Hajo Broersma
Papers
1
Total Citations
7
H-Index
1
About
Hajo Broersma is a distinguished computer scientist whose research bridges graph theory, combinatorial optimization, and real-time systems. His work is characterized by a deep theoretical rigor applied to practical computing challenges, particularly in scheduling and resource allocation. A standout contribution is his 2013 paper, "Improving the performance of periodic real-time processes: a graph theoretical approach," which has garnered 7 citations. In this work, Broersma elegantly demonstrates how graph-theoretic models can optimize the performance of single-core embedded systems—such as those in robotics—by reducing costly context switches among numerous short processes. This approach not only enhances computational efficiency but also provides a foundational framework for analyzing complex scheduling problems. Beyond this, Broersma has made seminal contributions to Hamiltonian graph theory and the study of cycles and paths in graphs, influencing both theoretical computer science and operations research. His ability to translate abstract combinatorial structures into tangible solutions for real-time and embedded systems underscores his impact, making his research essential reading for students and engineers tackling performance-critical applications.
Research Focus
Key Achievements
Top Papers
- 1