Joachim Spoerhase und Algorithms - Info zur Person

(1 - 23 von 33

)

CALDAM : 5th Annual International Conference on Algorithms ...www.wikicfp.com › cfp › servlet › event.showcfp

www.wikicfp.com

Facebook · Twitter · LinkedIn · Google ... Joachim Spoerhase, University of Würzburg, Germany C R Subramanian, IMSc Chennai, India

CS News - 5 June Department of Computer Scienceaalto-wiki.demo.aitiofinland.com › › CS...

aalto-wiki.demo.aitiofinland.com

· Joachim Spoerhase, Aalto University: Approximation Algorithms for some Submodular and Graph-based Optimization Problems

Improved approximation algorithms for box contact representationsarizona.pure.elsevier.com › publications › improved...

experts.arizona.edu

Michael A. Bekos, Thomas C. Van Dijk, Martin Fink, Philipp Kindermann, Stephen Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff.

Spoerhase, Joachim - Chair of Computer Science I - Algorithms and...

www.informatik.uni-wuerzburg.de

22 set — Joachim Spoerhase. Lehrstuhl für Informatik I Universität Würzburg Am Hubland Würzburg Germany. Room: E33. Tel.: +49 (0) set — Joachim Spoerhase. Lehrstuhl für Informatik I Universität Würzburg Am Hubland D Würzburg. Raum: E33. Tel.: +49 (0) › ...

References

wwwmayr.in.tum.de

mann, Stephen Kobourov, Sergey Pupyrev, Joachim Spoerhase, and. Alexander Wolff. Improved approximation algorithms for box contact. representations. In Andreas S. Schulz and Dorothea Wagner, editors,. Proceedings of the 22nd Annual European Symposium on Algorithms,. ESA'2014 (Wroclaw, Poland, September ...

Algorithms and Data Structures: 11th International Symposium, WADS...

books.google.de

This book constitutes the refereed proceedings of the 11th Algorithms and Data Structures Symposium, WADS 2009, held in Banff, Canada, in August The...

Approximation and Online Algorithms: 16th International Workshop,...

books.google.de

This book constitutes the thoroughly refereed workshop post-proceedings of the 16th International Workshop on Approximation and Online Algorithms, WAOA 2018,...

Approximation, Randomization, and Combinatorial Optimization....

books.google.de

This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems,...

[ ] New Algorithms for Maximum Disjoint Paths Based on...

arxiv.org

Authors: Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase. (Submitted on 5 Mar (v1), last revised 20 May (this version, v2)). Abstract: We study the classical NP-hard problems of finding maximum-size subsets from given sets of terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or ...

Pieczątka Firmowa Jednostki - ii.uni.wroc.pl file4 (LTE ...dokumen.tips › Documents

dokumen.tips

Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase // W: SODA '15 Proceedings of the Twen-. ty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ...

Search results for "Joachim Spoerhase" – FacetedDBLP

dblp.l3s.uni-hannover.de

Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase: New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. CoRR : 2016: DBLP BibTeX RDF: 1:

Improved Approximation Algorithms for Box Contact Representations -...

www.fernuni-hagen.de

@Article{bdfkkpsw-iaabcr-a17, Title = {Improved Approximation Algorithms for Box Contact Representations}, Author = {Michael A. Bekos and Thomas C. van Dijk and Martin Fink and Philipp Kindermann and Stephen G. Kobourov and Sergey Pupyrev and Joachim Spoerhase and Alexander Wolff}, Journal = {Algorithmica}, Year = {2017}, Number = {3}, Pages ...

Colored Non-Crossing Euclidean Steiner Forest

www.fernuni-hagen.de

Joachim Spoerhase Alexander Wolff; Kategorie: Konferenzbandbeiträge; erschienen in: Proceedings of the 26th International Symposium on Algorithms and ... › BF...

Approximation Algorithms for the Maximum Leaf Spanning ...

link.springer.com

von N Schwartges · · Zitiert von: 8 — Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. Nadine Schwartges,; Joachim Spoerhase &; Alexander Wolff. von M Knauer · · Zitiert von: 21 — Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. Martin Knauer &; Joachim Spoerhase. Conference paper Accesses. › chapter

Martin Fink
Axel Schmitz-Tewes
Jan-Henrik Haunert

Personen
Vorname "Joachim" (33841)
Name "Spoerhase" (16)

sortiert nach Relevanz / Datum

Erweiterte Suche

Person-Suchen: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Joachim Spoerhase und Algorithms Person-Info

CALDAM : 5th Annual International Conference on Algorithms ...www.wikicfp.com › cfp › servlet › event.showcfp

CS News - 5 June Department of Computer Scienceaalto-wiki.demo.aitiofinland.com › › CS...

Improved approximation algorithms for box contact representationsarizona.pure.elsevier.com › publications › improved...

Spoerhase, Joachim - Chair of Computer Science I - Algorithms and...

References

Algorithms and Data Structures: 11th International Symposium, WADS...

Approximation and Online Algorithms: 16th International Workshop,...

Approximation, Randomization, and Combinatorial Optimization....

[ ] New Algorithms for Maximum Disjoint Paths Based on...

Pieczątka Firmowa Jednostki - ii.uni.wroc.pl file4 (LTE ...dokumen.tips › Documents

Search results for "Joachim Spoerhase" – FacetedDBLP

Improved Approximation Algorithms for Box Contact Representations -...

Colored Non-Crossing Euclidean Steiner Forest

Approximation Algorithms for the Maximum Leaf Spanning ...

Theory, Geometry and others

ALGO 2016

Approximation Algorithms for the Maximum Leaf Spanning Tree Problem...

ALGO - Research - TUHH

Approximation algorithms for NP-hard geometric problemstmc.web.engr.illinois.edu › pub_approx

New Algorithms for Maximum Disjoint Paths Based on Tree dblp › rec › conf › esa › FleszarMS16

Graph colouring problem: 6 and 5 colouring theorems and algorithms -...

New algorithms for maximum disjoint paths based on tree ...

au:Fleszar_K in:cs - SciRate Search

Alle Infos zum Namen "Joachim Spoerhase"