Vyzkoušejte nový nástroj s podporou AI
Summon Research Assistant
BETA
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing
Bernstein, Aaron, Gutenberg, Maximilian Probst, Saranurak, Thatchaphol
Published in Proceedings / annual Symposium on Foundations of Computer Science (01.11.2020)
Published in Proceedings / annual Symposium on Foundations of Computer Science (01.11.2020)
Get full text
Conference Proceeding
New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs
Gutenberg, Maximilian Probst, Williams, Virginia Vassilevska, Wein, Nicole
Year of Publication 29.01.2020
Year of Publication 29.01.2020
Get full text
Journal Article
Fair Matchings and Related Problems
Huang, Chien-Chung, Kavitha, Telikepalli, Mehlhorn, Kurt, Michail, Dimitrios
Published in Algorithmica (01.03.2016)
Published in Algorithmica (01.03.2016)
Get full text
Journal Article
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing
Bernstein, Aaron, Gutenberg, Maximilian Probst, Saranurak, Thatchaphol
Year of Publication 05.09.2020
Year of Publication 05.09.2020
Get full text
Journal Article
Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem
D'Emidio, Mattia, Forlizzi, Luca, Frigioni, Daniele, Leucci, Stefano, Proietti, Guido
Year of Publication 31.01.2018
Year of Publication 31.01.2018
Get full text
Journal Article