Contact

Dr. Sebastian Ordyniak
Institute of Information Systems (184/3)
Vienna University of Technology (TU Wien)
Favoritenstraße 9-11
A-1040 Vienna, Austria

Phone: +43 (1) 58801 18421
e-mail: ordyniak @ kr.tuwien.ac.at

Research Interests

I am a postdoctoral researcher in the Knowledge-Based Systems Group of the Institute of Information Systems at the Vienna University of Technology. The position is funded through Prof. Stefan Szeider's ERC grant on the parameterized complexity of reasoning problems.

Publications

Most of my papers are also listed at the DBLP Computer Science Bibliography. Try DBLP Viz for a visualization of coauthorship.

Conference Papers

  1. Satisfiability of Acyclic and Almost Acyclic CNF Formulas. Sebastian Ordyniak, Daniel Paulusma, and Stefan Szeider. Proceedings of FSTTCS 2010, 30th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, December 15-18, 2010, IMSc, Chennai, India. Leibniz International Proceedings in Informatics (LIPIcs), to appear.
  2. Algorithms and Complexity Results for Persuasive Argumentation. Eun Jung Kim, Sebastian Ordyniak and Stefan Szeider. Proceedings of COMMA 2010, Third International Conference on Computational Models of Argument, Desenzano del Garda, Italy, September 8-10, 2010. Froniers in Artificial Intelligence and Applications, vol. 216, IOS Press, 2010, pp. 311-322.
  3. Algorithms and Complexity Results for Exact Bayesian Structure Learning. Sebastian Ordyniak and Stefan Szeider. Proceedings of UAI 2010, The 26th Conference on Uncertainty in Artificial Intelligence, Catalina Island, California, USA, July 8-11, 2010. Peter Grünwald and Peter Spirtes (eds.), AUAI Press, Corvallis, pp. 401-408, 2010.
  4. Distance d-Domination Games. Stephan Kreutzer and Sebastian Ordyniak. Proceedings of WG 2009, The 35th International Workshop on Graph-Theoretic Concepts in Computer Science, Montpellier, France, June 24-26, 2009. Christophe Paul and Michel Habib (eds.), Lecture Notes in Computer Science, Springer, pp. 308-319, 2009.
  5. Digraph Decompositions and Monotonicity in Digraph Searching. Stephan Kreutzer and Sebastian Ordyniak. Proceedings of WG 2008, The 34th International Workshop on Graph-Theoretic Concepts in Computer Science, Durham, UK, 30 June - 2 July, 2008. Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Daniel Paulusma (eds.), Lecture Notes in Computer Science, Springer, pp. 336-347, 2008.