Pierluigi Crescenzi

Pierluigi Crescenzi's AcademicInfluence.com Rankings

Pierluigi Crescenzi

Computer Science

#3033

World Rank

#3181

Historical Rank

Database

#8267

World Rank

#8629

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Pierluigi Crescenzi Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Pierluigi Crescenzi is a full professor of computer science at the Gran Sasso Science Institute. His research areas include theoretical computer science and computer science education. He has been teaching at Sapienza University of Rome, University of Florence and Université Paris Diderot.

(See a Problem?)

Pierluigi Crescenzi's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Complexity and approximation: combinatorial optimization problems and their approximability properties (1999) (1438)
Complexity and Approximation (1999) (890)
On the Complexity of Protein Folding (1998) (481)
A compendium of NP optimization problems (1994) (441)
Introduction to the theory of complexity (1994) (309)
MeDuSa: a multi-draft based scaffolder (2015) (282)
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs (2001) (229)
A short guide to approximation preserving reductions (1997) (122)
Completeness in Approximation Classes (1989) (116)
Approximate Solution of NP Optimization Problems (1995) (114)
A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees (1992) (113)
Structure in Approximation Classes (1999) (110)
Parsimonious flooding in dynamic graphs (2009) (110)
A Uniform Approach to Define Complexity Classes (1992) (108)
Reversible Execution and Visualization of Programs with LEONARDO (2000) (79)
To Weight or Not to Weight: Where is the Question? (1996) (62)
Rumor spreading in random evolving graphs (2013) (61)
Fully integrating algorithm visualization into a cs2 course.: a two-year experience (2007) (61)
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems (2016) (60)
Approximation on the Web: A Compendium of NP Optimization Problems (1997) (60)
On computing the diameter of real-world undirected graphs (2013) (56)
On the complexity of protein folding (extended abstract) (1998) (52)
IP Address Lookup Made Fast and Simple (1999) (52)
On Approximating a Scheduling Problem (2001) (49)
Greedily Improving Our Own Closeness Centrality in a Network (2016) (48)
Computing top-k Closeness Centrality Faster in Unweighted Graphs (2017) (48)
On Approximation Scheme Preserving Reducibility and Its Applications (1994) (46)
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games (2015) (44)
EUCALYPT: efficient tree reconciliation enumerator (2015) (42)
Blind image clustering based on the Normalized Cuts criterion for camera identification (2014) (42)
Improving the Betweenness Centrality of a Node by Adding Links (2017) (39)
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems (2001) (37)
Parallel Simulated Annealing for Shape Detection (1992) (36)
On-line algorithms for the channel assignment problem in cellular networks (2004) (36)
Requirements and design strategies for open source interactive computer science eBooks (2013) (34)
Greedily Improving Our Own Centrality in A Network (2015) (33)
Complexity classes and sparse oracles (1991) (31)
On the complexity of protein folding (abstract) (1998) (29)
A Note on the Approximation of the MAX CLIQUE Problem (1991) (27)
Into the Square - On the Complexity of Quadratic-Time Solvable Problems (2014) (27)
On Computing the Hyperbolicity of Real-World Graphs (2015) (27)
Optimal-Area Upward Drawings of AVL Trees (1994) (25)
On Computing the Diameter of Real-World Directed (Weighted) Graphs (2012) (24)
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs (2016) (23)
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound (2010) (23)
Sperner's lemma and robust machines (1993) (23)
On Computing Ad-hoc Selective Families (2001) (22)
On the Hamming distance of constraint satisfaction problems (2002) (21)
The Complexity of Optimization Problems (1999) (21)
Linear area upward drawings of AVL trees (1998) (20)
Adapting moodle to better support CS education (2010) (19)
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets (2012) (19)
MAX NP-Completeness Made Easy (1999) (19)
Fast and Simple Computation of Top-k Closeness Centralities (2015) (18)
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure (2013) (18)
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method (2014) (18)
Reversible Simulation of Space-Bounded Computations (1995) (18)
Trade-offs in Distributed Interactive Proofs (2019) (17)
Efficient Bubble Enumeration in Directed Graphs (2012) (17)
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs (2011) (16)
The algorithm animation repository (2002) (16)
LEONARDO: a software visualization system (1997) (15)
On the Complexity of Approximating Colored-Graph Problems (1999) (15)
MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks (2008) (15)
How to find the best approximation results – a follow-up to Garey and Johnson ∗ (1998) (15)
Structure in Approximation Classes (Extended Abstract) (1995) (14)
How to find the best approximation results (1998) (14)
Search Data Structures for Skewed Strings (2003) (13)
Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course (2012) (13)
From theory to practice: NP-completeness for every CS student (2013) (13)
On the connectivity of Bluetooth‐based ad hoc networks (2007) (13)
On-line load balancing made simple: Greedy strikes back (2003) (11)
Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems (1990) (11)
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs (2020) (10)
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks (2021) (10)
On-line algorithms for the channel assignment problem in cellular networks (extended abstract) (2000) (10)
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications (2009) (9)
A tool to develop electronic course books based on WWW technologies, resources and usability criteria (2003) (9)
Flooding in dynamic graphs with arbitrary degree sequence (2012) (9)
C : C++ = JavaMM: Java (2003) (9)
Using AVs to explain NP-completeness (2010) (9)
Minimum-Area h-v Drawings of Complete Binary Trees (1997) (9)
An ant-colony based approach for real-time implicit collaborative information seeking (2017) (8)
Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications (2001) (8)
Assessing CS1 java skills: a three-year experience (2006) (8)
Java-meets eclipse: An IDE for teaching Java following the object-later approach (2015) (8)
An environment for self-assessing Java programming skills in first programming courses (2004) (7)
Strictly-upward Drawings of Ordered Search Trees (1998) (7)
Integrating test generation functionality into the Teaching Machine environment (2008) (7)
On the complexity of the shortest-path broadcast problem (2016) (7)
Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms (2010) (7)
Algorithms and Complexity (2003) (6)
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs (2019) (6)
Optimal covering designs: complexity results and new bounds (2004) (6)
Performance Evaluation of a Chord-Based JXTA Implementation (2009) (6)
Average Measure, Descriptive Complexity and Approximation of Maximization Problems (1993) (5)
Minimum-delay schedules in layered networks (1991) (5)
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems (2011) (5)
Synchronous context-free grammars and optimal linear parsing strategies (2013) (5)
Making turing machines accessible to blind students (2012) (5)
Via Linear-Time Delay Pitch Enumeration (2013) (5)
On Computing the Diameter of (Weighted) Link Streams (2022) (4)
Telling Stories Fast (2013) (4)
Playful Learning for Kids with Special Educational Needs (2018) (4)
JAZ: Java algorithm visualizer. A multi-platform collaborative tool for teaching graph algorithms (1998) (4)
An Eclipse IDE for Teaching Java- (2015) (4)
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks (2005) (3)
Text Sparsification via Local Maxima (2000) (3)
NetPrIDE an integrated environment for developing and visualizing computer network protocols (2005) (3)
Universit a Di Pisa Ip Address Lookup Made Fast and Simple Ip Address Lookup Made Fast and Simple (1999) (3)
An introduction to the theory of computational complexity (1988) (3)
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs (2020) (3)
Simple and Fast Distributed Computation of Betweenness Centrality (2020) (3)
Approximation Preserving Reductions (1999) (2)
Adding Test Generation to the Teaching Machine (2009) (2)
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks (2022) (2)
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings (2008) (2)
The Parallel Complexity of Approximating the High Degree Subgraph Problem (1995) (2)
Towards a Taxonomy of Network Protocol Visualization Tools (2001) (2)
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering (2016) (2)
Fundamental Study Approximate solution of NP optimization problems (1995) (2)
Parallel approximation of optimization problems (1996) (2)
Upward Drawings of Search Trees (Extended Abstract) (1996) (2)
A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs (2020) (2)
On two collateral effects of using algorithm visualizations (2011) (2)
JAZ: Java Algorithm visualiZer. A Multi-Platform Collaborative Tool for Teaching and Testing Graph A (1998) (1)
Metabolic stories: uncovering all possible scenarios for interpreting metabolomics data. (2012) (1)
Giant Components in Random Temporal Graphs (2022) (1)
Planning with Biological Neurons and Synapses (2021) (1)
Development of an ECB on computer networks based on WWW technologies, resources and usability criteria (2002) (1)
Deadlock Prediction in the Case of Dynamic Routing (1990) (1)
Submitted to Siam Journal on Computing Structure in Approximation Classes ? (1995) (1)
Degrees of Separation and Diameter in Large Graphs (2019) (1)
Smooth movement and Manhattan path based Random Waypoint mobility (2011) (1)
Genome analysis MEDUSA : a multi-draft based scaffolder (2015) (1)
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs (2023) (1)
Design Techniques for Approximation Algorithms (1999) (1)
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone (2012) (1)
Max Sat and Min Set Cover Approximation Algorithms are P-Complete (1995) (1)
Calcul distribué simple et efficace de la betweenness (2020) (0)
Proceedings of the second Italian conference on Algorithms and complexity (1994) (0)
A note on the spatiality degree of graphs (2002) (0)
A Note on the Descriptive Complexity of Maximization (1993) (0)
EUCALYPT: efficient tree reconciliation enumerator (2015) (0)
Probabilistic analysis of approximation algorithms (1999) (0)
Opt imal-area upward drawings of AVL trees Extended abstract (0)
North-Holland 10 January 1990 COST a CONS (2001) (0)
Public communication can facilitate low-risk coordination under surveillance (2021) (0)
Telling stories (2015) (0)
Minimum-Area hv Drawings Binary Trees ( Extended Abstract ) of Complete (2005) (0)
New Results - Understanding graph representations (2013) (0)
Foreword – ACM MONET Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications (2004) (0)
Sigil3D: A Crowdsourcing Platform for Interactive 3D Content (2017) (0)
Approximation through Randomization (1999) (0)
Core-periphery clustering and collaboration networks (2016) (0)
NP, PCP and Non-approximability Results (1999) (0)
The minimum likely column cover problem (2004) (0)
Automatic feedback generation in scenario-based e-learning with an application to the healthcare sector (2006) (0)
Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract) (1994) (0)
Minimum-Area h-v Drawings Binary Trees (2005) (0)
Bounded-width Polyno- Mial-size Branching Programs Recognize Exactly Those Languages in Nc a Uniform Approach to Deene Complexity Classes; a Simulation Result for the Auxil (0)
Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings (2007) (0)
Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings (1994) (0)
Input-Dependent and Asymptotic Approximation (1999) (0)
Proceedings of the 4th international conference on Fun with algorithms (2007) (0)
On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem (1996) (0)
On Approx imat ion Scheme Preserving Reducibi l i ty and Its Applications * Extended abstract (0)
The PCP theorem (1999) (0)
The futures of peace: A forum humanum project report (1988) (0)
On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation (2021) (0)
EUCALYPT: efficient tree reconciliation (2015) (0)
A Note on Sperner's Lemma and Robust Machines (0)

This paper list is powered by the following services:

Other Resources About Pierluigi Crescenzi

What Schools Are Affiliated With Pierluigi Crescenzi?

Pierluigi Crescenzi is affiliated with the following schools: