ParAI

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
A Structural Complexity Analysis of Synchronous Dynamical Systems
Cite Project Project
Computing Twin-Width via Treedepth and Vertex Integrity
Cite Project
Fair Correlation Clustering Meets Graph Parameters
Cite Project Project
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
PDF Cite Project Project Project DOI
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