default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikos Parotsidis
- > Home > Persons > Nikos Parotsidis
Publications
- 2023
[c35]Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos
, Nikos Parotsidis:
Faster Computation of 3-Edge-Connected Components in Digraphs. SODA 2023: 2489-2531- 2021
- [c30]Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis:
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. ALENEX 2021: 85-97 - 2020
- [j6]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Strong Connectivity in Directed Graphs under Failures, with Applications. SIAM J. Comput. 49(5): 865-926 (2020) - 2019
- [c24]Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf:
Faster Algorithms for All-Pairs Bounded Min-Cuts. ICALP 2019: 7:1-7:15 - 2018
- [j5]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-vertex connectivity in directed graphs. Inf. Comput. 261: 248-264 (2018) - [c20]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel:
Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. ALENEX 2018: 169-183 - [c19]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. LATIN 2018: 529-543 - [i12]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR abs/1802.10189 (2018) - [i10]Amir Abboud, Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski:
Faster Algorithms for All-Pairs Bounded Min-Cuts. CoRR abs/1807.05803 (2018) - 2017
- [j4]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse certificates for 2-connectivity in directed graphs. Theor. Comput. Sci. 698: 40-66 (2017) - [c17]Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis:
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. ICALP 2017: 42:1-42:15 - [c16]Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs 2-Reachability in O(n^w log n) Time. ICALP 2017: 74:1-74:14 - [c14]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Strong Connectivity in Directed Graphs under Failures, with Applications. SODA 2017: 1880-1899 - [i9]Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis:
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. CoRR abs/1704.08235 (2017) - 2016
- [j3]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. ACM Trans. Algorithms 13(1): 9:1-9:24 (2016) - [c12]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
2-Connectivity in Directed Graphs. ESA 2016: 1:1-1:14 - [c10]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental 2-Edge-Connectivity in Directed Graphs. ICALP 2016: 49:1-49:15 - [c9]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA 2016: 150-166 - [i6]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental 2-Edge-Connectivity in Directed Graphs. CoRR abs/1607.07073 (2016) - [i5]Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs $2$-reachability in Õ(nω) Time. CoRR abs/1612.08075 (2016) - 2015
- [c7]William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Connectivity in Directed Graphs: An Experimental Study. ALENEX 2015: 173-187 - [c6]Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis:
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. ESA 2015: 582-594 - [c5]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Vertex Connectivity in Directed Graphs. ICALP (1) 2015: 605-616 - [c3]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. SODA 2015: 1988-2005 - [i4]Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis:
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. CoRR abs/1509.02841 (2015) - [i3]Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR abs/1511.02913 (2015) - 2014
- [c2]Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan:
Loop Nesting Forests, Dominators, and Applications. SEA 2014: 174-186 - [i2]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. CoRR abs/1407.3041 (2014) - [i1]Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Vertex Connectivity in Directed Graphs. CoRR abs/1409.6277 (2014) - 2013
- [c1]Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan:
Dominator Certification and Independent Spanning Trees: An Experimental Study. SEA 2013: 284-295
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-08-28 02:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
