- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems ; 2008, 19
Preprint Reihe Mathematik ; 2008, 19
- Klassifikation
-
Mathematik
- Urheber
-
Bonsma, Paul
Dorn, Frederic
- DOI
-
10.14279/depositonce-14414
- Handle
-
11303/15641
- URN
-
urn:nbn:de:101:1-2021122202080242961436
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:35 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bonsma, Paul
- Dorn, Frederic
Ähnliche Objekte (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 Bounds for Online Coloring of Basic Graph Classes
Tight multi-user security bound of DbHtS
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 Bounds for Online Coloring of Basic Graph Classes
Tight multi-user security bound of DbHtS
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 Bounds for Online Coloring of Basic Graph Classes
Tight multi-user security bound of DbHtS
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