Benjamin Raichel is an Assistant Professor of Computer Science. His research interests include:

  • Algorithms and Theory
  • Discrete and Computational Geometry
  • Randomized and Approximation Algorithms

In 2018 the National Science Foundation awarded its CAREER Award for Dr. Raichel's project on geometric-based data anaysis.

Works in Treasures @ UT Dallas are made available exclusively for educational purposes such as research or instruction. Literary rights, including copyright for published works held by the creator(s) or their heirs, or other third parties may apply. All rights are reserved unless otherwise indicated by the copyright owner(s).

Recent Submissions

  • Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees 

    Nayyeri, A.; Raichel, Benjamin (Association for Computing Machinery, 2019-01)
    We describe a (1 + ε) approximation algorithm for finding the minimum distortion embedding of an npoint metric space, (X, d_X), into a tree with vertex set X. The running time of our algorithm is n²•(∆/ε)^{(O(δopt/ε))2λ+1} ...
  • Sparse Approximate Conic Hulls 

    Van Buskirk, Gregory; Raichel, Benjamin; Ruozzi, Nicholas
    We consider the problem of computing a restricted nonnegative matrix factorization (NMF) of an m × n matrix X. Specifically, we seek a factorization X ≈ BC, where the k columns of B are a subset of those from X and C ∈ ...
  • Geometric Packing Under Nonuniform Constraints 

    Ene, Alina; Har-Peled, Sariel; Raichel, Benjamin A. (SIAM Publications, 2018-10-22)
    We study the problem of discrete geometric packing. Here, given weighted regions (say, in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more ...