The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Sebastian Ordyniak" ( http://dblp.L3S.de/Authors/Sebastian_Ordyniak )

  Author page on DBLP  Author page in RDF  Community of Sebastian Ordyniak in ASPL-2

Publication years (Num. hits)
2008-2012 (23) 2013-2014 (21) 2015-2016 (24) 2017-2018 (26) 2019 (14)
Publication types (Num. hits)
article(53) incollection(1) inproceedings(54)
Venues (Conferences, Journals, ...)
CoRR(31) AAAI(10) IJCAI(7) Algorithmica(5) Artif. Intell.(4) IPEC(4) SAT(4) Theor. Comput. Sci.(4) ESA(3) J. Comput. Syst. Sci.(3) STACS(3) WG(3) COMMA(2) ISAAC(2) MFCS(2) ACM Trans. Comput. Log.(1) More (+10 of total 36)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 109 publication records. Showing 108 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Neha Lodha, Sebastian Ordyniak, Stefan Szeider A SAT Approach to Branchwidth. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler Backdoors to planning. Search on Bibsonomy Artif. Intell. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, K. Kangas, Sebastian Ordyniak Counting Linear Extensions: Parameterizations by Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler Backdoors for Linear Temporal Logic. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan On the Complexity Landscape of Connected f-Factor Problems. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström Parameterized Pre-coloring Extension and List Coloring Problems. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, Stefan Szeider A Join-Based Hybrid Parameter for Constraint Satisfaction. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna Integer Programming and Incidence Treedepth. Search on Bibsonomy IPCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, C. S. Rahul Group Activity Selection with Few Agent Types. Search on Bibsonomy ESA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Solving Integer Quadratic Programming via Explicit and Structural Restrictions. Search on Bibsonomy AAAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider SAT-Encodings for Treecut Width and Treedepth. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, Stefan Szeider A Join-Based Hybrid Parameter for Constraint Satisfaction. Search on Bibsonomy CP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs. Search on Bibsonomy IJCAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak The complexity landscape of decompositional parameters for ILP. Search on Bibsonomy Artif. Intell. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, C. S. Rahul Group Activity Selection with Few Agent Types. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak The Complexity Landscape of Decompositional Parameters for ILP. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan On the Complexity Landscape of Connected f -Factor Problems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider Parameterized Algorithms for the Matrix Completion Problem. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Sebastian Ordyniak Small Resolution Proofs for QBF using Dependency Treewidth. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Fabian Klute, Sebastian Ordyniak On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. Search on Bibsonomy SOCS The full citation details ... 2018 DBLP  BibTeX  RDF
1Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider Parameterized Algorithms for the Matrix Completion Problem. Search on Bibsonomy ICML The full citation details ... 2018 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Sebastian Ordyniak A Structural Approach to Activity Selection. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Unary Integer Linear Programming with Structural Restrictions. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak Novel Structural Parameters for Acyclic Planning Using Tree Embeddings. Search on Bibsonomy IJCAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny Backdoors into heterogeneous classes of SAT and CSP. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar Kernelization using structural parameters on sparse graph classes. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan On Structural Parameterizations of the Edge Disjoint Paths Problem. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Sebastian Ordyniak Small Resolution Proofs for QBF using Dependency Treewidth. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma First order limits of sparse graphs: Plane trees and path-width. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan On Structural Parameterizations of the Edge Disjoint Paths Problem. Search on Bibsonomy ISAAC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Sebastian Ordyniak, Stefan Szeider Backdoor Sets for CSP. Search on Bibsonomy The Constraint Satisfaction Problem The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan Towards a Polynomial Kernel for Directed Feedback Vertex Set. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan Going Beyond Primal Treewidth for (M)ILP. Search on Bibsonomy AAAI The full citation details ... 2017 DBLP  BibTeX  RDF
1Neha Lodha, Sebastian Ordyniak, Stefan Szeider SAT-Encodings for Special Treewidth and Pathwidth. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. Search on Bibsonomy IJCAI The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Neha Lodha, Sebastian Ordyniak, Stefan Szeider A SAT Approach to Branchwidth. Search on Bibsonomy IJCAI The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh 0001, Stefan Szeider Backdoors to q-Horn. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sebastian Ordyniak, Alexandru Popa 0001 A Parameterized Study of Maximum Generalized Pattern Matching Problems. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak Tree-depth and vertex-minors. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Stephan Kreutzer, Sebastian Ordyniak Complexity and monotonicity results for domination games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran Clique-Width and Directed Width Measures for Answer-Set Programming. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler Strong Backdoors for Linear Temporal Logic. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Viktor Engelmann, Sebastian Ordyniak, Stephan Kreutzer Directed elimination games. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Kustaa Kanga, Sebastian Ordyniak Counting Linear Extensions: Parameterizations by Treewidth. Search on Bibsonomy ESA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan On the Complexity Landscape of Connected f-Factor Problems. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak The Complexity Landscape of Decompositional Parameters for ILP. Search on Bibsonomy AAAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Sebastian Ordyniak Using Decomposition-Parameters for QBF: Mind the Prefix! Search on Bibsonomy AAAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran Clique-Width and Directed Width Measures for Answer-Set Programming. Search on Bibsonomy ECAI The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Neha Lodha, Sebastian Ordyniak, Stefan Szeider A SAT Approach to Branchwidth. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa 0001 SOBRA - Shielding Optimization for BRAchytherapy. Search on Bibsonomy IWOCA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michal Kotrbcík, Rastislav Královic, Sebastian Ordyniak Edge-Editing to a Dense and a Sparse Graph Class. Search on Bibsonomy LATIN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler Backdoors for Linear Temporal Logic. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider On finding optimal polytrees. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider A complete parameterized complexity analysis of bounded planning. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh 0001 FO Model Checking on Posets of Bounded Width. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny Backdoors into Heterogeneous Classes of SAT and CSP. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak Faster Existential FO Model Checking on Posets. Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh 0001 FO Model Checking on Posets of Bounded Width. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak Parameterized Algorithms for Parity Games. Search on Bibsonomy MFCS (2) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler Variable-Deletion Backdoors to Planning. Search on Bibsonomy AAAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak Tree-depth and Vertex-minors. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Sebastian Ordyniak, Alexandru Popa 0001 A Parameterized Study of Maximum Generalized Pattern Matching Problems. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Sebastian Ordyniak, Stefan Szeider Parameterized Complexity Results for Exact Bayesian Network Structure Learning. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Eun Jung Kim 0002, Sebastian Ordyniak, Stefan Szeider The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak Faster Existential FO Model Checking on Posets. Search on Bibsonomy ISAAC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny Backdoors into Heterogeneous Classes of SAT and CSP. Search on Bibsonomy AAAI The full citation details ... 2014 DBLP  BibTeX  RDF
1Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler Backdoors to Planning. Search on Bibsonomy AAAI The full citation details ... 2014 DBLP  BibTeX  RDF
1Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar Finite Integer Index of Pathwidth and Treewidth. Search on Bibsonomy IPEC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sebastian Ordyniak, Alexandru Popa 0001 A Parameterized Study of Maximum Generalized Pattern Matching Problems. Search on Bibsonomy IPEC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider Satisfiability of acyclic and almost acyclic CNF formulas. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sebastian Ordyniak, Stefan Szeider Parameterized Complexity Results for Exact Bayesian Network Structure Learning. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar Kernelization Using Structural Parameters on Sparse Graph Classes Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman 0001, Stefan Szeider Upper and Lower Bounds for Weak Backdoor Set Detection Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider A Complete Parameterized Complexity Analysis of Bounded Planning. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Jakub Gajarský, Michael Lampis, Sebastian Ordyniak Parameterized Algorithms for Modular-Width. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Eun Jung Kim 0002, Sebastian Ordyniak, Stefan Szeider The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. Search on Bibsonomy TAFA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar Kernelization Using Structural Parameters on Sparse Graph Classes. Search on Bibsonomy ESA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman 0001, Stefan Szeider Upper and Lower Bounds for Weak Backdoor Set Detection. Search on Bibsonomy SAT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider Parameterized Complexity and Kernel Bounds for Hard Planning Problems. Search on Bibsonomy CIAC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh 0001, Stefan Szeider Backdoors to q-Horn. Search on Bibsonomy STACS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jakub Gajarský, Michael Lampis, Sebastian Ordyniak Parameterized Algorithms for Modular-Width. Search on Bibsonomy IPEC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Wolfgang Dvorák, Sebastian Ordyniak, Stefan Szeider Augmenting tractable fragments of abstract argumentation. Search on Bibsonomy Artif. Intell. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sebastian Ordyniak, Stefan Szeider Algorithms and Complexity Results for Exact Bayesian Structure Learning Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider Parameterized Complexity and Kernel Bounds for Hard Planning Problems Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Serge Gaspers, Eun Jung Kim 0002, Sebastian Ordyniak, Saket Saurabh 0001, Stefan Szeider Don't Be Strict in Local Search! Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider On Finding Optimal Polytrees Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider The Complexity of Planning Revisited - A Parameterized Analysis Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider On Finding Optimal Polytrees. Search on Bibsonomy AAAI The full citation details ... 2012 DBLP  BibTeX  RDF
1Serge Gaspers, Eun Jung Kim 0002, Sebastian Ordyniak, Saket Saurabh 0001, Stefan Szeider Don't Be Strict in Local Search! Search on Bibsonomy AAAI The full citation details ... 2012 DBLP  BibTeX  RDF
1Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider The Complexity of Planning Revisited - A Parameterized Analysis. Search on Bibsonomy AAAI The full citation details ... 2012 DBLP  BibTeX  RDF
1Eun Jung Kim 0002, Sebastian Ordyniak Valued-Based Argumentation for Tree-like Value Graphs. Search on Bibsonomy COMMA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Eun Jung Kim 0002, Sebastian Ordyniak, Stefan Szeider Algorithms and complexity results for persuasive argumentation. Search on Bibsonomy Artif. Intell. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stephan Kreutzer, Sebastian Ordyniak Digraph decompositions and monotonicity in digraph searching. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II) Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Eun Jung Kim 0002, Sebastian Ordyniak, Stefan Szeider Algorithms and Complexity Results for Persuasive Argumentation Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Sebastian Ordyniak, Stefan Szeider Augmenting Tractable Fragments of Abstract Argumentation Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 108 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license