Luís Felipe I. Cunha

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 21

Top Topics

Maximum Distance

Delaunay Triangulation

Computational Complexity

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

J. Comput. Biol.

Publications

Fernanda Couto, Luís Felipe I. Cunha, Edmundo Pinto, Daniel Posner
Minimizing Distances Between Vertices and Edges Through Tree t-Spanners. IWOCA (2024)
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 (2022)
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 (2022)
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 (2022)
Fernanda Couto, Luís Felipe I. Cunha
Hardness and efficiency on t-admissibility for graph operations. Discret. Appl. Math. 304 (2021)
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 (2021)
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 (2020)
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 (2020)
Fernanda Couto, Luís Felipe I. Cunha
Hardness and efficiency on minimizing maximum distances in spanning trees. Theor. Comput. Sci. 838 (2020)
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 (2020)
Luís Felipe I. Cunha, Fábio Protti
Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems. J. Comput. Biol. 26 (11) (2019)
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 (2019)
Fernanda Couto, Luís Felipe I. Cunha
)-graphs. LAGOS (2019)
Fernanda Couto, Luís Felipe I. Cunha
Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently. COCOA (2018)
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 (2018)
Luís Felipe I. Cunha, Yoan Diekmann, Luis Antonio Brasil Kowada, Jens Stoye
Identifying Maximal Perfect Haplotype Blocks. BSB (2018)
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)
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 (2017)
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)
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 (2017)
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 (2017)
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) (2015)
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo
Sorting Separable Permutations by Restricted Multi-break Rearrangements. CTW (2015)
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)
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) (2013)
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)
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)