Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Keikha, Vahideh
8  Ergebnisse:
Artikel (Online) X
Personensuche X
?
1

Constrained hitting set problem with intervals: Hardness, F..:

Acharyya, Ankush ; Keikha, Vahideh ; Majumdar, Diptapriyo.
Theoretical Computer Science.  990 (2024)  - p. 114402 , 2024
Link: https://doi.org/10.1016/..
 
?
2

On Voronoi visibility maps of 1.5D terrains with multiple v..:

Keikha, Vahideh ; Saumell, Maria
Information Processing Letters.  181 (2023)  - p. 106362 , 2023
Link: https://doi.org/10.1016/..
 
?
3

Minimum color spanning circle of imprecise points:

Acharyya, Ankush ; Jallu, Ramesh K. ; Keikha, Vahideh..
Theoretical Computer Science.  930 (2022)  - p. 116-127 , 2022
Link: https://doi.org/10.1016/..
 
?
4

Sampling and sparsification for approximating the packednes..:

Aghamolaei, Sepideh ; Keikha, Vahideh ; Ghodsi, Mohammad.
International Journal of Data Science and Analytics.  15 (2022)  2 - p. 201-216 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Largest and smallest area triangles on imprecise points:

Keikha, Vahideh ; Löffler, Maarten ; Mohades, Ali
Computational Geometry.  95 (2021)  - p. 101742 , 2021
Link: https://doi.org/10.1016/..
 
?
6

A fully polynomial time approximation scheme for the smalle..:

Keikha, Vahideh ; Löffler, Maarten ; Mohades, Ali
Theoretical Computer Science.  814 (2020)  - p. 259-270 , 2020
Link: https://doi.org/10.1016/..
 
?
7

Windowing queries using Minkowski sum and their extension t..:

Aghamolaei, Sepideh ; Keikha, Vahideh ; Ghodsi, Mohammad.
The Journal of Supercomputing.  77 (2020)  1 - p. 936-972 , 2020
Link: https://doi.org/10.1007/..
 
?
8

Maximum-area triangle in a convex polygon, revisited:

van der Hoog, Ivor ; Keikha, Vahideh ; Löffler, Maarten..
Information Processing Letters.  161 (2020)  - p. 105943 , 2020
Link: https://doi.org/10.1016/..
 
1-8