PCCR 2014 ABSTRACTS: KEYWORD INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index

Shortcuts: B C D F G I P S T W

B
backdoor sets	Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction (PDF, talk) Backdoors into Heterogeneous Classes of SAT and CSP (PDF, talk) Backdoors into Two Occurrences (PDF, talk) Backdoors to Planning (PDF, talk)
C
causal graph	Backdoors to Planning (PDF, talk)
complexity	Intuitionistic modal logics: efficient fragments and parameterized complexity (PDF, talk)
complexity hierarchies	Fixed-Parameter Algorithms for Reasoning Problems in NP and Beyond (PDF, talk)
computational social choice	A Parameterized Complexity Analysis of Generalized CP-Nets (PDF, talk)
connection matrices	Connection matrices of finite rank instead of definability in Monadic Second Order Logic (PDF, talk)
constraint satisfaction	Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction (PDF, talk) Backdoors into Heterogeneous Classes of SAT and CSP (PDF, talk)
CP-nets	A Parameterized Complexity Analysis of Generalized CP-Nets (PDF, talk)
D
derivability	Intuitionistic modal logics: efficient fragments and parameterized complexity (PDF, talk)
disjunctive answer set programming	Fixed-Parameter Algorithms for Reasoning Problems in NP and Beyond (PDF, talk)
F
fixed parameter tractable	Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction (PDF, talk) Backdoors into Two Occurrences (PDF, talk) A Parameterized Complexity Analysis of Generalized CP-Nets (PDF, talk) Connection matrices of finite rank instead of definability in Monadic Second Order Logic (PDF, talk)
formulas with two occurrences	Backdoors into Two Occurrences (PDF, talk)
G
graph algorithms	Connection matrices of finite rank instead of definability in Monadic Second Order Logic (PDF, talk)
I
important separators	Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction (PDF, talk)
intuitionistic modal logic	Intuitionistic modal logics: efficient fragments and parameterized complexity (PDF, talk)
P
parameterized complexity	Structural Decomposition Methods: How They Matter (PDF, talk) Fixed-Parameter Algorithms for Reasoning Problems in NP and Beyond (PDF, talk) Backdoors into Heterogeneous Classes of SAT and CSP (PDF, talk) A Parameterized Complexity Analysis of Generalized CP-Nets (PDF, talk) Backdoors to Planning (PDF, talk)
planning	Backdoors to Planning (PDF, talk)
S
satisfiability	Backdoors into Heterogeneous Classes of SAT and CSP (PDF, talk)
structural decompositions	Structural Decomposition Methods: How They Matter (PDF, talk)
T
treewidth	Structural Decomposition Methods: How They Matter (PDF, talk)
W
W[2]-hardness	Backdoors into Two Occurrences (PDF, talk)