- 2010
- 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 - 2007
- Fabio Giulii Capponi, P. Santoro, E. Crescenzi:
HBCS Converter: A Bidirectional DC/DC Converter for Optimal Power Flow Regulation in Supercapacitor Applications. IAS 2007: 2009-2015 - 2003
- 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) - 2002
- Emma Langella, Nadia Rega, Roberto Improta, Orlando Crescenzi, Vincenzo Barone:
Conformational analysis of the tyrosine dipeptide analogue in the gas phase and in aqueous solution by a density functional/continuum solvent model. J. Comput. Chem. 23(6): 650-661 (2002) - 2001
- Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri:
On Computing Ad-hoc Selective Families. RANDOM-APPROX 2001: 211-222 - 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
- Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
Text Sparsification via Local Maxima. FSTTCS 2000: 290-301 - 1999
- Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi:
On the Complexity of Approximating Colored-Graph Problems. COCOON 1999: 281-290 - 1998
- 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) - 1996
- Daniel P. Bovet, Andrea Clementi, Pierluigi Crescenzi, Riccardo Silvestri:
Parallel approximation of optimization problems. Solving Combinatorial Optimization Problems in Parallel 1996: 7-24 - 1995
- Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim:
The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC 1995: 132-141