Prati
Loukas Georgiadis
Loukas Georgiadis
Department of Computer Science & Engineering, University of Ioannina
Potvrđena adresa e-pošte na cs.uoi.gr - Početna stranica
Naslov
Citirano
Citirano
Godina
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
932008
Finding dominators revisited
L Georgiadis, RE Tarjan
SODA, 869-878, 2004
892004
Finding dominators in practice
L Georgiadis, RE Tarjan, RF Werneck
Journal of Graph Algorithms and Applications 10 (1), 69-94, 2006
752006
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
572010
2-edge connectivity in directed graphs
L Georgiadis, GF Italiano, L Laura, N Parotsidis
ACM Transactions on Algorithms (TALG) 13 (1), 1-24, 2016
512016
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
L Georgiadis
Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010
472010
2-vertex connectivity in directed graphs
L Georgiadis, GF Italiano, L Laura, N Parotsidis
Information and Computation 261, 248-264, 2018
452018
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
422009
Improved Dynamic Planar Point Location.
L Arge, GS Brodal, L Georgiadis
FOCS, 305-314, 2006
402006
Finding dominators via disjoint set union
W Fraczak, L Georgiadis, A Miller, RE Tarjan
Journal of Discrete Algorithms 23, 2-20, 2013
382013
Dominator tree verification and vertex-disjoint paths
L Georgiadis, RE Tarjan
SODA 5, 433-442, 2005
342005
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
L Georgiadis
Algorithms–ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany …, 2011
27*2011
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
272008
Strong connectivity in directed graphs under failures, with applications
L Georgiadis, GF Italiano, N Parotsidis
SIAM Journal on Computing 49 (5), 865-926, 2020
262020
Finding dominators in practice
L Georgiadis, RF Werneck, RE Tarjan, S Triantafyllis, DI August
ESA 4, 677-688, 2004
262004
Dominator tree certification and divergent spanning trees
L Georgiadis, RE Tarjan
ACM Transactions on Algorithms (TALG) 12 (1), 1-42, 2015
242015
Faster algorithms for all-pairs bounded min-cuts
A Abboud, L Georgiadis, GF Italiano, R Krauthgamer, N Parotsidis, ...
arXiv preprint arXiv:1807.05803, 2018
202018
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
202014
Wireless Network Traffic and Quality of Service Support: Trends and Standards: Trends and Standards
TD Lagkas, P Angelidis, L Georgiadis
IGI Global, 2010
202010
Dynamic matchings in convex bipartite graphs
GS Brodal, L Georgiadis, KA Hansen, I Katriel
Mathematical Foundations of Computer Science 2007: 32nd International …, 2007
202007
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20