| 2018 | WALCOM | A Note on Online Colouring Problems in Overlap Graphs and Their Complements. | Marc Demange, Martin Olsen |
| 2016 | ICORES | A Multi-period Vertex Cover Problem and Application to Fuel Management. | Marc Demange, Cerasela Tanasescu |
| 2015 | ICORES | Online Strategies for Hard Optimization Problems in Graphs. | Marc Demange |
| 2008 | TAMC | Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. | Marc Demange, Tnaz Ekim |
| 2008 | WALCOM | Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs. | Yerim Chung, Jean-Franois Culus, Marc Demange |
| 2006 | SOFSEM | Oriented Coloring: Complexity and Approximation. | Jean-Franois Culus, Marc Demange |
| 2005 | ISAAC | On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems. | Marc Demange, Bernard Kouakou, ric Soutif |
| 2004 | COCOON | Algorithms for the On-Line Quota Traveling Salesman Problem. | Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos |
| 2004 | ISAAC | Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. | Jrme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier |
| 2004 | WG | The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. | Dominique de Werra, Marc Demange, Jrme Monnot, Vangelis Th. Paschos |
| 2003 | MFCS | Completeness in Differential Approximation Classes. | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos |
| 2002 | WG | Algorithms and Models for the On-Line Vertex-Covering. | Marc Demange, Vangelis Th. Paschos |
| 2002 | WG | Weighted Node Coloring: When Stable Sets Are Expensive. | Marc Demange, Dominique de Werra, Jrme Monnot, Vangelis Th. Paschos |
| 2000 | SOFSEM | On-Line Maximum-Order Induces Hereditary Subgraph Problems. | Marc Demange, Xavier Paradon, Vangelis Th. Paschos |