| Publication | Date of Publication | Type |
|---|
Reconfiguration of digraph homomorphisms
| 2024-10-08 | Paper |
Locating-dominating sets in local tournaments
Discrete Applied Mathematics | 2023-06-15 | Paper |
Reconfiguration of Digraph Homomorphisms
| 2022-05-18 | Paper |
Local certification of graphs on surfaces
Theoretical Computer Science | 2022-03-01 | Paper |
A bijection for essentially 3-connected toroidal maps
European Journal of Combinatorics | 2021-06-18 | Paper |
Local certification of graphs on surfaces
| 2021-02-08 | Paper |
Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth
Journal of Combinatorial Theory. Series A | 2020-07-03 | Paper |
Homothetic triangle representations of planar graphs
Journal of Graph Algorithms and Applications | 2019-10-25 | Paper |
On the structure of Schnyder woods on orientable surfaces
| 2019-07-23 | Paper |
Scaling limits for random triangulations on the torus
| 2019-05-06 | Paper |
A bijection for essentially 4-connected toroidal triangulations
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
Encoding toroidal triangulations
Discrete & Computational Geometry | 2017-05-11 | Paper |
Generalization of Schnyder woods to orientable surfaces and applications
| 2017-02-24 | Paper |
Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2016-05-24 | Paper |
Asteroidal quadruples in non rooted path graphs
Discussiones Mathematicae Graph Theory | 2015-11-17 | Paper |
2-distance coloring of sparse graphs
Journal of Graph Theory | 2014-11-17 | Paper |
List coloring the square of sparse graphs with large degree
European Journal of Combinatorics | 2014-09-02 | Paper |
Contracting chordal graphs and bipartite graphs to paths and trees
Discrete Applied Mathematics | 2014-05-05 | Paper |
Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations
Discrete & Computational Geometry | 2014-03-25 | Paper |
Contracting graphs to paths and trees
Algorithmica | 2014-03-25 | Paper |
Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
Discrete Mathematics | 2014-01-17 | Paper |
Regularized path integrals and anomalies: U(1) chiral gauge theory
Journal of Mathematical Physics | 2013-11-11 | Paper |
2-distance coloring of sparse graphs
| 2013-11-01 | Paper |
Contracting chordal graphs and bipartite graphs to paths and trees
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Graph transformations preserving the stability number
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Asteroids in rooted and directed path graphs
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable
| 2013-01-29 | Paper |
Graph transformations preserving the stability number
Discrete Applied Mathematics | 2012-11-22 | Paper |
On graphs with no induced subdivision of \(K_4\)
Journal of Combinatorial Theory. Series B | 2012-08-14 | Paper |
Triangle contact representations and duality
Discrete & Computational Geometry | 2012-08-13 | Paper |
Contracting graphs to paths and trees
Lecture Notes in Computer Science | 2012-06-15 | Paper |
Coloring vertices of a graph or finding a Meyniel obstruction
Theoretical Computer Science | 2012-05-30 | Paper |
Characterizing directed path graphs by forbidden asteroids
Journal of Graph Theory | 2011-10-12 | Paper |
Triangle Contact Representations and Duality
Graph Drawing | 2011-02-11 | Paper |
From path graphs to directed path graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Detecting induced subgraphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
Characterizing path graphs by forbidden induced subgraphs
Journal of Graph Theory | 2009-12-18 | Paper |
Coloring Artemis graphs
Theoretical Computer Science | 2009-05-28 | Paper |
Coloring Bull-Free Perfectly Contractile Graphs
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
Generating All Sets With Bounded Unions
Combinatorics, Probability and Computing | 2008-10-13 | Paper |
Optimizing diversity
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Detecting induced subgraphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Precoloring extension of co-Meyniel graphs
Graphs and Combinatorics | 2007-09-10 | Paper |
Coloring Meyniel graphs in linear time
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Erratum : MCColor is not optimal on Meyniel graphs
| 2004-05-17 | Paper |
