Nikos Parotsidis
Nikos Parotsidis
Verificeret mail på google.com - Startside
Citeret af
Citeret af
Balancing information exposure in social networks
K Garimella, A Gionis, N Parotsidis, N Tatti
Advances in neural information processing systems 30, 2017
Selecting shortcuts for a smaller world
N Parotsidis, E Pitoura, P Tsaparas
SIAM International Conference on Data Mining (SDM), 2015
2-edge connectivity in directed graphs
L Georgiadis, GF Italiano, L Laura, N Parotsidis
ACM Transactions on Algorithms (TALG) 13 (1), 9, 2016
Centrality-aware link recommendations
N Parotsidis, E Pitoura, P Tsaparas
Proceedings of the ninth ACM international conference on web search and data …, 2016
2-vertex connectivity in directed graphs
L Georgiadis, GF Italiano, L Laura, N Parotsidis
Information and Computation 261, 248-264, 2018
Strong connectivity in directed graphs under failures, with applications
L Georgiadis, GF Italiano, N Parotsidis
SIAM Journal on Computing 49 (5), 865-926, 2020
Fully dynamic consistent facility location
V Cohen-Addad, NOD Hjuler, N Parotsidis, D Saulpic, C Schwiegelshohn
Advances in Neural Information Processing Systems 32, 2019
Correlation clustering in constant many parallel rounds
V Cohen-Addad, S Lattanzi, S Mitrović, A Norouzi-Fard, N Parotsidis, ...
International Conference on Machine Learning, 2069-2078, 2021
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs
S Chechik, TD Hansen, GF Italiano, V Loitzenbauer, N Parotsidis
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Decremental single-source reachability and strongly connected components in O (m√ n) total update time
S Chechik, TD Hansen, GF Italiano, J Łącki, N Parotsidis
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
Faster algorithms for all-pairs bounded min-cuts
A Abboud, L Georgiadis, GF Italiano, R Krauthgamer, N Parotsidis, ...
arXiv preprint arXiv:1807.05803, 2018
Dynamic algorithms for the massively parallel computation model
GF Italiano, S Lattanzi, VS Mirrokni, N Parotsidis
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 49-58, 2019
2-Connectivity in Directed Graphs: An Experimental Study
W Di Luigi, L Georgiadis, GF Italiano, L Laura, N Parotsidis
17th Workshop on Algorithm Engineering and Experiments (ALENEX), 173-187, 2015
Dominating sets and connected dominating sets in dynamic graphs
N Hjuler, GF Italiano, N Parotsidis, D Saulpic
arXiv preprint arXiv:1901.09877, 2019
Design and implementation of a social networking platform for cloud deployment specialists
K Magoutis, C Papoulas, A Papaioannou, F Karniavoura, DG Akestoridis, ...
Journal of Internet Services and Applications 6, 1-26, 2015
All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier
F Grandoni, GF Italian, A Łukasiewicz, N Parotsidis, P Uznański
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Dominator certification and independent spanning trees: An experimental study
L Georgiadis, L Laura, N Parotsidis, RE Tarjan
Experimental Algorithms: 12th International Symposium, SEA 2013, Rome, Italy …, 2013
Decremental data structures for connectivity and dominators in directed graphs
L Georgiadis, TD Hansen, GF Italiano, S Krinninger, N Parotsidis
arXiv preprint arXiv:1704.08235, 2017
Near-optimal correlation clustering with privacy
V Cohen-Addad, C Fan, S Lattanzi, S Mitrovic, A Norouzi-Fard, ...
Advances in Neural Information Processing Systems 35, 33702-33715, 2022
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs
L Georgiadis, GF Italiano, C Papadopoulos, N Parotsidis
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20