var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fdblp.org%2Fpid%2F57%2F7900.bib&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fdblp.org%2Fpid%2F57%2F7900.bib&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fdblp.org%2Fpid%2F57%2F7900.bib&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2025\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On computing optimal temporal branchings and spanning subgraphs.\n \n \n \n \n\n\n \n Bubboloni, D.; Catalano, C.; Marino, A.; and Silva, A.\n\n\n \n\n\n\n J. Comput. Syst. Sci., 148: 103596. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jcss/BubboloniCMS25,\n  author       = {Daniela Bubboloni and\n                  Costanza Catalano and\n                  Andrea Marino and\n                  Ana Silva},\n  title        = {On computing optimal temporal branchings and spanning subgraphs},\n  journal      = {J. Comput. Syst. Sci.},\n  volume       = {148},\n  pages        = {103596},\n  year         = {2025},\n  url          = {https://doi.org/10.1016/j.jcss.2024.103596},\n  doi          = {10.1016/J.JCSS.2024.103596},\n  timestamp    = {Sat, 30 Nov 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/jcss/BubboloniCMS25.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2024\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On computing large temporal (unilateral) connected components.\n \n \n \n \n\n\n \n Costa, I. L.; Lopes, R.; Marino, A.; and Silva, A.\n\n\n \n\n\n\n J. Comput. Syst. Sci., 144: 103548. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jcss/CostaLMS24,\n  author       = {Isnard Lopes Costa and\n                  Raul Lopes and\n                  Andrea Marino and\n                  Ana Silva},\n  title        = {On computing large temporal (unilateral) connected components},\n  journal      = {J. Comput. Syst. Sci.},\n  volume       = {144},\n  pages        = {103548},\n  year         = {2024},\n  url          = {https://doi.org/10.1016/j.jcss.2024.103548},\n  doi          = {10.1016/J.JCSS.2024.103548},\n  timestamp    = {Fri, 09 Aug 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/jcss/CostaLMS24.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional.\n \n \n \n \n\n\n \n Christodoulou, F.; Crescenzi, P.; Marino, A.; Silva, A.; and Thilikos, D. M.\n\n\n \n\n\n\n In Rescigno, A. A.; and Vaccaro, U., editor(s), Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings, volume 14764, of Lecture Notes in Computer Science, pages 247–258, 2024. Springer\n \n\n\n\n
\n\n\n\n \n \n \"MakingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iwoca/ChristodoulouCMST24,\n  author       = {Filippos Christodoulou and\n                  Pierluigi Crescenzi and\n                  Andrea Marino and\n                  Ana Silva and\n                  Dimitrios M. Thilikos},\n  editor       = {Adele Anna Rescigno and\n                  Ugo Vaccaro},\n  title        = {Making the Interval Membership Width of Temporal Graphs Connected\n                  and Bidirectional},\n  booktitle    = {Combinatorial Algorithms - 35th International Workshop, {IWOCA} 2024,\n                  Ischia, Italy, July 1-3, 2024, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {14764},\n  pages        = {247--258},\n  publisher    = {Springer},\n  year         = {2024},\n  url          = {https://doi.org/10.1007/978-3-031-63021-7\\_19},\n  doi          = {10.1007/978-3-031-63021-7\\_19},\n  timestamp    = {Fri, 12 Jul 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/iwoca/ChristodoulouCMST24.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Eulerian Walks in Temporal Graphs.\n \n \n \n \n\n\n \n Marino, A.; and Silva, A.\n\n\n \n\n\n\n Algorithmica, 85(3): 805–830. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"EulerianPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/algorithmica/MarinoS23,\n  author       = {Andrea Marino and\n                  Ana Silva},\n  title        = {Eulerian Walks in Temporal Graphs},\n  journal      = {Algorithmica},\n  volume       = {85},\n  number       = {3},\n  pages        = {805--830},\n  year         = {2023},\n  url          = {https://doi.org/10.1007/s00453-022-01021-y},\n  doi          = {10.1007/S00453-022-01021-Y},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/algorithmica/MarinoS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Computing Optimal Temporal Branchings.\n \n \n \n \n\n\n \n Bubboloni, D.; Catalano, C.; Marino, A.; and Silva, A.\n\n\n \n\n\n\n In Fernau, H.; and Jansen, K., editor(s), Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, volume 14292, of Lecture Notes in Computer Science, pages 103–117, 2023. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/fct/BubboloniCMS23,\n  author       = {Daniela Bubboloni and\n                  Costanza Catalano and\n                  Andrea Marino and\n                  Ana Silva},\n  editor       = {Henning Fernau and\n                  Klaus Jansen},\n  title        = {On Computing Optimal Temporal Branchings},\n  booktitle    = {Fundamentals of Computation Theory - 24th International Symposium,\n                  {FCT} 2023, Trier, Germany, September 18-21, 2023, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {14292},\n  pages        = {103--117},\n  publisher    = {Springer},\n  year         = {2023},\n  url          = {https://doi.org/10.1007/978-3-031-43587-4\\_8},\n  doi          = {10.1007/978-3-031-43587-4\\_8},\n  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/fct/BubboloniCMS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Computing Large Temporal (Unilateral) Connected Components.\n \n \n \n \n\n\n \n Costa, I. L.; Lopes, R.; Marino, A.; and Silva, A.\n\n\n \n\n\n\n In Hsieh, S.; Hung, L.; and Lee, C., editor(s), Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings, volume 13889, of Lecture Notes in Computer Science, pages 282–293, 2023. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iwoca/Costa00S23,\n  author       = {Isnard Lopes Costa and\n                  Raul Lopes and\n                  Andrea Marino and\n                  Ana Silva},\n  editor       = {Sun{-}Yuan Hsieh and\n                  Ling{-}Ju Hung and\n                  Chia{-}Wei Lee},\n  title        = {On Computing Large Temporal (Unilateral) Connected Components},\n  booktitle    = {Combinatorial Algorithms - 34th International Workshop, {IWOCA} 2023,\n                  Tainan, Taiwan, June 7-10, 2023, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {13889},\n  pages        = {282--293},\n  publisher    = {Springer},\n  year         = {2023},\n  url          = {https://doi.org/10.1007/978-3-031-34347-6\\_24},\n  doi          = {10.1007/978-3-031-34347-6\\_24},\n  timestamp    = {Tue, 27 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/iwoca/Costa00S23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Efficient Algorithm for Assessing the Number of \\emphst-Paths in Large Graphs.\n \n \n \n \n\n\n \n Punzi, G.; Conte, A.; Grossi, R.; and Marino, A.\n\n\n \n\n\n\n In Shekhar, S.; Zhou, Z.; Chiang, Y.; and Stiglic, G., editor(s), Proceedings of the 2023 SIAM International Conference on Data Mining, SDM 2023, Minneapolis-St. Paul Twin Cities, MN, USA, April 27-29, 2023, pages 289–297, 2023. SIAM\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/sdm/PunziCG023,\n  author       = {Giulia Punzi and\n                  Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino},\n  editor       = {Shashi Shekhar and\n                  Zhi{-}Hua Zhou and\n                  Yao{-}Yi Chiang and\n                  Gregor Stiglic},\n  title        = {An Efficient Algorithm for Assessing the Number of \\emph{st}-Paths\n                  in Large Graphs},\n  booktitle    = {Proceedings of the 2023 {SIAM} International Conference on Data Mining,\n                  {SDM} 2023, Minneapolis-St. Paul Twin Cities, MN, USA, April 27-29,\n                  2023},\n  pages        = {289--297},\n  publisher    = {{SIAM}},\n  year         = {2023},\n  url          = {https://doi.org/10.1137/1.9781611977653.ch33},\n  doi          = {10.1137/1.9781611977653.CH33},\n  timestamp    = {Tue, 17 Oct 2023 16:39:08 +0200},\n  biburl       = {https://dblp.org/rec/conf/sdm/PunziCG023.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Computing Optimal Temporal Branchings and Spanning Subgraphs.\n \n \n \n \n\n\n \n Bubboloni, D.; Catalano, C.; Marino, A.; and Silva, A.\n\n\n \n\n\n\n CoRR, abs/2312.11390. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2312-11390,\n  author       = {Daniela Bubboloni and\n                  Costanza Catalano and\n                  Andrea Marino and\n                  Ana Silva},\n  title        = {On Computing Optimal Temporal Branchings and Spanning Subgraphs},\n  journal      = {CoRR},\n  volume       = {abs/2312.11390},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2312.11390},\n  doi          = {10.48550/ARXIV.2312.11390},\n  eprinttype    = {arXiv},\n  eprint       = {2312.11390},\n  timestamp    = {Tue, 16 Jan 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2312-11390.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Coloring temporal graphs.\n \n \n \n \n\n\n \n Marino, A.; and Silva, A.\n\n\n \n\n\n\n J. Comput. Syst. Sci., 123: 171–185. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ColoringPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jcss/MarinoS22,\n  author       = {Andrea Marino and\n                  Ana Silva},\n  title        = {Coloring temporal graphs},\n  journal      = {J. Comput. Syst. Sci.},\n  volume       = {123},\n  pages        = {171--185},\n  year         = {2022},\n  url          = {https://doi.org/10.1016/j.jcss.2021.08.004},\n  doi          = {10.1016/J.JCSS.2021.08.004},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/jcss/MarinoS22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Computing the Diameter of (Weighted) Link Streams.\n \n \n \n \n\n\n \n Calamai, M.; Crescenzi, P.; and Marino, A.\n\n\n \n\n\n\n ACM J. Exp. Algorithmics, 27: 4.3:1–4.3:28. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jea/CalamaiCM22,\n  author       = {Marco Calamai and\n                  Pierluigi Crescenzi and\n                  Andrea Marino},\n  title        = {On Computing the Diameter of (Weighted) Link Streams},\n  journal      = {{ACM} J. Exp. Algorithmics},\n  volume       = {27},\n  pages        = {4.3:1--4.3:28},\n  year         = {2022},\n  url          = {https://doi.org/10.1145/3569168},\n  doi          = {10.1145/3569168},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/jea/CalamaiCM22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proximity Search for Maximal Subgraph Enumeration.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; Uno, T.; and Versari, L.\n\n\n \n\n\n\n SIAM J. Comput., 51(5): 1580–1625. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ProximityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/siamcomp/ConteGMUV22,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Takeaki Uno and\n                  Luca Versari},\n  title        = {Proximity Search for Maximal Subgraph Enumeration},\n  journal      = {{SIAM} J. Comput.},\n  volume       = {51},\n  number       = {5},\n  pages        = {1580--1625},\n  year         = {2022},\n  url          = {https://doi.org/10.1137/20m1375048},\n  doi          = {10.1137/20M1375048},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/siamcomp/ConteGMUV22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Locality Filtering for Efficient Ride Sharing Platforms.\n \n \n \n \n\n\n \n Tosoni, F.; Ferragina, P.; Marino, A.; Resta, G.; and Santi, P.\n\n\n \n\n\n\n IEEE Trans. Intell. Transp. Syst., 23(7): 7785–7804. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"LocalityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tits/TosoniFMRS22,\n  author       = {Francesco Tosoni and\n                  Paolo Ferragina and\n                  Andrea Marino and\n                  Giovanni Resta and\n                  Paolo Santi},\n  title        = {Locality Filtering for Efficient Ride Sharing Platforms},\n  journal      = {{IEEE} Trans. Intell. Transp. Syst.},\n  volume       = {23},\n  number       = {7},\n  pages        = {7785--7804},\n  year         = {2022},\n  url          = {https://doi.org/10.1109/TITS.2021.3072830},\n  doi          = {10.1109/TITS.2021.3072830},\n  timestamp    = {Wed, 27 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tits/TosoniFMRS22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Menger's Theorem for Temporal Paths (Not Walks).\n \n \n \n \n\n\n \n Ibiapina, A.; Lopes, R.; Marino, A.; and Silva, A.\n\n\n \n\n\n\n CoRR, abs/2206.15251. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Menger'sPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2206-15251,\n  author       = {Allen Ibiapina and\n                  Raul Lopes and\n                  Andrea Marino and\n                  Ana Silva},\n  title        = {Menger's Theorem for Temporal Paths (Not Walks)},\n  journal      = {CoRR},\n  volume       = {abs/2206.15251},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2206.15251},\n  doi          = {10.48550/ARXIV.2206.15251},\n  eprinttype    = {arXiv},\n  eprint       = {2206.15251},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2206-15251.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Edge-Disjoint Branchings in Temporal Digraphs.\n \n \n \n \n\n\n \n Campos, V. A.; Lopes, R.; Marino, A.; and Silva, A.\n\n\n \n\n\n\n Electron. J. Comb., 28(4). 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Edge-DisjointPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/combinatorics/CamposLMS21,\n  author       = {Victor A. Campos and\n                  Raul Lopes and\n                  Andrea Marino and\n                  Ana Silva},\n  title        = {Edge-Disjoint Branchings in Temporal Digraphs},\n  journal      = {Electron. J. Comb.},\n  volume       = {28},\n  number       = {4},\n  year         = {2021},\n  url          = {https://doi.org/10.37236/10229},\n  doi          = {10.37236/10229},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/combinatorics/CamposLMS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Preface: WEPA 2018.\n \n \n \n \n\n\n \n Uno, T.; and Marino, A.\n\n\n \n\n\n\n Discret. Appl. Math., 303: 160. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Preface:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/UnoM21,\n  author       = {Takeaki Uno and\n                  Andrea Marino},\n  title        = {Preface: {WEPA} 2018},\n  journal      = {Discret. Appl. Math.},\n  volume       = {303},\n  pages        = {160},\n  year         = {2021},\n  url          = {https://doi.org/10.1016/j.dam.2021.08.035},\n  doi          = {10.1016/J.DAM.2021.08.035},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/dam/UnoM21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n K-plex cover pooling for graph neural networks.\n \n \n \n \n\n\n \n Bacciu, D.; Conte, A.; Grossi, R.; Landolfi, F.; and Marino, A.\n\n\n \n\n\n\n Data Min. Knowl. Discov., 35(5): 2200–2220. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"K-plexPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/datamine/BacciuCGLM21,\n  author       = {Davide Bacciu and\n                  Alessio Conte and\n                  Roberto Grossi and\n                  Francesco Landolfi and\n                  Andrea Marino},\n  title        = {K-plex cover pooling for graph neural networks},\n  journal      = {Data Min. Knowl. Discov.},\n  volume       = {35},\n  number       = {5},\n  pages        = {2200--2220},\n  year         = {2021},\n  url          = {https://doi.org/10.1007/s10618-021-00779-z},\n  doi          = {10.1007/S10618-021-00779-Z},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/datamine/BacciuCGLM21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Leveraging the Users Graph and Trustful Transactions for the Analysis of Bitcoin Price.\n \n \n \n \n\n\n \n Crowcroft, J.; Maesa, D. D. F.; Magrini, A.; Marino, A.; and Ricci, L.\n\n\n \n\n\n\n IEEE Trans. Netw. Sci. Eng., 8(2): 1338–1352. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"LeveragingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tnse/CrowcroftMMMR21,\n  author       = {Jon Crowcroft and\n                  Damiano Di Francesco Maesa and\n                  Alessandro Magrini and\n                  Andrea Marino and\n                  Laura Ricci},\n  title        = {Leveraging the Users Graph and Trustful Transactions for the Analysis\n                  of Bitcoin Price},\n  journal      = {{IEEE} Trans. Netw. Sci. Eng.},\n  volume       = {8},\n  number       = {2},\n  pages        = {1338--1352},\n  year         = {2021},\n  url          = {https://doi.org/10.1109/TNSE.2020.3008600},\n  doi          = {10.1109/TNSE.2020.3008600},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tnse/CrowcroftMMMR21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Königsberg Sightseeing: Eulerian Walks in Temporal Graphs.\n \n \n \n \n\n\n \n Marino, A.; and Silva, A.\n\n\n \n\n\n\n In Flocchini, P.; and Moura, L., editor(s), Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings, volume 12757, of Lecture Notes in Computer Science, pages 485–500, 2021. Springer\n \n\n\n\n
\n\n\n\n \n \n \"KönigsbergPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iwoca/MarinoS21,\n  author       = {Andrea Marino and\n                  Ana Silva},\n  editor       = {Paola Flocchini and\n                  Lucia Moura},\n  title        = {K{\\"{o}}nigsberg Sightseeing: Eulerian Walks in Temporal Graphs},\n  booktitle    = {Combinatorial Algorithms - 32nd International Workshop, {IWOCA} 2021,\n                  Ottawa, ON, Canada, July 5-7, 2021, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12757},\n  pages        = {485--500},\n  publisher    = {Springer},\n  year         = {2021},\n  url          = {https://doi.org/10.1007/978-3-030-79987-8\\_34},\n  doi          = {10.1007/978-3-030-79987-8\\_34},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/iwoca/MarinoS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Computing the Diameter of (Weighted) Link Streams.\n \n \n \n \n\n\n \n Calamai, M.; Crescenzi, P.; and Marino, A.\n\n\n \n\n\n\n In Coudert, D.; and Natale, E., editor(s), 19th International Symposium on Experimental Algorithms, SEA 2021, June 7-9, 2021, Nice, France, volume 190, of LIPIcs, pages 11:1–11:21, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/wea/CalamaiCM21,\n  author       = {Marco Calamai and\n                  Pierluigi Crescenzi and\n                  Andrea Marino},\n  editor       = {David Coudert and\n                  Emanuele Natale},\n  title        = {On Computing the Diameter of (Weighted) Link Streams},\n  booktitle    = {19th International Symposium on Experimental Algorithms, {SEA} 2021,\n                  June 7-9, 2021, Nice, France},\n  series       = {LIPIcs},\n  volume       = {190},\n  pages        = {11:1--11:21},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2021},\n  url          = {https://doi.org/10.4230/LIPIcs.SEA.2021.11},\n  doi          = {10.4230/LIPICS.SEA.2021.11},\n  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/wea/CalamaiCM21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Königsberg Sightseeing: Eulerian Walks in Temporal Graphs.\n \n \n \n \n\n\n \n Marino, A.; and Silva, A.\n\n\n \n\n\n\n CoRR, abs/2103.07522. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"KönigsbergPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2103-07522,\n  author       = {Andrea Marino and\n                  Ana Silva},\n  title        = {K{\\"{o}}nigsberg Sightseeing: Eulerian Walks in Temporal Graphs},\n  journal      = {CoRR},\n  volume       = {abs/2103.07522},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2103.07522},\n  eprinttype    = {arXiv},\n  eprint       = {2103.07522},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2103-07522.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs.\n \n \n \n \n\n\n \n Conte, A.; Sensi, D. D.; Grossi, R.; Marino, A.; and Versari, L.\n\n\n \n\n\n\n IEEE Access, 8: 139096–139109. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"TrulyPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/access/ConteSGMV20,\n  author       = {Alessio Conte and\n                  Daniele De Sensi and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Luca Versari},\n  title        = {Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection\n                  in Graphs},\n  journal      = {{IEEE} Access},\n  volume       = {8},\n  pages        = {139096--139109},\n  year         = {2020},\n  url          = {https://doi.org/10.1109/ACCESS.2020.3011667},\n  doi          = {10.1109/ACCESS.2020.3011667},\n  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/access/ConteSGMV20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; and Versari, L.\n\n\n \n\n\n\n Algorithmica, 82(6): 1547–1573. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Sublinear-SpacePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/algorithmica/ConteGMV20,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Luca Versari},\n  title        = {Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration\n                  in Graphs},\n  journal      = {Algorithmica},\n  volume       = {82},\n  number       = {6},\n  pages        = {1547--1573},\n  year         = {2020},\n  url          = {https://doi.org/10.1007/s00453-019-00656-8},\n  doi          = {10.1007/S00453-019-00656-8},\n  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/algorithmica/ConteGMV20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs.\n \n \n \n \n\n\n \n Crescenzi, P.; Magnien, C.; and Marino, A.\n\n\n \n\n\n\n Algorithms, 13(9): 211. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"FindingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/algorithms/CrescenziMM20,\n  author       = {Pierluigi Crescenzi and\n                  Cl{\\'{e}}mence Magnien and\n                  Andrea Marino},\n  title        = {Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs},\n  journal      = {Algorithms},\n  volume       = {13},\n  number       = {9},\n  pages        = {211},\n  year         = {2020},\n  url          = {https://doi.org/10.3390/a13090211},\n  doi          = {10.3390/A13090211},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/algorithms/CrescenziMM20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Large-scale clique cover of real-world networks.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; and Marino, A.\n\n\n \n\n\n\n Inf. Comput., 270. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Large-scalePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/iandc/ConteGM20,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino},\n  title        = {Large-scale clique cover of real-world networks},\n  journal      = {Inf. Comput.},\n  volume       = {270},\n  year         = {2020},\n  url          = {https://doi.org/10.1016/j.ic.2019.104464},\n  doi          = {10.1016/J.IC.2019.104464},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/iandc/ConteGM20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs.\n \n \n \n \n\n\n \n Moghtasedi, S.; Muntean, C. I.; Nardini, F. M.; Grossi, R.; and Marino, A.\n\n\n \n\n\n\n In Atzmüller, M.; Coscia, M.; and Missaoui, R., editor(s), IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2020, The Hague, Netherlands, December 7-10, 2020, pages 348–352, 2020. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"High-QualityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/asunam/MoghtasediMNGM20,\n  author       = {Shima Moghtasedi and\n                  Cristina Ioana Muntean and\n                  Franco Maria Nardini and\n                  Roberto Grossi and\n                  Andrea Marino},\n  editor       = {Martin Atzm{\\"{u}}ller and\n                  Michele Coscia and\n                  Rokia Missaoui},\n  title        = {High-Quality Prediction of Tourist Movements using Temporal Trajectories\n                  in Graphs},\n  booktitle    = {{IEEE/ACM} International Conference on Advances in Social Networks\n                  Analysis and Mining, {ASONAM} 2020, The Hague, Netherlands, December\n                  7-10, 2020},\n  pages        = {348--352},\n  publisher    = {{IEEE}},\n  year         = {2020},\n  url          = {https://doi.org/10.1109/ASONAM49781.2020.9381450},\n  doi          = {10.1109/ASONAM49781.2020.9381450},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/asunam/MoghtasediMNGM20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Edge-Disjoint Branchings in Temporal Graphs.\n \n \n \n \n\n\n \n Campos, V. A.; Lopes, R.; Marino, A.; and Silva, A.\n\n\n \n\n\n\n In Gasieniec, L.; Klasing, R.; and Radzik, T., editor(s), Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings, volume 12126, of Lecture Notes in Computer Science, pages 112–125, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Edge-DisjointPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iwoca/CamposLMS20,\n  author       = {Victor A. Campos and\n                  Raul Lopes and\n                  Andrea Marino and\n                  Ana Silva},\n  editor       = {Leszek Gasieniec and\n                  Ralf Klasing and\n                  Tomasz Radzik},\n  title        = {Edge-Disjoint Branchings in Temporal Graphs},\n  booktitle    = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,\n                  Bordeaux, France, June 8-10, 2020, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12126},\n  pages        = {112--125},\n  publisher    = {Springer},\n  year         = {2020},\n  url          = {https://doi.org/10.1007/978-3-030-48966-3\\_9},\n  doi          = {10.1007/978-3-030-48966-3\\_9},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/iwoca/CamposLMS20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs.\n \n \n \n \n\n\n \n Conte, A.; Crescenzi, P.; Marino, A.; and Punzi, G.\n\n\n \n\n\n\n In Esparza, J.; and Král', D., editor(s), 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic, volume 170, of LIPIcs, pages 25:1–25:14, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"EnumerationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/mfcs/ConteCMP20,\n  author       = {Alessio Conte and\n                  Pierluigi Crescenzi and\n                  Andrea Marino and\n                  Giulia Punzi},\n  editor       = {Javier Esparza and\n                  Daniel Kr{\\'{a}}l'},\n  title        = {Enumeration of s-d Separators in DAGs with Application to Reliability\n                  Analysis in Temporal Graphs},\n  booktitle    = {45th International Symposium on Mathematical Foundations of Computer\n                  Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},\n  series       = {LIPIcs},\n  volume       = {170},\n  pages        = {25:1--25:14},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2020},\n  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2020.25},\n  doi          = {10.4230/LIPICS.MFCS.2020.25},\n  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/mfcs/ConteCMP20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Finding Structurally and Temporally Similar Trajectories in Graphs.\n \n \n \n \n\n\n \n Grossi, R.; Marino, A.; and Moghtasedi, S.\n\n\n \n\n\n\n In Faro, S.; and Cantone, D., editor(s), 18th International Symposium on Experimental Algorithms, SEA 2020, June 16-18, 2020, Catania, Italy, volume 160, of LIPIcs, pages 24:1–24:13, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"FindingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/wea/GrossiMM20,\n  author       = {Roberto Grossi and\n                  Andrea Marino and\n                  Shima Moghtasedi},\n  editor       = {Simone Faro and\n                  Domenico Cantone},\n  title        = {Finding Structurally and Temporally Similar Trajectories in Graphs},\n  booktitle    = {18th International Symposium on Experimental Algorithms, {SEA} 2020,\n                  June 16-18, 2020, Catania, Italy},\n  series       = {LIPIcs},\n  volume       = {160},\n  pages        = {24:1--24:13},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2020},\n  url          = {https://doi.org/10.4230/LIPIcs.SEA.2020.24},\n  doi          = {10.4230/LIPICS.SEA.2020.24},\n  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/wea/GrossiMM20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Edge-Disjoint Branchings in Temporal Graphs.\n \n \n \n \n\n\n \n Campos, V. A.; Lopes, R.; Marino, A.; and Silva, A.\n\n\n \n\n\n\n CoRR, abs/2002.12694. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Edge-DisjointPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2002-12694,\n  author       = {Victor A. Campos and\n                  Raul Lopes and\n                  Andrea Marino and\n                  Ana Silva},\n  title        = {Edge-Disjoint Branchings in Temporal Graphs},\n  journal      = {CoRR},\n  volume       = {abs/2002.12694},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2002.12694},\n  eprinttype    = {arXiv},\n  eprint       = {2002.12694},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2002-12694.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient Estimation of Graph Trussness.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; and Versari, L.\n\n\n \n\n\n\n CoRR, abs/2010.00967. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-2010-00967,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Luca Versari},\n  title        = {Efficient Estimation of Graph Trussness},\n  journal      = {CoRR},\n  volume       = {abs/2010.00967},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2010.00967},\n  eprinttype    = {arXiv},\n  eprint       = {2010.00967},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-00967.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (9)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Approximating the Temporal Neighbourhood Function of Large Temporal Graphs.\n \n \n \n \n\n\n \n Crescenzi, P.; Magnien, C.; and Marino, A.\n\n\n \n\n\n\n Algorithms, 12(10): 211. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"ApproximatingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/algorithms/CrescenziMM19,\n  author       = {Pierluigi Crescenzi and\n                  Cl{\\'{e}}mence Magnien and\n                  Andrea Marino},\n  title        = {Approximating the Temporal Neighbourhood Function of Large Temporal\n                  Graphs},\n  journal      = {Algorithms},\n  volume       = {12},\n  number       = {10},\n  pages        = {211},\n  year         = {2019},\n  url          = {https://doi.org/10.3390/a12100211},\n  doi          = {10.3390/A12100211},\n  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/algorithms/CrescenziMM19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The bow tie structure of the Bitcoin users graph.\n \n \n \n \n\n\n \n Maesa, D. D. F.; Marino, A.; and Ricci, L.\n\n\n \n\n\n\n Appl. Netw. Sci., 4(1): 56:1–56:22. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ans/MaesaMR19,\n  author       = {Damiano Di Francesco Maesa and\n                  Andrea Marino and\n                  Laura Ricci},\n  title        = {The bow tie structure of the Bitcoin users graph},\n  journal      = {Appl. Netw. Sci.},\n  volume       = {4},\n  number       = {1},\n  pages        = {56:1--56:22},\n  year         = {2019},\n  url          = {https://doi.org/10.1007/s41109-019-0163-y},\n  doi          = {10.1007/S41109-019-0163-Y},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/ans/MaesaMR19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A fast discovery algorithm for large common connected induced subgraphs.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; Tattini, L.; and Versari, L.\n\n\n \n\n\n\n Discret. Appl. Math., 268: 210–222. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/ConteGMTV19,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Lorenzo Tattini and\n                  Luca Versari},\n  title        = {A fast discovery algorithm for large common connected induced subgraphs},\n  journal      = {Discret. Appl. Math.},\n  volume       = {268},\n  pages        = {210--222},\n  year         = {2019},\n  url          = {https://doi.org/10.1016/j.dam.2019.02.023},\n  doi          = {10.1016/J.DAM.2019.02.023},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/dam/ConteGMTV19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Listing Maximal Subgraphs Satisfying Strongly Accessible Properties.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; and Versari, L.\n\n\n \n\n\n\n SIAM J. Discret. Math., 33(2): 587–613. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"ListingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/siamdm/ConteGMV19,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Luca Versari},\n  title        = {Listing Maximal Subgraphs Satisfying Strongly Accessible Properties},\n  journal      = {{SIAM} J. Discret. Math.},\n  volume       = {33},\n  number       = {2},\n  pages        = {587--613},\n  year         = {2019},\n  url          = {https://doi.org/10.1137/17M1152206},\n  doi          = {10.1137/17M1152206},\n  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/siamdm/ConteGMV19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computing top-\\emphk Closeness Centrality Faster in Unweighted Graphs.\n \n \n \n \n\n\n \n Bergamini, E.; Borassi, M.; Crescenzi, P.; Marino, A.; and Meyerhenke, H.\n\n\n \n\n\n\n ACM Trans. Knowl. Discov. Data, 13(5): 53:1–53:40. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"ComputingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tkdd/BergaminiBCMM19,\n  author       = {Elisabetta Bergamini and\n                  Michele Borassi and\n                  Pierluigi Crescenzi and\n                  Andrea Marino and\n                  Henning Meyerhenke},\n  title        = {Computing top-\\emph{k} Closeness Centrality Faster in Unweighted Graphs},\n  journal      = {{ACM} Trans. Knowl. Discov. Data},\n  volume       = {13},\n  number       = {5},\n  pages        = {53:1--53:40},\n  year         = {2019},\n  url          = {https://doi.org/10.1145/3344719},\n  doi          = {10.1145/3344719},\n  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tkdd/BergaminiBCMM19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs.\n \n \n \n \n\n\n \n Conte, A.; Kanté, M. M.; Marino, A.; and Uno, T.\n\n\n \n\n\n\n In Colbourn, C. J.; Grossi, R.; and Pisanti, N., editor(s), Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings, volume 11638, of Lecture Notes in Computer Science, pages 148–159, 2019. Springer\n \n\n\n\n
\n\n\n\n \n \n \"MaximalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iwoca/ConteKMU19,\n  author       = {Alessio Conte and\n                  Mamadou Moustapha Kant{\\'{e}} and\n                  Andrea Marino and\n                  Takeaki Uno},\n  editor       = {Charles J. Colbourn and\n                  Roberto Grossi and\n                  Nadia Pisanti},\n  title        = {Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree\n                  Hypergraphs},\n  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,\n                  Pisa, Italy, July 23-25, 2019, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {11638},\n  pages        = {148--159},\n  publisher    = {Springer},\n  year         = {2019},\n  url          = {https://doi.org/10.1007/978-3-030-25005-8\\_13},\n  doi          = {10.1007/978-3-030-25005-8\\_13},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/iwoca/ConteKMU19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Kanté, M. M.; Marino, A.; Uno, T.; and Wasa, K.\n\n\n \n\n\n\n In Rossmanith, P.; Heggernes, P.; and Katoen, J., editor(s), 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany, volume 138, of LIPIcs, pages 73:1–73:14, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"ListingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/mfcs/ConteGKMUW19,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Mamadou Moustapha Kant{\\'{e}} and\n                  Andrea Marino and\n                  Takeaki Uno and\n                  Kunihiro Wasa},\n  editor       = {Peter Rossmanith and\n                  Pinar Heggernes and\n                  Joost{-}Pieter Katoen},\n  title        = {Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner\n                  Trees in Graphs},\n  booktitle    = {44th International Symposium on Mathematical Foundations of Computer\n                  Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},\n  series       = {LIPIcs},\n  volume       = {138},\n  pages        = {73:1--73:14},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2019},\n  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2019.73},\n  doi          = {10.4230/LIPICS.MFCS.2019.73},\n  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/mfcs/ConteGKMUW19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Degrees of Separation and Diameter in Large Graphs.\n \n \n \n \n\n\n \n Crescenzi, P.; and Marino, A.\n\n\n \n\n\n\n In Sakr, S.; and Zomaya, A. Y., editor(s), Encyclopedia of Big Data Technologies. Springer, 2019.\n \n\n\n\n
\n\n\n\n \n \n \"DegreesPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@incollection{DBLP:reference/bdt/CrescenziM19,\n  author       = {Pierluigi Crescenzi and\n                  Andrea Marino},\n  editor       = {Sherif Sakr and\n                  Albert Y. Zomaya},\n  title        = {Degrees of Separation and Diameter in Large Graphs},\n  booktitle    = {Encyclopedia of Big Data Technologies},\n  publisher    = {Springer},\n  year         = {2019},\n  url          = {https://doi.org/10.1007/978-3-319-63962-8\\_59-1},\n  doi          = {10.1007/978-3-319-63962-8\\_59-1},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/reference/bdt/CrescenziM19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proximity Search For Maximal Subgraph Enumeration.\n \n \n \n \n\n\n \n Conte, A.; Marino, A.; Grossi, R.; Uno, T.; and Versari, L.\n\n\n \n\n\n\n CoRR, abs/1912.13446. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"ProximityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-1912-13446,\n  author       = {Alessio Conte and\n                  Andrea Marino and\n                  Roberto Grossi and\n                  Takeaki Uno and\n                  Luca Versari},\n  title        = {Proximity Search For Maximal Subgraph Enumeration},\n  journal      = {CoRR},\n  volume       = {abs/1912.13446},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1912.13446},\n  eprinttype    = {arXiv},\n  eprint       = {1912.13446},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1912-13446.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (12)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Efficient enumeration of graph orientations with sources.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; and Rizzi, R.\n\n\n \n\n\n\n Discret. Appl. Math., 246: 22–37. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/dam/ConteGMR18,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Romeo Rizzi},\n  title        = {Efficient enumeration of graph orientations with sources},\n  journal      = {Discret. Appl. Math.},\n  volume       = {246},\n  pages        = {22--37},\n  year         = {2018},\n  url          = {https://doi.org/10.1016/j.dam.2017.08.002},\n  doi          = {10.1016/J.DAM.2017.08.002},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/dam/ConteGMR18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Data-driven analysis of Bitcoin properties: exploiting the users graph.\n \n \n \n \n\n\n \n Maesa, D. D. F.; Marino, A.; and Ricci, L.\n\n\n \n\n\n\n Int. J. Data Sci. Anal., 6(1): 63–80. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"Data-drivenPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ijdsa/MaesaMR18,\n  author       = {Damiano Di Francesco Maesa and\n                  Andrea Marino and\n                  Laura Ricci},\n  title        = {Data-driven analysis of Bitcoin properties: exploiting the users graph},\n  journal      = {Int. J. Data Sci. Anal.},\n  volume       = {6},\n  number       = {1},\n  pages        = {63--80},\n  year         = {2018},\n  url          = {https://doi.org/10.1007/s41060-017-0074-x},\n  doi          = {10.1007/S41060-017-0074-X},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/ijdsa/MaesaMR18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n BUbiNG: Massive Crawling for the Masses.\n \n \n \n \n\n\n \n Boldi, P.; Marino, A.; Santini, M.; and Vigna, S.\n\n\n \n\n\n\n ACM Trans. Web, 12(2): 12:1–12:26. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"BUbiNG:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tweb/BoldiMSV18,\n  author       = {Paolo Boldi and\n                  Andrea Marino and\n                  Massimo Santini and\n                  Sebastiano Vigna},\n  title        = {BUbiNG: Massive Crawling for the Masses},\n  journal      = {{ACM} Trans. Web},\n  volume       = {12},\n  number       = {2},\n  pages        = {12:1--12:26},\n  year         = {2018},\n  url          = {https://doi.org/10.1145/3160017},\n  doi          = {10.1145/3160017},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tweb/BoldiMSV18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; and Versari, L.\n\n\n \n\n\n\n In Wang, L.; and Zhu, D., editor(s), Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings, volume 10976, of Lecture Notes in Computer Science, pages 328–340, 2018. Springer\n \n\n\n\n
\n\n\n\n \n \n \"FindingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/cocoon/ConteGMV18,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Luca Versari},\n  editor       = {Lusheng Wang and\n                  Daming Zhu},\n  title        = {Finding Maximal Common Subgraphs via Time-Space Efficient Reverse\n                  Search},\n  booktitle    = {Computing and Combinatorics - 24th International Conference, {COCOON}\n                  2018, Qing Dao, China, July 2-4, 2018, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {10976},\n  pages        = {328--340},\n  publisher    = {Springer},\n  year         = {2018},\n  url          = {https://doi.org/10.1007/978-3-319-94776-1\\_28},\n  doi          = {10.1007/978-3-319-94776-1\\_28},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/cocoon/ConteGMV18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Graph Structure of Bitcoin.\n \n \n \n \n\n\n \n Maesa, D. D. F.; Marino, A.; and Ricci, L.\n\n\n \n\n\n\n In Aiello, L. M.; Cherifi, C.; Cherifi, H.; Lambiotte, R.; Lió, P.; and Rocha, L. M., editor(s), Complex Networks and Their Applications VII - Volume 2 Proceedings The 7th International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2018, volume 813, of Studies in Computational Intelligence, pages 547–558, 2018. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/complexnetworks/MaesaMR18,\n  author       = {Damiano Di Francesco Maesa and\n                  Andrea Marino and\n                  Laura Ricci},\n  editor       = {Luca Maria Aiello and\n                  Chantal Cherifi and\n                  Hocine Cherifi and\n                  Renaud Lambiotte and\n                  Pietro Li{\\'{o}} and\n                  Luis M. Rocha},\n  title        = {The Graph Structure of Bitcoin},\n  booktitle    = {Complex Networks and Their Applications {VII} - Volume 2 Proceedings\n                  The 7th International Conference on Complex Networks and Their Applications\n                  {COMPLEX} {NETWORKS} 2018},\n  series       = {Studies in Computational Intelligence},\n  volume       = {813},\n  pages        = {547--558},\n  publisher    = {Springer},\n  year         = {2018},\n  url          = {https://doi.org/10.1007/978-3-030-05414-4\\_44},\n  doi          = {10.1007/978-3-030-05414-4\\_44},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/complexnetworks/MaesaMR18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Discovering $}k{$-Trusses in Large-Scale Networks.\n \n \n \n \n\n\n \n Conte, A.; Sensi, D. D.; Grossi, R.; Marino, A.; and Versari, L.\n\n\n \n\n\n\n In 2018 IEEE High Performance Extreme Computing Conference, HPEC 2018, Waltham, MA, USA, September 25-27, 2018, pages 1–6, 2018. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"DiscoveringPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/hpec/ConteSGMV18,\n  author       = {Alessio Conte and\n                  Daniele De Sensi and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Luca Versari},\n  title        = {Discovering {\\textdollar}k{\\textdollar}-Trusses in Large-Scale Networks},\n  booktitle    = {2018 {IEEE} High Performance Extreme Computing Conference, {HPEC}\n                  2018, Waltham, MA, USA, September 25-27, 2018},\n  pages        = {1--6},\n  publisher    = {{IEEE}},\n  year         = {2018},\n  url          = {https://doi.org/10.1109/HPEC.2018.8547735},\n  doi          = {10.1109/HPEC.2018.8547735},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/hpec/ConteSGMV18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes.\n \n \n \n \n\n\n \n Conte, A.; Matteis, T. D.; Sensi, D. D.; Grossi, R.; Marino, A.; and Versari, L.\n\n\n \n\n\n\n In Guo, Y.; and Farooq, F., editor(s), Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2018, London, UK, August 19-23, 2018, pages 1272–1281, 2018. ACM\n \n\n\n\n
\n\n\n\n \n \n \"D2K:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/kdd/ConteMSGMV18,\n  author       = {Alessio Conte and\n                  Tiziano De Matteis and\n                  Daniele De Sensi and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Luca Versari},\n  editor       = {Yike Guo and\n                  Faisal Farooq},\n  title        = {{D2K:} Scalable Community Detection in Massive Networks via Small-Diameter\n                  k-Plexes},\n  booktitle    = {Proceedings of the 24th {ACM} {SIGKDD} International Conference on\n                  Knowledge Discovery {\\&} Data Mining, {KDD} 2018, London, UK, August\n                  19-23, 2018},\n  pages        = {1272--1281},\n  publisher    = {{ACM}},\n  year         = {2018},\n  url          = {https://doi.org/10.1145/3219819.3220093},\n  doi          = {10.1145/3219819.3220093},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/kdd/ConteMSGMV18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Node Similarity with q -Grams for Real-World Labeled Networks.\n \n \n \n \n\n\n \n Conte, A.; Ferraro, G.; Grossi, R.; Marino, A.; Sadakane, K.; and Uno, T.\n\n\n \n\n\n\n In Guo, Y.; and Farooq, F., editor(s), Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2018, London, UK, August 19-23, 2018, pages 1282–1291, 2018. ACM\n \n\n\n\n
\n\n\n\n \n \n \"NodePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/kdd/ConteFGMSU18,\n  author       = {Alessio Conte and\n                  Gaspare Ferraro and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Kunihiko Sadakane and\n                  Takeaki Uno},\n  editor       = {Yike Guo and\n                  Faisal Farooq},\n  title        = {Node Similarity with q -Grams for Real-World Labeled Networks},\n  booktitle    = {Proceedings of the 24th {ACM} {SIGKDD} International Conference on\n                  Knowledge Discovery {\\&} Data Mining, {KDD} 2018, London, UK, August\n                  19-23, 2018},\n  pages        = {1282--1291},\n  publisher    = {{ACM}},\n  year         = {2018},\n  url          = {https://doi.org/10.1145/3219819.3220085},\n  doi          = {10.1145/3219819.3220085},\n  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/kdd/ConteFGMSU18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient Algorithms for Listing k Disjoint st-Paths in Graphs.\n \n \n \n \n\n\n \n Grossi, R.; Marino, A.; and Versari, L.\n\n\n \n\n\n\n In Bender, M. A.; Farach-Colton, M.; and Mosteiro, M. A., editor(s), LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings, volume 10807, of Lecture Notes in Computer Science, pages 544–557, 2018. Springer\n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/latin/GrossiMV18,\n  author       = {Roberto Grossi and\n                  Andrea Marino and\n                  Luca Versari},\n  editor       = {Michael A. Bender and\n                  Martin Farach{-}Colton and\n                  Miguel A. Mosteiro},\n  title        = {Efficient Algorithms for Listing k Disjoint st-Paths in Graphs},\n  booktitle    = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,\n                  Buenos Aires, Argentina, April 16-19, 2018, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {10807},\n  pages        = {544--557},\n  publisher    = {Springer},\n  year         = {2018},\n  url          = {https://doi.org/10.1007/978-3-319-77404-6\\_40},\n  doi          = {10.1007/978-3-319-77404-6\\_40},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/latin/GrossiMV18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Listing Subgraphs by Cartesian Decomposition.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; Rizzi, R.; and Versari, L.\n\n\n \n\n\n\n In Potapov, I.; Spirakis, P. G.; and Worrell, J., editor(s), 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, volume 117, of LIPIcs, pages 84:1–84:16, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"ListingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/mfcs/ConteGMRV18,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Romeo Rizzi and\n                  Luca Versari},\n  editor       = {Igor Potapov and\n                  Paul G. Spirakis and\n                  James Worrell},\n  title        = {Listing Subgraphs by Cartesian Decomposition},\n  booktitle    = {43rd International Symposium on Mathematical Foundations of Computer\n                  Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},\n  series       = {LIPIcs},\n  volume       = {117},\n  pages        = {84:1--84:16},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2018},\n  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2018.84},\n  doi          = {10.4230/LIPICS.MFCS.2018.84},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/mfcs/ConteGMRV18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; Rizzi, R.; Uno, T.; and Versari, L.\n\n\n \n\n\n\n In Brandstädt, A.; Köhler, E.; and Meer, K., editor(s), Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings, volume 11159, of Lecture Notes in Computer Science, pages 100–110, 2018. Springer\n \n\n\n\n
\n\n\n\n \n \n \"TightPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/wg/ConteGMRUV18,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Romeo Rizzi and\n                  Takeaki Uno and\n                  Luca Versari},\n  editor       = {Andreas Brandst{\\"{a}}dt and\n                  Ekkehard K{\\"{o}}hler and\n                  Klaus Meer},\n  title        = {Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts},\n  booktitle    = {Graph-Theoretic Concepts in Computer Science - 44th International\n                  Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {11159},\n  pages        = {100--110},\n  publisher    = {Springer},\n  year         = {2018},\n  url          = {https://doi.org/10.1007/978-3-030-00256-5\\_9},\n  doi          = {10.1007/978-3-030-00256-5\\_9},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/wg/ConteGMRUV18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Listing Maximal Subgraphs in Strongly Accessible Set Systems.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; and Versari, L.\n\n\n \n\n\n\n CoRR, abs/1803.03659. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"ListingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-1803-03659,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Luca Versari},\n  title        = {Listing Maximal Subgraphs in Strongly Accessible Set Systems},\n  journal      = {CoRR},\n  volume       = {abs/1803.03659},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1803.03659},\n  eprinttype    = {arXiv},\n  eprint       = {1803.03659},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1803-03659.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Detecting artificial behaviours in the Bitcoin users graph.\n \n \n \n \n\n\n \n Maesa, D. D. F.; Marino, A.; and Ricci, L.\n\n\n \n\n\n\n Online Soc. Networks Media, 3-4: 63–74. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"DetectingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/osnm/MaesaMR17,\n  author       = {Damiano Di Francesco Maesa and\n                  Andrea Marino and\n                  Laura Ricci},\n  title        = {Detecting artificial behaviours in the Bitcoin users graph},\n  journal      = {Online Soc. Networks Media},\n  volume       = {3-4},\n  pages        = {63--74},\n  year         = {2017},\n  url          = {https://doi.org/10.1016/j.osnem.2017.10.006},\n  doi          = {10.1016/J.OSNEM.2017.10.006},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/osnm/MaesaMR17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Fast Algorithm for Large Common Connected Induced Subgraphs.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; Tattini, L.; and Versari, L.\n\n\n \n\n\n\n In Figueiredo, D.; Martín-Vide, C.; Pratas, D.; and Vega-Rodríguez, M. A., editor(s), Algorithms for Computational Biology - 4th International Conference, AlCoB 2017, Aveiro, Portugal, June 5-6, 2017, Proceedings, volume 10252, of Lecture Notes in Computer Science, pages 62–74, 2017. Springer\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/alcob/ConteGMTV17,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Lorenzo Tattini and\n                  Luca Versari},\n  editor       = {Daniel Figueiredo and\n                  Carlos Mart{\\'{\\i}}n{-}Vide and\n                  Diogo Pratas and\n                  Miguel A. Vega{-}Rodr{\\'{\\i}}guez},\n  title        = {A Fast Algorithm for Large Common Connected Induced Subgraphs},\n  booktitle    = {Algorithms for Computational Biology - 4th International Conference,\n                  AlCoB 2017, Aveiro, Portugal, June 5-6, 2017, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {10252},\n  pages        = {62--74},\n  publisher    = {Springer},\n  year         = {2017},\n  url          = {https://doi.org/10.1007/978-3-319-58163-7\\_4},\n  doi          = {10.1007/978-3-319-58163-7\\_4},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/alcob/ConteGMTV17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Listing Maximal Independent Sets with Minimal Space and Bounded Delay.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; Uno, T.; and Versari, L.\n\n\n \n\n\n\n In Fici, G.; Sciortino, M.; and Venturini, R., editor(s), String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings, volume 10508, of Lecture Notes in Computer Science, pages 144–160, 2017. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ListingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/spire/ConteGMUV17,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Takeaki Uno and\n                  Luca Versari},\n  editor       = {Gabriele Fici and\n                  Marinella Sciortino and\n                  Rossano Venturini},\n  title        = {Listing Maximal Independent Sets with Minimal Space and Bounded Delay},\n  booktitle    = {String Processing and Information Retrieval - 24th International Symposium,\n                  {SPIRE} 2017, Palermo, Italy, September 26-29, 2017, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {10508},\n  pages        = {144--160},\n  publisher    = {Springer},\n  year         = {2017},\n  url          = {https://doi.org/10.1007/978-3-319-67428-5\\_13},\n  doi          = {10.1007/978-3-319-67428-5\\_13},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/spire/ConteGMUV17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computing top-k Closeness Centrality Faster in Unweighted Graphs.\n \n \n \n \n\n\n \n Bergamini, E.; Borassi, M.; Crescenzi, P.; Marino, A.; and Meyerhenke, H.\n\n\n \n\n\n\n CoRR, abs/1704.01077. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"ComputingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/BergaminiBCMM17,\n  author       = {Elisabetta Bergamini and\n                  Michele Borassi and\n                  Pierluigi Crescenzi and\n                  Andrea Marino and\n                  Henning Meyerhenke},\n  title        = {Computing top-k Closeness Centrality Faster in Unweighted Graphs},\n  journal      = {CoRR},\n  volume       = {abs/1704.01077},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1704.01077},\n  eprinttype    = {arXiv},\n  eprint       = {1704.01077},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BergaminiBCMM17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (9)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Using graph distances for named-entity linking.\n \n \n \n \n\n\n \n Blanco, R.; Boldi, P.; and Marino, A.\n\n\n \n\n\n\n Sci. Comput. Program., 130: 24–36. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"UsingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/scp/BlancoBM16,\n  author       = {Roi Blanco and\n                  Paolo Boldi and\n                  Andrea Marino},\n  title        = {Using graph distances for named-entity linking},\n  journal      = {Sci. Comput. Program.},\n  volume       = {130},\n  pages        = {24--36},\n  year         = {2016},\n  url          = {https://doi.org/10.1016/j.scico.2015.10.013},\n  doi          = {10.1016/J.SCICO.2015.10.013},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/scp/BlancoBM16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computing Top-\\emphk Closeness Centrality Faster in Unweighted Graphs.\n \n \n \n \n\n\n \n Bergamini, E.; Borassi, M.; Crescenzi, P.; Marino, A.; and Meyerhenke, H.\n\n\n \n\n\n\n In Goodrich, M. T.; and Mitzenmacher, M., editor(s), Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, pages 68–80, 2016. SIAM\n \n\n\n\n
\n\n\n\n \n \n \"ComputingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/alenex/BergaminiBCMM16,\n  author       = {Elisabetta Bergamini and\n                  Michele Borassi and\n                  Pierluigi Crescenzi and\n                  Andrea Marino and\n                  Henning Meyerhenke},\n  editor       = {Michael T. Goodrich and\n                  Michael Mitzenmacher},\n  title        = {Computing Top-\\emph{k} Closeness Centrality Faster in Unweighted Graphs},\n  booktitle    = {Proceedings of the Eighteenth Workshop on Algorithm Engineering and\n                  Experiments, {ALENEX} 2016, Arlington, Virginia, USA, January 10,\n                  2016},\n  pages        = {68--80},\n  publisher    = {{SIAM}},\n  year         = {2016},\n  url          = {https://doi.org/10.1137/1.9781611974317.6},\n  doi          = {10.1137/1.9781611974317.6},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/alenex/BergaminiBCMM16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An analysis of the Bitcoin users graph: inferring unusual behaviours.\n \n \n \n \n\n\n \n Maesa, D. D. F.; Marino, A.; and Ricci, L.\n\n\n \n\n\n\n In Cherifi, H.; Gaito, S.; Quattrociocchi, W.; and Sala, A., editor(s), Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30 - December 2, 2016, volume 693, of Studies in Computational Intelligence, pages 749–760, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/complexnetworks/MaesaMR16,\n  author       = {Damiano Di Francesco Maesa and\n                  Andrea Marino and\n                  Laura Ricci},\n  editor       = {Hocine Cherifi and\n                  Sabrina Gaito and\n                  Walter Quattrociocchi and\n                  Alessandra Sala},\n  title        = {An analysis of the Bitcoin users graph: inferring unusual behaviours},\n  booktitle    = {Complex Networks {\\&} Their Applications {V} - Proceedings of the\n                  5th International Workshop on Complex Networks and their Applications\n                  {(COMPLEX} {NETWORKS} 2016), Milan, Italy, November 30 - December\n                  2, 2016},\n  series       = {Studies in Computational Intelligence},\n  volume       = {693},\n  pages        = {749--760},\n  publisher    = {Springer},\n  year         = {2016},\n  url          = {https://doi.org/10.1007/978-3-319-50901-3\\_59},\n  doi          = {10.1007/978-3-319-50901-3\\_59},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/complexnetworks/MaesaMR16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph.\n \n \n \n \n\n\n \n Maesa, D. D. F.; Marino, A.; and Ricci, L.\n\n\n \n\n\n\n In 2016 IEEE International Conference on Data Science and Advanced Analytics, DSAA 2016, Montreal, QC, Canada, October 17-19, 2016, pages 537–546, 2016. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"UncoveringPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/dsaa/MaesaMR16,\n  author       = {Damiano Di Francesco Maesa and\n                  Andrea Marino and\n                  Laura Ricci},\n  title        = {Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph},\n  booktitle    = {2016 {IEEE} International Conference on Data Science and Advanced\n                  Analytics, {DSAA} 2016, Montreal, QC, Canada, October 17-19, 2016},\n  pages        = {537--546},\n  publisher    = {{IEEE}},\n  year         = {2016},\n  url          = {https://doi.org/10.1109/DSAA.2016.52},\n  doi          = {10.1109/DSAA.2016.52},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/dsaa/MaesaMR16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; and Versari, L.\n\n\n \n\n\n\n In Chatzigiannakis, I.; Mitzenmacher, M.; Rabani, Y.; and Sangiorgi, D., editor(s), 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, volume 55, of LIPIcs, pages 148:1–148:15, 2016. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"Sublinear-SpacePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/icalp/ConteGMV16,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Luca Versari},\n  editor       = {Ioannis Chatzigiannakis and\n                  Michael Mitzenmacher and\n                  Yuval Rabani and\n                  Davide Sangiorgi},\n  title        = {Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics:\n                  Maximal Cliques},\n  booktitle    = {43rd International Colloquium on Automata, Languages, and Programming,\n                  {ICALP} 2016, July 11-15, 2016, Rome, Italy},\n  series       = {LIPIcs},\n  volume       = {55},\n  pages        = {148:1--148:15},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2016},\n  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2016.148},\n  doi          = {10.4230/LIPICS.ICALP.2016.148},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icalp/ConteGMV16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Directing Road Networks by Listing Strong Orientations.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; Rizzi, R.; and Versari, L.\n\n\n \n\n\n\n In Mäkinen, V.; Puglisi, S. J.; and Salmela, L., editor(s), Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings, volume 9843, of Lecture Notes in Computer Science, pages 83–95, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n \"DirectingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iwoca/ConteGMRV16,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Romeo Rizzi and\n                  Luca Versari},\n  editor       = {Veli M{\\"{a}}kinen and\n                  Simon J. Puglisi and\n                  Leena Salmela},\n  title        = {Directing Road Networks by Listing Strong Orientations},\n  booktitle    = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,\n                  Helsinki, Finland, August 17-19, 2016, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {9843},\n  pages        = {83--95},\n  publisher    = {Springer},\n  year         = {2016},\n  url          = {https://doi.org/10.1007/978-3-319-44543-4\\_7},\n  doi          = {10.1007/978-3-319-44543-4\\_7},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/iwoca/ConteGMRV16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Listing Acyclic Orientations of Graphs with Single and Multiple Sources.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; and Rizzi, R.\n\n\n \n\n\n\n In Kranakis, E.; Navarro, G.; and Chávez, E., editor(s), LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, volume 9644, of Lecture Notes in Computer Science, pages 319–333, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ListingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/latin/ConteGMR16,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Romeo Rizzi},\n  editor       = {Evangelos Kranakis and\n                  Gonzalo Navarro and\n                  Edgar Ch{\\'{a}}vez},\n  title        = {Listing Acyclic Orientations of Graphs with Single and Multiple Sources},\n  booktitle    = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,\n                  Ensenada, Mexico, April 11-15, 2016, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {9644},\n  pages        = {319--333},\n  publisher    = {Springer},\n  year         = {2016},\n  url          = {https://doi.org/10.1007/978-3-662-49529-2\\_24},\n  doi          = {10.1007/978-3-662-49529-2\\_24},\n  timestamp    = {Wed, 28 Feb 2024 00:16:41 +0100},\n  biburl       = {https://dblp.org/rec/conf/latin/ConteGMR16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Clique covering of large real-world networks.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; and Marino, A.\n\n\n \n\n\n\n In Ossowski, S., editor(s), Proceedings of the 31st Annual ACM Symposium on Applied Computing, Pisa, Italy, April 4-8, 2016, pages 1134–1139, 2016. ACM\n \n\n\n\n
\n\n\n\n \n \n \"CliquePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/sac/ConteGM16,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino},\n  editor       = {Sascha Ossowski},\n  title        = {Clique covering of large real-world networks},\n  booktitle    = {Proceedings of the 31st Annual {ACM} Symposium on Applied Computing,\n                  Pisa, Italy, April 4-8, 2016},\n  pages        = {1134--1139},\n  publisher    = {{ACM}},\n  year         = {2016},\n  url          = {https://doi.org/10.1145/2851613.2851816},\n  doi          = {10.1145/2851613.2851816},\n  timestamp    = {Sun, 19 Jan 2025 13:12:54 +0100},\n  biburl       = {https://dblp.org/rec/conf/sac/ConteGM16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n BUbiNG: Massive Crawling for the Masses.\n \n \n \n \n\n\n \n Boldi, P.; Marino, A.; Santini, M.; and Vigna, S.\n\n\n \n\n\n\n CoRR, abs/1601.06919. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"BUbiNG:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/BoldiMSV16,\n  author       = {Paolo Boldi and\n                  Andrea Marino and\n                  Massimo Santini and\n                  Sebastiano Vigna},\n  title        = {BUbiNG: Massive Crawling for the Masses},\n  journal      = {CoRR},\n  volume       = {abs/1601.06919},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1601.06919},\n  eprinttype    = {arXiv},\n  eprint       = {1601.06919},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BoldiMSV16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Synchronous context-free grammars and optimal linear parsing strategies.\n \n \n \n \n\n\n \n Crescenzi, P.; Gildea, D.; Marino, A.; Rossi, G.; and Satta, G.\n\n\n \n\n\n\n J. Comput. Syst. Sci., 81(7): 1333–1356. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"SynchronousPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/jcss/CrescenziGMRS15,\n  author       = {Pierluigi Crescenzi and\n                  Daniel Gildea and\n                  Andrea Marino and\n                  Gianluca Rossi and\n                  Giorgio Satta},\n  title        = {Synchronous context-free grammars and optimal linear parsing strategies},\n  journal      = {J. Comput. Syst. Sci.},\n  volume       = {81},\n  number       = {7},\n  pages        = {1333--1356},\n  year         = {2015},\n  url          = {https://doi.org/10.1016/j.jcss.2015.04.003},\n  doi          = {10.1016/J.JCSS.2015.04.003},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/jcss/CrescenziGMRS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games.\n \n \n \n \n\n\n \n Borassi, M.; Crescenzi, P.; Habib, M.; Kosters, W. A.; Marino, A.; and Takes, F. W.\n\n\n \n\n\n\n Theor. Comput. Sci., 586: 59–80. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"FastPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tcs/BorassiCHKMT15,\n  author       = {Michele Borassi and\n                  Pierluigi Crescenzi and\n                  Michel Habib and\n                  Walter A. Kosters and\n                  Andrea Marino and\n                  Frank W. Takes},\n  title        = {Fast diameter and radius BFS-based computation in (weakly connected)\n                  real-world graphs: With an application to the six degrees of separation\n                  games},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {586},\n  pages        = {59--80},\n  year         = {2015},\n  url          = {https://doi.org/10.1016/j.tcs.2015.02.033},\n  doi          = {10.1016/J.TCS.2015.02.033},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tcs/BorassiCHKMT15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Computing the Hyperbolicity of Real-World Graphs.\n \n \n \n \n\n\n \n Borassi, M.; Coudert, D.; Crescenzi, P.; and Marino, A.\n\n\n \n\n\n\n In Bansal, N.; and Finocchi, I., editor(s), Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, volume 9294, of Lecture Notes in Computer Science, pages 215–226, 2015. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/esa/BorassiCCM15,\n  author       = {Michele Borassi and\n                  David Coudert and\n                  Pierluigi Crescenzi and\n                  Andrea Marino},\n  editor       = {Nikhil Bansal and\n                  Irene Finocchi},\n  title        = {On Computing the Hyperbolicity of Real-World Graphs},\n  booktitle    = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,\n                  Greece, September 14-16, 2015, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {9294},\n  pages        = {215--226},\n  publisher    = {Springer},\n  year         = {2015},\n  url          = {https://doi.org/10.1007/978-3-662-48350-3\\_19},\n  doi          = {10.1007/978-3-662-48350-3\\_19},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/esa/BorassiCCM15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Enumerating Cyclic Orientations of a Graph.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; and Rizzi, R.\n\n\n \n\n\n\n In Lipták, Z.; and Smyth, W. F., editor(s), Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers, volume 9538, of Lecture Notes in Computer Science, pages 88–99, 2015. Springer\n \n\n\n\n
\n\n\n\n \n \n \"EnumeratingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/iwoca/ConteGMR15,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Romeo Rizzi},\n  editor       = {Zsuzsanna Lipt{\\'{a}}k and\n                  William F. Smyth},\n  title        = {Enumerating Cyclic Orientations of a Graph},\n  booktitle    = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,\n                  Verona, Italy, October 5-7, 2015, Revised Selected Papers},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {9538},\n  pages        = {88--99},\n  publisher    = {Springer},\n  year         = {2015},\n  url          = {https://doi.org/10.1007/978-3-319-29516-9\\_8},\n  doi          = {10.1007/978-3-319-29516-9\\_8},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/iwoca/ConteGMR15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Enumerating Cyclic Orientations of a Graph.\n \n \n \n \n\n\n \n Conte, A.; Grossi, R.; Marino, A.; and Rizzi, R.\n\n\n \n\n\n\n CoRR, abs/1506.05977. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"EnumeratingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/ConteGMR15,\n  author       = {Alessio Conte and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Romeo Rizzi},\n  title        = {Enumerating Cyclic Orientations of a Graph},\n  journal      = {CoRR},\n  volume       = {abs/1506.05977},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1506.05977},\n  eprinttype    = {arXiv},\n  eprint       = {1506.05977},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/ConteGMR15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Fast and Simple Computation of Top-k Closeness Centralities.\n \n \n \n \n\n\n \n Borassi, M.; Crescenzi, P.; and Marino, A.\n\n\n \n\n\n\n CoRR, abs/1507.01490. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"FastPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/BorassiCM15,\n  author       = {Michele Borassi and\n                  Pierluigi Crescenzi and\n                  Andrea Marino},\n  title        = {Fast and Simple Computation of Top-k Closeness Centralities},\n  journal      = {CoRR},\n  volume       = {abs/1507.01490},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1507.01490},\n  eprinttype    = {arXiv},\n  eprint       = {1507.01490},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BorassiCM15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.\n \n \n \n \n\n\n \n Milreu, P. V.; Klein, C. C.; Cottret, L.; Acuña, V.; Birmelé, E.; Borassi, M.; Junot, C.; Marchetti-Spaccamela, A.; Marino, A.; Stougie, L.; Jourdan, F.; Crescenzi, P.; Lacroix, V.; and Sagot, M.\n\n\n \n\n\n\n Bioinform., 30(1): 61–70. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"TellingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/bioinformatics/MilreuKCABBJMMSJCLS14,\n  author       = {Paulo Vieira Milreu and\n                  Cecilia Coimbra Klein and\n                  Ludovic Cottret and\n                  Vicente Acu{\\~{n}}a and\n                  Etienne Birmel{\\'{e}} and\n                  Michele Borassi and\n                  Christophe Junot and\n                  Alberto Marchetti{-}Spaccamela and\n                  Andrea Marino and\n                  Leen Stougie and\n                  Fabien Jourdan and\n                  Pierluigi Crescenzi and\n                  Vincent Lacroix and\n                  Marie{-}France Sagot},\n  title        = {Telling metabolic stories to explore metabolomics data: a case study\n                  on the yeast response to cadmium exposure},\n  journal      = {Bioinform.},\n  volume       = {30},\n  number       = {1},\n  pages        = {61--70},\n  year         = {2014},\n  url          = {https://doi.org/10.1093/bioinformatics/btt597},\n  doi          = {10.1093/BIOINFORMATICS/BTT597},\n  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/bioinformatics/MilreuKCABBJMMSJCLS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Algorithms for Biological Graphs: Analysis and Enumeration.\n \n \n \n \n\n\n \n Marino, A.\n\n\n \n\n\n\n Bull. EATCS, 114. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"AlgorithmsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/eatcs/Marino14,\n  author       = {Andrea Marino},\n  title        = {Algorithms for Biological Graphs: Analysis and Enumeration},\n  journal      = {Bull. {EATCS}},\n  volume       = {114},\n  year         = {2014},\n  url          = {http://eatcs.org/beatcs/index.php/beatcs/article/view/302},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/eatcs/Marino14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Blind image clustering based on the Normalized Cuts criterion for camera identification.\n \n \n \n \n\n\n \n Amerini, I.; Caldelli, R.; Crescenzi, P.; Mastio, A. D.; and Marino, A.\n\n\n \n\n\n\n Signal Process. Image Commun., 29(8): 831–843. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"BlindPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/spic/AmeriniCCMM14,\n  author       = {Irene Amerini and\n                  Roberto Caldelli and\n                  Pierluigi Crescenzi and\n                  Andrea Del Mastio and\n                  Andrea Marino},\n  title        = {Blind image clustering based on the Normalized Cuts criterion for\n                  camera identification},\n  journal      = {Signal Process. Image Commun.},\n  volume       = {29},\n  number       = {8},\n  pages        = {831--843},\n  year         = {2014},\n  url          = {https://doi.org/10.1016/j.image.2014.07.003},\n  doi          = {10.1016/J.IMAGE.2014.07.003},\n  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/spic/AmeriniCCMM14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.\n \n \n \n \n\n\n \n Borassi, M.; Crescenzi, P.; Habib, M.; Kosters, W. A.; Marino, A.; and Takes, F. W.\n\n\n \n\n\n\n In Ferro, A.; Luccio, F.; and Widmayer, P., editor(s), Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings, volume 8496, of Lecture Notes in Computer Science, pages 52–63, 2014. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/fun/BorassiCHKMT14,\n  author       = {Michele Borassi and\n                  Pierluigi Crescenzi and\n                  Michel Habib and\n                  Walter A. Kosters and\n                  Andrea Marino and\n                  Frank W. Takes},\n  editor       = {Alfredo Ferro and\n                  Fabrizio Luccio and\n                  Peter Widmayer},\n  title        = {On the Solvability of the Six Degrees of Kevin Bacon Game - {A} Faster\n                  Graph Diameter and Radius Computation Method},\n  booktitle    = {Fun with Algorithms - 7th International Conference, {FUN} 2014, Lipari\n                  Island, Sicily, Italy, July 1-3, 2014. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {8496},\n  pages        = {52--63},\n  publisher    = {Springer},\n  year         = {2014},\n  url          = {https://doi.org/10.1007/978-3-319-07890-8\\_5},\n  doi          = {10.1007/978-3-319-07890-8\\_5},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/fun/BorassiCHKMT14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Algorithms for biological graphs: analysis and enumeration.\n \n \n \n \n\n\n \n Marino, A.\n\n\n \n\n\n\n In Bistarelli, S.; and Formisano, A., editor(s), Proceedings of the 15th Italian Conference on Theoretical Computer Science, Perugia, Italy, September 17-19, 2014, volume 1231, of CEUR Workshop Proceedings, pages 15–19, 2014. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"AlgorithmsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/ictcs/Marino14,\n  author       = {Andrea Marino},\n  editor       = {Stefano Bistarelli and\n                  Andrea Formisano},\n  title        = {Algorithms for biological graphs: analysis and enumeration},\n  booktitle    = {Proceedings of the 15th Italian Conference on Theoretical Computer\n                  Science, Perugia, Italy, September 17-19, 2014},\n  series       = {{CEUR} Workshop Proceedings},\n  volume       = {1231},\n  pages        = {15--19},\n  publisher    = {CEUR-WS.org},\n  year         = {2014},\n  url          = {https://ceur-ws.org/Vol-1231/award3.pdf},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ictcs/Marino14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n BUbiNG: massive crawling for the masses.\n \n \n \n \n\n\n \n Boldi, P.; Marino, A.; Santini, M.; and Vigna, S.\n\n\n \n\n\n\n In Chung, C.; Broder, A. Z.; Shim, K.; and Suel, T., editor(s), 23rd International World Wide Web Conference, WWW '14, Seoul, Republic of Korea, April 7-11, 2014, Companion Volume, pages 227–228, 2014. ACM\n \n\n\n\n
\n\n\n\n \n \n \"BUbiNG:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/www/BoldiMSV14,\n  author       = {Paolo Boldi and\n                  Andrea Marino and\n                  Massimo Santini and\n                  Sebastiano Vigna},\n  editor       = {Chin{-}Wan Chung and\n                  Andrei Z. Broder and\n                  Kyuseok Shim and\n                  Torsten Suel},\n  title        = {BUbiNG: massive crawling for the masses},\n  booktitle    = {23rd International World Wide Web Conference, {WWW} '14, Seoul, Republic\n                  of Korea, April 7-11, 2014, Companion Volume},\n  pages        = {227--228},\n  publisher    = {{ACM}},\n  year         = {2014},\n  url          = {https://doi.org/10.1145/2567948.2577304},\n  doi          = {10.1145/2567948.2577304},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/www/BoldiMSV14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Entity-Linking via Graph-Distance Minimization.\n \n \n \n \n\n\n \n Blanco, R.; Boldi, P.; and Marino, A.\n\n\n \n\n\n\n In Bosnacki, D.; Edelkamp, S.; Lluch-Lafuente, A.; and Wijs, A., editor(s), Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering, GRAPHITE 2014, Grenoble, France, 5th April 2014, volume 159, of EPTCS, pages 30–43, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"Entity-LinkingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:journals/corr/BlancoBM14,\n  author       = {Roi Blanco and\n                  Paolo Boldi and\n                  Andrea Marino},\n  editor       = {Dragan Bosnacki and\n                  Stefan Edelkamp and\n                  Alberto Lluch{-}Lafuente and\n                  Anton Wijs},\n  title        = {Entity-Linking via Graph-Distance Minimization},\n  booktitle    = {Proceedings 3rd Workshop on {GRAPH} Inspection and Traversal Engineering,\n                  {GRAPHITE} 2014, Grenoble, France, 5th April 2014},\n  series       = {{EPTCS}},\n  volume       = {159},\n  pages        = {30--43},\n  year         = {2014},\n  url          = {https://doi.org/10.4204/EPTCS.159.4},\n  doi          = {10.4204/EPTCS.159.4},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BlancoBM14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On computing the diameter of real-world undirected graphs.\n \n \n \n \n\n\n \n Crescenzi, P.; Grossi, R.; Habib, M.; Lanzi, L.; and Marino, A.\n\n\n \n\n\n\n Theor. Comput. Sci., 514: 84–95. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tcs/CrescenziGHLM13,\n  author       = {Pilu Crescenzi and\n                  Roberto Grossi and\n                  Michel Habib and\n                  Leonardo Lanzi and\n                  Andrea Marino},\n  title        = {On computing the diameter of real-world undirected graphs},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {514},\n  pages        = {84--95},\n  year         = {2013},\n  url          = {https://doi.org/10.1016/j.tcs.2012.09.018},\n  doi          = {10.1016/J.TCS.2012.09.018},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tcs/CrescenziGHLM13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal Listing of Cycles and st-Paths in Undirected Graphs.\n \n \n \n \n\n\n \n Birmelé, E.; Ferreira, R. A.; Grossi, R.; Marino, A.; Pisanti, N.; Rizzi, R.; and Sacomoto, G.\n\n\n \n\n\n\n In Khanna, S., editor(s), Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pages 1884–1896, 2013. SIAM\n \n\n\n\n
\n\n\n\n \n \n \"OptimalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/soda/BirmeleFGMPRS13,\n  author       = {Etienne Birmel{\\'{e}} and\n                  Rui A. Ferreira and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Nadia Pisanti and\n                  Romeo Rizzi and\n                  Gustavo Sacomoto},\n  editor       = {Sanjeev Khanna},\n  title        = {Optimal Listing of Cycles and st-Paths in Undirected Graphs},\n  booktitle    = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete\n                  Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,\n                  2013},\n  pages        = {1884--1896},\n  publisher    = {{SIAM}},\n  year         = {2013},\n  url          = {https://doi.org/10.1137/1.9781611973105.134},\n  doi          = {10.1137/1.9781611973105.134},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/soda/BirmeleFGMPRS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Telling Stories Fast.\n \n \n \n \n\n\n \n Borassi, M.; Crescenzi, P.; Lacroix, V.; Marino, A.; Sagot, M.; and Milreu, P. V.\n\n\n \n\n\n\n In Bonifaci, V.; Demetrescu, C.; and Marchetti-Spaccamela, A., editor(s), Experimental Algorithms, 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings, volume 7933, of Lecture Notes in Computer Science, pages 200–211, 2013. Springer\n \n\n\n\n
\n\n\n\n \n \n \"TellingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/wea/BorassiCLMSM13,\n  author       = {Michele Borassi and\n                  Pierluigi Crescenzi and\n                  Vincent Lacroix and\n                  Andrea Marino and\n                  Marie{-}France Sagot and\n                  Paulo Vieira Milreu},\n  editor       = {Vincenzo Bonifaci and\n                  Camil Demetrescu and\n                  Alberto Marchetti{-}Spaccamela},\n  title        = {Telling Stories Fast},\n  booktitle    = {Experimental Algorithms, 12th International Symposium, {SEA} 2013,\n                  Rome, Italy, June 5-7, 2013. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {7933},\n  pages        = {200--211},\n  publisher    = {Springer},\n  year         = {2013},\n  url          = {https://doi.org/10.1007/978-3-642-38527-8\\_19},\n  doi          = {10.1007/978-3-642-38527-8\\_19},\n  timestamp    = {Sun, 04 Aug 2024 19:40:14 +0200},\n  biburl       = {https://dblp.org/rec/conf/wea/BorassiCLMSM13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies.\n \n \n \n \n\n\n \n Crescenzi, P.; Gildea, D.; Marino, A.; Rossi, G.; and Satta, G.\n\n\n \n\n\n\n CoRR, abs/1311.6421. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"SynchronousPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/CrescenziGMRS13,\n  author       = {Pierluigi Crescenzi and\n                  Daniel Gildea and\n                  Andrea Marino and\n                  Gianluca Rossi and\n                  Giorgio Satta},\n  title        = {Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies},\n  journal      = {CoRR},\n  volume       = {abs/1311.6421},\n  year         = {2013},\n  url          = {http://arxiv.org/abs/1311.6421},\n  eprinttype    = {arXiv},\n  eprint       = {1311.6421},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/CrescenziGMRS13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Algorithms for biological graphs.\n \n \n \n \n\n\n \n Marino, A.\n\n\n \n\n\n\n Ph.D. Thesis, University of Florence, Italy, 2012.\n \n\n\n\n
\n\n\n\n \n \n \"AlgorithmsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@phdthesis{DBLP:phd/it/Marino12,\n  author       = {Andrea Marino},\n  title        = {Algorithms for biological graphs},\n  school       = {University of Florence, Italy},\n  year         = {2012},\n  url          = {https://opac.bncf.firenze.sbn.it/bncf-prod/resource?uri=BVE0607064},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/phd/it/Marino12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets.\n \n \n \n \n\n\n \n Acuña, V.; Birmelé, E.; Cottret, L.; Crescenzi, P.; Jourdan, F.; Lacroix, V.; Marchetti-Spaccamela, A.; Marino, A.; Milreu, P. V.; Sagot, M.; and Stougie, L.\n\n\n \n\n\n\n Theor. Comput. Sci., 457: 1–9. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"TellingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/tcs/AcunaBCCJLMMMSS12,\n  author       = {Vicente Acu{\\~{n}}a and\n                  Etienne Birmel{\\'{e}} and\n                  Ludovic Cottret and\n                  Pierluigi Crescenzi and\n                  Fabien Jourdan and\n                  Vincent Lacroix and\n                  Alberto Marchetti{-}Spaccamela and\n                  Andrea Marino and\n                  Paulo Vieira Milreu and\n                  Marie{-}France Sagot and\n                  Leen Stougie},\n  title        = {Telling stories: Enumerating maximal directed acyclic graphs with\n                  a constrained set of sources and targets},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {457},\n  pages        = {1--9},\n  year         = {2012},\n  url          = {https://doi.org/10.1016/j.tcs.2012.07.023},\n  doi          = {10.1016/J.TCS.2012.07.023},\n  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tcs/AcunaBCCJLMMMSS12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient Bubble Enumeration in Directed Graphs.\n \n \n \n \n\n\n \n Birmelé, E.; Crescenzi, P.; Ferreira, R. A.; Grossi, R.; Lacroix, V.; Marino, A.; Pisanti, N.; Sacomoto, G. A. T.; and Sagot, M.\n\n\n \n\n\n\n In Calderón-Benavides, L.; González-Caro, C. N.; Chávez, E.; and Ziviani, N., editor(s), String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings, volume 7608, of Lecture Notes in Computer Science, pages 118–129, 2012. Springer\n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/spire/BirmeleCFGLMPSS12,\n  author       = {Etienne Birmel{\\'{e}} and\n                  Pierluigi Crescenzi and\n                  Rui A. Ferreira and\n                  Roberto Grossi and\n                  Vincent Lacroix and\n                  Andrea Marino and\n                  Nadia Pisanti and\n                  Gustavo Akio Tominaga Sacomoto and\n                  Marie{-}France Sagot},\n  editor       = {Liliana Calder{\\'{o}}n{-}Benavides and\n                  Cristina N. Gonz{\\'{a}}lez{-}Caro and\n                  Edgar Ch{\\'{a}}vez and\n                  Nivio Ziviani},\n  title        = {Efficient Bubble Enumeration in Directed Graphs},\n  booktitle    = {String Processing and Information Retrieval - 19th International Symposium,\n                  {SPIRE} 2012, Cartagena de Indias, Colombia, October 21-25, 2012.\n                  Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {7608},\n  pages        = {118--129},\n  publisher    = {Springer},\n  year         = {2012},\n  url          = {https://doi.org/10.1007/978-3-642-34109-0\\_13},\n  doi          = {10.1007/978-3-642-34109-0\\_13},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/spire/BirmeleCFGLMPSS12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Computing the Diameter of Real-World Directed (Weighted) Graphs.\n \n \n \n \n\n\n \n Crescenzi, P.; Grossi, R.; Lanzi, L.; and Marino, A.\n\n\n \n\n\n\n In Klasing, R., editor(s), Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, volume 7276, of Lecture Notes in Computer Science, pages 99–110, 2012. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/wea/CrescenziGLM12,\n  author       = {Pierluigi Crescenzi and\n                  Roberto Grossi and\n                  Leonardo Lanzi and\n                  Andrea Marino},\n  editor       = {Ralf Klasing},\n  title        = {On Computing the Diameter of Real-World Directed (Weighted) Graphs},\n  booktitle    = {Experimental Algorithms - 11th International Symposium, {SEA} 2012,\n                  Bordeaux, France, June 7-9, 2012. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {7276},\n  pages        = {99--110},\n  publisher    = {Springer},\n  year         = {2012},\n  url          = {https://doi.org/10.1007/978-3-642-30850-5\\_10},\n  doi          = {10.1007/978-3-642-30850-5\\_10},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/wea/CrescenziGLM12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Topical clustering of search results.\n \n \n \n \n\n\n \n Scaiella, U.; Ferragina, P.; Marino, A.; and Ciaramita, M.\n\n\n \n\n\n\n In Adar, E.; Teevan, J.; Agichtein, E.; and Maarek, Y., editor(s), Proceedings of the Fifth International Conference on Web Search and Web Data Mining, WSDM 2012, Seattle, WA, USA, February 8-12, 2012, pages 223–232, 2012. ACM\n \n\n\n\n
\n\n\n\n \n \n \"TopicalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/wsdm/ScaiellaFMC12,\n  author       = {Ugo Scaiella and\n                  Paolo Ferragina and\n                  Andrea Marino and\n                  Massimiliano Ciaramita},\n  editor       = {Eytan Adar and\n                  Jaime Teevan and\n                  Eugene Agichtein and\n                  Yoelle Maarek},\n  title        = {Topical clustering of search results},\n  booktitle    = {Proceedings of the Fifth International Conference on Web Search and\n                  Web Data Mining, {WSDM} 2012, Seattle, WA, USA, February 8-12, 2012},\n  pages        = {223--232},\n  publisher    = {{ACM}},\n  year         = {2012},\n  url          = {https://doi.org/10.1145/2124295.2124324},\n  doi          = {10.1145/2124295.2124324},\n  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/wsdm/ScaiellaFMC12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal Listing of Cycles and st-Paths in Undirected Graphs.\n \n \n \n \n\n\n \n Birmelé, E.; Ferreira, R. A.; Grossi, R.; Marino, A.; Pisanti, N.; Rizzi, R.; Sacomoto, G. A. T.; and Sagot, M.\n\n\n \n\n\n\n CoRR, abs/1205.2766. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"OptimalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/corr/abs-1205-2766,\n  author       = {Etienne Birmel{\\'{e}} and\n                  Rui A. Ferreira and\n                  Roberto Grossi and\n                  Andrea Marino and\n                  Nadia Pisanti and\n                  Romeo Rizzi and\n                  Gustavo Akio Tominaga Sacomoto and\n                  Marie{-}France Sagot},\n  title        = {Optimal Listing of Cycles and st-Paths in Undirected Graphs},\n  journal      = {CoRR},\n  volume       = {abs/1205.2766},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1205.2766},\n  eprinttype    = {arXiv},\n  eprint       = {1205.2766},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1205-2766.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Smooth movement and Manhattan path based Random Waypoint mobility.\n \n \n \n \n\n\n \n Crescenzi, P.; Ianni, M. D.; Marino, A.; Merlini, D.; Rossi, G.; and Vocca, P.\n\n\n \n\n\n\n Inf. Process. Lett., 111(5): 239–246. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"SmoothPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DBLP:journals/ipl/CrescenziIMMRV11,\n  author       = {Pilu Crescenzi and\n                  Miriam Di Ianni and\n                  Andrea Marino and\n                  Donatella Merlini and\n                  Gianluca Rossi and\n                  Paola Vocca},\n  title        = {Smooth movement and Manhattan path based Random Waypoint mobility},\n  journal      = {Inf. Process. Lett.},\n  volume       = {111},\n  number       = {5},\n  pages        = {239--246},\n  year         = {2011},\n  url          = {https://doi.org/10.1016/j.ipl.2010.12.009},\n  doi          = {10.1016/J.IPL.2010.12.009},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/ipl/CrescenziIMMRV11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems.\n \n \n \n \n\n\n \n Crescenzi, P.; Gildea, D.; Marino, A.; Rossi, G.; and Satta, G.\n\n\n \n\n\n\n In Lin, D.; Matsumoto, Y.; and Mihalcea, R., editor(s), 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, 2011. The Association for Computer Linguistics\n \n\n\n\n
\n\n\n\n \n \n \"OptimalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/acl/CrescenziGMRS11,\n  author       = {Pierluigi Crescenzi and\n                  Daniel Gildea and\n                  Andrea Marino and\n                  Gianluca Rossi and\n                  Giorgio Satta},\n  editor       = {Dekang Lin and\n                  Yuji Matsumoto and\n                  Rada Mihalcea},\n  title        = {Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting\n                  Systems},\n  booktitle    = {The 49th Annual Meeting of the Association for Computational Linguistics:\n                  Human Language Technologies, Proceedings of the Conference, 19-24\n                  June, 2011, Portland, Oregon, {USA}},\n  pages        = {450--459},\n  publisher    = {The Association for Computer Linguistics},\n  year         = {2011},\n  url          = {https://aclanthology.org/P11-1046/},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/acl/CrescenziGMRS11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.\n \n \n \n \n\n\n \n Crescenzi, P.; Grossi, R.; Lanzi, L.; and Marino, A.\n\n\n \n\n\n\n In Marchetti-Spaccamela, A.; and Segal, M., editor(s), Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings, volume 6595, of Lecture Notes in Computer Science, pages 92–103, 2011. Springer\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/tapas/CrescenziGLM11,\n  author       = {Pierluigi Crescenzi and\n                  Roberto Grossi and\n                  Leonardo Lanzi and\n                  Andrea Marino},\n  editor       = {Alberto Marchetti{-}Spaccamela and\n                  Michael Segal},\n  title        = {A Comparison of Three Algorithms for Approximating the Distance Distribution\n                  in Real-World Graphs},\n  booktitle    = {Theory and Practice of Algorithms in (Computer) Systems - First International\n                  {ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {6595},\n  pages        = {92--103},\n  publisher    = {Springer},\n  year         = {2011},\n  url          = {https://doi.org/10.1007/978-3-642-19754-3\\_11},\n  doi          = {10.1007/978-3-642-19754-3\\_11},\n  timestamp    = {Sun, 04 Aug 2024 19:44:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/tapas/CrescenziGLM11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound.\n \n \n \n \n\n\n \n Crescenzi, P.; Grossi, R.; Imbrenda, C.; Lanzi, L.; and Marino, A.\n\n\n \n\n\n\n In de Berg, M.; and Meyer, U., editor(s), Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I, volume 6346, of Lecture Notes in Computer Science, pages 302–313, 2010. Springer\n \n\n\n\n
\n\n\n\n \n \n \"FindingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/esa/CrescenziGILM10,\n  author       = {Pierluigi Crescenzi and\n                  Roberto Grossi and\n                  Claudio Imbrenda and\n                  Leonardo Lanzi and\n                  Andrea Marino},\n  editor       = {Mark de Berg and\n                  Ulrich Meyer},\n  title        = {Finding the Diameter in Real-World Graphs - Experimentally Turning\n                  a Lower Bound into an Upper Bound},\n  booktitle    = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,\n                  UK, September 6-8, 2010. Proceedings, Part {I}},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {6346},\n  pages        = {302--313},\n  publisher    = {Springer},\n  year         = {2010},\n  url          = {https://doi.org/10.1007/978-3-642-15775-2\\_26},\n  doi          = {10.1007/978-3-642-15775-2\\_26},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/esa/CrescenziGILM10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.\n \n \n \n \n\n\n \n Crescenzi, P.; Ianni, M. D.; Marino, A.; Rossi, G.; and Vocca, P.\n\n\n \n\n\n\n In Kutten, S.; and Zerovnik, J., editor(s), Structural Information and Communication Complexity, 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers, volume 5869, of Lecture Notes in Computer Science, pages 154–166, 2009. Springer\n \n\n\n\n
\n\n\n\n \n \n \"SpatialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DBLP:conf/sirocco/CrescenziIMRV09,\n  author       = {Pilu Crescenzi and\n                  Miriam Di Ianni and\n                  Andrea Marino and\n                  Gianluca Rossi and\n                  Paola Vocca},\n  editor       = {Shay Kutten and\n                  Janez Zerovnik},\n  title        = {Spatial Node Distribution of Manhattan Path Based Random Waypoint\n                  Mobility Models with Applications},\n  booktitle    = {Structural Information and Communication Complexity, 16th International\n                  Colloquium, {SIROCCO} 2009, Piran, Slovenia, May 25-27, 2009, Revised\n                  Selected Papers},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {5869},\n  pages        = {154--166},\n  publisher    = {Springer},\n  year         = {2009},\n  url          = {https://doi.org/10.1007/978-3-642-11476-2\\_13},\n  doi          = {10.1007/978-3-642-11476-2\\_13},\n  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/sirocco/CrescenziIMRV09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);