Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (ESA, 2022)

On (1 + ϵ)-Approximate Block Sparse Recovery. - Baris Can Esmer; Vasileios Nakos (ISIT, 2022)

Computing Generalized Convolutions Faster Than Brute Force. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Philipp Schepper; Karol Wegrzycki (IPEC, 2022)

Approximate Monotone Local Search for Weighted Problems. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (IPEC, 2023)

List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. - Baris Can Esmer; Jacob Focke; Dániel Marx; Pawel Rzazewski (ESA, 2024)

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. - Baris Can Esmer; Jacob Focke; Dániel Marx; Pawel Rzazewski (ICALP, 2024)

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (SODA, 2024)

Generalized Graph Packing Problems Parameterized by Treewidth. - Baris Can Esmer; Dániel Marx (ESA, 2025)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems. - Baris Can Esmer; Ariel Kulik (ICALP, 2025)