Mathieu Chapelle

According to our database1, Mathieu Chapelle authored at least 12 papers between 2009 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Abstract geometrical computation 8: Small machines, accumulations & rationality.
J. Comput. Syst. Sci., 2018

Exact algorithms for weak Roman domination.
Discret. Appl. Math., 2018

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

Treewidth and Pathwidth parameterized by the vertex cover number.
Discret. Appl. Math., 2017

2015
Injective Colorings with Arithmetic Constraints.
Graphs Comb., 2015

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
TREEWIDTH and PATHWIDTH parameterized by vertex cover
CoRR, 2013

Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality.
CoRR, 2013

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

2011
Décompositions de graphes : quelques limites et obstructions. (Graphs decompositions: some limites and obstructions).
PhD thesis, 2011

2010
Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs
CoRR, 2010

2009
Constructing Brambles.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009


  Loading...