Nikos Parotsidis
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
36
Venues
13
Active years
2015–2026
Best venue rank
A*
Where they publish
Papers
36 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time. | Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas, Charis Papadopoulos, Nikos Parotsidis |
| 2025 | ICALP | Fully Dynamic Algorithms for Transitive Reduction. | Gramoz Goranci, Adam Karczmarz, Ali Momeni, Nikos Parotsidis |
| 2025 | ICML | Almost Optimal Fully Dynamic k-Center Clustering with Recourse. | Sayan Bhattacharya, Martn Costa, Ermiya Farokhnejad, Silvio Lattanzi, Nikos Parotsidis |
| 2025 | RecSys | Streaming Trends: A Low-Latency Platform for Dynamic Video Grouping and Trending Corpora Building. | Yang Gu, Caroline Zhou, Qiao Zhang, Scott Wang, Yongzhe Wang, Li Zhang, Nikos Parotsidis, CJ Carey, Ashkan Fard, Mingyan Gao, Yaping Zhang, Sourabh Bansod |
| 2025 | SDM | DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering. | Shangdi Yu, Laxman Dhulipala, Jakub Lacki, Nikos Parotsidis |
| 2024 | ESA | Practical Expander Decomposition. | Lars Gottesbren, Nikos Parotsidis, Maximilian Probst Gutenberg |
| 2024 | FOCS | Fully Dynamic k-Clustering with Fast Update Time and Small Recourse. | Sayan Bhattacharya, Martn Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis |
| 2024 | ICML | Dynamic Correlation Clustering in Sublinear Update Time. | Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis |
| 2023 | ICALP | Optimal Decremental Connectivity in Non-Sparse Graphs. | Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup |
| 2023 | SODA | Faster Computation of 3-Edge-Connected Components in Digraphs. | Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis |
| 2022 | ESA | 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 |
| 2022 | ICML | Online and Consistent Correlation Clustering. | Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori, Nikos Parotsidis |
| 2021 | ALENEX | An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. | Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis |
| 2021 | FOCS | Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. | Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup |
| 2021 | FUN | Collaborative Procrastination. | Aris Anagnostopoulos, Aristides Gionis, Nikos Parotsidis |
| 2021 | ICML | Correlation Clustering in Constant Many Parallel Rounds. | Vincent Cohen-Addad, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski |
| 2021 | SODA | All-Pairs LCA in DAGs: Breaking through the | Fabrizio Grandoni, Giuseppe F. Italiano, Aleksander Lukasiewicz, Nikos Parotsidis, Przemyslaw Uznanski |
| 2021 | SODA | Planar Reachability Under Single Vertex or Edge Failures. | Giuseppe F. Italiano, Adam Karczmarz, Nikos Parotsidis |
| 2019 | ICALP | 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 |
| 2019 | STACS | Dominating Sets and Connected Dominating Sets in Dynamic Graphs. | Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic |
| 2019 | SPAA | Dynamic Algorithms for the Massively Parallel Computation Model. | Giuseppe F. Italiano, Silvio Lattanzi, Vahab S. Mirrokni, Nikos Parotsidis |
| 2018 | ALENEX | 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 |
| 2018 | LATIN | Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2017 | ICALP | All-Pairs 2-Reachability in O(n^w log n) Time. | Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski |
| 2017 | ICALP | Decremental Data Structures for Connectivity and Dominators in Directed Graphs. | Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis |
| 2017 | SODA | Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. | Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis |
| 2017 | SODA | Strong Connectivity in Directed Graphs under Failures, with Applications. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2016 | ESA | 2-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2016 | FOCS | 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 |
| 2016 | ICALP | Incremental 2-Edge-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis |
| 2016 | WSDM | Centrality-Aware Link Recommendations. | Nikos Parotsidis, Evaggelia Pitoura, Panayiotis Tsaparas |
| 2015 | ALENEX | 2-Connectivity in Directed Graphs: An Experimental Study. | William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis |
| 2015 | ESA | Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis |
| 2015 | ICALP | 2-Vertex Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis |
| 2015 | SODA | 2-Edge Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis |
| 2015 | SDM | Selecting Shortcuts for a Smaller World. | Nikos Parotsidis, Evaggelia Pitoura, Panayiotis Tsaparas |