EEMCS

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

EEMCS EPrints Service


Author: Bonsma, P.S.
Home Policy Brochure Browse Search User Area Contact Help

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
Bonsma, P.S. and Schulz, J. and Wiese, A. (2014) A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths. SIAM Journal on Computing, 43 (2). pp. 767-799. ISSN 0097-5397 *** ISI Impact 0,841 ***

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
Bonsma, P.S. (2013) The complexity of rerouting shortest paths. Theoretical computer science, 510. pp. 1-12. ISSN 0304-3975 *** ISI Impact 0,643 ***

2012

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

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

2006

Bonsma, P.S. (2006) Spanning trees with many leaves: new extremal results and an improved FPT algorithm. Memorandum 1793, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Bonsma, P.S. (2006) Sparse cuts, matching-cuts and leafy trees in graphs. PhD thesis, University of Twente. ISBN 90-365-2370-2
Bonsma, P.S. and Epping, T. and Hochstättler, W. (2006) Complexity results on restricted instances of a paint shop problem for words. Discrete Applied Mathematics, 154 (9). pp. 1335-1343. ISSN 0166-218X *** ISI Impact 0,722 ***

2005

Bonsma, P.S. (2005) A characterization of extremal graphs without matching-cuts. Memorandum 1769, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2003

Bonsma, P.S. (2003)
Complexity results for restricted instances of a paint shop problem.
Memorandum 1681, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2002

Bonsma, P.S. (2002)
The complexity of the matching-cut problem for planar graphs and other graph classes.
Memorandum 1655, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690