M. Valencia-Pabon

activity

20062026

most citedOn the bend number of circular-arc graphs as edge intersection graphs of paths on a grid

13 citations · 28 across the 11 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Token sliding independent set reconfiguration on graphs with few $P_{4}$ 's

Lucia Busolini, Mario Valencia-Pabon

We consider the INDEPENDENT SET RECONFIGURATION problem under the Token Sliding rule. Let $I$ be an independent set of a simple undirected graph $G$ . Suppose that each vertex of $I…

cs.DS2025

Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes

Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza +1

An elimination tree of a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $v$ and recursing on the connected components of $G - v$ to obtain th…

Token sliding independent set reconfiguration on graphs with few P4​'s

Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes

Token sliding independent set reconfiguration on graphs with few $P_{4}$ 's