Paul Bonsma - Concepedia

Author

Paul Bonsma

Humboldt-Universität zu Berlin

Also Known As

Bonsma, Paul, P. Bonsma, Paul Bonsma, Paul S. Bonsma, Paul Simon Bonsma

Publications

Citations

H-Index

Concepts

All Affiliations

Humboldt-Universität zu Berlin University of Twente Technische Universität Berlin RWTH Aachen University Durham University

About

Paul Bonsma is an author at Humboldt-Universität zu Berlin specializing in engineering, combinatorial optimization, and discrete mathematics.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	12	17	597
2	Education	7	7	99
3	Business	2	2	69
4	Computer Engineering	2	2	74
5	Natural Sciences	1	1	77

Paul Bonsma

Publications

614

Citations

H-Index

Page 1

	Year	Citations
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances Paul Bonsma, Luis Cereceda Theoretical Computer Science EngineeringGraph TheoryExtremal Graph TheoryStructural Graph TheoryTopological Graph Theory	2009	167
Edge-cuts leaving components of order at least three Paul Bonsma, Nicola Ueffing, Lutz Volkmann Discrete Mathematics Geometric ModelingEngineeringGraph TheoryEdge DetectionGeometric Algorithm	2002	77
The complexity of rerouting shortest paths Paul Bonsma Theoretical Computer Science Network Routing AlgorithmNetwork ScienceEngineeringRoute PlanningNetwork Routing	2013	55
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement Christoph Berkholz, Paul Bonsma, Martin Grohe Theory of Computing Systems Colour Refinement AlgorithmsEngineeringColor CorrectionComputational ComplexityGraph Matching	2016	47
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths Paul Bonsma, Jens Schulz, Andreas Wiese Numerical AnalysisMathematical ProgrammingEngineeringComputational ComplexityComputational Mechanics	2011	43
A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths Paul Bonsma, Jens Schulz, Andreas Wiese SIAM Journal on Computing Numerical AnalysisMathematical ProgrammingEngineeringComputational ComplexityDiscrete Optimization	2014	31
Complexity results on restricted instances of a paint shop problem for words Paul Bonsma, Th. Epping, Winfried Hochstättler Discrete Applied Mathematics Mathematical ProgrammingComplexity ResultsCombinatorics On WordComputational Complexity TheoryEngineering	2006	26
Independent Set Reconfiguration in Cographs and their Generalizations Paul Bonsma Journal of Graph Theory Mathematical ProgrammingEngineeringComputational ComplexityIndependent SetsStructural Graph Theory	2015	26
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three Paul Bonsma SIAM Journal on Discrete Mathematics EngineeringMinimum Degree ThreePlanar GraphNetwork AnalysisEducation	2008	22
Max-leaves spanning tree is APX-hard for cubic graphs Paul Bonsma Journal of Discrete Algorithms Mathematical ProgrammingEngineeringGraph TheoryExtremal Graph TheoryStructural Graph Theory	2011	19

Page 1