Mathieu Liedloff

According to our database1, Mathieu Liedloff authored at least 51 papers between 2005 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Fixing improper colorings of graphs.
Theor. Comput. Sci., 2018

The many facets of upper domination.
Theor. Comput. Sci., 2018

Exact exponential algorithms for 3-machine flowshop scheduling problems.
J. Scheduling, 2018

Exact algorithms for weak Roman domination.
Discrete Applied Mathematics, 2018

2017
Exact exponential algorithms to find tropical connected sets of minimum size.
Theor. Comput. Sci., 2017

Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Enumerating Minimal Tropical Connected Sets.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2016
Upper Domination: Complexity and Approximation.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Algorithmic Aspects of Upper Domination: A Parameterised Perspective.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
On the number of minimal dominating sets on some graph classes.
Theor. Comput. Sci., 2015

Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Fixing Improper Colorings of Graphs.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

End-Vertices of Graph Search Algorithms.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Algorithmes exponentiels pour l'étiquetage, la domination et l'ordonnancement.
, 2015

2014
(Circular) backbone colouring: Forest backbones in planar graphs.
Discrete Applied Mathematics, 2014

Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013
On an extension of the Sort & Search method with application to scheduling theory.
Theor. Comput. Sci., 2013

Fast exact algorithm for L(2, 1)-labeling of graphs.
Theor. Comput. Sci., 2013

Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds.
Theory Comput. Syst., 2013

Determining the L(2, 1)L(2, 1)-span in polynomial space.
Discrete Applied Mathematics, 2013

Exact and Parameterized Algorithms for Max Internal Spanning Tree.
Algorithmica, 2013

Treewidth and Pathwidth Parameterized by the Vertex Cover Number.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Exact Algorithms for Weak Roman Domination.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

A tight bound on the number of minimal dominating sets in split graph.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set.
Discrete Mathematics & Theoretical Computer Science, 2012

Determining the L(2, 1)-Span in Polynomial Space.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

On Finding Optimal Polytrees.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Breaking the 2n-barrier for Irredundance: Two lines of attack.
J. Discrete Algorithms, 2011

Exact Algorithms for L(2, 1)-Labeling of Graphs.
Algorithmica, 2011

Complexity of Splits Reconstruction for Low-Degree Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Fast Exact Algorithm for L(2, 1)-Labeling of Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2011

2010
Exact exponential-time algorithms for finding bicliques.
Inf. Process. Lett., 2010

Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

An Exact Algorithm for Connected Red-Blue Dominating Set.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Exponential time algorithms for the minimum dominating set problem on some graph classes.
ACM Trans. Algorithms, 2009

Sort and Search: Exact algorithms for generalized domination.
Inf. Process. Lett., 2009

An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Finding a dominating set on bipartite graphs.
Inf. Process. Lett., 2008

Efficient algorithms for Roman domination on some classes of graphs.
Discrete Applied Mathematics, 2008

On Independent Sets and Bicliques in Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Iterative Compression and Exact Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007
Algorithmes exacts et exponentiels pour les problèmes NP-difficiles : domination, variantes et généralisations. (Excat exponential time algorithms for NP-hard problems : domination, variants and generalizations).
PhD thesis, 2007

Branch and Recharge: Exact Algorithms for Generalized Domination.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Exact Algorithms for L (2, 1)-Labeling of Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.
Proceedings of the Algorithm Theory, 2006

An Exact Algorithm for the Minimum Dominating Clique Problem.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005
Roman Domination over Some Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005


  Loading...