| Publication | Date of Publication | Type |
|---|
The normal domination game in graphs
Journal of Computer and System Sciences | 2026-02-11 | Paper |
The harmonious coloring game
Information Processing Letters | 2026-01-13 | Paper |
Complexity and winning strategies of graph convexity games (brief announcement)
Procedia Computer Science | 2025-12-11 | Paper |
Target set selection with maximum activation time
Procedia Computer Science | 2025-12-02 | Paper |
Combinatorial game theory on graphs. Textbook for a mini course at the 35th Brazilian mathematics colloquium -- 35\degree Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil, Juli 2025
Publicações Matemáticas do IMPA | 2025-10-13 | Paper |
| Graph convexity partizan games: complexity and winning strategies | 2025-06-17 | Paper |
The convex set forming game
Theoretical Computer Science | 2025-06-13 | Paper |
Algorithms and complexity of graph convexity partizan games
Theoretical Computer Science | 2025-05-12 | Paper |
The iteration time and the general position number in graph convexities
Applied Mathematics and Computation | 2025-04-24 | Paper |
Introduction to graph convexity. An algorithmic approach. Translated from the Portuguese
Latin American Mathematics Series | 2025-03-12 | Paper |
Characterizations of graph classes via convex geometries: a survey
Discrete Applied Mathematics | 2024-12-04 | Paper |
Density of identifying codes of hexagonal grids with finite number of rows
RAIRO. Operations Research | 2024-06-05 | Paper |
Meyniel's conjecture on graphs with few P4's
Matemática Contemporânea | 2024-04-25 | Paper |
Graph convexity impartial games: complexity and winning strategies
Theoretical Computer Science | 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
Publicações Matemáticas do IMPA | 2024-03-25 | Paper |
The general position avoidance game and hardness of general position games
Theoretical Computer Science | 2024-02-09 | Paper |
Target set selection with maximum activation time
Discrete Applied Mathematics | 2023-08-02 | Paper |
| The iteration time and the general position number in graph convexities | 2023-04-30 | Paper |
The connected greedy coloring game
Theoretical Computer Science | 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
Discrete Applied Mathematics | 2023-03-13 | Paper |
| Hardness of variants of the graph coloring game | 2022-10-13 | Paper |
Spy game: FPT-algorithm, hardness and graph products
Theoretical Computer Science | 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
Theoretical Computer Science | 2022-03-01 | Paper |
Algorithms, hardness and graph products on a pursuit-evasion game
(available as arXiv preprint) | 2021-10-17 | Paper |
PSPACE-completeness of two graph coloring games
Theoretical Computer Science | 2020-05-23 | Paper |
Hardness of some variants of the graph coloring game
(available as arXiv preprint) | 2019-11-23 | Paper |
On the parameterized complexity of the geodesic hull number
Theoretical Computer Science | 2019-09-10 | Paper |
FPT algorithms to recognize well covered graphs
(available as arXiv preprint) | 2019-05-23 | 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
Discrete Applied Mathematics | 2018-12-03 | Paper |
Minimum density of identifying codes of king grids
Discrete Mathematics | 2018-08-15 | Paper |
\(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
Discrete Optimization | 2018-05-24 | Paper |
Limits of \(k\)-dimensional poset sequences
Discrete Applied Mathematics | 2018-05-24 | Paper |
Spy-game on graphs: complexity and simple topologies
Theoretical Computer Science | 2018-05-15 | Paper |
Minimum density of identifying codes of king grids
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
The P3 infection time is W[1]-hard parameterized by the treewidth
Information Processing Letters | 2018-03-16 | Paper |
The convexity of induced paths of order three and applications: complexity aspects
Discrete Applied Mathematics | 2018-02-22 | Paper |
Locally identifying coloring of graphs with few P4s
Theoretical Computer Science | 2017-12-20 | Paper |
The maximum time of 2-neighbor bootstrap percolation: complexity results
Theoretical Computer Science | 2017-12-20 | Paper |
On the geodetic rank of a graph
Journal of Combinatorics | 2017-07-25 | Paper |
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
Discrete Mathematics | 2017-06-23 | Paper |
Identifying codes for infinite triangular grids with a finite number of rows
Discrete Mathematics | 2017-05-10 | Paper |
The maximum time of 2-neighbour bootstrap percolation in grid graphs and parametrized results
Graph-Theoretic Concepts in Computer Science | 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
Discrete Applied Mathematics | 2016-05-02 | Paper |
Inapproximability results related to monophonic convexity
Discrete Applied Mathematics | 2015-09-30 | Paper |
On the complexity of the flow coloring problem
Discrete Applied Mathematics | 2015-09-30 | Paper |
Inapproximability results for graph convexity parameters
Theoretical Computer Science | 2015-09-16 | Paper |
The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Restricted coloring problems on graphs with few \(P_4\)'s
Annals of Operations Research | 2015-01-22 | Paper |
Inapproximability results for graph convexity parameters
Approximation and Online Algorithms | 2014-09-02 | Paper |
| Property testing and parameter testing for permutations | 2014-05-22 | Paper |
Maximization coloring problems on graphs with few \(P_4\)
Discrete Applied Mathematics | 2014-05-05 | Paper |
Hardness and inapproximability of convex recoloring problems
Theoretical Computer Science | 2014-04-16 | Paper |
Backbone colouring: tree backbones with small diameter in planar graphs
Theoretical Computer Science | 2013-12-11 | Paper |
| Every hereditary permutation property is testable | 2013-11-01 | Paper |
Restricted coloring problems on graphs with few \(P'_4s\)
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A note on random \(k\)-dimensional posets
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A note on permutation regularity
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
On the complexity of solving or approximating convex recoloring problems
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Limits of permutation sequences
Journal of Combinatorial Theory. Series B | 2013-01-18 | Paper |
A note on permutation regularity
Discrete Applied Mathematics | 2012-11-22 | Paper |
Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
Information Processing Letters | 2012-10-23 | Paper |
Even pairs in planar Berge graphs
Matemática Contemporânea | 2012-10-06 | Paper |
Testing permutation properties through subpermutations
Theoretical Computer Science | 2011-07-14 | Paper |
| On the complexity of finding even pairs in planar perfect graphs | 2001-10-24 | Paper |
