| No. |
Title |
Author |
Year |
| 1 |
Giant Components in Random Temporal Graphs |
Becker, Ruben et al. |
2023 |
| 2 |
Optimal Adjacency Labels for Subgraphs of Cartesian Products |
Esperet, Louis et al. |
2023 |
| 3 |
Faster Exploration of Some Temporal Graphs |
Adamson, Duncan et al. |
2022 |
| 4 |
Computing Maximum Matchings in Temporal Graphs |
Mertzios, George B. et al. |
2020 |
| 5 |
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle |
Deligkas, Argyrios et al. |
2020 |
| 6 |
Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks |
Enright, Jessica et al. |
2019 |
| 7 |
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs |
Konrad, Christian et al. |
2019 |
| 8 |
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? |
Akrida, Eleni C. et al. |
2019 |
| 9 |
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal |
Dabrowski, Konrad K. et al. |
2018 |
| 10 |
Temporal Vertex Cover with a Sliding Time Window |
Akrida, Eleni C. et al. |
2018 |
| 11 |
Clique-Width for Graph Classes Closed under Complementation |
Blanché, Alexandre et al. |
2017 |
