EEMCS

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

EEMCS EPrints Service


Research Project: NASCENCE: Nanoscale Engineering For Novel Computation Using Evolution
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

2016

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

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 ***
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

Bonsma, P.S. (2014) Independent Set Reconfiguration in Cographs. In: Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, 25-27 Jun 2014, Nouan-le-Fuzelier, France. pp. 105-116. Lecture Notes in Computer Science 8747. Springer International Publishing. ISSN 0302-9743 ISBN 978-3-319-12339-4
Bonsma, P.S. and Kamiński, M. and Wrochna, M. (2014) Reconfiguring Independent Sets in Claw-Free Graphs. In: Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2014, 2-4 Jul 2014, Copenhagen, Denmark. pp. 86-97. Lecture Notes in Computer Science 8503. Springer International Publishing. ISSN 0302-9743 ISBN 978-3-319-08403-9
Bonsma, P.S. and Mouawad, A.E. and Nishimura, N. and Raman, V. (2014) The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. In: Proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, 10-12 Sep 2014, Wroclaw, Poland. pp. 110-121. Lecture Notes in Computer Science 8894. Springer International Publishing. ISSN 0302-9743 ISBN 978-3-319-13523-6
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

Berkholz, C. and Bonsma, P.S. and Grohe, M. (2013) Tight lower and upper bounds for the complexity of canonical colour refinement. In: Proceedings of the 21st Annual European Symposium on Algorithms (ESA 2013), 2-4 Sep 2013, Sophia Antipolis, France. pp. 145-156. Lecture Notes in Computer Science 8125. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-40449-8
Bodlaender, H.L. and Bonsma, P.S. and Lokshtanov, D. (2013) The fine details of fast dynamic programming over tree decompositions. In: Proceedings of the 8th International Symposium on Parameterized and Exact Computation (IPEC 2013), 4-6 Sep 2013, Sophia Antipolis, France. pp. 41-53. Lecture Notes in Computer Science 8246. Springer Verlag. ISSN 0302-9743 ISBN 978-3-319-03897-1
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, 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 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 ***

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 ***
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 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 ***
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 ***