Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Nikos Parotsidis
@inproceedings{DBLP:conf/icalp/AamandKLPRT23,
author = {Anders Aamand and
Adam Karczmarz and
Jakub Lacki and
Nikos Parotsidis and
Peter M. R. Rasmussen and
Mikkel Thorup},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Optimal Decremental Connectivity in Non-Sparse Graphs},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {6:1--6:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.6},
doi = {10.4230/LIPICS.ICALP.2023.6},
timestamp = {Wed, 05 Jul 2023 16:19:52 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AamandKLPRT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/0001CLP23,
author = {Lorenzo Beretta and
Vincent Cohen{-}Addad and
Silvio Lattanzi and
Nikos Parotsidis},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Multi-Swap k-Means++},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/52d63f9e4b81f866bf69fb3c834aad47-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/0001CLP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BhattacharyaCLP23,
author = {Sayan Bhattacharya and
Mart{\'{\i}}n Costa and
Silvio Lattanzi and
Nikos Parotsidis},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Fully Dynamic k-Clustering in {\~{O}}(k) Update Time},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/3b7ba46201bf15e5c3935272afae50db-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/BhattacharyaCLP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GeorgiadisKPP23,
author = {Loukas Georgiadis and
Evangelos Kipouridis and
Charis Papadopoulos and
Nikos Parotsidis},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Faster Computation of 3-Edge-Connected Components in Digraphs},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {2489--2531},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch96},
doi = {10.1137/1.9781611977554.CH96},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GeorgiadisKPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-16384,
author = {Lorenzo Beretta and
Vincent Cohen{-}Addad and
Silvio Lattanzi and
Nikos Parotsidis},
title = {Multi-Swap k-Means++},
journal = {CoRR},
volume = {abs/2309.16384},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.16384},
doi = {10.48550/ARXIV.2309.16384},
eprinttype = {arXiv},
eprint = {2309.16384},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-16384.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-17420,
author = {Sayan Bhattacharya and
Mart{\'{\i}}n Costa and
Silvio Lattanzi and
Nikos Parotsidis},
title = {Fully Dynamic k-Clustering in O{\~}(k) Update Time},
journal = {CoRR},
volume = {abs/2310.17420},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.17420},
doi = {10.48550/ARXIV.2310.17420},
eprinttype = {arXiv},
eprint = {2310.17420},
timestamp = {Thu, 02 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-17420.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DongGNPRS22,
author = {Yuanyuan Dong and
Andrew V. Goldberg and
Alexander Noe and
Nikos Parotsidis and
Mauricio G. C. Resende and
Quico Spaen},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {A Local Search Algorithm for Large Maximum Weight Independent Set
Problems},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {45:1--45:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.45},
doi = {10.4230/LIPICS.ESA.2022.45},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/DongGNPRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Cohen-AddadLMP22,
author = {Vincent Cohen{-}Addad and
Silvio Lattanzi and
Andreas Maggiori and
Nikos Parotsidis},
editor = {Kamalika Chaudhuri and
Stefanie Jegelka and
Le Song and
Csaba Szepesv{\'{a}}ri and
Gang Niu and
Sivan Sabato},
title = {Online and Consistent Correlation Clustering},
booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
2022, Baltimore, Maryland, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {162},
pages = {4157--4179},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v162/cohen-addad22a.html},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/Cohen-AddadLMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BhattacharyaLP22,
author = {Sayan Bhattacharya and
Silvio Lattanzi and
Nikos Parotsidis},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Efficient and Stable Fully Dynamic Facility Location},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/943d6dca1884955e645d8997ae2fa938-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/BhattacharyaLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/Cohen-AddadFLMN22,
author = {Vincent Cohen{-}Addad and
Chenglin Fan and
Silvio Lattanzi and
Slobodan Mitrovic and
Ashkan Norouzi{-}Fard and
Nikos Parotsidis and
Jakub Tarnawski},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Near-Optimal Correlation Clustering with Privacy},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/da645920dcd3bd35b0dae329894bad80-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/Cohen-AddadFLMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-01440,
author = {Vincent Cohen{-}Addad and
Chenglin Fan and
Silvio Lattanzi and
Slobodan Mitrovic and
Ashkan Norouzi{-}Fard and
Nikos Parotsidis and
Jakub Tarnawski},
title = {Near-Optimal Correlation Clustering with Privacy},
journal = {CoRR},
volume = {abs/2203.01440},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.01440},
doi = {10.48550/ARXIV.2203.01440},
eprinttype = {arXiv},
eprint = {2203.01440},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-01440.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-15805,
author = {Yuanyuan Dong and
Andrew V. Goldberg and
Alexander Noe and
Nikos Parotsidis and
Mauricio G. C. Resende and
Quico Spaen},
title = {A Metaheuristic Algorithm for Large Maximum Weight Independent Set
Problems},
journal = {CoRR},
volume = {abs/2203.15805},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.15805},
doi = {10.48550/ARXIV.2203.15805},
eprinttype = {arXiv},
eprint = {2203.15805},
timestamp = {Mon, 04 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-15805.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-13880,
author = {Sayan Bhattacharya and
Silvio Lattanzi and
Nikos Parotsidis},
title = {Efficient and Stable Fully Dynamic Facility Location},
journal = {CoRR},
volume = {abs/2210.13880},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.13880},
doi = {10.48550/ARXIV.2210.13880},
eprinttype = {arXiv},
eprint = {2210.13880},
timestamp = {Mon, 31 Oct 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-13880.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orf/DongGNPRS21,
author = {Yuanyuan Dong and
Andrew V. Goldberg and
Alexander Noe and
Nikos Parotsidis and
Mauricio G. C. Resende and
Quico Spaen},
title = {New Instances for Maximum Weight Independent Set From a Vehicle Routing
Application},
journal = {Oper. Res. Forum},
volume = {2},
number = {4},
year = {2021},
url = {https://doi.org/10.1007/s43069-021-00084-x},
doi = {10.1007/S43069-021-00084-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orf/DongGNPRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GeorgiadisKLP21,
author = {Loukas Georgiadis and
Dionysios Kefallinos and
Luigi Laura and
Nikos Parotsidis},
editor = {Martin Farach{-}Colton and
Sabine Storandt},
title = {An Experimental Study of Algorithms for Computing the Edge Connectivity
of a Directed Graph},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2021, Virtual Conference, January 10-11, 2021},
pages = {85--97},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976472.7},
doi = {10.1137/1.9781611976472.7},
timestamp = {Wed, 17 Mar 2021 12:44:04 +0100},
biburl = {https://dblp.org/rec/conf/alenex/GeorgiadisKLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-Addad0KPT21,
author = {Vincent Cohen{-}Addad and
Debarati Das and
Evangelos Kipouridis and
Nikos Parotsidis and
Mikkel Thorup},
title = {Fitting Distances by Tree Metrics Minimizing the Total Error within
a Constant Factor},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {468--479},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00054},
doi = {10.1109/FOCS52979.2021.00054},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Cohen-Addad0KPT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/Anagnostopoulos21,
author = {Aris Anagnostopoulos and
Aristides Gionis and
Nikos Parotsidis},
editor = {Martin Farach{-}Colton and
Giuseppe Prencipe and
Ryuhei Uehara},
title = {Collaborative Procrastination},
booktitle = {10th International Conference on Fun with Algorithms, {FUN} 2021,
May 30 to June 1, 2021, Favignana Island, Sicily, Italy},
series = {LIPIcs},
volume = {157},
pages = {2:1--2:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FUN.2021.2},
doi = {10.4230/LIPICS.FUN.2021.2},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/fun/Anagnostopoulos21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Cohen-AddadLMNP21,
author = {Vincent Cohen{-}Addad and
Silvio Lattanzi and
Slobodan Mitrovic and
Ashkan Norouzi{-}Fard and
Nikos Parotsidis and
Jakub Tarnawski},
editor = {Marina Meila and
Tong Zhang},
title = {Correlation Clustering in Constant Many Parallel Rounds},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {2069--2078},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/cohen-addad21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/Cohen-AddadLMNP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GrandoniILPU21,
author = {Fabrizio Grandoni and
Giuseppe F. Italiano and
Aleksander Lukasiewicz and
Nikos Parotsidis and
Przemyslaw Uznanski},
editor = {D{\'{a}}niel Marx},
title = {All-Pairs {LCA} in DAGs: Breaking through the \emph{O}(\emph{n}\({}^{\mbox{2.5}}\))
barrier},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {273--289},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.18},
doi = {10.1137/1.9781611976465.18},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GrandoniILPU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ItalianoKP21,
author = {Giuseppe F. Italiano and
Adam Karczmarz and
Nikos Parotsidis},
editor = {D{\'{a}}niel Marx},
title = {Planar Reachability Under Single Vertex or Edge Failures},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2739--2758},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.163},
doi = {10.1137/1.9781611976465.163},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ItalianoKP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-02574,
author = {Giuseppe F. Italiano and
Adam Karczmarz and
Nikos Parotsidis},
title = {Planar Reachability Under Single Vertex or Edge Failures},
journal = {CoRR},
volume = {abs/2101.02574},
year = {2021},
url = {https://arxiv.org/abs/2101.02574},
eprinttype = {arXiv},
eprint = {2101.02574},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-02574.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-12623,
author = {Yuanyuan Dong and
Andrew V. Goldberg and
Alexander Noe and
Nikos Parotsidis and
Mauricio G. C. Resende and
Quico Spaen},
title = {New instances for maximum weight independent set from a vehicle routing
application},
journal = {CoRR},
volume = {abs/2105.12623},
year = {2021},
url = {https://arxiv.org/abs/2105.12623},
eprinttype = {arXiv},
eprint = {2105.12623},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-12623.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-08448,
author = {Vincent Cohen{-}Addad and
Silvio Lattanzi and
Slobodan Mitrovic and
Ashkan Norouzi{-}Fard and
Nikos Parotsidis and
Jakub Tarnawski},
title = {Correlation Clustering in Constant Many Parallel Rounds},
journal = {CoRR},
volume = {abs/2106.08448},
year = {2021},
url = {https://arxiv.org/abs/2106.08448},
eprinttype = {arXiv},
eprint = {2106.08448},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-08448.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-02807,
author = {Vincent Cohen{-}Addad and
Debarati Das and
Evangelos Kipouridis and
Nikos Parotsidis and
Mikkel Thorup},
title = {Fitting Distances by Tree Metrics Minimizing the Total Error within
a Constant Factor},
journal = {CoRR},
volume = {abs/2110.02807},
year = {2021},
url = {https://arxiv.org/abs/2110.02807},
eprinttype = {arXiv},
eprint = {2110.02807},
timestamp = {Thu, 21 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-02807.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-09376,
author = {Anders Aamand and
Adam Karczmarz and
Jakub Lacki and
Nikos Parotsidis and
Peter M. R. Rasmussen and
Mikkel Thorup},
title = {Optimal Decremental Connectivity in Non-Sparse Graphs},
journal = {CoRR},
volume = {abs/2111.09376},
year = {2021},
url = {https://arxiv.org/abs/2111.09376},
eprinttype = {arXiv},
eprint = {2111.09376},
timestamp = {Mon, 22 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-09376.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GeorgiadisIP20,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
title = {Strong Connectivity in Directed Graphs under Failures, with Applications},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {5},
pages = {865--926},
year = {2020},
url = {https://doi.org/10.1137/19M1258530},
doi = {10.1137/19M1258530},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GeorgiadisIP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-08914,
author = {Fabrizio Grandoni and
Giuseppe F. Italiano and
Aleksander Lukasiewicz and
Nikos Parotsidis and
Przemyslaw Uznanski},
title = {All-Pairs {LCA} in DAGs: Breaking through the O(n\({}^{\mbox{2.5}}\))
barrier},
journal = {CoRR},
volume = {abs/2007.08914},
year = {2020},
url = {https://arxiv.org/abs/2007.08914},
eprinttype = {arXiv},
eprint = {2007.08914},
timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-08914.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AbboudGIKPTUW19,
author = {Amir Abboud and
Loukas Georgiadis and
Giuseppe F. Italiano and
Robert Krauthgamer and
Nikos Parotsidis and
Ohad Trabelsi and
Przemyslaw Uznanski and
Daniel Wolleb{-}Graf},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Faster Algorithms for All-Pairs Bounded Min-Cuts},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {7:1--7:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.7},
doi = {10.4230/LIPICS.ICALP.2019.7},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AbboudGIKPTUW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/Cohen-AddadHPSS19,
author = {Vincent Cohen{-}Addad and
Niklas Hjuler and
Nikos Parotsidis and
David Saulpic and
Chris Schwiegelshohn},
editor = {Hanna M. Wallach and
Hugo Larochelle and
Alina Beygelzimer and
Florence d'Alch{\'{e}}{-}Buc and
Emily B. Fox and
Roman Garnett},
title = {Fully Dynamic Consistent Facility Location},
booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
on Neural Information Processing Systems 2019, NeurIPS 2019, December
8-14, 2019, Vancouver, BC, Canada},
pages = {3250--3260},
year = {2019},
url = {https://proceedings.neurips.cc/paper/2019/hash/fface8385abbf94b4593a0ed53a0c70f-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/Cohen-AddadHPSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/ItalianoLMP19,
author = {Giuseppe F. Italiano and
Silvio Lattanzi and
Vahab S. Mirrokni and
Nikos Parotsidis},
editor = {Christian Scheideler and
Petra Berenbrink},
title = {Dynamic Algorithms for the Massively Parallel Computation Model},
booktitle = {The 31st {ACM} on Symposium on Parallelism in Algorithms and Architectures,
{SPAA} 2019, Phoenix, AZ, USA, June 22-24, 2019},
pages = {49--58},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3323165.3323202},
doi = {10.1145/3323165.3323202},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/ItalianoLMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HjulerIPS19,
author = {Niklas Hjuler and
Giuseppe F. Italiano and
Nikos Parotsidis and
David Saulpic},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Dominating Sets and Connected Dominating Sets in Dynamic Graphs},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {35:1--35:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.35},
doi = {10.4230/LIPICS.STACS.2019.35},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/HjulerIPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-09877,
author = {Niklas Hjuler and
Giuseppe F. Italiano and
Nikos Parotsidis and
David Saulpic},
title = {Dominating Sets and Connected Dominating Sets in Dynamic Graphs},
journal = {CoRR},
volume = {abs/1901.09877},
year = {2019},
url = {http://arxiv.org/abs/1901.09877},
eprinttype = {arXiv},
eprint = {1901.09877},
timestamp = {Sat, 02 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-09877.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-09175,
author = {Giuseppe F. Italiano and
Silvio Lattanzi and
Vahab S. Mirrokni and
Nikos Parotsidis},
title = {Dynamic Algorithms for the Massively Parallel Computation Model},
journal = {CoRR},
volume = {abs/1905.09175},
year = {2019},
url = {http://arxiv.org/abs/1905.09175},
eprinttype = {arXiv},
eprint = {1905.09175},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-09175.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GeorgiadisILP18,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
title = {2-vertex connectivity in directed graphs},
journal = {Inf. Comput.},
volume = {261},
pages = {248--264},
year = {2018},
url = {https://doi.org/10.1016/j.ic.2018.02.007},
doi = {10.1016/J.IC.2018.02.007},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GeorgiadisILP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GeorgiadisIKPP18,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Aikaterini Karanasiou and
Nikos Parotsidis and
Nilakantha Paudel},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Computing 2-Connected Components and Maximal 2-Connected Subgraphs
in Directed Graphs: An Experimental Study},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {169--183},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.15},
doi = {10.1137/1.9781611975055.15},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/GeorgiadisIKPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GeorgiadisIP18,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
editor = {Michael A. Bender and
Martin Farach{-}Colton and
Miguel A. Mosteiro},
title = {Incremental Strong Connectivity and 2-Connectivity in Directed Graphs},
booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10807},
pages = {529--543},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-77404-6\_39},
doi = {10.1007/978-3-319-77404-6\_39},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/GeorgiadisIP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/GentilePV18,
author = {Claudio Gentile and
Nikos Parotsidis and
Fabio Vitale},
editor = {Samy Bengio and
Hanna M. Wallach and
Hugo Larochelle and
Kristen Grauman and
Nicol{\`{o}} Cesa{-}Bianchi and
Roman Garnett},
title = {Online Reciprocal Recommendation with Theoretical Performance Guarantees},
booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference
on Neural Information Processing Systems 2018, NeurIPS 2018, December
3-8, 2018, Montr{\'{e}}al, Canada},
pages = {8267--8277},
year = {2018},
url = {https://proceedings.neurips.cc/paper/2018/hash/97af07a14cacba681feacf3012730892-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/GentilePV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-10189,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
title = {Incremental Strong Connectivity and 2-Connectivity in Directed Graphs},
journal = {CoRR},
volume = {abs/1802.10189},
year = {2018},
url = {http://arxiv.org/abs/1802.10189},
eprinttype = {arXiv},
eprint = {1802.10189},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-10189.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-01182,
author = {Fabio Vitale and
Nikos Parotsidis and
Claudio Gentile},
title = {Online Reciprocal Recommendation with Theoretical Performance Guarantees},
journal = {CoRR},
volume = {abs/1806.01182},
year = {2018},
url = {http://arxiv.org/abs/1806.01182},
eprinttype = {arXiv},
eprint = {1806.01182},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-01182.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05803,
author = {Amir Abboud and
Loukas Georgiadis and
Daniel Graf and
Giuseppe F. Italiano and
Robert Krauthgamer and
Nikos Parotsidis and
Ohad Trabelsi and
Przemyslaw Uznanski},
title = {Faster Algorithms for All-Pairs Bounded Min-Cuts},
journal = {CoRR},
volume = {abs/1807.05803},
year = {2018},
url = {http://arxiv.org/abs/1807.05803},
eprinttype = {arXiv},
eprint = {1807.05803},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-05803.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeorgiadisIKPP17,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Aikaterini Karanasiou and
Charis Papadopoulos and
Nikos Parotsidis},
title = {Sparse certificates for 2-connectivity in directed graphs},
journal = {Theor. Comput. Sci.},
volume = {698},
pages = {40--66},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.06.015},
doi = {10.1016/J.TCS.2017.06.015},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GeorgiadisIKPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GeorgiadisHIKP17,
author = {Loukas Georgiadis and
Thomas Dueholm Hansen and
Giuseppe F. Italiano and
Sebastian Krinninger and
Nikos Parotsidis},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Decremental Data Structures for Connectivity and Dominators in Directed
Graphs},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {42:1--42:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.42},
doi = {10.4230/LIPICS.ICALP.2017.42},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GeorgiadisHIKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GeorgiadisGIPU17,
author = {Loukas Georgiadis and
Daniel Graf and
Giuseppe F. Italiano and
Nikos Parotsidis and
Przemyslaw Uznanski},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {All-Pairs 2-Reachability in O(n{\^{}}w log n) Time},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {74:1--74:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.74},
doi = {10.4230/LIPICS.ICALP.2017.74},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GeorgiadisGIPU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/GarimellaGPT17,
author = {Kiran Garimella and
Aristides Gionis and
Nikos Parotsidis and
Nikolaj Tatti},
editor = {Isabelle Guyon and
Ulrike von Luxburg and
Samy Bengio and
Hanna M. Wallach and
Rob Fergus and
S. V. N. Vishwanathan and
Roman Garnett},
title = {Balancing information exposure in social networks},
booktitle = {Advances in Neural Information Processing Systems 30: Annual Conference
on Neural Information Processing Systems 2017, December 4-9, 2017,
Long Beach, CA, {USA}},
pages = {4663--4671},
year = {2017},
url = {https://proceedings.neurips.cc/paper/2017/hash/fc79250f8c5b804390e8da280b4cf06e-Abstract.html},
timestamp = {Thu, 21 Jan 2021 13:58:27 +0100},
biburl = {https://dblp.org/rec/conf/nips/GarimellaGPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GeorgiadisIP17,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
editor = {Philip N. Klein},
title = {Strong Connectivity in Directed Graphs under Failures, with Applications},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1880--1899},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.123},
doi = {10.1137/1.9781611974782.123},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/GeorgiadisIP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChechikHILP17,
author = {Shiri Chechik and
Thomas Dueholm Hansen and
Giuseppe F. Italiano and
Veronika Loitzenbauer and
Nikos Parotsidis},
editor = {Philip N. Klein},
title = {Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse
Directed Graphs},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1900--1918},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.124},
doi = {10.1137/1.9781611974782.124},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChechikHILP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisHIKP17,
author = {Loukas Georgiadis and
Thomas Dueholm Hansen and
Giuseppe F. Italiano and
Sebastian Krinninger and
Nikos Parotsidis},
title = {Decremental Data Structures for Connectivity and Dominators in Directed
Graphs},
journal = {CoRR},
volume = {abs/1704.08235},
year = {2017},
url = {http://arxiv.org/abs/1704.08235},
eprinttype = {arXiv},
eprint = {1704.08235},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisHIKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChechikHILP17,
author = {Shiri Chechik and
Thomas Dueholm Hansen and
Giuseppe F. Italiano and
Veronika Loitzenbauer and
Nikos Parotsidis},
title = {Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse
Directed Graphs},
journal = {CoRR},
volume = {abs/1705.10709},
year = {2017},
url = {http://arxiv.org/abs/1705.10709},
eprinttype = {arXiv},
eprint = {1705.10709},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChechikHILP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-01491,
author = {Kiran Garimella and
Aristides Gionis and
Nikos Parotsidis and
Nikolaj Tatti},
title = {Balancing Information Exposure in Social Networks},
journal = {CoRR},
volume = {abs/1709.01491},
year = {2017},
url = {http://arxiv.org/abs/1709.01491},
eprinttype = {arXiv},
eprint = {1709.01491},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-01491.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GeorgiadisILP16,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
title = {2-Edge Connectivity in Directed Graphs},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {1},
pages = {9:1--9:24},
year = {2016},
url = {https://doi.org/10.1145/2968448},
doi = {10.1145/2968448},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/GeorgiadisILP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GeorgiadisIP16,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {2-Connectivity in Directed Graphs},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {1:1--1:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.1},
doi = {10.4230/LIPICS.ESA.2016.1},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/GeorgiadisIP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChechikHILP16,
author = {Shiri Chechik and
Thomas Dueholm Hansen and
Giuseppe F. Italiano and
Jakub Lacki and
Nikos Parotsidis},
editor = {Irit Dinur},
title = {Decremental Single-Source Reachability and Strongly Connected Components
in {\~{O}}(m{\(\surd\)}n) Total Update Time},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {315--324},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.42},
doi = {10.1109/FOCS.2016.42},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChechikHILP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GeorgiadisIP16,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Incremental 2-Edge-Connectivity in Directed Graphs},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {49:1--49:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.49},
doi = {10.4230/LIPICS.ICALP.2016.49},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GeorgiadisIP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GeorgiadisIKPP16,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Aikaterini Karanasiou and
Charis Papadopoulos and
Nikos Parotsidis},
editor = {Andrew V. Goldberg and
Alexander S. Kulikov},
title = {Sparse Subgraphs for 2-Connectivity in Directed Graphs},
booktitle = {Experimental Algorithms - 15th International Symposium, {SEA} 2016,
St. Petersburg, Russia, June 5-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9685},
pages = {150--166},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-38851-9\_11},
doi = {10.1007/978-3-319-38851-9\_11},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/GeorgiadisIKPP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wsdm/ParotsidisPT16,
author = {Nikos Parotsidis and
Evaggelia Pitoura and
Panayiotis Tsaparas},
editor = {Paul N. Bennett and
Vanja Josifovski and
Jennifer Neville and
Filip Radlinski},
title = {Centrality-Aware Link Recommendations},
booktitle = {Proceedings of the Ninth {ACM} International Conference on Web Search
and Data Mining, San Francisco, CA, USA, February 22-25, 2016},
pages = {503--512},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2835776.2835818},
doi = {10.1145/2835776.2835818},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wsdm/ParotsidisPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisIP16,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
title = {Incremental 2-Edge-Connectivity in Directed Graphs},
journal = {CoRR},
volume = {abs/1607.07073},
year = {2016},
url = {http://arxiv.org/abs/1607.07073},
eprinttype = {arXiv},
eprint = {1607.07073},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisIP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisGIPU16,
author = {Loukas Georgiadis and
Daniel Graf and
Giuseppe F. Italiano and
Nikos Parotsidis and
Przemyslaw Uznanski},
title = {All-Pairs {\textdollar}2{\textdollar}-reachability in {\~{O}}(n\({}^{\mbox{{\(\omega\)}}}\))
Time},
journal = {CoRR},
volume = {abs/1612.08075},
year = {2016},
url = {http://arxiv.org/abs/1612.08075},
eprinttype = {arXiv},
eprint = {1612.08075},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisGIPU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jisa/MagoutisPPKAPKL15,
author = {Kostas Magoutis and
Christos Papoulas and
Antonis Papaioannou and
Flora Karniavoura and
Dimitrios{-}Georgios Akestoridis and
Nikos Parotsidis and
Maria Korozi and
Asterios Leonidis and
Stavroula Ntoa and
Constantine Stephanidis},
title = {Design and implementation of a social networking platform for cloud
deployment specialists},
journal = {J. Internet Serv. Appl.},
volume = {6},
number = {1},
pages = {19:1--19:26},
year = {2015},
url = {https://doi.org/10.1186/s13174-015-0033-5},
doi = {10.1186/S13174-015-0033-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jisa/MagoutisPPKAPKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jisa/MagoutisPPKAPKL15a,
author = {Kostas Magoutis and
Christos Papoulas and
Antonis Papaioannou and
Flora Karniavoura and
Dimitrios{-}Georgios Akestoridis and
Nikos Parotsidis and
Maria Korozi and
Asterios Leonidis and
Stavroula Ntoa and
Constantine Stephanidis},
title = {Erratum to: Design and implementation of a social networking platform
for cloud deployment specialists},
journal = {J. Internet Serv. Appl.},
volume = {6},
number = {1},
pages = {20:1--20:12},
year = {2015},
url = {https://doi.org/10.1186/s13174-015-0036-2},
doi = {10.1186/S13174-015-0036-2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jisa/MagoutisPPKAPKL15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/LuigiGILP15,
author = {William Di Luigi and
Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
editor = {Ulrik Brandes and
David Eppstein},
title = {2-Connectivity in Directed Graphs: An Experimental Study},
booktitle = {Proceedings of the Seventeenth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2015, San Diego, CA, USA, January 5, 2015},
pages = {173--187},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973754.15},
doi = {10.1137/1.9781611973754.15},
timestamp = {Fri, 19 May 2017 01:26:03 +0200},
biburl = {https://dblp.org/rec/conf/alenex/LuigiGILP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GeorgiadisIPP15,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Charis Papadopoulos and
Nikos Parotsidis},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity
in Directed Graphs},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {582--594},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_49},
doi = {10.1007/978-3-662-48350-3\_49},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/GeorgiadisIPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GeorgiadisILP15,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {2-Vertex Connectivity in Directed Graphs},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {605--616},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_49},
doi = {10.1007/978-3-662-47672-7\_49},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GeorgiadisILP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sdm/ParotsidisPT15,
author = {Nikos Parotsidis and
Evaggelia Pitoura and
Panayiotis Tsaparas},
editor = {Suresh Venkatasubramanian and
Jieping Ye},
title = {Selecting Shortcuts for a Smaller World},
booktitle = {Proceedings of the 2015 {SIAM} International Conference on Data Mining,
Vancouver, BC, Canada, April 30 - May 2, 2015},
pages = {28--36},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611974010.4},
doi = {10.1137/1.9781611974010.4},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sdm/ParotsidisPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GeorgiadisILP15,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
editor = {Piotr Indyk},
title = {2-Edge Connectivity in Directed Graphs},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1988--2005},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.132},
doi = {10.1137/1.9781611973730.132},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/GeorgiadisILP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisIPP15,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Charis Papadopoulos and
Nikos Parotsidis},
title = {Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity
in Directed Graphs},
journal = {CoRR},
volume = {abs/1509.02841},
year = {2015},
url = {http://arxiv.org/abs/1509.02841},
eprinttype = {arXiv},
eprint = {1509.02841},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisIPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisIP15,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Nikos Parotsidis},
title = {A New Framework for Strong Connectivity and 2-Connectivity in Directed
Graphs},
journal = {CoRR},
volume = {abs/1511.02913},
year = {2015},
url = {http://arxiv.org/abs/1511.02913},
eprinttype = {arXiv},
eprint = {1511.02913},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisIP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GeorgiadisLPT14,
author = {Loukas Georgiadis and
Luigi Laura and
Nikos Parotsidis and
Robert Endre Tarjan},
editor = {Joachim Gudmundsson and
Jyrki Katajainen},
title = {Loop Nesting Forests, Dominators, and Applications},
booktitle = {Experimental Algorithms - 13th International Symposium, {SEA} 2014,
Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8504},
pages = {174--186},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07959-2\_15},
doi = {10.1007/978-3-319-07959-2\_15},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/GeorgiadisLPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisILP14,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
title = {2-Edge Connectivity in Directed Graphs},
journal = {CoRR},
volume = {abs/1407.3041},
year = {2014},
url = {http://arxiv.org/abs/1407.3041},
eprinttype = {arXiv},
eprint = {1407.3041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisILP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GeorgiadisILP14a,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Luigi Laura and
Nikos Parotsidis},
title = {2-Vertex Connectivity in Directed Graphs},
journal = {CoRR},
volume = {abs/1409.6277},
year = {2014},
url = {http://arxiv.org/abs/1409.6277},
eprinttype = {arXiv},
eprint = {1409.6277},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GeorgiadisILP14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GeorgiadisLPT13,
author = {Loukas Georgiadis and
Luigi Laura and
Nikos Parotsidis and
Robert Endre Tarjan},
editor = {Vincenzo Bonifaci and
Camil Demetrescu and
Alberto Marchetti{-}Spaccamela},
title = {Dominator Certification and Independent Spanning Trees: An Experimental
Study},
booktitle = {Experimental Algorithms, 12th International Symposium, {SEA} 2013,
Rome, Italy, June 5-7, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7933},
pages = {284--295},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38527-8\_26},
doi = {10.1007/978-3-642-38527-8\_26},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/GeorgiadisLPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
