default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Gholami Rudi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i9]Ali Gholami Rudi:
Maximum Centre-Disjoint Mergeable Disks. CoRR abs/2301.04350 (2023)- 2021
- [j13]Ali Gholami Rudi:
Maximizing the Number of Visible Labels on a Rotating Map. Sci. Ann. Comput. Sci. 31(2): 293-313 (2021) - [j12]Ali Gholami Rudi:
Place the Vertices Anywhere on the Curve and Simplify. Fundam. Informaticae 180(3): 275-287 (2021) - [j11]Ali Gholami Rudi:
Approximate curve-restricted simplification of polygonal curves. Int. J. Comput. Math. Comput. Syst. Theory 6(2): 178-187 (2021) - 2020
- [j10]Ali Gholami Rudi:
Approximate Discontinuous Trajectory Hotspots. Open Comput. Sci. 10(1): 444-449 (2020) - [j9]Ali Gholami Rudi:
Where Were the Birds Staying Last Week? New Math. Nat. Comput. 16(3): 581-592 (2020)
2010 – 2019
- 2019
- [j8]Ali Gholami Rudi, Raimi Ayinde Rufai
:
Enumerating Collinear Points in Higher Dimensions. Sci. Ann. Comput. Sci. 29(1): 81-100 (2019) - [j7]Ali Gholami Rudi:
Identifying and Querying Regularly Visited Places. Sci. Ann. Comput. Sci. 29(2): 185-201 (2019) - [j6]Ali Gholami Rudi:
Succinct enumeration of distant vertex pairs. Discret. Math. Algorithms Appl. 11(6): 1950076:1-1950076:7 (2019) - [j5]Ali Gholami Rudi:
Approximate Hotspots of Orthogonal Trajectories. Fundam. Informaticae 167(4): 271-285 (2019) - [i8]Ali Gholami Rudi:
Approximate Discontinuous Trajectory Hotspots. CoRR abs/1901.01763 (2019) - [i7]Ali Gholami Rudi:
Packing Rotating Segments. CoRR abs/1907.12758 (2019) - 2018
- [c1]Ali Gholami Rudi:
Looking for Bird Nests: Identifying Stay Points with Bounded Gaps. CCCG 2018: 334-339 - [i6]Ali Gholami Rudi:
Looking for Bird Nests: Identifying Stay Points with Bounded Gaps. CoRR abs/1803.07773 (2018) - [i5]Ali Gholami Rudi:
Approximate Curve-Restricted Simplification of Polygonal Curves. CoRR abs/1811.04552 (2018) - 2017
- [j4]Ali Gholami Rudi:
An improved lower bound for general position subset selection. Int. J. Comput. Sci. Math. 8(6): 562-569 (2017) - [i4]Ali Gholami Rudi:
An Improved Algorithm for General Position Subset Selection. CoRR abs/1702.08654 (2017) - [i3]Ali Gholami Rudi, Raimi Ayinde Rufai:
A Practical Algorithm for Enumerating Collinear Points. CoRR abs/1706.05412 (2017) - [i2]Ali Gholami Rudi:
Approximate Hotspots of Orthogonal Trajectories. CoRR abs/1710.05185 (2017) - [i1]Ali Gholami Rudi:
Time-Windowed Contiguous Hotspot Queries. CoRR abs/1711.03795 (2017) - 2015
- [j3]Ali Gholami Rudi, Saeed Jalili:
Image preprocessing with a parallel optoelectronic processor. Comput. Electr. Eng. 46: 554-565 (2015) - 2013
- [j2]Javad Salimi Sartakhti, Saeed Jalili, Ali Gholami Rudi:
A new light-based solution to the Hamiltonian path problem. Future Gener. Comput. Syst. 29(2): 520-527 (2013) - [j1]Ali Gholami Rudi, Saeed Shahrivari, Saeed Jalili, Zahra Razaghi Moghadam Kashani:
RANGI: A Fast List-Colored Graph Motif Finding Algorithm. IEEE ACM Trans. Comput. Biol. Bioinform. 10(2): 504-513 (2013)
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-04-24 23:05 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:
