ParAI

Computing Kemeny Rankings from d-Euclidean Preferences
Cite Project Project
Crossing-Optimal Extension of Simple Drawings
PDF Cite Project Project
Graphs with at most two moplexes
Cite Project Project
Graphs with two moplexes
PDF Cite Project Project
Measuring what matters: A hybrid approach to dynamic programming with treewidth
PDF Cite Project Project
New Width Parameters for SAT and Sharp-SAT
PDF Cite Project Project Project DOI
On Strict (Outer-)Confluent Graphs
PDF Cite Project Project
The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints
PDF Cite Project Project
The Complexity of Bayesian Network Learning: Revisiting the Superstructure
PDF Cite Project Project
The Complexity of Object Association in Multiple Object Tracking
PDF Cite Project Project