default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGems of Combinatorial Optimization and Graph Algorithms 2015
- Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner:
Gems of Combinatorial Optimization and Graph Algorithms. Springer 2015, ISBN 978-3-319-24970-4 - Stefan Felsner:
Shifting Segments to Optimality. 1-12 - Ekkehard Köhler:
Linear Structure of Graphs and the Knotting Graph. 13-27 - Sándor P. Fekete:
Finding Longest Geometric Tours. 29-36 - Matthias Müller-Hannemann
:
Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics. 37-47 - Guido Schäfer:
Budgeted Matching via the Gasoline Puzzle. 49-57 - Karsten Weihe:
Motifs in Networks. 59-68 - Ben Strasser, Dorothea Wagner:
Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies. 69-82 - Rudolf Müller, Marc Uetz:
Shortest Path to Mechanism Design. 83-94 - Andreas S. Schulz:
Selfish Routing and Proportional Resource Allocation. 95-102 - Tobias Harks, Britta Peis:
Resource Buying Games. 103-111 - Max Klimm:
Linear, Exponential, but Nothing Else. 113-123 - Martin Skutella:
Convex Quadratic Programming in Scheduling. 125-132 - Nicole Megow:
Robustness and Approximation for Universal Sequencing. 133-141 - Sebastian Stiller:
A Short Note on Long Waiting Lists. 143-150
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-07 23:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
