The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Pierluigi Crescenzi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
    Complexity Classes and Sparse Oracles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:102-108 [Conf]
  2. Pierluigi Crescenzi
    A Short Guide to Approximation Preserving Reductions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:262-273 [Conf]
  3. Pierluigi Crescenzi, Riccardo Silvestri
    Sperner's Lemma and Robust Machines. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:194-199 [Conf]
  4. Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi
    On the Complexity of Approximating Colored-Graph Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:281-290 [Conf]
  5. Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
    Structure in Approximation Classes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:539-548 [Conf]
  6. Pierluigi Crescenzi, Gaia Innocenti
    Towards a Taxonomy of Network Protocol Visualization Tools. [Citation Graph (0, 0)][DBLP]
    Software Visualization, 2001, pp:241-255 [Conf]
  7. Pierluigi Crescenzi, Giorgio Gambosi, Paolo Penna
    On-line algorithms for the channel assignment problem in cellular networks. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2000, pp:1-7 [Conf]
  8. Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi
    IP Address Lookup Made Fast and Simple. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:65-76 [Conf]
  9. Pierluigi Crescenzi, Alessandro Panconesi
    Completeness in Approximation Classes. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:116-126 [Conf]
  10. Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
    Text Sparsification via Local Maxima. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:290-301 [Conf]
  11. Pierluigi Crescenzi, Luca Trevisan
    On Approximation Scheme Preserving Reducability and Its Applications. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:330-341 [Conf]
  12. Pierluigi Crescenzi, Adolfo Piperno
    Optimal-Area Upward Drawings of AVL Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:307-317 [Conf]
  13. Pierluigi Crescenzi, Paolo Penna
    Minimum-Area h-v Drawings of Complete Binary Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:371-382 [Conf]
  14. Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
    Online Load Balancing Made Simple: Greedy Strikes Back. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1108-1122 [Conf]
  15. Pierluigi Crescenzi, Gaia Innocenti
    Development of an ECB on Computer Networks Based on WWW Technologies, Resources and Usability Criteria. [Citation Graph (0, 0)][DBLP]
    ICCE, 2002, pp:1198-1202 [Conf]
  16. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:132-141 [Conf]
  17. Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan
    To Weight or Not to Weight: Where is the Question? [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:68-77 [Conf]
  18. Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri
    On Computing Ad-hoc Selective Families. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:211-222 [Conf]
  19. Pierluigi Crescenzi, Viggo Kann
    Approximation on the Web: A Compendium of NP Optimization Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:111-118 [Conf]
  20. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
    On the complexity of protein folding (abstract). [Citation Graph (0, 0)][DBLP]
    RECOMB, 1998, pp:61-62 [Conf]
  21. Daniel P. Bovet, Andrea E. F. Clementi, Pierluigi Crescenzi, Riccardo Silvestri
    Parallel approximation of optimization problems. [Citation Graph (0, 0)][DBLP]
    Solving Combinatorial Optimization Problems in Parallel, 1996, pp:7-24 [Conf]
  22. Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca
    On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:121-131 [Conf]
  23. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
    On the Complexity of Protein Folding (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:597-603 [Conf]
  24. Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano
    Search Data Structures for Skewed Strings. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:81-96 [Conf]
  25. Pierluigi Crescenzi, Paolo Penna
    Upward Drawings of Search Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:114-125 [Conf]
  26. Pierluigi Crescenzi, Luca Trevisan
    Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:130-139 [Conf]
  27. Daniel P. Bovet, Pierluigi Crescenzi
    Minimum-Delay Schedules in Layered Networks. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1991, v:28, n:5, pp:453-461 [Journal]
  28. Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri
    A note on the spatiality degree of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:63, n:, pp:- [Journal]
  29. Pierluigi Crescenzi, Riccardo Silvestri
    Sperner's Lemma and Robust Machines. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:2, pp:163-173 [Journal]
  30. Pierluigi Crescenzi, Giuseppe Di Battista, Adolfo Piperno
    A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:187-200 [Journal]
  31. Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno
    Linear area upward drawings of AVL trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:1-2, pp:25-42 [Journal]
  32. Gian Carlo Bongiovanni, Pierluigi Crescenzi, C. Guerra
    Parallel Simulated Annealing for Shape Detection. [Citation Graph (0, 0)][DBLP]
    Computer Vision and Image Understanding, 1995, v:61, n:1, pp:60-69 [Journal]
  33. Pierluigi Crescenzi, Alessandro Panconesi
    Completeness in Approximation Classes [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:93, n:2, pp:241-262 [Journal]
  34. Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan
    On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:167, n:1, pp:10-26 [Journal]
  35. Daniel P. Bovet, Miriam Di Ianni, Pierluigi Crescenzi
    Deadlock Prediction in the Case of Dynamic Routing. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:3, pp:185-200 [Journal]
  36. Pierluigi Crescenzi, Riccardo Silvestri
    Average Measure, Descriptive Complexity and Approximation of Maximization Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:1, pp:15-30 [Journal]
  37. Pierluigi Crescenzi, C. Fiorini, Riccardo Silvestri
    A Note on the Approximation of the MAX CLIQUE Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:1, pp:1-5 [Journal]
  38. Pierluigi Crescenzi, Federico Greco
    The minimum likely column cover problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:4, pp:175-179 [Journal]
  39. Pierluigi Crescenzi, Riccardo Silvestri
    Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:33, n:5, pp:221-226 [Journal]
  40. Pierluigi Crescenzi, Riccardo Silvestri
    A Note on the Descriptive Complexity of Maximization. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:11-15 [Journal]
  41. Pierluigi Crescenzi, Luca Trevisan
    On the Distributed Decision-Making Complexity of the Minimum Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:5, pp:431-441 [Journal]
  42. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
    On the Complexity of Protein Folding. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1998, v:5, n:3, pp:423-466 [Journal]
  43. Pierluigi Crescenzi, Xiaotie Deng, Christos H. Papadimitriou
    On Approximating a Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:3, pp:287-297 [Journal]
  44. Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
    Complexity Classes and Sparse Oracles. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:382-390 [Journal]
  45. Pierluigi Crescenzi, Luca Trevisan
    On Approximation Scheme Preserving Reducibility and Its Applications. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:1, pp:1-16 [Journal]
  46. Gian Carlo Bongiovanni, Pierluigi Crescenzi, Sergio De Agostino
    Max Sat and Min Set Cover Approximation Algorithms are P-Complete. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:293-298 [Journal]
  47. Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
    Structure in Approximation Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1759-1782 [Journal]
  48. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:261-282 [Journal]
  49. Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi
    Approximate Solution of NP Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:150, n:1, pp:1-55 [Journal]
  50. Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
    A Uniform Approach to Define Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:104, n:2, pp:263-283 [Journal]
  51. Pierluigi Crescenzi, Paolo Penna
    Strictly-upward Drawings of Ordered Search Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:51-67 [Journal]
  52. Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
    Text sparsification via local maxima. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:341-364 [Journal]
  53. Pierluigi Crescenzi, Christos H. Papadimitriou
    Reversible Simulation of Space-Bounded Computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:159-165 [Journal]
  54. Pierluigi Crescenzi, Gianluca Rossi
    On the Hamming distance of constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:288, n:1, pp:85-100 [Journal]
  55. Pierluigi Crescenzi, Luca Trevisan
    Max NP-completeness Made Easy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:225, n:1-2, pp:65-79 [Journal]
  56. Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
    Reversible Execution and Visualization of Programs with LEONARDO. [Citation Graph (0, 0)][DBLP]
    J. Vis. Lang. Comput., 2000, v:11, n:2, pp:125-150 [Journal]

  57. Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. [Citation Graph (, )][DBLP]


  58. Parsimonious flooding in dynamic graphs. [Citation Graph (, )][DBLP]


  59. Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms. [Citation Graph (, )][DBLP]


  60. Using AVs to explain NP-completeness. [Citation Graph (, )][DBLP]


  61. On the connectivity of Bluetooth-based ad hoc networks. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002