-
Distributed Graph Realizations
CoRR 2020
+Save
-
Distributed Graph Realizations †
2020 IEEE International Parallel and Distributed Processing Symposium
(IPDPS), New Orleans, LA, USA, May 18-22, 2020 2020 DOI: 10.1109/IPDPS47924.2020.00026
+Save
-
Efficiently Realizing Interval Sequences
SIAM J. Discret. Math. 2020 DOI: 10.1137/20M1326489
+Save
-
Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal
Approximation Algorithms
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms,
SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020 2020 DOI: 10.1137/1.9781611975994.30
+Save
-
Graph Realizations: Maximum Degree in Vertex Neighborhoods
17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT
2020, June 22-24, 2020, Tórshavn, Faroe Islands 2020 DOI: 10.4230/LIPIcs.SWAT.2020.10
+Save
-
Minimum Neighboring Degree Realization in Graphs and Trees
28th Annual European Symposium on Algorithms, ESA 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference) 2020 DOI: 10.4230/LIPIcs.ESA.2020.10
+Save
-
New Extremal Bounds for Reachability and Strong-Connectivity Preservers
Under Failures
47th International Colloquium on Automata, Languages, and Programming,
ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual
Conference) 2020 DOI: 10.4230/LIPIcs.ICALP.2020.25
+Save
-
New Extremal bounds for Reachability and Strong-Connectivity Preservers
under failures
CoRR 2020
+Save
-
New Fault Tolerant Subset Preservers
47th International Colloquium on Automata, Languages, and Programming,
ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual
Conference) 2020 DOI: 10.4230/LIPIcs.ICALP.2020.15
+Save
-
Approximate Single-Source Fault Tolerant Shortest Path
ACM Trans. Algorithms 2020 DOI: 10.1145/3397532
+Save