19 citations · 26 across the 3 of their papers we have counts for
3 papers
Maximizing a Submodular Function with Viability Constraints
Wolfgang Dvořák, Monika Henzinger, David P. Williamson
We study the problem of maximizing a monotone submodular function with viability constraints. This problem originates from computational biology, where we are given a phylogenetic…
Conditionally Optimal Algorithms for Generalized Büchi Games
Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger +1
Games on graphs provide the appropriate framework to study several central problems in computer science, such as the verification and synthesis of reactive systems. One of the most…
Compact Argumentation Frameworks
Ringo Baumann, Wolfgang Dvorák, Thomas Linsbichler +2
Abstract argumentation frameworks (AFs) are one of the most studied formalisms in AI. In this work, we introduce a certain subclass of AFs which we call compact. Given an extension…