Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Lists
Only you see this
BibTeX
@inproceedings{ganian2016discovering,
author = {Robert Ganian and M. S. Ramanujan and Stefan Szeider},
title = {{Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting}},
booktitle = {SODA},
year = {2016},
doi = {10.1137/1.9781611974331.ch114},
}| Combining Treewidth and Backdoors for CSP | arXiv · 2016 |
| Backdoors into Heterogeneous Classes of SAT and CSP | arXiv · 2015 |
| On Backdoors To Tractable Constraint Languages | arXiv · 2014 |
| Amalgams of Constraint Satisfaction Problems | IJCAI · 2003 |
| Constraint Satisfaction, Databases, and Logic | IJCAI · 2003 |
| The Parameterized Complexity of Global Constraints | arXiv · 2009 |