TU Wien Informatics

Role

2019

2018

2017

  • Towards a Polynomial Kernel for Directed Feedback Vertex Set / B. Bergnougnoux, E. Eiben, R. Ganian, S. Ordyniak, M. Ramanujan / Talk: Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, Aalborg Denmark; 2017-08-21 - 2017-08-25; in: "Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science", Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, (2017), ISBN: 978-3-95977-046-0; 1 - 15
  • A SAT Approach to Branchwidth / N. Lodha, S. Ordyniak, S. Szeider / Talk: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia (invited); 2017-08-19 - 2017-08-25; in: "Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017)", (2017), 4894 - 4898
  • Going Beyond Primal Treewidth for (M)ILP / R. Ganian, S. Ordyniak, M. Ramanujan / Talk: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, California; 2017-02-04 - 2017-02-09; in: "Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence", (2017), ISBN: 978-1-57735-781-0; 815 - 821
  • The Constraint Satisfaction Problem: Complexity and Approximability / S. Szeider, S. Ordyniak, S. Gaspers / in: "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017, ISBN: 978-3-95977-003-3, 137 - 157
  • First order limits of sparse graphs: Plane trees and path-width / J. Gajarsky, P. Hlinený, T. Kaiser, D. Král, M. Kupec, J. Obdrzalek, S. Ordyniak, T. Vojtech / Random Structures and Algorithms, 50 (2017), 612 - 635
  • Kernelization using structural parameters on sparse graph classes / J. Gajarsky, P. Hlinený, J. Obdrzalek, S. Ordyniak, F. Reidl, P. Rossmanith, F. Villaamil Sanchez, S. Sikdar / Journal of Computer and System Sciences, 84 (2017), 219 - 242
  • Backdoors into heterogeneous classes of SAT and CSP / S. Gaspers, N. Misra, S. Ordyniak, S. Szeider, S. Zivný / Journal of Computer and System Sciences, 85 (2017), 38 - 56
  • SAT-Encodings for Special Treewidth and Pathwidth / N. Lodha, S. Ordyniak, S. Szeider / in: "Theory and Applications of Satisfiability Testing - SAT 2017", Springer International Publishing AG 2017, 2017, ISBN: 978-3-319-66263-3, 429 - 445

2016

  • Clique-Width and Directed Width Measures for Answer-Set Programming / B. Bliem, S. Ordyniak, S. Woltran / Talk: Workshop on Trends and Applications of Answer Set Programming, Klagenfurt, Austria; 2016-09-26; in: "Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016)", T. Eiter, W. Faber, S. Woltran (ed.); (2016), 17 pages
  • Clique-Width and Directed Width Measures for Answer-Set Programming / B. Bliem, S. Ordyniak, S. Woltran / Talk: ECAI 2016 - 22nd European Conference on Artificial Intelligence, Den Haag, Niederlande; 2016-08-29 - 2016-09-02; in: "ECAI 2016 - 22nd European Conference on Artificial Intelligence", G. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, F. van Harmelen (ed.); IOS Press, 285 (2016), ISBN: 978-1-61499-671-2; 1105 - 1113
  • Counting Linear Extensions Parameterizations by Treewidth / E. Eiben, R. Ganian, K. Kangas, S. Ordyniak / Talk: ESA Workshop, Aarhus, Denmark; 2016-08-22 - 2016-08-24; in: "Proceedings of the 24th Annual European Symposium on Algorithms", (2016), ISBN: 978-3-95977-015-6; 1 - 18
  • On the Complexity Landscape of Connected f-Factor Problems* / R. Ganian, N. Narayanaswamy, S. Ordyniak, C. Rahul, M. S. Ramanujan / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Krakau, Polen; 2016-08-22 - 2016-08-26; in: "Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science", (2016), ISBN: 978-3-95977-016-3; 1 - 14
  • SOBRA - Shielding Optimization for BRAchytherapy / G. Blin, M. Gasparoux, S. Ordyniak, A. Popa / Talk: International Workshop on Combinatorial Algorithms (IWOCA), Helsinki, Finland; 2016-08-17 - 2016-08-19; in: "Combinatorial Algorithms - 27th International Workshop", (2016), ISBN: 978-3-319-44542-7; 309 - 320
  • A SAT Approach to Branchwidth / N. Lodha, S. Ordyniak, S. Szeider / Talk: Theory and Application of Satisfiability Testing -- SAT, Bordeaux, France; 2016-07-05 - 2016-07-08; in: "Proceedings of SAT 2016: Theory and Applications of Satisfiability Testing - SAT 2016", (2016), ISBN: 978-3-319-40969-6; 179 - 195
  • Edge-Editing to a Dense and a Sparse Graph Class / M. Kotrbcık, R. Kralovic, S. Ordyniak / Talk: Latin American Theoretical Informatics Symposium, Ensenada, Mexico; 2016-04-11 - 2016-04-15; in: "Proceedings of LATIN 2016: Theoretical Informatics - 12th Latin American Symposium", (2016), ISBN: 978-3-662-49528-5; 562 - 575
  • Using Decomposition-Parameters for QBF: Mind the Prefix! / E. Eiben, R. Ganian, S. Ordyniak / Talk: AAAI Conference, Phoenix, Arizona, USA; 2016-02-12 - 2016-02-17; in: "Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence", (2016), ISBN: 978-1-57735-760-5; 964 - 970
  • The Complexity Landscape of Decompositional Parameters for ILP / R. Ganian, S. Ordyniak / Talk: AAAI Conference, Phoenix, Arizona, USA; 2016-02-12 - 2016-02-17; in: "Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence", (2016), ISBN: 978-1-57735-760-5; 710 - 716
  • Tree-depth and vertex-minors / P. Hlinený, O. Kwon, J. Obdrzalek, S. Ordyniak / European Journal of Combinatorics, 56 (2016), 46 - 56
  • Directed elimination games / V. Engelmann, S. Ordyniak, S. Kreutzer / Discrete Applied Mathematics, 199 (2016), 187 - 198
  • Complexity and monotonicity results for domination games / S. Kreutzer, S. Ordyniak / Theoretical Computer Science, 628 (2016), 1 - 29
  • A Parameterized Study of Maximum Generalized Pattern Matching Problems / S. Ordyniak, A. Popa / Algorithmica, 75 (2016), 1 - 26
  • Backdoors to q-Horn / S. Gaspers, S. Ordyniak, M. S. Ramanujan, S. Saurabh, S. Szeider / Algorithmica (online), 74 (2016), 540 - 557

2015

  • Parameterized Algorithms for Parity Games / J. Gajarsky, M. Lampis, K. Makino, V. Mitsou, S. Ordyniak / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Mailand, Italien; 2015-08-24 - 2015-08-28; in: "Mathematical Foundations of Computer Science 2015 - 40th International Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part {II}", G. Italiano, G. Pighizzini, D. Sannella (ed.); (2015), ISBN: 978-3-662-48053-3; 336 - 347
  • Variable-Deletion Backdoors to Planning / S. Ordyniak / Talk: Postdoc Presentation Days, Masaryk University Brno (invited); 2015-06-21 - 2015-06-26
  • Variable-Deletion Backdoors to Planning / M. Kronegger, A. Pfandler, S. Ordyniak / Poster: Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, Texas, USA; 2015-01-25 - 2015-01-30; in: "Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA", B. Bonet, S. Koenig (ed.); AAAI Press, (2015), 3305 - 3312
  • On finding optimal polytrees / S. Gaspers, M. Koivisto, M. Liedloff, S. Ordyniak, S. Szeider / Theoretical Computer Science, 592 (2015), 49 - 58
  • A Complete Parameterized Complexity Analysis of Bounded Planning / P. Jonsson, S. Ordyniak, S. Szeider / Journal of Computer and System Sciences, 81/7 (2015), 1311 - 1332

2014

2013

2012

  • Valued-Based Argumentation for Tree-like Value Graphs / Ej Kim, S. Ordyniak / Talk: COMMA - International Conference on Computational Models of Argument, Vienna, Austria; 2012-09-10 - 2012-09-12; in: "Fourth International Conference on Computational Models of Argument (Comma 2012)", B. Verheij, St. Szeider, S. Woltran (ed.); IOS Press, Vol. 245 (2012), ISBN: 1614991103; 378 - 389
  • On Finding Optimal Polytrees / S. Gaspers, M. Koivisto, M. Liedloff, S. Ordyniak, St. Szeider / Talk: AAAI Conference, Toronto, Ontario, Canada; 2012-07-22 - 2012-07-26; in: "Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012)", J. Hoffmann, B. Selman (ed.); AAAI Press, (2012), 750 - 756
  • Don´t Be Strict in Local Search! / S. Gaspers, Ej Kim, S. Ordyniak, S. Saurabh, St. Szeider / Talk: AAAI Conference, Toronto, Ontario, Canada; 2012-07-22 - 2012-07-26; in: "Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012)", J. Hoffmann, B. Selman (ed.); AAAI Press, (2012), 486 - 492
  • The Complexity of Planning Revisited - A Parameterized Analysis / C. Bäckström, Y. Chen, P. Jonsson, S. Ordyniak, St. Szeider / Talk: AAAI Conference, Toronto, Ontario, Canada; 2012-07-22 - 2012-07-26; in: "Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012)", J. Hoffmann, B. Selman (ed.); AAAI Press, (2012), 1735 - 1741
  • Augmenting Tractable Fragments of Abstract Argumentation / W. Dvorak, S. Ordyniak, St. Szeider / Artificial Intelligence, 186 (2012), 186; 157 - 173

2011

2010

  • Satisfiability of Acyclic and Almost Acyclic CNF Formulas / S. Ordyniak, D. Paulusma, St. Szeider / Talk: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India; 2010-12-15 - 2010-12-18; in: "IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)", K. Lodaya, M. Mahajan (ed.); Leibniz International Proceedings in Informatics (LIPIcs), (2010), ISSN: 1868-8969; 84 - 95
  • Algorithms and Complexity Results for Persuasive Argumentation / E. Kim, S. Ordyniak, St. Szeider / Talk: COMMA - International Conference on Computational Models of Argument, Desenzano del Garda, Italy; 2010-09-08 - 2010-09-10; in: "Proceedings of Third International Conference on Computational Models of Argument (COMMA 2010)", P. Baroni, F. Cerutti, M. Giacomin, G. Simari (ed.); IOS Press, Frontiers in Artificial Intelligence and Applications 216 (2010), ISBN: 978-1-60750-618-8; 311 - 322
  • Algorithms and Complexity Results for Exact Bayesian Structure Learning / S. Ordyniak, St. Szeider / Poster: Conference on Uncertainty in Artificial Intelligence (UAI), Catalina Island, California, USA; 2010-07-08 - 2010-07-11; in: "Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010)", P. Grünwald, P. Spirtes (ed.); AUAI Press, (2010), ISBN: 978-0-9749039-6-5; 401 - 408