- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j29 |      | Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries: GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discrete Applied Mathematics 161(4-5): 453 (2013) |
| j28 | | Marc Demange, Dominique de Werra: On some coloring problems in grids. Theor. Comput. Sci. 472: 9-27 (2013) |
| j27 | | Konrad Dabrowski, Marc Demange, Vadim V. Lozin: New results on maximum induced matchings in bipartite graphs and beyond. Theor. Comput. Sci. 478: 33-40 (2013) |
| 2012 | ||
| j26 | | |
| j25 | | Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu: On the online track assignment problem. Discrete Applied Mathematics 160(7-8): 1072-1093 (2012) |
| c13 | | Marc Demange, Jérôme Monnot, Petrica Pop, Bernard Ries: Selective Graph Coloring in Some Special Classes of Graphs. ISCO 2012: 320-331 |
| 2010 | ||
| j24 | | Yerim Chung, Jean-François Culus, Marc Demange: On Inverse Chromatic Number problems (Extended abstract). Electronic Notes in Discrete Mathematics 36: 1129-1136 (2010) |
| 2009 | ||
| j23 | | Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discrete Applied Mathematics 157(4): 819-832 (2009) |
| j22 | | Marc Demange, Tinaz Ekim, Dominique de Werra: A tutorial on the use of graph coloring for some problems in robotics. European Journal of Operational Research 192(1): 41-55 (2009) |
| 2008 | ||
| j21 | | Yerim Chung, Marc Demange: The 0-1 inverse maximum stable set problem. Discrete Applied Mathematics 156(13): 2501-2516 (2008) |
| j20 | | Yerim Chung, Marc Demange: Some Inverse Traveling Salesman Problems. Electronic Notes in Discrete Mathematics 30: 9-14 (2008) |
| j19 | | Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu: Online Bounded Coloring of Permutation and Overlap Graphs. Electronic Notes in Discrete Mathematics 30: 213-218 (2008) |
| c12 | | Marc Demange, Tinaz Ekim: Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. TAMC 2008: 364-374 |
| c11 | | Yerim Chung, Jean-François Culus, Marc Demange: Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs. WALCOM 2008: 180-187 |
| 2007 | ||
| j18 | | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos: Time slot scheduling of compatible jobs. J. Scheduling 10(2): 111-127 (2007) |
| 2006 | ||
| j17 | | Marc Demange, Tinaz Ekim, Dominique de Werra: On the approximation of Min Split-coloring and Min Cocoloring. J. Graph Algorithms Appl. 10(2): 297-315 (2006) |
| c10 | | Jean-François Culus, Marc Demange: Oriented Coloring: Complexity and Approximation. SOFSEM 2006: 226-236 |
| 2005 | ||
| j16 | | Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos: A hypocoloring model for batch scheduling. Discrete Applied Mathematics 146(1): 3-26 (2005) |
| j15 | | Marc Demange, Tinaz Ekim, Dominique de Werra: Partitioning cographs into cliques and stable sets. Discrete Optimization 2(2): 145-153 (2005) |
| j14 | | Marc Demange, Tinaz Ekim, Dominique de Werra: (p, k)-coloring problems in line graphs. Electronic Notes in Discrete Mathematics 19: 49-55 (2005) |
| j13 | | Marc Demange, Vangelis Th. Paschos: Polynomial approximation algorithms with performance guarantees: An introduction-by-example. European Journal of Operational Research 165(3): 555-568 (2005) |
| j12 | | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos: Completeness in differential approximation classes. Int. J. Found. Comput. Sci. 16(6): 1267-1295 (2005) |
| j11 | | Marc Demange, Vangelis Th. Paschos: Improved Approximations for Weighted and Unweighted Graph Problems. Theory Comput. Syst. 38(6): 763-787 (2005) |
| j10 | | Marc Demange, Vangelis Th. Paschos: On-line vertex-covering. Theor. Comput. Sci. 332(1-3): 83-108 (2005) |
| j9 | | Marc Demange, Tinaz Ekim, Dominique de Werra: (p, k)-coloring problems in line graphs. Theor. Comput. Sci. 349(3): 462-474 (2005) |
| c9 | | Marc Demange, Bernard Kouakou, Éric Soutif: On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems. ISAAC 2005: 433-442 |
| 2004 | ||
| j8 | | Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos: Algorithms for the On-Line Quota Traveling Salesman Problem. Inf. Process. Lett. 92(2): 89-94 (2004) |
| c8 | | Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos: Algorithms for the On-Line Quota Traveling Salesman Problem. COCOON 2004: 290-299 |
| c7 | | 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. ISAAC 2004: 896-907 |
| c6 | | 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. WG 2004: 377-388 |
| 2003 | ||
| j7 | | Marc Demange, Jérôme Monnot, Vangelis Th. Paschos: Differential approximation results for the Steiner tree problem. Appl. Math. Lett. 16(5): 733-739 (2003) |
| c5 | | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos: Completeness in Differential Approximation Classes. MFCS 2003: 179-188 |
| 2002 | ||
| j6 | | Marc Demange, Vangelis Th. Paschos: Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation. RAIRO - Operations Research 36(3): 237-277 (2002) |
| j5 | | Marc Demange, Vangelis Th. Paschos: Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances. RAIRO - Operations Research 36(4): 311-350 (2002) |
| c4 | | Marc Demange, Vangelis Th. Paschos: Algorithms and Models for the On-Line Vertex-Covering. WG 2002: 102-113 |
| c3 | | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos: Weighted Node Coloring: When Stable Sets Are Expensive. WG 2002: 114-125 |
| 2000 | ||
| c2 | | Marc Demange, Xavier Paradon, Vangelis Th. Paschos: On-Line Maximum-Order Induces Hereditary Subgraph Problems. SOFSEM 2000: 327-335 |
| 1999 | ||
| j4 | | Marc Demange, Vangelis Th. Paschos: Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems. RAIRO - Operations Research 33(4): 481-507 (1999) |
| 1998 | ||
| j3 | | Marc Demange, Pascal Grisoni, Vangelis Th. Paschos: Differential Approximation Algorithms for Some Combinatorial Optimization Problems. Theor. Comput. Sci. 209(1-2): 107-122 (1998) |
| 1996 | ||
| j2 | | Marc Demange, Vangelis Th. Paschos: On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory. Theor. Comput. Sci. 158(1&2): 117-141 (1996) |
| 1995 | ||
| c1 | | Marc Demange, Vangelis Th. Paschos: Constructive - Non-constructive Approximation and Maximum Independent Set Problem. Combinatorics and Computer Science 1995: 194-207 |
| 1994 | ||
| j1 | | Marc Demange, Pascal Grisoni, Vangelis Th. Paschos: Approximation Results for the Minimum Graph Coloring Problem. Inf. Process. Lett. 50(1): 19-23 (1994) |
Colors in the list of coauthors
Last update Wed May 22 01:55:24 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page