E. Canale

activity

19972023

most citedA Lower Bound for Chaos on the Elliptical Stadium

17 citations · 20 across the 10 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2020

Tromino Tilings with Pegs via Flow Networks

Javier T. Akagi, Eduardo A. Canale, Marcos Villagra

A tromino tiling problem is a packing puzzle where we are given a region of connected lattice squares and we want to decide whether there exists a tiling of the region using tromin…

cs.DS2014

Irrelevant Components and Exact Computation of the Diameter Constrained Reliability

Eduardo Canale, Pablo Romero, Gerardo Rubino

Let $G = (V, E)$ be a simple graph with $∣ V ∣ = n$ nodes and $∣ E ∣ = m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p = (p_{1}, ..., p_{m}) \in [0, 1]^{m}$ and a positive integer $d…