Selected papers
1. Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties. APPROX-RANDOM 2015: 361-380[
[paper]
2. Kamal Jain:
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. Comb. 21(1): 39-60 (2001)
[paper]
3. Nikhil Bansal, Avrim Blum, Shuchi Chawla:
Correlation Clustering. Mach. Learn. 56(1-3): 89-113 (2004)
[paper]
4. Sanjeev Arora:
Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. J. ACM 45(5): 753-782 (1998)
[paper]
5. Anna Adamaszek, Sariel Har-Peled, Andreas Wiese:
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. J. ACM 66(4): 29:1-29:40 (2019)
Only up to page 17!
[paper]
6. Thomas Erlebach, Klaus Jansen, Eike Seidel:
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. SIAM J. Comput. 34(6): 1302-1323 (2005)
[paper]
7. Timothy M. Chan, Sariel Har-Peled:
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks. Discret. Comput. Geom. 48(2): 373-392 (2012)
[paper]
8. Nabil H. Mustafa, Saurabh Ray:
Improved Results on Geometric Hitting Set Problems. Discret. Comput. Geom. 44(4): 883-895 (2010)
[paper]
9. Hung Le, Baigong Zheng:
Local search is a PTAS for feedback vertex set in minor-free graphs. Theor. Comput. Sci. 838: 17-24 (2020)
[paper]
10a. Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger:
Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7): 1188-1198 (2008)
[paper]
+
10b. Yixin Cao:
A Naive Algorithm for Feedback Vertex Set. SOSA 2018: 1:1-1:9
[paper]
11. Fedor V. Fomin, Yngve Villanger:
Subexponential Parameterized Algorithm for Minimum Fill-In. SIAM J. Comput. 42(6): 2197-2216
[paper]
12. Eduard Eiben, William Lochet, Saket Saurabh:
A Polynomial Kernel for Paw-Free Editing. IPEC 2020: 10:1-10:15
[paper]
13. Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye:
A Polynomial Kernel for Diamond-Free Editing. ESA 2018: 10:1-10:13
[paper]
14a. Peter Gartland, Daniel Lokshtanov:
Independent Set on P_k-Free Graphs in Quasi-Polynomial Time. FOCS 2020: 613-624
[paper]
+
14b. Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths. SOSA 2021: 204-209
[paper]
15. Gregory Z. Gutin, Magnus Wahlström , Meirav Zehavi.
On r-Simple k-Path and Related Problems Parameterized by k/r. SODA 2019: 1750-1769
[paper]
16. Pasin Manurangsi:
A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation. SOSA 2019: 15:1-15:21
[paper]
17. Jon Feldman, Matthias Ruhl:
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. SIAM J. Comput. 36(2): 543-561 (2006)
[paper]
18. Ramamohan Paturi, Pavel Pudlák, Francis Zane:
Satisfiability Coding Lemma. Chic. J. Theor. Comput. Sci. 1999 (1999)
[paper]
19. Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Fourier meets möbius: fast subset convolution. STOC 2007: 67-74
[paper]
20. Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact Algorithms via Monotone Local Search. J. ACM 66(2): 8:1-8:23 (2019)
[paper]