Marc Demange

	2009
32		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)
31		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
30		Marc Demange, Tinaz Ekim: Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. TAMC 2008: 364-374
29		Yerim Chung, Jean-François Culus, Marc Demange: Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs. WALCOM 2008: 180-187
28		Yerim Chung, Marc Demange: The 0-1 inverse maximum stable set problem. Discrete Applied Mathematics 156(13): 2501-2516 (2008)
27		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)
26		Yerim Chung, Marc Demange: Some Inverse Traveling Salesman Problems. Electronic Notes in Discrete Mathematics 30: 9-14 (2008)
	2007
25		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
24		Jean-François Culus, Marc Demange: Oriented Coloring: Complexity and Approximation. SOFSEM 2006: 226-236
23		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)
	2005
22		Marc Demange, Bernard Kouakou, Éric Soutif: On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems. ISAAC 2005: 433-442
21		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)
20		Marc Demange, Tinaz Ekim, Dominique de Werra: Partitioning cographs into cliques and stable sets. Discrete Optimization 2(2): 145-153 (2005)
19		Marc Demange, Tinaz Ekim, Dominique de Werra: (p, k)-coloring problems in line graphs. Electronic Notes in Discrete Mathematics 19: 49-55 (2005)
18		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)
17		Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos: Completeness in differential approximation classes. Int. J. Found. Comput. Sci. 16(6): 1267-1295 (2005)
16		Marc Demange, Vangelis Th. Paschos: On-line vertex-covering. Theor. Comput. Sci. 332(1-3): 83-108 (2005)
15		Marc Demange, Tinaz Ekim, Dominique de Werra: (p, k)-coloring problems in line graphs. Theor. Comput. Sci. 349(3): 462-474 (2005)
14		Marc Demange, Vangelis Th. Paschos: Improved Approximations for Weighted and Unweighted Graph Problems. Theory Comput. Syst. 38(6): 763-787 (2005)
	2004
13		Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos: Algorithms for the On-Line Quota Traveling Salesman Problem. COCOON 2004: 290-299
12		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
11		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
10		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)
	2003
9		Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos: Completeness in Differential Approximation Classes. MFCS 2003: 179-188
8		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)
	2002
7		Marc Demange, Vangelis Th. Paschos: Algorithms and Models for the On-Line Vertex-Covering. WG 2002: 102-113
6		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
5		Marc Demange, Xavier Paradon, Vangelis Th. Paschos: On-Line Maximum-Order Induces Hereditary Subgraph Problems. SOFSEM 2000: 327-335
	1998
4		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
3		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
2		Marc Demange, Vangelis Th. Paschos: Constructive - Non-constructive Approximation and Maximum Independent Set Problem. Combinatorics and Computer Science 1995: 194-207
	1994
1		Marc Demange, Pascal Grisoni, Vangelis Th. Paschos: Approximation Results for the Minimum Graph Coloring Problem. Inf. Process. Lett. 50(1): 19-23 (1994)

Coauthor Index

1	Giorgio Ausiello	[9] [10] [13] [17]
2	Cristina Bazgan	[9] [17]
3	Yerim Chung	[26] [28] [29]
4	Jean-François Culus	[24] [29]
5	Tinaz Ekim	[15] [19] [20] [23] [30] [31]
6	Bruno Escoffier	[12] [32]
7	Pascal Grisoni	[1] [4]
8	Bernard Kouakou	[22]
9	Luigi Laura	[10] [13]
10	Benjamin Leroy-Beaulieu	[27]
11	Jérôme Monnot	[6] [8] [11] [12] [21] [25] [32]
12	Xavier Paradon	[5]
13	Vangelis Th. Paschos	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [16] [17] [18] [21] [25] [32]
14	Éric Soutif	[22]
15	Gabriele Di Stefano	[27]
16	Dominique de Werra	[6] [11] [12] [15] [19] [20] [21] [23] [25] [31] [32]

Colors in the list of coauthors