Paul Bonsma — Center for Discrete Mathematics and Theoretical Computer Science

Area of research

Computational Theory and Mathematics · Computer Networks and Communications

Research interest

Research interests include Advanced Graph Theory Research, Complexity and Algorithms in Graphs, Optimization and Search Problems, and Interconnection Networks and Systems.

Recent publications

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

Theory of Computing Systems 2016cited by 47position: middledoi

Rerouting shortest paths in planar graphs

Discrete Applied Mathematics 2016cited by 17position: firstdoi

A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths

SIAM Journal on Computing 2014cited by 31position: firstdoi

The complexity of rerouting shortest paths

Theoretical Computer Science 2013cited by 55position: firstdoi

The Fine Details of Fast Dynamic Programming over Tree Decompositions

Lecture notes in computer science 2013cited by 26position: middledoi

The Complexity of Rerouting Shortest Paths

Lecture notes in computer science 2012cited by 29position: firstdoi

Grants

No grants ingested yet.

Frequent collaborators

Hans L. Bodlaender · Utrecht University1 papers (2013–2013)Christoph Berkholz · Technische Universität Ilmenau1 papers (2016–2016)Daniel Lokshtanov · University of California, Santa Barbara1 papers (2013–2013)— · 1 papers (2014–2014)Martin Grohe · Westfälische Hochschule1 papers (2016–2016)— · 1 papers (2014–2014)

Looking for a research collaborator?

Search millions of scientists by field, institution, impact, and funding status — see their work, find their email, and reach out directly.

Find collaborators in Computational Theory and Mathematics · Computer Networks and Communications →