Daniel Posner

Orcid: 0000-0003-3868-3401

According to our database1, Daniel Posner authored at least 8 papers between 2017 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Walking on vertices and edges by continuous-time quantum walk.
Quantum Inf. Process., February, 2023

2022
Total tessellation cover: Bounds, hardness, and applications.
Discret. Appl. Math., 2022

2021
A computational complexity comparative study of graph tessellation problems.
Theor. Comput. Sci., 2021

2020
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.
Theor. Comput. Sci., 2020

Total tessellation cover and quantum walk.
CoRR, 2020

2019
The Tessellation Cover Number of Good Tessellable Graphs.
CoRR, 2019

2018
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
The tessellation problem of quantum walks.
CoRR, 2017


  Loading...