ParAI

Structural Parameterizations of Simultaneous Planarity
Cite Project Project Project
The Complexity of Extending Fair Allocations of Indivisible Goods
PDF Cite Project DOI
The complexity of optimizing atomic congestion
PDF Cite Project DOI
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
PDF Cite Project
The Peculiarities of Extending Queue Layouts
Cite Project Project
Training One-Dimensional Graph Neural Networks is NP-Hard
PDF Cite Project
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding
PDF Cite Project Project DOI
Bounding and Computing Obstacle Numbers of Graphs
PDF Cite Project DOI
Computing Twin-Width Parameterized by the Feedback Edge Number
PDF Cite Project DOI
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
PDF Cite Project DOI