Restricted Power - Computational Complexity Results for Strategic Defense Games. - Ronald de Haan; Petra Wolf 002 (FUN, 2018)

Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy. - Demen Güler; Andreas Krebs; Klaus-Jörn Lange; Petra Wolf 002 (LATA, 2018)

Computational Complexity of Synchronization under Regular Constraints. - Henning Fernau; Vladimir V. Gusev; Stefan Hoffmann 001; Markus Holzer 001; Mikhail V. Volkov 001; Petra Wolf 002 (MFCS, 2019)

Synchronization Under Dynamic Constraints. - Petra Wolf 002 (FSTTCS, 2020)

Width Notions for Ordering-Related Problems. - Emmanuel Arrighi; Henning Fernau; Mateus de Oliveira Oliveira; Petra Wolf 002 (FSTTCS, 2020)

Synchronization of Deterministic Visibly Push-Down Automata. - Henning Fernau; Petra Wolf 002 (FSTTCS, 2020)

Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata. - Petra Wolf 002; Henning Fernau (CoRR, 2020)

Decomposing Permutation Automata. - Ismaël Jecker; Nicolas Mazzocchi; Petra Wolf 002 (CONCUR, 2021)

Improving Run Length Encoding by Preprocessing. - Sven Fiergolla; Petra Wolf 002 (DCC, 2021)

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. - Emmanuel Arrighi; Henning Fernau; Stefan Hoffmann 001; Markus Holzer 001; Ismaël Jecker; Mateus de Oliveira Oliveira; Petra Wolf 002 (FSTTCS, 2021)

Diversity in Kemeny Rank Aggregation: A Parameterized Approach. - Emmanuel Arrighi; Henning Fernau; Daniel Lokshtanov; Mateus de Oliveira Oliveira; Petra Wolf 002 (IJCAI, 2021)

A Timecop's Chase Around the Table. - Nils Morawietz; Petra Wolf 002 (MFCS, 2021)

Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms. - Jonas Lingg; Mateus de Oliveira Oliveira; Petra Wolf 002 (IWOCA, 2022)

All Paths Lead to Rome. - Kevin Goergen; Henning Fernau; Esther Oest; Petra Wolf 002 (JCDCGGG, 2022)

Properties of graphs specified by a regular language. - Volker Diekert; Henning Fernau; Petra Wolf 002 (Acta Informatica, 2022)

Preface to Klaus-Jörn Lange Festschrift. - Henning Fernau; Markus Holzer 001; Petra Wolf 002 (Acta Informatica, 2022)

On the decidability of finding a positive ILP-instance in a regular set of ILP-instances. - Petra Wolf 002 (Acta Informatica, 2022)

From decidability to undecidability by considering regular sets of instances. - Petra Wolf 002 (Theor. Comput. Sci., 2022)

Generalized Synchronization and Intersection Non-Emptiness of Finite-State Automata. - Petra Wolf 002 (2022)

Generalisierte Synchronisation endlicher Automaten. - Petra Wolf 002 (Ausgezeichnete Informatikdissertationen, 2022)

Synchronization and Diversity of Solutions. - Emmanuel Arrighi; Henning Fernau; Mateus de Oliveira Oliveira; Petra Wolf 002 (AAAI, 2023)

Cluster Editing with Overlapping Communities. - Emmanuel Arrighi; Matthias Bentert; Pål Grønås Drange; Blair D. Sullivan; Petra Wolf 002 (IPEC, 2023)

PACE Solver Description: Zygosity. - Emmanuel Arrighi; Pål Grønås Drange; Kenneth Langedal; Farhad Vadiee; Martin Vatshelle; Petra Wolf 002 (IPEC, 2023)

Kernelizing Temporal Exploration Problems. - Emmanuel Arrighi; Fedor V. Fomin; Petr A. Golovach; Petra Wolf 002 (IPEC, 2023)

Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. - Emmanuel Arrighi; Niels Grüttemeier; Nils Morawietz; Frank Sommer; Petra Wolf 002 (SOFSEM, 2023)

Heuristic for Diverse Kemeny Rank Aggregation based on Quantum Annealing. - Sven Fiergolla; Kevin Goergen; Patrick Neises; Petra Wolf 002 (CoRR, 2023)

Traversing automata with current state uncertainty under LTLf constraints. - Andrew Ryzhikov; Petra Wolf 002 (CoRR, 2023)

Order Reconfiguration under Width Constraints. - Emmanuel Arrighi; Henning Fernau; Mateus de Oliveira Oliveira; Petra Wolf 002 (J. Graph Algorithms Appl., 2023)

Synchronizing deterministic push-down automata can be really hard. - Henning Fernau; Petra Wolf 002; Tomoyuki Yamakami (Inf. Comput., 2023)

On Switching Finite State Automata. - Joss Chapman; Markus Holzer 001; Petra Wolf 002 (MCU, 2024)

Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. - Arnaud Casteigts; Nils Morawietz; Petra Wolf 002 (MFCS, 2024)

Monoids of Upper Triangular Matrices over the Boolean Semiring. - Andrew Ryzhikov; Petra Wolf 002 (MFCS, 2024)

Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times. - Kaja Balzereit; Niels Grüttemeier; Nils Morawietz; Dennis Reinhardt; Stefan Windmann; Petra Wolf 002 (CoRR, 2024)

A cop and robber game on edge-periodic temporal graphs. - Thomas Erlebach; Nils Morawietz; Jakob T. Spooner; Petra Wolf 002 (J. Comput. Syst. Sci., 2024)

Learning from positive and negative examples: New proof for binary alphabets. - Jonas Lingg; Mateus de Oliveira Oliveira; Petra Wolf 002 (Inf. Process. Lett., 2024)

Defensive Alliances in Signed Networks. - Emmanuel Arrighi; Zhidan Feng 002; Henning Fernau; Kevin Mann; Xingqin Qi; Petra Wolf 002 (J. Artif. Intell. Res., 2025)

Parameterized algorithms for multi-label periodic temporal graph realization. - Thomas Erlebach; Nils Morawietz; Petra Wolf 002 (Theor. Comput. Sci., 2025)

Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs. - Emmanuel Arrighi; Niels Grüttemeier; Nils Morawietz; Frank Sommer; Petra Wolf 002 (Discret. Appl. Math., 2026)