Hajo Broersma
Orcid: 0000-0002-4678-3210Affiliations:
- University of Twente, Department of Applied Mathematics, Enschede, The Netherlands
- Durham University, Department of Computer Science, UK
According to our database1,
Hajo Broersma
authored at least 202 papers
between 1987 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on dur.ac.uk
On csauthors.net:
Bibliography
2025
2024
J. Graph Theory, January, 2024
Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number.
Discret. Math., January, 2024
Discuss. Math. Graph Theory, 2024
Discuss. Math. Graph Theory, 2024
Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number.
Discret. Appl. Math., 2024
Discret. Appl. Math., 2024
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024
2023
Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs.
Discret. Appl. Math., 2023
Polynomial algorithms for computing the isolated toughness of interval and split graphs.
Concurr. Comput. Pract. Exp., 2023
Appl. Math. Comput., 2023
2022
Discuss. Math. Graph Theory, 2022
On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees.
Discret. Math., 2022
Discret. Math., 2022
Electron. J. Comb., 2022
2021
Dopant network processing units: towards efficient neural network emulators with high-capacity nanoelectronic nodes.
Neuromorph. Comput. Eng., 2021
Edge-colored complete graphs without properly colored even cycles: A full characterization.
J. Graph Theory, 2021
Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs.
Graphs Comb., 2021
Electron. J. Graph Theory Appl., 2021
Discuss. Math. Graph Theory, 2021
Discret. Math., 2021
Discret. Appl. Math., 2021
Appl. Math. Comput., 2021
2020
J. Graph Theory, 2020
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs.
J. Comb. Optim., 2020
Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs.
Discret. Math., 2020
Discret. Math., 2020
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020
2019
Graphs Comb., 2019
Discret. Appl. Math., 2019
2018
Proceedings of the Computational Matter, 2018
Appl. Math. Comput., 2018
2017
SIAM J. Discret. Math., 2017
2016
On the complexity of edge-colored subgraph partitioning problems in network optimization.
Discret. Math. Theor. Comput. Sci., 2016
Discuss. Math. Graph Theory, 2016
Hamiltonian properties of almost locally connected claw-free graphs.
Ars Comb., 2016
Proceedings of the IEEE Congress on Evolutionary Computation, 2016
2015
Theor. Comput. Sci., 2015
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.
J. Graph Theory, 2015
Electron. J. Graph Theory Appl., 2015
Proceedings of the Genetic and Evolutionary Computation Conference, 2015
2014
J. Graph Theory, 2014
Graphs Comb., 2014
Electron. J. Graph Theory Appl., 2014
Discuss. Math. Graph Theory, 2014
2013
Theor. Comput. Sci., 2013
Electron. J. Graph Theory Appl., 2013
Improving the Performance of Periodic Real-time Processes: a Graph Theoretical Approach.
Proceedings of the 35th Communicating Process Architectures, 2013
Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs.
Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2013
2012
Determining the chromatic number of triangle-free 2P<sub>3</sub>-free graphs in polynomial time.
Theor. Comput. Sci., 2012
Updating the complexity status of coloring graphs without a fixed induced linear forest.
Theor. Comput. Sci., 2012
J. Discrete Algorithms, 2012
Int. J. Unconv. Comput., 2012
Discret. Math., 2012
Proceedings of the 38th Euromicro Conference on Software Engineering and Advanced Applications, 2012
2011
J. Graph Theory, 2011
2010
Narrowing Down the Gap on the Complexity of Coloring <i>P</i><sub><i>k</i></sub>-Free Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
2009
Theor. Comput. Sci., 2009
Math. Methods Oper. Res., 2009
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs.
Graphs Comb., 2009
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number.
Discuss. Math. Graph Theory, 2009
Discret. Math., 2009
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009
2008
Theor. Comput. Sci., 2008
2007
On the complexity of dominating set problems related to the minimum all-ones problem.
Theor. Comput. Sci., 2007
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks.
Electron. Notes Discret. Math., 2007
Discret. Appl. Math., 2007
Discret. Appl. Math., 2007
Improved Upper Bounds for <i>lambda</i> -Backbone Colorings Along Matchings and Stars.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007
2006
Discret. Appl. Math., 2006
Global Connectivity And Expansion: Long Cycles and Factors In <i>f</i>-Connected Graphs.
Comb., 2006
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult.
Algorithmica, 2006
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006
2005
J. Graph Theory, 2005
2004
Discret. Appl. Math., 2004
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture.
Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology, 2004
2003
J. Autom. Lang. Comb., 2003
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
Proceedings of the 2003 Conference on Languages, 2003
Proceedings of the Combinatorial Geometry and Graph Theory, 2003
A General Framework for Coloring Problems: Old Results, New Results, and Open Problems.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003
Proceedings of the 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC'03), 30 June, 2003
Proceedings of the Advances in Computer Systems Architecture, 2003
2002
Discuss. Math. Graph Theory, 2002
Discret. Math., 2002
Discret. Appl. Math., 2002
Discret. Appl. Math., 2002
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.
Discret. Appl. Math., 2002
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems.
Algorithmica, 2002
Proceedings of the Algorithm Theory, 2002
2001
Discuss. Math. Graph Theory, 2001
2000
A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs.
Discret. Appl. Math., 2000
1999
Another equivalent of the graceful tree conjecture.
Ars Comb., 1999
1998
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
1997
Discuss. Math. Graph Theory, 1997
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997
1996
The connectivity of the leaf-exchange spanning tree graph of a graph.
Ars Comb., 1996
1995
Discret. Math., 1995
On generalizing a theorem of Jung.
Ars Comb., 1995
1994
Discret. Math., 1994
1993
J. Graph Theory, 1993
Discret. Math., 1993
1992
1991
J. Graph Theory, 1991
1989
1988
1987
J. Graph Theory, 1987