( en | de | ru )

 

Disambiguation of "Georgiadis, Loukas"

Author of the publication

copydeleteadd this publication to your clipboard
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree.

, , and . Oper. Res. Lett., 36 (1): 14-18 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Loukas Konstantinou

Loukas Mistelis

Loukas Argyriou

Andreas Loukas

Loukas Georgiou

 

Other publications of authors with the same name

Dominators, Directed Bipolar Orders, and Independent Spanning Trees., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 375-386. Springer, (2012)2-Vertex Connectivity in Directed Graphs., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 605-616. Springer, (2015)Strong Articulation Points and Strong Bridges in Large Scale Graphs., , , , and . Algorithmica, 74 (3): 1123-1147 (2016)2-Vertex Connectivity in Directed Graphs., , , and . CoRR, (2014)Dominator Tree Certification and Divergent Spanning Trees., and . ACM Trans. Algorithms, 12 (1): 11:1-11:42 (2016)Data structures for mergeable trees., , , , and . ACM Trans. Algorithms, 7 (2): 14:1-14:30 (2011)2-vertex connectivity in directed graphs., , , and . Inf. Comput., (2018)Approximating the smallest 2-vertex connected spanning subgraph of a directed graph., , and . Theor. Comput. Sci., (2020)2-Connectivity in Directed Graphs: An Experimental Study., , , , and . ALENEX, page 173-187. SIAM, (2015)2-Edge Connectivity in Directed Graphs., , , and . SODA, page 1988-2005. SIAM, (2015)