Coe

A Parameterized-Complexity Framework for Finding Local Optima
17th Innovations in Theoretical Computer Science Conference, ITCS 2026, 2026.
Note: to appear
Cite Project Project
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs (Best Paper Award)
2026 Symposium on Simplicity in Algorithms, SOSA 2026, 2026, SIAM.
Note: to appear
Cite Project Project Project
Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Cite Project Project
Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms
The 40th Annual AAAI Conference on Artificial Intelligence, AAAI-2026, 2026.
Note: To appear
Cite Project Project
Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy
Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR.
Note: to appear
Cite Project Project
Graph Choosability via SAT: Beyond the Nullstellensatz
The 40th Annual AAAI Conference on Artificial Intelligence, AAAI-2026, 2026.
Note: To appear
Cite Project Project
Makespan Minimization in Split Learning: From Theory to Practice
IEEE INFOCOM 2026 - IEEE Conference on Computer Communications, 2026.
Note: to appear
Cite Project Project
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
AAAI-26, Sponsored by the Association for the Advancement of Artificial Intelligence, 2026, AAAI Press.
Note: to appear
Cite Project Project
Routing Few Robots in a Crowded Network
Journal of Computer and System Sciences, 2026.
Note: to appear
Cite Project Project Project
The Complexity of Extending Fair Allocations of Indivisible Goods
Journal of Artificial Intelligence Research, 2026.
Note: to appear
Cite Project Project