Marc Demange

965 total citations
58 papers, 403 citations indexed

About

Marc Demange is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, Marc Demange has authored 58 papers receiving a total of 403 indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computational Theory and Mathematics, 19 papers in Computer Networks and Communications and 14 papers in Industrial and Manufacturing Engineering. Recurrent topics in Marc Demange's work include Advanced Graph Theory Research (32 papers), Complexity and Algorithms in Graphs (21 papers) and Optimization and Search Problems (15 papers). Marc Demange is often cited by papers focused on Advanced Graph Theory Research (32 papers), Complexity and Algorithms in Graphs (21 papers) and Optimization and Search Problems (15 papers). Marc Demange collaborates with scholars based in France, Australia and Switzerland. Marc Demange's co-authors include Vangélis Th. Paschos, Tınaz Ekim, D. de Werra, Jérôme Monnot, Bernard Ries, Konrad K. Dabrowski, Giorgio Ausiello, Vadim Lozin, Luigi Laura and Gabriele Di Stefano and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Safety Science.

In The Last Decade

Marc Demange

49 papers receiving 386 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Marc Demange France	12	238	133	124	54	53	58	403
Roberto Solis-Oba Canada	12	122 0.5×	221 1.7×	179 1.4×	63 1.2×	22 0.4×	46	408
Winfried Hochstättler Germany	11	155 0.7×	114 0.9×	54 0.4×	10 0.2×	25 0.5×	52	323
Sandip Das India	10	72 0.3×	52 0.4×	50 0.4×	143 2.6×	9 0.2×	71	289
Irith Ben‐Arroyo Hartman Israel	9	128 0.5×	38 0.3×	45 0.4×	38 0.7×	12 0.2×	23	265
Alain Quilliot France	9	53 0.2×	198 1.5×	41 0.3×	3 0.1×	73 1.4×	29	303
P. M. Dearing United States	12	80 0.3×	216 1.6×	69 0.6×	76 1.4×	12 0.2×	24	391
Ekkehard Köhler Germany	10	121 0.5×	48 0.4×	189 1.5×	2 0.0×	15 0.3×	29	376
Goos Kant Netherlands	11	174 0.7×	48 0.4×	55 0.4×	324 6.0×	3 0.1×	21	451
Matúš Mihaľák Switzerland	9	40 0.2×	66 0.5×	60 0.5×	21 0.4×	54 1.0×	37	220
Zachary Friggstad Canada	9	63 0.3×	67 0.5×	96 0.8×	8 0.1×	7 0.1×	30	247

Countries citing papers authored by Marc Demange

Since Specialization

Citations

This map shows the geographic impact of Marc Demange's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Marc Demange with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marc Demange more than expected).

Fields of papers citing papers by Marc Demange

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Marc Demange. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Marc Demange. The network helps show where Marc Demange may publish in the future.

Co-authorship network of co-authors of Marc Demange

This figure shows the co-authorship network connecting the top 25 collaborators of Marc Demange. A scholar is included among the top collaborators of Marc Demange based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Marc Demange. Marc Demange is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Liberatore, Federico, et al.. (2023). Operations Research and Enterprise Systems. Communications in computer and information science.

Demange, Marc, et al.. (2020). A robust p-Center problem under pressure to locate shelters in wildfire context. SHILAP Revista de lepidopterología. 8(2). 103–139. 13 indexed citations

Demange, Marc, et al.. (2019). Firefighting on trees. Theoretical Computer Science. 794. 69–84. 1 indexed citations

Demange, Marc, et al.. (2014). About some robustness and complexity properties of G-graphs networks. Discrete Applied Mathematics. 182. 34–45. 2 indexed citations

Demange, Marc, et al.. (2012). On the online track assignment problem. Discrete Applied Mathematics. 160(7-8). 1072–1093. 3 indexed citations

Demange, Marc & Vangélis Th. Paschos. (2010). Quelques étapes vers la conciliation de la théorie d'approximation et celle d'optimisation : une nouvelle théorie d'approximation polynomiale et résultats préliminaires. Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD) (University Paris-Dauphine).

Demange, Marc & Vangélis Th. Paschos. (2010). Towards a general formal framework for polynomial approximation. Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD) (University Paris-Dauphine).

Demange, Marc & Vangélis Th. Paschos. (2010). Approximation of weighted hereditary induced subgraph maximization problems. Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD) (University Paris-Dauphine).

Werra, D. de, et al.. (2008). Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discrete Applied Mathematics. 157(4). 819–832. 16 indexed citations

10.

Demange, Marc, et al.. (2008). Online Bounded Coloring of Permutation and Overlap Graphs. Electronic Notes in Discrete Mathematics. 30. 213–218. 2 indexed citations

11.

Demange, Marc, et al.. (2008). Some Inverse Traveling Salesman Problems. Electronic Notes in Discrete Mathematics. 30. 9–14. 2 indexed citations

12.

Demange, Marc, et al.. (2006). The 0-1 inverse maximum stable set problem. RePEc: Research Papers in Economics. 1 indexed citations

13.

Demange, Marc, Tınaz Ekim, & D. de Werra. (2005). (p,k)-coloring problems in line graphs. Theoretical Computer Science. 349(3). 462–474. 5 indexed citations

14.

Demange, Marc, Tınaz Ekim, & D. de Werra. (2005). Partitioning cographs into cliques and stable sets. Discrete Optimization. 2(2). 145–153. 15 indexed citations

15.

Demange, Marc, et al.. (2005). On-line maximum-order induced hereditary subgraph problems. International Transactions in Operational Research. 12(2). 185–201. 3 indexed citations

16.

Demange, Marc, Jérôme Monnot, & Vangélis Th. Paschos. (1999). Bridging gap between standard and differential polynomial approximation: The case of bin-packing. Applied Mathematics Letters. 12(7). 127–133. 11 indexed citations

17.

Demange, Marc & Vangélis Th. Paschos. (1999). Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems. RAIRO - Operations Research. 33(4). 481–507. 2 indexed citations

18.

Demange, Marc, et al.. (1998). Differential approximation algorithms for some combinatorial optimization problems. Theoretical Computer Science. 209(1-2). 107–122. 26 indexed citations

19.

Demange, Marc & Vangélis Th. Paschos. (1996). On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoretical Computer Science. 158(1-2). 117–141. 40 indexed citations

20.

Demange, Marc, et al.. (1994). Quelques résultats dans le cadre d'une nouvelle théorie de l'approximation polynomiale. 318(3). 289–292. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact