The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alberto Caprara: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alberto Caprara, Giuseppe Lancia
    Optimal and Near - Optimal Solutions for 3D Structure Comparisons. [Citation Graph (0, 0)][DBLP]
    3DPVT, 2002, pp:737-745 [Conf]
  2. Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan
    Wavelength rerouting in optical networks, or the Venetian routing problem. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:72-83 [Conf]
  3. Federico Angiolini, Luca Benini, Alberto Caprara
    Polynomial-time algorithm for on-chip scratchpad memory partitioning. [Citation Graph (0, 0)][DBLP]
    CASES, 2003, pp:318-326 [Conf]
  4. Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert
    Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. [Citation Graph (0, 0)][DBLP]
    ECCB, 2002, pp:4-16 [Conf]
  5. Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
    Packing Cycles and Cuts in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:512-523 [Conf]
  6. Alberto Caprara
    Packing 2-Dimensional Bins in Harmony. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:490-499 [Conf]
  7. Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
    Improved approximation algorithms for multidimensional bin packing problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:697-708 [Conf]
  8. Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth
    Solution of Real-World Train Timetabling Problems. [Citation Graph (0, 0)][DBLP]
    HICSS, 2001, pp:- [Conf]
  9. Alberto Caprara, Marco Locatelli, Michele Monaci
    Bidimensional Packing by Bilinear Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:377-391 [Conf]
  10. Alberto Caprara, Matteo Fischetti, Adam N. Letchford
    On the Separation of Maximally Violated mod-k Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:87-98 [Conf]
  11. Alberto Caprara, Matteo Fischetti, Paolo Toth
    A Heuristic Algorithm for the Set Covering Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:72-84 [Conf]
  12. Alberto Caprara, Andrea Lodi, Michele Monaci
    An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:315-328 [Conf]
  13. Alberto Caprara, Hans Kellerer, Ulrich Pferschy
    Approximation Schemes for Ordered Vector Packing Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:63-74 [Conf]
  14. Alberto Caprara
    Sorting by reversals is difficult. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:75-83 [Conf]
  15. Alberto Caprara
    Formulations and hardness of multiple sorting by reversals. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1999, pp:84-94 [Conf]
  16. Alberto Caprara, Giuseppe Lancia
    Structural alignment of large-size proteins via lagrangian relaxation. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2002, pp:100-108 [Conf]
  17. Alberto Caprara, Giuseppe Lancia, See-Kiong Ng
    Fast practical solution of sorting by reversals. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:12-21 [Conf]
  18. Alberto Caprara
    On the Practical Solution of the Reversal Median Problem. [Citation Graph (0, 0)][DBLP]
    WABI, 2001, pp:238-251 [Conf]
  19. Alberto Caprara
    Knapsack problems: A book review. [Citation Graph (0, 0)][DBLP]
    4OR, 2004, v:2, n:4, pp:317-320 [Journal]
  20. Alberto Caprara
    Properties of some ILP Formulations of a Class of Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:11-23 [Journal]
  21. Alberto Caprara, Juan José Salazar González
    Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:111-134 [Journal]
  22. Alberto Caprara, Federico Malucelli, Daniele Pretolani
    On bandwidth-2 graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:1-13 [Journal]
  23. Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida
    A Lagrangian heuristic algorithm for a real-world train timetabling problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:5, pp:738-753 [Journal]
  24. Alberto Caprara, Paolo Toth
    Lower bounds and algorithms for the 2-dimensional vector packing problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:111, n:3, pp:231-262 [Journal]
  25. Alberto Caprara, Hans Kellerer, Ulrich Pferschy
    A 3/4-Approximation Algorithm for Multiple Subset Sum. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2003, v:9, n:2, pp:99-111 [Journal]
  26. Alberto Caprara
    The Reversal Median Problem. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2003, v:15, n:1, pp:93-113 [Journal]
  27. Alberto Caprara, Giuseppe Lancia, See-Kiong Ng
    Sorting Permutations by Reversals Through Branch-and-Price. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2001, v:13, n:3, pp:224-244 [Journal]
  28. Alberto Caprara, Juan José Salazar González
    Laying Out Sparse Graphs with Provably Minimum Bandwidth. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2005, v:17, n:3, pp:356-373 [Journal]
  29. Claudio Arbib, Alberto Caprara
    On the stability number of the edge intersection of two graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:173-174 [Journal]
  30. Alberto Caprara, Hans Kellerer, Ulrich Pferschy
    A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:3-4, pp:111-118 [Journal]
  31. Alberto Caprara, Ulrich Pferschy
    Modified subset sum heuristics for bin packing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:1, pp:18-23 [Journal]
  32. Alberto Caprara, Romeo Rizzi
    Packing triangles in bounded degree graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:4, pp:175-180 [Journal]
  33. Alberto Caprara, Romeo Rizzi
    Improving a Family of Approximation Algorithms to Edge Color Multigraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:1, pp:11-15 [Journal]
  34. Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan
    Wavelength rerouting in optical networks, or the Venetian Routing problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:93-125 [Journal]
  35. Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
    Packing cycles in undirected graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:239-256 [Journal]
  36. Alberto Caprara, Robert D. Carr, Sorin Istrail, Giuseppe Lancia, Brian Walenz
    1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:1, pp:27-52 [Journal]
  37. Alberto Caprara
    On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:2-3, pp:149-182 [Journal]
  38. Alberto Caprara, Romeo Rizzi
    Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2002, v:6, n:2, pp:157-182 [Journal]
  39. Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert
    A branch-and-cut algorithm for multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:387-425 [Journal]
  40. Alberto Caprara, Matteo Fischetti
    {0, 1/2}-Chvátal-Gomory cuts. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:74, n:, pp:221-235 [Journal]
  41. Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida
    Algorithms for railway crew management. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:125-141 [Journal]
  42. Alberto Caprara, Andrea Lodi, Romeo Rizzi
    On d-threshold graphs and d-dimensional bin packing. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:4, pp:266-280 [Journal]
  43. Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
    Packing cuts in undirected graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:1, pp:1-11 [Journal]
  44. Alberto Caprara
    Book reviews. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:5, pp:496-497 [Journal]
  45. Alberto Caprara, Michele Monaci
    On the two-dimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:1, pp:5-14 [Journal]
  46. Alberto Caprara, Ulrich Pferschy
    Worst-case analysis of the subset sum algorithm for bin packing. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:2, pp:159-166 [Journal]
  47. Alberto Caprara
    Sorting Permutations by Reversals and Eulerian Cycle Decompositions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:1, pp:91-110 [Journal]
  48. Alberto Caprara, Filippo Focacci, Evelina Lamma, Paola Mello, Michela Milano, Paolo Toth, Daniele Vigo
    Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1998, v:28, n:1, pp:49-76 [Journal]
  49. Federico Angiolini, Luca Benini, Alberto Caprara
    An efficient profile-based algorithm for scratchpad memory partitioning. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2005, v:24, n:11, pp:1660-1676 [Journal]
  50. Alberto Caprara, Matteo Fischetti, Dario Maio
    Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design. [Citation Graph (0, 17)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1995, v:7, n:6, pp:955-967 [Journal]

  51. Variability-tolerant run-time workload allocation for MPSoC energy minimization under real-time constraints. [Citation Graph (, )][DBLP]


  52. An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. [Citation Graph (, )][DBLP]


  53. Solving a Real-World Train Unit Assignment Problem. [Citation Graph (, )][DBLP]


  54. Solution of the Train Platforming Problem. [Citation Graph (, )][DBLP]


  55. Recoverable Robustness for Railway Rolling Stock Planning. [Citation Graph (, )][DBLP]


  56. An Application of Network Design with Orientation Constraints. [Citation Graph (, )][DBLP]


  57. Robustness in Train Timetabling. [Citation Graph (, )][DBLP]


  58. A column generation approach to train timetabling on a corridor. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002