E-LIB Suche - Ergebnisse für: Georgiadis, Loukas

1

On 2-Strong Connectivity Orientations of Mixed Graphs and R..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Georgiadis, Loukas ; Kefallinos, Dionysios ; Kosinas, Evangelos - p. 209-220 , 2023

2

Approximating the smallest 2-vertex connected spanning subg..:

Georgiadis, Loukas ; Italiano, Giuseppe F. ; Karanasiou, Aikaterini
Theoretical Computer Science. 807 (2020) - p. 185-200 , 2020

Link: https://doi.org/10.1016/..

3

Strong Connectivity in Directed Graphs under Failures, with..:

Georgiadis, Loukas ; Italiano, Giuseppe F. ; Parotsidis, Nikos
SIAM Journal on Computing. 49 (2020) 5 - p. 865-926 , 2020

Link: https://doi.org/10.1137/..

4

2-vertex connectivity in directed graphs:

Georgiadis, Loukas ; Italiano, Giuseppe F. ; Laura, Luigi.
Information and Computation. 261 (2018) - p. 248-264 , 2018

Link: https://doi.org/10.1016/..

5

Computing Critical Nodes in Directed Graphs:

Paudel, Nilakantha ; Georgiadis, Loukas ; Italiano, Giuseppe F.
ACM Journal of Experimental Algorithmics. 23 (2018) - p. 1-24 , 2018

Link: https://doi.org/10.1145/..

6

Computing Critical Nodes in Directed Graphs:

Paudel, Nilakantha ; Georgiadis, Loukas ; Italiano, Giuseppe F.
Journal of Experimental Algorithmics (JEA). 23 (2018) 23 - p. 1-24 , 2018

Link: https://dl.acm.org/doi/1..

7

Sparse certificates for 2-connectivity in directed graphs:

Georgiadis, Loukas ; Italiano, Giuseppe F. ; Karanasiou, Aikaterini..
Theoretical Computer Science. 698 (2017) - p. 40-66 , 2017

Link: https://doi.org/10.1016/..

8

Strong connectivity in directed graphs under failures, with..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,

Georgiadis, Loukas ; Italiano, Giuseppe F. ; Parotsidis, Nikos - p. 1880-1899 , 2017

Link: https://dl.acm.org/doi/1..

9

2-Edge Connectivity in Directed Graphs:

Georgiadis, Loukas ; Italiano, Giuseppe F. ; Laura, Luigi.
ACM Transactions on Algorithms (TALG). 13 (2016) 1 - p. 1-24 , 2016

Link: https://dl.acm.org/doi/1..

10

2-Edge Connectivity in Directed Graphs:

Georgiadis, Loukas ; Italiano, Giuseppe F. ; Laura, Luigi.
ACM Transactions on Algorithms. 13 (2016) 1 - p. 1-24 , 2016

Link: https://doi.org/10.1145/..

11

Addendum to "Dominator Tree Certification and Divergent Spa..:

Georgiadis, Loukas ; Tarjan, Robert E.
ACM Transactions on Algorithms. 12 (2016) 4 - p. 1-3 , 2016

Link: https://doi.org/10.1145/..

12

Addendum to "Dominator Tree Certification and Divergent Spa..:

Georgiadis, Loukas ; Tarjan, Robert E.
ACM Transactions on Algorithms (TALG). 12 (2016) 4 - p. 1-3 , 2016

Link: https://dl.acm.org/doi/1..

13

Strong Articulation Points and Strong Bridges in Large Scal..:

Firmani, Donatella ; Georgiadis, Loukas ; Italiano, Giuseppe F...
Algorithmica. 74 (2015) 3 - p. 1123-1147 , 2015

Link: https://doi.org/10.1007/..

14

Dominator Tree Certification and Divergent Spanning Trees:

Georgiadis, Loukas ; Tarjan, Robert E.
ACM Transactions on Algorithms (TALG). 12 (2015) 1 - p. 1-42 , 2015

Link: https://dl.acm.org/doi/1..

15

2-edge connectivity in directed graphs:

, In: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms,

Georgiadis, Loukas ; Italiano, Giuseppe F. ; Laura, Luigi. - p. 1988-2005 , 2015

Link: https://dl.acm.org/doi/1..