Concepedia

Mathieu Liedloff

ML

Statistics

Publications

17

Citations

466

H-Index

14

Active since

2007

Affiliations

Université d'Orléans(Current)

Laboratoire d'Informatique Fondamentale d'Orléans

Centre National de la Recherche Scientifique

Universität Trier

Institut National des Sciences Appliquées Centre Val de Loire

Mathieu Liedloff is an author at Université d'Orléans specializing in discrete mathematics, combinatorial optimization, and graph theory.

Top concepts

Graph TheoryCombinatorial OptimizationEngineeringDiscrete MathematicsComputational ComplexityMathematical ProgrammingComputer ScienceNetwork AnalysisEducationNetwork Science

Publications per year

2007–2017

17

Publications

17

Efficient algorithms for Roman domination on some classes of graphs

Mathieu Liedloff, Ton Kloks, Jiping Liu et al. · Discrete Applied Mathematics · 2008 · 61 citations

Network Science, Graph Theory, Engineering +12

On Independent Sets and Bicliques in Graphs

Serge Gaspers, Dieter Kratsch, Mathieu Liedloff · Algorithmica · 2010 · 48 citations

Graph Theory, Algebraic Graph Theory, Structural Graph Theory +6

Exact and Parameterized Algorithms for Max Internal Spanning Tree

Daniel Binkele-Raible, Henning Fernau, Serge Gaspers et al. · Algorithmica · 2011 · 47 citations

Mathematical Programming, Parameterized Algorithms, Engineering +8

On the number of minimal dominating sets on some graph classes

Jean-Fraņcois Couturier, Romain Letourneur, Mathieu Liedloff · Theoretical Computer Science · 2014 · 36 citations

Graph Minor, Network Science, Graph Theory +6

The many facets of upper domination

Cristina Bazgan, Ljiljana Branković, Katrin Casel et al. · Theoretical Computer Science · 2017 · 36 citations

Upper Domination, Class Conflict, Critical Theory +2

1–5 of 17