- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems ; 2008, 19
Preprint Reihe Mathematik ; 2008, 19
- Classification
-
Mathematik
- Creator
-
Bonsma, Paul
Dorn, Frederic
- DOI
-
10.14279/depositonce-14414
- Handle
-
11303/15641
- URN
-
urn:nbn:de:101:1-2021122202080242961436
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
2025-08-15T07:35:39+0200
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bonsma, Paul
- Dorn, Frederic
Other Objects (12)
Landmark Hub Labeling : Improved Bounds and Faster Query Answering
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Studies enabling a faster directed evolution : evolving stereoconvergent epoxide hydrolases
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
An FPT Algorithm for Directed Spanning k-Leaf
A tight lower bound for semi-synchronous collaborative grid exploration
Landmark Hub Labeling : Improved Bounds and Faster Query Answering
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Studies enabling a faster directed evolution : evolving stereoconvergent epoxide hydrolases
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
An FPT Algorithm for Directed Spanning k-Leaf
A tight lower bound for semi-synchronous collaborative grid exploration
Landmark Hub Labeling : Improved Bounds and Faster Query Answering
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Studies enabling a faster directed evolution : evolving stereoconvergent epoxide hydrolases
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
An FPT Algorithm for Directed Spanning k-Leaf