Jona Dirks

According to our database1, Jona Dirks authored at least 8 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2025
Weighted Treedepth is NP-complete on Graphs of Bounded Degree.
CoRR, October, 2025

Lower bounds for dominating set reconfiguration on sparse (directed) graphs.
CoRR, July, 2025

Token Sliding Reconfiguration on DAGs.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

PACE Solver Description: OBLX Exact Solver for the Dominating Set Problem.
Proceedings of the 20th International Symposium on Parameterized and Exact Computation, 2025

2024
Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2022
The problem of packing modification-disjoint P3 - an overview and an improved heuristic approach.
Proceedings of the Studierendenkonferenz Informatik, 2022

PACE Solver Description: GraPA-JAVA.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021
PACE Solver Description: PACA-JAVA.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021


  Loading...