In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 Leibniz International Proceedings in Informatics, LIPIcs (47) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 22:1-22:14. ISSN 1868-8969
Time-approximation trade-offs for inapproximable problems
In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) Leibniz International Proceedings in Informatics (LIPIcs) (55) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 47:1-47:14. ISSN 1868-8969
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss
In: 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016 Leibniz International Proceedings in Informatics, LIPIcs (60) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 16:1-16:54. ISSN 1868-8969
Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs
In: 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016 Association for Computing Machinery, Cambridge (MA), pp. 570-583. ISSN 0737-8017
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting