Network sparsification for Steiner problems on planar and bounded-genus graphs
- Submitting institution
-
The University of Warwick
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 10611
- Type
- E - Conference contribution
- DOI
-
10.1109/FOCS.2014.37
- Title of conference / published proceedings
- 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014)
- First page
- 276
- Volume
- -
- Issue
- -
- ISSN
- 0272-5428
- Open access status
- Out of scope for open access requirements
- Month of publication
- December
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
T - Theory and Foundations
- Citation count
- 19
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper appeared in FOCS'14, one of the two strongest conferences in theoretical computer science. The paper was instrumental in securing the author's ERC Starting Grant CUTACOMBS. Moreover, the paper was highlighted in the laudatio of a co-author Michal Pilipczuk as the winner of the prestigious 2016 Cor Baayen Young Researcher Award from the European Research Consortium for Informatics and Mathematics. The paper initiated several important works by other researchers published at prestigious conferences (ICALP'15, FOCS'15, FOCS'16, SODA'16, ICALP'18), and was the topic of the author's invited keynote presentation at Worker'15 (Nordfjordeid, Norway), the biannual meeting of the kernelization community.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -