No. Title Author Year
1 Budgeted Dominating Sets in Uncertain Graphs Choudhary, Keerti et al. 2021
2 Graph Realizations: Maximum Degree in Vertex Neighborhoods Bar-Noy, Amotz et al. 2020
3 Minimum Neighboring Degree Realization in Graphs and Trees Bar-Noy, Amotz et al. 2020
4 New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures Chakraborty, Diptarka et al. 2020
5 New Fault Tolerant Subset Preservers Bodwin, Greg et al. 2020
6 Efficiently Realizing Interval Sequences Bar-Noy, Amotz et al. 2019
7 Efficient Oracles and Routing Schemes for Replacement Paths Bilò, Davide et al. 2018
8 An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model Baswana, Surender et al. 2017
9 An Optimal Dual Fault Tolerant Reachability Oracle Choudhary, Keerti 2016
Current Page :
Number of result pages: 1
Number of documents: 9


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