Nikos Parotsidis

According to our database, Nikos Parotsidis authored at least 46 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Faster Computation of 3-Edge-Connected Components in Digraphs.

Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Fully Dynamic k-Clustering in Õ(k) Update Time.

Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Multi-Swap k-Means++.

Lorenzo Beretta, Vincent Cohen-Addad, Silvio Lattanzi, Nikos Parotsidis

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Optimal Decremental Connectivity in Non-Sparse Graphs.

Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

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

CoRR, 2022

Near-Optimal Correlation Clustering with Privacy.

Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Efficient and Stable Fully Dynamic Facility Location.

Sayan Bhattacharya, Silvio Lattanzi, Nikos Parotsidis

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Online and Consistent Correlation Clustering.

Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis

Proceedings of the International Conference on Machine Learning, 2022

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

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

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

Planar Reachability Under Single Vertex or Edge Failures.

Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

All-Pairs LCA in DAGs: Breaking through the <i>O</i>(<i>n</i>^2.5) barrier.

Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Correlation Clustering in Constant Many Parallel Rounds.

Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski

Proceedings of the 38th International Conference on Machine Learning, 2021

Collaborative Procrastination.

Aris Anagnostopoulos, Aristides Gionis, Nikos Parotsidis

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor.

Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph.

Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020

Strong Connectivity in Directed Graphs under Failures, with Applications.

Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis

SIAM J. Comput., 2020

All-Pairs LCA in DAGs: Breaking through the O(n^2.5) barrier.

Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski

CoRR, 2020

2019

Dominating Sets and Connected Dominating Sets in Dynamic Graphs.

Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Dynamic Algorithms for the Massively Parallel Computation Model.

Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Fully Dynamic Consistent Facility Location.

Vincent Cohen-Addad, Niklas Hjuler, Nikos Parotsidis, David Saulpic, Chris Schwiegelshohn

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

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

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

2-vertex connectivity in directed graphs.

Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis

Inf. Comput., 2018

Online Reciprocal Recommendation with Theoretical Performance Guarantees.

Claudio Gentile, Nikos Parotsidis, Fabio Vitale

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Incremental Strong Connectivity and 2-Connectivity in Directed Graphs.

Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

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

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Sparse certificates for 2-connectivity in directed graphs.

Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis

Theor. Comput. Sci., 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

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

Balancing information exposure in social networks.

Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Decremental Data Structures for Connectivity and Dominators in Directed Graphs.

Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

All-Pairs 2-Reachability in O(n^w log n) Time.

Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

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 Õ(n^ω) Time.

Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski

CoRR, 2016

Centrality-Aware Link Recommendations.

Nikos Parotsidis, Evaggelia Pitoura, Panayiotis Tsaparas

Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, 2016

Sparse Subgraphs for 2-Connectivity in Directed Graphs.

Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Incremental 2-Edge-Connectivity in Directed Graphs.

Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 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

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2-Connectivity in Directed Graphs.

Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

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

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

A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs.

Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis

CoRR, 2015

Selecting Shortcuts for a Smaller World.

Nikos Parotsidis, Evaggelia Pitoura, Panayiotis Tsaparas

Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015

Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs.

Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis

Proceedings of the Algorithms - ESA 2015, 2015

2-Connectivity in Directed Graphs: An Experimental Study.

William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Loop Nesting Forests, Dominators, and Applications.

Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

2013

Dominator Certification and Independent Spanning Trees: An Experimental Study.

Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013