default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYeganeh Bahoo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Junseo Kim, Jill Aghyourli Zalat, Yeganeh Bahoo, Sajad Saeedi G.:
Structure from WiFi (SfW): RSSI-Based Geometric Mapping of Indoor Environments. ACC 2024: 259-264- [c12]Somnath Kundu, Yeganeh Bahoo, Steven M. LaValle:
Systematic Escape Using Billiard Moves. RoMoCo 2024: 285-290 - [i7]Junseo Kim, Jill Aghyourli Zalat, Yeganeh Bahoo, Sajad Saeedi:
Structure from WiFi (SfW): RSSI-based Geometric Mapping of Indoor Environments. CoRR abs/2403.02235 (2024) - [i6]Christopher Kolios, Yeganeh Bahoo, Sajad Saeedi G.:
DPPE: Dense Pose Estimation in a Plenoxels Environment using Gradient Approximation. CoRR abs/2403.10773 (2024) - [i5]Junseo Kim, Matthew Lisondra, Yeganeh Bahoo, Sajad Saeedi G.:
Inverse k-visibility for RSSI-based Indoor Geometric Mapping. CoRR abs/2408.07757 (2024) - 2023
- [c11]Yeganeh Bahoo, Somnath Kundu, Kody Manastyrski:
Segment Visibility for k-Transmitters. ALGOWIN 2023: 1-12 - [c10]Yeganeh Bahoo, Onur Cagirici, Kody Manastyrski, Rahnuma Islam Nishat, Christopher Kolios, Roni Sherman:
Conflict-Free Chromatic Guarding of Orthogonal Polygons with Sliding Cameras. CCCG 2023: 63-70 - [c9]Somnath Kundu, Yeganeh Bahoo, Onur Çagirici, Steven M. LaValle:
Arithmetic Billiard Paths Revisited: Escaping from a Rectangular Room. MMAR 2023: 478-483 - 2022
- [c8]Onur Çagirici, Yeganeh Bahoo, Steven M. LaValle:
Bouncing Robots in Rectilinear Polygons. MMAR 2022: 193-198 - [e1]Yeganeh Bahoo, Konstantinos Georgiou:
Proceedings of the 34th Canadian Conference on Computational Geometry, CCCG 2022, Toronto Metropolitan University, Toronto, Ontario, Canada, August 25-27, 2022. 2022 [contents] - 2020
- [j3]Yeganeh Bahoo
, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer:
Computing the k-Visibility Region of a Point in a Polygon. Theory Comput. Syst. 64(7): 1292-1306 (2020) - [i4]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CoRR abs/2004.07996 (2020)
2010 – 2019
- 2019
- [j2]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit K. Bose, Stephane Durocher, Wolfgang Mulzer:
A time-space trade-off for computing the k-visibility region of a point in a polygon. Theor. Comput. Sci. 789: 13-21 (2019) - [j1]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour:
Polygon simplification by minimizing convex corners. Theor. Comput. Sci. 791: 76-86 (2019) - [c7]Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher:
Watchtower for k-crossing Visibility. CCCG 2019: 203-209 - [c6]Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer:
Computing the k-Crossing Visibility Region of a Point in a Polygon. IWOCA 2019: 10-21 - 2018
- [c5]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CCCG 2018: 54-60 - [i3]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour:
Polygon Simplification by Minimizing Convex Corners. CoRR abs/1812.05656 (2018) - 2017
- [c4]Yeganeh Bahoo, Stephane Durocher, Sahar Mehrpour, Debajyoti Mondal:
Exploring Increasing-Chord Paths and Trees. CCCG 2017: 19-24 - [c3]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer:
Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon. WALCOM 2017: 308-319 - [i2]Yeganeh Bahoo, Stephane Durocher, Sahar Mehrpour, Debajyoti Mondal:
Exploring Increasing-Chord Paths and Trees. CoRR abs/1702.08380 (2017) - 2016
- [c2]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Debajyoti Mondal:
Polygon Simplification by Minimizing Convex Corners. COCOON 2016: 547-559 - [i1]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer:
Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon. CoRR abs/1603.02853 (2016) - 2015
- [c1]Yeganeh Bahoo, Andrea Bunt, Stephane Durocher, Sahar Mehrpour:
Drawing Graphs Using Body Gestures. GD 2015: 561-562
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-25 01:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
