According to our database1, Rémy Belmonte authored at least 19 papers between 2011 and 2018.
Legend:Book In proceedings Article PhD thesis Other
Parameterized (Approximate) Defective Coloring.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
New Results on Directed Edge Dominating Set.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
How Bad is the Freedom to Flood-It?.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
Metric Dimension of Bounded Tree-length Graphs.
SIAM J. Discrete Math., 2017
The price of connectivity for feedback vertex set.
Discrete Applied Mathematics, 2017
Defective Coloring on Classes of Perfect Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017
Induced Minor Free Graphs: Isomorphism and Clique-width.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015
Metric Dimension of Bounded Width Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015
Graph classes and Ramsey numbers.
Discrete Applied Mathematics, 2014
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time.
Parameterized complexity of three edge contraction problems with degree constraints.
Acta Inf., 2014
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
Ramsey Numbers for Line Graphs and Perfect Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
Characterizing Graphs of Small Carving-Width.
Proceedings of the Combinatorial Optimization and Applications, 2012
Graph Classes with Structured Neighborhoods and Algorithmic Applications.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
Edge Contractions in Subclasses of Chordal Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2011
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011