default search action
BibTeX records: Pierluigi Crescenzi
@article{DBLP:journals/jossw/CrescenziNRS24, author = {Pierluigi Crescenzi and Emanuele Natale and Aurora Rossi and Paulo Bruno S. Serafim}, title = {WorldDynamics.jl: {A} Julia Package for Developing and Simulating Integrated Assessment Models}, journal = {J. Open Source Softw.}, volume = {9}, number = {96}, pages = {5772}, year = {2024}, url = {https://doi.org/10.21105/joss.05772}, doi = {10.21105/JOSS.05772}, timestamp = {Sat, 04 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jossw/CrescenziNRS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/hhai/SerafimCGCRG24, author = {Paulo Bruno S. Serafim and Pierluigi Crescenzi and Gizem Gezici and Eleonora Cappuccio and Salvatore Rinzivillo and Fosca Giannotti}, editor = {Fabian Lorig and Jason Tucker and Adam Dahlgren Lindstr{\"{o}}m and Frank Dignum and Pradeep K. Murukannaiah and Andreas Theodorou and Pinar Yolum}, title = {Exploring Large Language Models Capabilities to Explain Decision Trees}, booktitle = {{HHAI} 2024: Hybrid Human {AI} Systems for the Social Good - Proceedings of the Third International Conference on Hybrid Human-Artificial Intelligence, Malm{\"{o}}, Sweden, 10-14 June 2024}, series = {Frontiers in Artificial Intelligence and Applications}, volume = {386}, pages = {64--72}, publisher = {{IOS} Press}, year = {2024}, url = {https://doi.org/10.3233/FAIA240183}, doi = {10.3233/FAIA240183}, timestamp = {Wed, 24 Jul 2024 14:17:59 +0200}, biburl = {https://dblp.org/rec/conf/hhai/SerafimCGCRG24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwoca/ChristodoulouCMST24, author = {Filippos Christodoulou and Pierluigi Crescenzi and Andrea Marino and Ana Silva and Dimitrios M. Thilikos}, editor = {Adele Anna Rescigno and Ugo Vaccaro}, title = {Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional}, booktitle = {Combinatorial Algorithms - 35th International Workshop, {IWOCA} 2024, Ischia, Italy, July 1-3, 2024, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {14764}, pages = {247--258}, publisher = {Springer}, year = {2024}, url = {https://doi.org/10.1007/978-3-031-63021-7\_19}, doi = {10.1007/978-3-031-63021-7\_19}, timestamp = {Fri, 12 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/ChristodoulouCMST24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/kdd/BrunelliCV24, author = {Filippo Brunelli and Pierluigi Crescenzi and Laurent Viennot}, editor = {Ricardo Baeza{-}Yates and Francesco Bonchi}, title = {Making Temporal Betweenness Computation Faster and Restless}, booktitle = {Proceedings of the 30th {ACM} {SIGKDD} Conference on Knowledge Discovery and Data Mining, {KDD} 2024, Barcelona, Spain, August 25-29, 2024}, pages = {163--174}, publisher = {{ACM}}, year = {2024}, url = {https://doi.org/10.1145/3637528.3671825}, doi = {10.1145/3637528.3671825}, timestamp = {Sun, 08 Sep 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/kdd/BrunelliCV24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BrunelliCV23, author = {Filippo Brunelli and Pierluigi Crescenzi and Laurent Viennot}, title = {Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks}, journal = {Networks}, volume = {81}, number = {2}, pages = {177--203}, year = {2023}, url = {https://doi.org/10.1002/net.22123}, doi = {10.1002/NET.22123}, timestamp = {Sat, 25 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/BrunelliCV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/BeckerCCKRRZ23, author = {Ruben Becker and Arnaud Casteigts and Pierluigi Crescenzi and Bojana Kodric and Malte Renken and Michael Raskin and Viktor Zamaraev}, editor = {Nicole Megow and Adam D. Smith}, title = {Giant Components in Random Temporal Graphs}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta, Georgia, {USA}}, series = {LIPIcs}, volume = {275}, pages = {29:1--29:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.29}, doi = {10.4230/LIPICS.APPROX/RANDOM.2023.29}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/BeckerCCKRRZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/Crescenzi23, author = {Pierluigi Crescenzi}, editor = {Sergio Rajsbaum and Alkida Balliu and Joshua J. Daymude and Dennis Olivetti}, title = {Thirty Years of {SIROCCO} {A} Data and Graph Mining Comparative Analysis of Its Temporal Evolution}, booktitle = {Structural Information and Communication Complexity - 30th International Colloquium, {SIROCCO} 2023, Alcal{\'{a}} de Henares, Spain, June 6-9, 2023, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13892}, pages = {18--32}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-32733-9\_2}, doi = {10.1007/978-3-031-32733-9\_2}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sirocco/Crescenzi23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/BeckerCCK23, author = {Ruben Becker and Pierluigi Crescenzi and Antonio Cruciani and Bojana Kodric}, editor = {Loukas Georgiadis}, title = {Proxying Betweenness Centrality Rankings in Temporal Networks}, booktitle = {21st International Symposium on Experimental Algorithms, {SEA} 2023, July 24-26, 2023, Barcelona, Spain}, series = {LIPIcs}, volume = {265}, pages = {6:1--6:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.SEA.2023.6}, doi = {10.4230/LIPICS.SEA.2023.6}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/wea/BeckerCCK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/corr/abs-2309-07304, author = {Luca Aceto and Pierluigi Crescenzi and Anna Ing{\'{o}}lfsd{\'{o}}ttir and Mohammad Reza Mousavi}, editor = {Claudio Antares Mezzina and Georgiana Caltais}, title = {The Way We Were: Structural Operational Semantics Research in Perspective}, booktitle = {Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, {EXPRESS/SOS} 2023, and 20th Workshop on Structural Operational SemanticsAntwerp, Belgium, 18th September 2023}, series = {{EPTCS}}, volume = {387}, pages = {26--40}, year = {2023}, url = {https://doi.org/10.4204/EPTCS.387.3}, doi = {10.4204/EPTCS.387.3}, timestamp = {Wed, 25 Oct 2023 16:09:20 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2309-07304.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2304-00817, author = {Alkida Balliu and Filippo Brunelli and Pierluigi Crescenzi and Dennis Olivetti and Laurent Viennot}, title = {A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs}, journal = {CoRR}, volume = {abs/2304.00817}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2304.00817}, doi = {10.48550/ARXIV.2304.00817}, eprinttype = {arXiv}, eprint = {2304.00817}, timestamp = {Mon, 17 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2304-00817.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/AcetoC22, author = {Luca Aceto and Pierluigi Crescenzi}, title = {{CONCUR} through time}, journal = {Bull. {EATCS}}, volume = {138}, year = {2022}, url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/737}, timestamp = {Wed, 31 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eatcs/AcetoC22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/CalamaiCM22, author = {Marco Calamai and Pierluigi Crescenzi and Andrea Marino}, title = {On Computing the Diameter of (Weighted) Link Streams}, journal = {{ACM} J. Exp. Algorithmics}, volume = {27}, pages = {4.3:1--4.3:28}, year = {2022}, url = {https://doi.org/10.1145/3569168}, doi = {10.1145/3569168}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/CalamaiCM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaai/0001MCNP22, author = {Francesco D'Amore and Daniel Mitropolsky and Pierluigi Crescenzi and Emanuele Natale and Christos H. Papadimitriou}, title = {Planning with Biological Neurons and Synapses}, booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI} 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22 - March 1, 2022}, pages = {21--28}, publisher = {{AAAI} Press}, year = {2022}, url = {https://doi.org/10.1609/aaai.v36i1.19875}, doi = {10.1609/AAAI.V36I1.19875}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/aaai/0001MCNP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2205-14888, author = {Ruben Becker and Arnaud Casteigts and Pierluigi Crescenzi and Bojana Kodric and Malte Renken and Michael Raskin and Viktor Zamaraev}, title = {Giant Components in Random Temporal Graphs}, journal = {CoRR}, volume = {abs/2205.14888}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2205.14888}, doi = {10.48550/ARXIV.2205.14888}, eprinttype = {arXiv}, eprint = {2205.14888}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2205-14888.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BrunelliCV21, author = {Filippo Brunelli and Pierluigi Crescenzi and Laurent Viennot}, title = {On computing Pareto optimal paths in weighted time-dependent networks}, journal = {Inf. Process. Lett.}, volume = {168}, pages = {106086}, year = {2021}, url = {https://doi.org/10.1016/j.ipl.2020.106086}, doi = {10.1016/J.IPL.2020.106086}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/BrunelliCV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/CalamaiCM21, author = {Marco Calamai and Pierluigi Crescenzi and Andrea Marino}, editor = {David Coudert and Emanuele Natale}, title = {On Computing the Diameter of (Weighted) Link Streams}, booktitle = {19th International Symposium on Experimental Algorithms, {SEA} 2021, June 7-9, 2021, Nice, France}, series = {LIPIcs}, volume = {190}, pages = {11:1--11:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.SEA.2021.11}, doi = {10.4230/LIPICS.SEA.2021.11}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/wea/CalamaiCM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2101-02086, author = {Filippo Brunelli and Pierluigi Crescenzi and Laurent Viennot}, title = {On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks}, journal = {CoRR}, volume = {abs/2101.02086}, year = {2021}, url = {https://arxiv.org/abs/2101.02086}, eprinttype = {arXiv}, eprint = {2101.02086}, timestamp = {Thu, 21 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2101-02086.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2105-02093, author = {Amos Korman and Pierluigi Crescenzi}, title = {Public Communication can Facilitate Low-Risk Coordination under Surveillance}, journal = {CoRR}, volume = {abs/2105.02093}, year = {2021}, url = {https://arxiv.org/abs/2105.02093}, eprinttype = {arXiv}, eprint = {2105.02093}, timestamp = {Wed, 12 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2105-02093.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-08328, author = {Filippo Brunelli and Pierluigi Crescenzi and Laurent Viennot}, title = {On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation}, journal = {CoRR}, volume = {abs/2111.08328}, year = {2021}, url = {https://arxiv.org/abs/2111.08328}, eprinttype = {arXiv}, eprint = {2111.08328}, timestamp = {Mon, 22 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-08328.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2112-08186, author = {Francesco D'Amore and Daniel Mitropolsky and Pierluigi Crescenzi and Emanuele Natale and Christos H. Papadimitriou}, title = {Planning with Biological Neurons and Synapses}, journal = {CoRR}, volume = {abs/2112.08186}, year = {2021}, url = {https://arxiv.org/abs/2112.08186}, eprinttype = {arXiv}, eprint = {2112.08186}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2112-08186.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithms/CrescenziMM20, author = {Pierluigi Crescenzi and Cl{\'{e}}mence Magnien and Andrea Marino}, title = {Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs}, journal = {Algorithms}, volume = {13}, number = {9}, pages = {211}, year = {2020}, url = {https://doi.org/10.3390/a13090211}, doi = {10.3390/A13090211}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithms/CrescenziMM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icetc/GorettiTCCCC20, author = {Gabriele Goretti and Benedetta Terenzi and Elisabetta Cianfanelli and Pierluigi Crescenzi and Carlo Colombo and Enrico Civitelli}, title = {A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs}, booktitle = {ICETC'20: 12th International Conference on Education Technology and Computers, London, United Kingdom, October 23-26, 2020}, pages = {223--229}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3436756.3437049}, doi = {10.1145/3436756.3437049}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icetc/GorettiTCCCC20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/infocom/CrescenziFP20, author = {Pierluigi Crescenzi and Pierre Fraigniaud and Ami Paz}, title = {Simple and Fast Distributed Computation of Betweenness Centrality}, booktitle = {39th {IEEE} Conference on Computer Communications, {INFOCOM} 2020, Toronto, ON, Canada, July 6-9, 2020}, pages = {337--346}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/INFOCOM41043.2020.9155354}, doi = {10.1109/INFOCOM41043.2020.9155354}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/infocom/CrescenziFP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/ConteCMP20, author = {Alessio Conte and Pierluigi Crescenzi and Andrea Marino and Giulia Punzi}, editor = {Javier Esparza and Daniel Kr{\'{a}}l'}, title = {Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic}, series = {LIPIcs}, volume = {170}, pages = {25:1--25:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.25}, doi = {10.4230/LIPICS.MFCS.2020.25}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/ConteCMP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2001-08108, author = {Pierluigi Crescenzi and Pierre Fraigniaud and Ami Paz}, title = {Simple and Fast Distributed Computation of Betweenness Centrality}, journal = {CoRR}, volume = {abs/2001.08108}, year = {2020}, url = {https://arxiv.org/abs/2001.08108}, eprinttype = {arXiv}, eprint = {2001.08108}, timestamp = {Fri, 24 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2001-08108.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithms/CrescenziMM19, author = {Pierluigi Crescenzi and Cl{\'{e}}mence Magnien and Andrea Marino}, title = {Approximating the Temporal Neighbourhood Function of Large Temporal Graphs}, journal = {Algorithms}, volume = {12}, number = {10}, pages = {211}, year = {2019}, url = {https://doi.org/10.3390/a12100211}, doi = {10.3390/A12100211}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithms/CrescenziMM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tkdd/BergaminiBCMM19, author = {Elisabetta Bergamini and Michele Borassi and Pierluigi Crescenzi and Andrea Marino and Henning Meyerhenke}, title = {Computing top-\emph{k} Closeness Centrality Faster in Unweighted Graphs}, journal = {{ACM} Trans. Knowl. Discov. Data}, volume = {13}, number = {5}, pages = {53:1--53:40}, year = {2019}, url = {https://doi.org/10.1145/3344719}, doi = {10.1145/3344719}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tkdd/BergaminiBCMM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/CrescenziFP19, author = {Pierluigi Crescenzi and Pierre Fraigniaud and Ami Paz}, editor = {Jukka Suomela}, title = {Trade-Offs in Distributed Interactive Proofs}, booktitle = {33rd International Symposium on Distributed Computing, {DISC} 2019, October 14-18, 2019, Budapest, Hungary}, series = {LIPIcs}, volume = {146}, pages = {13:1--13:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.DISC.2019.13}, doi = {10.4230/LIPICS.DISC.2019.13}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/CrescenziFP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/bdt/CrescenziM19, author = {Pierluigi Crescenzi and Andrea Marino}, editor = {Sherif Sakr and Albert Y. Zomaya}, title = {Degrees of Separation and Diameter in Large Graphs}, booktitle = {Encyclopedia of Big Data Technologies}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-319-63962-8\_59-1}, doi = {10.1007/978-3-319-63962-8\_59-1}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/bdt/CrescenziM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1908-03363, author = {Pierluigi Crescenzi and Pierre Fraigniaud and Ami Paz}, title = {Trade-offs in Distributed Interactive Proofs}, journal = {CoRR}, volume = {abs/1908.03363}, year = {2019}, url = {http://arxiv.org/abs/1908.03363}, eprinttype = {arXiv}, eprint = {1908.03363}, timestamp = {Mon, 19 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1908-03363.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/BergaminiCDMSV18, author = {Elisabetta Bergamini and Pierluigi Crescenzi and Gianlorenzo D'Angelo and Henning Meyerhenke and Lorenzo Severini and Yllka Velaj}, title = {Improving the Betweenness Centrality of a Node by Adding Links}, journal = {{ACM} J. Exp. Algorithmics}, volume = {23}, year = {2018}, url = {https://doi.org/10.1145/3166071}, doi = {10.1145/3166071}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/BergaminiCDMSV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipm/MaliziaOTC17, author = {Alessio Malizia and Kai A. Olsen and Tommaso Turchi and Pierluigi Crescenzi}, title = {An ant-colony based approach for real-time implicit collaborative information seeking}, journal = {Inf. Process. Manag.}, volume = {53}, number = {3}, pages = {608--623}, year = {2017}, url = {https://doi.org/10.1016/j.ipm.2016.12.005}, doi = {10.1016/J.IPM.2016.12.005}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipm/MaliziaOTC17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BorassiCT17, author = {Michele Borassi and Pierluigi Crescenzi and Luca Trevisan}, editor = {Philip N. Klein}, title = {An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19}, pages = {920--939}, publisher = {{SIAM}}, year = {2017}, url = {https://doi.org/10.1137/1.9781611974782.58}, doi = {10.1137/1.9781611974782.58}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/BorassiCT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BergaminiCDMSV17, author = {Elisabetta Bergamini and Pierluigi Crescenzi and Gianlorenzo D'Angelo and Henning Meyerhenke and Lorenzo Severini and Yllka Velaj}, title = {Improving the betweenness centrality of a node by adding links}, journal = {CoRR}, volume = {abs/1702.05284}, year = {2017}, url = {http://arxiv.org/abs/1702.05284}, eprinttype = {arXiv}, eprint = {1702.05284}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BergaminiCDMSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BarillariBC17, author = {Andrea Barillari and Daniele Bernardini and Pierluigi Crescenzi}, title = {Sigil3D: {A} Crowdsourcing Platform for Interactive 3D Content}, journal = {CoRR}, volume = {abs/1703.02968}, year = {2017}, url = {http://arxiv.org/abs/1703.02968}, eprinttype = {arXiv}, eprint = {1703.02968}, timestamp = {Mon, 15 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BarillariBC17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BergaminiBCMM17, author = {Elisabetta Bergamini and Michele Borassi and Pierluigi Crescenzi and Andrea Marino and Henning Meyerhenke}, title = {Computing top-k Closeness Centrality Faster in Unweighted Graphs}, journal = {CoRR}, volume = {abs/1704.01077}, year = {2017}, url = {http://arxiv.org/abs/1704.01077}, eprinttype = {arXiv}, eprint = {1704.01077}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BergaminiBCMM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CrescenziFHHPPP16, author = {Pierluigi Crescenzi and Pierre Fraigniaud and Magn{\'{u}}s M. Halld{\'{o}}rsson and Hovhannes A. Harutyunyan and Chiara Pierucci and Andrea Pietracaprina and Geppino Pucci}, title = {On the complexity of the shortest-path broadcast problem}, journal = {Discret. Appl. Math.}, volume = {199}, pages = {101--109}, year = {2016}, url = {https://doi.org/10.1016/j.dam.2015.05.004}, doi = {10.1016/J.DAM.2015.05.004}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/CrescenziFHHPPP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/ClementiCDFPS16, author = {Andrea Clementi and Pierluigi Crescenzi and Carola Doerr and Pierre Fraigniaud and Francesco Pasquale and Riccardo Silvestri}, title = {Rumor spreading in random evolving graphs}, journal = {Random Struct. Algorithms}, volume = {48}, number = {2}, pages = {290--312}, year = {2016}, url = {https://doi.org/10.1002/rsa.20586}, doi = {10.1002/RSA.20586}, timestamp = {Thu, 04 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/ClementiCDFPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tkdd/CrescenziDSV16, author = {Pierluigi Crescenzi and Gianlorenzo D'Angelo and Lorenzo Severini and Yllka Velaj}, title = {Greedily Improving Our Own Closeness Centrality in a Network}, journal = {{ACM} Trans. Knowl. Discov. Data}, volume = {11}, number = {1}, pages = {9:1--9:32}, year = {2016}, url = {https://doi.org/10.1145/2953882}, doi = {10.1145/2953882}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tkdd/CrescenziDSV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/BergaminiBCMM16, author = {Elisabetta Bergamini and Michele Borassi and Pierluigi Crescenzi and Andrea Marino and Henning Meyerhenke}, editor = {Michael T. Goodrich and Michael Mitzenmacher}, title = {Computing Top-\emph{k} Closeness Centrality Faster in Unweighted Graphs}, booktitle = {Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, {ALENEX} 2016, Arlington, Virginia, USA, January 10, 2016}, pages = {68--80}, publisher = {{SIAM}}, year = {2016}, url = {https://doi.org/10.1137/1.9781611974317.6}, doi = {10.1137/1.9781611974317.6}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/BergaminiBCMM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/asunam/CrescenziFLP16, author = {Pierluigi Crescenzi and Pierre Fraigniaud and Zvi Lotker and Paolo Penna}, editor = {Ravi Kumar and James Caverlee and Hanghang Tong}, title = {Core-periphery clustering and collaboration networks}, booktitle = {2016 {IEEE/ACM} International Conference on Advances in Social Networks Analysis and Mining, {ASONAM} 2016, San Francisco, CA, USA, August 18-21, 2016}, pages = {525--528}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/ASONAM.2016.7752285}, doi = {10.1109/ASONAM.2016.7752285}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/asunam/CrescenziFLP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fun/CambiCP16, author = {Francesco Cambi and Pierluigi Crescenzi and Linda Pagli}, editor = {Erik D. Demaine and Fabrizio Grandoni}, title = {Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering}, booktitle = {8th International Conference on Fun with Algorithms, {FUN} 2016, June 8-10, 2016, La Maddalena, Italy}, series = {LIPIcs}, volume = {49}, pages = {9:1--9:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.FUN.2016.9}, doi = {10.4230/LIPICS.FUN.2016.9}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/fun/CambiCP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/ictcs/2015, editor = {Pierluigi Crescenzi and Michele Loreti}, title = {Proceedings of the 16th Italian Conference on Theoretical Computer Science, {ICTCS} 2015, Firenze, Italy, September 9-11, 2015}, series = {Electronic Notes in Theoretical Computer Science}, volume = {322}, publisher = {Elsevier}, year = {2016}, url = {https://www.sciencedirect.com/journal/electronic-notes-in-theoretical-computer-science/vol/322/suppl/C}, timestamp = {Thu, 10 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ictcs/2015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BorassiCT16, author = {Michele Borassi and Pierluigi Crescenzi and Luca Trevisan}, title = {An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs}, journal = {CoRR}, volume = {abs/1604.01445}, year = {2016}, url = {http://arxiv.org/abs/1604.01445}, eprinttype = {arXiv}, eprint = {1604.01445}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BorassiCT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/almob/DonatiBSCS15, author = {Beatrice Donati and Christian Baudet and Blerina Sinaimeri and Pierluigi Crescenzi and Marie{-}France Sagot}, title = {{EUCALYPT:} efficient tree reconciliation enumerator}, journal = {Algorithms Mol. Biol.}, volume = {10}, pages = {3}, year = {2015}, url = {https://doi.org/10.1186/s13015-014-0031-3}, doi = {10.1186/S13015-014-0031-3}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/almob/DonatiBSCS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bioinformatics/BosiDGBSLCFF15, author = {Emanuele Bosi and Beatrice Donati and Marco Galardini and Sara Brunetti and Marie{-}France Sagot and Pietro Li{\`{o}} and Pierluigi Crescenzi and Renato Fani and Marco Fondi}, title = {MeDuSa: a multi-draft based scaffolder}, journal = {Bioinform.}, volume = {31}, number = {15}, pages = {2443--2451}, year = {2015}, url = {https://doi.org/10.1093/bioinformatics/btv171}, doi = {10.1093/BIOINFORMATICS/BTV171}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bioinformatics/BosiDGBSLCFF15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/CrescenziGMRS15, author = {Pierluigi Crescenzi and Daniel Gildea and Andrea Marino and Gianluca Rossi and Giorgio Satta}, title = {Synchronous context-free grammars and optimal linear parsing strategies}, journal = {J. Comput. Syst. Sci.}, volume = {81}, number = {7}, pages = {1333--1356}, year = {2015}, url = {https://doi.org/10.1016/j.jcss.2015.04.003}, doi = {10.1016/J.JCSS.2015.04.003}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/CrescenziGMRS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BorassiCHKMT15, author = {Michele Borassi and Pierluigi Crescenzi and Michel Habib and Walter A. Kosters and Andrea Marino and Frank W. Takes}, title = {Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games}, journal = {Theor. Comput. Sci.}, volume = {586}, pages = {59--80}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.02.033}, doi = {10.1016/J.TCS.2015.02.033}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BorassiCHKMT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BorassiCCM15, author = {Michele Borassi and David Coudert and Pierluigi Crescenzi and Andrea Marino}, editor = {Nikhil Bansal and Irene Finocchi}, title = {On Computing the Hyperbolicity of Real-World Graphs}, booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9294}, pages = {215--226}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48350-3\_19}, doi = {10.1007/978-3-662-48350-3\_19}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/BorassiCCM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icsoft/BettiniC15, author = {Lorenzo Bettini and Pierluigi Crescenzi}, editor = {Pascal Lorenz and Marten van Sinderen and Jorge Cardoso}, title = {Java--Meets Eclipse - An {IDE} for Teaching Java Following the Object-later Approach}, booktitle = {{ICSOFT-PT} 2015 - Proceedings of the 10th International Conference on Software Paradigm Trends, Colmar, Alsace, France, 20-22 July, 2015}, pages = {31--42}, publisher = {SciTePress}, year = {2015}, url = {https://doi.org/10.5220/0005512600310042}, doi = {10.5220/0005512600310042}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icsoft/BettiniC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icsoft/BettiniC15a, author = {Lorenzo Bettini and Pierluigi Crescenzi}, editor = {Pascal Lorenz and Jorge Cardoso and Leszek A. Maciaszek and Marten van Sinderen}, title = {An Eclipse {IDE} for Teaching Java-}, booktitle = {Software Technologies - 10th International Joint Conference, {ICSOFT} 2015, Colmar, France, July 20-22, 2015, Revised Selected Papers}, series = {Communications in Computer and Information Science}, volume = {586}, pages = {63--78}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-30142-6\_4}, doi = {10.1007/978-3-319-30142-6\_4}, timestamp = {Tue, 21 Mar 2023 21:01:55 +0100}, biburl = {https://dblp.org/rec/conf/icsoft/BettiniC15a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/CrescenziDSV15, author = {Pierluigi Crescenzi and Gianlorenzo D'Angelo and Lorenzo Severini and Yllka Velaj}, editor = {Evripidis Bampis}, title = {Greedily Improving Our Own Centrality in {A} Network}, booktitle = {Experimental Algorithms - 14th International Symposium, {SEA} 2015, Paris, France, June 29 - July 1, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9125}, pages = {43--55}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-20086-6\_4}, doi = {10.1007/978-3-319-20086-6\_4}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wea/CrescenziDSV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/entcs/CrescenziL16, author = {Pierluigi Crescenzi and Michele Loreti}, editor = {Pierluigi Crescenzi and Michele Loreti}, title = {Preface}, booktitle = {Proceedings of the 16th Italian Conference on Theoretical Computer Science, {ICTCS} 2015, Firenze, Italy, September 9-11, 2015}, series = {Electronic Notes in Theoretical Computer Science}, volume = {322}, pages = {1--2}, publisher = {Elsevier}, year = {2015}, url = {https://doi.org/10.1016/j.entcs.2016.03.001}, doi = {10.1016/J.ENTCS.2016.03.001}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/entcs/CrescenziL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/entcs/BorassiCH16, author = {Michele Borassi and Pierluigi Crescenzi and Michel Habib}, editor = {Pierluigi Crescenzi and Michele Loreti}, title = {Into the Square: On the Complexity of Some Quadratic-time Solvable Problems}, booktitle = {Proceedings of the 16th Italian Conference on Theoretical Computer Science, {ICTCS} 2015, Firenze, Italy, September 9-11, 2015}, series = {Electronic Notes in Theoretical Computer Science}, volume = {322}, pages = {51--67}, publisher = {Elsevier}, year = {2015}, url = {https://doi.org/10.1016/j.entcs.2016.03.005}, doi = {10.1016/J.ENTCS.2016.03.005}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/entcs/BorassiCH16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BorassiCM15, author = {Michele Borassi and Pierluigi Crescenzi and Andrea Marino}, title = {Fast and Simple Computation of Top-k Closeness Centralities}, journal = {CoRR}, volume = {abs/1507.01490}, year = {2015}, url = {http://arxiv.org/abs/1507.01490}, eprinttype = {arXiv}, eprint = {1507.01490}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BorassiCM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bioinformatics/MilreuKCABBJMMSJCLS14, author = {Paulo Vieira Milreu and Cecilia Coimbra Klein and Ludovic Cottret and Vicente Acu{\~{n}}a and Etienne Birmel{\'{e}} and Michele Borassi and Christophe Junot and Alberto Marchetti{-}Spaccamela and Andrea Marino and Leen Stougie and Fabien Jourdan and Pierluigi Crescenzi and Vincent Lacroix and Marie{-}France Sagot}, title = {Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure}, journal = {Bioinform.}, volume = {30}, number = {1}, pages = {61--70}, year = {2014}, url = {https://doi.org/10.1093/bioinformatics/btt597}, doi = {10.1093/BIOINFORMATICS/BTT597}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bioinformatics/MilreuKCABBJMMSJCLS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jpdc/BaumannCF14, author = {Herv{\'{e}} Baumann and Pierluigi Crescenzi and Pierre Fraigniaud}, title = {Flooding in dynamic graphs with arbitrary degree sequence}, journal = {J. Parallel Distributed Comput.}, volume = {74}, number = {5}, pages = {2433--2437}, year = {2014}, url = {https://doi.org/10.1016/j.jpdc.2014.01.007}, doi = {10.1016/J.JPDC.2014.01.007}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jpdc/BaumannCF14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/spic/AmeriniCCMM14, author = {Irene Amerini and Roberto Caldelli and Pierluigi Crescenzi and Andrea Del Mastio and Andrea Marino}, title = {Blind image clustering based on the Normalized Cuts criterion for camera identification}, journal = {Signal Process. Image Commun.}, volume = {29}, number = {8}, pages = {831--843}, year = {2014}, url = {https://doi.org/10.1016/j.image.2014.07.003}, doi = {10.1016/J.IMAGE.2014.07.003}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/spic/AmeriniCCMM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fun/BorassiCHKMT14, author = {Michele Borassi and Pierluigi Crescenzi and Michel Habib and Walter A. Kosters and Andrea Marino and Frank W. Takes}, editor = {Alfredo Ferro and Fabrizio Luccio and Peter Widmayer}, title = {On the Solvability of the Six Degrees of Kevin Bacon Game - {A} Faster Graph Diameter and Radius Computation Method}, booktitle = {Fun with Algorithms - 7th International Conference, {FUN} 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8496}, pages = {52--63}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-07890-8\_5}, doi = {10.1007/978-3-319-07890-8\_5}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fun/BorassiCHKMT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BorassiCH14, author = {Michele Borassi and Pierluigi Crescenzi and Michel Habib}, title = {Into the Square - On the Complexity of Quadratic-Time Solvable Problems}, journal = {CoRR}, volume = {abs/1407.4972}, year = {2014}, url = {http://arxiv.org/abs/1407.4972}, eprinttype = {arXiv}, eprint = {1407.4972}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BorassiCH14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrescenziGHLM13, author = {Pilu Crescenzi and Roberto Grossi and Michel Habib and Leonardo Lanzi and Andrea Marino}, title = {On computing the diameter of real-world undirected graphs}, journal = {Theor. Comput. Sci.}, volume = {514}, pages = {84--95}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.09.018}, doi = {10.1016/J.TCS.2012.09.018}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CrescenziGHLM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/ClementiCDFIPPS13, author = {Andrea Clementi and Pierluigi Crescenzi and Carola Doerr and Pierre Fraigniaud and Marco Isopi and Alessandro Panconesi and Francesco Pasquale and Riccardo Silvestri}, editor = {Hans L. Bodlaender and Giuseppe F. Italiano}, title = {Rumor Spreading in Random Evolving Graphs}, 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 = {325--336}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40450-4\_28}, doi = {10.1007/978-3-642-40450-4\_28}, timestamp = {Thu, 04 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/ClementiCDFIPPS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/CrescenziEK13, author = {Pierluigi Crescenzi and Emma Enstr{\"{o}}m and Viggo Kann}, editor = {Janet Carter and Ian Utting and Alison Clear}, title = {From theory to practice: NP-completeness for every {CS} student}, booktitle = {Innovation and Technology in Computer Science Education conference 2013, ITiCSE '13, Canterbury, United Kingdom - July 01 - 03, 2013}, pages = {16--21}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2462476.2465582}, doi = {10.1145/2462476.2465582}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iticse/CrescenziEK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/KorhonenNBCKMMM13, author = {Ari Korhonen and Thomas L. Naps and Charles Boisvert and Pilu Crescenzi and Ville Karavirta and Linda Mannila and Bradley Miller and Briana B. Morrison and Susan H. Rodger and Rocky Ross and Clifford A. Shaffer}, editor = {Janet Carter and Ian Utting and Alison Clear}, title = {Requirements and design strategies for open source interactive computer science eBooks}, booktitle = {Proceedings of the ITiCSE working group reports conference on Innovation and technology in computer science education-working group reports, ITiCSE-WGR 2013, Canterbury, England, United Kingdom, June 29 - July 3, 2013}, pages = {53--72}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2543882.2543886}, doi = {10.1145/2543882.2543886}, timestamp = {Sat, 27 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iticse/KorhonenNBCKMMM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/BorassiCLMSM13, author = {Michele Borassi and Pierluigi Crescenzi and Vincent Lacroix and Andrea Marino and Marie{-}France Sagot and Paulo Vieira Milreu}, editor = {Vincenzo Bonifaci and Camil Demetrescu and Alberto Marchetti{-}Spaccamela}, title = {Telling Stories Fast}, booktitle = {Experimental Algorithms, 12th International Symposium, {SEA} 2013, Rome, Italy, June 5-7, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7933}, pages = {200--211}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38527-8\_19}, doi = {10.1007/978-3-642-38527-8\_19}, timestamp = {Sun, 04 Aug 2024 19:40:14 +0200}, biburl = {https://dblp.org/rec/conf/wea/BorassiCLMSM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1302-3828, author = {Andrea Clementi and Pierluigi Crescenzi and Carola Doerr and Pierre Fraigniaud and Marco Isopi and Alessandro Panconesi and Francesco Pasquale and Riccardo Silvestri}, title = {Rumor Spreading in Random Evolving Graphs}, journal = {CoRR}, volume = {abs/1302.3828}, year = {2013}, url = {http://arxiv.org/abs/1302.3828}, eprinttype = {arXiv}, eprint = {1302.3828}, timestamp = {Thu, 04 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1302-3828.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CrescenziGMRS13, author = {Pierluigi Crescenzi and Daniel Gildea and Andrea Marino and Gianluca Rossi and Giorgio Satta}, title = {Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies}, journal = {CoRR}, volume = {abs/1311.6421}, year = {2013}, url = {http://arxiv.org/abs/1311.6421}, eprinttype = {arXiv}, eprint = {1311.6421}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CrescenziGMRS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ets/CrescenziMVDA12, author = {Pilu Crescenzi and Alessio Malizia and M. Cecilia Verri and Paloma D{\'{\i}}az and Ignacio Aedo}, title = {Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course}, journal = {J. Educ. Technol. Soc.}, volume = {15}, number = {2}, pages = {115--124}, year = {2012}, url = {http://www.ifets.info/download\_pdf.php?j\_id=55\&\#38;a\_id=1233}, timestamp = {Fri, 26 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ets/CrescenziMVDA12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AcunaBCCJLMMMSS12, author = {Vicente Acu{\~{n}}a and Etienne Birmel{\'{e}} and Ludovic Cottret and Pierluigi Crescenzi and Fabien Jourdan and Vincent Lacroix and Alberto Marchetti{-}Spaccamela and Andrea Marino and Paulo Vieira Milreu and Marie{-}France Sagot and Leen Stougie}, title = {Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets}, journal = {Theor. Comput. Sci.}, volume = {457}, pages = {1--9}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.07.023}, doi = {10.1016/J.TCS.2012.07.023}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AcunaBCCJLMMMSS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iscopt/FreireACFLMMS12, author = {Alexandre S. Freire and Vicente Acu{\~{n}}a and Pilu Crescenzi and Carlos Eduardo Ferreira and Vincent Lacroix and Paulo Vieira Milreu and Eduardo Moreno and Marie{-}France Sagot}, editor = {Ali Ridha Mahjoub and Vangelis Markakis and Ioannis Milis and Vangelis Th. Paschos}, title = {Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone}, booktitle = {Combinatorial Optimization - Second International Symposium, {ISCO} 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {7422}, pages = {165--177}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32147-4\_16}, doi = {10.1007/978-3-642-32147-4\_16}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iscopt/FreireACFLMMS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigcse/CrescenziRA12, author = {Pierluigi Crescenzi and Leonardo Rossi and Gianluca Apollaro}, editor = {Laurie A. Smith King and David R. Musicant and Tracy Camp and Paul T. Tymann}, title = {Making turing machines accessible to blind students}, booktitle = {Proceedings of the 43rd {ACM} technical symposium on Computer science education, {SIGCSE} 2012, Raleigh, NC, USA, February 29 - March 3, 2012}, pages = {167--172}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2157136.2157190}, doi = {10.1145/2157136.2157190}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigcse/CrescenziRA12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spire/BirmeleCFGLMPSS12, author = {Etienne Birmel{\'{e}} and Pierluigi Crescenzi and Rui A. Ferreira and Roberto Grossi and Vincent Lacroix and Andrea Marino and Nadia Pisanti and Gustavo Akio Tominaga Sacomoto and Marie{-}France Sagot}, editor = {Liliana Calder{\'{o}}n{-}Benavides and Cristina N. Gonz{\'{a}}lez{-}Caro and Edgar Ch{\'{a}}vez and Nivio Ziviani}, title = {Efficient Bubble Enumeration in Directed Graphs}, booktitle = {String Processing and Information Retrieval - 19th International Symposium, {SPIRE} 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7608}, pages = {118--129}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-34109-0\_13}, doi = {10.1007/978-3-642-34109-0\_13}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/spire/BirmeleCFGLMPSS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/BaumannCF12, author = {Herv{\'{e}} Baumann and Pierluigi Crescenzi and Pierre Fraigniaud}, editor = {Marcos K. Aguilera}, title = {Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence}, booktitle = {Distributed Computing - 26th International Symposium, {DISC} 2012, Salvador, Brazil, October 16-18, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7611}, pages = {417--418}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-33651-5\_36}, doi = {10.1007/978-3-642-33651-5\_36}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wdag/BaumannCF12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/CrescenziGLM12, author = {Pierluigi Crescenzi and Roberto Grossi and Leonardo Lanzi and Andrea Marino}, editor = {Ralf Klasing}, title = {On Computing the Diameter of Real-World Directed (Weighted) Graphs}, booktitle = {Experimental Algorithms - 11th International Symposium, {SEA} 2012, Bordeaux, France, June 7-9, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7276}, pages = {99--110}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-30850-5\_10}, doi = {10.1007/978-3-642-30850-5\_10}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wea/CrescenziGLM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bjet/CrescenziMVDA11, author = {Pilu Crescenzi and Alessio Malizia and M. Cecilia Verri and Paloma D{\'{\i}}az and Ignacio Aedo}, title = {On two collateral effects of using algorithm visualizations}, journal = {Br. J. Educ. Technol.}, volume = {42}, number = {6}, pages = {145}, year = {2011}, url = {https://doi.org/10.1111/j.1467-8535.2011.01220.x}, doi = {10.1111/J.1467-8535.2011.01220.X}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/bjet/CrescenziMVDA11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dc/BaumannCF11, author = {Herv{\'{e}} Baumann and Pierluigi Crescenzi and Pierre Fraigniaud}, title = {Parsimonious flooding in dynamic graphs}, journal = {Distributed Comput.}, volume = {24}, number = {1}, pages = {31--44}, year = {2011}, url = {https://doi.org/10.1007/s00446-011-0133-9}, doi = {10.1007/S00446-011-0133-9}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dc/BaumannCF11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrescenziIMMRV11, author = {Pilu Crescenzi and Miriam Di Ianni and Andrea Marino and Donatella Merlini and Gianluca Rossi and Paola Vocca}, title = {Smooth movement and Manhattan path based Random Waypoint mobility}, journal = {Inf. Process. Lett.}, volume = {111}, number = {5}, pages = {239--246}, year = {2011}, url = {https://doi.org/10.1016/j.ipl.2010.12.009}, doi = {10.1016/J.IPL.2010.12.009}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrescenziIMMRV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/acl/CrescenziGMRS11, author = {Pierluigi Crescenzi and Daniel Gildea and Andrea Marino and Gianluca Rossi and Giorgio Satta}, editor = {Dekang Lin and Yuji Matsumoto and Rada Mihalcea}, title = {Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems}, booktitle = {The 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference, 19-24 June, 2011, Portland, Oregon, {USA}}, pages = {450--459}, publisher = {The Association for Computer Linguistics}, year = {2011}, url = {https://aclanthology.org/P11-1046/}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/acl/CrescenziGMRS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapas/CrescenziGLM11, author = {Pierluigi Crescenzi and Roberto Grossi and Leonardo Lanzi and Andrea Marino}, editor = {Alberto Marchetti{-}Spaccamela and Michael Segal}, title = {A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs}, booktitle = {Theory and Practice of Algorithms in (Computer) Systems - First International {ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6595}, pages = {92--103}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-19754-3\_11}, doi = {10.1007/978-3-642-19754-3\_11}, timestamp = {Sun, 04 Aug 2024 19:44:00 +0200}, biburl = {https://dblp.org/rec/conf/tapas/CrescenziGLM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/CrescenziGILM10, author = {Pierluigi Crescenzi and Roberto Grossi and Claudio Imbrenda and Leonardo Lanzi and Andrea Marino}, editor = {Mark de Berg and Ulrich Meyer}, title = {Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound}, booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6346}, pages = {302--313}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-15775-2\_26}, doi = {10.1007/978-3-642-15775-2\_26}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/CrescenziGILM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/RosslingMCRIS10, author = {Guido R{\"{o}}{\ss}ling and Myles F. McNally and Pierluigi Crescenzi and Atanas Radenski and Petri Ihantola and M. Gloria S{\'{a}}nchez{-}Torrubia}, editor = {Alison Clear and Lori Russell{-}Dag}, title = {Adapting moodle to better support {CS} education}, booktitle = {Proceedings of the 2010 ITiCSE working group reports, ITiCSE-WGR 2010, Ankara, Turkey, June 28-30, 2010}, pages = {15--27}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1971681.1971684}, doi = {10.1145/1971681.1971684}, timestamp = {Sat, 21 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iticse/RosslingMCRIS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/Crescenzi10, author = {Pierluigi Crescenzi}, editor = {Reyyan Ayfer and John Impagliazzo and Cary Laxer}, title = {Using AVs to explain NP-completeness}, booktitle = {Proceedings of the 15th Annual {SIGCSE} Conference on Innovation and Technology in Computer Science Education, ITiCSE 2010, Bilkent, Ankara, Turkey, June 26-30, 2010}, pages = {299}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1822090.1822175}, doi = {10.1145/1822090.1822175}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iticse/Crescenzi10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wabi/MilreuABCMSSL10, author = {Paulo Vieira Milreu and Vicente Acu{\~{n}}a and Etienne Birmel{\'{e}} and Pierluigi Crescenzi and Alberto Marchetti{-}Spaccamela and Marie{-}France Sagot and Leen Stougie and Vincent Lacroix}, editor = {Vincent Moulton and Mona Singh}, title = {Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms}, booktitle = {Algorithms in Bioinformatics, 10th International Workshop, {WABI} 2010, Liverpool, UK, September 6-8, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6293}, pages = {226--237}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-15294-8\_19}, doi = {10.1007/978-3-642-15294-8\_19}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wabi/MilreuABCMSSL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/concurrency/CrescenziNPP09, author = {Pierluigi Crescenzi and Carlo Nocentini and Andrea Pietracaprina and Geppino Pucci}, title = {On the connectivity of Bluetooth-based \emph{ad hoc} networks}, journal = {Concurr. Comput. Pract. Exp.}, volume = {21}, number = {7}, pages = {875--887}, year = {2009}, url = {https://doi.org/10.1002/cpe.1377}, doi = {10.1002/CPE.1377}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/concurrency/CrescenziNPP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jeric/Bruce-LockhartNC09, author = {Michael Bruce{-}Lockhart and Theodore S. Norvell and Pierluigi Crescenzi}, title = {Adding Test Generation to the Teaching Machine}, journal = {{ACM} Trans. Comput. Educ.}, volume = {9}, number = {2}, pages = {12:1--12:14}, year = {2009}, url = {https://doi.org/10.1145/1538234.1538239}, doi = {10.1145/1538234.1538239}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jeric/Bruce-LockhartNC09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/CrescenziLP09, author = {Pierluigi Crescenzi and Fabrizio Luccio and Geppino Pucci}, title = {Foreword}, journal = {Theory Comput. Syst.}, volume = {44}, number = {2}, pages = {141--142}, year = {2009}, url = {https://doi.org/10.1007/s00224-008-9142-x}, doi = {10.1007/S00224-008-9142-X}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/CrescenziLP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ap2ps/NocentiniCL09, author = {Carlo Nocentini and Pilu Crescenzi and Leonardo Lanzi}, editor = {Antonio Liotta and Nick Antonopoulos and Georgios Exarchakos and Takahiro Hara}, title = {Performance Evaluation of a Chord-Based {JXTA} Implementation}, booktitle = {The First International Conference on Advances in {P2P} Systems, {AP2PS} 2009, 11-16 October 2009, Sliema, Malta}, pages = {7--12}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/AP2PS.2009.9}, doi = {10.1109/AP2PS.2009.9}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ap2ps/NocentiniCL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/BaumannCF09, author = {Herv{\'{e}} Baumann and Pierluigi Crescenzi and Pierre Fraigniaud}, editor = {Srikanta Tirthapura and Lorenzo Alvisi}, title = {Parsimonious flooding in dynamic graphs}, booktitle = {Proceedings of the 28th Annual {ACM} Symposium on Principles of Distributed Computing, {PODC} 2009, Calgary, Alberta, Canada, August 10-12, 2009}, pages = {260--269}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1582716.1582757}, doi = {10.1145/1582716.1582757}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/BaumannCF09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/CrescenziIMRV09, author = {Pilu Crescenzi and Miriam Di Ianni and Andrea Marino and Gianluca Rossi and Paola Vocca}, editor = {Shay Kutten and Janez Zerovnik}, title = {Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications}, 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 = {154--166}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11476-2\_13}, doi = {10.1007/978-3-642-11476-2\_13}, timestamp = {Sun, 18 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sirocco/CrescenziIMRV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/simutools/BoschiICRV08, author = {Stefano Boschi and Miriam Di Ianni and Pilu Crescenzi and Gianluca Rossi and Paola Vocca}, editor = {S{\'{a}}ndor Moln{\'{a}}r and John R. Heath and Olivier Dalle and Gabriel A. Wainer}, title = {{MOMOSE:} a mobility model simulation environment for mobile wireless ad-hoc networks}, booktitle = {Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, Networks and Systems {\&} Workshops, SimuTools 2008, Marseille, France, March 3-7, 2008}, pages = {38}, publisher = {{ICST/ACM}}, year = {2008}, url = {https://doi.org/10.4108/ICST.SIMUTOOLS2008.3036}, doi = {10.4108/ICST.SIMUTOOLS2008.3036}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/simutools/BoschiICRV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CrescenziIGRV08, author = {Pilu Crescenzi and Miriam Di Ianni and Federico Greco and Gianluca Rossi and Paola Vocca}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {Making Role Assignment Feasible: {A} Polynomial-Time Algorithm for Computing Ecological Colorings}, booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {5344}, pages = {90--100}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_9}, doi = {10.1007/978-3-540-92248-3\_9}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CrescenziIGRV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/entcs/Bruce-LockhartCN09, author = {Michael Bruce{-}Lockhart and Pilu Crescenzi and Theodore S. Norvell}, editor = {Guido R{\"{o}}{\ss}ling and J. {\'{A}}ngel Vel{\'{a}}zquez{-}Iturbide}, title = {Integrating test generation functionality into the Teaching Machine environment}, booktitle = {Proceedings of the Fifth Program Visualization Workshop, {PVW} 2008, Madrid, Spain, July 3-4, 2008}, series = {Electronic Notes in Theoretical Computer Science}, volume = {224}, pages = {115--124}, publisher = {Elsevier}, year = {2008}, url = {https://doi.org/10.1016/j.entcs.2008.12.055}, doi = {10.1016/J.ENTCS.2008.12.055}, timestamp = {Fri, 24 Feb 2023 09:55:33 +0100}, biburl = {https://dblp.org/rec/journals/entcs/Bruce-LockhartCN09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CrescenziGNPU07, author = {Pilu Crescenzi and Giorgio Gambosi and Gaia Nicosia and Paolo Penna and Walter Unger}, title = {On-line load balancing made simple: Greedy strikes back}, journal = {J. Discrete Algorithms}, volume = {5}, number = {1}, pages = {162--175}, year = {2007}, url = {https://doi.org/10.1016/j.jda.2006.02.001}, doi = {10.1016/J.JDA.2006.02.001}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CrescenziGNPU07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/europar/CrescenziNPPS07, author = {Pilu Crescenzi and Carlo Nocentini and Andrea Pietracaprina and Geppino Pucci and Carlo Sandri}, editor = {Anne{-}Marie Kermarrec and Luc Boug{\'{e}} and Thierry Priol}, title = {On the Connectivity of Bluetooth-Based Ad Hoc Networks}, booktitle = {Euro-Par 2007, Parallel Processing, 13th International Euro-Par Conference, Rennes, France, August 28-31, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4641}, pages = {960--969}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74466-5\_103}, doi = {10.1007/978-3-540-74466-5\_103}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/europar/CrescenziNPPS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/CrescenziN07, author = {Pilu Crescenzi and Carlo Nocentini}, editor = {Janet M. Hughes and D. Ramanee Peiris and Paul T. Tymann}, title = {Fully integrating algorithm visualization into a cs2 course.: a two-year experience}, booktitle = {Proceedings of the 12th Annual {SIGCSE} Conference on Innovation and Technology in Computer Science Education, ITiCSE 2007, Dundee, Scotland, UK, June 25-27, 2007}, pages = {296--300}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1268784.1268869}, doi = {10.1145/1268784.1268869}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iticse/CrescenziN07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/fun/2007, editor = {Pierluigi Crescenzi and Giuseppe Prencipe and Geppino Pucci}, title = {Fun with Algorithms, 4th International Conference, {FUN} 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4475}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-72914-3}, doi = {10.1007/978-3-540-72914-3}, isbn = {978-3-540-72913-6}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fun/2007.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/CrescenziLP06, author = {Pilu Crescenzi and Michele Loreti and Rosario Pugliese}, editor = {Renzo Davoli and Michael Goldweber and Paola Salomoni}, title = {Assessing {CS1} java skills: a three-year experience}, booktitle = {Proceedings of the 11th Annual {SIGCSE} Conference on Innovation and Technology in Computer Science Education, ITiCSE 2006, Bologna, Italy, June 26-28, 2006}, pages = {348}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1140124.1140257}, doi = {10.1145/1140124.1140257}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iticse/CrescenziLP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/adhoc-now/CrescenziILPRV05, author = {Pilu Crescenzi and Miriam Di Ianni and Alessandro Lazzoni and Paolo Penna and Gianluca Rossi and Paola Vocca}, editor = {Violet R. Syrotiuk and Edgar Ch{\'{a}}vez}, title = {Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks}, booktitle = {Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, {ADHOC-NOW} 2005, Cancun, Mexico, October 6-8, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3738}, pages = {4--17}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11561354\_3}, doi = {10.1007/11561354\_3}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/adhoc-now/CrescenziILPRV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/CrescenziGI05, author = {Pilu Crescenzi and Giorgio Gambosi and Gaia Innocenti}, editor = {Jos{\'{e}} C. Cunha and William M. Fleischman and Viera K. Proulx and Jo{\~{a}}o Louren{\c{c}}o}, title = {NetPrIDE an integrated environment for developing and visualizing computer network protocols}, booktitle = {Proceedings of the 10th Annual {SIGCSE} Conference on Innovation and Technology in Computer Science Education, ITiCSE 2005, Caparica, Portugal, June 27-29, 2005}, pages = {306--310}, publisher = {{ACM}}, year = {2005}, url = {https://doi.org/10.1145/1067445.1067529}, doi = {10.1145/1067445.1067529}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iticse/CrescenziGI05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CrescenziGP04, author = {Pilu Crescenzi and Giorgio Gambosi and Paolo Penna}, title = {On-line algorithms for the channel assignment problem in cellular networks}, journal = {Discret. Appl. Math.}, volume = {137}, number = {3}, pages = {237--266}, year = {2004}, url = {https://doi.org/10.1016/S0166-218X(03)00341-X}, doi = {10.1016/S0166-218X(03)00341-X}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/CrescenziGP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CrescenziMR04, author = {Pilu Crescenzi and Federico Montecalvo and Gianluca Rossi}, title = {Optimal covering designs: complexity results and new bounds}, journal = {Discret. Appl. Math.}, volume = {144}, number = {3}, pages = {281--290}, year = {2004}, url = {https://doi.org/10.1016/j.dam.2003.11.006}, doi = {10.1016/J.DAM.2003.11.006}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/CrescenziMR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrescenziG04, author = {Pierluigi Crescenzi and Federico Greco}, title = {The minimum likely column cover problem}, journal = {Inf. Process. Lett.}, volume = {89}, number = {4}, pages = {175--179}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2003.11.003}, doi = {10.1016/J.IPL.2003.11.003}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/CrescenziG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/monet/CrescenziY04, author = {Pilu Crescenzi and B{\"{u}}lent Yener}, title = {Foreword - {ACM} {MONET} Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications}, journal = {Mob. Networks Appl.}, volume = {9}, number = {2}, pages = {99}, year = {2004}, url = {https://doi.org/10.1023/B:MONE.0000013639.35057.47}, doi = {10.1023/B:MONE.0000013639.35057.47}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/monet/CrescenziY04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalt/BettiniCILC04, author = {Lorenzo Bettini and Pilu Crescenzi and Gaia Innocenti and Michele Loreti and Leonardo Cecchi}, editor = {Kinshuk and Chee{-}Kit Looi and Erkki Sutinen and Demetrios G. Sampson and Ignacio Aedo and Lorna Uden and Esko K{\"{a}}hk{\"{o}}nen}, title = {An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses}, booktitle = {Proceedings of the {IEEE} International Conference on Advanced Learning Technologies, {ICALT} 2004, Joensuu, Finland, August 30 - September 1, 2004}, publisher = {{IEEE} Computer Society}, year = {2004}, url = {https://doi.org/10.1109/ICALT.2004.1357395}, doi = {10.1109/ICALT.2004.1357395}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalt/BettiniCILC04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrescenziLGLPR03, author = {Pierluigi Crescenzi and Alberto Del Lungo and Roberto Grossi and Elena Lodi and Linda Pagli and Gianluca Rossi}, title = {Text sparsification via local maxima}, journal = {Theor. Comput. Sci.}, volume = {304}, number = {1-3}, pages = {341--364}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(03)00142-7}, doi = {10.1016/S0304-3975(03)00142-7}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrescenziLGLPR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CrescenziGNPU03, author = {Pierluigi Crescenzi and Giorgio Gambosi and Gaia Nicosia and Paolo Penna and Walter Unger}, editor = {Jos C. M. Baeten and Jan Karel Lenstra and Joachim Parrow and Gerhard J. Woeginger}, title = {Online Load Balancing Made Simple: Greedy Strikes Back}, booktitle = {Automata, Languages and Programming, 30th International Colloquium, {ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2719}, pages = {1108--1122}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-45061-0\_85}, doi = {10.1007/3-540-45061-0\_85}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/CrescenziGNPU03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/CrescenziI03, author = {Pilu Crescenzi and Gaia Innocenti}, editor = {Vassilios Dagdilelis and Maya Satratzemi and David Finkel and Roger D. Boyle and Georgios Evangelidis}, title = {A tool to develop electronic course books based on {WWW} technologies, resources and usability criteria}, booktitle = {Proceedings of the 8th Annual {SIGCSE} Conference on Innovation and Technology in Computer Science Education, ITiCSE 2003, Thessaloniki, Greece, June 30 - July 2, 2003}, pages = {163--167}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/961511.961557}, doi = {10.1145/961511.961557}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iticse/CrescenziI03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/pppj/CecchiCI03, author = {Leonardo Cecchi and Pilu Crescenzi and Gaia Innocenti}, editor = {James F. Power and John Waldron}, title = {C : {C++} = JavaMM: Java}, booktitle = {Proceedings of the 2nd International Symposium on Principles and Practice of Programming in Java, {PPPJ} 2003, Kilkenny City, Ireland, June 16-18, 2003}, series = {{ACM} International Conference Proceeding Series}, volume = {42}, pages = {75--78}, publisher = {{ACM}}, year = {2003}, url = {https://dl.acm.org/citation.cfm?id=957313}, timestamp = {Mon, 26 Nov 2018 15:05:58 +0100}, biburl = {https://dblp.org/rec/conf/pppj/CecchiCI03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/CrescenziGI03, author = {Pierluigi Crescenzi and Roberto Grossi and Giuseppe F. Italiano}, editor = {Klaus Jansen and Marian Margraf and Monaldo Mastrolilli and Jos{\'{e}} D. P. Rolim}, title = {Search Data Structures for Skewed Strings}, booktitle = {Experimental and Efficient Algorithms, Second International Workshop, {WEA} 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2647}, pages = {81--96}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-44867-5\_7}, doi = {10.1007/3-540-44867-5\_7}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wea/CrescenziGI03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arscom/CrescenziAS02, author = {Pierluigi Crescenzi and Sergio De Agostino and Riccardo Silvestri}, title = {A note on the spatiality degree of graphs}, journal = {Ars Comb.}, volume = {63}, year = {2002}, timestamp = {Tue, 02 Dec 2003 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arscom/CrescenziAS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrescenziR02, author = {Pierluigi Crescenzi and Gianluca Rossi}, title = {On the Hamming distance of constraint satisfaction problems}, journal = {Theor. Comput. Sci.}, volume = {288}, number = {1}, pages = {85--100}, year = {2002}, url = {https://doi.org/10.1016/S0304-3975(01)00146-3}, doi = {10.1016/S0304-3975(01)00146-3}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrescenziR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icce/CrescenziI02, author = {Pierluigi Crescenzi and Gaia Innocenti}, title = {Development of an {ECB} on Computer Networks Based on {WWW} Technologies, Resources and Usability Criteria}, booktitle = {International Conference on Computers in Education, {ICCE} 2002, Auckland, New Zealand, December 3-6, 2002, Volume 2}, pages = {1198--1202}, publisher = {{IEEE} Computer Society}, year = {2002}, url = {https://doi.org/10.1109/CIE.2002.1186189}, doi = {10.1109/CIE.2002.1186189}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icce/CrescenziI02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/CrescenziST01, author = {Pierluigi Crescenzi and Riccardo Silvestri and Luca Trevisan}, title = {On Weighted vs Unweighted Versions of Combinatorial Optimization Problems}, journal = {Inf. Comput.}, volume = {167}, number = {1}, pages = {10--26}, year = {2001}, url = {https://doi.org/10.1006/inco.2000.3011}, doi = {10.1006/INCO.2000.3011}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/CrescenziST01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/CrescenziDP01, author = {Pierluigi Crescenzi and Xiaotie Deng and Christos H. Papadimitriou}, title = {On Approximating a Scheduling Problem}, journal = {J. Comb. Optim.}, volume = {5}, number = {3}, pages = {287--297}, year = {2001}, url = {https://doi.org/10.1023/A:1011441109660}, doi = {10.1023/A:1011441109660}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/CrescenziDP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/CrescenziI01, author = {Pierluigi Crescenzi and Gaia Innocenti}, editor = {Stephan Diehl}, title = {Towards a Taxonomy of Network Protocol Visualization Tools}, booktitle = {Software Visualization, International Seminar Dagstuhl Castle, Germany, May 20-25, 2001, Revised Lectures}, series = {Lecture Notes in Computer Science}, volume = {2269}, pages = {241--255}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-45875-1\_19}, doi = {10.1007/3-540-45875-1\_19}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/dagstuhl/CrescenziI01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/ClementiCMPS01, author = {Andrea E. F. Clementi and Pierluigi Crescenzi and Angelo Monti and Paolo Penna and Riccardo Silvestri}, editor = {Michel X. Goemans and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Luca Trevisan}, title = {On Computing Ad-hoc Selective Families}, booktitle = {Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2129}, pages = {211--222}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-44666-4\_24}, doi = {10.1007/3-540-44666-4\_24}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/random/ClementiCMPS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ClementiCPRV01, author = {Andrea E. F. Clementi and Pierluigi Crescenzi and Paolo Penna and Gianluca Rossi and Paola Vocca}, editor = {Afonso Ferreira and Horst Reichel}, title = {On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs}, booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2010}, pages = {121--131}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-44693-1\_11}, doi = {10.1007/3-540-44693-1\_11}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/ClementiCPRV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/CrescenziT00, author = {Pierluigi Crescenzi and Luca Trevisan}, title = {On Approximation Scheme Preserving Reducibility and Its Applications}, journal = {Theory Comput. Syst.}, volume = {33}, number = {1}, pages = {1--16}, year = {2000}, url = {https://doi.org/10.1007/s002249910001}, doi = {10.1007/S002249910001}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/CrescenziT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/vlc/CrescenziDFP00, author = {Pierluigi Crescenzi and Camil Demetrescu and Irene Finocchi and Rossella Petreschi}, title = {Reversible Execution and Visualization of Programs with {LEONARDO}}, journal = {J. Vis. Lang. Comput.}, volume = {11}, number = {2}, pages = {125--150}, year = {2000}, url = {https://doi.org/10.1006/jvlc.1999.0143}, doi = {10.1006/JVLC.1999.0143}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/vlc/CrescenziDFP00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dialm/CrescenziGP00, author = {Pierluigi Crescenzi and Giorgio Gambosi and Paolo Penna}, title = {On-line algorithms for the channel assignment problem in cellular networks}, booktitle = {Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications {(DIAL-M} 2000), Boston, Massachusetts, USA, August 11, 2000}, pages = {1--7}, publisher = {{ACM}}, year = {2000}, url = {https://doi.org/10.1145/345848.345851}, doi = {10.1145/345848.345851}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/dialm/CrescenziGP00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/CrescenziLGLPR00, author = {Pierluigi Crescenzi and Alberto Del Lungo and Roberto Grossi and Elena Lodi and Linda Pagli and Gianluca Rossi}, editor = {Sanjiv Kapoor and Sanjiva Prasad}, title = {Text Sparsification via Local Maxima}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, 20th Conference, {FST} {TCS} 2000 New Delhi, India, December 13-15, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1974}, pages = {290--301}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-44450-5\_23}, doi = {10.1007/3-540-44450-5\_23}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/CrescenziLGLPR00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/lib/Ausiello99, author = {Giorgio Ausiello and Alberto Marchetti{-}Spaccamela and Pierluigi Crescenzi and Giorgio Gambosi and Marco Protasi and Viggo Kann}, title = {Complexity and approximation: combinatorial optimization problems and their approximability properties}, publisher = {Springer}, year = {1999}, url = {https://link.springer.com/book/10.1007/978-3-642-58412-1}, doi = {10.1007/978-3-642-58412-1}, isbn = {3540654313}, timestamp = {Wed, 04 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/lib/Ausiello99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CrescenziKST99, author = {Pierluigi Crescenzi and Viggo Kann and Riccardo Silvestri and Luca Trevisan}, title = {Structure in Approximation Classes}, journal = {{SIAM} J. Comput.}, volume = {28}, number = {5}, pages = {1759--1782}, year = {1999}, url = {https://doi.org/10.1137/S0097539796304220}, doi = {10.1137/S0097539796304220}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/CrescenziKST99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrescenziT99, author = {Pierluigi Crescenzi and Luca Trevisan}, title = {Max NP-completeness Made Easy}, journal = {Theor. Comput. Sci.}, volume = {225}, number = {1-2}, pages = {65--79}, year = {1999}, url = {https://doi.org/10.1016/S0304-3975(98)00200-X}, doi = {10.1016/S0304-3975(98)00200-X}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrescenziT99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/ClementiCR99, author = {Andrea E. F. Clementi and Pierluigi Crescenzi and Gianluca Rossi}, editor = {Takao Asano and Hiroshi Imai and D. T. Lee and Shin{-}Ichi Nakano and Takeshi Tokuyama}, title = {On the Complexity of Approximating Colored-Graph Problems}, booktitle = {Computing and Combinatorics, 5th Annual International Conference, {COCOON} '99, Tokyo, Japan, July 26-28, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1627}, pages = {281--290}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48686-0\_28}, doi = {10.1007/3-540-48686-0\_28}, timestamp = {Sat, 30 Sep 2023 09:37:25 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/ClementiCR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/CrescenziDG99, author = {Pierluigi Crescenzi and Leandro Dardini and Roberto Grossi}, editor = {Jaroslav Nesetril}, title = {{IP} Address Lookup Made Fast and Simple}, booktitle = {Algorithms - {ESA} '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1643}, pages = {65--76}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48481-7\_7}, doi = {10.1007/3-540-48481-7\_7}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/CrescenziDG99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/CrescenziS98, author = {Pierluigi Crescenzi and Riccardo Silvestri}, title = {Sperner's Lemma and Robust Machines}, journal = {Comput. Complex.}, volume = {7}, number = {2}, pages = {163--173}, year = {1998}, url = {https://doi.org/10.1007/s000370050008}, doi = {10.1007/S000370050008}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/CrescenziS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/CrescenziPP98, author = {Pierluigi Crescenzi and Paolo Penna and Adolfo Piperno}, title = {Linear area upward drawings of {AVL} trees}, journal = {Comput. Geom.}, volume = {9}, number = {1-2}, pages = {25--42}, year = {1998}, url = {https://doi.org/10.1016/S0925-7721(97)00013-8}, doi = {10.1016/S0925-7721(97)00013-8}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/CrescenziPP98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcb/CrescenziGPPY98, author = {Pierluigi Crescenzi and Deborah Goldman and Christos H. Papadimitriou and Antonio Piccolboni and Mihalis Yannakakis}, title = {On the Complexity of Protein Folding}, journal = {J. Comput. Biol.}, volume = {5}, number = {3}, pages = {423--465}, year = {1998}, url = {https://doi.org/10.1089/cmb.1998.5.423}, doi = {10.1089/CMB.1998.5.423}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcb/CrescenziGPPY98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/CrescenziK98, author = {Pierluigi Crescenzi and Viggo Kann}, title = {How to find the best approximation results}, journal = {{SIGACT} News}, volume = {29}, number = {4}, pages = {90--97}, year = {1998}, url = {https://doi.org/10.1145/306198.306210}, doi = {10.1145/306198.306210}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigact/CrescenziK98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrescenziP98, author = {Pierluigi Crescenzi and Paolo Penna}, title = {Strictly-upward Drawings of Ordered Search Trees}, journal = {Theor. Comput. Sci.}, volume = {203}, number = {1}, pages = {51--67}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(97)00287-9}, doi = {10.1016/S0304-3975(97)00287-9}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrescenziP98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AndreevCCDAR98, author = {Alexander E. Andreev and Andrea E. F. Clementi and Pierluigi Crescenzi and Elias Dahlhaus and Sergio De Agostino and Jos{\'{e}} D. P. Rolim}, title = {The Parallel Complexity of Approximating the High Degree Subgraph Problem}, journal = {Theor. Comput. Sci.}, volume = {205}, number = {1-2}, pages = {261--282}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(97)00276-4}, doi = {10.1016/S0304-3975(97)00276-4}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AndreevCCDAR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/recomb/CrescenziGPPY98, author = {Pierluigi Crescenzi and Deborah Goldman and Christos H. Papadimitriou and Antonio Piccolboni and Mihalis Yannakakis}, editor = {Sorin Istrail and Pavel A. Pevzner and Michael S. Waterman}, title = {On the complexity of protein folding (abstract)}, booktitle = {Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, {RECOMB} 1998, New York, NY, USA, March 22-25, 1998}, pages = {61--62}, publisher = {{ACM}}, year = {1998}, url = {https://doi.org/10.1145/279069.279089}, doi = {10.1145/279069.279089}, timestamp = {Mon, 13 May 2019 09:30:09 +0200}, biburl = {https://dblp.org/rec/conf/recomb/CrescenziGPPY98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CrescenziGPPY98, author = {Pierluigi Crescenzi and Deborah Goldman and Christos H. Papadimitriou and Antonio Piccolboni and Mihalis Yannakakis}, editor = {Jeffrey Scott Vitter}, title = {On the Complexity of Protein Folding (Extended Abstract)}, booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998}, pages = {597--603}, publisher = {{ACM}}, year = {1998}, url = {https://doi.org/10.1145/276698.276875}, doi = {10.1145/276698.276875}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CrescenziGPPY98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Crescenzi97, author = {Pierluigi Crescenzi}, title = {A Short Guide to Approximation Preserving Reductions}, booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997}, pages = {262--273}, publisher = {{IEEE} Computer Society}, year = {1997}, url = {https://doi.org/10.1109/CCC.1997.612321}, doi = {10.1109/CCC.1997.612321}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Crescenzi97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gd/CrescenziP97, author = {Pierluigi Crescenzi and Paolo Penna}, editor = {Giuseppe Di Battista}, title = {Minimum-Area h-v Drawings of Complete Binary Trees}, booktitle = {Graph Drawing, 5th International Symposium, {GD} '97, Rome, Italy, September 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1353}, pages = {371--382}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/3-540-63938-1\_82}, doi = {10.1007/3-540-63938-1\_82}, timestamp = {Sun, 13 Nov 2022 09:57:37 +0100}, biburl = {https://dblp.org/rec/conf/gd/CrescenziP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/CrescenziK97, author = {Pierluigi Crescenzi and Viggo Kann}, editor = {Jos{\'{e}} D. P. Rolim}, title = {Approximation on the Web: {A} Compendium of {NP} Optimization Problems}, booktitle = {Randomization and Approximation Techniques in Computer Science, International Workshop, RANDOM'97, Bolognna, Italy, July 11-12. 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1269}, pages = {111--118}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/3-540-63248-4\_10}, doi = {10.1007/3-540-63248-4\_10}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/random/CrescenziK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wae/CrescenziDFP97, author = {Pierluigi Crescenzi and Camil Demetrescu and Irene Finocchi and Rossella Petreschi}, editor = {Giuseppe F. Italiano and Salvatore Orlando}, title = {{LEONARDO:} a software visualization system}, booktitle = {Workshop on Algorithm Engineering, {WAE} '97, Venezia, Italy, September 11-13, 1997. Proceedings}, pages = {146--155}, publisher = {Universit{\`{a}} Ca' Foscari di Venezia}, year = {1997}, timestamp = {Mon, 10 May 2021 14:20:29 +0200}, biburl = {https://dblp.org/rec/conf/wae/CrescenziDFP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-039, author = {Pierluigi Crescenzi and Luca Trevisan}, title = {{MAX} NP-Completeness Made Easy}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-039}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-039/index.html}, eprinttype = {ECCC}, eprint = {TR97-039}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-039.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/CrescenziT96, author = {Pierluigi Crescenzi and Luca Trevisan}, title = {On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {30}, number = {5}, pages = {431--441}, year = {1996}, url = {https://doi.org/10.1051/ita/1996300504311}, doi = {10.1051/ITA/1996300504311}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ita/CrescenziT96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/istcs/CrescenziST96, author = {Pierluigi Crescenzi and Riccardo Silvestri and Luca Trevisan}, title = {To Weight or Not to Weight: Where is the Question?}, booktitle = {Fourth Israel Symposium on Theory of Computing and Systems, {ISTCS} 1996, Jerusalem, Israel, June 10-12, 1996, Proceedings}, pages = {68--77}, publisher = {{IEEE} Computer Society}, year = {1996}, timestamp = {Tue, 31 May 2016 15:27:26 +0200}, biburl = {https://dblp.org/rec/conf/istcs/CrescenziST96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/scoop/BovetCCS96, author = {Daniel P. Bovet and Andrea Clementi and Pierluigi Crescenzi and Riccardo Silvestri}, editor = {Afonso Ferreira and Panos M. Pardalos}, title = {Parallel approximation of optimization problems}, booktitle = {Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques}, series = {Lecture Notes in Computer Science}, volume = {1054}, pages = {7--24}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/BFb0027116}, doi = {10.1007/BFB0027116}, timestamp = {Tue, 09 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/scoop/BovetCCS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CrescenziP96, author = {Pierluigi Crescenzi and Paolo Penna}, editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti{-}Spaccamela}, title = {Upward Drawings of Search Trees (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, {WG} '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1197}, pages = {114--125}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-62559-3\_11}, doi = {10.1007/3-540-62559-3\_11}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CrescenziP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR96-066, author = {Pierluigi Crescenzi and Viggo Kann and Riccardo Silvestri and Luca Trevisan}, title = {Structure in Approximation Classes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR96-066}}, year = {1996}, url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-066/index.html}, eprinttype = {ECCC}, eprint = {TR96-066}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-066.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cviu/BongiovanniCG95, author = {Gian Carlo Bongiovanni and Pierluigi Crescenzi and Concettina Guerra}, title = {Parallel Simulated Annealing for Shape Detection}, journal = {Comput. Vis. Image Underst.}, volume = {61}, number = {1}, pages = {60--69}, year = {1995}, url = {https://doi.org/10.1006/cviu.1995.1005}, doi = {10.1006/CVIU.1995.1005}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cviu/BongiovanniCG95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/BovetCS95, author = {Daniel P. Bovet and Pierluigi Crescenzi and Riccardo Silvestri}, title = {Complexity Classes and Sparse Oracles}, journal = {J. Comput. Syst. Sci.}, volume = {50}, number = {3}, pages = {382--390}, year = {1995}, url = {https://doi.org/10.1006/jcss.1995.1030}, doi = {10.1006/JCSS.1995.1030}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/BovetCS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ppl/BongiovanniCA95, author = {Gian Carlo Bongiovanni and Pierluigi Crescenzi and Sergio De Agostino}, title = {Max Sat and Min Set Cover Approximation Algorithms are P-Complete}, journal = {Parallel Process. Lett.}, volume = {5}, pages = {293--298}, year = {1995}, url = {https://doi.org/10.1142/S0129626495000278}, doi = {10.1142/S0129626495000278}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ppl/BongiovanniCA95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrescenziP95, author = {Pierluigi Crescenzi and Christos H. Papadimitriou}, title = {Reversible Simulation of Space-Bounded Computations}, journal = {Theor. Comput. Sci.}, volume = {143}, number = {1}, pages = {159--165}, year = {1995}, url = {https://doi.org/10.1016/0304-3975(95)80031-4}, doi = {10.1016/0304-3975(95)80031-4}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrescenziP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AusielloCP95, author = {Giorgio Ausiello and Pierluigi Crescenzi and Marco Protasi}, title = {Approximate Solution of {NP} Optimization Problems}, journal = {Theor. Comput. Sci.}, volume = {150}, number = {1}, pages = {1--55}, year = {1995}, url = {https://doi.org/10.1016/0304-3975(94)00291-P}, doi = {10.1016/0304-3975(94)00291-P}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AusielloCP95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/CrescenziKST95, author = {Pierluigi Crescenzi and Viggo Kann and Riccardo Silvestri and Luca Trevisan}, editor = {Ding{-}Zhu Du and Ming Li}, title = {Structure in Approximation Classes (Extended Abstract)}, booktitle = {Computing and Combinatorics, First Annual International Conference, {COCOON} '95, Xi'an, China, August 24-26, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {959}, pages = {539--548}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/BFb0030875}, doi = {10.1007/BFB0030875}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cocoon/CrescenziKST95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AndreevCCDAR95, author = {Alexander E. Andreev and Andrea Clementi and Pierluigi Crescenzi and Elias Dahlhaus and Sergio De Agostino and Jos{\'{e}} D. P. Rolim}, editor = {John Staples and Peter Eades and Naoki Katoh and Alistair Moffat}, title = {The Parallel Complexity of Approximating the High Degree Subgraph Problem}, booktitle = {Algorithms and Computation, 6th International Symposium, {ISAAC} '95, Cairns, Australia, December 4-6, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1004}, pages = {132--141}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/BFb0015416}, doi = {10.1007/BFB0015416}, timestamp = {Tue, 09 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AndreevCCDAR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/daglib/0071774, author = {Daniel P. Bovet and Pierluigi Crescenzi}, title = {Introduction to the theory of complexity}, series = {Prentice Hall international series in computer science}, publisher = {Prentice Hall}, year = {1994}, isbn = {978-0-13-915380-8}, timestamp = {Fri, 08 Apr 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0071774.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/CrescenziT94, author = {Pierluigi Crescenzi and Luca Trevisan}, editor = {P. S. Thiagarajan}, title = {On Approximation Scheme Preserving Reducability and Its Applications}, booktitle = {Foundations of Software Technology and Theoretical Computer Science, 14th Conference, Madras, India, December 15-17, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {880}, pages = {330--341}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-58715-2\_135}, doi = {10.1007/3-540-58715-2\_135}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/CrescenziT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gd/CrescenziP94, author = {Pierluigi Crescenzi and Adolfo Piperno}, editor = {Roberto Tamassia and Ioannis G. Tollis}, title = {Optimal-Area Upward Drawings of {AVL} Trees}, booktitle = {Graph Drawing, {DIMACS} International Workshop, {GD} '94, Princeton, New Jersey, USA, October 10-12, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {894}, pages = {307--317}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-58950-3\_386}, doi = {10.1007/3-540-58950-3\_386}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/gd/CrescenziP94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CrescenziT94, author = {Pierluigi Crescenzi and Luca Trevisan}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract)}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {130--139}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_43}, doi = {10.1007/3-540-59071-4\_43}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/CrescenziT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/ciac/1994, editor = {Maurizio A. Bonuccelli and Pierluigi Crescenzi and Rossella Petreschi}, title = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94, Rome, Italy, February 23-25, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {778}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-57811-0}, doi = {10.1007/3-540-57811-0}, isbn = {3-540-57811-0}, timestamp = {Fri, 17 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ciac/1994.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/CrescenziS93, author = {Pierluigi Crescenzi and Riccardo Silvestri}, title = {Average Measure, Descriptive Complexity and Approximation of Maximization Problems}, journal = {Int. J. Found. Comput. Sci.}, volume = {4}, number = {1}, pages = {15--30}, year = {1993}, url = {https://doi.org/10.1142/S0129054193000031}, doi = {10.1142/S0129054193000031}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/CrescenziS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrescenziS93, author = {Pierluigi Crescenzi and Riccardo Silvestri}, title = {A Note on the Descriptive Complexity of Maximization}, journal = {Inf. Process. Lett.}, volume = {47}, number = {1}, pages = {11--15}, year = {1993}, url = {https://doi.org/10.1016/0020-0190(93)90151-X}, doi = {10.1016/0020-0190(93)90151-X}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/CrescenziS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/CrescenziS93, author = {Pierluigi Crescenzi and Riccardo Silvestri}, title = {Sperner's Lemma and Robust Machines}, booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993}, pages = {194--199}, publisher = {{IEEE} Computer Society}, year = {1993}, url = {https://doi.org/10.1109/SCT.1993.336527}, doi = {10.1109/SCT.1993.336527}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/CrescenziS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/CrescenziBP92, author = {Pierluigi Crescenzi and Giuseppe Di Battista and Adolfo Piperno}, title = {A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees}, journal = {Comput. Geom.}, volume = {2}, pages = {187--200}, year = {1992}, url = {https://doi.org/10.1016/0925-7721(92)90021-J}, doi = {10.1016/0925-7721(92)90021-J}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/CrescenziBP92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BovetCS92, author = {Daniel P. Bovet and Pierluigi Crescenzi and Riccardo Silvestri}, title = {A Uniform Approach to Define Complexity Classes}, journal = {Theor. Comput. Sci.}, volume = {104}, number = {2}, pages = {263--283}, year = {1992}, url = {https://doi.org/10.1016/0304-3975(92)90125-Y}, doi = {10.1016/0304-3975(92)90125-Y}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BovetCS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/BovetC91, author = {Daniel P. Bovet and Pierluigi Crescenzi}, title = {Minimum-Delay Schedules in Layered Networks}, journal = {Acta Informatica}, volume = {28}, number = {5}, pages = {453--461}, year = {1991}, url = {https://doi.org/10.1007/BF01178583}, doi = {10.1007/BF01178583}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/acta/BovetC91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/CrescenziP91, author = {Pierluigi Crescenzi and Alessandro Panconesi}, title = {Completeness in Approximation Classes}, journal = {Inf. Comput.}, volume = {93}, number = {2}, pages = {241--262}, year = {1991}, url = {https://doi.org/10.1016/0890-5401(91)90025-W}, doi = {10.1016/0890-5401(91)90025-W}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/CrescenziP91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrescenziFS91, author = {Pierluigi Crescenzi and C. Fiorini and Riccardo Silvestri}, title = {A Note on the Approximation of the {MAX} {CLIQUE} Problem}, journal = {Inf. Process. Lett.}, volume = {40}, number = {1}, pages = {1--5}, year = {1991}, url = {https://doi.org/10.1016/S0020-0190(05)80002-X}, doi = {10.1016/S0020-0190(05)80002-X}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/CrescenziFS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BovetCS91, author = {Daniel P. Bovet and Pierluigi Crescenzi and Riccardo Silvestri}, title = {Complexity Classes and Sparse Oracles}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {102--108}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160248}, doi = {10.1109/SCT.1991.160248}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BovetCS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/BovetIC90, author = {Daniel P. Bovet and Miriam Di Ianni and Pierluigi Crescenzi}, title = {Deadlock Prediction in the Case of Dynamic Routing}, journal = {Int. J. Found. Comput. Sci.}, volume = {1}, number = {3}, pages = {185--200}, year = {1990}, url = {https://doi.org/10.1142/S012905419000014X}, doi = {10.1142/S012905419000014X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/BovetIC90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrescenziS90, author = {Pierluigi Crescenzi and Riccardo Silvestri}, title = {Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems}, journal = {Inf. Process. Lett.}, volume = {33}, number = {5}, pages = {221--226}, year = {1990}, url = {https://doi.org/10.1016/0020-0190(90)90188-4}, doi = {10.1016/0020-0190(90)90188-4}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/CrescenziS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/CrescenziP89, author = {Pierluigi Crescenzi and Alessandro Panconesi}, editor = {J{\'{a}}nos Csirik and J{\'{a}}nos Demetrovics and Ferenc G{\'{e}}cseg}, title = {Completeness in Approximation Classes}, booktitle = {Fundamentals of Computation Theory, International Conference FCT'89, Szeged, Hungary, August 21-25, 1989, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {380}, pages = {116--126}, publisher = {Springer}, year = {1989}, url = {https://doi.org/10.1007/3-540-51498-8\_11}, doi = {10.1007/3-540-51498-8\_11}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/fct/CrescenziP89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.