E-LIB Suche - Ergebnisse für: Bahoo, Yeganeh

1

Segment Visibility for k-Transmitters:

, In: Algorithmics of Wireless Networks; Lecture Notes in Computer Science,

Bahoo, Yeganeh ; Kundu, Somnath ; Manastyrski, Kody - p. 1-12 , 2023

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

2

Arithmetic Billiard Paths Revisited: Escaping from a Rectan..:

, In: 2023 27th International Conference on Methods and Models in Automation and Robotics (MMAR),

Kundu, Somnath ; Bahoo, Yeganeh ; Cagirici, Onur. - p. 478-483 , 2023

Link: https://doi.org/10.1109/..

3

Discrete Planar Two-Watchtower Problem for k-Visibility:

, In: The 6th International Conference on Wireless, Intelligent and Distributed Environment for Communication; Lecture Notes on Data Engineering and Communications Technologies,

Bahoo, Yeganeh ; Kundu, Somnath ; Syed, Rudaba - p. 65-74 , 2023

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

4

Bouncing Robots in Rectilinear Polygons:

, In: 2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR),

Cagirici, Onur ; Bahoo, Yeganeh ; LaValle, Steven M. - p. 193-198 , 2022

Link: https://doi.org/10.1109/..

5

Computing the k-Visibility Region of a Point in a Polygon:

Bahoo, Yeganeh ; Bose, Prosenjit ; Durocher, Stephane.
Theory of Computing Systems. 64 (2020) 7 - p. 1292-1306 , 2020

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

6

Computing the k-Crossing Visibility Region of a Point in a ..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Bahoo, Yeganeh ; Bose, Prosenjit ; Durocher, Stephane. - p. 10-21 , 2019

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

7

A time–space trade-off for computing the k-visibility regio..:

Bahoo, Yeganeh ; Banyassady, Bahareh ; Bose, Prosenjit K...
Theoretical Computer Science. 789 (2019) - p. 13-21 , 2019

Link: https://doi.org/10.1016/..

8

Polygon simplification by minimizing convex corners:

Bahoo, Yeganeh ; Durocher, Stephane ; Mark Keil, J....
Theoretical Computer Science. 791 (2019) - p. 76-86 , 2019

Link: https://doi.org/10.1016/..

9

Compatible Paths on Labelled Point Sets:

Arseneva, Elena ; Bahoo, Yeganeh ; Biniaz, Ahmad...
http://arxiv.org/abs/2004.07996. , 2020

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

10

Compatible Paths on Labelled Point Sets:

Arseneva, Elena ; Bahoo, Yeganeh ; Biniaz, Ahmad...
local/https://arxiv.org/abs/2004.07996. , 2020

Link: http://hdl.handle.net/20..

11

Compatible Paths on Labelled Point Sets:

Arseneva, Elena ; Bahoo, Yeganeh ; Biniaz, Ahmad... , 2019

Link: http://hdl.handle.net/21..

12

Compatible Paths on Labelled Point Sets:

Arseneva, Elena ; Bahoo, Yeganeh ; Biniaz, Ahmad...
Arseneva, E. [et al.]. Compatible Paths on Labelled Point Sets. A: Canadian Conference on Computational Geometry. "CCCG 2018: 30th Canadian Conference on Computational Geometry: Manitoba, Canada: August 8-10, 2018: proceedings book". 2019, p. 54-60.. , 2019

Link: http://hdl.handle.net/21..

13

Polygon Simplification by Minimizing Convex Corners:

Bahoo, Yeganeh ; Durocher, Stephane ; Keil, J. Mark...
http://arxiv.org/abs/1812.05656. , 2018

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

14

Compatible Paths on Labelled Point Sets:

Arseneva, Elena ; Bahoo, Yeganeh ; Biniaz, Ahmad...
https://dipot.ulb.ac.be/dspace/bitstream/2013/326156/3/session2A-p2.pdf. , 2018

Link: http://hdl.handle.net/20..

15

Exploring Increasing-Chord Paths and Trees:

Bahoo, Yeganeh ; Durocher, Stephane ; Mehrpour, Sahar.
http://arxiv.org/abs/1702.08380. , 2017

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