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 How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? Akrida, Eleni C. et al. 2019
5 Temporal Vertex Cover with a Sliding Time Window Akrida, Eleni C. et al. 2018
6 Binary Search in Graphs Revisited Deligkas, Argyrios et al. 2017
7 Finding Secluded Places of Special Interest in Graphs van Bevern, René et al. 2017
8 The Power of Linear-Time Data Reduction for Maximum Matching Mertzios, George B. et al. 2017
9 Stably Computing Order Statistics with Arithmetic Population Protocols Mertzios, George B. et al. 2016
10 New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs Giannopoulou, Archontia C. et al. 2015
11 Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs Giannopoulou, Archontia C. et al. 2015
12 The Recognition of Triangle Graphs Mertzios, George B. 2011
13 The Recognition of Tolerance and Bounded Tolerance Graphs Mertzios, George B. et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 13


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