Co-occurring keywords · papers mentioning both
Papers
The Parameterized Complexity of Motion Planning for Snake-Like Robots
IJCAI 2019
An FPTAS for Computing Nash Equilibrium in Resource Graph Games
IJCAI 2018
A Structural Approach to Activity Selection
IJCAI 2018
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings
IJCAI 2018
Parameterized Algorithms for the Matrix Completion Problem
ICML 2018
Parameterized hardness of active inference
PGM 2018
The Complexity of Limited Belief Reasoning—The Quantifier-Free Case
IJCAI 2018
When Rigging a Tournament, Let Greediness Blind You
IJCAI 2018
Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract)
IJCAI 2017
On the Kernelization of Global Constraints
IJCAI 2017
Weakening Covert Networks by Minimizing Inverse Geodesic Length
IJCAI 2017
The Parameterized Complexity of Approximate Inference in Bayesian Networks
PGM 2016
Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number
NeurIPS 2015