| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Computing Maximum Matchings in Temporal Graphs | Mertzios, George B. et al. | 2020 |
| 2 | Finding Temporal Paths Under Waiting Time Constraints | Casteigts, Arnaud et al. | 2020 |
| 3 | A Parameterized Complexity View on Collapsing k-Cores | Luo, Junjie et al. | 2019 |
| 4 | Cluster Editing in Multi-Layer and Temporal Graphs | Chen, Jiehua et al. | 2018 |
| 5 | Parameterized Dynamic Cluster Editing | Luo, Junjie et al. | 2018 |
| 6 | The Complexity of Finding Small Separators in Temporal Graphs | Zschoche, Philipp et al. | 2018 |
| 7 | Finding Secluded Places of Special Interest in Graphs | van Bevern, René et al. | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |