No photo of Hajo Broersma

Hajo Broersma

prof.dr.ir.

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

Research Output 1987 2018

Filter
Conference contribution
2016

A simulation tool for evolving functionalities in disordered nanoparticle networks

van Damme, R. M. J., Broersma, H. J., Mikhal, J. O., Lawrence, C. P. & van der Wiel, W. G. 21 Nov 2016 2016 IEEE Congress on Evolutionary Computation (CEC 2016). USA: IEEE Computer Society, p. 5238-5245 8 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Unconventional computing using evolution-in-nanomaterio: neural networks meet nanoparticle networks

Greff, K., van Damme, R. M. J., Koutnik, J., Broersma, H. J., Mikhal, J. O., Lawrence, C. P., van der Wiel, W. G. & Schmidhuber, J. 20 Mar 2016 The Eighth International Conference on Future Computational Technologies and Applications, FUTURE COMPUTING 2016. Wilmington, U.S.A.: IARIA International Academy, Research and Industry Association, p. 15-20 6 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
2015

Computational matter: evolving computational solutions in materials

Miller, J. F. & Broersma, H. J. 11 Jul 2015 Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO Companion 2015. Silva, S. (ed.). New York: Association for Computing Machinery, p. 769-770 2 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
2013
11 Citations

Back to basics: homogeneous representations of multi-rate synchronous dataflow graphs

de Groote, R., Holzenspies, P. K. F., Kuper, J. & Broersma, H. J. Oct 2013 Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013. USA: IEEE Computer Society, p. 35-46 12 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File

Improving the performance of periodic real-time processes: a graph theoretical approach

Boode, A. H., Broersma, H. J. & Broenink, J. F. 25 Aug 2013 Communicating Process Architectures 2013. Bicester: Open Channel Publishing Ltd, p. 57-79 23 p. (35th WoTUG conference on concurrent and parallel programming)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
1 Citations

Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs

Broersma, H. J., Fiala, J., Golovach, P. A., Kaiser, T., Paulusma, D. & Proskurowski, A. 2013 Graph-Theoretic Concepts in Computer Science: 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. Brandstädt, A., Jansen, K. & Reischuk, R. (eds.). Berlin: Springer Verlag, p. 127-138 12 p. (Lecture Notes in Computer Science; vol. 8165)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Interval Graphs
Linear-time Algorithm
Connectivity
Scattering
If and only if
2012
17 Citations

Max-plus algebraic throughput analysis of synchronous dataflow graphs

de Groote, R., Kuper, J., Broersma, H. J. & Smit, G. J. M. 2012 38th EUROMICRO Conference on Software Engineering and Advanced Applications (SEAA). USA: IEEE Computer Society, p. 29-38 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
3 Citations

Tight complexity bounds for FPT subgraph problems parameterized by clique-width

Broersma, H. J., Golovach, P. A. & Patel, V. 2012 Parameterized and Exact Computation: 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers. Marx, D. & Rossmanith, P. (eds.). London: Springer, p. 207-218 12 p. (Lecture Notes in Computer Science; vol. 7112)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
Clique-width
Subgraph
Induced Subgraph
Exponential time
Minimum Degree
2011
2 Citations

The complexity status of problems related to sparsest cuts

Bonsma, P. S., Broersma, H. J., Patel, V. & Pyatkin, A. Mar 2011 Proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010. Iliopoulos, C. S. & Smyth, W. F. (eds.). Berlin, Heidelberg: Springer Verlag, p. 125-135 11 p. (Lecture Notes in Computer Science; vol. 6460)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2010
5 Citations

Fast exact algorithms for hamiltonicity in claw-free graphs

Broersma, H. J., Fomin, F. V., van 't Hof, P. & Paulusma, D. Feb 2010 Graph-Theoretic Concepts in Computer Science: 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. Paul, C. & Habib, M. (eds.). Berlin: Springer Verlag, p. 44-53 10 p. (Lecture Notes in Computer Science; vol. 5911)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hamiltonicity
Claw-free Graphs
Hamiltonian circuit
Exact Algorithms
Fast Algorithm
2009
3 Citations

Fully decomposable split graphs

Broersma, H. J., Kratsch, D. & Woeginger, G. 2009 Combinatorial Algorithms - Proceedings of the 20th International Workshop IWOCA 2009. Fiala, J., Kratochvil, J. & Miller, M. (eds.). Berlin: Springer Verlag, p. 105-112 8 p. 10.1007/978-3-642-10217-2_13. (Lecture Notes in Computer Science; vol. 5874)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations

Three Complexity Results on Coloring $P_k$-Free Graphs

Broersma, H. J., Fomin, F. V., Golovach, P. A. & Paulusma, D. 2009 Combinatioral Algorithms - Proceedings of the 20th International Workshop , IWOCA 2009. Fiala, J., Kratochvil, J. & Miller, M. (eds.). Berlin: Springer Verlag, p. 95-104 10 p. 10.1007/978-3-642-10217-2_12. (Lecture Notes in Computer Science; vol. 5874)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2008
1 Citations

Computing sharp 2-factors in claw-free graphs

Broersma, H. J. & Paulusma, D. Aug 2008 33rd International Symposium on Mathematical Foundations of Computer Science. Berlin: Springer Verlag, p. 193-204 12 p. 10.1007/978-3-540-85238-4_15. (Lecture Notes in Computer Science; vol. 5162, no. WoTUG-31)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2007
5 Citations

Improved upper bounds for λ-backbone colorings along matchings and stars

Broersma, H. J., Marchal, L., Paulusma, D. & Salman, M. 13 Jul 2007 Proceedings of SOFSEM 2007: Theory and Practice of Computer Science. van Leeuwen, J., Italiano, G. F., van der Hoek, W., Meinel, C., Sack, H. & Plásil, F. (eds.). Berlin: Springer Verlag, p. 188-199 12 p. 10.1007/978-3-540-69507-3. (Lecture Notes in Computer Science; vol. 4362, no. LNCS4549)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

On components of 2-factors in claw-free graphs

Broersma, H. J., Paulusma, D. & Yoshimoto, K. Aug 2007 EuroComb 2007: European Conference on Combinatorics, Graph Theory and Applications. Amsterdam: ELSEVIER, p. 289-293 5 p. 10.1016/j.endm.2007.07.050. (Electronic Notes in Discrete Mathematics; vol. 29, no. 1)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citations

Upper bounds and algorithms for parallel knock-out numbers

Broersma, H. J., Johnson, M. & Paulusma, D. Jul 2007 SIROCCO 2007: 14th International Colloquium on Structural Information and Communication Complexity. Prencipe, G. & Zaks, S. (eds.). Berlin: Springer Verlag, p. 328-340 13 p. 10.1007/978-3-540-72951-8_26. (Lecture Notes in Computer Science; vol. 4474, no. 1)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2006
4 Citations

On-line coloring of H-free bipartite graphs

Broersma, H. J., Capponi, A. & Paulusma, D. 2006 Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006. Proceedings. Calamoneri, T., Finocchi, I. & Italiano, G. F. (eds.). Berlin, Heidelberg: Springer, p. 284-295 12 p. (Lecture Notes in Computer Science; vol. 3998)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bipartite Graph
Colouring
Chromatic number
Upper bound
Path
1 Citations

The Computational Complexity of the Parallel Knock-Out Problem

Broersma, H. J., Johnson, M., Paulusma, D. & Stewart, I. A. 2006 Proceedings of the 7th Latin American Symposium (LATIN 2006). Correa, J. R., Hevia, A. & Kiwi, M. (eds.). Berlin: Springer Verlag, p. 250-261 12 p. 10.1007/11682462_26. (Lecture Notes in Computer Science; vol. 3887, no. 11)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2005
6 Citations

A General Framework for Coloring Problems: Old Results, New Results, and Open Problems

Broersma, H. 2005 Combinatorial Geometry and Graph Theory: Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers. Akiyama, J., Baskoro, E. T. & Kano, M. (eds.). Berlin: Springer, p. 65-79 14 p. (Lecture Notes in Computer Science; vol. 3330)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Colouring
Open Problems
Frequency Assignment
Biased
Framework
5 Citations

An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels

Surahmat, Baskoro, E. T., Uttunggadewa, S. & Broersma, H. 2005 Combinatorial Geometry and Graph Theory: Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers. Akiyama, J., Baskoro, E. T. & Kano, M. (eds.). Berlin: Springer, p. 181-184 3 p. (Lecture Notes in Computer Science; vol. 3330)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ramsey number
Wheel
Upper bound
Cycle
Graph in graph theory
2004
3 Citations

Parallel knock-out schemes in networks

Fomin, F. V., Broersma, H. J. & Woeginger, G. 2004 Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science. Fiala, J., Koubek, V. & Kratochvil, J. (eds.). Heidelberg: Springer Verlag, p. 204-214 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Run-time assignment of tasks to multiple heterogeneous processors

Smit, L. T., Smit, G. J. M., Hurink, J. L., Broersma, H. J., Paulusma, D. & Wolkotte, P. T. Oct 2004 5th PROGRESS Symposium on Embedded Systems. Nieuwegein, the Netherlands: STW Technology Foundation, p. 185-192 8 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
28 Citations

Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture

Smit, L. T., Smit, G. J. M., Hurink, J. L., Broersma, H., Paulusma, D. & Wolkotte, P. T. Dec 2004 2004 IEEE International Conference on Field-Programmable Technology, 2004: Proceedings. Piscataway, NJ: IEEE, p. 421-424 4 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Open Access
File
Quality of service
Energy utilization
System-on-chip
2 Citations

The Computational Complexity of the Minimum Weight Processor Assignment Problem

Broersma, H. J., Paulusma, D., Smit, G. J. M., Vlaardingerbroek, F. & Woeginger, G. Jun 2004 Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004. Revised Papers. Hromkovic, J., Nagl, M. & Westfechtel, B. (eds.). Berlin: Springer, p. 189-200 12 p. (Lecture notes in computer science; vol. 3353)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Open Access
File
Assignment Problem
Computational Complexity
Graph in graph theory
Maximum Degree
Multiway Cut
2003

A Graph Covering Algorithm for a Coarse Grain Reconfigurable System

Guo, Y., Smit, G. J. M., Heysters, P. M. & Broersma, H. J. Jun 2003 Proceedings of LCTES 2003. New York: Association for Computing Machinery, p. 199-208 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
16 Citations

Backbone colorings for networks

Broersma, H. J., Fomin, F. V., Golovach, P. & Woeginger, G. 2003 Graph-Theoretic Concepts in Computer Science: 29th International Workshop, WG 2003. Elspeet, The Netherlands, June 19-21, 2003. Revised Papers. Bodlaender, H. L. (ed.). Springer Verlag, p. 131-142

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Backbone
Colouring
Spanning tree
Path
Vertex Coloring
2 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. Sep 2003 Proceedings of the Asia-Pacific Computer Systems Architecture Conference. Omondi, A. & Sedukhin, S. (eds.). Berlin: Springer, p. 221-235 15 p. (Lecture Notes in Computer Science; vol. 2823)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
5 Citations

Template Generation and Selection Algorithms

Guo, Y., Smit, G. J. M., Broersma, H. J. & Heysters, P. M. Jun 2003 Proceedings of International Workshop on System-on-Chip for Real-Time Applications 2003. Badaway, W. & Ismail, Y. (eds.). Los Alamitos, California: IEEE Computer Society, p. 2-5 4 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
2002

Influences of Rake receiver/TURBO decoder parameters on energy consumption and Quality

Smit, L. T., Smit, G. J. M., Hurink, J. L. & Broersma, H. J. 2002 Proceedings World Wireless Congress. Delson group Inc, p. 175-181

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations

Influences of RAKE Receiver/Turbo Decoder Parameters on Energy Consumption and Quality

Smit, L. T., Smit, G. J. M., Havinga, P. J. M., Hurink, J. L. & Broersma, H. J. 27 May 2002 2002 International Conference On Third Generation Wireless and Beyond. Lu, W. W. (ed.). Saratoga, CA, USA: Delson Group, p. 175-180 6 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
1 Citations

Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous

Broersma, H. J., Fomin, F. V., Kratochvíl, J. & Woeginger, G. 2002 Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings. Penttonen, M. & Meineche Schmidt, E. (eds.). Springer Verlag, p. 160-169 (Lecture notes in computer science; vol. 2368)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Radio Labeling with Pre-assigned Frequencies

Bodlaender, H. L., Broersma, H. J., Fomin, F. V., Pyatkin, A. & Woeginger, G. 2002 Algorithms — ESA 2002: 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings. Möhring, R. & Raman, R. (eds.). Berlin: Springer, p. 211-222 (Lecture Notes in Computer Science; vol. 2461)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Labeling
Graph in graph theory
Transmitter
Colouring
Frequency Assignment

Run-Time adaptivity for Software Defined Radio

Smit, L. T., Smit, G. J. M., Hurink, J. L. & Broersma, H. J. 2002 Proceedings 3rd workshop on Embedded Systems. p. 218-224

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Run-Time Control For Software Defined Radio

Smit, L. T., Smit, G. J. M., Havinga, P. J. M., Hurink, J. L. & Broersma, H. J. Oct 2002 3rd PROGRESS workshop on Embedded Systems. Utrecht, The Netherlands: STW Technology Foundation, p. 218-223 6 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
2000

On compact models for high-voltage MOS devices

van Beckum, F. P. H., Broersma, H. J., Habets, L. C. G. J. M., Meinsma, G., Molenaar, J., Schilders, W. H. A. & van de Ven, A. A. F. 1 Jan 2000 Proc. of the 36th European Study Group with Industry, EUT-Report 00-WSK-0. Eindhoven, p. 11-23 13 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1997
7 Citations

Algorithms for the treewidth and minimum fill-in of HHD-free graphs

Broersma, H. J., Dahlhaus, E., Kloks, A. J. J. & Kloks, T. 1997 Graph-Theoretic Concepts in Computer Science. Springer, p. 109-117 19 p. (Lecture notes in computer science; vol. 1335)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
Treewidth
Graph in graph theory
Cycle
Clique number
Induced Subgraph
9 Citations

Independent sets in asteroidal triple-free graphs

Broersma, H. J., Kloks, T., Kloks, A. J. J., Kratsch, D. & Müller, H. 1997 Automata, Languages and Programming: 24th International Colloquium, ICALP '97 Bologna, Italy, July 7–11, 1997 Proceedings. Degano, P., Gorrieri, R. & Marchetti-Spaccamela, A. (eds.). Springer, p. 760-770 11 p. (Lecture notes in computer science; vol. 1256)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
Independent Set
Graph in graph theory
Dominating Set
Cardinality
Polynomial time