| Publication | Date of Publication | Type |
|---|
| Cluster editing for multi-layer and temporal graphs | 2024-11-12 | Paper |
| Counting temporal paths | 2024-10-08 | Paper |
| The complexity of computing optimum labelings for temporal connectivity | 2024-10-08 | Paper |
| The complexity of computing optimum labelings for temporal connectivity | 2024-08-06 | Paper |
| Minimizing the weighted number of tardy jobs via \((\max,+)\)-convolutions | 2024-07-29 | Paper |
| On the parameterized complexity of interval scheduling with eligible machine sets | 2024-07-01 | Paper |
| Temporal reachability minimization: delaying vs. deleting | 2024-07-01 | Paper |
| Delay-robust routes in temporal graphs | 2024-04-23 | Paper |
| Finding Temporal Paths Under Waiting Time Constraints. | 2023-11-14 | Paper |
| Temporal Reachability Minimization: Delaying vs. Deleting | 2023-08-08 | Paper |
| The Complexity of Transitively Orienting Temporal Graphs | 2023-08-08 | Paper |
| Computing maximum matchings in temporal graphs | 2023-07-10 | Paper |
| Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality | 2023-07-03 | Paper |
| Equitable scheduling on a single machine | 2023-06-27 | Paper |
| Temporal interval cliques and independent sets | 2023-05-23 | Paper |
| On finding separators in temporal split and permutation graphs | 2023-04-21 | Paper |
| Computing maximum matchings in temporal graphs. | 2023-02-07 | Paper |
| Feedback edge sets in temporal graphs | 2022-12-21 | Paper |
| As Time Goes By: Reflections on Treewidth for Temporal Graphs | 2022-10-19 | Paper |
| Cluster Editing in Multi-Layer and Temporal Graphs. | 2022-07-21 | Paper |
| Parameterized Dynamic Cluster Editing | 2022-07-21 | Paper |
| Towards classifying the polynomial-time solvability of temporal betweenness centrality | 2022-06-08 | Paper |
| On finding separators in temporal split and permutation graphs | 2022-05-20 | Paper |
| A parameterized complexity view on collapsing \(k\)-cores | 2021-12-18 | Paper |
| Combining clickstream analyses and graph-modeled data clustering for identifying common response processes | 2021-12-16 | Paper |
| The complexity of finding temporal separators under waiting time constraints | 2021-12-14 | Paper |
| Feedback edge sets in temporal graphs | 2021-12-07 | Paper |
| Finding temporal paths under waiting time constraints | 2021-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009469 | 2021-08-04 | Paper |
| The Complexity of Finding Small Separators in Temporal Graphs | 2021-08-04 | Paper |
| Sliding window temporal graph coloring | 2021-06-30 | Paper |
| Interference-free Walks in Time: Temporally Disjoint Paths | 2021-05-18 | Paper |
| Firefighting as a Strategic Game | 2021-03-26 | Paper |
| Parameterized dynamic cluster editing | 2021-02-01 | Paper |
| The Parameterized Complexity of Centrality Improvement in Networks | 2020-10-21 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 2020-09-08 | Paper |
| Efficient algorithms for measuring the funnel-likeness of DAGs | 2020-02-03 | Paper |
| Temporal graph classes: a view through temporal separators | 2020-01-16 | Paper |
| The complexity of finding small separators in temporal graphs | 2019-11-29 | Paper |
| The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs | 2019-01-14 | Paper |
| Temporal graph classes: a view through temporal separators | 2018-11-22 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 2018-09-06 | Paper |
| Efficient algorithms for measuring the funnel-likeness of DAGs | 2018-08-17 | Paper |
| h-Index Manipulation by Undoing Merges | 2018-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634388 | 2018-04-10 | Paper |
| The minimum shared edges problem on grid-like graphs | 2018-01-04 | Paper |
| Assessing the Computational Complexity of Multi-layer Subgraph Detection | 2017-07-21 | Paper |
| Firefighting as a Game | 2015-09-09 | Paper |
