Co-occurring keywords · papers mentioning both
Papers
Solving Infinite-Domain CSPs Using the Patchwork Property
AAAI 2021
The Complexity of Bayesian Network Learning: Revisiting the Superstructure
NeurIPS 2021
The Parameterized Complexity of Clustering Incomplete Data
AAAI 2021
On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness
AISTATS 2020
A Parameterized Perspective on Protecting Elections
IJCAI 2019
On Succinct Encodings for the Tournament Fixing Problem
IJCAI 2019
Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length
AAAI 2019
Sliding Window Temporal Graph Coloring
AAAI 2019
Exact Algorithms and Complexity of Kidney Exchange
IJCAI 2018
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings
IJCAI 2018
Parameterized Algorithms for the Matrix Completion Problem
ICML 2018
When Rigging a Tournament, Let Greediness Blind You
IJCAI 2018
Exact Learning of Bounded Tree-width Bayesian Networks
AISTATS 2013