According to our database1, Pierluigi Crescenzi authored at least 119 papers between 1989 and 2019.
Legend:Book In proceedings Article PhD thesis Other
Degrees of Separation and Diameter in Large Graphs.
Proceedings of the Encyclopedia of Big Data Technologies., 2019
Improving the Betweenness Centrality of a Node by Adding Links.
ACM Journal of Experimental Algorithmics, 2018
An ant-colony based approach for real-time implicit collaborative information seeking.
Inf. Process. Manage., 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
Greedily Improving Our Own Closeness Centrality in a Network.
Rumor spreading in random evolving graphs.
Random Struct. Algorithms, 2016
Electr. Notes Theor. Comput. Sci., 2016
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems.
Electr. Notes Theor. Comput. Sci., 2016
On the complexity of the shortest-path broadcast problem.
Discrete Applied Mathematics, 2016
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016
Core-periphery clustering and collaboration networks.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016
Computing Top-k Closeness Centrality Faster in Unweighted Graphs.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016
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
Synchronous context-free grammars and optimal linear parsing strategies.
J. Comput. Syst. Sci., 2015
MeDuSa: a multi-draft based scaffolder.
EUCALYPT: efficient tree reconciliation enumerator.
Algorithms for Molecular Biology, 2015
Greedily Improving Our Own Centrality in A Network.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015
An Eclipse IDE for Teaching Java-.
Proceedings of the Software Technologies - 10th International Joint Conference, 2015
Java--Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach.
Proceedings of the ICSOFT-PT 2015, 2015
On Computing the Hyperbolicity of Real-World Graphs.
Proceedings of the Algorithms - ESA 2015, 2015
Blind image clustering based on the Normalized Cuts criterion for camera identification.
Sig. Proc.: Image Comm., 2014
Flooding in dynamic graphs with arbitrary degree sequence.
J. Parallel Distrib. Comput., 2014
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.
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
On computing the diameter of real-world undirected graphs.
Theor. Comput. Sci., 2013
Telling Stories Fast.
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
From theory to practice: NP-completeness for every CS student.
Proceedings of the Innovation and Technology in Computer Science Education conference 2013, 2013
Rumor Spreading in Random Evolving Graphs.
Proceedings of the Algorithms - ESA 2013, 2013
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.
Educational Technology & Society, 2012
On Computing the Diameter of Real-World Directed (Weighted) Graphs.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence.
Proceedings of the Distributed Computing - 26th International Symposium, 2012
Efficient Bubble Enumeration in Directed Graphs.
Proceedings of the String Processing and Information Retrieval, 2012
Making turing machines accessible to blind students.
Proceedings of the 43rd ACM technical symposium on Computer science education, 2012
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
Smooth movement and Manhattan path based Random Waypoint mobility.
Inf. Process. Lett., 2011
On two collateral effects of using algorithm visualizations.
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
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems.
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011
Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010
Using AVs to explain NP-completeness.
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
Theory Comput. Syst., 2009
Adding Test Generation to the Teaching Machine.
Integrating test generation functionality into the Teaching Machine environment.
Electr. Notes Theor. Comput. Sci., 2009
On the connectivity of Bluetooth-based ad hoc networks.
Concurrency and Computation: Practice and Experience, 2009
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.
Proceedings of the Structural Information and Communication Complexity, 2009
Parsimonious flooding in dynamic graphs.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009
Performance Evaluation of a Chord-Based JXTA Implementation.
Proceedings of the First International Conference on Advances in P2P Systems, 2009
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008
MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks.
Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, 2008
On-line load balancing made simple: Greedy strikes back.
J. Discrete Algorithms, 2007
Fully integrating algorithm visualization into a cs2 course.: a two-year experience.
Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2007
On the Connectivity of Bluetooth-Based Ad Hoc Networks.
Proceedings of the Euro-Par 2007, 2007
Assessing CS1 java skills: a three-year experience.
Proceedings of the 11th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2006
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
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, 2005
Foreword - ACM MONET Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications.
The minimum likely column cover problem.
Inf. Process. Lett., 2004
Optimal covering designs: complexity results and new bounds.
Discrete Applied Mathematics, 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
Search Data Structures for Skewed Strings.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003
C : C++ = JavaMM: Java.
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
Online Load Balancing Made Simple: Greedy Strikes Back.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
On the Hamming distance of constraint satisfaction problems.
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.
On Approximating a Scheduling Problem.
J. Comb. Optim., 2001
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems.
Inf. Comput., 2001
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs.
Proceedings of the STACS 2001, 2001
On Computing Ad-hoc Selective Families.
Proceedings of the Approximation, 2001
Towards a Taxonomy of Network Protocol Visualization Tools.
Proceedings of the Software Visualization, 2001
Reversible Execution and Visualization of Programs with LEONARDO.
J. Vis. Lang. Comput., 2000
On Approximation Scheme Preserving Reducibility and Its Applications.
Theory Comput. Syst., 2000
Text Sparsification via Local Maxima.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000
On-line algorithms for the channel assignment problem in cellular networks.
Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000
Max NP-completeness Made Easy.
Theor. Comput. Sci., 1999
Structure in Approximation Classes.
SIAM J. Comput., 1999
IP Address Lookup Made Fast and Simple.
Proceedings of the Algorithms, 1999
On the Complexity of Approximating Colored-Graph Problems.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999
Strictly-upward Drawings of Ordered Search Trees.
Theor. Comput. Sci., 1998
How to find the best approximation results.
SIGACT News, 1998
On the Complexity of Protein Folding.
Journal of Computational Biology, 1998
Linear area upward drawings of AVL trees.
Comput. Geom., 1998
On the Complexity of Protein Folding (Extended Abstract).
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
On the complexity of protein folding (abstract).
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998
MAX NP-Completeness Made Easy
Electronic Colloquium on Computational Complexity (ECCC), 1997
Approximation on the Web: A Compendium of NP Optimization Problems.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997
Minimum-Area h-v Drawings of Complete Binary Trees.
Proceedings of the Graph Drawing, 5th International Symposium, 1997
A Short Guide to Approximation Preserving Reductions.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997
On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem.
Structure in Approximation Classes
Electronic Colloquium on Computational Complexity (ECCC), 1996
Upward Drawings of Search Trees (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996
Parallel approximation of optimization problems.
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
Reversible Simulation of Space-Bounded Computations.
Theor. Comput. Sci., 1995
Approximate Solution of NP Optimization Problems.
Theor. Comput. Sci., 1995
Max Sat and Min Set Cover Approximation Algorithms are P-Complete.
Parallel Processing Letters, 1995
Parallel Simulated Annealing for Shape Detection.
Computer Vision and Image Understanding, 1995
The Parallel Complexity of Approximating the High Degree Subgraph Problem.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
Structure in Approximation Classes (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994
Optimal-Area Upward Drawings of AVL Trees.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
On Approximation Scheme Preserving Reducability and Its Applications.
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
A Note on the Descriptive Complexity of Maximization.
Inf. Process. Lett., 1993
Average Measure, Descriptive Complexity and Approximation of Maximization Problems.
Int. J. Found. Comput. Sci., 1993
Sperner's Lemma and Robust Machines.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993
A Uniform Approach to Define Complexity Classes.
Theor. Comput. Sci., 1992
A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees.
Comput. Geom., 1992
Completeness in Approximation Classes
Inf. Comput., August, 1991
A Note on the Approximation of the MAX CLIQUE Problem.
Inf. Process. Lett., 1991
Minimum-Delay Schedules in Layered Networks.
Acta Inf., 1991
Complexity Classes and Sparse Oracles.
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991
Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems.
Inf. Process. Lett., 1990
Deadlock Prediction in the Case of Dynamic Routing.
Int. J. Found. Comput. Sci., 1990
Completeness in Approximation Classes.
Proceedings of the Fundamentals of Computation Theory, 1989