57 citations · 83 across the 11 of their papers we have counts for
13 papers
Hamiltonian Properties of DCell Networks
Xi Wang, Alejandro Erickson, Jianxi Fan +1
DCell has been proposed for data centers as a server centric interconnection network structure. DCell can support millions of servers with high network capacity by only using commo…
The Stellar Transformation: From Interconnection Networks to Datacenter Networks
Alejandro Erickson, and Iain A. Stewart, Javier Navaridas +1
The first dual-port server-centric datacenter network, FiConn, was introduced in 2009 and there are several others now in existence; however, the pool of topologies to choose from…
Nested Recurrence Relations With Conolly-Like Solutions
Alejandro Erickson, Abraham Isgur, Bradley W. Jackson +2
A nondecreasing sequence of positive integers is -Conolly, or Conolly-like for short, if for every positive integer the number of times that occurs in the sequence i…
Routing Algorithms for Recursively-Defined Data Centre Networks
Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas +1
The server-centric data centre network architecture can accommodate a wide variety of network topologies. Newly proposed topologies in this arena often require several rounds of an…
An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar
Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas +1
DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain…
Generating Tatami Coverings Efficiently
Alejandro Erickson, Frank Ruskey
We present two algorithms to list certain classes of monomino-domino coverings which conform to the \emph{tatami} restriction; no four tiles meet. Our methods exploit structural fe…
Domino Tatami Covering is NP-complete
Alejandro Erickson, Frank Ruskey
A covering with dominoes of a rectilinear region is called \emph{tatami} if no four dominoes meet at any point. We describe a reduction from planar 3SAT to Domino Tatami Covering.…
Enumerating maximal tatami mat coverings of square grids with vertical dominoes
Alejandro Erickson, Frank Ruskey
We enumerate a certain class of monomino-domino coverings of square grids, which conform to the \emph{tatami} restriction; no four tiles meet. Let be the set of mon…
Tatami Maker: A combinatorially rich mechanical game board
Alejandro Erickson
Japanese tatami mats are often arranged so that no four mats meet. This local restriction imposes a rich combinatorial structure when applied to monomino-domino coverings of rectil…
Monomer-dimer tatami tilings of square regions
Alejandro Erickson, Mark Schurch
We prove that the number of monomer-dimer tilings of an square grid, with monomers in which no four tiles meet at any point is , when and $…
Auspicious tatami mat arrangements
Alejandro Erickson, Frank Ruskey, Mark Schurch +1
An \emph{auspicious tatami mat arrangement} is a tiling of a rectilinear region with two types of tiles, tiles (dimers) and tiles (monomers). The tiles mu…
Connectivity graphs of uncertainty regions
Erin Chambers, Alejandro Erickson, Sándor Fekete +7
We study connectivity relations among points, where the precise location of each input point lies in a region of uncertainty. We distinguish two fundamental scenarios under which u…
Sums of squares and negative correlation for spanning forests of series parallel graphs
Alejandro Erickson
We provide new evidence that spanning forests of graphs satisfy the same negative correlation properties as spanning trees, derived from Lord Rayleigh's monotonicity property for e…