The project CUTACOMBS, Cuts and decompositions: algorithms and combinatorial properties received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and … Read more >>
Lower bounds for cut sparsifiers and a Steiner tree in planar graphs
Our paper on lower bounds for cut sparsifiers has been accepted to IPEC 2017.
Steiner tree does not admit a subexponential algorithm in planar graphs, when parameterized by the number of terminals, but Directed Subset TSP does. Details in our new preprint.
The grant starts
ERC Starting Grant CUTACOMBS started as of 1st March 2017.
We present here obtained results and people involved in the project.
Please check out also our permanent postdoc ad.