Joachim Spoerhase und Krzysztof Fleszar - Info zur Person

(1 - 18 von 18

)

Tutte Colloquium - Matthias Mnich | Combinatorics and Optimization |...

uwaterloo.ca

— Joint work with Joachim Spoerhase (Aalto) and Krzysztof Fleszar (Warsaw). Location. MC - Mathematics & Computer Building.

Bartosz Rybicki | AceMap

acemap.openacademic.ai

Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase Improved Approximation Algorithm For K Level Ufl With Penalties A Simplistic ...

Sankar Veeramoni's: Refereed Publications

www2.cs.arizona.edu

Aparna Das, Krzysztof Fleszar, Stephen Kobourov, Joachim Spoerhase, Sankar Veeramoni and Alexander Wolff. Polylogarithmic Approximation for Generalized ...

EU H2020 Project "ALGOCOM (Novel Algorithmic Techniques ...www.fabiodisconzi.com › open-h2020 › projects

www.fabiodisconzi.com

2018, Timothy Chan, Thomas van Dijk, Krzysztof Fleszar, Joachim Spoerhase, ... not embedded into any word file), twitter account, linkedin page, etc.

[ ] 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:

Search results for "Philipp Kindermann" – FacetedDBLP

dblp.l3s.uni-hannover.de

Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff: Colored Non-Crossing Euclidean Steiner Forest. CoRR : …

Approximating the Generalized Minimum Manhattan Network Problem |...

link.springer.com

Approximating the Generalized Minimum Manhattan Network Problem. Authors; Authors and affiliations. Aparna Das; Krzysztof Fleszar; Stephen Kobourov; Joachim Spoerhase; Sankar Veeramoni; Alexander Wolff. Aparna Das. 1. Krzysztof Fleszar. 2. Stephen Kobourov. 1. Joachim Spoerhase. 2. Sankar Veeramoni. 1.

Theory, Geometry and others

theoreticalcomputerscientist.wordpress.com

... Krzysztof Fleszar, Bartosz Rybicki and Joachim Spoerhase. Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems.

ALGO 2016

cs.au.dk

Faster External Memory LCP Array Construction · Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase New Algorithms for Maximum Disjoint Paths Based on ...

Approximating the generalized minimum Manhattan network problem...

experts.arizona.edu

Aparna Das, Krzysztof Fleszar, Stephen G Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff. Computer Science. Research output: Chapter in ...

ALGO - Research - TUHH

www.tuhh.de

Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase: New algorithms for maximum disjoint paths based on tree-likeness. ESA › algo › resear...

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

tmc.web.engr.illinois.edu

Stabbing rectangles by line segments: How decomposition reduces the shallow-cell complexity. (with Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, and ...

Stabbing rectangles by line segments - How decomposition reduces the...

experts.illinois.edu

Timothy Moon-Yew Chan, Thomas C. Van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff. Computer Science. Research output: ...

DataCite Search

search.datacite.org

Krzysztof Fleszar, Matthias Mnich & Joachim Spoerhase. ConferencePaper published via Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany. We study the classical NP-hard problems of finding maximum-size subsets from given sets of k terminal pairs that can be routed via ...

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 Krzysztof Fleszar Person-Info