Co-occurring keywords · papers mentioning both
Papers
Fixed-Parameter Tractability of Private Synthetic Data Generation
COLT 2026
Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
AAAI 2025
Encoding Constraints as Binary Constraint Networks Satisfying BTP
AAAI 2024
Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
IJCAI 2024
SAT-Based Tree Decomposition with Iterative Cascading Policy Selection
AAAI 2024
TD-GEN: Graph Generation Using Tree Decomposition
AISTATS 2022
Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions
AAAI 2022
Submodel Decomposition Bounds for Influence Diagrams
AAAI 2021
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
IJCAI 2020
Discourse Representation Structure Parsing
ACL 2018
Solving M-Modes in Loopy Graphs Using Tree Decompositions
PGM 2018
Efficient Inference for Untied MLNs
IJCAI 2017
k-Support and Ordered Weighted Sparsity for Overlapping Groups: Hardness and Algorithms
NeurIPS 2017
Order Statistics for Probabilistic Graphical Models
IJCAI 2017
Learning Gaussian Graphical Models with Observed or Latent FVSs
NeurIPS 2013
Multiscale Dictionary Learning for Estimating Conditional Distributions
NeurIPS 2013
Density Propagation and Improved Bounds on the Partition Function
NeurIPS 2012
Online Sum-Product Computation Over Trees
NeurIPS 2012
An LP View of the M-best MAP problem
NeurIPS 2009
Approximate inference using planar graph decomposition
NeurIPS 2006