Current Work and Research Interests

I hold a venia docendi (Habilitation) in theoretical computer science at the University of Vienna. Currently, I am employed at TU Wien at the Institute of Logic and Computation (for up to date information see my webpage there). Before that, I was with the Theory and Applications of Algorithms Group (Faculty of Computer Science) at the University of Vienna.

My research interests lie in theoretical computer science. Find below a (incomplete) list of topics I'm interested in.

• (Analysis of) Algorithms
• Approximation Algorithms
• Complexity Theory and Complexity Analysis
• Conditional Lower Bounds
• Parameterized Complexity
• Knowledge Representation and Reasoning
• (Abstract) Argumentation
• Graphs and Graph Parameters
• Answer Set Programming
• ...

Recent & Upcoming Papers

• Complexity of Abstract Argumentation Under a Claim-centric View
  Wolfgang Dvořák, Stefan Woltran
  accepted for AAAI-19
• Applications of ASP in Formal Argumentation
  Martin Diller, Wolfgang Dvořák, Jörg Pührer, Johannes P. Wallner, Stefan Woltran
  accepted for the Workshop on Trends and Applications of Answer Set Programming (TAASP 18)
• Quasipolynomial Set-Based Symbolic Algorithms for Parity Games
  Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger, Alexander Svozil
  accepted for LPAR-22 [paper]
• Evaluating SETAFs via Answer-Set Programming
  Wolfgang Dvořák, Alexander Greßler, Stefan Woltran
  SAFA 2018, 22-35 [paper]
• On the Expressive Power of Collective Attacks
  Wolfgang Dvořák, Jorge Fandinno, Stefan Woltran
  COMMA 2018, 49 - 60 [paper]
• Computational Problems in Formal Argumentation and their Complexity
  Wolfgang Dvořák, Paul E. Dunne
  In Handbook of Formal Argumentation, pages 631-688, 2018 [Handbook at College Publications, authors' version of the chapter]
• Algorithms and Conditional Lower bounds for Planning Problems
  Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger, Alexander Svozil
  accepted for ICAPS 2018
• Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter.
  Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger, Veronika Loitzenbauer
  SODA 2018, 2341-2356 [ paper | arXiv-version ]
• Computational Problems in Formal Argumentation and their Complexity
  Wolfgang Dvořák, Paul E. Dunne
  IFCoLog Journal of Logics and Their Applications 4(8): 2557-2622, 2017 [Issue 8]
• Improved Set-based Symbolic Algorithms for Parity Games.
  Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger, Veronika Loitzenbauer
  CSL 2017 18:1-18:21 [ paper | arXiv-version ]
• A General Notion of Equivalence for Abstract Argumentation
  Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler, Stefan Woltran
  IJCAI 2017: 800-806 [ paper ]

Full publication record

---