Daniel F. D. Posner

According to our database, Daniel F. D. Posner authored at least 17 papers between 2009 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Conflict-free coloring games.

Paola T. Pantoja, Rodrigo Chimelli, Simone Dantas, Rodrigo Marinho, Daniel F. D. Posner

Ars Comb., March, 2025

Minimizing distances between vertices and edges through tree t-spanners.

Fernanda Couto, Luís Cunha, Edmundo Pinto, Daniel Posner

Theor. Comput. Sci., 2025

2024

Algorithmic Construction of Tessellation Cover to QUBO Formulations.

Luís Felipe I. Cunha, Franklin L. Marquezino, Daniel Posner, Matheus Romaneli

Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023

Walking on vertices and edges by continuous-time quantum walk.

Cauê F. Teixeira da Silva, Daniel Posner, Renato Portugal

Quantum Inf. Process., February, 2023

Biclique coloring game (Brief Announcement).

Paola T. P. Huaynoca, Simone Dantas, Daniel F. D. Posner

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Total tessellation cover: Bounds, hardness, and applications.

Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal

Discret. Appl. Math., 2022

2021

A computational complexity comparative study of graph tessellation problems.

Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner

Theor. Comput. Sci., 2021

2020

The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.

Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal

Theor. Comput. Sci., 2020

Total tessellation cover and quantum walk.

Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal

CoRR, 2020

2019

On the Computational Complexity of the Helly Number in the <i>P</i>₃ and Related Convexities.

Moisés T. Carvalho, Simone Dantas, Mitre Costa Dourado, Daniel F. D. Posner, Jayme Luiz Szwarcfiter

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

The Tessellation Cover Number of Good Tessellable Graphs.

Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner

CoRR, 2019

2018

The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.

Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

The tessellation problem of quantum walks.

Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal

CoRR, 2017

2016

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

Márcia R. Cerioli, Nicolas Almeida Martins, Daniel F. D. Posner, Rudini M. Sampaio

Discret. Optim., 2016

2013

Total L(2, 1)-coloring of graphs.

Márcia R. Cerioli, Daniel F. D. Posner

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

On L(2, 1)-coloring split, chordal bipartite, and weakly chordal graphs.

Márcia R. Cerioli, Daniel F. D. Posner

Discret. Appl. Math., 2012

2009

On lambda-coloring split, chordal bipartite and weakly chordal graphs.

Márcia R. Cerioli, Daniel F. D. Posner

Electron. Notes Discret. Math., 2009