Skip to main content

3 Result(s)

within Bahareh Banyassady Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees

    In the limited-workspace model, we assume that the input of size n lies in a random access read-only memory. The output has to be reported sequentially, and it cannot be accessed or modified. In addition, there i...

    Bahareh Banyassady, Luis Barba, Wolfgang Mulzer in LATIN 2018: Theoretical Informatics (2018)

  2. No Access

    Chapter and Conference Paper

    Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon

    We study the problem of computing the k-visibility region in the memory-constrained model. In this model, the input resides in a randomly accessible read-only memory of O(n) words, with

    Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose… in WALCOM: Algorithms and Computation (2017)

  3. No Access

    Chapter and Conference Paper

    Obedient Plane Drawings for Disk Intersection Graphs

    Let  \(\mathcal D\) be a set of disks and G be the intersection graph of 

    Bahareh Banyassady, Michael Hoffmann, Boris Klemz… in Algorithms and Data Structures (2017)