7 citations · 13 across the 10 of their papers we have counts for
14 papers
Computing -Crossing Visibility through -levels
Frank Duque
Let be a set of straight lines in the plane (or planes in ). The -crossing visibility of a point on is the set of points in the…
Extinction time in growth models subject to binomial catastrophes
F. Duque, V. V. Junior, F. P. Machado +1
Populations are often subject to catastrophes that cause mass removal of individuals. Many stochastic growth models have been considered to explain such dynamics. Among the results…
On Optimal Coverage of a Tree with Multiple Robots
I. Aldana-Galván, J. C. Catana-Salazar, J. M. Díaz-Báñez +5
We study the algorithmic problem of optimally covering a tree with mobile robots. The tree is known to all robots, and our goal is to assign a walk to each robot in such a way…
RMF accessibility percolation on oriented graphs
Frank Duque, Daniel Ramirez-Gomez, Alejandro Roldán-Correa +1
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology: a random number, called its fitness, is assigned to each vertex of a graph, then a…
On the Laplacian spectra of token graphs
C. Dalfó, F. Duque, R. Fabila-Monroy +4
We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The -token graph of a graph is the graph whose vertices are the -subsets…
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
Oswin Aichholzer, Frank Duque, Ruy Fabila-Monroy +2
A drawing of a graph in the plane is {\it pseudolinear} if the edges of the drawing can be extended to doubly-infinite curves that form an arrangement of pseudolines, that is, any…