I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Bonsma, Paul
62
results:
Search for persons
X
Format
Online (62)
Mediatypes
Articles (Online) (24)
Bookchapter (Online) (1)
OpenAccess-fulltext (37)
Sorted by: Relevance
Sorted by: Year
?
1
Using contracted solution graphs for solving reconfiguratio..:
Bonsma, Paul
;
Paulusma, Daniël
Acta Informatica. 56 (2019) 7-8 - p. 619-648 , 2019
Link:
https://doi.org/10.1007/..
?
2
Rerouting shortest paths in planar graphs:
Bonsma, Paul
Discrete Applied Mathematics. 231 (2017) - p. 95-112 , 2017
Link:
https://doi.org/10.1016/..
?
3
Tight Lower and Upper Bounds for the Complexity of Canonica..:
Berkholz, Christoph
;
Bonsma, Paul
;
Grohe, Martin
Theory of Computing Systems. 60 (2016) 4 - p. 581-614 , 2016
Link:
https://doi.org/10.1007/..
?
4
A 2-Approximation Algorithm for Finding a Spanning Tree wit..:
Solis-Oba, Roberto
;
Bonsma, Paul
;
Lowski, Stefanie
Algorithmica. 77 (2015) 2 - p. 374-388 , 2015
Link:
https://doi.org/10.1007/..
?
5
Independent Set Reconfiguration in Cographs and their Gener..:
Bonsma, Paul
Journal of Graph Theory. 83 (2015) 2 - p. 164-195 , 2015
Link:
https://doi.org/10.1002/..
?
6
A Constant-Factor Approximation Algorithm for Unsplittable ..:
Bonsma, Paul
;
Schulz, Jens
;
Wiese, Andreas
SIAM Journal on Computing. 43 (2014) 2 - p. 767-799 , 2014
Link:
https://doi.org/10.1137/..
?
7
The complexity of rerouting shortest paths:
Bonsma, Paul
Theoretical Computer Science. 510 (2013) - p. 1-12 , 2013
Link:
https://doi.org/10.1016/..
?
8
Improved bounds for spanning trees with many leaves:
Bonsma, Paul
;
Zickfeld, Florian
Discrete Mathematics. 312 (2012) 6 - p. 1178-1194 , 2012
Link:
https://doi.org/10.1016/..
?
9
The complexity of finding uniform sparsest cuts in various ..:
Bonsma, Paul
;
Broersma, Hajo
;
Patel, Viresh
.
Journal of Discrete Algorithms. 14 (2012) - p. 136-149 , 2012
Link:
https://doi.org/10.1016/..
?
10
Max-leaves spanning tree is APX-hard for cubic graphs:
Bonsma, Paul
Journal of Discrete Algorithms. 12 (2012) - p. 14-23 , 2012
Link:
https://doi.org/10.1016/..
?
11
Tight bounds and a fast FPT algorithm for directed Max-Leaf..:
Bonsma, Paul
;
Dorn, Frederic
ACM Transactions on Algorithms (TALG). 7 (2011) 4 - p. 1-19 , 2011
Link:
https://dl.acm.org/doi/1..
?
12
Counting Hexagonal Patches and Independent Sets in Circle G..:
Bonsma, Paul
;
Breuer, Felix
Algorithmica. 63 (2011) 3 - p. 645-671 , 2011
Link:
https://doi.org/10.1007/..
?
13
Tight bounds and a fast FPT algorithm for directed Max-Leaf..:
Bonsma, Paul
;
Dorn, Frederic
ACM Transactions on Algorithms. 7 (2011) 4 - p. 1-19 , 2011
Link:
https://doi.org/10.1145/..
?
14
Extremal graphs having no matching cuts:
Bonsma, Paul
;
Farley, Arthur M.
;
Proskurowski, Andrzej
Journal of Graph Theory. 69 (2011) 2 - p. 206-222 , 2011
Link:
https://doi.org/10.1002/..
?
15
A 3/2-Approximation Algorithm for Finding Spanning Trees wi..:
Bonsma, Paul
;
Zickfeld, Florian
SIAM Journal on Discrete Mathematics. 25 (2011) 4 - p. 1652-1666 , 2011
Link:
https://doi.org/10.1137/..
1-15