EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


Author: Broersma, H.J.
Home Policy Brochure Browse Search User Area Contact Help

2017

Greff, K. and van Damme, R.M.J. and Koutnik, J. and Broersma, H.J. and Mikhal, J. and Lawrence, C.P. and van der Wiel, W.G. and 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). pp. 339-351. ISSN 1942-2679
Li, Binlong and Zhang, Yanbo and Broersma, H.J. (2017) An exact formula for all star-kipas Ramsey numbers. Graphs and combinatorics, 33 (1). pp. 141-148. ISSN 0911-0119 *** ISI Impact 0,480 ***

2016

Broersma, H.J. and Li, Binlong and Zhang, Shenggui (2016) Forbidden subgraphs for hamiltonicity of 1-tough graphs. Discussiones Mathematicae Graph Theory, 36 (4). pp. 915-929. ISSN 1234-3099 *** ISI Impact 0,349 ***
Broersma, H.J. and Miller, J.F. and Nichele, S. (2016) Computational matter: evolving computational functions in nanoscale materials. In: Advances in Unconventional Computing, Volume 2: Prototypes, Models and Algorithms. Emergence, Complexity and Computation 23. Springer Verlag, London, pp. 397-428. ISSN 2194-7287 ISBN 978-3-319-33920-7
Chen, Xiaodong and Li, MingChu and Liao, Wei and Broersma, H.J. (2016) Hamiltonian properties of almost locally connected claw-free graphs. Ars combinatoria, 124. pp. 95-109. ISSN 0381-7032 *** ISI Impact 0,265 ***
van Damme, R.M.J. and Broersma, H.J. and Mikhal, J. and Lawrence, C.P. and van der Wiel, W.G. (2016) A simulation tool for evolving functionalities in disordered nanoparticle networks. In: 2016 IEEE Congress on Evolutionary Computation (CEC 2016), 24-29 July 2016, Vancouver, Canada. pp. 5238-5245. IEEE Computer Society. ISBN 978-1-5090-0623-6
Greff, K. and van Damme, R.M.J. and Koutnik, J. and Broersma, H.J. and Mikhal, J. and Lawrence, C.P. and van der Wiel, W.G. and Schmidhuber, J. (2016) Unconventional computing using evolution-in-nanomaterio: neural networks meet nanoparticle networks. In: The Eighth International Conference on Future Computational Technologies and Applications, FUTURE COMPUTING 2016, 20-24 March 2016, Rome, Italy. pp. 15-20. IARIA International Academy, Research and Industry Association. ISBN 978-1-61208-461-9
Zhang, Xiaoyan and Zhang, Zan-Bo and Broersma, H.J. and Wen, Xuelian (2016) On the complexity of edge-colored subgraph partitioning problems in network optimization. Discrete mathematics and theoretical computer science, 17 (3). pp. 227-244. ISSN 1365-8050
Zhang, Yanbo and Broersma, H.J. and Chen, Y. (2016) On star-critical and upper size Ramsey numbers. Discrete applied mathematics, 202. pp. 174-180. ISSN 0166-218X *** ISI Impact 0,722 ***
Zhang, Yanbo and Broersma, H.J. and Chen, Y. (2016) Narrowing down the gap on cycle-star Ramsey numbers. Journal of combinatorics, 7 (2-3). pp. 481-493. ISSN 2156-3527
Zhang, Yanbo and Broersma, H.J. and Chen, Yaojun (2016) On fan-wheel and tree-wheel Ramsey numbers. Discrete mathematics, 339 (9). pp. 2284-2287. ISSN 0012-365X *** ISI Impact 0,600 ***

2015

Bauer, D. and Broersma, H.J. and van den Heuvel, J. and Kahl, N. and Nevo, A. and Schmeichel, E. and Woodall, D.R. and Yatauro, M. (2015) Best monotone degree conditions for graph properties: a survey. Graphs and combinatorics, 31 (1). pp. 1-22. ISSN 0911-0119 *** ISI Impact 0,480 ***
Boode, A.H. and Broersma, H.J. and Broenink, J.F. (2015) On a directed tree problem motivated by a newly introduced graph product. Electronic Journal of Graph Theory and Applications, 3 (2). pp. 162-181. ISSN 2338-2287
Bose, S.K. and Lawrence, C.P. and Liu, Zhihua and Makarenko, K.S. and van Damme, R.M.J. and Broersma, H.J. and van der Wiel, W.G. (2015) Evolution of a designless nanoparticle network into reconfigurable Boolean logic. Nature nanotechnology, 10 (12). pp. 1048-1052. ISSN 1748-3387 *** ISI Impact 35,267 ***
Broersma, H.J. (2015) How tough is toughness? Bulletin of the European Association for Theoretical Computer Science, 117. pp. 28-52. ISSN 0252-9742
Broersma, H.J. and Fiala, J. and Golovach, P.A. and Kaiser, T. and Paulusma, D. and Proskurowski, A. (2015) Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs. Journal of graph theory, 79 (4). pp. 282-299. ISSN 0364-9024 *** ISI Impact 0,796 ***
Li, Binlong and Ning, B0 and Broersma, H.J. and Zhang, Shenggui (2015) Characterizing heavy subgraph pairs for pancyclicity. Graphs and combinatorics, 31 (3). pp. 649-667. ISSN 0911-0119 *** ISI Impact 0,480 ***
Li, Binlong and Zhang, Yanbo and Bielak, H. and Broersma, H.J. and Holub, P. (2015) Closing the gap on path-kipas Ramsey numbers. Electronic journal of combinatorics, 22 (3). 3.21. ISSN 1077-8926 *** ISI Impact 0,612 ***
Miller, J.F. and Broersma, H.J. (2015) Computational matter: evolving computational solutions in materials. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO Companion 2015, 11-15 July 2015, Madrid, Spain. pp. 769-770. ACM. ISBN 978-1-4503-3488-4
Wang, Limin and Zhang, Xiaoyan and Zhang, Zhao and Broersma, H.J. (2015) A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs. Theoretical computer science, 571. pp. 58-66. ISSN 0304-3975 *** ISI Impact 0,643 ***
Zhang, Yanbo and Broersma, H.J. and Chen, Yaojun (2015) Ramsey numbers of trees versus fans. Discrete mathematics, 338 (6). pp. 994-999. ISSN 0012-365X *** ISI Impact 0,600 ***
Zhang, Yanbo and Broersma, H.J. and Chen, Yaojun (2015) Three results on cycle-wheel Ramsey numbers. Graphs and combinatorics, 31 (6). pp. 2467-2479. ISSN 0911-0119 *** ISI Impact 0,480 ***
Zhang, Yanbo and Broersma, H.J. and Chen, Yaojun (2015) A note on Ramsey numbers for fans. Bulletin of the Australian Mathematical Society, 92 (1). pp. 19-23. ISSN 0004-9727 *** ISI Impact 0,566 ***

2014

Broersma, H.J. and Patel, V. and Pyatkin, A. (2014) On toughness and hamiltonicity of 2K2-free graphs Journal of graph theory, 75 (3). pp. 244-255. ISSN 0364-9024 *** ISI Impact 0,796 ***
Li, Binlong and Broersma, H.J. and Zhang, Shenggui (2014) Heavy subgraph pairs for traceability of block-chains. Discussiones Mathematicae Graph Theory, 34 (2). pp. 287-307. ISSN 1234-3099 *** ISI Impact 0,349 ***
Wu, Jichang and Broersma, H.J. and Kang, Haiyan (2014) Removable edges and chords of longest cycles in 3-connected graphs. Graphs and Combinatorics, 30 (3). pp. 743-753. ISSN 0911-0119 *** ISI Impact 0,480 ***
Zhang, Yanbo and Broersma, H.J. and Chen, Yaojun (2014) A remark on star-C4 and wheel-C4 Ramsey numbers. Electronic Journal of Graph Theory and Applications, 2 (2). pp. 110-114. ISSN 2338-2287

2013

Bauer, D. and Broersma, H.J. and van den Heuvel, J. and Kahl, N. and Schmeichel , E. (2013) Toughness and vertex degrees. Journal of graph theory, 72 (2). pp. 209-219. ISSN 0364-9024 *** ISI Impact 0,796 ***
Boode, A.H. and Broersma, H.J. and Broenink, J.F. (2013) Improving the performance of periodic real-time processes: a graph theoretical approach. In: Communicating Process Architectures 2013, 25-28 Aug 2013, Edinburgh, UK. pp. 57-79. 35th WoTUG conference on concurrent and parallel programming. Open Channel Publishing Ltd. ISBN 978-0-9565409-7-3
Broersma, H.J. and Fiala, J. and Golovach, P.A. and Kaiser, T. and Paulusma, D. and Proskurowski, A. (2013) Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs. In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2013, 19-21 Jun 2013, Lübeck, Germany. pp. 127-138. Lecture Notes in Computer Science 8165. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-45042-6
Broersma, H.J. and Fomin, F.V. and van 't Hof, P. and Paulusma, D. (2013) Exact algorithms for finding longest cycles in claw-free graphs. Algorithmica, 65 (1). pp. 129-145. ISSN 0178-4617 *** ISI Impact 0,795 ***
Broersma, H.J. and Fomin, V.F. and Golovach, P.A. and Paulusma, D. (2013) Three complexity results on coloring $P_k$-free graphs. European journal of combinatorics, 34 (3). pp. 609-619. ISSN 0195-6698 *** ISI Impact 0,650 ***
Broersma, H.J. and Golovach, P.A. and Patel, V. (2013) Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theoretical computer science, 485. pp. 69-84. ISSN 0304-3975 *** ISI Impact 0,643 ***
Broersma, H.J. and Kratsch, D. and Woeginger, G.J. (2013) Fully decomposable split graphs. European journal of combinatorics, 34 (3). pp. 567-575. ISSN 0195-6698 *** ISI Impact 0,650 ***
de Groote, E. and Hölzenspies, P.K.F. and Kuper, J. and Broersma, H.J. (2013) Back to basics: homogeneous representations of multi-rate synchronous dataflow graphs. In: Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013, 18-20 Oct 2013, Portland, OR, USA. pp. 35-46. IEEE Computer Society. ISBN 978-1-4799-0903-2
Li, Binlong and Broersma, H.J. and Zhang, Shenggui (2013) Forbidden subgraph pairs for traceability of block-chains. Electronic journal of graph theory and applications, 1 (1). pp. 1-10. ISSN 2338-2287
Li, MingChu and Yuan, Lifeng and Jiang, He and Liu, Bing and Broersma, H.J. (2013) Tank-ring factors in supereulerian claw-free graphs. Graphs and combinatorics, 29 (3). pp. 599-608. ISSN 0911-0119 *** ISI Impact 0,480 ***

2012

Bauer, D. and Broersma, H.J. and van den Heuvel, J. and Kahl, N. and Schmeichel, E. (2012) Degree sequences and the existence of k-factors. Graphs and combinatorics, 28 (2). pp. 149-166. ISSN 0911-0119 *** ISI Impact 0,480 ***
Bonsma, P.S. and Broersma, H.J. and Patel, V. and Pyatkin, A. (2012) The complexity of finding uniform sparsest cuts in various graph classes. Journal of discrete algorithms, 14. pp. 136-149. ISSN 1570-8667
Broersma, H.J. and Golovach, P.A. and Patel, V. (2012) Tight complexity bounds for FPT subgraph problems parameterized by clique-width. In: 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, 6-8 Sept 2011, Saarbrücken, Germany. pp. 207-218. Lecture Notes in Computer Science 7112. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-28049-8
Broersma, H.J. and Golovach, P.A. and Paulusma, D. and Song, J. (2012) Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. Theoretical computer science, 423. pp. 1-10. ISSN 0304-3975 *** ISI Impact 0,643 ***
Broersma, H.J. and Golovach, P.A. and Paulusma, D. and Song, Jian (2012) Updating the complexity status of coloring graphs without a fixed induced linear forest. Theoretical computer science, 414 (1). pp. 9-19. ISSN 0304-3975 *** ISI Impact 0,643 ***
Broersma, H.J. and Gomez, F. and Miller, J.F. and Petty, M. and Tufte, G. (2012) Nascence project: nanoscale engineering for novel computation using evolution. International journal of unconventional computing, 8 (4). pp. 313-317. ISSN 1548-7199 *** ISI Impact 0,739 ***
Broersma, H.J. and Ryjáček, Z. and Vrána, P. (2012) How many conjectures can you stand: a survey. Graphs and combinatorics, 28 (1). pp. 57-75. ISSN 0911-0119 *** ISI Impact 0,480 ***
de Groote, E. and Kuper, J. and Broersma, H.J. and Smit, G.J.M. (2012) Max-plus algebraic throughput analysis of synchronous dataflow graphs. In: 38th EUROMICRO Conference on Software Engineering and Advanced Applications (SEAA) , 5-8 Sept 2012, Cesme, Izmir, Turkey. pp. 29-38. IEEE Computer Society. ISBN 978-1-4673-2451-9
Li, Binlong and Broersma, H.J. and Zhang, Shenggui (2012) Pairs of forbidden induced subgraphs for homogeneously traceable graphs. Discrete mathematics, 312 (18). pp. 2800-2818. ISSN 0012-365X *** ISI Impact 0,600 ***

2011

Bonsma, P.S. and Broersma, H.J. and Patel, V. and Pyatkin, A. (2011) The complexity status of problems related to sparsest cuts. In: Proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, 26-28 July 2010, London, UK. pp. 125-135. Lecture Notes in Computer Science 6460. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-19221-0
Li, MingChu and Chen, Xiaodong and Broersma, H.J. (2011) Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. Journal of graph theory, 68 (4). pp. 285-298. ISSN 0364-9024 *** ISI Impact 0,796 ***

2010

Broersma, H.J. and Fomin, F.V. and van 't Hof, P. and Paulusma, D. (2010) Fast exact algorithms for hamiltonicity in claw-free graphs. In: Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), 24-26 June 2009, Montpellier, France. pp. 44-53. Lecture Notes in Computer Science 5911. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-11408-3
Broersma, H.J. and Paulusma, D. (2010) Computing sharp 2-factors in claw-free graphs. Journal of Discrete Algorithms, 8 (3). pp. 321-329. ISSN 1570-8667

2009

Broersma, H.J. and Fomin, F.V. and Golovach, P.A. and Paulusma, D. (2009) Three Complexity Results on Coloring $P_k$-Free Graphs. In: Combinatioral Algorithms - Proceedings of the 20th International Workshop , IWOCA 2009, June 28 - July 2 2009, Hradec nad Moravicí, Czech Republic. pp. 95-104. Lecture Notes in Computer Science 5874. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-10216-5
Broersma, H.J. and Fujisawa, J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. and Yoshimoto, K. (2009) λ-backbone colorings along pairwise disjoint stars and matchings. Discrete Mathematics, 309 (18). pp. 5596-5609. ISSN 0012-365X *** ISI Impact 0,600 ***
Broersma, H.J. and Johnson, M. and Paulusma, D. (2009) Upper bounds and algorithms for parallel knock-out numbers. Theoretical Computer Science, 410 (14). pp. 1319-1327. ISSN 0304-3975 *** ISI Impact 0,643 ***
Broersma, H.J. and Kratsch, D. and Woeginger, G.J. (2009) Fully decomposable split graphs. In: Combinatorial Algorithms - Proceedings of the 20th International Workshop IWOCA 2009, 28 June - 2 July 2009, Hradec nad Moravicí, Czech Republic. pp. 105-112. Lecture Notes in Computer Science 5874. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-10216-5
Broersma, H.J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. (2009) Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discussiones Mathematicae Graph Theory, 29 (1). pp. 143-162. ISSN 1234-3099 *** ISI Impact 0,349 ***
Broersma, H.J. and Paulusma, D. and Yoshimoto, K. (2009) Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs. Graphs and Combinatorics, 25 (4). pp. 427-460. ISSN 0911-0119 *** ISI Impact 0,480 ***
Broersma, H.J. and Vumar, E. (2009) On hamiltonicity of P3-dominated graphs Mathematical Methods of Operations Research, 69 (2). pp. 297-306. ISSN 1432-2994 *** ISI Impact 0,526 ***
Li, Xueliang and Yao, Xiangmei and Zhou, Wenli and Broersma, H.J. (2009) Complexity of conditional colorability of graphs. Applied Mathematics Letters, 22 (3). pp. 320-324. ISSN 0893-9659 *** ISI Impact 1,659 ***

2008

Broersma, H.J. and Capponi, A. and Paulusma, D. (2008) A new algorithm for on-line coloring bipartite graphs. SIAM Journal on Discrete Mathematics, 22 (1). pp. 72-91. ISSN 0895-4801 *** ISI Impact 0,793 ***
Broersma, H.J. and Fijavž, G. and Kaiser, T. and Kuzel, R. and Ryjácek, Z. and Vrána, P. (2008) Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. Discrete Mathematics, 308 (24). pp. 6064-6077. ISSN 0012-365X *** ISI Impact 0,600 ***
Broersma, H.J. and Johnson, M. and Paulusma, D. and Stewart, I.A. (2008) The computational complexity of the parallel knock-out problem. Theoretical Computer Science, 393 (1-3). pp. 182-195. ISSN 0304-3975 *** ISI Impact 0,643 ***
Broersma, H.J. and Paulusma, D. (2008) Computing sharp 2-factors in claw-free graphs. In: 33rd International Symposium on Mathematical Foundations of Computer Science, August 27-31, 2008, Torun, Poland. pp. 193-204. Lecture Notes in Computer Science 5162. Springer Verlag. ISSN 0302-9743 ISBN 978-3-540-85237-7
Li, MingChu and Xiong, Liming and Broersma, H.J. (2008) Connected even factors in claw-free graphs. Discrete Mathematics, 308 (11). pp. 2282-2284. ISSN 0012-365X *** ISI Impact 0,600 ***
Wang, Ligong and Broersma, H.J. and Hoede, C. and Li, X. and Still, G.J. (2008) Some families of integral graphs. Discrete Mathematics, 308 (24). pp. 6383-6391. ISSN 0012-365X *** ISI Impact 0,600 ***

2007

Bauer, D. and Broersma, H.J. and Kahl, N. and Morgana, A. and Schmeichel, E. and Surowiec, T. (2007) Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discrete Applied Mathematics, 155 (10). pp. 1336-1343. ISSN 0166-218X *** ISI Impact 0,722 ***
Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (2007) Tutte sets in graphs I: Maximal tutte sets and D-graphs. Journal of Graph Theory, 55 (4). pp. 343-358. ISSN 0364-9024 *** ISI Impact 0,796 ***
Broersma, H.J. and Fijavž, G. and Kaiser, T. and Kužel, R. and Ryjáček, Z. and Vrána, P. (2007) Contractible subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for snarks. In: Proceedings of the 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, 10-16 July 2006, Prague. pp. 55-59. Electric Notes in Discrete Mathematics 28. Elsevier. ISSN 1571-0653
Broersma, H.J. and Fomin, F.V. and Golovach, P.A. and Woeginger, G.J. (2007) Backbone colorings for graphs: Tree and path backbones. Journal of graph theory, 55 (2). pp. 137-152. ISSN 0364-9024 *** ISI Impact 0,796 ***
Broersma, H.J. and Fomin, F.V. and Královi?, R. and Woeginger, G.J. (2007) Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics, 155 (2). pp. 92-102. ISSN 0166-218X *** ISI Impact 0,722 ***
Broersma, H.J. and Johnson, M. and Paulusma, D. (2007) Upper bounds and algorithms for parallel knock-out numbers. In: SIROCCO 2007: 14th International Colloquium on Structural Information and Communication Complexity, 5-8 June 2007, Castiglioncello, Italy. pp. 328-340. Lecture Notes in Computer Science 4474. Springer Verlag. ISSN 0302-9743
Broersma, H.J. and Li, X. (2007) On the complexity of dominating set problems related to the minimum all-ones problem. Theoretical Computer Science, 385 (1-3). pp. 60-70. ISSN 0304-3975 *** ISI Impact 0,643 ***
Broersma, H.J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. (2007) Improved upper bounds for λ-backbone colorings along matchings and stars. In: Proceedings of SOFSEM 2007: Theory and Practice of Computer Science, 20-26 Jan 2007, Harrachov, Czech Republic. pp. 188-199. Lecture Notes in Computer Science 4362. Springer Verlag. ISSN 0302-9743 ISBN 978-3-540-69506-6
Broersma, H.J. and Paulusma, D. and Yoshimoto, K. (2007) On components of 2-factors in claw-free graphs. In: EuroComb 2007: European Conference on Combinatorics, Graph Theory and Applications, 11-15 September 2007, Seville, Spain. pp. 289-293. Electronic Notes in Discrete Mathematics 29. Elsevier. ISSN 1571-0653
Broersma, H.J. and Xiong, L. and Yoshimoto, K. (2007) Toughness and hamiltonicity in k-trees. Discrete Mathematics, 307 (7-8). pp. 832-838. ISSN 0012-365X *** ISI Impact 0,600 ***
Salman, A.N.M. and Broersma, H.J. (2007) On Ramsey numbers for paths versus wheels. Discrete Mathematics, 307 (7-8). pp. 975-982. ISSN 0012-365X *** ISI Impact 0,600 ***
Salman, A.N.M. and Broersma, H.J. (2007) Path-kipas Ramsey numbers. Discrete Applied Mathematics, 155 (14). pp. 1878-1884. ISSN 0166-218X *** ISI Impact 0,722 ***
Wang, Ligong and Broersma, H.J. and Hoede, C. and Li, X. and Still, G.J. (2007) Integral trees of diameter 6. Discrete Applied Mathematics, 155 (10). pp. 1254-1266. ISSN 0166-218X *** ISI Impact 0,722 ***

2006

Bauer, D. and Broersma, H.J. and Schmeichel, E. (2006) Toughness in graphs - A survey. Graphs and Combinatorics, 22 (1). pp. 1-35. ISSN 0911-0119 *** ISI Impact 0,480 ***
Borodin, O.V. and Broersma, H.J. and Glebov, A. and van den Heuvel, J. (2006) A new upper bound on the cyclic chromatic number. Journal of Graph Theory, 54 (1). pp. 58-72. ISSN 0364-9024 *** ISI Impact 0,796 ***
Brandt, S. and Broersma, H.J. and Diestel, R. and Kriesell, M. (2006) Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Combinatorica, 26 (1). pp. 17-36. ISSN 0209-9683 *** ISI Impact 0,719 ***
Broersma, H.J. and Capponi, A. and Paulusma, D. (2006) On-line coloring of H-free bipartite graphs. In: Proceedings of the 6th Italian Conference on Algorithms and Complexity (CIAC 2006), 29-31 May 2006, Rome, Italy. pp. 284-295. Lecture Notes in Computer Science 3998. Springer Verlag. ISSN 0302-9743 ISBN 3-540-34375-X
Broersma, H.J. and Fomin, F.V. and Kratochvil, J. and Woeginger, G.J. (2006) Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica, 44 (4). pp. 343-361. ISSN 0178-4617 *** ISI Impact 0,795 ***
Broersma, H.J. and Johnson, M. and Paulusma, D. and Stewart, I.A. (2006) The Computational Complexity of the Parallel Knock-Out Problem. In: Proceedings of the 7th Latin American Symposium (LATIN 2006), 20-24 March 2006, Valdivia, Chile. pp. 250-261. Lecture Notes in Computer Science 3887. Springer Verlag. ISSN 0302-9743
Salman, A.N.M. and Broersma, H.J. (2006) Path-fan Ramsey numbers. Discrete Applied Mathematics, 154 (9). pp. 1429-1436. ISSN 0166-218X *** ISI Impact 0,722 ***
Xiong, L. and Broersma, H.J. (2006) Subpancyclicity of line graphs and degree sums along paths. Discrete Applied Mathematics, 154 (9). pp. 1453-1463. ISSN 0166-218X *** ISI Impact 0,722 ***

2005

Guo, Y. and Smit, G.J.M. and Broersma, H.J. and Rosien, M.A.J. and Heysters, P.M. and Krol, T. (2005) Mapping applications to a coarse grain reconfigurable system. In: New Algorithms, Architectures and Applications for Reconfigurable Computing. Springer, Dordrecht, pp. 93-104. ISBN 978-1-4020-3127-4

2004

Broersma, H.J. and Paulusma, D. and Smit, G.J.M. and Vlaardingerbroek, F. and Woeginger, G.J. (2004) The Computational Complexity of the Minimum Weight Processor Assignment Problem. In: Proceedings of Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, 21-23 June 2004. pp. 189-200. Lecture Notes in Computer Science 3353 / 2004. Springer-Verlag. ISSN 0302-9743 ISBN 3-540-24132-9
Salman, A.N.M. and Broersma, H.J. (2004)
On Ramsey numbers for paths versus wheels.
Memorandum 1742, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Salman, A.N.M. and Broersma, H.J. (2004)
Path-kipas Ramsey numbers.
Memorandum 1743, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Smit, L.T. and Smit, G.J.M. and Hurink, J.L. and Broersma, H.J. and Paulusma, D. and Wolkotte, P.T. (2004) Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture. In: Proceedings of the International Conference on Field-Programmable Technology. pp. 421-424.
Smit, L.T. and Smit, G.J.M. and Hurink, J.L. and Broersma, H.J. and Paulusma, D. and Wolkotte, P.T. (2004) Run-time assignment of tasks to multiple heterogeneous processors. In: 5th PROGRESS Symposium on Embedded Systems, Nieuwegein, The Netherlands. pp. 185-192. ISBN 90-73461-41-3

2003

Broersma, H.J. (2003)
A general framework for coloring problems: old results, new results, and open problems.
Memorandum 1704, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Fomin, F.V. and Golovach, P.A. and Woeginger, G.J. (2003)
Backbone colorings for networks: tree and path backbones.
Memorandum 1705, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Fomin, F.V. and Kratochvil, J. and Woeginger, G.J. (2003)
Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult.
Memorandum 1701, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Fujisawa, J. and Yoshimoto, K. (2003)
Backbone colorings along perfect matchings.
Memorandum 1706, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Guo, Y. and Smit, G.J.M. and Broersma, H.J. and Rosien, M.A.J. and Heysters, P.M. (2003) Mapping Applications to a Coarse Grain Reconfigurable System. In: Proceedings of the Asia-Pacific Computer Systems Architecture Conference, 23-26 Sep 2003, Aizu-Wakamtsu. pp. 221-235. Lecture Notes in Computer Science 2823. Springer. ISSN 0302-9743 ISBN 3-540-20122-X
Guo, Y. and Smit, G.J.M. and Heysters, P.M. and Broersma, H.J. (2003) A Graph Covering Algorithm for a Coarse Grain Reconfigurable System. In: Proceedings of LCTES 2003, San Diego, USA. pp. 199-208. ACM. ISBN 1-58113-647-1
Salman, A.N.M. and Broersma, H.J. (2003)
Path-fan Ramsey numbers.
Memorandum 1703, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Salman, A.N.M. and Broersma, H.J. and Rodger, C.A. (2003)
A continuation of spanning 2-connected subgraphs in truncated rectangular grid graphs.
Memorandum 1700, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Salman, A.N.M. and Broersma, H.J. and Rodger, C.A. (2003)
More on spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs.
Memorandum 1702, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2002

Bodlaender, H.L. and Broersma, H.J. and Fomin, F.V. and Pyatkin, A.V. and Woeginger, G.J. (2002)
Radio labeling with pre-assigned frequencies.
Memorandum 1636, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Borodin, O.V. and Broersma, H.J. and Glebov, A. and van den Heuvel, J. (2002)
Stars and bunches in planar graphs. Part I: Triangulations.
Memorandum 1632, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Borodin, O.V. and Broersma, H.J. and Glebov, A. and van den Heuvel, J. (2002)
Stars and bunches in planar graphs. Part II: General planar graphs and colourings.
Memorandum 1633, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Fomin, F.V. and Nešetřil, J. and Woeginger, G.J. (2002)
More about subcolorings.
Memorandum 1635, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002)
Spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs.
Memorandum 1629, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002)
Spanning 2-connected subgraphs in truncated rectangular grid graphs.
Memorandum 1630, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002)
More on spanning 2-connected subgraphs in truncated rectangular grid graphs.
Memorandum 1637, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Smit, L.T. and Smit, G.J.M. and Havinga, P.J.M. and Hurink, J.L. and Broersma, H.J. (2002) Run-Time Control For Software Defined Radio. In: 3rd PROGRESS workshop on Embedded Systems, Veldhoven, The Netherlands. pp. 218-223. Technology Foundation STW. ISBN 90-73461-34-0
Smit, L.T. and Smit, G.J.M. and Havinga, P.J.M. and Hurink, J.L. and Broersma, H.J. (2002) Influences of RAKE Receiver/Turbo Decoder Parameters on Energy Consumption and Quality. In: 2002 International Conference On Third Generation Wireless and Beyond, 28-31 May 2002, San Francisco, USA. pp. 175-180. Delson. ISSN 1529-2592
Surahmat, and Baskoro, E.T. and Broersma, H.J. (2002)
The Ramsey numbers of large star-like trees versus large odd wheels.
Memorandum 1621, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Surahmat, and Baskoro, E.T. and Broersma, H.J. (2002)
The Ramsey numbers of large cycles versus small wheels.
Memorandum 1634, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Xiong, L. and Ryjá?ek, Z. and Broersma, H.J. (2002)
On stability of the Hamiltonian index under contractions and closures.
Memorandum 1622, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2001

Broersma, H.J. and Xiong, L. and Yoshimoto, K. (2001)
Toughness and hamiltonicity in $k$-trees.
Memorandum 1576, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Xiong, L. and Broersma, H.J. and Hoede, C. (2001)
Subpancyclicity in the line graph of a graph with large degree sums of vertices along a path.
Memorandum 1606, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Xiong, L. and Broersma, H.J. and Li, X. (2001)
The Hamiltonian index of a graph and its branch-bonds.
Memorandum 1611, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2000

Bauer, D. and Broersma, H.J. and Schmeichel, E. (2000) More progress on tough graphs -- The Y2K report. Memorandum 1536, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Ryjá?ek, Z. (2000)
Strengthening the closure concept in claw-free graphs.
Memorandum 1512, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Zhang, Shenggui and Li, X. (2000)
A $\sigma_3$ type condition for heavy cycles in weighted graphs.
Memorandum 1514, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Zhang, Shenggui and Li, X. and Wang, Ligong (2000) A fan type condition for heavy cycles in weighted graphs. Memorandum 1513, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Li, X. and Zhang, Shenggui and Broersma, H.J. (2000) Directed paths with few or many colors in colored directed graphs. Memorandum 1543, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

1999

Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (1999)
Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion.
Memorandum 1499, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. (1999) On some intriguing problems in Hamiltonian graph theory -- A survey. Memorandum 1508, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Bruin, N. and Hurink, J.L. and Meester, L.E. and Op de Beek, S.S. and Westhuis, J.H. (1999)
Throughput of ADSL modems.
Memorandum 1482, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Faudree, R.J. and Huck, A. and Trommel, H. and Veldman, H.J. (1999)
Forbidden subgraphs that imply Hamiltonian-connectedness.
Memorandum 1481, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Kriesell, M. and Ryjá?ek, Z. (1999)
On factors of 4-connected claw-free graphs.
Memorandum 1491, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Xiong, L. (1999)
On minimum degree conditions for supereulerian graphs.
Memorandum 1507, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

1998

Böhme, T. and Broersma, H.J. and Tuinstra, H. (1998) A note on a conjecture concerning tree-partitioning 3-regular graphs. Memorandum 1427, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Li, X. (1998)
Isomorphisms and traversability of directed path graphs.
Memorandum 1433, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Broersma, H.J. and Li, X. (1998)
Some approaches to a conjecture on short cycles in digraphs.
Memorandum 1479, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Zhang, Shenggui and Li, X. and Broersma, H.J. (1998)
Heavy paths and cycles in weighted graphs.
Memorandum 1428, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690