default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuís Felipe I. Cunha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]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- [c9]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 - 2022
- [j11]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) - [j10]Fernanda Couto, Luís Felipe I. Cunha, Daniel Juventude, Leandro Santiago:
Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes. Inf. Process. Lett. 177: 106265 (2022) - [i7]Fernanda Couto, Luís Felipe I. Cunha, Diego Ferraz:
Simpler and efficient characterizations of tree t-spanners for graphs with few P4's and (k, l)-graphs. CoRR abs/2208.14309 (2022) - 2021
- [j9]Fernanda Couto, Luís Felipe I. Cunha:
Hardness and efficiency on t-admissibility for graph operations. Discret. Appl. Math. 304: 342-348 (2021) - [j8]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
- [j7]Luís Felipe I. Cunha, Pedro Feijão, Vinícius Fernandes dos Santos, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo:
On the computational complexity of closest genome problems. Discret. Appl. Math. 274: 26-34 (2020) - [j6]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) - [j5]Fernanda Couto, Luís Felipe I. Cunha:
Hardness and efficiency on minimizing maximum distances in spanning trees. Theor. Comput. Sci. 838: 168-179 (2020) - [i6]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
- [j4]Luís Felipe I. Cunha, Fábio Protti:
Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems. J. Comput. Biol. 26(11): 1214-1222 (2019) - [c8]Fernanda Couto, Luís Felipe I. Cunha:
Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few P4's and (k, ℓ)-graphs. LAGOS 2019: 355-367 - [i5]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
- [j3]Luís Felipe I. Cunha, Fábio Protti:
Closure of genomic sets: applications of graph convexity to genome rearrangement problems. Electron. Notes Discret. Math. 69: 285-292 (2018) - [c7]Fernanda Couto, Luís Felipe I. Cunha:
Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently. COCOA 2018: 46-61 - [c6]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 - [c5]Luís Felipe I. Cunha, Yoan Diekmann, Luis Antonio Brasil Kowada, Jens Stoye:
Identifying Maximal Perfect Haplotype Blocks. BSB 2018: 26-37 - 2017
- [c4]Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Antonio Brasil Kowada, Jens Stoye:
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. CPM 2017: 19:1-19:9 - [i4]Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Antonio Brasil Kowada, Jens Stoye:
Fast and Simple Jumbled Indexing for Binary RLE Strings. CoRR abs/1702.01280 (2017) - [i3]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) - [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 graph tessellation cover number: extremal bounds, efficient algorithms and hardness. CoRR abs/1712.07476 (2017) - 2015
- [j2]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*. J. Comput. Biol. 22(11): 1044-1056 (2015) - [i1]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo:
Sorting Separable Permutations by Restricted Multi-break Rearrangements. CTW 2015: 145-148 - 2014
- [c3]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions. WABI 2014: 26-37 - 2013
- [j1]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
Advancing the Transposition Distance and Diameter through Lonely Permutations. SIAM J. Discret. Math. 27(4): 1682-1709 (2013) - [c2]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time. BSB 2013: 126-135 - 2012
- [c1]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
Transposition Diameter and Lonely Permutations. BSB 2012: 1-12
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 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
