dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Marc Demange Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu: On the online track assignment problem. Discrete Applied Mathematics 160(7-8): 1072-1093 (2012)
2010
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYerim Chung, Jean-François Culus, Marc Demange: On Inverse Chromatic Number problems (Extended abstract). Electronic Notes in Discrete Mathematics 36: 1129-1136 (2010)
2009
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDominique 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)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc 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
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Tinaz Ekim: Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. TAMC 2008: 364-374
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYerim Chung, Jean-François Culus, Marc Demange: Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs. WALCOM 2008: 180-187
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYerim Chung, Marc Demange: The 0-1 inverse maximum stable set problem. Discrete Applied Mathematics 156(13): 2501-2516 (2008)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu: Online Bounded Coloring of Permutation and Overlap Graphs. Electronic Notes in Discrete Mathematics 30: 213-218 (2008)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYerim Chung, Marc Demange: Some Inverse Traveling Salesman Problems. Electronic Notes in Discrete Mathematics 30: 9-14 (2008)
2007
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc 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
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-François Culus, Marc Demange: Oriented Coloring: Complexity and Approximation. SOFSEM 2006: 226-236
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc 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
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Bernard Kouakou, Éric Soutif: On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems. ISAAC 2005: 433-442
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDominique 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)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Tinaz Ekim, Dominique de Werra: Partitioning cographs into cliques and stable sets. Discrete Optimization 2(2): 145-153 (2005)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Tinaz Ekim, Dominique de Werra: (p, k)-coloring problems in line graphs. Electronic Notes in Discrete Mathematics 19: 49-55 (2005)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Vangelis Th. Paschos: Polynomial approximation algorithms with performance guarantees: An introduction-by-example. European Journal of Operational Research 165(3): 555-568 (2005)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos: Completeness in differential approximation classes. Int. J. Found. Comput. Sci. 16(6): 1267-1295 (2005)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Vangelis Th. Paschos: On-line vertex-covering. Theor. Comput. Sci. 332(1-3): 83-108 (2005)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Tinaz Ekim, Dominique de Werra: (p, k)-coloring problems in line graphs. Theor. Comput. Sci. 349(3): 462-474 (2005)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Vangelis Th. Paschos: Improved Approximations for Weighted and Unweighted Graph Problems. Theory Comput. Syst. 38(6): 763-787 (2005)
2004
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos: Algorithms for the On-Line Quota Traveling Salesman Problem. COCOON 2004: 290-299
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJé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
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDominique 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
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiorgio 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
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos: Completeness in Differential Approximation Classes. MFCS 2003: 179-188
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc 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
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Vangelis Th. Paschos: Algorithms and Models for the On-Line Vertex-Covering. WG 2002: 102-113
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos: Weighted Node Coloring: When Stable Sets Are Expensive. WG 2002: 114-125
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc 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)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc 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)
2000
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Xavier Paradon, Vangelis Th. Paschos: On-Line Maximum-Order Induces Hereditary Subgraph Problems. SOFSEM 2000: 327-335
1998
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Pascal Grisoni, Vangelis Th. Paschos: Differential Approximation Algorithms for Some Combinatorial Optimization Problems. Theor. Comput. Sci. 209(1-2): 107-122 (1998)
1996
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc 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
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Vangelis Th. Paschos: Constructive - Non-constructive Approximation and Maximum Independent Set Problem. Combinatorics and Computer Science 1995: 194-207
1994
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Demange, Pascal Grisoni, Vangelis Th. Paschos: Approximation Results for the Minimum Graph Coloring Problem. Inf. Process. Lett. 50(1): 19-23 (1994)

Coauthor Index

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

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page