PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT

Authors Rafael Kiesel , André Schidler

Thumbnail PDF


  • Filesize: 0.55 MB
  • 4 pages

Document Identifiers

Author Details

Rafael Kiesel
  • TU Wien, Austria
André Schidler
  • TU Wien, Austria

Cite AsGet BibTex

Rafael Kiesel and André Schidler. PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 32:1-32:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


We describe the solver DAGer for the Directed Feedback Vertex Set (DFVS) problem, as it was submitted to the exact track of the 2022 PACE Challenge. Our approach first applies a wide range of preprocessing techniques involving both well-known data reductions for DFVS as well as non-trivial adaptations from the vertex cover problem. For the actual solving, we found that using a MaxSAT solver with incremental constraints achieves a good performance.

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
  • Directed Feeback Vertex Set
  • Data Reductions
  • Incremental MaxSAT


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Ali Baharev, Hermann Schichl, Arnold Neumaier, and Tobias Achterberg. An exact method for the minimum feedback arc set problem. Journal of Experimental Algorithmics (JEA), 26:1-28, 2021. Google Scholar
  2. Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, and Igor Razgon. A fixed-parameter algorithm for the directed feedback vertex set problem. In Cynthia Dwork, editor, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pages 177-186. ACM, 2008. Google Scholar
  3. Wolfgang Dvorák, Markus Hecher, Matthias König, André Schidler, Stefan Szeider, and Stefan Woltran. Tractable abstract argumentation via backdoor-treewidth. In AAAI 2022, 2022. Google Scholar
  4. Wolfgang Dvorák, Sebastian Ordyniak, and Stefan Szeider. Augmenting tractable fragments of abstract argumentation. Artif. Intell., 186:157-173, 2012. URL:
  5. Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, and Mathias Weller. What is known about vertex cover kernelization? In Hans-Joachim Böckenhauer, Dennis Komm, and Walter Unger, editors, Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, volume 11011 of Lecture Notes in Computer Science, pages 330-356. Springer, 2018. URL:
  6. Richard M. Karp. Reducibility among combinatorial problems. In Raymond E. Miller and James W. Thatcher, editors, Proceedings of a Symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA, The IBM Research Symposia Series, pages 85-103. Plenum Press, New York, 1972. URL:
  7. Mile Lemaic. Markov-chain-based heuristics for the feedback vertex set problem for digraphs. PhD thesis, Universität zu Köln, 2008. Google Scholar
  8. Hen-Ming Lin and Jing-Yang Jou. On computing the minimum feedback vertex set of a directed graph by contraction operations. IEEE TCAD, 19(3):295-307, 2000. Google Scholar
  9. Christian Schulz, Ernestine Großmann, Tobias Heuer, and Darren Strash. Pace 2022. URL:
  10. Abraham Silberschatz, Greg Gagne, and Peter B Galvin. Operating System Concepts. JW Wiley, 2018. Google Scholar
  11. Ulrike Stege and Michael Ralph Fellows. An improved fixed parameter tractable algorithm for vertex cover. Technical report/Departement Informatik, ETH Zürich, 318, 1999. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail