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

Search the dblp DataBase

Title:
Author:
Jacques Carlier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Olivier Dubois, Jacques Carlier
    Probabilistic approach to the Satisfiability Problem. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:1, pp:65-75 [Journal]
  2. Dritan Nace, Jacques Carlier
    Distributed Rerouting in DCS Mesh Networks. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:406-415 [Conf]
  3. Jacques Carlier, Eric Pinson
    Bounds and adjustments associated with the Pm/ri, qi/Cmax scheduling problem. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1997, pp:169-0 [Conf]
  4. Jacques Carlier, Stéphane Cateloin, Christophe Beaujean
    An Optimal Routing Technique: the Proportional Routing. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1998, pp:227-241 [Conf]
  5. Jean-Luc Lutton, Dritan Nace, Jacques Carlier
    Contribution in Assignment of Spare Capacities in Reconfigurable. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1997, pp:183-192 [Conf]
  6. Dritan Nace, Jacques Carlier, Jean-Luc Lutton
    Issues in Distributed Rerouting On High Speed Networks. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1999, pp:205-214 [Conf]
  7. François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre
    New Lower and Upper Bounds for Graph Treewidth. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:70-80 [Conf]
  8. Corinne Lucet, Jean-Francois Manouvrier, Jacques Carlier
    Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:316-336 [Journal]
  9. Jean Paul Boufflet, Jacques Carlier
    An Exact Method for Minimizing the Makespan of an Application Processed on a Master Slave Bus Oriented Multiprocessor System. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:51-76 [Journal]
  10. Jacques Carlier, Alain Hertz, Frédéric Maffray, Marino Widmer
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:1- [Journal]
  11. Jacques Carlier, Corinne Lucet
    A Decomposition Algorithm for Network Reliability Evaluation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:141-156 [Journal]
  12. Jacques Carlier, Yu Li, Jean-Luc Lutton
    Reliability Evaluation of Large Telecommunication Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:61-80 [Journal]
  13. Jacques Carlier, Eric Pinson
    Jackson's pseudo-preemptive schedule and cumulative scheduling problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:80-94 [Journal]
  14. Jean-Luc Lutton, Dritan Nace, Jacques Carlier
    Assigning spare capacities in mesh survivable networks. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2000, v:13, n:2-4, pp:441-451 [Journal]
  15. Jacques Carlier, Emmanuel Néron
    Computing redundant resources for the resource constrained project scheduling problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:176, n:3, pp:1452-1463 [Journal]
  16. Philippe Baptiste, Jacques Carlier, Antoine Jouglet
    A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:158, n:3, pp:595-608 [Journal]
  17. Jacques Carlier, Emmanuel Néron
    On linear lower bounds for the resource constrained project scheduling problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:149, n:2, pp:314-324 [Journal]

  18. Integrality Property in Preemptive Parallel Machine Scheduling. [Citation Graph (, )][DBLP]


  19. Minimizing the Makespan in Two-machine Job Shop Scheduling Problems with no Machine Idle-time. [Citation Graph (, )][DBLP]


  20. New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. [Citation Graph (, )][DBLP]


  21. A new constraint programming approach for the orthogonal packing problem. [Citation Graph (, )][DBLP]


  22. Foreword. [Citation Graph (, )][DBLP]


  23. The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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