Mathieu Liedloff
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 54
- Complexity and Algorithms in Graphs 37
- Graph Labeling and Dimension Problems 23
-
- Optimization and Search Problems 13
- Interconnection Networks and Systems 6
- Co-authors
- Dieter Kratsch (26 shared papers)Serge Gaspers (13 shared papers)Henning Fernau (10 shared papers)Jan Kratochvı́l (9 shared papers)Jiping Liu (2 shared papers)Sheng‐Lung Peng (2 shared papers)Ton Kloks (2 shared papers)Ioan Todinca (9 shared papers)
In The Last Decade
Mathieu Liedloff
56 papers receiving 524 citations
Peers
Comparison fields: 5 of 39
- Computational Theory and Mathematics 460
- Discrete Mathematics and Combinatorics 88
- Computer Networks and Communications 199
- Industrial and Manufacturing Engineering 40
- Geometry and Topology 30
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 61 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 36 | |
| 2 | 2011 | 34 | |
| 3 | 2010 | 34 | |
| 4 | 2014 | 27 | |
| 5 | 2011 | 26 | |
| 6 | 2017 | 26 | |
| 7 | 2006 | 23 | |
| 8 | 2009 | 20 | |
| 9 | 2011 | 20 | |
| 10 | 2008 | 19 | |
| 11 | 2009 | 18 | |
| 12 | 2009 | 17 | |
| 13 | 2005 | 17 | |
| 14 | 2008 | 14 | |
| 15 | 2008 | 13 | |
| 16 | 2007 | 13 | |
| 17 | 2007 | 12 | |
| 18 | 2011 | 12 | |
| 19 | 2013 | 12 | |
| 20 | 2006 | 12 |
About Mathieu Liedloff
Mathieu Liedloff is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Artificial Intelligence and Electrical and Electronic Engineering, having authored 61 papers that have together received 543 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (54 papers), Complexity and Algorithms in Graphs (37 papers), Graph Labeling and Dimension Problems (23 papers), Optimization and Search Problems (13 papers), Limits and Structures in Graph Theory (12 papers), Interconnection Networks and Systems (6 papers), graph theory and CDMA systems (6 papers) and Algorithms and Data Compression (5 papers). The work is most often cited by research in Computational Theory and Mathematics (460 citations), Discrete Mathematics and Combinatorics (88 citations), Computer Networks and Communications (199 citations), Industrial and Manufacturing Engineering (40 citations) and Geometry and Topology (30 citations). Mathieu Liedloff has collaborated with scholars based in France, Norway and Germany. Frequent co-authors include Dieter Kratsch, Serge Gaspers, Henning Fernau, Jan Kratochvı́l, Jiping Liu, Sheng‐Lung Peng, Ton Kloks, Ioan Todinca, Fedor V. Fomin and Peter Rossmanith. Their work appears in journals such as Theoretical Computer Science, Discrete Applied Mathematics, Algorithmica, Lecture notes in computer science and ACM Transactions on Algorithms.
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.