Nfpc

Measuring what matters: A hybrid approach to dynamic programming with treewidth
J. Comput. Syst. Sci., volume 121, pages 57-75, 2021.
PDF Cite Project Project
New Width Parameters for SAT and Sharp-SAT
Artificial Intelligence, volume 295, pages 103460, 2021.
PDF Cite Project Project Project DOI
On Strict (Outer-)Confluent Graphs
J. Graph Algorithms Appl., 2021.
PDF Cite Project Project
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Algorithmica, volume 83, number 1, pages 297-336, 2021.
PDF Cite Project
On Structural Parameterizations of the Edge Disjoint Paths Problem
Algorithmica, volume 83, number 6, pages 1605-1637, 2021.
PDF Cite Project Project
The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints
Artificial Intelligence, 2021.
PDF Cite Project Project
The Complexity of Bayesian Network Learning: Revisiting the Superstructure
Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual (Marc’Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan), pages 430-442, 2021.
PDF Cite Project Project
The Complexity of Object Association in Multiple Object Tracking
Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 1388-1396, 2021, AAAI Press.
PDF Cite Project Project
The Parameterized Complexity of Clustering Incomplete Data
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296-7304, 2021, AAAI Press.
PDF Cite Project Project Project Project
The Parameterized Complexity of Connected Fair Division
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 (Zhi-Hua Zhou), pages 139-145, 2021, ijcai.org.
PDF Cite Project Project