ParAI

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
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
ACM Transactions on Algorithms, 2026.
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
The Parameterized Complexity of Coordinated Motion Planning
Discrete and Computational Geometry, 2026.
Note: to appear
Cite Project Project
Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks
The Fourteenth International Conference on Learning Representations, ICLR 2026, 2026, OpenReview.net.
Note: to appear
Cite Project Project
Approximate Evaluation of Quantitative Second Order Queries
2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 664-677, June 2025, IEEE Computer Society.
PDF Cite Project DOI
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots
41st International Symposium on Computational Geometry, SoCG 2025, June 23-27, 2025, Kanazawa, Japan (Oswin Aichholzer and Haitao Wang), volume 332 of LIPIcs, pages 44:1-44:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF Cite Project Project DOI
A Structural Complexity Analysis of Hierarchical Task Network Planning
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2025, Montreal, Canada, August 16-22, 2025, pages 4391-4400, 2025, ijcai.org.
PDF Cite Project Project DOI