Nicolas Almeida Martins

According to our database1, Nicolas Almeida Martins authored at least 16 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The connected greedy coloring game.
Theor. Comput. Sci., 2023

2022
PSPACE-hardness of variants of the graph coloring game.
Theor. Comput. Sci., 2022

Spy game: FPT-algorithm, hardness and graph products.
Theor. Comput. Sci., 2022

2021
Spy Game: FPT-Algorithm and Results on Graph Products.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Hardness of Variants of the Graph Coloring Game.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Hardness of some variants of the graph coloring game.
CoRR, 2019

2018
Locally identifying coloring of graphs with few P4s.
Theor. Comput. Sci., 2018

Spy-game on graphs: Complexity and simple topologies.
Theor. Comput. Sci., 2018

2016
L(2, 1)-labelling of graphs with few P<sub>4</sub>'s.
Discret. Optim., 2016

Spy-Game on Graphs.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Inapproximability of the lid-chromatic number.
Electron. Notes Discret. Math., 2015

The b-chromatic index of graphs.
Discret. Math., 2015

2014
Restricted coloring problems on Graphs with few P 4's.
Ann. Oper. Res., 2014

2013
b-chromatic index of graphs.
Electron. Notes Discret. Math., 2013

2011
Restricted coloring problems on graphs with few P'<sub>4</sub>s.
Electron. Notes Discret. Math., 2011

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


  Loading...