The SCEAS System
Navigation Menu

Search the dblp DataBase


Claudio Arbib: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Claudio Arbib, Gianna Cioni
    Meta-Reasoning and Data Structuring for Improving PROLOG Programming Style. [Citation Graph (0, 0)][DBLP]
    AIMSA, 1986, pp:55-61 [Conf]
  2. Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi
    Predicting deadlock in Store-and-Forward Networks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:123-142 [Conf]
  3. Claudio Arbib
    Two Polynomial Problems in PLA Folding. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:119-129 [Conf]
  4. Claudio Arbib, Michele Flammini, Fabrizio Marinelli
    Minimum Flow Time Graph Ordering. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:23-33 [Conf]
  5. Claudio Arbib, Michele Flammini
    On the upper chromatic number of (v3, b2)-configurations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:3-12 [Journal]
  6. Claudio Arbib, Michele Flammini, Enrico Nardelli
    How to Survive While Visiting a Graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:279-293 [Journal]
  7. Claudio Arbib, Dario Pacciarelli, Stefano Smriglio
    A Three-dimensional Matching Model for Perishable Production Scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:92, n:1, pp:1-15 [Journal]
  8. Claudio Arbib, Raffaele Mosca
    On (P5, diamond)-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:1-22 [Journal]
  9. Claudio Arbib
    A Polynomial Characterization of Some Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:26, n:5, pp:223-230 [Journal]
  10. 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]
  11. Claudio Arbib, Stefano Smriglio, Mara Servilio
    A competitive scheduling problem and its relevance to UMTS channel assignment. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:2, pp:132-141 [Journal]
  12. Claudio Arbib, Fabrizio Marinelli
    Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:163, n:3, pp:617-630 [Journal]

  13. A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs. [Citation Graph (, )][DBLP]

  14. A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002