The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marie-Christine Costa: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marie-Christine Costa, Fethi Jarray, Christophe Picouleau
    Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:173-181 [Conf]
  2. Marie-Christine Costa, Fethi Jarray, Christophe Picouleau
    An acyclic days-off scheduling problem. [Citation Graph (0, 0)][DBLP]
    4OR, 2006, v:4, n:1, pp:73-85 [Journal]
  3. Alain Billionnet, Marie-Christine Costa
    Solving the Uncapacited Plant Location Problem on Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:51-59 [Journal]
  4. Marie-Christine Costa, Dominique de Werra, Christophe Picouleau
    Using graphs for some discrete tomography problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:1, pp:35-46 [Journal]
  5. Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, D. Schindl
    A solvable case of image reconstruction in discrete tomography. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:148, n:3, pp:240-245 [Journal]
  6. Marie-Christine Costa, Alain Hertz, Michel Mittaz
    Bounds and Heuristics for the Shortest Capacitated Paths Problem. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2002, v:8, n:4, pp:449-465 [Journal]
  7. Alain Billionnet, Marie-Christine Costa, Alain Sutter
    An Efficient Algorithm for a Task Allocation Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:502-518 [Journal]
  8. Cédric Bentz, Marie-Christine Costa, Frédéric Roupin
    Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:36-54 [Journal]
  9. Pierre Chardaire, Alain Sutter, Marie-Christine Costa
    Solving the dynamic facility location problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:28, n:2, pp:117-124 [Journal]
  10. Marie-Christine Costa, Lucas Létocart, Frédéric Roupin
    A greedy algorithm for multicut and integral multiflow in rooted trees. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:1, pp:21-27 [Journal]
  11. Marie-Christine Costa, Lucas Létocart, Frédéric Roupin
    Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27]. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:4, pp:477- [Journal]
  12. Cédric Bentz, Marie-Christine Costa, Lucas Létocart, Frédéric Roupin
    Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69]. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:177, n:2, pp:1312- [Journal]
  13. Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Maria Zrikem
    The shortest multipaths problem in a capacitated dense channel. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:178, n:3, pp:926-931 [Journal]
  14. Marie-Christine Costa, Lucas Létocart, Frédéric Roupin
    Minimal multicut and maximal integer multiflow: A survey. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:162, n:1, pp:55-69 [Journal]

  15. Approximating hv-Convex Binary Matrices and Images from Discrete Projections. [Citation Graph (, )][DBLP]


  16. On the use of graphs in discrete tomography. [Citation Graph (, )][DBLP]


  17. Blockers and transversals. [Citation Graph (, )][DBLP]


  18. Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. [Citation Graph (, )][DBLP]


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