Search Results - "Xavier da Silveira, Luís Fernando Schultz"

Constant delay lattice train schedules by De Carufel, Jean-Lou, Hill, Darryl, Maheshwari, Anil, Roy, Sasanka, da Silveira, Luís Fernando Schultz Xavier

“…The following geometric vehicle scheduling problem has been considered: given continuous curves f1,…,fn:R→R2, find non-negative delays t1,…,tn minimizing…”
Get full text

Geodesic obstacle representation of graphs by Bose, Prosenjit, Carmi, Paz, Dujmović, Vida, Mehrabi, Saeed, Montecchiani, Fabrizio, Morin, Pat, Xavier da Silveira, Luís Fernando Schultz

“…An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such…”
Get full text

More Turán-Type Theorems for Triangles in Convex Point Sets by Aronov, Boris, Dujmović, Vida, Morin, Pat, Ooms, Aurélien, Xavier da Silveira, Luı́s Fernando Schultz

“… We study the following family of problems: Given a set of $n$ points in convex position, what is the maximum number triangles one can create having these…”
Get full text

The Minimum Moving Spanning Tree Problem by Akitaya, Hugo, Biniaz, Ahmad, Bose, Prosenjit, De Carufel, Jean-Lou, Maheshwari, Anil, Da Silveira, Luís Fernando Schultz Xavier, Smid, Michiel

“…We investigate the problem of finding a spanning tree of a set of $n$ moving points in $\mathbb{R}^{\dim}$ that minimizes the maximum total weight (under any…”
Get full text

An Instance-Based Algorithm for Deciding the Bias of a Coin by da Silveira, Luís Fernando Schultz Xavier, Smid, Michiel

“…Let $q \in (0,1)$ and $\delta \in (0,1)$ be real numbers, and let $C$ be a coin that comes up heads with an unknown probability $p$, such that $p \neq q$. We…”
Get full text

Constant Delay Lattice Train Schedules by De Carufel, Jean-Lou, Hill, Darryl, Maheshwari, Anil, Roy, Sasanka, da Silveira, Luís Fernando Schultz Xavier

“…The following geometric vehicle scheduling problem has been considered: given continuous curves $f_1, \ldots, f_n : \mathbb{R} \rightarrow \mathbb{R}^2$, find…”
Get full text

Approximability of Covering Cells with Line Segments by Carmi, Paz, Maheshwari, Anil, Mehrabi, Saeed, da Silveira, Luís Fernando Schultz Xavier

“…In COCOA 2015, Korman et al. studied the following geometric covering problem: given a set $S$ of $n$ line segments in the plane, find a minimum number of line…”
Get full text

More Tur\'an-Type Theorems for Triangles in Convex Point Sets by Aronov, Boris, Dujmović, Vida, Morin, Pat, Ooms, Aurélien, da Silveira, Luís Fernando Schultz Xavier

“…We study the following family of problems: Given a set of $n$ points in convex position, what is the maximum number triangles one can create having these…”
Get full text

Geodesic Obstacle Representation of Graphs by Bose, Prosenjit, Carmi, Paz, Dujmovic, Vida, Mehrabi, Saeed, Montecchiani, Fabrizio, Morin, Pat, da Silveira, Luis Fernando Schultz Xavier

“…An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such…”
Get full text