Samuel N. Araújo

Orcid: 0000-0003-4981-9992

Affiliations:
  • Federal University of Ceará, Fortaleza, CE, Brazil


According to our database1, Samuel N. Araújo authored at least 8 papers between 2014 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
On the Rank and the General Position Number in Cycle Convexity.
Proceedings of the Combinatorial Algorithms - 37th International Workshop, 2026

The Closed Hull Game and the Closed Interval Game.
Proceedings of the 13th International Conference on Fun with Algorithms, 2026

2025
Algorithms and complexity of graph convexity partizan games.
Theor. Comput. Sci., 2025

2024
Graph convexity impartial games: Complexity and winning strategies.
Theor. Comput. Sci., 2024

Graph Convexity Partizan Games: Complexity and Winning Strategies.
Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

2023
Complexity and winning strategies of graph convexity games (Brief Announcement).
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2015
Roman domination in subgraphs of grids.
Electron. Notes Discret. Math., 2015

2014
The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014


  Loading...