Loukas Georgiadis
Loukas Georgiadis
Department of Computer Science & Engineering, University of Ioannina
Verified email at - Homepage
Cited by
Cited by
Linear-time algorithms for dominators and other path-evaluation problems
AL Buchsbaum, L Georgiadis, H Kaplan, A Rogers, RE Tarjan, ...
SIAM Journal on Computing 38 (4), 1533-1573, 2008
Finding dominators revisited
L Georgiadis, RE Tarjan
SODA, 869-878, 2004
Finding dominators in practice
L Georgiadis, R Tarjan, R Werneck
Journal of Graph Algorithms and Applications 10 (1), 69-94, 2006
Shortest-path feasibility algorithms: An experimental evaluation
BV Cherkassky, L Georgiadis, AV Goldberg, RE Tarjan, RF Werneck
Journal of Experimental Algorithmics (JEA) 14, 2.7-2.37, 2010
2-edge connectivity in directed graphs
L Georgiadis, GF Italiano, L Laura, N Parotsidis
ACM Transactions on Algorithms (TALG) 13 (1), 1-24, 2016
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
L Georgiadis
International Colloquium on Automata, Languages, and Programming, 738-749, 2010
An experimental study of minimum mean cycle algorithms
L Georgiadis, AV Goldberg, RE Tarjan, RF Werneck
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and …, 2009
2-vertex connectivity in directed graphs
L Georgiadis, GF Italiano, L Laura, N Parotsidis
Information and Computation 261, 248-264, 2018
Finding dominators via disjoint set union
W Fraczak, L Georgiadis, A Miller, RE Tarjan
Journal of Discrete Algorithms 23, 2-20, 2013
Improved Dynamic Planar Point Location.
L Arge, GS Brodal, L Georgiadis
FOCS, 305-314, 2006
Strong connectivity in directed graphs under failures, with applications
L Georgiadis, GF Italiano, N Parotsidis
SIAM Journal on Computing 49 (5), 865-926, 2020
Dominator tree verification and vertex-disjoint paths
L Georgiadis, RE Tarjan
SODA 5, 433-442, 2005
Finding dominators in practice
L Georgiadis, RF Werneck, RE Tarjan, S Triantafyllis, DI August
Algorithms–ESA 2004: 12th Annual European Symposium, Bergen, Norway …, 2004
Faster algorithms for all-pairs bounded min-cuts
A Abboud, L Georgiadis, GF Italiano, R Krauthgamer, N Parotsidis, ...
arXiv preprint arXiv:1807.05803, 2018
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
L Georgiadis
European Symposium on Algorithms, 13-24, 2011
Dominator tree certification and divergent spanning trees
L Georgiadis, RE Tarjan
ACM Transactions on Algorithms (TALG) 12 (1), 1-42, 2015
An O (nlogn) version of the Averbakh–Berman algorithm for the robust median of a tree
GS Brodal, L Georgiadis, I Katriel
Operations Research Letters 36 (1), 14-18, 2008
Dynamic matchings in convex bipartite graphs
GS Brodal, L Georgiadis, KA Hansen, I Katriel
International Symposium on Mathematical Foundations of Computer Science, 406-417, 2007
Computing critical nodes in directed graphs
N Paudel, L Georgiadis, GF Italiano
Journal of Experimental Algorithmics (JEA) 23, 1-24, 2018
2-connectivity in directed graphs: An experimental study
W Di Luigi, L Georgiadis, GF Italiano, L Laura, N Parotsidis
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and …, 2014
The system can't perform the operation now. Try again later.
Articles 1–20