E-LIB Suche - Ergebnisse für: Keikha, Vahideh

1

Computing Largest Minimum Color-Spanning Intervals of Impre..:

, In: Lecture Notes in Computer Science; LATIN 2024: Theoretical Informatics,

Acharyya, Ankush ; Keikha, Vahideh ; Saumell, Maria. - p. 81-96 , 2024

Link: https://doi.org/10.1007/..

2

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/..

3

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/..

4

Large k-Gons in a 1.5D Terrain:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Keikha, Vahideh - p. 49-60 , 2022

Link: https://doi.org/10.1007/..

5

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/..

6

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/..

7

On the k-colored Rainbow Sets in Fixed Dimensions:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,

Keikha, Vahideh ; Keikha, Hamidreza ; Mohades, Ali - p. 587-601 , 2021

Link: https://doi.org/10.1007/..

8

Constrained Hitting Set Problem with Intervals:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Acharyya, Ankush ; Keikha, Vahideh ; Majumdar, Diptapriyo. - p. 604-616 , 2021

Link: https://doi.org/10.1007/..

9

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/..

10

Cause I'm a Genial Imprecise Point: Outlier Detection for U..:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Keikha, Vahideh ; Keikha, Hamidreza ; Mohades, Ali - p. 165-178 , 2021

Link: https://doi.org/10.1007/..

11

Minimum Color Spanning Circle in Imprecise Setup:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Acharyya, Ankush ; Jallu, Ramesh K. ; Keikha, Vahideh.. - p. 257-268 , 2021

Link: https://doi.org/10.1007/..

12

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/..

13

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/..

14

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/..

15

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

Keikha, Vahideh ; Saumell, Maria
http://arxiv.org/abs/2301.05049. , 2023

Link: http://arxiv.org/abs/230..