ParAI

New Complexity-Theoretic Frontiers of Tractability for Neural Network Training
Cite Project
On the parameterized complexity of clustering problems for incomplete data
Cite Project Project Project DOI
Parameterized complexity of envy-free resource allocation in social networks
PDF Cite Project DOI
Sample compression schemes for balls in graphs
Cite Project
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
PDF Cite Project DOI
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF
PDF Cite Project DOI
The Computational Complexity of Concise Hypersphere Classification
PDF Cite Project Project Project
The Parameterized Complexity of Coordinated Motion Planning
PDF Cite Project Project DOI
The Parameterized Complexity of Network Microaggregation
PDF Cite Project
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth
PDF Cite Project Project DOI