| Publication | Date of Publication | Type |
|---|
| Characterizations of graph classes via convex geometries: a survey | 2024-12-04 | Paper |
| Density of identifying codes of hexagonal grids with finite number of rows | 2024-06-05 | Paper |
| Meyniel's conjecture on graphs with few P4's | 2024-04-25 | Paper |
| Graph convexity impartial games: complexity and winning strategies | 2024-04-17 | Paper |
| An introduction to convexity in graphs. Paper from the 34th Brazilian mathematics colloquium -- 34\degree Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil | 2024-03-25 | Paper |
| The general position avoidance game and hardness of general position games | 2024-02-09 | Paper |
| Target set selection with maximum activation time | 2023-08-02 | Paper |
| The iteration time and the general position number in graph convexities | 2023-04-30 | Paper |
| The connected greedy coloring game | 2023-04-20 | Paper |
| Spy game: FPT-algorithm and results on graph products | 2023-03-30 | Paper |
| Domination and convexity problems in the target set selection model | 2023-03-13 | Paper |
| Hardness of variants of the graph coloring game | 2022-10-13 | Paper |
| Spy game: FPT-algorithm, hardness and graph products | 2022-06-13 | Paper |
| PSPACE-hardness of two graph coloring games | 2022-04-27 | Paper |
| Characterizations of graph classes via convex geometries: A survey | 2022-03-29 | Paper |
| \textsf{PSPACE}-hardness of variants of the graph coloring game | 2022-03-01 | Paper |
| Algorithms, hardness and graph products on a pursuit-evasion game | 2021-10-17 | Paper |
| PSPACE-completeness of two graph coloring games | 2020-05-23 | Paper |
| Hardness of some variants of the graph coloring game | 2019-11-23 | Paper |
| On the parameterized complexity of the geodesic hull number | 2019-09-10 | Paper |
| FPT algorithms to recognize well covered graphs | 2019-05-23 | Paper |
| The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree | 2018-12-03 | Paper |
| Minimum density of identifying codes of king grids | 2018-08-15 | Paper |
| \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s | 2018-05-24 | Paper |
| Limits of \(k\)-dimensional poset sequences | 2018-05-24 | Paper |
| Spy-game on graphs: complexity and simple topologies | 2018-05-15 | Paper |
| Minimum density of identifying codes of king grids | 2018-04-09 | Paper |
| The P3 infection time is W[1]-hard parameterized by the treewidth | 2018-03-16 | Paper |
| The convexity of induced paths of order three and applications: complexity aspects | 2018-02-22 | Paper |
| Locally identifying coloring of graphs with few P4s | 2017-12-20 | Paper |
| The maximum time of 2-neighbor bootstrap percolation: complexity results | 2017-12-20 | Paper |
| On the geodetic rank of a graph | 2017-07-25 | Paper |
| Edge-colorings of graphs avoiding complete graphs with a prescribed coloring | 2017-06-23 | Paper |
| Identifying codes for infinite triangular grids with a finite number of rows | 2017-05-10 | Paper |
| The maximum time of 2-neighbour bootstrap percolation in grid graphs and parametrized results | 2016-10-21 | Paper |
| Roman domination in subgraphs of grids | 2016-10-17 | Paper |
| Inapproximability of the lid-chromatic number | 2016-10-17 | Paper |
| Complexity aspects of the triangle path convexity | 2016-05-02 | Paper |
| Inapproximability results related to monophonic convexity | 2015-09-30 | Paper |
| On the complexity of the flow coloring problem | 2015-09-30 | Paper |
| Inapproximability results for graph convexity parameters | 2015-09-16 | Paper |
| The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results | 2015-09-09 | Paper |
| Restricted coloring problems on graphs with few \(P_4\)'s | 2015-01-22 | Paper |
| Inapproximability results for graph convexity parameters | 2014-09-02 | Paper |
| Property testing and parameter testing for permutations | 2014-05-22 | Paper |
| Maximization coloring problems on graphs with few \(P_4\) | 2014-05-05 | Paper |
| Hardness and inapproximability of convex recoloring problems | 2014-04-16 | Paper |
| Backbone colouring: tree backbones with small diameter in planar graphs | 2013-12-11 | Paper |
| Every hereditary permutation property is testable | 2013-11-01 | Paper |
| Restricted coloring problems on graphs with few \(P'_4s\) | 2013-07-23 | Paper |
| A note on random \(k\)-dimensional posets | 2013-07-23 | Paper |
| A note on permutation regularity | 2013-07-19 | Paper |
| On the complexity of solving or approximating convex recoloring problems | 2013-06-11 | Paper |
| Limits of permutation sequences | 2013-01-18 | Paper |
| A note on permutation regularity | 2012-11-22 | Paper |
| Partitioning extended \(P_4\)-laden graphs into cliques and stable sets | 2012-10-23 | Paper |
| Even pairs in planar Berge graphs | 2012-10-06 | Paper |
| Testing permutation properties through subpermutations | 2011-07-14 | Paper |
| On the complexity of finding even pairs in planar perfect graphs | 2001-10-24 | Paper |
