Approaches to Network Design (NEWNET)
ERC Starting Grant 279352
pervade every aspect of nowadays life. This is one of the reasons
why their design, management, and analysis is one of the most
active areas of theoretical and empirical research in Computer
Science and Operations Research. The main goal of this project is
to increase our theoretical understanding of networks, with a
special focus on faster exact/parametrized algorithms and more
accurate polynomial-time approximation algorithms for NP-hard
network problems. We will consider classic, challenging open
problems in the literature, as well as new, exciting problems
arising from the applications. These problems will be addressed
with the most advanced algorithmic and analytical tools. A second,
ambitious goal of this project is to stimulate the interaction and
cross-fertilization between parametrized/exact and approximation
The project focuses on (but is not limited to) the following three main research areas:
The project started on January 2012, and will end on December 2016. The total funding is about 1.1 million euros.
project supports PostDoc positions for about 6 years altogether.
The positions range from a few months to two years, with
possibility of an extension. The
gross salary is approximately 75.000 CHF per year (taxes around
20%-25%). No teaching duties. Generous travel support. Here
you can find the formal call. Please, e-mail all the required
documents also at:
For any question, please contact me at: email@example.com
project supports one Ph.D. position: the position was recently
filled by Salvatore Ingala.
|Dr. Marek Cygan, PostDoc, February 2012-October 2012.|
Laekhanukit, Visiting PhD Student, July 2012-September
|Dr. Andreas Wiese, May 2012.|
|Dr. Danny Hermelin, May 2012.|
Telikepalli, May 2012.
|Constant integrality gap LP formulations of unsplittable flow on a path. A. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese. In IPCO 2013.|
|The hypermatching assignment problem. M. Cygan, F. Grandoni, M. Matrolilli. How to Sell Hyperedges. In SODA 2013.|
|On pairwise spanners. M. Cygan, F. Grandoni, and K. Telikepalli. In STACS 2013.|
|Known algorithms for
edge clique cover are probably optimal. M.
Pilipczuk, and M.
Pilipczuk. In SODA 2013.
revisited: Tight approximation hardness of induced matching,
poset dimension, and more. P.
Chalermsook, B. Laekhanukit, D. Nanongkai. In SODA 2013.
|Directed subset feedback vertex set is fixed-parameter tractable. R. Chitnis, M. Cygan, M. Hajiaghayi, and D. Marx. In ICALP 2012.|
algorithms for cut problems using randomized contractions. R.
Chitnis, M. Cygan, M. Hajiaghayi, M. Pilipczuk, and M.
Pilipczuk. In FOCS 2012.
parameterized connected vertex cover. M.
Cygan. In SWAT 2012. Best
student paper award.
applications of Baur-Strassen's theorem. M.
Cygan, H. N. Gabow, and P. Sankowski. In FOCS 2012.
theorem with applications to pricing and covering on trees. M.
Cygan, F. Grandoni, S. Leonardi, M. Pilipczuk, and P. Sakowski.
In ESA 2012.
|LP rounding for
k-centers with non-uniform hard capacities. M.
Cygan, M. Hajiaghayi, and S. Khuller.
In FOCS 2012.
Cygan, G. Kortsarz, and Z. Nutov. In
|Clique cover and graph separation: New incompressibility results. M. Cygan, S. Kratsch, M. Pilipczuk, M. Pilipczuk, and M. Wahlstrom. In ICALP 2012.|
|On group feedback vertex set parameterized by the size of the cutset. M. Cygan, M. Pilipczuk, and M.Pilipczuk. In WG 2012. Best student paper award.|
|Sitting closer to
friends than enemies, revised.
Cygan, M. Pilipczuk, M. Pilipczuk, and J. O. Wojtaszczyk. In
sensitivity oracles via fast single-source replacement paths. F.
Grandoni and V. Vassilevska Williams. In FOCS 2012.
|On min-power Steiner
Grandoni. In ESA 2012.
second welfare theorems. B.
Laekhanukit, G. Naves, A. Vetta. In WINE 2012.
|A rounding by sampling approach to the minimum size k-arc connected subgraph problem. B. Laekhanukit, S. Oveis Gharan, M. Singh. In ICALP 2012.|
|Routing regardless of
network stability. B.
Laekhanukit, A. Vetta, G. Wilfong. In ESA 2012.