Loukas Georgiadis

Citirano

	Sve	Od 2018.
Citati	1061	378
H-indeks	20	12
i10-indeks	29	16

140

105

200420052006200720082009201020112012201320142015201620172018201920202021202220234 13 11 10 22 15 33 33 79 74 56 82 133 79 99 76 82 53 59 9

Javni pristup

Prikaži sve

11 članaka

1 članak

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Robert TarjanProfessor of Computer Science, Princeton UniversityPotvrđena adresa e-pošte na cs.princeton.edu
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, ItalyPotvrđena adresa e-pošte na luiss.it
Nikos ParotsidisGooglePotvrđena adresa e-pošte na google.com
Luigi LauraSapienza University Of RomePotvrđena adresa e-pošte na dis.uniroma1.it
Renato WerneckAmazonPotvrđena adresa e-pošte na cs.princeton.edu
Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Potvrđena adresa e-pošte na alum.mit.edu
Haim KaplanSchool of Computer Science, Tel Aviv UniversityPotvrđena adresa e-pošte na post.tau.ac.il
Gerth Stølting BrodalAarhus UniversityPotvrđena adresa e-pošte na cs.au.dk
Anne RogersUniversity of ChicagoPotvrđena adresa e-pošte na cs.uchicago.edu
Przemysław UznańskiPathwayPotvrđena adresa e-pošte na pathway.com
Daniel Wolleb-GrafETH ZurichPotvrđena adresa e-pošte na ethz.ch
Charis PapadopoulosDepartment of Mathematics, University of IoanninaPotvrđena adresa e-pošte na cs.uoi.gr
Federico SantaroniUniversity of Rome "Tor Vergata"Potvrđena adresa e-pošte na ing.uniroma2.it
Kristoffer Arnsfelt HansenAssociate Professor, Department of Computer Science, Aarhus UniversityPotvrđena adresa e-pošte na cs.au.dk
Thomas LagkasAssistant Professor, Department of Computer Science, International Hellenic UniversityPotvrđena adresa e-pošte na cs.ihu.gr
Pantelis AngelidisUOWM-ECEPotvrđena adresa e-pošte na uowm.gr
Lars ArgeProfessor of Computer Science and MADALGO center director, Aarhus UniversityPotvrđena adresa e-pošte na cs.au.dk
David I. AugustComputer Science, Princeton UniversityPotvrđena adresa e-pošte na princeton.edu
Amir AbboudWeizmann Institute of SciencePotvrđena adresa e-pošte na weizmann.ac.il
Ohad TrabelsiToyota Technological Institute at ChicagoPotvrđena adresa e-pošte na ttic.edu

Prati

Loukas Georgiadis

Department of Computer Science & Engineering, University of Ioannina

Potvrđena adresa e-pošte na cs.uoi.gr - Početna stranica

Algorithms and data structures


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	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	93	2008
Finding dominators revisited L Georgiadis, RE Tarjan SODA, 869-878, 2004	89	2004
Finding dominators in practice L Georgiadis, RE Tarjan, RF Werneck Journal of Graph Algorithms and Applications 10 (1), 69-94, 2006	75	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	57	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	51	2016
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	47	2010
2-vertex connectivity in directed graphs L Georgiadis, GF Italiano, L Laura, N Parotsidis Information and Computation 261, 248-264, 2018	45	2018
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	42	2009
Improved Dynamic Planar Point Location. L Arge, GS Brodal, L Georgiadis FOCS, 305-314, 2006	40	2006
Finding dominators via disjoint set union W Fraczak, L Georgiadis, A Miller, RE Tarjan Journal of Discrete Algorithms 23, 2-20, 2013	38	2013
Dominator tree verification and vertex-disjoint paths L Georgiadis, RE Tarjan SODA 5, 433-442, 2005	34	2005
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	27	2008
Strong connectivity in directed graphs under failures, with applications L Georgiadis, GF Italiano, N Parotsidis SIAM Journal on Computing 49 (5), 865-926, 2020	26	2020
Finding dominators in practice L Georgiadis, RF Werneck, RE Tarjan, S Triantafyllis, DI August ESA 4, 677-688, 2004	26	2004
Dominator tree certification and divergent spanning trees L Georgiadis, RE Tarjan ACM Transactions on Algorithms (TALG) 12 (1), 1-42, 2015	24	2015
Faster algorithms for all-pairs bounded min-cuts A Abboud, L Georgiadis, GF Italiano, R Krauthgamer, N Parotsidis, ... arXiv preprint arXiv:1807.05803, 2018	20	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	20	2014
Wireless Network Traffic and Quality of Service Support: Trends and Standards: Trends and Standards TD Lagkas, P Angelidis, L Georgiadis IGI Global, 2010	20	2010
Dynamic matchings in convex bipartite graphs GS Brodal, L Georgiadis, KA Hansen, I Katriel Mathematical Foundations of Computer Science 2007: 32nd International …, 2007	20	2007

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori