The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marc Demange: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marc Demange, Vangelis Th. Paschos
    Constructive - Non-constructive Approximation and Maximum Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:194-207 [Conf]
  2. Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
    Algorithms for the On-Line Quota Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:290-299 [Conf]
  3. Marc Demange, Bernard Kouakou, Éric Soutif
    On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:433-442 [Conf]
  4. Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier
    Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:896-907 [Conf]
  5. Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
    Completeness in Differential Approximation Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:179-188 [Conf]
  6. Jean-François Culus, Marc Demange
    Oriented Coloring: Complexity and Approximation. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:226-236 [Conf]
  7. Marc Demange, Xavier Paradon, Vangelis Th. Paschos
    On-Line Maximum-Order Induces Hereditary Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2000, pp:327-335 [Conf]
  8. Marc Demange, Vangelis Th. Paschos
    Algorithms and Models for the On-Line Vertex-Covering. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:102-113 [Conf]
  9. Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
    Weighted Node Coloring: When Stable Sets Are Expensive. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:114-125 [Conf]
  10. Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
    The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:377-388 [Conf]
  11. Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
    Differential approximation results for the Steiner tree problem. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2003, v:16, n:5, pp:733-739 [Journal]
  12. Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
    A hypocoloring model for batch scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:1, pp:3-26 [Journal]
  13. Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
    Completeness in differential approximation classes. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1267-1295 [Journal]
  14. Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
    Algorithms for the On-Line Quota Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:2, pp:89-94 [Journal]
  15. Marc Demange, Pascal Grisoni, Vangelis Th. Paschos
    Approximation Results for the Minimum Graph Coloring Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:1, pp:19-23 [Journal]
  16. Marc Demange, Vangelis Th. Paschos
    Improved Approximations for Weighted and Unweighted Graph Problems. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:6, pp:763-787 [Journal]
  17. Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
    Time slot scheduling of compatible jobs. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2007, v:10, n:2, pp:111-127 [Journal]
  18. Marc Demange, Tinaz Ekim, Dominique de Werra
    (p, k)-coloring problems in line graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:462-474 [Journal]
  19. Marc Demange, Pascal Grisoni, Vangelis Th. Paschos
    Differential Approximation Algorithms for Some Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:107-122 [Journal]
  20. Marc Demange, Vangelis Th. Paschos
    On-line vertex-covering. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:83-108 [Journal]
  21. Marc Demange, Vangelis Th. Paschos
    On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:117-141 [Journal]
  22. Marc Demange, Vangelis Th. Paschos
    Polynomial approximation algorithms with performance guarantees: An introduction-by-example. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:3, pp:555-568 [Journal]

  23. Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. [Citation Graph (, )][DBLP]


  24. Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs. [Citation Graph (, )][DBLP]


  25. The 0-1 inverse maximum stable set problem. [Citation Graph (, )][DBLP]


  26. Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. [Citation Graph (, )][DBLP]


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