default search action
Marc Demange
Person information
- affiliation: RMIT, Melbourne, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j48]Marc Demange
, Marcel Adonis Haddad, Cécile Murat:
Approximating the probabilistic p-Center problem under pressure. J. Comb. Optim. 48(1): 9 (2024) - [e10]Federico Liberatore
Operations Research and Enterprise Systems - 11th International Conference, ICORES 2022, Virtual Event, February 3-5, 2022, and 12th International Conference, ICORES 2023, Lisbon, Portugal, February 19-21, 2023, Revised Selected Papers. Communications in Computer and Information Science 1985, Springer 2024, ISBN 978-3-031-49661-5 [contents] - 2022
- [j47]Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini
A graph theoretical approach to the firebreak locating problem. Theor. Comput. Sci. 914: 47-72 (2022) - [e9]Greg H. Parlier, Federico Liberatore
Operations Research and Enterprise Systems - 9th International Conference, ICORES 2020, Valetta, Malta, February 22-24, 2020, and 10th International Conference, ICORES 2021, Virtual Event, February 4-6, 2021, Revised Selected Papers. Communications in Computer and Information Science 1623, Springer 2022, ISBN 978-3-031-10724-5 [contents] - [e8]Federico Liberatore
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, ICORES 2022, Online Streaming, February 3-5, 2022. SCITEPRESS 2022, ISBN 978-989-758-548-7 [contents] - [i11]Marc Demange, David Ellison, Bertrand Jouve:
Orienteering problem with time-windows and updating delay. CoRR abs/2201.00777 (2022) - [i10]Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini:
About the Infinite Windy Firebreak Location problem. CoRR abs/2204.05475 (2022) - 2021
- [j46]Marc Demange, David Ellison, Bertrand Jouve:
Orienteering problem with time-windows and updating delay. Theor. Comput. Sci. 863: 1-18 (2021) - [j45]Marc Demange, Martin Olsen
Generalised online colouring problems in overlap graphs. Theor. Comput. Sci. 877: 58-73 (2021) - [e7]Greg H. Parlier, Federico Liberatore, Marc Demange:
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, ICORES 2021, Online Streaming, February 4-6, 2021. SCITEPRESS 2021, ISBN 978-989-758-485-5 [contents] - [i9]Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini:
A graph theoretical approach to the firebreak locating problem. CoRR abs/2103.10115 (2021) - 2020
- [j44]Marc Demange
A robust p-Center problem under pressure to locate shelters in wildfire context. EURO J. Comput. Optim. 8(2): 103-139 (2020) - [e6]Greg H. Parlier, Federico Liberatore
Operations Research and Enterprise Systems - 8th International Conference, ICORES 2019, Prague, Czech Republic, February 19-21, 2019, Revised Selected Papers. Communications in Computer and Information Science 1162, Springer 2020, ISBN 978-3-030-37583-6 [contents] - [e5]Greg H. Parlier, Federico Liberatore, Marc Demange:
Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, ICORES 2020, Valletta, Malta, February 22-24, 2020. SCITEPRESS 2020, ISBN 978-989-758-396-4 [contents] - [i8]Marc Demange, Marcel Adonis Haddad, Cécile Murat:
Hardness and approximation of the Probabilistic p-Center problem under Pressure. CoRR abs/2009.08751 (2020)
2010 – 2019
- 2019
- [j43]Ferhat Alkan
Structure of conflict graphs in constraint alignment problems and algorithms. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j42]Pierre Coupechoux, Marc Demange, David Ellison
Firefighting on trees. Theor. Comput. Sci. 794: 69-84 (2019) - [c20]Marc Demange, David Ellison, Raffaella Gentilini:
Online Firefighting on Grids. ICTCS 2019: 91-96 - [e4]Greg H. Parlier, Federico Liberatore
Operations Research and Enterprise Systems - 7th International Conference, ICORES 2018, Funchal, Madeira, Portugal, January 24-26, 2018, Revised Selected Papers. Communications in Computer and Information Science 966, Springer 2019, ISBN 978-3-030-16034-0 [contents] - [e3]Greg H. Parlier, Federico Liberatore, Marc Demange:
Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, ICORES 2019, Prague, Czech Republic, February 19-21, 2019. SciTePress 2019, ISBN 978-989-758-352-0 [contents] - [i7]Pierre Coupechoux, Marc Demange, David Ellison, Bertrand Jouve:
Firefighting on Trees. CoRR abs/1902.02159 (2019) - [i6]Marc Demange, David Ellison, Raffaella Gentilini:
Online Firefighting on Grids. CoRR abs/1907.07450 (2019) - 2018
- [c19]Pierre Coupechoux, Marc Demange, David Ellison, Bertrand Jouve:
Online Firefighting on Trees. ISCO 2018: 121-132 - [c18]Adan Rodríguez, Begoña Vitoriano, Marc Demange, Ignacio Leguey:
Locating fuel breaks to minimise the risk of impact of wild fire. RSFF 2018: 3-7 - [c17]Marc Demange, Marcel Adonis Haddad, Cécile Murat:
The probabilistic k-center problem. RSFF 2018: 62-74 - [c16]Marc Demange, Martin Olsen
A Note on Online Colouring Problems in Overlap Graphs and Their Complements. WALCOM 2018: 144-155 - [e2]Greg H. Parlier, Federico Liberatore, Marc Demange:
Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, ICORES 2018, Funchal, Madeira - Portugal, January 24-26, 2018. SciTePress 2018, ISBN 978-989-758-285-1 [contents] - 2017
- [j41]Paniz Abedin, Saieed Akbari
Complexity of the Improper Twin Edge Coloring of Graphs. Graphs Comb. 33(4): 595-615 (2017) - [e1]Federico Liberatore, Greg H. Parlier, Marc Demange:
Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, ICORES 2017, Porto, Portugal, February 23-25, 2017. SciTePress 2017, ISBN 978-989-758-218-9 [contents] - 2016
- [j40]Marc Demange, Tínaz Ekim
On the minimum and maximum selective graph coloring problems in some graph classes. Discret. Appl. Math. 204: 77-89 (2016) - [c15]Marc Demange, Cerasela Tanasescu:
A Multi-period Vertex Cover Problem and Application to Fuel Management. ICORES 2016: 51-57 - [i5]Marc Demange, Dominique de Werra:
Choosability with limited number of colors. CoRR abs/1601.01768 (2016) - [i4]Paniz Abedin, Saieed Akbari, Mahsa Daneshmand, Marc Demange, Tínaz Ekim:
Improper Twin Edge Coloring of Graphs. CoRR abs/1601.02267 (2016) - 2015
- [j39]Jean-François Culus, Marc Demange, Ruxandra Marinescu-Ghemeci, Cerasela Tanasescu:
About some robustness and complexity properties of G-graphs networks. Discret. Appl. Math. 182: 34-45 (2015) - [j38]Marc Demange, Tínaz Ekim
On some applications of the selective graph coloring problem. Eur. J. Oper. Res. 240(2): 307-314 (2015) - [j37]Yerim Chung, Jean-François Culus, Marc Demange:
Inverse chromatic number problems in interval and permutation graphs. Eur. J. Oper. Res. 243(3): 763-773 (2015) - [c14]Marc Demange:
Online Strategies for Hard Optimization Problems in Graphs. ICORES 2015: IS-7 - [i3]Marc Demange, Tínaz Ekim, Bernard Ries:
On the Minimum and Maximum Selective Graph Coloring Problems. CTW 2015: 189-192 - 2014
- [j36]Marc Demange, Tínaz Ekim
Hardness and approximation of minimum maximal matchings. Int. J. Comput. Math. 91(8): 1635-1654 (2014) - [j35]Marc Demange, Tínaz Ekim
Efficient recognition of equimatchable graphs. Inf. Process. Lett. 114(1-2): 66-71 (2014) - [j34]Marc Demange, Jérôme Monnot, Petrica C. Pop
On the complexity of the selective graph coloring problem in some special classes of graphs. Theor. Comput. Sci. 540: 89-102 (2014) - [i2]Ferhat Alkan, Türker Bíyíkoglu, Marc Demange, Cesim Erten:
Constrained Alignments of a Pair of Graphs. CoRR abs/1403.7948 (2014) - 2013
- [j33]Marc Demange, Vadim V. Lozin
GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discret. Appl. Math. 161(4-5): 453 (2013) - [j32]Marc Demange, Tínaz Ekim:
A note on the NP-hardness of two matching problems in induced subgrids. Discret. Math. Theor. Comput. Sci. 15(2): 233-242 (2013) - [j31]Marc Demange, Dominique de Werra:
On some coloring problems in grids. Theor. Comput. Sci. 472: 9-27 (2013) - [j30]Konrad K. Dabrowski
New results on maximum induced matchings in bipartite graphs and beyond. Theor. Comput. Sci. 478: 33-40 (2013) - [i1]Nicolas Bourgeois, Konrad K. Dabrowski, Marc Demange, Vangelis Th. Paschos:
Playing with Parameters: Cross-parameterization in Graphs. CoRR abs/1309.6144 (2013) - 2012
- [j29]Yerim Chung, Marc Demange:
On inverse traveling salesman problems. 4OR 10(2): 193-209 (2012) - [j28]Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu:
On the online track assignment problem. Discret. Appl. Math. 160(7-8): 1072-1093 (2012) - [c13]Marc Demange, Jérôme Monnot, Petrica C. Pop
Selective Graph Coloring in Some Special Classes of Graphs. ISCO 2012: 320-331 - 2010
- [j27]Yerim Chung, Jean-François Culus, Marc Demange:
On Inverse Chromatic Number problems (Extended abstract). Electron. Notes Discret. Math. 36: 1129-1136 (2010)
2000 – 2009
- 2009
- [j26]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. Discret. Appl. Math. 157(4): 819-832 (2009) - [j25]Marc Demange, Tínaz Ekim
A tutorial on the use of graph coloring for some problems in robotics. Eur. J. Oper. Res. 192(1): 41-55 (2009) - 2008
- [j24]Yerim Chung, Marc Demange:
The 0-1 inverse maximum stable set problem. Discret. Appl. Math. 156(13): 2501-2516 (2008) - [j23]Yerim Chung, Marc Demange:
Some Inverse Traveling Salesman Problems. Electron. Notes Discret. Math. 30: 9-14 (2008) - [j22]Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu:
Online Bounded Coloring of Permutation and Overlap Graphs. Electron. Notes Discret. Math. 30: 213-218 (2008) - [c12]Marc Demange, Tínaz 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
- [j21]Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos:
Time slot scheduling of compatible jobs. J. Sched. 10(2): 111-127 (2007) - 2006
- [j20]Marc Demange, Tínaz 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
- [j19]Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos:
A hypocoloring model for batch scheduling. Discret. Appl. Math. 146(1): 3-26 (2005) - [j18]Marc Demange, Tínaz Ekim, Dominique de Werra:
Partitioning cographs into cliques and stable sets. Discret. Optim. 2(2): 145-153 (2005) - [j17]Marc Demange, Tínaz Ekim, Dominique de Werra:
(p, k)-coloring problems in line graphs. Electron. Notes Discret. Math. 19: 49-55 (2005) - [j16]Marc Demange, Vangelis Th. Paschos:
Polynomial approximation algorithms with performance guarantees: An introduction-by-example. Eur. J. Oper. Res. 165(3): 555-568 (2005) - [j15]Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos:
Completeness in differential approximation classes. Int. J. Found. Comput. Sci. 16(6): 1267-1295 (2005) - [j14]Marc Demange, Xavier Paradon, Vangelis Th. Paschos:
On-line maximum-order induced hereditary subgraph problems. Int. Trans. Oper. Res. 12(2): 185-201 (2005) - [j13]Marc Demange, Vangelis Th. Paschos:
Improved Approximations for Weighted and Unweighted Graph Problems. Theory Comput. Syst. 38(6): 763-787 (2005) - [j12]Marc Demange, Vangelis Th. Paschos:
On-line vertex-covering. Theor. Comput. Sci. 332(1-3): 83-108 (2005) - [j11]Marc Demange, Tínaz Ekim
(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
- [j10]Giorgio Ausiello, Marc Demange, Luigi Laura
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
- [j9]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
- [j8]Marc Demange, Vangelis Th. Paschos:
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation. RAIRO Oper. Res. 36(3): 237-277 (2002) - [j7]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 Oper. Res. 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
1990 – 1999
- 1999
- [j6]Marc Demange:
A Note on the Approximation of a Minimum-Weight Maximal Independent Set. Comput. Optim. Appl. 14(1): 157-169 (1999) - [j5]Marc Demange, Vangelis Th. Paschos:
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems. RAIRO Oper. Res. 33(4): 481-507 (1999) - 1998
- [j4]Marc Demange, Pascal Grisoni, Vangelis Th. Paschos:
Differential Approximation Algorithms for Some Combinatorial Optimization Problems. Theor. Comput. Sci. 209(1-2): 107-122 (1998) - 1997
- [j3]Marc Demange, Vangelis Th. Paschos:
The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems. Comput. Optim. Appl. 7(3): 307-324 (1997) - 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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: