Mathieu Liedloff
-
- Advanced Graph Theory Research 30
- Complexity and Algorithms in Graphs 20
- Graph Labeling and Dimension Problems 16
-
- Limits and Structures in Graph Theory 9
-
- Optimization and Search Problems 7
- Interconnection Networks and Systems 2
-
- Scheduling and Optimization Algorithms 2
-
- graph theory and CDMA systems 3
- Co-authors
- Dieter KratschSerge GaspersHenning FernauTon KloksJiping LiuSheng‐Lung PengIoan TodincaVincent t'Kindt
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Networks and Communications
In The Last Decade
Mathieu Liedloff
32 papers receiving 268 citations
Peers
Comparison fields: 5 of 36
- Computational Theory and Mathematics 217
- Discrete Mathematics and Combinatorics 39
- Computer Networks and Communications 110
- Industrial and Manufacturing Engineering 32
- Geometry and Topology 16
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-authorship network
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
| # | Work | ||
|---|---|---|---|
| 1 | 2017 | 3 | |
| 2 | 2017 | 1 | |
| 3 | 2017 | 15 | |
| 4 | 2017 | 7 | |
| 5 | 2015 | 3 | |
| 6 | 2015 | 1 | |
| 7 | 2014 | 0 | |
| 8 | 2014 | 21 | |
| 9 | 2013 | 12 | |
| 10 | 2013 | 1 | |
| 11 | 2012 | 4 | |
| 12 | 2011 | 25 | |
| 13 | 2011 | 9 | |
| 14 | 2011 | 10 | |
| 15 | An Exact Algorithm for the Minimum Dominating Clique Problem | 2010 | 0 |
| 16 | 2010 | 2 | |
| 17 | 2009 | 11 | |
| 18 | 2008 | 30 | |
| 19 | 2008 | 11 | |
| 20 | 2007 | 7 |
About Mathieu Liedloff
Mathieu Liedloff is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Networks and Communications, Industrial and Manufacturing Engineering and Signal Processing, having authored 36 papers that have together received 276 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (30 papers), Complexity and Algorithms in Graphs (20 papers), Graph Labeling and Dimension Problems (16 papers), Limits and Structures in Graph Theory (9 papers), Optimization and Search Problems (7 papers), graph theory and CDMA systems (3 papers), Interconnection Networks and Systems (2 papers) and Scheduling and Optimization Algorithms (2 papers). The work is most often cited by research in Computational Theory and Mathematics (217 citations), Discrete Mathematics and Combinatorics (39 citations), Computer Networks and Communications (110 citations), Industrial and Manufacturing Engineering (32 citations) and Geometry and Topology (16 citations). Mathieu Liedloff has collaborated with scholars based in France, Norway and Austria. Frequent co-authors include Dieter Kratsch, Serge Gaspers, Henning Fernau, Ton Kloks, Jiping Liu, Sheng‐Lung Peng, Ioan Todinca, Vincent t'Kindt, Jan Kratochvı́l and Peter Rossmanith. Their work appears in journals such as Theoretical Computer Science, Discrete Applied Mathematics, Algorithmica, Journal of Scheduling 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.