Coe

A Parameterized-Complexity Framework for Finding Local Optima
Cite Project Project
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs (Best Paper Award)
Cite Project Project Project
Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms
Cite Project Project
Graph Choosability via SAT: Beyond the Nullstellensatz
Cite Project Project
Makespan Minimization in Split Learning: From Theory to Practice
Cite Project Project
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
Cite Project Project
Routing Few Robots in a Crowded Network
Cite Project Project Project
Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks
Cite Project Project
A Structural Complexity Analysis of Hierarchical Task Network Planning
PDF Cite Project Project DOI
Analyzing Reformulation Performance in Core-Guided MaxSAT Solving
PDF Cite Project Project DOI