Petra Wolf

Orcid: 0000-0003-3097-3906

Affiliations:
  • LaBRI, Université de Bordeaux, France
  • University of Bergen, Norway (former)
  • University of Trier, Germany (Ph.D., 2022)
  • University of Tübingen, Germany (former)


According to our database1, Petra Wolf authored at least 31 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Learning from positive and negative examples: New proof for binary alphabets.
Inf. Process. Lett., January, 2024

2023
Synchronizing deterministic push-down automata can be really hard.
Inf. Comput., December, 2023

Order Reconfiguration under Width Constraints.
J. Graph Algorithms Appl., 2023

Traversing automata with current state uncertainty under LTL<sub>f</sub> constraints.
CoRR, 2023

Defensive Alliances in Signed Networks.
CoRR, 2023

Heuristic for Diverse Kemeny Rank Aggregation based on Quantum Annealing.
CoRR, 2023

Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Kernelizing Temporal Exploration Problems.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

PACE Solver Description: Zygosity.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Cluster Editing with Overlapping Communities.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Synchronization and Diversity of Solutions.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Generalisierte Synchronisation endlicher Automaten.
Ausgezeichnete Informatikdissertationen, 2022

Generalized Synchronization and Intersection Non-Emptiness of Finite-State Automata.
PhD thesis, 2022

From decidability to undecidability by considering regular sets of instances.
Theor. Comput. Sci., 2022

All Paths Lead to Rome.
CoRR, 2022

On the decidability of finding a positive ILP-instance in a regular set of ILP-instances.
Acta Informatica, 2022

Preface to Klaus-Jörn Lange Festschrift.
Acta Informatica, 2022

Properties of graphs specified by a regular language.
Acta Informatica, 2022

Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021
A Timecop's Chase Around the Table.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Diversity in Kemeny Rank Aggregation: A Parameterized Approach.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Improving Run Length Encoding by Preprocessing.
Proceedings of the 31st Data Compression Conference, 2021

Decomposing Permutation Automata.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata.
CoRR, 2020

Synchronization of Deterministic Visibly Push-Down Automata.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Width Notions for Ordering-Related Problems.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Synchronization Under Dynamic Constraints.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
Computational Complexity of Synchronization under Regular Constraints.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy.
Proceedings of the Language and Automata Theory and Applications, 2018

Restricted Power - Computational Complexity Results for Strategic Defense Games.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018


  Loading...