4 citations · 9 across the 7 of their papers we have counts for
7 papers
On the Orchard crossing number of prisms, ladders and other related graphs
Elie Feder, David Garber
This paper deals with the Orchard crossing number of some families of graphs which are based on cycles. These include disjoint cycles, cycles which share a vertex and cycles which…
On the Orchard crossing number of complete bipartite graphs
Elie Feder, David Garber
We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs K_{n,n}.
The Maximum of the Maximum Rectilinear Crossing Numbers of d-regular Graphs of Order n
Matthew Alpert, Elie Feder, Heiko Harborth
We extend known results regarding the maximum rectilinear crossing number of the cycle graph (C_n) and the complete graph (K_n) to the class of general d-regular graphs R_{n,d}. We…
Towards the computation of the convex hull of a configuration from its corresponding separating matrix
Elie Feder, David Garber
In this paper, we cope with the following problem: compute the size of the convex hull of a configuration C, where the given data is the number of separating lines between any two…
The Generalized Word Problem for Braid Groups
Elie Feder
The braid group has recently attracted much attention. This is primarily based upon the discovery of its usage in various cryptosystems [AAG],[KLCHKP]. One major focus of current r…
Algorithmic Problems in the Braid Group
Elie Feder
We begin with a review of the notion of a braid group. We then discuss some known solutions to decision problems in braid groups. We then move on to proving new results in braid gr…