2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DM2019
Longest paths in 2-edge-connected cubic graphs
Nikola K. Blanchard, Eldar Fischer, Oded Lachish +1
We prove almost tight bounds on the length of paths in -edge-connected cubic graphs. Concretely, we show that (i) every -edge-connected cubic graph of size has a path of…
cs.CC2016★ 2 cited
Improving and extending the testing of distributions for shape-restricted properties
Eldar Fischer, Oded Lachish, Yadu Vasudev
Distribution testing deals with what information can be deduced about an unknown distribution over , where the algorithm is only allowed to obtain a relatively smal…
cs.CC2010
Two-phase algorithms for the parametric shortest path problem
Eldar Fischer, Oded Lachish, Raphael Yuster
A {\em parametric weighted graph} is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obtains…