Baris Can Esmer

According to our database, Baris Can Esmer authored at least 8 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Computing Generalized Convolutions Faster Than Brute Force.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki

Algorithmica, January, 2024

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems.

Baris Can Esmer, Ariel Kulik

CoRR, 2024

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness.

Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs.

Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Approximate Monotone Local Search for Weighted Problems.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022

On (1 + ϵ)-Approximate Block Sparse Recovery.

Baris Can Esmer, Vasileios Nakos

Proceedings of the IEEE International Symposium on Information Theory, 2022

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

Proceedings of the 30th Annual European Symposium on Algorithms, 2022