default search action
Daniel Posner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c3]Luís Felipe I. Cunha, Franklin L. Marquezino, Daniel Posner, Matheus Romaneli:
Algorithmic Construction of Tessellation Cover to QUBO Formulations. AAIM (2) 2024: 220-232 - [c2]Fernanda Couto, Luís Felipe I. Cunha, Edmundo Pinto, Daniel Posner:
Minimizing Distances Between Vertices and Edges Through Tree t-Spanners. IWOCA 2024: 218-231 - 2023
- [j4]Cauê F. Teixeira da Silva, Daniel Posner, Renato Portugal:
Walking on vertices and edges by continuous-time quantum walk. Quantum Inf. Process. 22(2): 93 (2023) - 2022
- [j3]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
Total tessellation cover: Bounds, hardness, and applications. Discret. Appl. Math. 323: 149-161 (2022) - [i5]Cauê F. Teixeira da Silva, Daniel Posner, Renato Portugal:
Walking on Vertices and Edges by Continuous-Time Quantum Walk. CoRR abs/2206.03375 (2022) - 2021
- [j2]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:
A computational complexity comparative study of graph tessellation problems. Theor. Comput. Sci. 858: 81-89 (2021) - 2020
- [j1]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:
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness. Theor. Comput. Sci. 801: 175-191 (2020) - [i4]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
Total tessellation cover and quantum walk. CoRR abs/2002.08992 (2020)
2010 – 2019
- 2019
- [i3]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:
The Tessellation Cover Number of Good Tessellable Graphs. CoRR abs/1908.10844 (2019) - 2018
- [c1]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:
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness. LATIN 2018: 1-13 - 2017
- [i2]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:
The tessellation problem of quantum walks. CoRR abs/1705.09014 (2017) - [i1]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:
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness. CoRR abs/1712.07476 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint