Skip to main content
SpringerLink
Log in

Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution

  • Conference paper
  • First Online:
Structural Information and Communication Complexity (SIROCCO 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13892))

Abstract

In this paper, we study the temporal evolution of SIROCCO and of other sixteen theoretical computer science conferences. Our goal is to try to understand the evolution of these conferences and to answer several different research questions, related to the number of authors, number of papers, size of collaborations, sex inclusion, research topics, network characteristics, and author centrality. The tentative answer to these questions is given by performing a comparative analysis between the entire set of conferences. Even though the paper focuses on SIROCCO and on a specific set of theoretical computer science conferences, the software used to perform our analysis can be easily used to perform similar analysis in the case of conferences in different computer science research areas.

P. Crescenzi—Part of this work has been done while visiting COATI, INRIA d’Université Côte d’Azur, Sophia Antipolis, France.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Other similarity indices could have been used, such as, for example, the one proposed in [11]. Even if we did not check it, we believe that the results would be very similar.

References

  1. Aceto, L., Crescenzi, P.: Concur through time. Bullettin EATCS 138(October), 1–9 (2022)

    Google Scholar 

  2. Backstrom, L., Boldi, P., Rosa, M., Ugander, J., Vigna, S.: Four degrees of separation. In: Proceedings of the 4th ACM Conference on Web Science, pp. 33–42. ACM (2012)

    Google Scholar 

  3. Brockwell, P.J., Davis, R.A.: Introduction to Time Series and Forecasting. Springer, New York (2002). https://doi.org/10.1007/0-387-21657-X_8

    Book  MATH  Google Scholar 

  4. Buß, S., Molter, H., Niedermeier, R., Rymar, M.: Algorithmic aspects of temporal betweenness. In: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. ACM (2020)

    Google Scholar 

  5. Creative Commons: Cc0 1.0 universal (cc0 1.0) public domain dedication (2022). https://creativecommons.org/publicdomain/zero/1.0/

  6. Crescenzi, P., Magnien, C., Marino, A.: Finding top-k nodes for temporal closeness in large temporal graphs. Algorithms 13, 211 (2020)

    Article  MathSciNet  Google Scholar 

  7. Demetrescu, C., Finocchi, I., Ribichini, A., Schaerf, M.: On computer science research and its temporal evolution. Scientometrics 127, 4913–4938 (2022)

    Article  Google Scholar 

  8. Dice, L.R.: Measures of the amount of ecologic association between species. Ecology 26(3), 297–302 (1945)

    Article  Google Scholar 

  9. Fein, L.: The role of the university in computers, data processing and related fields. Commun. ACM 2(9), 7–14 (1959)

    Article  Google Scholar 

  10. Jaccard, P.: The distribution of the flora in the alpine zone. New Phytol. 11(2), 37–50 (1912)

    Article  Google Scholar 

  11. Kuhn, M., Wattenhofer, R.: The theoretic center of computer science. SIGACT News 38(4), 54–63 (2007)

    Article  Google Scholar 

  12. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1, Article 2 (2007)

    Google Scholar 

  13. Ley, M.: DBLP - some lessons learned. Proc. VLDB Endow. 2(2), 1493–1500 (2009)

    Article  Google Scholar 

  14. Lotker, Z.: Voting algorithm in the play Julius Caesar. In: IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 848–855 (2015)

    Google Scholar 

  15. Lotker, Z.: Analyzing Narratives in Social Networks. Springer, Berlin (2021). https://doi.org/10.1007/978-3-030-68299-6

    Book  MATH  Google Scholar 

  16. Mathieu, F., Tixeuil, S.: Fun with FUN. In: 11th International Conference on Fun with Algorithms. LIPIcs, vol. 226, pp. 1–13 (2022)

    Google Scholar 

  17. Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239–280 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  18. Milgram, S.: The small world problem. Psychol. Today 1(1), 61–67 (1967)

    Google Scholar 

  19. Oettershagen, L., Mutzel, P., Kriege, N.M.: Temporal walk centrality: ranking nodes in evolving networks. In: The ACM Web Conference. ACM (2022)

    Google Scholar 

  20. Sørensen, T.: A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on danish commons. Kongelige Danske Videnskabernes Selskab 5(4), 1–34 (1948)

    Google Scholar 

  21. The DBLP team: DBLP computer science bibliography: monthly snapshot release, March 2023. https://dblp.org/xml/release/dblp-2023-01-01.xml.gz

  22. Wikipedia contributors: Computer science – Wikipedia, the free encyclopedia (2022). https://en.wikipedia.org/w/index.php?title=Computer_science &oldid=1121763527

Download references

Acknowledgements

This work has been partially supported by the French government through the UCAJEDI. I would like to thank Luca Aceto for proposing me to perform a data and graph mining analysis of ICALP. This was the main motivation for developing the tool which now allows the user to perform a comparative analysis of any set of conferences in the DBLP dataset. I would also like to thanks Daniele Carnevale, with whom I collaborated while computing the community membership algorithm. Finally, I would like to thank Filippos Christodoulou and Oleksandr Skorupskyy, for several discussions at the beginning of this project (during the lectures of the graph mining course at the Gran Sasso Science Institute), and the COATI team for several discussions during my visit at INRIA, Sophia Antipolis.

Author information

Authors and Affiliations

  1. Gran Sasso Science Institute, Viale Francesco Crispi 7, 67100, L’Aquila, Italy

    Pierluigi Crescenzi

Authors
  1. Pierluigi Crescenzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pierluigi Crescenzi .

Editor information

Editors and Affiliations

  1. National Autonomous University of Mexico, Mexico, Mexico

    Sergio Rajsbaum

  2. Gran Sasso Science Institute, L’Aquila, Italy

    Alkida Balliu

  3. Arizona State University, Tempe, AZ, USA

    Joshua J. Daymude

  4. Gran Sasso Science Institute, L’Aquila, Italy

    Dennis Olivetti

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Crescenzi, P. (2023). Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution. In: Rajsbaum, S., Balliu, A., Daymude, J.J., Olivetti, D. (eds) Structural Information and Communication Complexity. SIROCCO 2023. Lecture Notes in Computer Science, vol 13892. Springer, Cham. https://doi.org/10.1007/978-3-031-32733-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-32733-9_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-32732-2

  • Online ISBN: 978-3-031-32733-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation