| Publication | Date of Publication | Type |
|---|
Boundedness for proper conflict-free and odd colorings
(available as arXiv preprint) | N/A | Paper |
A study on token digraphs
Discrete Mathematics | 2026-02-16 | Paper |
Proper conflict-free 7-coloring of planar graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
An 18-colour bound for locally irregular decompositions
(available as arXiv preprint) | 2026-01-01 | Paper |
On the irregular chromatic index of blow-ups of cycles
Matemática Contemporânea | 2026-01-01 | Paper |
Boundedness for proper conflict-free and odd colorings
Discrete Mathematics | 2025-12-15 | Paper |
A faster heuristic for the traveling salesman problem with drone
Optimization Letters | 2025-06-24 | Paper |
| Biclique immersions in graphs with independence number 2 (extended abstract) | 2025-04-08 | Paper |
Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
(available as arXiv preprint) | 2025-01-01 | Paper |
Approximations for the Steiner multicycle problem
Theoretical Computer Science | 2024-11-07 | Paper |
Biclique immersions in graphs with independence number 2
European Journal of Combinatorics | 2024-09-30 | Paper |
A study on token digraphs
(available as arXiv preprint) | 2024-01-01 | Paper |
Approximations for the Steiner multicycle problem
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
How heavy independent sets help to find arborescences with many leaves in DAGs
Journal of Computer and System Sciences | 2023-04-21 | Paper |
| Biclique immersions in graphs with independence number 2 | 2023-03-11 | Paper |
Leafy spanning arborescences in DAGs
Discrete Applied Mathematics | 2022-11-02 | Paper |
Leafy spanning arborescences in DAGs
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
Leafy spanning \(k\)-forests
Journal of Combinatorial Optimization | 2022-08-19 | Paper |
| Approximation algorithms for sorting permutations by length-weighted short rearrangements | 2022-04-27 | Paper |
| On edge-magic labelings of forests | 2022-04-27 | Paper |
| Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane | 2022-04-27 | Paper |
Decomposing split graphs into locally irregular graphs
Electronic Notes in Theoretical Computer Science | 2022-04-27 | Paper |
Length-weighted \(\lambda\)-rearrangement distance
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
Decomposing split graphs into locally irregular graphs
Discrete Applied Mathematics | 2021-02-01 | Paper |
Randomized approximation scheme for Steiner multi cycle in the Euclidean plane
Theoretical Computer Science | 2020-08-17 | Paper |
| Two-dimensional knapsack for circles | 2020-02-12 | Paper |
Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs
Graphs and Combinatorics | 2019-06-28 | Paper |
Online circle and sphere packing
Theoretical Computer Science | 2019-05-29 | Paper |
Decomposing split graphs into locally irregular graphs
(available as arXiv preprint) | 2019-01-01 | Paper |
| Approximation algorithms for sorting permutations by fragmentation-weighted operations | 2018-08-15 | Paper |
| Sorting permutations by limited-size operations | 2018-08-15 | Paper |
An exact algorithm for the blocks relocation problem with new lower bounds
Computers & Operations Research | 2018-08-08 | Paper |
| The online multicommodity connected facility location problem | 2018-06-22 | Paper |
Sorting permutations and binary strings by length-weighted rearrangements
Theoretical Computer Science | 2018-02-09 | Paper |
| Edge-magic labelings for constellations and armies of caterpillars | 2017-08-15 | Paper |
Edge-magic labelings for constellations and armies of caterpillars
(available as arXiv preprint) | 2017-01-01 | Paper |
Approximation algorithms for sorting by length-weighted prefix and suffix operations
Theoretical Computer Science | 2015-10-08 | Paper |
Sorting permutations by prefix and suffix versions of reversals and transpositions
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
