1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
Covering triangular grids with multiplicity
Abdul Basit, Alexander Clifton, Paul Horn
Motivated by classical work of Alon and Füredi, we introduce and address the following problem: determine the minimum number of affine hyperplanes in needed to cover…
An Extremal Problem on Rainbow Spanning Trees in Graphs
Matthew DeVilbiss, Bradley Fain, Amber Holmes +3
A spanning tree of an edge-colored graph is rainbow provided that each of its edges receives a distinct color. In this paper we consider the natural extremal problem of maximizing…
Two Layer 3D Floor Planning
Paul Horn, Gabor Lippner
A 3D floor plan is a non-overlapping arrangement of blocks within a large box. Floor planning is a central notion in chip-design, and with recent advances in 3D integrated circuits…
Spreading Processes and Large Components in Ordered, Directed Random Graphs
Paul Horn, Malik Magdon-Ismail
Order the vertices of a directed random graph \math{v_1,...,v_n}; edge \math{(v_i,v_j)} for \math{i<j} exists independently with probability \math{p}. This random graph model is re…