Dominator Certification and Independent Spanning Trees: An Experimental Study. - Loukas Georgiadis; Luigi Laura; Nikos Parotsidis; Robert Endre Tarjan (SEA, 2013)

Loop Nesting Forests, Dominators, and Applications. - Loukas Georgiadis; Luigi Laura; Nikos Parotsidis; Robert Endre Tarjan (SEA, 2014)

2-Connectivity in Directed Graphs: An Experimental Study. - William Di Luigi; Loukas Georgiadis; Giuseppe F. Italiano; Luigi Laura; Nikos Parotsidis (ALENEX, 2015)

Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Charis Papadopoulos; Nikos Parotsidis (ESA, 2015)

Selecting Shortcuts for a Smaller World. - Nikos Parotsidis; Evaggelia Pitoura; Panayiotis Tsaparas (SDM, 2015)

A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Nikos Parotsidis (CoRR, 2015)

Design and implementation of a social networking platform for cloud deployment specialists. - Kostas Magoutis; Christos Papoulas; Antonis Papaioannou; Flora Karniavoura; Dimitrios-Georgios Akestoridis; Nikos Parotsidis; Maria Korozi; Asterios Leonidis; Stavroula Ntoa; Constantine Stephanidis (J. Internet Serv. Appl., 2015)

Erratum to: Design and implementation of a social networking platform for cloud deployment specialists. - Kostas Magoutis; Christos Papoulas; Antonis Papaioannou; Flora Karniavoura; Dimitrios-Georgios Akestoridis; Nikos Parotsidis; Maria Korozi; Asterios Leonidis; Stavroula Ntoa; Constantine Stephanidis (J. Internet Serv. Appl., 2015)

2-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Nikos Parotsidis (ESA, 2016)

Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. - Shiri Chechik; Thomas Dueholm Hansen; Giuseppe F. Italiano; Jakub Lacki; Nikos Parotsidis (FOCS, 2016)

Incremental 2-Edge-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Nikos Parotsidis (ICALP, 2016)

Sparse Subgraphs for 2-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Aikaterini Karanasiou; Charis Papadopoulos; Nikos Parotsidis (SEA, 2016)

Centrality-Aware Link Recommendations. - Nikos Parotsidis; Evaggelia Pitoura; Panayiotis Tsaparas (WSDM, 2016)

All-Pairs $2$-reachability in Õ(nω) Time. - Loukas Georgiadis; Daniel Graf 001; Giuseppe F. Italiano; Nikos Parotsidis; Przemyslaw Uznanski (CoRR, 2016)

2-Edge Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Luigi Laura; Nikos Parotsidis (ACM Trans. Algorithms, 2016)

All-Pairs 2-Reachability in O(n^w log n) Time. - Loukas Georgiadis; Daniel Graf 001; Giuseppe F. Italiano; Nikos Parotsidis; Przemyslaw Uznanski (ICALP, 2017)

Decremental Data Structures for Connectivity and Dominators in Directed Graphs. - Loukas Georgiadis; Thomas Dueholm Hansen; Giuseppe F. Italiano; Sebastian Krinninger; Nikos Parotsidis (ICALP, 2017)

Balancing information exposure in social networks. - Kiran Garimella; Aristides Gionis; Nikos Parotsidis; Nikolaj Tatti (NIPS, 2017)

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. - Shiri Chechik; Thomas Dueholm Hansen; Giuseppe F. Italiano; Veronika Loitzenbauer; Nikos Parotsidis (SODA, 2017)

Sparse certificates for 2-connectivity in directed graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Aikaterini Karanasiou; Charis Papadopoulos; Nikos Parotsidis (Theor. Comput. Sci., 2017)

Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. - Loukas Georgiadis; Giuseppe F. Italiano; Aikaterini Karanasiou; Nikos Parotsidis; Nilakantha Paudel (ALENEX, 2018)

Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Nikos Parotsidis (LATIN, 2018)

Online Reciprocal Recommendation with Theoretical Performance Guarantees. - Claudio Gentile; Nikos Parotsidis; Fabio Vitale (NeurIPS, 2018)

2-vertex connectivity in directed graphs. - Loukas Georgiadis; Giuseppe F. Italiano; Luigi Laura; Nikos Parotsidis (Inf. Comput., 2018)

Faster Algorithms for All-Pairs Bounded Min-Cuts. - Amir Abboud; Loukas Georgiadis; Giuseppe F. Italiano; Robert Krauthgamer; Nikos Parotsidis; Ohad Trabelsi; Przemyslaw Uznanski; Daniel Wolleb-Graf (ICALP, 2019)

Fully Dynamic Consistent Facility Location. - Vincent Cohen-Addad; Niklas Hjuler; Nikos Parotsidis; David Saulpic; Chris Schwiegelshohn (NeurIPS, 2019)

Dynamic Algorithms for the Massively Parallel Computation Model. - Giuseppe F. Italiano; Silvio Lattanzi; Vahab S. Mirrokni; Nikos Parotsidis (SPAA, 2019)

Dominating Sets and Connected Dominating Sets in Dynamic Graphs. - Niklas Hjuler; Giuseppe F. Italiano; Nikos Parotsidis; David Saulpic (STACS, 2019)

All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. - Fabrizio Grandoni 001; Giuseppe F. Italiano; Aleksander Lukasiewicz; Nikos Parotsidis; Przemyslaw Uznanski (CoRR, 2020)

Strong Connectivity in Directed Graphs under Failures, with Applications. - Loukas Georgiadis; Giuseppe F. Italiano; Nikos Parotsidis (SIAM J. Comput., 2020)

An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. - Loukas Georgiadis; Dionysios Kefallinos; Luigi Laura; Nikos Parotsidis (ALENEX, 2021)

Collaborative Procrastination. - Aris Anagnostopoulos; Aristides Gionis; Nikos Parotsidis (FUN, 2021)

Correlation Clustering in Constant Many Parallel Rounds. - Vincent Cohen-Addad; Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Nikos Parotsidis; Jakub Tarnawski (ICML, 2021)

All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier. - Fabrizio Grandoni 001; Giuseppe F. Italiano; Aleksander Lukasiewicz; Nikos Parotsidis; Przemyslaw Uznanski (SODA, 2021)

Planar Reachability Under Single Vertex or Edge Failures. - Giuseppe F. Italiano; Adam Karczmarz; Nikos Parotsidis (SODA, 2021)

New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. - Yuanyuan Dong; Andrew V. Goldberg; Alexander Noe; Nikos Parotsidis; Mauricio G. C. Resende; Quico Spaen (Oper. Res. Forum, 2021)

A Local Search Algorithm for Large Maximum Weight Independent Set Problems. - Yuanyuan Dong; Andrew V. Goldberg; Alexander Noe; Nikos Parotsidis; Mauricio G. C. Resende; Quico Spaen (ESA, 2022)

Online and Consistent Correlation Clustering. - Vincent Cohen-Addad; Silvio Lattanzi; Andreas Maggiori; Nikos Parotsidis (ICML, 2022)

Efficient and Stable Fully Dynamic Facility Location. - Sayan Bhattacharya; Silvio Lattanzi; Nikos Parotsidis (NeurIPS, 2022)

Near-Optimal Correlation Clustering with Privacy. - Vincent Cohen-Addad; Chenglin Fan; Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Nikos Parotsidis; Jakub Tarnawski (NeurIPS, 2022)

Optimal Decremental Connectivity in Non-Sparse Graphs. - Anders Aamand; Adam Karczmarz; Jakub Lacki; Nikos Parotsidis; Peter M. R. Rasmussen; Mikkel Thorup (ICALP, 2023)

Multi-Swap k-Means++. - Lorenzo Beretta 001; Vincent Cohen-Addad; Silvio Lattanzi; Nikos Parotsidis (NeurIPS, 2023)

Fully Dynamic k-Clustering in Õ(k) Update Time. - Sayan Bhattacharya; Martín Costa; Silvio Lattanzi; Nikos Parotsidis (NeurIPS, 2023)

Faster Computation of 3-Edge-Connected Components in Digraphs. - Loukas Georgiadis; Evangelos Kipouridis; Charis Papadopoulos; Nikos Parotsidis (SODA, 2023)

Practical Expander Decomposition. - Lars Gottesbüren; Nikos Parotsidis; Maximilian Probst Gutenberg (ESA, 2024)

Fully Dynamic k-Clustering with Fast Update Time and Small Recourse. - Sayan Bhattacharya; Martín Costa; Naveen Garg; Silvio Lattanzi; Nikos Parotsidis (FOCS, 2024)

Dynamic Correlation Clustering in Sublinear Update Time. - Vincent Cohen-Addad; Silvio Lattanzi; Andreas Maggiori; Nikos Parotsidis (ICML, 2024)

Fully Dynamic k-Clustering with Fast Update Time and Small Recourse. - Sayan Bhattacharya; Martín Costa; Naveen Garg; Silvio Lattanzi; Nikos Parotsidis (CoRR, 2024)

Fully Dynamic k-Center Clustering Made Simple. - Sayan Bhattacharya; Martín Costa; Silvio Lattanzi; Nikos Parotsidis (CoRR, 2024)

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. - Vincent Cohen-Addad; Debarati Das 001; Evangelos Kipouridis; Nikos Parotsidis; Mikkel Thorup (J. ACM, 2024)

Fully Dynamic Algorithms for Transitive Reduction. - Gramoz Goranci; Adam Karczmarz; Ali Momeni 003; Nikos Parotsidis (ICALP, 2025)

DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering. - Shangdi Yu; Laxman Dhulipala; Jakub Lacki; Nikos Parotsidis (SDM, 2025)

A metaheuristic algorithm for large maximum weight independent set problems. - Yuanyuan Dong; Andrew V. Goldberg; Alexander Noe; Nikos Parotsidis; Mauricio G. C. Resende; Quico Spaen (Networks, 2025)

Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality. - Filipe Miguel Gonçalves de Almeida; CJ Carey; Hendrik Fichtenberger; Jonathan Halcrow; Silvio Lattanzi; André Linhares; Tao Meng; Ashkan Norouzi-Fard; Nikos Parotsidis; Bryan Perozzi; David Simcha (CoRR, 2025)