Mathieu Liedloff
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Scheduling and Optimization Algorithms
Papers in
-
- Advanced Graph Theory Research 59
- Graph Labeling and Dimension Problems 8
- Complexity and Algorithms in Graphs 7
-
- Scheduling and Optimization Algorithms 3
- Co-authors
- Dieter Kratsch (28 shared papers)Serge Gaspers (15 shared papers)Henning Fernau (11 shared papers)Ioan Todinca (10 shared papers)Fedor V. Fomin (7 shared papers)Jan Kratochvı́l (9 shared papers)Sheng‐Lung Peng (2 shared papers)Ton Kloks (2 shared papers)
In The Last Decade
Mathieu Liedloff
60 papers receiving 596 citations
Peers
Comparison fields: 5 of 25
- Computational Theory and Mathematics 553
- Industrial and Manufacturing Engineering 26
- Discrete Mathematics and Combinatorics 9
- Geometry and Topology 10
- Artificial Intelligence 31
Countries citing papers authored by Mathieu Liedloff
This map shows the geographic impact of Mathieu Liedloff'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 Mathieu Liedloff with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mathieu Liedloff more than expected).
Fields of papers citing papers by Mathieu Liedloff
This network shows the impact of papers produced by Mathieu Liedloff. 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 Mathieu Liedloff. The network helps show where Mathieu Liedloff may publish in the future.
Co-authors
The 25 scholars most cited alongside Mathieu Liedloff, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 65 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 40 | |
| 2 | 2010 | 35 | |
| 3 | 2011 | 35 | |
| 4 | 2017 | 33 | |
| 5 | 2014 | 27 | |
| 6 | 2011 | 26 | |
| 7 | 2006 | 24 | |
| 8 | 2011 | 24 | |
| 9 | 2008 | 23 | |
| 10 | 2009 | 23 | |
| 11 | 2009 | 21 | |
| 12 | 2009 | 17 | |
| 13 | 2005 | 16 | |
| 14 | 2008 | 15 | |
| 15 | 2008 | 14 | |
| 16 | 2007 | 13 | |
| 17 | 2012 | 13 | |
| 18 | 2013 | 13 | |
| 19 | 2017 | 13 | |
| 20 | 2006 | 12 |
About Mathieu Liedloff
Mathieu Liedloff is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering, Computer Networks and Communications, Artificial Intelligence and Nuclear Energy and Engineering, having authored 65 papers that have together received 617 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (59 papers), Graph Labeling and Dimension Problems (8 papers), Complexity and Algorithms in Graphs (7 papers), Scheduling and Optimization Algorithms (3 papers), Constraint Satisfaction and Optimization (1 paper) and Bayesian Modeling and Causal Inference (1 paper). The work is most often cited by research in Computational Theory and Mathematics (553 citations), Industrial and Manufacturing Engineering (26 citations), Discrete Mathematics and Combinatorics (9 citations), Geometry and Topology (10 citations) and Artificial Intelligence (31 citations). Mathieu Liedloff has collaborated with scholars based in France, Norway and Germany. Frequent co-authors include Dieter Kratsch, Serge Gaspers, Henning Fernau, Ioan Todinca, Fedor V. Fomin, Jan Kratochvı́l, Sheng‐Lung Peng, Ton Kloks, Jiping Liu and Peter Rossmanith. Their work appears in journals such as Theoretical Computer Science, Discrete Applied Mathematics, Algorithmica, Lecture notes in computer science and 4OR.
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.