Pierluigi Crescenzi
Orcid: 0000-0001-8789-3195Affiliations:
- Gran Sasso Science Institute, L'Aquila, Italy
- University of Florence, Italy (former)
According to our database1,
Pierluigi Crescenzi
authored at least 141 papers
between 1990 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on scopus.com
-
on gssi.it
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2023
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks.
Networks, March, 2023
Proceedings of the Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, 2023
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs.
CoRR, 2023
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023
Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution.
Proceedings of the Structural Information and Communication Complexity, 2023
2022
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Inf. Process. Lett., 2021
CoRR, 2021
CoRR, 2021
2020
Algorithms, 2020
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
Proceedings of the 39th IEEE Conference on Computer Communications, 2020
A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs.
Proceedings of the ICETC'20: 12th International Conference on Education Technology and Computers, 2020
2019
Proceedings of the Encyclopedia of Big Data Technologies., 2019
ACM Trans. Knowl. Discov. Data, 2019
Algorithms, 2019
Proceedings of the 33rd International Symposium on Distributed Computing, 2019
2018
ACM J. Exp. Algorithmics, 2018
2017
An ant-colony based approach for real-time implicit collaborative information seeking.
Inf. Process. Manag., 2017
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2016
ACM Trans. Knowl. Discov. Data, 2016
Proceedings of the 8th International Conference on Fun with Algorithms, 2016
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016
2015
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games.
Theor. Comput. Sci., 2015
J. Comput. Syst. Sci., 2015
Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015
Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015
Proceedings of the Software Technologies - 10th International Joint Conference, 2015
Proceedings of the ICSOFT-PT 2015, 2015
Proceedings of the Algorithms - ESA 2015, 2015
2014
Blind image clustering based on the Normalized Cuts criterion for camera identification.
Signal Process. Image Commun., 2014
J. Parallel Distributed Comput., 2014
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.
Bioinform., 2014
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014
2013
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013
Requirements and design strategies for open source interactive computer science eBooks.
Proceedings of the ITiCSE working group reports conference on Innovation and technology in computer science education-working group reports, 2013
Proceedings of the Innovation and Technology in Computer Science Education conference 2013, 2013
Proceedings of the Algorithms - ESA 2013, 2013
2012
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets.
Theor. Comput. Sci., 2012
Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course.
J. Educ. Technol. Soc., 2012
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
Proceedings of the Distributed Computing - 26th International Symposium, 2012
Proceedings of the String Processing and Information Retrieval, 2012
Proceedings of the 43rd ACM technical symposium on Computer science education, 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
2011
Inf. Process. Lett., 2011
Br. J. Educ. Technol., 2011
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011
2010
Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010
Proceedings of the 2010 ITiCSE working group reports, 2010
Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2010
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound.
Proceedings of the Algorithms, 2010
2009
Concurr. Comput. Pract. Exp., 2009
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.
Proceedings of the Structural Information and Communication Complexity, 2009
Proceedings of the First International Conference on Advances in P2P Systems, 2009
2008
Proceedings of the Fifth Program Visualization Workshop, 2008
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008
Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, 2008
2007
J. Discrete Algorithms, 2007
Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2007
Proceedings of the Euro-Par 2007, 2007
2006
Proceedings of the 11th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2006
2005
NetPrIDE an integrated environment for developing and visualizing computer network protocols.
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, 2005
2004
Foreword - ACM MONET Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications.
Mob. Networks Appl., 2004
Discret. Appl. Math., 2004
Discret. Appl. Math., 2004
An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses.
Proceedings of the IEEE International Conference on Advanced Learning Technologies, 2004
2003
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003
Proceedings of the 2nd International Symposium on Principles and Practice of Programming in Java, 2003
A tool to develop electronic course books based on WWW technologies, resources and usability criteria.
Proceedings of the 8th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2003
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
2002
Theor. Comput. Sci., 2002
A note on the spatiality degree of graphs.
Ars Comb., 2002
Development of an ECB on Computer Networks Based on WWW Technologies, Resources and Usability Criteria.
Proceedings of the International Conference on Computers in Education, 2002
2001
Inf. Comput., 2001
Proceedings of the STACS 2001, 2001
Proceedings of the Software Visualization, 2001
2000
J. Vis. Lang. Comput., 2000
Theory Comput. Syst., 2000
1999
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999
Complexity and approximation: combinatorial optimization problems and their approximability properties.
Springer, ISBN: 3540654313, 1999
1998
Theor. Comput. Sci., 1998
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998
1997
LEONARDO: a software visualization system.
Proceedings of the Workshop on Algorithm Engineering, 1997
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997
Proceedings of the Graph Drawing, 5th International Symposium, 1997
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997
1996
RAIRO Theor. Informatics Appl., 1996
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996
Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996
To Weight or Not to Weight: Where is the Question?
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996
1995
Parallel Process. Lett., 1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1994
Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994
Introduction to the theory of complexity.
Prentice Hall international series in computer science, Prentice Hall, ISBN: 978-0-13-915380-8, 1994
1993
Int. J. Found. Comput. Sci., 1993
1992
Comput. Geom., 1992
1991
1990
Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems.
Inf. Process. Lett., 1990
Int. J. Found. Comput. Sci., 1990