Lucas de Oliveira Silva

collaborators

2 papers

cs.CG2026

Freeze-Tag is Strongly NP-hard in 2D with $L_{p}$ Distances

Lucas de Oliveira Silva, Lehilton Lelis Chaves Pedrosa

The Freeze-Tag Problem (FTP) asks for the minimum time needed to activate a swarm of robots, starting from a single active robot. When an active robot reaches a frozen robot, the l…

cs.CC2025

Realizing Graphs with Cut Constraints

Lucas de Oliveira Silva, VÃtor Gomes Chagas, Samuel PlaÃ§a de Paula +2

Given a finite non-decreasing sequence $d = (d_{1}, \dots, d_{n})$ of natural numbers, the Graph Realization problem asks whether $d$ is a graphic sequence, i.e., there exists a labeled s…

Freeze-Tag is Strongly NP-hard in 2D with Lp​ Distances

Realizing Graphs with Cut Constraints

Freeze-Tag is Strongly NP-hard in 2D with $L_{p}$ Distances