1
0
0
(1 - 15 von 17
)
Publications - Carleton University
people.scs.carleton.ca
Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel Smid, Fabian Stehn. Fast algorithms for diameter-optimally augmenting paths. ICALP 2015, to ...
Dr. David Kübel - Algorithms and Complexity - Universität BonnUniversität Bonn
tcs.cs.uni-bonn.de
15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), Reykjavik, Iceland, Christian Knauer, David Kübel, Fabian Stehn › doku.php › staff › kuebeld
Search the dblp DataBaseauth.gr
sceas.csd.auth.gr
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. › php › se...
Algorithms - ESA 2008: 16th Annual European Symposium, Karlsruhe,...
books.google.de
This book constitutes the refereed proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September in...
Experimental Algorithms: 8th International Symposium SEA 2009,...
books.google.nl
101 Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, and Fabian Stehn A Heuristic Strong Connectivity Algorithm for Large Graphs Adan Cosgaya-Lozano and Norbert Zeh Pareto Paths with SHARC Daniel Delling and Dorothea Wagner An Application of ...
Algorithms and Data Structures: 14th International Symposium, WADS...
books.google.nl
Elastic. Geometric. Shape. Matching. for. Point. Sets. under. Translations. Christian Knauer and Fabian Stehn(B) Institut Für Informatik, Universität Bayreuth, Bayreuth, Germany {christian.knauer ...
Augmenting Outerplanar Graphs to Meet Diameter ...Wiley
onlinelibrary.wiley.com
von T Ishii · · Zitiert von: 11 — Ulrike Große, Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel Smid, Fast Algorithms for Diameter-Optimally Augmenting Paths and ... › jgt
dblp: Symposium on Experimental and Efficient Algorithms 2009
dblp.uni-trier.de
Bibliographic content of Symposium on Experimental and Efficient Algorithms 2009
Algorithms and Data Structures - Fabian Stehn
www.ai6.uni-bayreuth.de
. Phone: + Fax: + Office hours: Wednesday 11h - 12h (during the semester break only by ...
SEA – 8th International Symposium on Experimental Algorithms
www.sea2009.org
8th International Symposium on Experimental Algorithms
Fast Algorithms for Diameter-Optimally Augmenting Paths ...World Scientific
www.worldscientific.com
von U Große · · Zitiert von: 10 — Ulrike Große · Christian Knauer · Fabian Stehn · Joachim Gudmundsson · Michiel Smid. › ...
ICALP Accepted Papers for Track A: Algorithms, ...京都大学
www.kurims.kyoto-u.ac.jp
Ulrike Grosse, Joachim Gudmundsson, Christian Knauer, Michiel Smid and Fabian Stehn. Fast Algorithms for Diameter-Optimally Augmenting Trees. › ...
WADS 2015: 14th International Symposium on Algorithms and Data...
wads2015.cs.uvic.ca
Chenglin Fan, Omtit Filtser, Matthew Katz, Tim Wylie and Binhai Zhu. Finding Articulation Points of Large Graphs in Linear Time Martin Farach-Colton, Tsan-Sheng Hsu, Meng Li and Meng-Tsung Tsai, Elastic Geometric Shape Matching for Point Sets under Translations Fabian Stehn and Christian Knauer. 12: :
[ ] Fast Algorithms for Diameter-Optimally Augmenting Paths...
128.84.21.199
Authors: Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel Smid, Fabian Stehn. (Submitted on 19 Jul 2016). Abstract: We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting ...
Alle Infos zum Namen "Fabian Stehn"
sortiert nach Relevanz / Datum