Concepedia

Paul Bonsma

PB

18

Publications

614

Citations

13

H-Index

2002

Active since

Affiliations

Humboldt-Universität zu Berlin(Current)

University of Twente

Technische Universität Berlin

RWTH Aachen University

Durham University

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

Top concepts

EngineeringCombinatorial OptimizationDiscrete MathematicsComputational ComplexityGraph TheoryComputer ScienceComputational GeometryMathematical ProgrammingNetwork AnalysisEducation

Publications per year

2002–2016

18

Publications

18

Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances

Paul Bonsma, Luis Cereceda · Theoretical Computer Science · 2009 · 167 citations

Engineering, Graph Theory, Extremal Graph Theory +7

Edge-cuts leaving components of order at least three

Paul Bonsma, Nicola Ueffing, Lutz Volkmann · Discrete Mathematics · 2002 · 77 citations

Geometric Modeling, Engineering, Graph Theory +9

The complexity of rerouting shortest paths

Paul Bonsma · Theoretical Computer Science · 2013 · 55 citations

Network Routing Algorithm, Network Science, Engineering +7

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

Christoph Berkholz, Paul Bonsma, Martin Grohe · Theory of Computing Systems · 2016 · 47 citations · Full text

Colour Refinement Algorithms, Engineering, Color Correction +19

A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths

Paul Bonsma, Jens Schulz, Andreas Wiese · 2011 · 43 citations

Numerical Analysis, Mathematical Programming, Engineering +23

Rows per page

1–5 of 18