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

2006
12 Citations (Scopus)

Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult

Broersma, H. J., Fomin, F. V., Kratochvil, J. & Woeginger, G., May 2006, In : Algorithmica. 44, 4, p. 343-361 19 p., 10.1007/s00453-005-1176-8.

Research output: Contribution to journalArticleAcademicpeer-review

82 Downloads (Pure)

Sparse cuts, matching-cuts and leafy trees in graphs

Bonsma, P. S., 28 Jun 2006, Enschede: Ipskamp Printing. 175 p.

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

File
3 Downloads (Pure)

Subpancyclicity of line graphs and degree sums along paths

Xiong, L. & Broersma, H. J., 2 Jun 2006, In : Discrete applied mathematics. 154, 06EX1521/9, p. 1453-1463 11 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Degree Sum
Hamiltonians
Line Graph
Path
Graph in graph theory
1 Citation (Scopus)

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, 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 contributionAcademicpeer-review

50 Citations (Scopus)

Toughness in graphs - A survey

Bauer, D., Broersma, H. J. & Schmeichel, E., Apr 2006, In : Graphs and combinatorics. 22, 10/1, p. 1-35 35 p., 10.1007/s00373-006-0649-0.

Research output: Contribution to journalArticleAcademicpeer-review

2005
6 Citations (Scopus)

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 contributionAcademicpeer-review

Colouring
Open Problems
Frequency Assignment
Biased
Framework
7 Citations (Scopus)

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 contributionAcademicpeer-review

Ramsey number
Wheel
Upper bound
Cycle
Graph in graph theory
17 Downloads (Pure)

Contributions to graph theory

Salman, M., 2005, Enschede: University of Twente. 115 p.

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

Open Access
File
27 Downloads (Pure)

Handelsreizigers in wiskunde : promotionele activiteiten op de Universiteit Twente

Broersma, H. J. & Ruizenaar, H. W. A., 2005, In : Nieuw archief voor wiskunde. Ser. 5, vol. 6, 2, p. 153-155

Research output: Contribution to journalArticleAcademic

File
3 Citations (Scopus)
56 Downloads (Pure)

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

More on spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs

Salman, M., Broersma, H. J. & Rodger, C. A., 2005, In : Bulletin of the Institute of Combinatorics and its Applications. 45, p. 17-32 15 p.

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)

On stability of the Hamiltonian index under contractions and closures

Broersma, H. J., Xiong, L. & Ryjácek, Z., 2005, In : Journal of graph theory. 49, p. 104-115 11 p.

Research output: Contribution to journalArticleAcademicpeer-review

56 Citations (Scopus)
52 Downloads (Pure)

Paths and cycles in colored graphs

Broersma, H. J., Li, X., Li, X., Woeginger, G. & Zhang, S., 2005, In : Australasian journal of combinatorics. 31, 1, p. 299-311 12 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
47 Downloads (Pure)

The Ramsey number of fans versus K4

Surahmat, Baskoro, E. T. & Broersma, H. J., 2005, In : Bulletin of the Institute of Combinatorics and its Applications. 43, p. 96-102 6 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
2004

A continuation of spanning 2-connected subgraphs in truncated rectangular grid graphs,

Salman, M., Broersma, H. J. & Rodger, C. A., 2004, In : Journal of combinatorial mathematics and combinatorial computing (JCMCC). 49, p. 177-186 9 p.

Research output: Contribution to journalArticleAcademicpeer-review

47 Downloads (Pure)

On Ramsey numbers for paths versus wheels

Salman, M. & Broersma, H. J., 2004, Enschede: University of Twente, Department of Applied Mathematics.

Research output: Book/ReportReportOther research output

File

On Ramsey numbers for paths versus wheels

Salman, M. & Broersma, H. J., 2004, Enschede: Toegepaste Wiskunde. 12 p. (Memorandum afdeling TW; no. 1742)

Research output: Book/ReportReportProfessional

3 Citations (Scopus)

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, p. 204-214 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

27 Downloads (Pure)

Path-kipas Ramsey numbers

Salman, M. & Broersma, H. J., 2004, Enschede: Toegepaste Wiskunde. 11 p. (Memorandum afdeling TW; no. 1743)

Research output: Book/ReportReportProfessional

File
2 Citations (Scopus)

Radio Labeling with Preassigned Frequencies

Bodlaender, H. L., Broersma, H. J., Fomin, F. V. & Woeginger, G., 2004, In : SIAM journal on optimization. 15, p. 1-16 16 p.

Research output: Contribution to journalArticleAcademicpeer-review

19 Downloads (Pure)

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, p. 185-192 8 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

File
28 Citations (Scopus)
10 Downloads (Pure)

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 contributionAcademicpeer-review

Open Access
File
Quality of service
Energy utilization
System-on-chip
2 Citations (Scopus)
37 Downloads (Pure)

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 contributionAcademicpeer-review

Open Access
File
Assignment Problem
Computational Complexity
Graph in graph theory
Maximum Degree
Multiway Cut
14 Citations (Scopus)
37 Downloads (Pure)

The hamiltonian index of a graph and its branch-bonds

Xiong, L., Broersma, H. J., Li, X., Li, X. & Li, M., 2004, In : Discrete mathematics. 285, 1-3, p. 279-288 9 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Hamiltonians
Branch
Graph in graph theory
Lower bound
Upper bound
8 Downloads (Pure)

The Ramsey numbers of large cycles versus small wheels

Surahmat, Baskoro, E. T. & Broersma, H. J., 2004, In : Integers. 4, 9 p., A10.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Ramsey number
Wheel
Subgraph
Cycle
Graph in graph theory
3 Citations (Scopus)

The Ramsey numbers of paths versus kipases

Salman, M. & Broersma, H. J., 31 May 2004, p. 218-222. 4 p.

Research output: Contribution to conferencePaperAcademicpeer-review

2003
12 Downloads (Pure)

A continuation of spanning 2-connected subgraphs in truncated rectangular grid graphs

Salman, M., Broersma, H. J. & Rodger, C. A., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1700)

Research output: Book/ReportReportOther research output

Open Access
File
Grid Graph
Continuation
Subgraph
Graph in graph theory
Cycle
38 Downloads (Pure)

A general framework for coloring problems: old results, new results, and open problems

Broersma, H. J., 2003, Enschede: University of Twente, Department of Applied Mathematics. 14 p. (Memorandum; no. 1704)

Research output: Book/ReportReportOther research output

File
Colouring
Open Problems
Frequency Assignment
Biased
Framework
19 Downloads (Pure)

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 (ACM), p. 199-208 10 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

File
9 Downloads (Pure)

Backbone colorings along perfect matchings

Broersma, H. J., Fujisawa, J. & Yoshimoto, K., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1706)

Research output: Book/ReportReportOther research output

Open Access
File
Perfect Matching
Backbone
Colouring
Spanning Subgraph
Vertex Coloring
16 Citations (Scopus)

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, p. 131-142

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Backbone
Colouring
Spanning tree
Path
Vertex Coloring
6 Downloads (Pure)

Backbone colorings for networks: tree and path backbones

Broersma, H. J., Fomin, F. V., Golovach, P. A. & Woeginger, G., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1705)

Research output: Book/ReportReportOther research output

Open Access
File
2 Citations (Scopus)
10 Downloads (Pure)

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 contributionAcademicpeer-review

File

More on spanning 2-connected subgraphs in truncated rectangular grid graphs

Salman, M., Baskoro, E. T., Broersma, H. J. & Rodger, C. A., 2003, In : Bulletin of the Institute of Combinatorics and its Applications. 39, p. 31-38 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

21 Downloads (Pure)

More on spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs

Salman, M., Broersma, H. J. & Rodger, C. A., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1702)

Research output: Book/ReportReportOther research output

Open Access
File
Grid Graph
Subgraph
Graph in graph theory
Face
Cycle
46 Downloads (Pure)

Path-fan Ramsey numbers

Salman, M. & Broersma, H. J., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum / Department of Applied Mathematics; no. 1703)

Research output: Book/ReportReportOther research output

Open Access
File
Ramsey number
Path
Subgraph
Triangle
Graph in graph theory
9 Downloads (Pure)

Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult

Broersma, H. J., Fomin, F. V., Kratochvil, J. & Woeginger, G., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum Afdeling TW; no. 1701)

Research output: Book/ReportReportOther research output

Open Access
File
Coloring
Color
Computational complexity
5 Citations (Scopus)
30 Downloads (Pure)

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 contributionAcademicpeer-review

File
2002

A fan type condition for heavy cycles in weighted graphs

Zhang, S., Broersma, H. J., Li, X. & Wang, L., 2002, In : Graphs and combinatorics. 18, 1, p. 193-200 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

Weighted Graph
Fans
Cycle
Hamilton Cycle
Long Cycle
9 Citations (Scopus)

A generalization of AT-free graphs and a generic algorithm for solving triangulation problems

Broersma, H. J., Kloks, A. J. J., Kloks, T., Kratsch, D. & Müller, H., 2002, In : Algorithmica. 32, 4, p. 594-610 17 p.

Research output: Contribution to journalArticleAcademicpeer-review

Triangulation
Graph in graph theory
Cardinality
Set theory
Separators
15 Citations (Scopus)
6 Downloads (Pure)

A note on minimum degree conditions for supereulerian graphs

Broersma, H. J. & Xiong, L., 2002, In : Discrete applied mathematics. 120, 1-3, p. 35-43 9 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Degree Condition
Minimum Degree
Graph in graph theory
Connected graph
Strengthening
16 Downloads (Pure)

Cycles in weighted graphs and related topics

Zhang, S., 20 Nov 2002, Enschede: Twente University Press (TUP). 127 p.

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

File
Weighted Graph
Cycle
Path
Graph in graph theory
Vulnerability
1 Citation (Scopus)
35 Downloads (Pure)

Degree sums and subpancyclicity in line graphs

Xiong, L., Broersma, H. J., Hoede, C., Li, X. & Li, X., 2002, In : Discrete mathematics. 242, 1-3, p. 255-267 13 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Degree Sum
Line Graph
Exceed
Graph in graph theory
Path

Forbidden subgraphs that imply hamiltonian-connectedness

Broersma, H. J., Faudree, R. J., Huck, A., Trommel, H. & Veldman, H. J., 2002, In : Journal of graph theory. 40, 2, p. 104-119 16 p.

Research output: Contribution to journalArticleAcademicpeer-review

Forbidden Subgraph
Claw-free Graphs
Connectedness
Imply
Triangle
1 Citation (Scopus)
2 Downloads (Pure)

Foreword to the Special Issue devoted to the 6th Twente Workshop on Graphs and Combinatorial Optimization

Faigle, U., Broersma, H. J. & Hurink, J. L., 2002, In : Discrete applied mathematics. 120, 1-3, p. 1

Research output: Contribution to journalEditorialAcademic

Open Access
File

Global connectivity and expansion:long cycles and factors in f-connected graphs (extended version)

Brandt, S., Broersma, H. J., Diestel, R. & Kriesell, M., 2002, Enschede: University of Twente. 21 p. (Hamburger Beiträge zur Mathematik; no. 152)

Research output: Book/ReportReportProfessional

Grafen in de praktijk

Broersma, H. J., 2002, Utrecht: Epsilon Uitgaven. 60 p.

Research output: Book/ReportBookAcademic

8 Citations (Scopus)
147 Downloads (Pure)

Heavy cycles in weighted graphs

Bondy, J. A., Broersma, H. J., van den Heuvel, J. & Veldman, H. J., 2002, In : Discussiones mathematicae. Graph theory. 22, 1, p. 7-15

Research output: Contribution to journalArticleAcademic

Open Access
File
Weighted Graph
Cycle
Hamilton Cycle
Paul Adrien Maurice Dirac
Weighting

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 contributionAcademicpeer-review

6 Citations (Scopus)
25 Downloads (Pure)

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 contributionAcademicpeer-review

File