Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Stefano Leucci 0001
@article{DBLP:journals/jcss/BiloDGLR24,
author = {Davide Bil{\`{o}} and
Gianlorenzo D'Angelo and
Luciano Gual{\`{a}} and
Stefano Leucci and
Mirko Rossi},
title = {Blackout-tolerant temporal spanners},
journal = {J. Comput. Syst. Sci.},
volume = {141},
pages = {103495},
year = {2024},
url = {https://doi.org/10.1016/j.jcss.2023.103495},
doi = {10.1016/J.JCSS.2023.103495},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BiloDGLR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GualaLZ23,
author = {Luciano Gual{\`{a}} and
Stefano Leucci and
Isabella Ziccardi},
title = {Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries
in Dynamic Trees},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1624--1651},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01046-3},
doi = {10.1007/S00453-022-01046-3},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GualaLZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BiloGLS23,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Luca Pep{\`{e}} Sciarria},
editor = {Pat Morin and
Subhash Suri},
title = {Finding Diameter-Reducing Shortcuts in Trees},
booktitle = {Algorithms and Data Structures - 18th International Symposium, {WADS}
2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14079},
pages = {164--178},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-38906-1\_12},
doi = {10.1007/978-3-031-38906-1\_12},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BiloGLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-17385,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Luca Pep{\`{e}} Sciarria},
title = {Finding Diameter-Reducing Shortcuts in Trees},
journal = {CoRR},
volume = {abs/2305.17385},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.17385},
doi = {10.48550/ARXIV.2305.17385},
eprinttype = {arXiv},
eprint = {2305.17385},
timestamp = {Wed, 07 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-17385.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiloGLP22,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {37--59},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00879-8},
doi = {10.1007/S00453-021-00879-8},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloGLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LeucciL22,
author = {Stefano Leucci and
Chih{-}Hung Liu},
title = {Approximate Minimum Selection with Unreliable Comparisons},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {60--84},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00880-1},
doi = {10.1007/S00453-021-00880-1},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/LeucciL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloG0PS22,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti and
Giacomo Scornavacca},
title = {Cutting bamboo down to size},
journal = {Theor. Comput. Sci.},
volume = {909},
pages = {54--67},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.01.027},
doi = {10.1016/J.TCS.2022.01.027},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiloG0PS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloGLPR22,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti and
Mirko Rossi},
title = {New approximation algorithms for the heterogeneous weighted delivery
problem},
journal = {Theor. Comput. Sci.},
volume = {932},
pages = {102--115},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.08.009},
doi = {10.1016/J.TCS.2022.08.009},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiloGLPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/BiloDGLR22,
author = {Davide Bil{\`{o}} and
Gianlorenzo D'Angelo and
Luciano Gual{\`{a}} and
Stefano Leucci and
Mirko Rossi},
editor = {Thomas Erlebach and
Michael Segal},
title = {Blackout-Tolerant Temporal Spanners},
booktitle = {Algorithmics of Wireless Networks - 18th International Symposium on
Algorithmics of Wireless Networks, {ALGOSENSORS} 2022, Potsdam, Germany,
September 8-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13707},
pages = {31--44},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22050-0\_3},
doi = {10.1007/978-3-031-22050-0\_3},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/algosensors/BiloDGLR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BiloDG0R22,
author = {Davide Bil{\`{o}} and
Gianlorenzo D'Angelo and
Luciano Gual{\`{a}} and
Stefano Leucci and
Mirko Rossi},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Sparse Temporal Spanners with Low Stretch},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {19:1--19:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.19},
doi = {10.4230/LIPICS.ESA.2022.19},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/BiloDG0R22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BiloDG0PR22,
author = {Davide Bil{\`{o}} and
Gianlorenzo D'Angelo and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti and
Mirko Rossi},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse
Preservers},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {12:1--12:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.12},
doi = {10.4230/LIPICS.STACS.2022.12},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BiloDG0PR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-11113,
author = {Davide Bil{\`{o}} and
Gianlorenzo D'Angelo and
Luciano Gual{\`{a}} and
Stefano Leucci and
Mirko Rossi},
title = {Sparse Temporal Spanners with Low Stretch},
journal = {CoRR},
volume = {abs/2206.11113},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.11113},
doi = {10.48550/ARXIV.2206.11113},
eprinttype = {arXiv},
eprint = {2206.11113},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-11113.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/BiloG0P21,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Network Creation Games with Traceroute-Based Strategies},
journal = {Algorithms},
volume = {14},
number = {2},
pages = {35},
year = {2021},
url = {https://doi.org/10.3390/a14020035},
doi = {10.3390/A14020035},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/BiloG0P21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkdd/BressanLP21,
author = {Marco Bressan and
Stefano Leucci and
Alessandro Panconesi},
title = {Faster Motif Counting via Succinct Color Coding and Adaptive Sampling},
journal = {{ACM} Trans. Knowl. Discov. Data},
volume = {15},
number = {6},
pages = {96:1--96:27},
year = {2021},
url = {https://doi.org/10.1145/3447397},
doi = {10.1145/3447397},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tkdd/BressanLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BiloG0PS21,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti and
Giacomo Scornavacca},
editor = {Martin Farach{-}Colton and
Giuseppe Prencipe and
Ryuhei Uehara},
title = {Cutting Bamboo down to Size},
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 = {5:1--5:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FUN.2021.5},
doi = {10.4230/LIPICS.FUN.2021.5},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/fun/BiloG0PS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Guala0Z21,
author = {Luciano Gual{\`{a}} and
Stefano Leucci and
Isabella Ziccardi},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries
in Dynamic Trees},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {66:1--66:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.66},
doi = {10.4230/LIPICS.ISAAC.2021.66},
timestamp = {Tue, 30 Nov 2021 14:09:45 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Guala0Z21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BiloG0PR21,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti and
Mirko Rossi},
editor = {Tomasz Jurdzinski and
Stefan Schmid},
title = {New Approximation Algorithms for the Heterogeneous Weighted Delivery
Problem},
booktitle = {Structural Information and Communication Complexity - 28th International
Colloquium, {SIROCCO} 2021, Wroc{\l}aw, Poland, June 28 - July 1,
2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12810},
pages = {167--184},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79527-6\_10},
doi = {10.1007/978-3-030-79527-6\_10},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BiloG0PR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-12293,
author = {Davide Bil{\`{o}} and
Gianlorenzo D'Angelo and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti and
Mirko Rossi},
title = {Finding single-source shortest p-disjoint paths: fast computation
and sparse preservers},
journal = {CoRR},
volume = {abs/2106.12293},
year = {2021},
url = {https://arxiv.org/abs/2106.12293},
eprinttype = {arXiv},
eprint = {2106.12293},
timestamp = {Wed, 30 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-12293.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-09588,
author = {Luciano Gual{\`{a}} and
Stefano Leucci and
Isabella Ziccardi},
title = {Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries
in Dynamic Trees},
journal = {CoRR},
volume = {abs/2109.09588},
year = {2021},
url = {https://arxiv.org/abs/2109.09588},
eprinttype = {arXiv},
eprint = {2109.09588},
timestamp = {Mon, 27 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-09588.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiloCGLP20,
author = {Davide Bil{\`{o}} and
Feliciano Colella and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {An Improved Algorithm for Computing All the Best Swap Edges of a Tree
Spanner},
journal = {Algorithmica},
volume = {82},
number = {2},
pages = {279--299},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00549-w},
doi = {10.1007/S00453-019-00549-W},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloCGLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GeissmannLLP20,
author = {Barbara Geissmann and
Stefano Leucci and
Chih{-}Hung Liu and
Paolo Penna},
title = {Optimal Dislocation with Persistent Errors in Subquadratic Time},
journal = {Theory Comput. Syst.},
volume = {64},
number = {3},
pages = {508--521},
year = {2020},
url = {https://doi.org/10.1007/s00224-019-09957-5},
doi = {10.1007/S00224-019-09957-5},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GeissmannLLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlmanzaLP20,
author = {Matteo Almanza and
Stefano Leucci and
Alessandro Panconesi},
title = {Tracks from hell - When finding a proof may be easier than checking
it},
journal = {Theor. Comput. Sci.},
volume = {839},
pages = {21--29},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.05.027},
doi = {10.1016/J.TCS.2020.05.027},
timestamp = {Fri, 04 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AlmanzaLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloGLP20,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Tracking routes in communication networks},
journal = {Theor. Comput. Sci.},
volume = {844},
pages = {1--15},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.07.012},
doi = {10.1016/J.TCS.2020.07.012},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiloGLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-00168,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti and
Giacomo Scornavacca},
title = {Cutting Bamboo Down to Size},
journal = {CoRR},
volume = {abs/2005.00168},
year = {2020},
url = {https://arxiv.org/abs/2005.00168},
eprinttype = {arXiv},
eprint = {2005.00168},
timestamp = {Fri, 08 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-00168.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-03052,
author = {Marco Bressan and
Stefano Leucci and
Alessandro Panconesi},
title = {Faster motif counting via succinct color coding and adaptive sampling},
journal = {CoRR},
volume = {abs/2009.03052},
year = {2020},
url = {https://arxiv.org/abs/2009.03052},
eprinttype = {arXiv},
eprint = {2009.03052},
timestamp = {Thu, 17 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-03052.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DEmidioFFLP19,
author = {Mattia D'Emidio and
Luca Forlizzi and
Daniele Frigioni and
Stefano Leucci and
Guido Proietti},
title = {Hardness, approximability, and fixed-parameter tractability of the
clustered shortest-path tree problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {1},
pages = {165--184},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-00374-x},
doi = {10.1007/S10878-018-00374-X},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DEmidioFFLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/BressanLP19,
author = {Marco Bressan and
Stefano Leucci and
Alessandro Panconesi},
title = {Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive
Sampling},
journal = {Proc. {VLDB} Endow.},
volume = {12},
number = {11},
pages = {1651--1663},
year = {2019},
url = {http://www.vldb.org/pvldb/vol12/p1651-bressan.pdf},
doi = {10.14778/3342263.3342640},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/BressanLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Geissmann0LP19,
author = {Barbara Geissmann and
Stefano Leucci and
Chih{-}Hung Liu and
Paolo Penna},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Optimal Sorting with Persistent Comparison Errors},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {49:1--49:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.49},
doi = {10.4230/LIPICS.ESA.2019.49},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Geissmann0LP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/0001LM19,
author = {Stefano Leucci and
Chih{-}Hung Liu and
Simon Meierhans},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Resilient Dictionaries for Randomly Unreliable Memory},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {70:1--70:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.70},
doi = {10.4230/LIPICS.ESA.2019.70},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/0001LM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Geissmann0LPP19,
author = {Barbara Geissmann and
Stefano Leucci and
Chih{-}Hung Liu and
Paolo Penna and
Guido Proietti},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {Dual-Mode Greedy Algorithms Can Save Energy},
booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},
series = {LIPIcs},
volume = {149},
pages = {64:1--64:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.64},
doi = {10.4230/LIPICS.ISAAC.2019.64},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Geissmann0LPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BiloG0P19,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Keren Censor{-}Hillel and
Michele Flammini},
title = {Tracking Routes in Communication Networks},
booktitle = {Structural Information and Communication Complexity - 26th International
Colloquium, {SIROCCO} 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11639},
pages = {81--93},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24922-9\_6},
doi = {10.1007/978-3-030-24922-9\_6},
timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BiloG0P19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-01599,
author = {Marco Bressan and
Stefano Leucci and
Alessandro Panconesi},
title = {Motivo: fast motif counting via succinct color coding and adaptive
sampling},
journal = {CoRR},
volume = {abs/1906.01599},
year = {2019},
url = {http://arxiv.org/abs/1906.01599},
eprinttype = {arXiv},
eprint = {1906.01599},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-01599.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiloGLP18,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Fault-Tolerant Approximate Shortest-Path Trees},
journal = {Algorithmica},
volume = {80},
number = {12},
pages = {3437--3460},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0396-z},
doi = {10.1007/S00453-017-0396-Z},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloGLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/geb/LeucciMP18,
author = {Stefano Leucci and
Akaki Mamageishvili and
Paolo Penna},
title = {No truthful mechanism can be better than \emph{n} approximate for
two natural problems},
journal = {Games Econ. Behav.},
volume = {111},
pages = {64--74},
year = {2018},
url = {https://doi.org/10.1016/j.geb.2018.05.003},
doi = {10.1016/J.GEB.2018.05.003},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/geb/LeucciMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlmanzaLP18,
author = {Matteo Almanza and
Stefano Leucci and
Alessandro Panconesi},
title = {Trainyard is NP-Hard},
journal = {Theor. Comput. Sci.},
volume = {748},
pages = {66--76},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.09.039},
doi = {10.1016/J.TCS.2017.09.039},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlmanzaLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkdd/BressanCKLP18,
author = {Marco Bressan and
Flavio Chierichetti and
Ravi Kumar and
Stefano Leucci and
Alessandro Panconesi},
title = {Motif Counting Beyond Five Nodes},
journal = {{ACM} Trans. Knowl. Discov. Data},
volume = {12},
number = {4},
pages = {48:1--48:25},
year = {2018},
url = {https://doi.org/10.1145/3186586},
doi = {10.1145/3186586},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tkdd/BressanCKLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/Almanza0P18,
author = {Matteo Almanza and
Stefano Leucci and
Alessandro Panconesi},
editor = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {Tracks from hell - when finding a proof may be easier than checking
it},
booktitle = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
13-15, 2018, La Maddalena, Italy},
series = {LIPIcs},
volume = {100},
pages = {4:1--4:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FUN.2018.4},
doi = {10.4230/LIPICS.FUN.2018.4},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/fun/Almanza0P18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BiloG0M18,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Neeldhara Misra},
editor = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {On the Complexity of Two Dots for Narrow Boards and Few Colors},
booktitle = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
13-15, 2018, La Maddalena, Italy},
series = {LIPIcs},
volume = {100},
pages = {7:1--7:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FUN.2018.7},
doi = {10.4230/LIPICS.FUN.2018.7},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fun/BiloG0M18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BiloG0PR18,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti and
Mirko Rossi},
editor = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games},
booktitle = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
13-15, 2018, La Maddalena, Italy},
series = {LIPIcs},
volume = {100},
pages = {8:1--8:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FUN.2018.8},
doi = {10.4230/LIPICS.FUN.2018.8},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fun/BiloG0PR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BiloCG0PP18,
author = {Davide Bil{\`{o}} and
Keerti Choudhary and
Luciano Gual{\`{a}} and
Stefano Leucci and
Merav Parter and
Guido Proietti},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Efficient Oracles and Routing Schemes for Replacement Paths},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {13:1--13:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.13},
doi = {10.4230/LIPICS.STACS.2018.13},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BiloCG0PP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Geissmann0LP18,
author = {Barbara Geissmann and
Stefano Leucci and
Chih{-}Hung Liu and
Paolo Penna},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Optimal Dislocation with Persistent Errors in Subquadratic Time},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {36:1--36:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.36},
doi = {10.4230/LIPICS.STACS.2018.36},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Geissmann0LP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-10416,
author = {Mattia D'Emidio and
Luca Forlizzi and
Daniele Frigioni and
Stefano Leucci and
Guido Proietti},
title = {Hardness, Approximability, and Fixed-Parameter Tractability of the
Clustered Shortest-Path Tree Problem},
journal = {CoRR},
volume = {abs/1801.10416},
year = {2018},
url = {http://arxiv.org/abs/1801.10416},
eprinttype = {arXiv},
eprint = {1801.10416},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-10416.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-07575,
author = {Barbara Geissmann and
Stefano Leucci and
Chih{-}Hung Liu and
Paolo Penna},
title = {Optimal Sorting with Persistent Comparison Errors},
journal = {CoRR},
volume = {abs/1804.07575},
year = {2018},
url = {http://arxiv.org/abs/1804.07575},
eprinttype = {arXiv},
eprint = {1804.07575},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-07575.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-02033,
author = {Stefano Leucci and
Chih{-}Hung Liu},
title = {A Nearly Optimal Algorithm for Approximate Minimum Selection with
Unreliable Comparisons},
journal = {CoRR},
volume = {abs/1805.02033},
year = {2018},
url = {http://arxiv.org/abs/1805.02033},
eprinttype = {arXiv},
eprint = {1805.02033},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-02033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BiloCG0P17,
author = {Davide Bil{\`{o}} and
Feliciano Colella and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Yoshio Okamoto and
Takeshi Tokuyama},
title = {An Improved Algorithm for Computing All the Best Swap Edges of a Tree
Spanner},
booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},
series = {LIPIcs},
volume = {92},
pages = {14:1--14:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.14},
doi = {10.4230/LIPICS.ISAAC.2017.14},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BiloCG0P17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Geissmann0LP17,
author = {Barbara Geissmann and
Stefano Leucci and
Chih{-}Hung Liu and
Paolo Penna},
editor = {Yoshio Okamoto and
Takeshi Tokuyama},
title = {Sorting with Recurrent Comparison Errors},
booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},
series = {LIPIcs},
volume = {92},
pages = {38:1--38:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.38},
doi = {10.4230/LIPICS.ISAAC.2017.38},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Geissmann0LP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BiloCG0P17,
author = {Davide Bil{\`{o}} and
Feliciano Colella and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Shantanu Das and
S{\'{e}}bastien Tixeuil},
title = {Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or
Good) Swap Edges},
booktitle = {Structural Information and Communication Complexity - 24th International
Colloquium, {SIROCCO} 2017, Porquerolles, France, June 19-22, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10641},
pages = {303--317},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-72050-0\_18},
doi = {10.1007/978-3-319-72050-0\_18},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BiloCG0P17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wsdm/0002C00P17,
author = {Marco Bressan and
Flavio Chierichetti and
Ravi Kumar and
Stefano Leucci and
Alessandro Panconesi},
editor = {Maarten de Rijke and
Milad Shokouhi and
Andrew Tomkins and
Min Zhang},
title = {Counting Graphlets: Space vs Time},
booktitle = {Proceedings of the Tenth {ACM} International Conference on Web Search
and Data Mining, {WSDM} 2017, Cambridge, United Kingdom, February
6-10, 2017},
pages = {557--566},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3018661.3018732},
doi = {10.1145/3018661.3018732},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wsdm/0002C00P17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiloCG0P17,
author = {Davide Bil{\`{o}} and
Feliciano Colella and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or
Good) Swap Edges},
journal = {CoRR},
volume = {abs/1707.08861},
year = {2017},
url = {http://arxiv.org/abs/1707.08861},
eprinttype = {arXiv},
eprint = {1707.08861},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiloCG0P17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-07249,
author = {Barbara Geissmann and
Stefano Leucci and
Chih{-}Hung Liu and
Paolo Penna},
title = {Sorting with Recurrent Comparison Errors},
journal = {CoRR},
volume = {abs/1709.07249},
year = {2017},
url = {http://arxiv.org/abs/1709.07249},
eprinttype = {arXiv},
eprint = {1709.07249},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-07249.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-01516,
author = {Davide Bil{\`{o}} and
Feliciano Colella and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {An Improved Algorithm for Computing All the Best Swap Edges of a Tree
Spanner},
journal = {CoRR},
volume = {abs/1710.01516},
year = {2017},
url = {http://arxiv.org/abs/1710.01516},
eprinttype = {arXiv},
eprint = {1710.01516},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-01516.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-06709,
author = {Stefano Leucci and
Akaki Mamageishvili and
Paolo Penna},
title = {No truthful mechanism can be better than n approximate for two natural
problems},
journal = {CoRR},
volume = {abs/1712.06709},
year = {2017},
url = {http://arxiv.org/abs/1712.06709},
eprinttype = {arXiv},
eprint = {1712.06709},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-06709.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/it/Leucci16,
author = {Stefano Leucci},
title = {On the size-stretch tradeoff in fault-tolerant spanners and autonomous
networks},
school = {University of L'Aquila, Italy},
year = {2016},
url = {https://opac.bncf.firenze.sbn.it/bncf-prod/resource?uri=BVE0732975},
timestamp = {Sat, 06 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/it/Leucci16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloGLP16,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Exact and approximate algorithms for movement problems on (special
classes of) graphs},
journal = {Theor. Comput. Sci.},
volume = {652},
pages = {86--101},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.09.007},
doi = {10.1016/J.TCS.2016.09.007},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiloGLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/topc/BiloGLP16,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Locality-Based Network Creation Games},
journal = {{ACM} Trans. Parallel Comput.},
volume = {3},
number = {1},
pages = {6:1--6:26},
year = {2016},
url = {https://doi.org/10.1145/2938426},
doi = {10.1145/2938426},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/topc/BiloGLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BiloG0P16,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Compact and Fast Sensitivity Oracles for Single-Source Distances},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {13:1--13:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.13},
doi = {10.4230/LIPICS.ESA.2016.13},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BiloG0P16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/AlmanzaLP16,
author = {Matteo Almanza and
Stefano Leucci and
Alessandro Panconesi},
editor = {Erik D. Demaine and
Fabrizio Grandoni},
title = {Trainyard is NP-hard},
booktitle = {8th International Conference on Fun with Algorithms, {FUN} 2016, June
8-10, 2016, La Maddalena, Italy},
series = {LIPIcs},
volume = {49},
pages = {2:1--2:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FUN.2016.2},
doi = {10.4230/LIPICS.FUN.2016.2},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fun/AlmanzaLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/Guala0NT16,
author = {Luciano Gual{\`{a}} and
Stefano Leucci and
Emanuele Natale and
Roberto Tauraso},
editor = {Erik D. Demaine and
Fabrizio Grandoni},
title = {Large Peg-Army Maneuvers},
booktitle = {8th International Conference on Fun with Algorithms, {FUN} 2016, June
8-10, 2016, La Maddalena, Italy},
series = {LIPIcs},
volume = {49},
pages = {18:1--18:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FUN.2016.18},
doi = {10.4230/LIPICS.FUN.2016.18},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fun/Guala0NT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/DEmidioFF0P16,
author = {Mattia D'Emidio and
Luca Forlizzi and
Daniele Frigioni and
Stefano Leucci and
Guido Proietti},
editor = {Vittorio Bil{\`{o}} and
Antonio Caruso},
title = {On the Clustered Shortest-Path Tree Problem},
booktitle = {Proceedings of the 17th Italian Conference on Theoretical Computer
Science, Lecce, Italy, September 7-9, 2016},
series = {{CEUR} Workshop Proceedings},
volume = {1720},
pages = {263--268},
publisher = {CEUR-WS.org},
year = {2016},
url = {https://ceur-ws.org/Vol-1720/short8.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:17 +0100},
biburl = {https://dblp.org/rec/conf/ictcs/DEmidioFF0P16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/Bressan0PRT16,
author = {Marco Bressan and
Stefano Leucci and
Alessandro Panconesi and
Prabhakar Raghavan and
Erisa Terolli},
editor = {Balaji Krishnapuram and
Mohak Shah and
Alexander J. Smola and
Charu C. Aggarwal and
Dou Shen and
Rajeev Rastogi},
title = {The Limits of Popularity-Based Recommendations, and the Role of Social
Ties},
booktitle = {Proceedings of the 22nd {ACM} {SIGKDD} International Conference on
Knowledge Discovery and Data Mining, San Francisco, CA, USA, August
13-17, 2016},
pages = {745--754},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2939672.2939797},
doi = {10.1145/2939672.2939797},
timestamp = {Tue, 06 Nov 2018 16:59:37 +0100},
biburl = {https://dblp.org/rec/conf/kdd/Bressan0PRT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BiloG0P16,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {18:1--18:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.18},
doi = {10.4230/LIPICS.STACS.2016.18},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BiloG0P16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiloG0P16,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees},
journal = {CoRR},
volume = {abs/1601.04169},
year = {2016},
url = {http://arxiv.org/abs/1601.04169},
eprinttype = {arXiv},
eprint = {1601.04169},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiloG0P16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Guala0NT16,
author = {Luciano Gual{\`{a}} and
Stefano Leucci and
Emanuele Natale and
Roberto Tauraso},
title = {Large Peg-Army Maneuvers},
journal = {CoRR},
volume = {abs/1603.00898},
year = {2016},
url = {http://arxiv.org/abs/1603.00898},
eprinttype = {arXiv},
eprint = {1603.00898},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Guala0NT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlmanzaLP16,
author = {Matteo Almanza and
Stefano Leucci and
Alessandro Panconesi},
title = {Trainyard is NP-Hard},
journal = {CoRR},
volume = {abs/1603.00928},
year = {2016},
url = {http://arxiv.org/abs/1603.00928},
eprinttype = {arXiv},
eprint = {1603.00928},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlmanzaLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bressan0PRT16,
author = {Marco Bressan and
Stefano Leucci and
Alessandro Panconesi and
Prabhakar Raghavan and
Erisa Terolli},
title = {The Limits of Popularity-Based Recommendations, and the Role of Social
Ties},
journal = {CoRR},
volume = {abs/1607.04263},
year = {2016},
url = {http://arxiv.org/abs/1607.04263},
eprinttype = {arXiv},
eprint = {1607.04263},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bressan0PRT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiloG0P16a,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Locality-based Network Creation Games},
journal = {CoRR},
volume = {abs/1607.06765},
year = {2016},
url = {http://arxiv.org/abs/1607.06765},
eprinttype = {arXiv},
eprint = {1607.06765},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiloG0P16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiloG0P16b,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Compact and Fast Sensitivity Oracles for Single-Source Distances},
journal = {CoRR},
volume = {abs/1608.04769},
year = {2016},
url = {http://arxiv.org/abs/1608.04769},
eprinttype = {arXiv},
eprint = {1608.04769},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiloG0P16b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DAndreaDF0P15,
author = {Annalisa D'Andrea and
Mattia D'Emidio and
Daniele Frigioni and
Stefano Leucci and
Guido Proietti},
title = {Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches
of Updates: New Algorithms and Experiments},
journal = {{ACM} J. Exp. Algorithmics},
volume = {20},
pages = {1.5:1.1--1.5:1.33},
year = {2015},
url = {https://doi.org/10.1145/2786022},
doi = {10.1145/2786022},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DAndreaDF0P15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloGLP15,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Specializations and generalizations of the Stackelberg minimum spanning
tree game},
journal = {Theor. Comput. Sci.},
volume = {562},
pages = {643--657},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.11.009},
doi = {10.1016/J.TCS.2014.11.009},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiloGLP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloG0P15,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {The max-distance network creation game on general host graphs},
journal = {Theor. Comput. Sci.},
volume = {573},
pages = {43--53},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.01.044},
doi = {10.1016/J.TCS.2015.01.044},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiloG0P15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BiloGG0P15,
author = {Davide Bil{\`{o}} and
Fabrizio Grandoni and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Improved Purely Additive Fault-Tolerant Spanners},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {167--178},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_15},
doi = {10.1007/978-3-662-48350-3\_15},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BiloGG0P15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/DAndreaDF0P15,
author = {Annalisa D'Andrea and
Mattia D'Emidio and
Daniele Frigioni and
Stefano Leucci and
Guido Proietti},
editor = {Christian Scheideler},
title = {Path-Fault-Tolerant Approximate Shortest-Path Trees},
booktitle = {Structural Information and Communication Complexity - 22nd International
Colloquium, {SIROCCO} 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9439},
pages = {224--238},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-25258-2\_16},
doi = {10.1007/978-3-319-25258-2\_16},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/DAndreaDF0P15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BiloCG0P15,
author = {Davide Bil{\`{o}} and
Feliciano Colella and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Christian Scheideler},
title = {A Faster Computation of All the Best Swap Edges of a Tree Spanner},
booktitle = {Structural Information and Communication Complexity - 22nd International
Colloquium, {SIROCCO} 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9439},
pages = {239--253},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-25258-2\_17},
doi = {10.1007/978-3-319-25258-2\_17},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BiloCG0P15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiloGG0P15,
author = {Davide Bil{\`{o}} and
Fabrizio Grandoni and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Improved Purely Additive Fault-Tolerant Spanners},
journal = {CoRR},
volume = {abs/1507.00505},
year = {2015},
url = {http://arxiv.org/abs/1507.00505},
eprinttype = {arXiv},
eprint = {1507.00505},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiloGG0P15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DAndreaDF0P15,
author = {Annalisa D'Andrea and
Mattia D'Emidio and
Daniele Frigioni and
Stefano Leucci and
Guido Proietti},
title = {Path-Fault-Tolerant Approximate Shortest-Path Trees},
journal = {CoRR},
volume = {abs/1507.01695},
year = {2015},
url = {http://arxiv.org/abs/1507.01695},
eprinttype = {arXiv},
eprint = {1507.01695},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DAndreaDF0P15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cig/GualaLN14,
author = {Luciano Gual{\`{a}} and
Stefano Leucci and
Emanuele Natale},
title = {Bejeweled, Candy Crush and other match-three games are (NP-)hard},
booktitle = {2014 {IEEE} Conference on Computational Intelligence and Games, {CIG}
2014, Dortmund, Germany, August 26-29, 2014},
pages = {1--8},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/CIG.2014.6932866},
doi = {10.1109/CIG.2014.6932866},
timestamp = {Wed, 16 Oct 2019 14:14:56 +0200},
biburl = {https://dblp.org/rec/conf/cig/GualaLN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BiloGLP14,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {Fault-Tolerant Approximate Shortest-Path Trees},
booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
pages = {137--148},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2\_12},
doi = {10.1007/978-3-662-44777-2\_12},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BiloGLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BiloGLP14,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Network Creation Games with Traceroute-Based Strategies},
booktitle = {Structural Information and Communication Complexity - 21st International
Colloquium, {SIROCCO} 2014, Takayama, Japan, July 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8576},
pages = {210--223},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09620-9\_17},
doi = {10.1007/978-3-319-09620-9\_17},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BiloGLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BiloGLP14,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Guy E. Blelloch and
Peter Sanders},
title = {Locality-based network creation games},
booktitle = {26th {ACM} Symposium on Parallelism in Algorithms and Architectures,
{SPAA} '14, Prague, Czech Republic - June 23 - 25, 2014},
pages = {277--286},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2612669.2612680},
doi = {10.1145/2612669.2612680},
timestamp = {Wed, 21 Nov 2018 11:18:43 +0100},
biburl = {https://dblp.org/rec/conf/spaa/BiloGLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/DAndreaDFLP14,
author = {Annalisa D'Andrea and
Mattia D'Emidio and
Daniele Frigioni and
Stefano Leucci and
Guido Proietti},
editor = {Joachim Gudmundsson and
Jyrki Katajainen},
title = {Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on
Homogeneous Batches},
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 = {283--294},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07959-2\_24},
doi = {10.1007/978-3-319-07959-2\_24},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/DAndreaDFLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GualaLN14,
author = {Luciano Gual{\`{a}} and
Stefano Leucci and
Emanuele Natale},
title = {Bejeweled, Candy Crush and other Match-Three Games are (NP-)Hard},
journal = {CoRR},
volume = {abs/1403.5830},
year = {2014},
url = {http://arxiv.org/abs/1403.5830},
eprinttype = {arXiv},
eprint = {1403.5830},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GualaLN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiloGLP14,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Exact and approximate algorithms for movement problems on (special
classes of) graphs},
journal = {CoRR},
volume = {abs/1407.0628},
year = {2014},
url = {http://arxiv.org/abs/1407.0628},
eprinttype = {arXiv},
eprint = {1407.0628},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiloGLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiloGLP14a,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Fault-Tolerant Approximate Shortest-Path Trees},
journal = {CoRR},
volume = {abs/1407.0637},
year = {2014},
url = {http://arxiv.org/abs/1407.0637},
eprinttype = {arXiv},
eprint = {1407.0637},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiloGLP14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiloGLP14b,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {The Max-Distance Network Creation Game on General Host Graphs},
journal = {CoRR},
volume = {abs/1407.0643},
year = {2014},
url = {http://arxiv.org/abs/1407.0643},
eprinttype = {arXiv},
eprint = {1407.0643},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiloGLP14b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiloGLP14c,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
title = {Specializations and Generalizations of the Stackelberg Minimum Spanning
Tree Game},
journal = {CoRR},
volume = {abs/1407.1167},
year = {2014},
url = {http://arxiv.org/abs/1407.1167},
eprinttype = {arXiv},
eprint = {1407.1167},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BiloGLP14c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/DAndreaDFLP13,
author = {Annalisa D'Andrea and
Mattia D'Emidio and
Daniele Frigioni and
Stefano Leucci and
Guido Proietti},
editor = {Thomas Moscibroda and
Adele A. Rescigno},
title = {Dynamically Maintaining Shortest Path Trees under Batches of Updates},
booktitle = {Structural Information and Communication Complexity - 20th International
Colloquium, {SIROCCO} 2013, Ischia, Italy, July 1-3, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8179},
pages = {286--297},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03578-9\_24},
doi = {10.1007/978-3-319-03578-9\_24},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/DAndreaDFLP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BiloGLP13,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Thomas Moscibroda and
Adele A. Rescigno},
title = {Exact and Approximate Algorithms for Movement Problems on (Special
Classes of) Graphs},
booktitle = {Structural Information and Communication Complexity - 20th International
Colloquium, {SIROCCO} 2013, Ischia, Italy, July 1-3, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8179},
pages = {322--333},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03578-9\_27},
doi = {10.1007/978-3-319-03578-9\_27},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BiloGLP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BiloGLP12,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Paul W. Goldberg},
title = {The Max-Distance Network Creation Game on General Host Graphs},
booktitle = {Internet and Network Economics - 8th International Workshop, {WINE}
2012, Liverpool, UK, December 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7695},
pages = {392--405},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35311-6\_29},
doi = {10.1007/978-3-642-35311-6\_29},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/BiloGLP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BiloGLP10,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti},
editor = {Amin Saberi},
title = {Specializations and Generalizations of the Stackelberg Minimum Spanning
Tree Game},
booktitle = {Internet and Network Economics - 6th International Workshop, {WINE}
2010, Stanford, CA, USA, December 13-17, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6484},
pages = {75--86},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17572-5\_7},
doi = {10.1007/978-3-642-17572-5\_7},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/BiloGLP10.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:48 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:
