Wolfgang Dvorak

Senior Lecturer Dipl.-Ing. Dipl.-Ing. Dr.techn.

Research Focus

Research Areas

  • Computational complexity, Argumentation, Logic Programming, Nonmonotonic Reasoning, Theoretical Compurter Science, Parameterized Complexity, Algorithms and Data Structures, Complexity in Artificial Intelligence and logic programming
Wolfgang Dvorak

About

My research interests lie in theoretical computer science. Find below a 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

Role

2020

2019

  • On the expressive power of collective attacks / W. Dvorak, S. Woltran, J. Fandinno / Argument & Computation, 10 (2019), 2; 191 - 230
  • A general notion of equivalence for abstract argumentation / W. Dvorak, R. Baumann, T. Linsbichler, S. Woltran / Artificial Intelligence, 275 (2019), 275; 379 - 410
  • Strong Equivalence for Argumentation Frameworks with Collective Attacks / W. Dvorak, A. Rapberger, S. Woltran / Talk: KI 2019 - 42nd German Conference on AI, Kassel, Deutschland; 2019-09-23 - 2019-09-26; in: "KI 2019: Advances in Artificial Intelligence - 42nd German Conference on AI", 11793 (2019), ISBN: 978-3-030-30178-1; 131 - 145
  • Preprocessing Argumentation Frameworks via Replacement Patterns / W. Dvorak, M. Järvisalo, T. Linsbichler, A. Niskanen, S. Woltran / Talk: JELIA 2019 - 16th Edition of the European Conference on Logics in Artificial Intelligence, Rende, Kalbrien, Italien; 2019-05-07 - 2019-05-11; in: "Logics in Artificial Intelligence - 16th European Conference, {JELIA} 2019, Proceedings", Springer, 11468 (2019), ISBN: 978-3-030-19569-4; 116 - 132
  • Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs / K. Chatterjee, W. Dvorak, M. Henzinger, A. Svozil / Talk: CONCUR 2019 - The 30th International Conference on Concurrency Theory, Amsterdam, Niederlande; 2019-08-26 - 2019-08-31; in: "30th International Conference on Concurrency Theory, {CONCUR} 2019", Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 140 (2019), ISBN: 978-3-95977-121-4; 1 - 16
  • Complexity of Abstract Argumentation under a Claim-Centric View / W. Dvorak, S. Woltran / Talk: AAAI 2019 - 33rd Conference on Artificial Intelligence, Honolulu, Hawaii; 2019-01-27 - 2019-02-01; in: "The Thirty-Third {AAAI} Conference on Artificial Intelligence, {AAAI} 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, {IAAI} 2019, The Ninth {AAAI} Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2019", AAAI Press, 33 (2019), ISBN: 978-1-57735-809-1; 2801 - 2808

2018

  • Expressive Power of Collective Attacks / W. Dvorak, K. Chatterjee, M. Henzinger, V. Loitzenbauer / Talk: Highlights of Algorithms 2018, HALG 2018, Amsterdam; 2018-06-04 - 2018-06-06
  • Lower bounds for symbolic computation on graphs / W. Dvorak / Talk: Helmuth Veith Memorial Workshop, Salzburg (invited); 2018-01-28 - 2018-01-31
  • Computational Problems in Formal Argumentation and their Complexity / W. Dvorak, P. Dunne / in: "Handbook of Formal Argumentation", Springer International Publishing, 2018, 2557 - 2622
  • Application of ASP in formal argumentation / W. Dvorak, J. Pührer, J. P. Wallner, S. Woltran, M. Diller / Talk: TAASP - Workshop on Trends and Applications of Answer Set Programming, Wien; 2018-11-19 - 2018-11-20; in: "2nd Workshop on Trends and Applications of Answer Set Programming (TAASP 2018)", (2018), 1 - 11
  • Quasipolynomial Set-Based Symbolic Algorithms for Parity Games / A. Svozil, W. Dvorak, K. Chatterjee, M. Henzinger / Talk: International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Awassa, Ethiopia; 2018-11-16 - 2018-11-21; in: "LPAR 2018 : International Conference on Logic for Programming, Artificial Intelligence and Reasoning", EasyChair Publications, in the EPiC Series in Computing, 57 (2018), 233 - 253
  • Evaluating SETAFs via Answer-Set Programming / W. Dvorak, S. Woltran, A. Gressler / Talk: 2nd International Workshop on Systems and Algorithms for Formal Argumentation, Warschau; 2018-09-11; in: "2nd International Workshop on Systems and Algorithms for Formal Argumentation", CEUR-WS.org, 2171 (2018), ISSN: 1613-0073; 10 - 21
  • On the Expressive Power of Collective Attacks / W. Dvorak, S. Woltran, J. Fandinno / Talk: 7th International Conference on Computational Models of Argument, Warschau; 2018-09-11 - 2018-09-14; in: "7th International Conference on Computational Models of Argument", IOS Press, 305 (2018), ISBN: 978-1-61499-905-8; 1 - 27
  • Algorithms and Conditional Lower bounds for Planning Problems / W. Dvorak, K. Chatterjee, M. Henzinger, A. Svozil / Talk: International Conference on Automated Planning and Scheduling (ICAPS), Delft; 2018-06-24 - 2018-06-29; in: "International Conference on Automated Planning and Scheduling (ICAPS 2018)", CoRR, abs/1804.07031 (2018), 1 - 14
  • Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter / W. Dvorak, K. Chatterjee, M. Henzinger, V. Loitzenbauer / Talk: ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, Louisiana, USA; 2018-01-07 - 2018-01-10; in: "Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018", (2018), 2341 - 2356

2017

2016

2012

2011

2010

2009