Luís Felipe I. Cunha

35 papers A* 1B 2C 5Journal 21Unranked 5
YearRankTypeTitle / Venue / Authors
2025 — conf
An Approach for Detecting Reverse Shell Attacks Based on Process Log Analysis.
ISSREW
Luciano Hanna El Adji, Luís Felipe I. Cunha, Raphael Carlos Santos Machado
2025 A* conf
Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable.
ICALP
Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza, Mario Valencia-Pabon
2025 J jnl
Computing Distances on Graph Associahedra is Fixed-parameter Tractable.
CoRR
Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza, Mario Valencia-Pabon
2025 J jnl
Structural characterizations of tree
RAIRO Oper. Res.
Fernanda Couto, Luís Felipe I. Cunha, Diego Ferraz
2024 — conf
Algorithmic Construction of Tessellation Cover to QUBO Formulations.
AAIM (2)
Luís Felipe I. Cunha, Franklin L. Marquezino, Daniel Posner, Matheus Romaneli
2024 J jnl
Graph admissibility: Case generation and analysis by learning models.
J. Comput. Sci.
Luís Felipe I. Cunha, Leandro Santiago, Felipe Silva Souza
2024 C conf
Minimizing Distances Between Vertices and Edges Through Tree t-Spanners.
IWOCA
Fernanda Couto, Luís Felipe I. Cunha, Edmundo Pinto, Daniel Posner
2024 J jnl
New parallelism and heuristic approaches for generating tree t -spanners in graphs.
Concurr. Comput. Pract. Exp.
Luís Felipe I. Cunha, Eriky Marciano, Anderson Moraes, Leandro Santiago, Carlos Santos
2022 J jnl
Simpler and efficient characterizations of tree t-spanners for graphs with few P4's and (k, l)-graphs.
CoRR
Fernanda Couto, Luís Felipe I. Cunha, Diego Ferraz
2022 J jnl
Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes.
Inf. Process. Lett.
Fernanda Couto, Luís Felipe I. Cunha, Daniel Juventude, Leandro Santiago
2022 J jnl
Total tessellation cover: Bounds, hardness, and applications.
Discret. Appl. Math.
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2021 J jnl
A computational complexity comparative study of graph tessellation problems.
Theor. Comput. Sci.
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner
2021 J jnl
Hardness and efficiency on t-admissibility for graph operations.
Discret. Appl. Math.
Fernanda Couto, Luís Felipe I. Cunha
2020 J jnl
Hardness and efficiency on minimizing maximum distances in spanning trees.
Theor. Comput. Sci.
Fernanda Couto, Luís Felipe I. Cunha
2020 J jnl
On the computational complexity of closest genome problems.
Discret. Appl. Math.
Luís Felipe I. Cunha, Pedro Feijão, Vinícius Fernandes dos Santos, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo
2020 J jnl
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.
Theor. Comput. Sci.
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2020 J jnl
Total tessellation cover and quantum walk.
CoRR
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2019 J jnl
Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems.
J. Comput. Biol.
Luís Felipe I. Cunha, Fábio Protti
2019 C conf
Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few
LAGOS
Fernanda Couto, Luís Felipe I. Cunha
2019 J jnl
The Tessellation Cover Number of Good Tessellable Graphs.
CoRR
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner
2018 J jnl
Closure of genomic sets: applications of graph convexity to genome rearrangement problems.
Electron. Notes Discret. Math.
Luís Felipe I. Cunha, Fábio Protti
2018 — conf
Identifying Maximal Perfect Haplotype Blocks.
BSB
Luís Felipe I. Cunha, Yoan Diekmann, Luis A. B. Kowada, Jens Stoye
2018 B conf
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.
LATIN
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2018 C conf
Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently.
COCOA
Fernanda Couto, Luís Felipe I. Cunha
2017 J jnl
Fast and Simple Jumbled Indexing for Binary RLE Strings.
CoRR
Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis A. B. Kowada, Jens Stoye
2017 B conf
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings.
CPM
Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis A. B. Kowada, Jens Stoye
2017 — —
Rearranjo de genomas: algoritmos e complexidade
Luís Felipe I. Cunha
2017 J jnl
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness.
CoRR
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2017 J jnl
The tessellation problem of quantum walks.
CoRR
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2015 J jnl
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*.
J. Comput. Biol.
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
2015 C conf
Sorting Separable Permutations by Restricted Multi-break Rearrangements.
CTW
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo
2014 C conf
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions.
WABI
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
2013 J jnl
Advancing the Transposition Distance and Diameter through Lonely Permutations.
SIAM J. Discret. Math.
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
2013 — conf
On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time.
BSB
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
2012 — conf
Transposition Diameter and Lonely Permutations.
BSB
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo