Paul S. Bonsma
Affiliations:- University of Twente, Faculty of Electrical Engineering, Mathematics and Computer Science
- Humboldt University Berlin, Computer Science Department
According to our database1,
Paul S. Bonsma
authored at least 40 papers
between 2002 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
2002
2004
2006
2008
2010
2012
2014
2016
2018
0
1
2
3
4
5
6
7
1
3
1
2
1
5
2
2
2
3
3
1
1
1
1
3
1
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2019
Acta Informatica, 2019
2017
Theory Comput. Syst., 2017
A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.
Algorithmica, 2017
2016
J. Graph Theory, 2016
2014
SIAM J. Comput., 2014
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
Proceedings of the Algorithm Theory - SWAT 2014, 2014
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014
2013
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013
2012
J. Discrete Algorithms, 2012
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
2011
ACM Trans. Algorithms, 2011
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.
SIAM J. Discret. Math., 2011
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011
2010
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010
2009
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances.
Theor. Comput. Sci., 2009
The complexity of the matching-cut problem for planar graphs and other graph classes.
J. Graph Theory, 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
SIAM J. Discret. Math., 2008
CoRR, 2008
Proceedings of the LATIN 2008: Theoretical Informatics, 2008
2007
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances.
Electron. Notes Discret. Math., 2007
Electron. Notes Discret. Math., 2007
Most balanced minimum cuts and partially ordered knapsack.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007
2006
Discret. Appl. Math., 2006
2004
2003
Electron. Notes Discret. Math., 2003
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
2002