Baris Can Esmer

19 papers A* 3A 3B 3Journal 10
YearRankTypeTitle / Venue / Authors
2025 A conf
Generalized Graph Packing Problems Parameterized by Treewidth.
ESA
Baris Can Esmer, Dániel Marx
2025 J jnl
Generalized Graph Packing Problems Parameterized by Treewidth.
CoRR
Baris Can Esmer, Dániel Marx
2025 J jnl
On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects.
CoRR
Sujoy Bhore, Baris Can Esmer, Dániel Marx, Karol Wegrzycki
2025 A* conf
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems.
ICALP
Baris Can Esmer, Ariel Kulik
2024 J jnl
Computing Generalized Convolutions Faster Than Brute Force.
Algorithmica
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2024 A* conf
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness.
ICALP
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2024 J jnl
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness.
CoRR
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2024 A conf
List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs.
ESA
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2024 A* conf
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.
SODA
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2024 J jnl
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems.
CoRR
Baris Can Esmer, Ariel Kulik
2023 B conf
Approximate Monotone Local Search for Weighted Problems.
IPEC
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2023 J jnl
Approximate Monotone Local Search for Weighted Problems.
CoRR
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2023 J jnl
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.
CoRR
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2022 B conf
Computing Generalized Convolutions Faster Than Brute Force.
IPEC
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2022 J jnl
Computing Generalized Convolutions Faster Than Brute Force.
CoRR
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2022 A conf
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.
ESA
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2022 J jnl
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.
CoRR
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
2022 J jnl
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs.
CoRR
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2022 B conf
On (1 + ϵ)-Approximate Block Sparse Recovery.
ISIT
Baris Can Esmer, Vasileios Nakos