Nikos Parotsidis

85 papers A* 25A 12B 5Misc 1Journal 40Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A metaheuristic algorithm for large maximum weight independent set problems. Networks Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2025	A*	`conf`	Almost Optimal Fully Dynamic k-Center Clustering with Recourse. ICML Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad, Silvio Lattanzi, Nikos Parotsidis
2025	A	`conf`	DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering. SDM Shangdi Yu, Laxman Dhulipala, Jakub Lacki, Nikos Parotsidis
2025	J	`jnl`	DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering. CoRR Shangdi Yu, Laxman Dhulipala, Jakub Lacki, Nikos Parotsidis
2025	A*	`conf`	Fully Dynamic Algorithms for Transitive Reduction. ICALP Gramoz Goranci, Adam Karczmarz, Ali Momeni, Nikos Parotsidis
2025	J	`jnl`	Fully Dynamic Algorithms for Transitive Reduction. CoRR Gramoz Goranci, Adam Karczmarz, Ali Momeni, Nikos Parotsidis
2025	J	`jnl`	Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality. CoRR 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
2025	A	`conf`	Streaming Trends: A Low-Latency Platform for Dynamic Video Grouping and Trending Corpora Building. RecSys Yang Gu, Caroline Zhou, Qiao Zhang, Scott Wang, Yongzhe Wang, Li Zhang, Nikos Parotsidis, CJ Carey, Ashkan Fard, Mingyan Gao, Yaping Zhang, Sourabh Bansod
2024	A*	`conf`	Dynamic Correlation Clustering in Sublinear Update Time. ICML Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis
2024	J	`jnl`	Dynamic Correlation Clustering in Sublinear Update Time. CoRR Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis
2024	J	`jnl`	Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. J. ACM Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
2024	J	`jnl`	Fully Dynamic CoRR Sayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis
2024	J	`jnl`	Fully Dynamic CoRR Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis
2024	A*	`conf`	Fully Dynamic k-Clustering with Fast Update Time and Small Recourse. FOCS Sayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis
2024	A	`conf`	Practical Expander Decomposition. ESA Lars Gottesbüren, Nikos Parotsidis, Maximilian Probst Gutenberg
2023	A*	`conf`	Faster Computation of 3-Edge-Connected Components in Digraphs. SODA Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis
2023	J	`jnl`	Fully Dynamic k-Clustering in Õ(k) Update Time. CoRR Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis
2023	A*	`conf`	Fully Dynamic k-Clustering in Õ(k) Update Time. NeurIPS Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis
2023	A*	`conf`	Multi-Swap k-Means++. NeurIPS Lorenzo Beretta, Vincent Cohen-Addad, Silvio Lattanzi, Nikos Parotsidis
2023	J	`jnl`	Multi-Swap k-Means++. CoRR Lorenzo Beretta, Vincent Cohen-Addad, Silvio Lattanzi, Nikos Parotsidis
2023	A*	`conf`	Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
2022	A	`conf`	A Local Search Algorithm for Large Maximum Weight Independent Set Problems. ESA Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2022	J	`jnl`	A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems. CoRR Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2022	A*	`conf`	Efficient and Stable Fully Dynamic Facility Location. NeurIPS Sayan Bhattacharya, Silvio Lattanzi, Nikos Parotsidis
2022	J	`jnl`	Efficient and Stable Fully Dynamic Facility Location. CoRR Sayan Bhattacharya, Silvio Lattanzi, Nikos Parotsidis
2022	A*	`conf`	Near-Optimal Correlation Clustering with Privacy. NeurIPS Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
2022	J	`jnl`	Near-Optimal Correlation Clustering with Privacy. CoRR Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
2022	A*	`conf`	Online and Consistent Correlation Clustering. ICML Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis
2021	A*	`conf`	All-Pairs LCA in DAGs: Breaking through the SODA Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
2021	A	`conf`	An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. ALENEX Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis
2021	Misc	`conf`	Collaborative Procrastination. FUN Aris Anagnostopoulos, Aristides Gionis, Nikos Parotsidis
2021	A*	`conf`	Correlation Clustering in Constant Many Parallel Rounds. ICML Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
2021	J	`jnl`	Correlation Clustering in Constant Many Parallel Rounds. CoRR Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski
2021	A*	`conf`	Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. FOCS Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
2021	J	`jnl`	Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. CoRR Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
2021	J	`jnl`	New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. Oper. Res. Forum Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2021	J	`jnl`	New instances for maximum weight independent set from a vehicle routing application. CoRR Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2021	J	`jnl`	Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
2021	A*	`conf`	Planar Reachability Under Single Vertex or Edge Failures. SODA Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
2021	J	`jnl`	Planar Reachability Under Single Vertex or Edge Failures. CoRR Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis
2020	J	`jnl`	All-Pairs LCA in DAGs: Breaking through the O(n CoRR Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski
2020	J	`jnl`	Strong Connectivity in Directed Graphs under Failures, with Applications. SIAM J. Comput. Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2019	A	`conf`	Dominating Sets and Connected Dominating Sets in Dynamic Graphs. STACS Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic
2019	J	`jnl`	Dominating Sets and Connected Dominating Sets in Dynamic Graphs. CoRR Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic
2019	B	`conf`	Dynamic Algorithms for the Massively Parallel Computation Model. SPAA Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis
2019	J	`jnl`	Dynamic Algorithms for the Massively Parallel Computation Model. CoRR Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis
2019	A*	`conf`	Faster Algorithms for All-Pairs Bounded Min-Cuts. ICALP Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf
2019	A*	`conf`	Fully Dynamic Consistent Facility Location. NeurIPS Vincent Cohen-Addad, Niklas Hjuler, Nikos Parotsidis, David Saulpic, Chris Schwiegelshohn
2018	J	`jnl`	2-vertex connectivity in directed graphs. Inf. Comput. Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2018	A	`conf`	Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. ALENEX Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel
2018	J	`jnl`	Faster Algorithms for All-Pairs Bounded Min-Cuts. CoRR Amir Abboud, Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski
2018	B	`conf`	Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. LATIN Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2018	J	`jnl`	Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2018	A*	`conf`	Online Reciprocal Recommendation with Theoretical Performance Guarantees. NeurIPS Claudio Gentile, Nikos Parotsidis, Fabio Vitale
2018	J	`jnl`	Online Reciprocal Recommendation with Theoretical Performance Guarantees. CoRR Fabio Vitale, Nikos Parotsidis, Claudio Gentile
2017	A*	`conf`	All-Pairs 2-Reachability in O(n^w log n) Time. ICALP Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
2017	J	`jnl`	Balancing Information Exposure in Social Networks. CoRR Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti
2017	—	`conf`	Balancing information exposure in social networks. NIPS Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti
2017	A*	`conf`	Decremental Data Structures for Connectivity and Dominators in Directed Graphs. ICALP Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
2017	J	`jnl`	Decremental Data Structures for Connectivity and Dominators in Directed Graphs. CoRR Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
2017	A*	`conf`	Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. SODA Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
2017	J	`jnl`	Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. CoRR Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
2017	J	`jnl`	Sparse certificates for 2-connectivity in directed graphs. Theor. Comput. Sci. Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
2017	A*	`conf`	Strong Connectivity in Directed Graphs under Failures, with Applications. SODA Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2016	A	`conf`	2-Connectivity in Directed Graphs. ESA Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2016	J	`jnl`	2-Edge Connectivity in Directed Graphs. ACM Trans. Algorithms Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2016	J	`jnl`	All-Pairs $2$-reachability in Õ(n CoRR Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski
2016	A	`conf`	Centrality-Aware Link Recommendations. WSDM Nikos Parotsidis, Evaggelia Pitoura, Panayiotis Tsaparas
2016	A*	`conf`	Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. FOCS Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis
2016	A*	`conf`	Incremental 2-Edge-Connectivity in Directed Graphs. ICALP Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2016	J	`jnl`	Incremental 2-Edge-Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2016	B	`conf`	Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
2015	A	`conf`	2-Connectivity in Directed Graphs: An Experimental Study. ALENEX William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2015	A*	`conf`	2-Edge Connectivity in Directed Graphs. SODA Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2015	—	`conf`	2-Vertex Connectivity in Directed Graphs. ICALP (1) Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2015	J	`jnl`	A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis
2015	A	`conf`	Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. ESA Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
2015	J	`jnl`	Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
2015	J	`jnl`	Design and implementation of a social networking platform for cloud deployment specialists. J. Internet Serv. Appl. Kostas Magoutis, Christos Papoulas, Antonis Papaioannou, Flora Karniavoura, Dimitrios-Georgios Akestoridis, Nikos Parotsidis, Maria Korozi, Asterios Leonidis, Stavroula Ntoa, Constantine Stephanidis
2015	J	`jnl`	Erratum to: Design and implementation of a social networking platform for cloud deployment specialists. J. Internet Serv. Appl. Kostas Magoutis, Christos Papoulas, Antonis Papaioannou, Flora Karniavoura, Dimitrios-Georgios Akestoridis, Nikos Parotsidis, Maria Korozi, Asterios Leonidis, Stavroula Ntoa, Constantine Stephanidis
2015	A	`conf`	Selecting Shortcuts for a Smaller World. SDM Nikos Parotsidis, Evaggelia Pitoura, Panayiotis Tsaparas
2014	J	`jnl`	2-Edge Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2014	J	`jnl`	2-Vertex Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
2014	B	`conf`	Loop Nesting Forests, Dominators, and Applications. SEA Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan
2013	B	`conf`	Dominator Certification and Independent Spanning Trees: An Experimental Study. SEA Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan