Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDPierluigi Crescenzi
Pilu Crescenzi
Person information
- affiliation: Gran Sasso Science Institute, L'Aquila, Italy
- affiliation (former): University of Florence, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j63]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
:
On computing Pareto optimal paths in weighted time-dependent networks. Inf. Process. Lett. 168: 106086 (2021)- [c69]Marco Calamai, Pierluigi Crescenzi, Andrea Marino:
On Computing the Diameter of (Weighted) Link Streams. SEA 2021: 11:1-11:21 - [i16]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks. CoRR abs/2101.02086 (2021) - [i15]Amos Korman, Pierluigi Crescenzi:
Public Communication can Facilitate Low-Risk Coordination under Surveillance. CoRR abs/2105.02093 (2021) - [i14]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation. CoRR abs/2111.08328 (2021) - [i13]Francesco D'Amore, Daniel Mitropolsky, Pierluigi Crescenzi, Emanuele Natale, Christos H. Papadimitriou:
Planning with Biological Neurons and Synapses. CoRR abs/2112.08186 (2021) - 2020
- [j62]Pierluigi Crescenzi, Clémence Magnien, Andrea Marino:
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. Algorithms 13(9): 211 (2020) - [c68]Gabriele Goretti, Benedetta Terenzi, Elisabetta Cianfanelli, Pierluigi Crescenzi, Carlo Colombo, Enrico Civitelli:
A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs. ICETC 2020: 223-229 - [c67]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Simple and Fast Distributed Computation of Betweenness Centrality. INFOCOM 2020: 337-346 - [c66]Alessio Conte, Pierluigi Crescenzi, Andrea Marino, Giulia Punzi:
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. MFCS 2020: 25:1-25:14 - [i12]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Simple and Fast Distributed Computation of Betweenness Centrality. CoRR abs/2001.08108 (2020)
2010 – 2019
- 2019
- [j61]Pierluigi Crescenzi, Clémence Magnien, Andrea Marino:
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. Algorithms 12(10): 211 (2019) - [j60]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13(5): 53:1-53:40 (2019) - [c65]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Trade-Offs in Distributed Interactive Proofs. DISC 2019: 13:1-13:17 - [r1]Pierluigi Crescenzi, Andrea Marino:
Degrees of Separation and Diameter in Large Graphs. Encyclopedia of Big Data Technologies 2019 - [i11]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Trade-offs in Distributed Interactive Proofs. CoRR abs/1908.03363 (2019) - 2018
- [j59]Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj:
Improving the Betweenness Centrality of a Node by Adding Links. ACM J. Exp. Algorithmics 23 (2018) - 2017
- [j58]Alessio Malizia, Kai A. Olsen, Tommaso Turchi, Pierluigi Crescenzi:
An ant-colony based approach for real-time implicit collaborative information seeking. Inf. Process. Manag. 53(3): 608-623 (2017) - [c64]Michele Borassi, Pierluigi Crescenzi, Luca Trevisan:
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. SODA 2017: 920-939 - [i10]Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj:
Improving the betweenness centrality of a node by adding links. CoRR abs/1702.05284 (2017) - [i9]Andrea Barillari, Daniele Bernardini, Pierluigi Crescenzi:
Sigil3D: A Crowdsourcing Platform for Interactive 3D Content. CoRR abs/1703.02968 (2017) - [i8]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. CoRR abs/1704.01077 (2017) - 2016
- [j57]Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci:
On the complexity of the shortest-path broadcast problem. Discret. Appl. Math. 199: 101-109 (2016) - [j56]Pierluigi Crescenzi, Michele Loreti:
Preface. Electron. Notes Theor. Comput. Sci. 322: 1-2 (2016) - [j55]Michele Borassi, Pierluigi Crescenzi, Michel Habib:
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. Electron. Notes Theor. Comput. Sci. 322: 51-67 (2016) - [j54]Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri:
Rumor spreading in random evolving graphs. Random Struct. Algorithms 48(2): 290-312 (2016) - [j53]Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Greedily Improving Our Own Closeness Centrality in a Network. ACM Trans. Knowl. Discov. Data 11(1): 9:1-9:32 (2016) - [c63]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing Top-k Closeness Centrality Faster in Unweighted Graphs. ALENEX 2016: 68-80 - [c62]Pierluigi Crescenzi, Pierre Fraigniaud, Zvi Lotker, Paolo Penna:
Core-periphery clustering and collaboration networks. ASONAM 2016: 525-528 - [c61]Francesco Cambi, Pierluigi Crescenzi, Linda Pagli:
Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering. FUN 2016: 9:1-9:14 - [i7]Michele Borassi, Pierluigi Crescenzi, Luca Trevisan:
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. CoRR abs/1604.01445 (2016) - 2015
- [j52]Beatrice Donati, Christian Baudet, Blerina Sinaimeri, Pierluigi Crescenzi, Marie-France Sagot:
EUCALYPT: efficient tree reconciliation enumerator. Algorithms Mol. Biol. 10: 3 (2015) - [j51]Emanuele Bosi, Beatrice Donati, Marco Galardini, Sara Brunetti, Marie-France Sagot, Pietro Liò, Pierluigi Crescenzi, Renato Fani, Marco Fondi:
MeDuSa: a multi-draft based scaffolder. Bioinform. 31(15): 2443-2451 (2015) - [j50]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Synchronous context-free grammars and optimal linear parsing strategies. J. Comput. Syst. Sci. 81(7): 1333-1356 (2015) - [j49]Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes:
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. 586: 59-80 (2015) - [c60]Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino:
On Computing the Hyperbolicity of Real-World Graphs. ESA 2015: 215-226 - [c59]Lorenzo Bettini, Pierluigi Crescenzi:
Java--Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach. ICSOFT-PT 2015: 31-42 - [c58]Lorenzo Bettini, Pierluigi Crescenzi:
An Eclipse IDE for Teaching Java-. ICSOFT (Selected Papers) 2015: 63-78 - [c57]Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Greedily Improving Our Own Centrality in A Network. SEA 2015: 43-55 - [i6]Michele Borassi, Pierluigi Crescenzi, Andrea Marino:
Fast and Simple Computation of Top-k Closeness Centralities. CoRR abs/1507.01490 (2015) - 2014
- [j48]Paulo Vieira Milreu, Cecilia Coimbra Klein, Ludovic Cottret, Vicente Acuña, Etienne Birmelé, Michele Borassi, Christophe Junot, Alberto Marchetti-Spaccamela, Andrea Marino, Leen Stougie, Fabien Jourdan, Pierluigi Crescenzi, Vincent Lacroix, Marie-France Sagot:
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. Bioinform. 30(1): 61-70 (2014) - [j47]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Flooding in dynamic graphs with arbitrary degree sequence. J. Parallel Distributed Comput. 74(5): 2433-2437 (2014) - [j46]Irene Amerini, Roberto Caldelli, Pierluigi Crescenzi, Andrea Del Mastio, Andrea Marino:
Blind image clustering based on the Normalized Cuts criterion for camera identification. Signal Process. Image Commun. 29(8): 831-843 (2014) - [c56]Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes:
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. FUN 2014: 52-63 - [i5]Michele Borassi, Pierluigi Crescenzi, Michel Habib:
Into the Square - On the Complexity of Quadratic-Time Solvable Problems. CoRR abs/1407.4972 (2014) - 2013
- [j45]Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino:
On computing the diameter of real-world undirected graphs. Theor. Comput. Sci. 514: 84-95 (2013) - [c55]Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. ESA 2013: 325-336 - [c54]Pierluigi Crescenzi, Emma Enström, Viggo Kann:
From theory to practice: NP-completeness for every CS student. ITiCSE 2013: 16-21 - [c53]Ari Korhonen, Thomas L. Naps, Charles Boisvert, Pilu Crescenzi, Ville Karavirta, Linda Mannila, Bradley Miller, Briana B. Morrison, Susan H. Rodger, Rocky Ross, Clifford A. Shaffer:
Requirements and design strategies for open source interactive computer science eBooks. ITiCSE-WGR 2013: 53-72 - [c52]Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu:
Telling Stories Fast. SEA 2013: 200-211 - [i4]Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. CoRR abs/1302.3828 (2013) - [i3]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies. CoRR abs/1311.6421 (2013) - 2012
- [j44]Pilu Crescenzi, Alessio Malizia, M. Cecilia Verri, Paloma Díaz, Ignacio Aedo:
Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course. J. Educ. Technol. Soc. 15(2): 115-124 (2012) - [j43]Vicente Acuña, Etienne Birmelé, Ludovic Cottret, Pierluigi Crescenzi, Fabien Jourdan, Vincent Lacroix, Alberto Marchetti-Spaccamela, Andrea Marino, Paulo Vieira Milreu, Marie-France Sagot, Leen Stougie:
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. Theor. Comput. Sci. 457: 1-9 (2012) - [c51]Alexandre S. Freire, Vicente Acuña, Pilu Crescenzi, Carlos Eduardo Ferreira, Vincent Lacroix, Paulo Vieira Milreu, Eduardo Moreno, Marie-France Sagot:
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone. ISCO 2012: 165-177 - [c50]Pierluigi Crescenzi, Leonardo Rossi, Gianluca Apollaro:
Making turing machines accessible to blind students. SIGCSE 2012: 167-172 - [c49]Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot:
Efficient Bubble Enumeration in Directed Graphs. SPIRE 2012: 118-129 - [c48]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence. DISC 2012: 417-418 - [c47]Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino:
On Computing the Diameter of Real-World Directed (Weighted) Graphs. SEA 2012: 99-110 - 2011
- [j42]Pilu Crescenzi, Alessio Malizia, M. Cecilia Verri, Paloma Díaz, Ignacio Aedo:
On two collateral effects of using algorithm visualizations. Br. J. Educ. Technol. 42(6): 145- (2011) - [j41]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Parsimonious flooding in dynamic graphs. Distributed Comput. 24(1): 31-44 (2011) - [j40]Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Donatella Merlini, Gianluca Rossi, Paola Vocca:
Smooth movement and Manhattan path based Random Waypoint mobility. Inf. Process. Lett. 111(5): 239-246 (2011) - [c46]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. ACL 2011: 450-459 - [c45]Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino:
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. TAPAS 2011: 92-103 - 2010
- [c44]Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino:
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. ESA (1) 2010: 302-313 - [c43]Guido Rößling, Myles F. McNally, Pierluigi Crescenzi, Atanas Radenski, Petri Ihantola, M. Gloria Sánchez-Torrubia:
Adapting moodle to better support CS education. ITiCSE-WGR 2010: 15-27 - [c42]Pierluigi Crescenzi:
Using AVs to explain NP-completeness. ITiCSE 2010: 299 - [c41]Paulo Vieira Milreu, Vicente Acuña, Etienne Birmelé, Pierluigi Crescenzi, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie, Vincent Lacroix:
Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms. WABI 2010: 226-237
2000 – 2009
- 2009
- [j39]Pierluigi Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci:
On the connectivity of Bluetooth-based ad hoc networks. Concurr. Comput. Pract. Exp. 21(7): 875-887 (2009) - [j38]Michael Bruce-Lockhart, Pilu Crescenzi, Theodore S. Norvell:
Integrating test generation functionality into the Teaching Machine environment. Electron. Notes Theor. Comput. Sci. 224: 115-124 (2009) - [j37]Michael Bruce-Lockhart, Theodore S. Norvell, Pierluigi Crescenzi:
Adding Test Generation to the Teaching Machine. ACM Trans. Comput. Educ. 9(2): 12:1-12:14 (2009) - [j36]Pierluigi Crescenzi, Fabrizio Luccio, Geppino Pucci:
Foreword. Theory Comput. Syst. 44(2): 141-142 (2009) - [c40]Carlo Nocentini, Pilu Crescenzi, Leonardo Lanzi:
Performance Evaluation of a Chord-Based JXTA Implementation. AP2PS 2009: 7-12 - [c39]Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Parsimonious flooding in dynamic graphs. PODC 2009: 260-269 - [c38]Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Gianluca Rossi, Paola Vocca:
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. SIROCCO 2009: 154-166 - 2008
- [c37]Stefano Boschi, Miriam Di Ianni, Pilu Crescenzi, Gianluca Rossi, Paola Vocca:
MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks. SimuTools 2008: 38 - [c36]Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca:
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. WG 2008: 90-100 - 2007
- [j35]Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger:
On-line load balancing made simple: Greedy strikes back. J. Discrete Algorithms 5(1): 162-175 (2007) - [c35]Pilu Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci, Carlo Sandri:
On the Connectivity of Bluetooth-Based Ad Hoc Networks. Euro-Par 2007: 960-969 - [c34]Pilu Crescenzi, Carlo Nocentini:
Fully integrating algorithm visualization into a cs2 course.: a two-year experience. ITiCSE 2007: 296-300 - [e2]Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci:
Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings. Lecture Notes in Computer Science 4475, Springer 2007, ISBN 978-3-540-72913-6 [contents] - 2006
- [c33]Pilu Crescenzi, Michele Loreti, Rosario Pugliese:
Assessing CS1 java skills: a three-year experience. ITiCSE 2006: 348 - 2005
- [c32]Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi, Paola Vocca:
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. ADHOC-NOW 2005: 4-17 - [c31]Pilu Crescenzi, Giorgio Gambosi, Gaia Innocenti:
NetPrIDE an integrated environment for developing and visualizing computer network protocols. ITiCSE 2005: 306-310 - 2004
- [j34]Pilu Crescenzi, Giorgio Gambosi, Paolo Penna:
On-line algorithms for the channel assignment problem in cellular networks. Discret. Appl. Math. 137(3): 237-266 (2004) - [j33]Pilu Crescenzi, Federico Montecalvo, Gianluca Rossi:
Optimal covering designs: complexity results and new bounds. Discret. Appl. Math. 144(3): 281-290 (2004) - [j32]Pierluigi Crescenzi, Federico Greco:
The minimum likely column cover problem. Inf. Process. Lett. 89(4): 175-179 (2004) - [j31]Pilu Crescenzi, Bülent Yener:
Foreword - ACM MONET Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications. Mob. Networks Appl. 9(2): 99 (2004) - [c30]Lorenzo Bettini, Pilu Crescenzi, Gaia Innocenti, Michele Loreti, Leonardo Cecchi:
An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses. ICALT 2004 - 2003
- [j30]Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
Text sparsification via local maxima. Theor. Comput. Sci. 304(1-3): 341-364 (2003) - [c29]Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger:
Online Load Balancing Made Simple: Greedy Strikes Back. ICALP 2003: 1108-1122 - [c28]Pilu Crescenzi, Gaia Innocenti:
A tool to develop electronic course books based on WWW technologies, resources and usability criteria. ITiCSE 2003: 163-167 - [c27]Leonardo Cecchi, Pilu Crescenzi, Gaia Innocenti:
C : C++ = JavaMM: Java. PPPJ 2003: 75-78 - [c26]Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano:
Search Data Structures for Skewed Strings. WEA 2003: 81-96 - 2002
- [j29]Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri:
A note on the spatiality degree of graphs. Ars Comb. 63 (2002) - [j28]Pierluigi Crescenzi, Gianluca Rossi:
On the Hamming distance of constraint satisfaction problems. Theor. Comput. Sci. 288(1): 85-100 (2002) - [c25]Pierluigi Crescenzi, Gaia Innocenti:
Development of an ECB on Computer Networks Based on WWW Technologies, Resources and Usability Criteria. ICCE 2002: 1198-1202 - 2001
- [j27]Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan:
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. Inf. Comput. 167(1): 10-26 (2001) - [j26]Pierluigi Crescenzi, Xiaotie Deng, Christos H. Papadimitriou:
On Approximating a Scheduling Problem. J. Comb. Optim. 5(3): 287-297 (2001) - [c24]Pierluigi Crescenzi, Gaia Innocenti:
Towards a Taxonomy of Network Protocol Visualization Tools. Software Visualization 2001: 241-255 - [c23]Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri:
On Computing Ad-hoc Selective Families. RANDOM-APPROX 2001: 211-222 - [c22]Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca:
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. STACS 2001: 121-131 - 2000
- [j25]Pierluigi Crescenzi, Luca Trevisan:
On Approximation Scheme Preserving Reducibility and Its Applications. Theory Comput. Syst. 33(1): 1-16 (2000) - [j24]Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi:
Reversible Execution and Visualization of Programs with LEONARDO. J. Vis. Lang. Comput. 11(2): 125-150 (2000) - [c21]Pierluigi Crescenzi, Giorgio Gambosi, Paolo Penna:
On-line algorithms for the channel assignment problem in cellular networks. DIAL-M 2000: 1-7 - [c20]Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
Text Sparsification via Local Maxima. FSTTCS 2000: 290-301
1990 – 1999
- 1999
- [b2]Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, Viggo Kann:
Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer 1999, ISBN 3540654313, pp. I-XIX, 1-524 - [j23]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes. SIAM J. Comput. 28(5): 1759-1782 (1999) - [j22]Pierluigi Crescenzi, Luca Trevisan:
Max NP-completeness Made Easy. Theor. Comput. Sci. 225(1-2): 65-79 (1999) - [c19]Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi:
On the Complexity of Approximating Colored-Graph Problems. COCOON 1999: 281-290 - [c18]Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi:
IP Address Lookup Made Fast and Simple. ESA 1999: 65-76 - 1998
- [j21]Pierluigi Crescenzi, Riccardo Silvestri:
Sperner's Lemma and Robust Machines. Comput. Complex. 7(2): 163-173 (1998) - [j20]Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno:
Linear area upward drawings of AVL trees. Comput. Geom. 9(1-2): 25-42 (1998) - [j19]Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis:
On the Complexity of Protein Folding. J. Comput. Biol. 5(3): 423-465 (1998) - [j18]Pierluigi Crescenzi, Viggo Kann:
How to find the best approximation results. SIGACT News 29(4): 90-97 (1998) - [j17]Pierluigi Crescenzi, Paolo Penna:
Strictly-upward Drawings of Ordered Search Trees. Theor. Comput. Sci. 203(1): 51-67 (1998) - [j16]Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim:
The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. 205(1-2): 261-282 (1998) - [c17]