PhD Student
European Symposium on Algorithms (ESA)
International Colloquium on Automata Languages and Programming (ICALP)
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems.
European Symposium on Algorithms (ESA)
Generalized Graph Packing Problems Parameterized by Treewidth
European Symposium on Algorithms (ESA)
List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs.
International Colloquium on Automata Languages and Programming (ICALP)
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness.
Algorithmica: an international journal in computer science Computing Generalized Convolutions Faster Than Brute Force
ACM-SIAM Symposium on Discrete Algorithms (SODA)
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.
International Symposium on Parameterized and Exact Computation (IPEC)
Approximate Monotone Local Search for Weighted Problems.
International Symposium on Parameterized and Exact Computation (IPEC)
European Symposium on Algorithms (ESA)