Faster Algorithms for Mean-Payoff Parity Games. - Krishnendu Chatterjee; Monika Henzinger; Alexander Svozil (MFCS, 2017)

Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (LPAR, 2018)

Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (CONCUR, 2019)

Fully Dynamic k-Center Clustering in Doubling Metrics. - Gramoz Goranci; Monika Henzinger; Dariusz Leniowski; Alexander Svozil (CoRR, 2019)

Fully Dynamic k-Center Clustering in Low Dimensional Metrics. - Gramoz Goranci; Monika Henzinger; Dariusz Leniowski; Christian Schulz 003; Alexander Svozil (ALENEX, 2021)

Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. - Krishnendu Chatterjee; Monika Henzinger; Sagar Kale; Alexander Svozil (ICALP, 2021)

Symbolic Time and Space Tradeoffs for Probabilistic Verification. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (LICS, 2021)

Algorithms and conditional lower bounds for planning problems. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (Artif. Intell., 2021)

Moderne Graphalgorithmen für die formale Verifikation. - Alexander Svozil (Ausgezeichnete Informatikdissertationen, 2021)

Leveraging the Power of Graph Algorithms: Efficient Algorithms for Computer-Aided Verification. - Alexander Svozil (CoRR, 2022)