Rudini Menezes Sampaio

Ignasi Sau

Discret. Appl. Math., October, 2023

Domination and convexity problems in the target set selection model.

[BibT_eX]

[DOI]

Discret. Appl. Math., May, 2023

The connected greedy coloring game.

[BibT_eX]

[DOI]

Carlos V. G. C. Lima

Theor. Comput. Sci., 2023

The general position number and the iteration time in the P3 convexity.

[BibT_eX]

[DOI]

CoRR, 2023

2022

PSPACE-hardness of variants of the graph coloring game.

[BibT_eX]

[DOI]

Carlos V. G. C. Lima

Theor. Comput. Sci., 2022

Spy game: FPT-algorithm, hardness and graph products.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

The general position avoidance game and hardness of general position games.

[BibT_eX]

[DOI]

S. V. Ullas Chandran

Sandi Klavzar

P. K. Neethu

CoRR, 2022

Characterizations of graph classes via convex geometries: A survey.

[BibT_eX]

[DOI]

Fábio Protti

CoRR, 2022

2021

Spy Game: FPT-Algorithm and Results on Graph Products.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

PSPACE-completeness of two graph coloring games.

[BibT_eX]

[DOI]

Victor Lage Pessoa

Ronan Soares

Theor. Comput. Sci., 2020

Hardness of Variants of the Graph Coloring Game.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

On the parameterized complexity of the geodesic hull number.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Theor. Comput. Sci., 2019

PSPACE-hardness of Two Graph Coloring Games.

[BibT_eX]

[DOI]

Victor Lage Pessoa

Ronan Soares

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

FPT algorithms to recognize well covered graphs.

[BibT_eX]

[DOI]

Uéverton S. Souza

Discret. Math. Theor. Comput. Sci., 2019

Hardness of some variants of the graph coloring game.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Locally identifying coloring of graphs with few P4s.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

The maximum time of 2-neighbor bootstrap percolation: Complexity results.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Spy-game on graphs: Complexity and simple topologies.

[BibT_eX]

[DOI]

Nathann Cohen

Theor. Comput. Sci., 2018

The P3 infection time is W[1]-hard parameterized by the treewidth.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

The maximum infection time of the P3 convexity in graphs with bounded maximum degree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Limits of k-dimensional poset sequences.

[BibT_eX]

[DOI]

Ricardo Cordeiro Corrêa

Discret. Appl. Math., 2018

Preface: LAGOS'15 - Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil - 2015.

[BibT_eX]

[DOI]

Thomas M. Liebling

Discret. Appl. Math., 2018

The convexity of induced paths of order three and applications: Complexity aspects.

[BibT_eX]

[DOI]

Vinícius Fernandes dos Santos

Discret. Appl. Math., 2018

FPT algorithms to recognize well covered graphs.

[BibT_eX]

[DOI]

Uéverton S. Souza

CoRR, 2018

2017

Minimum density of identifying codes of king grids.

[BibT_eX]

[DOI]

Rennan Dantas

Frédéric Havet

Electron. Notes Discret. Math., 2017

Identifying codes for infinite triangular grids with a finite number of rows.

[BibT_eX]

[DOI]

Rennan Dantas

Frédéric Havet

Discret. Math., 2017

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring.

[BibT_eX]

[DOI]

Fabrício Benevides

Discret. Math., 2017

2016

The maximum infection time in the geodesic and monophonic convexities.

[BibT_eX]

[DOI]

Fabrício Benevides

Theor. Comput. Sci., 2016

L(2, 1)-labelling of graphs with few P4's.

[BibT_eX]

[DOI]

Márcia R. Cerioli

Daniel F. D. Posner

Discret. Optim., 2016

Complexity aspects of the triangle path convexity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Inapproximability results for graph convexity parameters.

[BibT_eX]

[DOI]

Erika M. M. Coelho

Theor. Comput. Sci., 2015

Roman domination in subgraphs of grids.

[BibT_eX]

[DOI]

Samuel Nascimento

Electron. Notes Discret. Math., 2015

Inapproximability of the lid-chromatic number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium.

[BibT_eX]

[DOI]

Ricardo C. Corrêa

Electron. Notes Discret. Math., 2015

The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects.

[BibT_eX]

[DOI]

Fabrício Benevides

Eur. J. Comb., 2015

Inapproximability results related to monophonic convexity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Graphs with few P4's under the convexity of paths of order three.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

On the complexity of the flow coloring problem.

[BibT_eX]

[DOI]

Cristiana Gomes Huiban

Carlos Diego Rodrigues

Discret. Appl. Math., 2015

The maximum time of 2-neighbour bootstrap percolation in grid graphs and some parameterized results.

[BibT_eX]

[DOI]

CoRR, 2015

The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014

Hardness and inapproximability of convex recoloring problems.

[BibT_eX]

[DOI]

Cristiana Gomes Huiban

Yoshiko Wakabayashi

Theor. Comput. Sci., 2014

Maximization coloring problems on graphs with few P4.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Fixed-parameter algorithms for the cocoloring problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Restricted coloring problems on Graphs with few P 4's.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2014

The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results.

[BibT_eX]

[DOI]

Samuel Nascimento

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013

Backbone colouring: Tree backbones with small diameter in planar graphs.

[BibT_eX]

[DOI]

Frédéric Havet

Theor. Comput. Sci., 2013

Limits of permutation sequences.

[BibT_eX]

[DOI]

Carlos Gustavo T. de A. Moreira

Balázs Ráth

J. Comb. Theory, Ser. B, 2013

The convexity of induced paths of order three.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

On the Complexity of Solving or Approximating Convex Recoloring Problems.

[BibT_eX]

[DOI]

Cristiana Gomes Huiban

Yoshiko Wakabayashi

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Partitioning extended P4-laden graphs into cliques and stable sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Graphs with Few P4's Under the Convexity of Paths of Order Three.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Testing permutation properties through subpermutations.

[BibT_eX]

[DOI]

Carlos Gustavo T. de A. Moreira

Theor. Comput. Sci., 2011

A note on random k-dimensional posets.

[BibT_eX]

[DOI]

Ricardo C. Corrêa

Electron. Notes Discret. Math., 2011

Restricted coloring problems on graphs with few P'4s.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Every hereditary permutation property is testable.

[BibT_eX]

[DOI]

Antônio J. O. Bastos

Electron. Notes Discret. Math., 2011

Fixed parameter algorithms for restricted coloring problems: acyclic, star, nonrepetitive, harmonious and clique colorings

[BibT_eX]

[DOI]

CoRR, 2011

Two Fixed-Parameter Algorithms for the Cocoloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Property Testing and Parameter Testing for Permutations.

[BibT_eX]

[DOI]

Carlos Gustavo T. de A. Moreira

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

A note on permutation regularity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2008

Limits of permutation sequences.

[BibT_eX]

[DOI]

PhD thesis, 2008

2005

Estudo e Implementacao de Algoritmos de Roteamento sobre Grafos em um Sistema de Informacoes Geograficas

[BibT_eX]

[DOI]

Horacio Hideki Yanasse

CoRR, 2005

2001

On the complexity of finding even pairs in planar perfect graphs.

[BibT_eX]

[DOI]