No. Title Author Year
1 Computing Maximum Matchings in Temporal Graphs Mertzios, George B. et al. 2020
2 Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle Deligkas, Argyrios et al. 2020
3 Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks Enright, Jessica et al. 2019
4 Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs Konrad, Christian et al. 2019
5 How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? Akrida, Eleni C. et al. 2019
6 On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal Dabrowski, Konrad K. et al. 2018
7 Temporal Vertex Cover with a Sliding Time Window Akrida, Eleni C. et al. 2018
8 Clique-Width for Graph Classes Closed under Complementation Blanché, Alexandre et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 8

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI