Daniel Posner

According to our database, Daniel Posner authored at least 10 papers between 2017 and 2024.

Collaborative distances:

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

2024

Minimizing Distances Between Vertices and Edges Through Tree t-Spanners.

Fernanda Couto, Luís Felipe I. Cunha, Edmundo Pinto, Daniel Posner

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 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

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 Antonio Brasil 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 Antonio Brasil 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

The Tessellation Cover Number of Good Tessellable Graphs.

Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil 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 Antonio Brasil 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 Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal

CoRR, 2017