Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Luciano Gualà
@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/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/BiloGP21,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
title = {Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game},
journal = {Algorithms},
volume = {14},
number = {1},
pages = {8},
year = {2021},
url = {https://doi.org/10.3390/a14010008},
doi = {10.3390/A14010008},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/BiloGP21.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}
}
@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/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}
}
@inproceedings{DBLP:conf/innovations/ClementiGNPST20,
author = {Andrea Clementi and
Luciano Gual{\`{a}} and
Emanuele Natale and
Francesco Pasquale and
Giacomo Scornavacca and
Luca Trevisan},
editor = {Thomas Vidick},
title = {Consensus vs Broadcast, with and Without Noise (Extended Abstract)},
booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
2020, January 12-14, 2020, Seattle, Washington, {USA}},
series = {LIPIcs},
volume = {151},
pages = {42:1--42:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.42},
doi = {10.4230/LIPICS.ITCS.2020.42},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ClementiGNPST20.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}
}
@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}
}
@inproceedings{DBLP:conf/sofsem/CarosiFGM19,
author = {Raffaello Carosi and
Simone Fioravanti and
Luciano Gual{\`{a}} and
Gianpiero Monaco},
editor = {Barbara Catania and
Rastislav Kr{\'{a}}lovic and
Jerzy R. Nawrocki and
Giovanni Pighizzini},
title = {Coalition Resilient Outcomes in Max k-Cut Games},
booktitle = {{SOFSEM} 2019: Theory and Practice of Computer Science - 45th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 27-30, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11376},
pages = {94--107},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-10801-4\_9},
doi = {10.1007/978-3-030-10801-4\_9},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/CarosiFGM19.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}
}
@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 = {Tue, 27 Dec 2022 09:06:31 +0100},
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/mfcs/ClementiGGNPS18,
author = {Andrea Clementi and
Mohsen Ghaffari and
Luciano Gual{\`{a}} and
Emanuele Natale and
Francesco Pasquale and
Giacomo Scornavacca},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {A Tight Analysis of the Parallel Undecided-State Dynamics with Two
Colors},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {28:1--28:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.28},
doi = {10.4230/LIPICS.MFCS.2018.28},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ClementiGGNPS18.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}
}
@article{DBLP:journals/corr/abs-1807-05626,
author = {Andrea Clementi and
Luciano Gual{\`{a}} and
Emanuele Natale and
Francesco Pasquale and
Giacomo Scornavacca and
Luca Trevisan},
title = {Consensus Needs Broadcast in Noiseless Models but can be Exponentially
Easier in the Presence of Noise},
journal = {CoRR},
volume = {abs/1807.05626},
year = {2018},
url = {http://arxiv.org/abs/1807.05626},
eprinttype = {arXiv},
eprint = {1807.05626},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-05626.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-09278,
author = {Raffaello Carosi and
Simone Fioravanti and
Luciano Gual{\`{a}} and
Gianpiero Monaco},
title = {Coalition Resilient Outcomes in Max k-Cut Games},
journal = {CoRR},
volume = {abs/1810.09278},
year = {2018},
url = {http://arxiv.org/abs/1810.09278},
eprinttype = {arXiv},
eprint = {1810.09278},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-09278.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/ClementiGPS17,
author = {Andrea Clementi and
Luciano Gual{\`{a}} and
Guido Proietti and
Giacomo Scornavacca},
title = {Rational Fair Consensus in the Gossip Model},
booktitle = {2017 {IEEE} International Parallel and Distributed Processing Symposium,
{IPDPS} 2017, Orlando, FL, USA, May 29 - June 2, 2017},
pages = {163--171},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/IPDPS.2017.67},
doi = {10.1109/IPDPS.2017.67},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipps/ClementiGPS17.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/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/wdag/ClementiGPS17,
author = {Andrea Clementi and
Luciano Gual{\`{a}} and
Francesco Pasquale and
Giacomo Scornavacca},
editor = {Andr{\'{e}}a W. Richa},
title = {Brief Announcement: On the Parallel Undecided-State Dynamics with
Two Colors},
booktitle = {31st International Symposium on Distributed Computing, {DISC} 2017,
October 16-20, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {91},
pages = {47:1--47:4},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.DISC.2017.47},
doi = {10.4230/LIPICS.DISC.2017.47},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/ClementiGPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ClementiGPS17,
author = {Andrea Clementi and
Luciano Gual{\`{a}} and
Guido Proietti and
Giacomo Scornavacca},
title = {Rational Fair Consensus in the {GOSSIP} Model},
journal = {CoRR},
volume = {abs/1705.09566},
year = {2017},
url = {http://arxiv.org/abs/1705.09566},
eprinttype = {arXiv},
eprint = {1705.09566},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ClementiGPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ClementiGPS17aa,
author = {Andrea Clementi and
Luciano Gual{\`{a}} and
Francesco Pasquale and
Giacomo Scornavacca},
title = {On the Parallel Undecided-State Dynamics with Two Colors},
journal = {CoRR},
volume = {abs/1707.05135},
year = {2017},
url = {http://arxiv.org/abs/1707.05135},
eprinttype = {arXiv},
eprint = {1707.05135},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ClementiGPS17aa.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-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/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/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/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/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/algorithmica/BiloGP15,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
title = {A Faster Computation of All the Best Swap Edges of a Shortest Paths
Tree},
journal = {Algorithmica},
volume = {73},
number = {3},
pages = {547--570},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9912-6},
doi = {10.1007/S00453-014-9912-6},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloGP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IanniGR15,
author = {Miriam Di Ianni and
Luciano Gual{\`{a}} and
Gianluca Rossi},
title = {Reducing the diameter of a unit disk graph via node addition},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {845--850},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.06.015},
doi = {10.1016/J.IPL.2015.06.015},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IanniGR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BampasBDGKP15,
author = {Evangelos Bampas and
Davide Bil{\`{o}} and
Guido Drovandi and
Luciano Gual{\`{a}} and
Ralf Klasing and
Guido Proietti},
title = {Network verification via routing table queries},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {1},
pages = {234--248},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2014.06.003},
doi = {10.1016/J.JCSS.2014.06.003},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BampasBDGKP15.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}
}
@article{DBLP:journals/teco/BiloGP15,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
title = {Bounded-Distance Network Creation Games},
journal = {{ACM} Trans. Economics and Comput.},
volume = {3},
number = {3},
pages = {16:1--16:20},
year = {2015},
url = {https://doi.org/10.1145/2770639},
doi = {10.1145/2770639},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/BiloGP15.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/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/algorithmica/BiloGP14,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
title = {Finding Best Swap Edges Minimizing the Routing Cost of a Spanning
Tree},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {337--357},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9674-y},
doi = {10.1007/S00453-012-9674-Y},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloGP14.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}
}
@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/algosensors/BiloDGMPW13,
author = {Davide Bil{\`{o}} and
Yann Disser and
Luciano Gual{\`{a}} and
Mat{\'{u}}s Mihal{\'{a}}k and
Guido Proietti and
Peter Widmayer},
editor = {Paola Flocchini and
Jie Gao and
Evangelos Kranakis and
Friedhelm Meyer auf der Heide},
title = {Polygon-Constrained Motion Planning Problems},
booktitle = {Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September
5-6, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8243},
pages = {67--82},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45346-5\_6},
doi = {10.1007/978-3-642-45346-5\_6},
timestamp = {Sun, 12 Mar 2023 00:57:49 +0100},
biburl = {https://dblp.org/rec/conf/algosensors/BiloDGMPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BiloGP13,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {A Faster Computation of All the Best Swap Edges of a Shortest Paths
Tree},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {157--168},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_14},
doi = {10.1007/978-3-642-40450-4\_14},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BiloGP13.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}
}
@article{DBLP:journals/networks/BriestGHV12,
author = {Patrick Briest and
Luciano Gual{\`{a}} and
Martin Hoefer and
Carmine Ventre},
title = {On stackelberg pricing with computationally bounded customers},
journal = {Networks},
volume = {60},
number = {1},
pages = {31--44},
year = {2012},
url = {https://doi.org/10.1002/net.20457},
doi = {10.1002/NET.20457},
timestamp = {Fri, 26 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BriestGHV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloGP12,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
title = {Improved approximability and non-approximability results for graph
diameter decreasing problems},
journal = {Theor. Comput. Sci.},
volume = {417},
pages = {12--22},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.05.014},
doi = {10.1016/J.TCS.2011.05.014},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiloGP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BiloGP12,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
editor = {Paul W. Goldberg},
title = {Bounded-Distance Network Creation Games},
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 = {72--85},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35311-6\_6},
doi = {10.1007/978-3-642-35311-6\_6},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/BiloGP12.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/sirocco/BampasBDGKP11,
author = {Evangelos Bampas and
Davide Bil{\`{o}} and
Guido Drovandi and
Luciano Gual{\`{a}} and
Ralf Klasing and
Guido Proietti},
editor = {Adrian Kosowski and
Masafumi Yamashita},
title = {Network Verification via Routing Table Queries},
booktitle = {Structural Information and Communication Complexity - 18th International
Colloquium, {SIROCCO} 2011, Gdansk, Poland, June 26-29, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6796},
pages = {270--281},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22212-2\_24},
doi = {10.1007/978-3-642-22212-2\_24},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BampasBDGKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-4264,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
title = {Bounded-Distance Network Creation Games},
journal = {CoRR},
volume = {abs/1112.4264},
year = {2011},
url = {http://arxiv.org/abs/1112.4264},
eprinttype = {arXiv},
eprint = {1112.4264},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-4264.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BiloGP10,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Finding Best Swap Edges Minimizing the Routing Cost of a Spanning
Tree},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {138--149},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_14},
doi = {10.1007/978-3-642-15155-2\_14},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BiloGP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BiloGP10a,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Improved Approximability and Non-approximability Results for Graph
Diameter Decreasing Problems},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {150--161},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_15},
doi = {10.1007/978-3-642-15155-2\_15},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BiloGP10a.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}
}
@article{DBLP:journals/tcs/BiloGP09,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
title = {Dynamic mechanism design},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {17},
pages = {1564--1572},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.029},
doi = {10.1016/J.TCS.2008.12.029},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiloGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BiloGGPW09,
author = {Davide Bil{\`{o}} and
Michael Gatto and
Luciano Gual{\`{a}} and
Guido Proietti and
Peter Widmayer},
editor = {Shay Kutten and
Janez Zerovnik},
title = {Stability of Networks in Stretchable Graphs},
booktitle = {Structural Information and Communication Complexity, 16th International
Colloquium, {SIROCCO} 2009, Piran, Slovenia, May 25-27, 2009, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5869},
pages = {100--112},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11476-2\_9},
doi = {10.1007/978-3-642-11476-2\_9},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BiloGGPW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BriestHGV09,
author = {Patrick Briest and
Martin Hoefer and
Luciano Gual{\`{a}} and
Carmine Ventre},
editor = {Stefano Leonardi},
title = {On Stackelberg Pricing with Computationally Bounded Consumers},
booktitle = {Internet and Network Economics, 5th International Workshop, {WINE}
2009, Rome, Italy, December 14-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5929},
pages = {42--54},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10841-9\_6},
doi = {10.1007/978-3-642-10841-9\_6},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/wine/BriestHGV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BiloGP09,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
title = {Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-112}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/112},
eprinttype = {ECCC},
eprint = {TR09-112},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BiloGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/BiloFGP08,
author = {Davide Bil{\`{o}} and
Luca Forlizzi and
Luciano Gual{\`{a}} and
Guido Proietti},
title = {Approximate Mechanisms for the Graphical {TSP} and Other Graph-Traversal
Problems},
journal = {Internet Math.},
volume = {5},
number = {4},
pages = {411--437},
year = {2008},
url = {https://doi.org/10.1080/15427951.2008.10129173},
doi = {10.1080/15427951.2008.10129173},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/BiloFGP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BiloGPW08,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti and
Peter Widmayer},
editor = {Christos H. Papadimitriou and
Shuzhong Zhang},
title = {Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree
Game},
booktitle = {Internet and Network Economics, 4th International Workshop, {WINE}
2008, Shanghai, China, December 17-20, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5385},
pages = {251--262},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92185-1\_32},
doi = {10.1007/978-3-540-92185-1\_32},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/BiloGPW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GualaP07,
author = {Luciano Gual{\`{a}} and
Guido Proietti},
title = {Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree
Problem},
journal = {Algorithmica},
volume = {49},
number = {3},
pages = {171--191},
year = {2007},
url = {https://doi.org/10.1007/s00453-007-9016-7},
doi = {10.1007/S00453-007-9016-7},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GualaP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/concurrency/GualaP07,
author = {Luciano Gual{\`{a}} and
Guido Proietti},
title = {Efficient truthful mechanisms for the single-source shortest paths
tree problem},
journal = {Concurr. Comput. Pract. Exp.},
volume = {19},
number = {17},
pages = {2285--2297},
year = {2007},
url = {https://doi.org/10.1002/cpe.1167},
doi = {10.1002/CPE.1167},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/concurrency/GualaP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BiloDGPW07,
author = {Davide Bil{\`{o}} and
J{\"{o}}rg Derungs and
Luciano Gual{\`{a}} and
Guido Proietti and
Peter Widmayer},
editor = {Takeshi Tokuyama},
title = {Locating Facilities on a Network to Minimize Their Average Service
Radius},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {587--598},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_51},
doi = {10.1007/978-3-540-77120-3\_51},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BiloDGPW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BiloFGP07,
author = {Davide Bil{\`{o}} and
Luca Forlizzi and
Luciano Gual{\`{a}} and
Guido Proietti},
editor = {Indranil Gupta and
Roger Wattenhofer},
title = {An algorithm composition scheme preserving monotonicity},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2007, Portland, Oregon, USA, August
12-15, 2007},
pages = {360--361},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1281100.1281173},
doi = {10.1145/1281100.1281173},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/BiloFGP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BiloFGP07,
author = {Davide Bil{\`{o}} and
Luca Forlizzi and
Luciano Gual{\`{a}} and
Guido Proietti},
editor = {Xiaotie Deng and
Fan Chung Graham},
title = {Approximate Mechanisms for the Graphical {TSP} and Other Graph Traversal
Problems},
booktitle = {Internet and Network Economics, Third International Workshop, {WINE}
2007, San Diego, CA, USA, December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4858},
pages = {503--514},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77105-0\_54},
doi = {10.1007/978-3-540-77105-0\_54},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/BiloFGP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caan/BiloGP06,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
editor = {Thomas Erlebach},
title = {Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria
Problem},
booktitle = {Combinatorial and Algorithmic Aspects of Networking, Third Workshop,
{CAAN} 2006, Chester, UK, July 2, 2006. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4235},
pages = {19--30},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11922377\_3},
doi = {10.1007/11922377\_3},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/caan/BiloGP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BiloGP06,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
editor = {Paola Flocchini and
Leszek Gasieniec},
title = {On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate
Shortest-Paths Tree Problem},
booktitle = {Structural Information and Communication Complexity, 13th International
Colloquium, {SIROCCO} 2006, Chester, UK, July 2-5, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4056},
pages = {295--309},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11780823\_23},
doi = {10.1007/11780823\_23},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BiloGP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BiloGP06,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Guido Proietti},
editor = {Paul G. Spirakis and
Marios Mavronicolas and
Spyros C. Kontogiannis},
title = {Dynamic Mechanism Design},
booktitle = {Internet and Network Economics, Second International Workshop, {WINE}
2006, Patras, Greece, December 15-17, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4286},
pages = {3--15},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944874\_2},
doi = {10.1007/11944874\_2},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/BiloGP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GualaP05,
author = {Luciano Gual{\`{a}} and
Guido Proietti},
editor = {Lusheng Wang},
title = {A Truthful (2-2/\emph{k})-Approximation Mechanism for the Steiner
Tree Problem with \emph{k} Terminals},
booktitle = {Computing and Combinatorics, 11th Annual International Conference,
{COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3595},
pages = {390--400},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11533719\_40},
doi = {10.1007/11533719\_40},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/GualaP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/GualaP05,
author = {Luciano Gual{\`{a}} and
Guido Proietti},
editor = {Jos{\'{e}} C. Cunha and
Pedro D. Medeiros},
title = {Efficient Truthful Mechanisms for the Single-Source Shortest Paths
Tree Problem},
booktitle = {Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference,
Lisbon, Portugal, August 30 - September 2, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3648},
pages = {941--951},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549468\_103},
doi = {10.1007/11549468\_103},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/europar/GualaP05.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-07 22:30 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:
