Nikos Parotsidis

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering	2025	Shangdi Yu Laxman Dhulipala Jakub Łącki Nikos Parotsidis
+ PDF Chat	Fully Dynamic $k$-Center Clustering Made Simple	2024	Sayan Bhattacharya Martín Costa Silvio Lattanzi Nikos Parotsidis
+ PDF Chat	A metaheuristic algorithm for large maximum weight independent set problems	2024	Yuanyuan Dong Andrew V. Goldberg Alexander Noe Nikos Parotsidis Maurício G. C. Resende Quico Spaen
+ PDF Chat	Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse	2024	Sayan Bhattacharya Martín Costa Naveen Garg Silvio Lattanzi Nikos Parotsidis
+ PDF Chat	Dynamic Correlation Clustering in Sublinear Update Time	2024	Vincent Cohen-Addad Silvio Lattanzi Andreas Maggiori Nikos Parotsidis
+ PDF Chat	Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor	2024	Vincent Cohen-Addad Debarati Das Evangelos Kipouridis Nikos Parotsidis Mikkel Thorup
+	Multi-Swap $k$-Means++	2023	Lorenzo Beretta Vincent Cohen-Addad Silvio Lattanzi Nikos Parotsidis
+	Fully Dynamic $k$-Clustering in $\tilde O(k)$ Update Time	2023	Sayan Bhattacharya Martín Costa Silvio Lattanzi Nikos Parotsidis
+ PDF Chat	Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor	2022	Vincent Cohen-Addad Debarati Das Evangelos Kipouridis Nikos Parotsidis Mikkel Thorup
+	A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems	2022	Yuanyuan Dong Andrew V. Goldberg Alexander Noe Nikos Parotsidis Maurício G. C. Resende Quico Spaen
+	Near-Optimal Correlation Clustering with Privacy	2022	Vincent Cohen-Addad Chenglin Fan Silvio Lattanzi Slobodan Mitrović Ashkan Norouzi-Fard Nikos Parotsidis Jakub Tarnawski
+	Efficient and Stable Fully Dynamic Facility Location	2022	Sayan Bhattacharya Silvio Lattanzi Nikos Parotsidis
+	Optimal Decremental Connectivity in Non-Sparse Graphs.	2021	Anders Aamand Adam Karczmarz Jakub Łącki Nikos Parotsidis Peter Rasmussen Mikkel Thorup
+ PDF Chat	Optimal Decremental Connectivity in Non-Sparse Graphs	2021	Anders Aaman Adam Karczmarz Jakub Łącki Nikos Parotsidis Peter Rasmussen Mikkel Thorup
+ PDF Chat	New Instances for Maximum Weight Independent Set From a Vehicle Routing Application	2021	Yuanyuan Dong Andrew V. Goldberg Alexander Noe Nikos Parotsidis Maurício G. C. Resende Quico Spaen
+	Planar Reachability Under Single Vertex or Edge Failures	2021	Giuseppe F. Italiano Adam Karczmarz Nikos Parotsidis
+ PDF Chat	Planar Reachability Under Single Vertex or Edge Failures	2021	Giuseppe F. Italiano Adam Karczmarz Nikos Parotsidis
+	New instances for maximum weight independent set from a vehicle routing application	2021	Yuanyuan Dong Andrew V. Goldberg Alexander Noe Nikos Parotsidis Maurício G. C. Resende Quico Spaen
+	Correlation Clustering in Constant Many Parallel Rounds	2021	Vincent Cohen-Addad Silvio Lattanzi Slobodan Mitrović Ashkan Norouzi-Fard Nikos Parotsidis Jakub Tarnawski
+ PDF Chat	All-Pairs LCA in DAGs: Breaking through the <i>O</i>(<i>n</i><sup>2.5</sup>) barrier	2021	Fabrizio Grandoni Giuseppe F. Italian Aleksander Łukasiewicz Nikos Parotsidis Przemysław Uznański
+	Planar Reachability Under Single Vertex or Edge Failures	2021	Giuseppe F. Italiano Adam Karczmarz Nikos Parotsidis
+	Optimal Decremental Connectivity in Non-Sparse Graphs	2021	Anders Aaman Adam Karczmarz Jakub Łącki Nikos Parotsidis Peter Rasmussen Mikkel Thorup
+	All-Pairs LCA in DAGs: Breaking through the $O(n^{2.5})$ barrier	2020	Fabrizio Grandoni Giuseppe F. Italiano Aleksander Łukasiewicz Nikos Parotsidis Przemysław Uznański
+ PDF Chat	Strong Connectivity in Directed Graphs under Failures, with Applications	2020	Loukas Georgiadis Giuseppe F. Italiano Nikos Parotsidis
+	All-Pairs LCA in DAGs: Breaking through the $O(n^{2.5})$ barrier	2020	Fabrizio Grandoni Giuseppe F. Italiano Aleksander Łukasiewicz Nikos Parotsidis Przemysław Uznański
+	Dynamic Algorithms for the Massively Parallel Computation Model	2019	Giuseppe F. Italiano Silvio Lattanzi Vahab Mirrokni Nikos Parotsidis
+	Dynamic Algorithms for the Massively Parallel Computation Model	2019	Giuseppe F. Italiano Silvio Lattanzi Vahab Mirrokni Nikos Parotsidis
+	Dominating Sets and Connected Dominating Sets in Dynamic Graphs	2019	Niklas Hjuler Giuseppe F. Italiano Nikos Parotsidis David Saulpic
+	Dynamic Algorithms for the Massively Parallel Computation Model	2019	Giuseppe F. Italiano Silvio Lattanzi Vahab Mirrokni Nikos Parotsidis
+	2-vertex connectivity in directed graphs	2018	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis
+	Online Reciprocal Recommendation with Theoretical Performance Guarantees	2018	Fabio Vitale Nikos Parotsidis Claudio Gentile
+ PDF Chat	Incremental Strong Connectivity and 2-Connectivity in Directed Graphs	2018	Loukas Georgiadis Giuseppe F. Italiano Nikos Parotsidis
+	Faster Algorithms for All-Pairs Bounded Min-Cuts	2018	Amir Abboud Loukas Georgiadis Giuseppe F. Italiano Robert Krauthgamer Nikos Parotsidis Ohad Trabelsi Przemysław Uznański Daniel Wolleb-Graf
+ PDF Chat	2-Vertex Connectivity in Directed Graphs	2018	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis
+ PDF Chat	2-Vertex Connectivity in Directed Graphs	2018	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis
+	Decremental Data Structures for Connectivity and Dominators in Directed Graphs.	2017	Loukas Georgiadis Thomas Dueholm Hansen Giuseppe F. Italiano Sebastian Krinninger Nikos Parotsidis
+	Decremental Data Structures for Connectivity and Dominators in Directed Graphs	2017	Loukas Georgiadis Thomas Dueholm Hansen Giuseppe F. Italiano Sebastian Krinninger Nikos Parotsidis
+	Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs	2017	Shiri Chechik Thomas Dueholm Hansen Giuseppe F. Italiano Veronika Loitzenbauer Nikos Parotsidis
+	Balancing Information Exposure in Social Networks	2017	Kiran Garimella Aristides Gionis Nikos Parotsidis Nikolaj Tatti
+	Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs	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	2017	Shiri Chechik Thomas Dueholm Hansen Giuseppe F. Italiano Veronika Loitzenbauer Nikos Parotsidis
+	Decremental Data Structures for Connectivity and Dominators in Directed Graphs	2017	Loukas Georgiadis Thomas Dueholm Hansen Giuseppe F. Italiano Sebastian Krinninger Nikos Parotsidis
+	All-Pairs 2-Reachability in $\mathcal{O}(n^{\omega}\log n)$ Time	2016	Loukas Georgiadis Daniel Graf Giuseppe F. Italiano Nikos Parotsidis Przemysław Uznański
+ PDF Chat	2-Edge Connectivity in Directed Graphs	2016	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis
+	Incremental $2$-Edge-Connectivity in Directed Graphs	2016	Loukas Georgiadis Giuseppe F. Italiano Nikos Parotsidis
+	All-Pairs $2$-reachability in Õ(n ω ) Time.	2016	Loukas Georgiadis Daniel Graf Giuseppe F. Italiano Nikos Parotsidis Przemysław Uznański
+	Incremental 2-Edge-Connectivity in Directed Graphs	2016	Loukas Georgiadis Giuseppe F. Italiano Nikos Parotsidis
+	All-Pairs 2-Reachability in $\mathcal{O}(n^ω\log n)$ Time	2016	Loukas Georgiadis Daniel Graf Giuseppe F. Italiano Nikos Parotsidis Przemysław Uznański
+	Incremental $2$-Edge-Connectivity in Directed Graphs	2016	Loukas Georgiadis Giuseppe F. Italiano Nikos Parotsidis
+	A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs.	2015	Loukas Georgiadis Giuseppe F. Italiano Nikos Parotsidis
+	Strong Connectivity in Directed Graphs under Failures, with Application	2015	Loukas Georgiadis Giuseppe F. Italiano Nikos Parotsidis
+	Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs	2015	Loukas Georgiadis Giuseppe F. Italiano Charis Papadopoulos Nikos Parotsidis
+ PDF Chat	Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs	2015	Loukas Georgiadis Giuseppe F. Italiano Charis Papadopoulos Nikos Parotsidis
+ PDF Chat	2-Vertex Connectivity in Directed Graphs	2015	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis
+	Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs	2015	Loukas Georgiadis Giuseppe F. Italiano Charis Papadopoulos Nikos Parotsidis
+	2-Edge Connectivity in Directed Graphs	2014	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis
+	2-Edge Connectivity in Directed Graphs	2014	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis
+	2-Vertex Connectivity in Directed Graphs	2014	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis

Common Coauthors

Coauthor	Papers Together
Giuseppe F. Italiano	37
Loukas Georgiadis	25
Silvio Lattanzi	11
Luigi Laura	8
Przemysław Uznański	7
Adam Karczmarz	6
Vincent Cohen-Addad	6
Thomas Dueholm Hansen	6
Mikkel Thorup	5
Alexander Noe	4
Andrew V. Goldberg	4
Maurício G. C. Resende	4
Quico Spaen	4
Sayan Bhattacharya	4
Jakub Łącki	4
Shiri Chechik	3
Martín Costa	3
Vahab Mirrokni	3
Veronika Loitzenbauer	3
Sebastian Krinninger	3
Charis Papadopoulos	3
Yuanyuan Dong	3
Aleksander Łukasiewicz	3
Fabrizio Grandoni	3
Peter Rasmussen	3
Slobodan Mitrović	2
Ashkan Norouzi-Fard	2
Anders Aaman	2
Evangelos Kipouridis	2
Debarati Das	2
Jakub Tarnawski	2
Daniel Graf	2
Daniel Wolleb-Graf	1
Anders Aamand	1
Laxman Dhulipala	1
David Saulpic	1
Chenglin Fan	1
Ohad Trabelsi	1
Shangdi Yu	1
Amir Abboud	1
Naveen Garg	1
Andreas Maggiori	1
Claudio Gentile	1
Kiran Garimella	1
Giuseppe F. Italian	1
Niklas Hjuler	1
Robert Krauthgamer	1
Aristides Gionis	1
Daniel Graf	1
Yuanyuan Dong	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time	2015	Monika Henzinger Sebastian Krinninger Veronika Loitzenbauer	10
+ PDF Chat	Computing the 2-blocks of directed graphs	2015	Raed Jaberi	8
+	Edge-disjoint spanning trees and depth-first search	1976	Robert E. Tarjan	6
+ PDF Chat	2-Edge Connectivity in Directed Graphs	2016	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis	6
+ PDF Chat	2-Vertex Connectivity in Directed Graphs	2015	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis	6
+	Bijoin points, bibridges, and biblocks of directed graphs	1980	Ya. M. Erusalimskii G. G. Svetlov	6
+ PDF Chat	Zur allgemeinen Kurventheorie	1927	Karl Menger	5
+	On computing the 2-vertex-connected components of directed graphs	2015	Raed Jaberi	4
+	2-vertex connectivity in directed graphs	2018	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis	3
+ PDF Chat	Efficient Immunization Strategies for Computer Networks and Populations	2003	Reuven Cohen Shlomo Havlin Daniel ben‐Avraham	3
+ PDF Chat	Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time	2017	Danupon Nanongkai Thatchaphol Saranurak Christian Wulff‐Nilsen	3
+ PDF Chat	Communication steps for parallel query processing	2013	Paul Beame Paraschos Koutris Dan Suciu	3
+ PDF Chat	Parallel algorithms for geometric graph problems	2014	Alexandr Andoni Aleksandar Nikolov Krzysztof Onak Grigory Yaroslavtsev	2
+ PDF Chat	Learning nonsingular phylogenies and hidden Markov models	2005	Elchanan Mossel Sébastien Roch	2
+ PDF Chat	Finding connected components in map-reduce in logarithmic rounds	2013	Vibhor Rastogi Ashwin Machanavajjhala Laukik Chitnis Anish Das Sarma	2
+ PDF Chat	A New Approach to Incremental Cycle Detection and Related Problems	2015	Michael A. Bender Jeremy T. Fineman Seth Gilbert Robert E. Tarjan	2
+	Incremental $2$-Edge-Connectivity in Directed Graphs	2016	Loukas Georgiadis Giuseppe F. Italiano Nikos Parotsidis	2
+ PDF Chat	Multiplying matrices faster than coppersmith-winograd	2012	Virginia Vassilevska Williams	2
+ PDF Chat	Optimal Dynamic Distributed MIS	2016	Keren Censor-Hillel Elad Haramaty Zohar Karnin	2
+ PDF Chat	Fully Dynamic Maximal Matching in Constant Update Time	2016	Shay Solomon	2
+ PDF Chat	Fully dynamic maximal independent set with sublinear update time	2018	Sepehr Assadi Krzysztof Onak Baruch Schieber Shay Solomon	2
+ PDF Chat	Simple Deterministic Algorithms for Fully Dynamic Maximal Matching	2015	Ofer Neiman Shay Solomon	2
+ PDF Chat	Parallel Graph Connectivity in Log Diameter Rounds	2018	Alexandr Andoni Zhao Song Clifford Stein Zhengyu Wang Peilin Zhong	2
+	A deamortization approach for dynamic spanner and dynamic maximal matching	2019	Aaron Bernstein Sebastian Forster Monika Henzinger	2
+	Parallel Graph Connectivity in Log Diameter Rounds	2018	Alexandr Andoni Clifford Stein Zhao Song Zhengyu Wang Peilin Zhong	2
+	Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover	2018	Mohsen Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrović Ronitt Rubinfeld	2
+	On computing the $2$-vertex-connected components of directed graphs	2014	Raed Jaberi	2
+ PDF Chat	Round compression for parallel matching algorithms	2018	Artur Czumaj Jakub Łącki Aleksander Mądry Slobodan Mitrović Krzysztof Onak Piotr Sankowski	2
+	Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure	2007	Camil Demetrescu Giuseppe F. Italiano	2
+ PDF Chat	Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs	2015	Shuchi Chawla Konstantin Makarychev Tselil Schramm Grigory Yaroslavtsev	2
+ PDF Chat	Sorting, Searching, and Simulation in the MapReduce Framework	2011	Michael T. Goodrich Nodari Sitchinava Qin Zhang	2
+ PDF Chat	An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model	2018	Surender Baswana Keerti Choudhary Liam Roditty	2
+ PDF Chat	Detecting critical nodes in sparse graphs	2008	Ashwin Arulselvan Clayton W. Commander Lily Elefteriadou Pãnos M. Pardalos	2
+ PDF Chat	A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem	2012	Bundit Laekhanukit Shayan Oveis Gharan Mohit Singh	2
+	Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time	2017	Danupon Nanongkai Thatchaphol Saranurak Christian Wulff‐Nilsen	2
+	Dominator Tree Certification and Independent Spanning Trees	2012	Loukas Georgiadis Robert E. Tarjan	2
+	Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs	2015	Loukas Georgiadis Giuseppe F. Italiano Charis Papadopoulos Nikos Parotsidis	2
+ PDF Chat	Fully Dynamic Maximal Matching in O (log n) Update Time	2011	Surender Baswana Manoj Gupta Sandeep Sen	2
+ PDF Chat	An Experimental Study of Dynamic Dominators	2012	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Federico Santaroni	2
+	2-Edge Connectivity in Directed Graphs	2014	Loukas Georgiadis Giuseppe F. Italiano Luigi Laura Nikos Parotsidis	2
+ PDF Chat	Algebraic complexity theory and matrix multiplication	2014	François Le Gall	1
+ PDF Chat	Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance	2012	Bernhard Haeupler Telikepalli Kavitha Rogers Mathew Siddhartha Sen Robert E. Tarjan	1
+ PDF Chat	Optimal Decremental Connectivity in Planar Graphs	2016	Jakub Łącki Piotr Sankowski	1
+	Some extremal results in cochromatic and dichromatic theory	1991	Paul Erdős John Gimbel Dieter Kratsch	1
+ PDF Chat	All pairs shortest paths using bridging sets and rectangular matrix multiplication	2002	Uri Zwick	1
+	Echo chambers in the age of misinformation	2015	Michela Del Vicario Alessandro Bessi Fabiana Zollo Fabio Petroni Antonio Scala Guido Caldarelli H. Eugene Stanley Walter Quattrociocchi	1
+	Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics	2017	Moses Charikar Vaggos Chatziafratis	1
+	Computing the $2$-blocks of directed graphs	2014	Raed Jaberi	1
+ PDF Chat	Quantifying Controversy in Social Media	2016	Kiran Garimella Gianmarco De Francisci Morales Aristides Gionis Michael Mathioudakis	1
+	A Path Cover Technique for LCAs in Dags	2008	Mirosław Kowaluk Andrzej Lingas Johannes Nowak	1