Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bonsma, Paul"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reconfiguring independent sets in claw-free graphs
Paul Bonsma
,
Marcin KamiĆski
,
Marcin Wrochna
Lecture Notes in Computer Science
8503
, 2014, pp. 86-97
A constant-factor approximation algorithm for unsplittable flow on paths
Paul Bonsma
,
Jens Schulz
,
Andreas Wiese
SIAM Journal on Computing
43
(2), 2014, pp. 767-799
Independent set reconfiguration in cographs
Paul Bonsma
Lecture Notes in Computer Science
8747
, 2014, pp. 105-116
Tight lower and upper bounds for the complexity of canonical colour refinement
Christoph Berkholz
,
Paul Bonsma
,
Martin Grohe
Lecture Notes in Computer Science
8125
, 2013, pp. 145-156
The complexity of rerouting shortest paths
Paul Bonsma
Theoretical Computer Science
510
, 2013, pp. 1-12
Counting hexagonal patches and independent sets in circle graphs
Paul Bonsma
,
Felix Breuer
Algorithmica
63
(3), 2012, pp. 645-671
Extremal graphs having no matching cuts
Paul Bonsma
,
Arthur M. Farley
,
Andrzej Proskurowski
Journal of Graph Theory
69
(2), 2012, pp. 206-222
Rerouting shortest paths in planar graphs
Paul Bonsma
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 337-349
The complexity of rerouting shortest paths
Paul Bonsma
Lecture Notes in Computer Science
7464
, 2012, pp. 222-233
Surface split decompositions and subgraph isomorphism in graphs on surfaces
Paul Bonsma
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 531-542
Feedback vertex set in mixed graphs
Paul Bonsma
,
Daniel Lokshtanov
Lecture Notes in Computer Science
6844
, 2011, pp. 122-133
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Paul Bonsma
,
Florian Zickfeld
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1652-1666
Counting hexagonal patches and independent sets in circle graphs
Paul Bonsma
,
Felix Breuer
Lecture Notes in Computer Science
6034
, 2010, pp. 603-614
Finding fullerene patches in polynomial time
Paul Bonsma
,
Felix Breuer
Lecture Notes in Computer Science
5878
, 2009, pp. 750-759
Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
Paul Bonsma
,
Luis Cereceda
Theoretical Computer Science
410
(50), 2009, pp. 5215-5226
The complexity of the matching-cut problem for planar graphs and other graph classes
Paul Bonsma
Journal of Graph Theory
62
(2), 2009, pp. 109-126
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
Paul Bonsma
,
Frederic Dorn
Lecture Notes in Computer Science
5193
, 2008, pp. 222-233
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Paul Bonsma
,
Florian Zickfeld
Lecture Notes in Computer Science
5344
, 2008, pp. 66-77
Spanning trees with many leaves in graphs with minimum degree three
Paul S. Bonsma
SIAM Journal on Discrete Mathematics
22
(3), 2008, pp. 920-937
Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
Paul Bonsma
,
Luis Cereceda
Lecture Notes in Computer Science
4708
, 2007, pp. 738-749
A faster FPT algorithm for finding spanning trees with many leaves
Paul S. Bonsma
,
Tobias Brueggemann
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
2747
, 2003, pp. 259-268
The complexity of the matching-cut problem for planar graphs and other graph classes
Paul Bonsma
Lecture Notes in Computer Science
2880
, 2003, pp. 93-105