Sebastian Ordyniak

According to our database1, Sebastian Ordyniak
  • authored at least 77 papers between 2008 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
First order limits of sparse graphs: Plane trees and path-width.
Random Struct. Algorithms, 2017

Backdoors into heterogeneous classes of SAT and CSP.
J. Comput. Syst. Sci., 2017

Kernelization using structural parameters on sparse graph classes.
J. Comput. Syst. Sci., 2017

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
CoRR, 2017

SAT-Encodings for Special Treewidth and Pathwidth.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

A SAT Approach to Branchwidth.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Backdoor Sets for CSP.
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

Going Beyond Primal Treewidth for (M)ILP.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Complexity and monotonicity results for domination games.
Theor. Comput. Sci., 2016

Tree-depth and vertex-minors.
Eur. J. Comb., 2016

Directed elimination games.
Discrete Applied Mathematics, 2016

Strong Backdoors for Linear Temporal Logic.
CoRR, 2016

Clique-Width and Directed Width Measures for Answer-Set Programming.
CoRR, 2016

A Parameterized Study of Maximum Generalized Pattern Matching Problems.
Algorithmica, 2016

Backdoors to q-Horn.
Algorithmica, 2016

A SAT Approach to Branchwidth.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

On the Complexity Landscape of Connected f-Factor Problems.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Edge-Editing to a Dense and a Sparse Graph Class.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Backdoors for Linear Temporal Logic.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

SOBRA - Shielding Optimization for BRAchytherapy.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Counting Linear Extensions: Parameterizations by Treewidth.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Clique-Width and Directed Width Measures for Answer-Set Programming.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

The Complexity Landscape of Decompositional Parameters for ILP.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Using Decomposition-Parameters for QBF: Mind the Prefix!
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
On finding optimal polytrees.
Theor. Comput. Sci., 2015

A complete parameterized complexity analysis of bounded planning.
J. Comput. Syst. Sci., 2015

Backdoors into Heterogeneous Classes of SAT and CSP.
CoRR, 2015

Faster Existential FO Model Checking on Posets.
Logical Methods in Computer Science, 2015

FO Model Checking on Posets of Bounded Width.
CoRR, 2015

Parameterized Algorithms for Parity Games.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

FO Model Checking on Posets of Bounded Width.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Variable-Deletion Backdoors to Planning.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Parameterized Complexity Results for Exact Bayesian Network Structure Learning.
CoRR, 2014

A Parameterized Study of Maximum Generalized Pattern Matching Problems.
CoRR, 2014

Tree-depth and Vertex-minors.
CoRR, 2014

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

A Parameterized Study of Maximum Generalized Pattern Matching Problems.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Finite Integer Index of Pathwidth and Treewidth.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Faster Existential FO Model Checking on Posets.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Backdoors to Planning.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Backdoors into Heterogeneous Classes of SAT and CSP.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Satisfiability of acyclic and almost acyclic CNF formulas.
Theor. Comput. Sci., 2013

Parameterized Complexity Results for Exact Bayesian Network Structure Learning.
J. Artif. Intell. Res., 2013

Upper and Lower Bounds for Weak Backdoor Set Detection
CoRR, 2013

Kernelization Using Structural Parameters on Sparse Graph Classes
CoRR, 2013

Parameterized Algorithms for Modular-Width.
CoRR, 2013

A Complete Parameterized Complexity Analysis of Bounded Planning.
CoRR, 2013

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.
Proceedings of the Theory and Applications of Formal Argumentation, 2013

Backdoors to q-Horn.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Upper and Lower Bounds for Weak Backdoor Set Detection.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Parameterized Algorithms for Modular-Width.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Kernelization Using Structural Parameters on Sparse Graph Classes.
Proceedings of the Algorithms - ESA 2013, 2013

Parameterized Complexity and Kernel Bounds for Hard Planning Problems.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
CoRR, 2012

The Complexity of Planning Revisited - A Parameterized Analysis
CoRR, 2012

On Finding Optimal Polytrees
CoRR, 2012

Don't Be Strict in Local Search!
CoRR, 2012

Algorithms and Complexity Results for Exact Bayesian Structure Learning
CoRR, 2012

Augmenting tractable fragments of abstract argumentation.
Artif. Intell., 2012

Valued-Based Argumentation for Tree-like Value Graphs.
Proceedings of the Computational Models of Argument, 2012

Don't Be Strict in Local Search!
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

On Finding Optimal Polytrees.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

The Complexity of Planning Revisited - A Parameterized Analysis.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Digraph decompositions and monotonicity in digraph searching.
Theor. Comput. Sci., 2011

Algorithms and Complexity Results for Persuasive Argumentation
CoRR, 2011

Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II)
CoRR, 2011

Augmenting Tractable Fragments of Abstract Argumentation
CoRR, 2011

Algorithms and complexity results for persuasive argumentation.
Artif. Intell., 2011

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Augmenting Tractable Fragments of Abstract Argumentation.
Proceedings of the IJCAI 2011, 2011

2010
Algorithms and Complexity Results for Exact Bayesian Structure Learning.
Proceedings of the UAI 2010, 2010

Satisfiability of Acyclic and Almost Acyclic CNF Formulas.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Algorithms and Complexity Results for Persuasive Argumentation.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

2009
Distance d-Domination Games.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008
Digraph Decompositions and Monotonicity in Digraph Searching
CoRR, 2008

Digraph Decompositions and Monotonicity in Digraph Searching.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008


  Loading...