Nikolai Karpov und Marcin Pilipczuk - Info zur Person

(1 - 7 von 8

)

[ ] An exponential lower bound for cut sparsifiers in planar...

arxiv.org

Authors:Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz. (Submitted on 19 Jun (v1), last revised 30 Dec (this version, v3)). Abstract: Given an ...

An Exponential Lower Bound for Cut SpringerLink

link.springer.com

von N Karpov · · Zitiert von: 10 — An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. Nikolai Karpov,; Marcin Pilipczuk &; Anna Zych-Pawlewicz. › article

An Exponential Lower Bound for Cut Sparsifiers in Planar Graphsdrops.dagstuhl.de › opus › volltexte

drops.dagstuhl.de

@InProceedings{karpov_et_al:LIPIcs:2018:8560, author = {Nikolai Karpov and Marcin Pilipczuk and Anna Zych-Pawlewicz}, title = {{An Exponential Lower Bound ...

Accepted Papers | ALGO 2017

algo2017.ac.tuwien.ac.at

Nikolai Karpov, Marcin Pilipczuk and Anna Zych-Pawlewicz: An exponential lower bound for cut sparsifiers in planar graphs. Given an edge-weighted graph ...

[PDF] An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs...

www.semanticscholar.org

Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz; Published 19 June 2017; Computer Science; Algorithmica. Given an edge-weighted graph G with a set ... › ...