Sebastian Ordyniak

Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

Going Beyond Primal Treewidth for (M)ILP.

[BibT_eX]

[DOI]

Robert Ganian

M. S. Ramanujan

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Complexity and monotonicity results for domination games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Tree-depth and vertex-minors.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

Directed elimination games.

[BibT_eX]

[DOI]

Viktor Engelmann

Discret. Appl. Math., 2016

Strong Backdoors for Linear Temporal Logic.

[BibT_eX]

[DOI]

CoRR, 2016

A Parameterized Study of Maximum Generalized Pattern Matching Problems.

[BibT_eX]

[DOI]

Alexandru Popa

Algorithmica, 2016

Backdoors to q-Horn.

[BibT_eX]

[DOI]

Algorithmica, 2016

Edge-Editing to a Dense and a Sparse Graph Class.

[BibT_eX]

[DOI]

Michal Kotrbcík

Rastislav Královic

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

SOBRA - Shielding Optimization for BRAchytherapy.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Clique-Width and Directed Width Measures for Answer-Set Programming.

[BibT_eX]

[DOI]

Bernhard Bliem

Stefan Woltran

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

On finding optimal polytrees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

A complete parameterized complexity analysis of bounded planning.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Faster Existential FO Model Checking on Posets.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2015

Parameterized Algorithms for Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

FO Model Checking on Posets of Bounded Width.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Variable-Deletion Backdoors to Planning.

[BibT_eX]

[DOI]

Martin Kronegger

Fernando Sánchez Villaamil

Andreas Pfandler

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Finite Integer Index of Pathwidth and Treewidth.

[BibT_eX]

[DOI]

Somnath Sikdar

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

Satisfiability of acyclic and almost acyclic CNF formulas.

[BibT_eX]

[DOI]

Daniël Paulusma

Theor. Comput. Sci., 2013

Parameterized Complexity Results for Exact Bayesian Network Structure Learning.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2013

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.

[BibT_eX]

[DOI]

Eun Jung Kim

Proceedings of the Theory and Applications of Formal Argumentation, 2013

Upper and Lower Bounds for Weak Backdoor Set Detection.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Parameterized Algorithms for Modular-Width.

[BibT_eX]

[DOI]

Jakub Gajarský

Michael Lampis

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Parameterized Complexity and Kernel Bounds for Hard Planning Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Augmenting tractable fragments of abstract argumentation.

[BibT_eX]

[DOI]

Wolfgang Dvorák

Artif. Intell., 2012

Valued-Based Argumentation for Tree-like Value Graphs.

[BibT_eX]

[DOI]

Eun Jung Kim

Proceedings of the Computational Models of Argument, 2012

Don't Be Strict in Local Search!

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

The Complexity of Planning Revisited - A Parameterized Analysis.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Digraph decompositions and monotonicity in digraph searching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Algorithms and complexity results for persuasive argumentation.

[BibT_eX]

[DOI]

Eun Jung Kim

Artif. Intell., 2011

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).

[BibT_eX]

[DOI]

Daniël Paulusma

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Augmenting Tractable Fragments of Abstract Argumentation.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

2010

Algorithms and Complexity Results for Exact Bayesian Structure Learning.

[BibT_eX]

[DOI]

Proceedings of the UAI 2010, 2010

2009

Distance <i>d</i>-Domination Games.

[BibT_eX]

[DOI]