EEMCS

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

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

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

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

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