P. T. de Lima

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Odd Cycle Transversal on $H$ -free graphs

Esther Galby, Paloma T. de Lima, Andrea Munaro +1

\textsc{Odd Cycle Transversal} is a classic $NP$ -hard graph optimization problem asking for a minimum-weight set of vertices whose deletion makes the input graph bipartite…

cs.DS2024

Tree decompositions meet induced matchings: beyond Max Weight Independent Set

Paloma T. Lima, Martin Milanič, Peter Muršič +3

For a tree decomposition $T$ of a graph $G$ , by $μ (T)$ we denote the size of a largest induced matching in $G$ all of whose edges intersect one bag of $\mathcal…

Odd Cycle Transversal on H-free graphs

Tree decompositions meet induced matchings: beyond Max Weight Independent Set

Odd Cycle Transversal on $H$ -free graphs