Nikos Parotsidis
Nikos Parotsidis
Verified email at google.com - Homepage
Title
Cited by
Cited by
Year
2-edge connectivity in directed graphs
L Georgiadis, GF Italiano, L Laura, N Parotsidis
ACM Transactions on Algorithms (TALG) 13 (1), 9, 2016
452016
2-vertex connectivity in directed graphs
L Georgiadis, GF Italiano, L Laura, N Parotsidis
Information and Computation 261, 248-264, 2018
372018
Selecting shortcuts for a smaller world
N Parotsidis, E Pitoura, P Tsaparas
SIAM International Conference on Data Mining (SDM), 2015
362015
Balancing information exposure in social networks
K Garimella, A Gionis, N Parotsidis, N Tatti
Advances in Neural Information Processing Systems, 4663-4671, 2017
312017
Centrality-aware link recommendations
N Parotsidis, E Pitoura, P Tsaparas
Proceedings of the Ninth ACM International Conference on Web Search and Data …, 2016
312016
Strong connectivity in directed graphs under failures, with applications
L Georgiadis, GF Italiano, N Parotsidis
SIAM Journal on Computing 49 (5), 865-926, 2020
24*2020
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
222016
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
182017
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
182015
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
142019
Fully dynamic consistent facility location
V Cohen-Addad, NOD Hjuler, N Parotsidis, D Saulpic, C Schwiegelshohn
Advances in Neural Information Processing Systems, 3255-3265, 2019
102019
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs
L Georgiadis, GF Italiano, C Papadopoulos, N Parotsidis
Algorithms-ESA 2015, 582-594, 2015
102015
Dominator certification and independent spanning trees: An experimental study
L Georgiadis, L Laura, N Parotsidis, RE Tarjan
International Symposium on Experimental Algorithms, 284-295, 2013
102013
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), 19, 2015
92015
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
82017
Incremental -Edge-Connectivity in Directed Graphs
L Georgiadis, GF Italiano, N Parotsidis
arXiv preprint arXiv:1607.07073, 2016
82016
Loop nesting forests, dominators, and applications
L Georgiadis, L Laura, N Parotsidis, RE Tarjan
International Symposium on Experimental Algorithms, 174-186, 2014
82014
Dominators in Directed Graphs: A Survey of Recent Results, Applications, and Open Problems
L Georgiadis, N Parotsidis
82013
Faster algorithms for all-pairs bounded min-cuts
A Abboud, L Georgiadis, GF Italiano, R Krauthgamer, N Parotsidis, ...
arXiv preprint arXiv:1807.05803, 2018
72018
All-Pairs 2-Reachability in Time
L Georgiadis, D Graf, GF Italiano, N Parotsidis, P Uznański
arXiv preprint arXiv:1612.08075, 2016
62016
The system can't perform the operation now. Try again later.
Articles 1–20