Baris Can Esmer

Publication Activity (10 Years)

Years Active: 2022-2024
Publications (10 Years): 11

Top Topics

Combinatorial Optimization

Tight Complexity Bounds

Top Venues

Publications

Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. Algorithmica 86 (1) (2024)
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. CoRR (2024)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Approximate Monotone Local Search for Weighted Problems. IPEC (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Approximate Monotone Local Search for Weighted Problems. CoRR (2023)
Baris Can Esmer, Vasileios Nakos
On (1 + ϵ)-Approximate Block Sparse Recovery. ISIT (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. IPEC (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA (2022)
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs. CoRR (2022)