1

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
Clarity and Computational Efficiency of Orbital Boundary Labeling
Cite Project
Complexity of Positive Influence Domination on Partial Grids
PDF Cite DOI
Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms
Cite Project Project
Computing Twin-Width via Treedepth and Vertex Integrity
Cite Project
Fair Correlation Clustering Meets Graph Parameters
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