Luís Cunha

Available identifiers

Publication	Date of Publication	Type
Sorting separable permutations by restricted multi-break rearrangements	2024-04-22	Paper
Bounds and complexity for the tessellation problem	2024-04-22	Paper
Short block-move-CPP is \textsf{NP}-complete	2024-04-22	Paper
On the Complexity of the Median and Closest Permutation Problems	2023-11-28	Paper
Total tessellation cover: bounds, hardness, and applications	2022-11-02	Paper
Simpler and efficient characterizations of tree t-spanners for graphs with few P4's and (k, l)-graphs	2022-08-30	Paper
Strategies for generating tree spanners: algorithms, heuristics and optimal graph classes	2022-06-03	Paper
Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs	2022-04-27	Paper
Edge tree spanners	2021-12-08	Paper
Hardness and efficiency on \(t\)-admissibility for graph operations	2021-09-30	Paper
Hardness and efficiency on minimizing maximum distances in spanning trees	2020-09-01	Paper
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings	2020-05-25	Paper
Total tessellation cover and quantum walk	2020-02-20	Paper
On the computational complexity of closest genome problems	2020-02-14	Paper
Tree \(t\)-spanners of a graph: minimizing maximum distances efficiently	2019-10-11	Paper
The Tessellation Cover Number of Good Tessellable Graphs	2019-08-28	Paper
Advancing the Transposition Distance and Diameter through Lonely Permutations	2014-04-10	Paper
https://portal.mardi4nfdi.de/entity/Q2918476	2012-10-06	Paper

No records found.

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Luís Cunha