Nikos Parotsidis

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 69

Top Topics

Correlation Clustering

Top Venues

Publications

Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. J. ACM 71 (2) (2024)
Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis
Dynamic Correlation Clustering in Sublinear Update Time. CoRR (2024)
Lorenzo Beretta, Vincent Cohen-Addad, Silvio Lattanzi, Nikos Parotsidis
Multi-Swap k-Means++. NeurIPS (2023)
Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis
Fully Dynamic k-Clustering in Õ(k) Update Time. CoRR (2023)
Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP (2023)
Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis
Faster Computation of 3-Edge-Connected Components in Digraphs. SODA (2023)
Lorenzo Beretta, Vincent Cohen-Addad, Silvio Lattanzi, Nikos Parotsidis
Multi-Swap k-Means++. CoRR (2023)
Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis
Fully Dynamic k-Clustering in Õ(k) Update Time. NeurIPS (2023)
Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
Near-Optimal Correlation Clustering with Privacy. NeurIPS (2022)
Sayan Bhattacharya, Silvio Lattanzi, Nikos Parotsidis
Efficient and Stable Fully Dynamic Facility Location. NeurIPS (2022)
Sayan Bhattacharya, Silvio Lattanzi, Nikos Parotsidis
Efficient and Stable Fully Dynamic Facility Location. CoRR (2022)
Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. FOCS (2022)
Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis
Online and Consistent Correlation Clustering. ICML (2022)
Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
Near-Optimal Correlation Clustering with Privacy. CoRR (2022)
Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
A Local Search Algorithm for Large Maximum Weight Independent Set Problems. ESA (2022)
Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems. CoRR (2022)
Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
Planar Reachability Under Single Vertex or Edge Failures. CoRR (2021)
Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
) barrier. SODA (2021)
Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
Correlation Clustering in Constant Many Parallel Rounds. CoRR (2021)
Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
Planar Reachability Under Single Vertex or Edge Failures. SODA (2021)
Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. ALENEX (2021)
Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. CoRR (2021)
Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
New instances for maximum weight independent set from a vehicle routing application. CoRR (2021)
Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. FOCS (2021)
Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR (2021)
Aris Anagnostopoulos, Aristides Gionis, Nikos Parotsidis
Collaborative Procrastination. FUN (2021)
Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. Oper. Res. Forum 2 (4) (2021)
Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
Correlation Clustering in Constant Many Parallel Rounds. ICML (2021)
Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
) barrier. CoRR (2020)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Strong Connectivity in Directed Graphs under Failures, with Applications. SIAM J. Comput. 49 (5) (2020)
Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic
Dominating Sets and Connected Dominating Sets in Dynamic Graphs. CoRR (2019)
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)
Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic
Dominating Sets and Connected Dominating Sets in Dynamic Graphs. STACS (2019)
Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis
Dynamic Algorithms for the Massively Parallel Computation Model. CoRR (2019)
Vincent Cohen-Addad, Niklas Hjuler, Nikos Parotsidis, David Saulpic, Chris Schwiegelshohn
Fully Dynamic Consistent Facility Location. NeurIPS (2019)
Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis
Dynamic Algorithms for the Massively Parallel Computation Model. SPAA (2019)
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 (2018)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-vertex connectivity in directed graphs. Inf. Comput. 261 (2018)
Claudio Gentile, Nikos Parotsidis, Fabio Vitale
Online Reciprocal Recommendation with Theoretical Performance Guarantees. NeurIPS (2018)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR (2018)
Fabio Vitale, Nikos Parotsidis, Claudio Gentile
Online Reciprocal Recommendation with Theoretical Performance Guarantees. CoRR (2018)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. LATIN (2018)
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)
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. CoRR (2017)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Strong Connectivity in Directed Graphs under Failures, with Applications. SODA (2017)
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. SODA (2017)
Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti
Balancing information exposure in social networks. NIPS (2017)
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. CoRR (2017)
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
Sparse certificates for 2-connectivity in directed graphs. Theor. Comput. Sci. 698 (2017)
Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti
Balancing Information Exposure in Social Networks. CoRR (2017)
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. ICALP (2017)
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
All-Pairs 2-Reachability in O(n^w log n) Time. ICALP (2017)
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis
Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. FOCS (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Incremental 2-Edge-Connectivity in Directed Graphs. CoRR (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2-Connectivity in Directed Graphs. ESA (2016)
Nikos Parotsidis, Evaggelia Pitoura, Panayiotis Tsaparas
Centrality-Aware Link Recommendations. WSDM (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-Edge Connectivity in Directed Graphs. ACM Trans. Algorithms 13 (1) (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
Incremental 2-Edge-Connectivity in Directed Graphs. ICALP (2016)
Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
) Time. CoRR (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-Edge Connectivity in Directed Graphs. SODA (2015)
Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR (2015)
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. CoRR (2015)
Nikos Parotsidis, Evaggelia Pitoura, Panayiotis Tsaparas
Selecting Shortcuts for a Smaller World. SDM (2015)
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. ESA (2015)
Kostas Magoutis, Christos Papoulas, Antonis Papaioannou, Flora Karniavoura, Dimitrios-Georgios Akestoridis, Nikos Parotsidis, Maria Korozi, Asterios Leonidis, Stavroula Ntoa, Constantine Stephanidis
Design and implementation of a social networking platform for cloud deployment specialists. J. Internet Serv. Appl. 6 (1) (2015)
William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-Connectivity in Directed Graphs: An Experimental Study. ALENEX (2015)
Kostas Magoutis, Christos Papoulas, Antonis Papaioannou, Flora Karniavoura, Dimitrios-Georgios Akestoridis, Nikos Parotsidis, Maria Korozi, Asterios Leonidis, Stavroula Ntoa, Constantine Stephanidis
Erratum to: Design and implementation of a social networking platform for cloud deployment specialists. J. Internet Serv. Appl. 6 (1) (2015)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-Vertex Connectivity in Directed Graphs. ICALP (1) (2015)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-Edge Connectivity in Directed Graphs. CoRR (2014)
Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan
Loop Nesting Forests, Dominators, and Applications. SEA (2014)
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2-Vertex Connectivity in Directed Graphs. CoRR (2014)
Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan
Dominator Certification and Independent Spanning Trees: An Experimental Study. SEA (2013)