default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMozhgan Pourmoradnasseri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c8]Helen Tera
, Mozhgan Pourmoradnasseri, Amnir Hadachi:
Power of the Data in the Analysis and Evaluation of Bicycle-sharing Integration in an Urban Ecosystem: a Case Study in Tartu City. MT-ITS 2023: 1-6- [c7]Mozhgan Pourmoradnasseri, Karl Gustav Loog, Kaveh Khoshkhah:
COVID-19, From Lockdown to Recovery: Exploring the Dynamics of Bike-Sharing and Public Transport in Tartu, Estonia. SuMob@SIGSPATIAL 2023: 5-8 - [i6]Mehdi Moeinaddini, Mozhgan Pourmoradnasseri, Amnir Hadachi, Mario Cools:
Exploring Machine Learning Techniques to Identify Important Factors Leading to Injury in Curve Related Crashes. CoRR abs/2301.01771 (2023) - [i5]Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Sadok Ben Yahia, Amnir Hadachi:
A Random Walk Approach for Simulation-Based Continuous Dynamic Traffic Assignment. CoRR abs/2311.12440 (2023) - 2022
- [j4]Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Amnir Hadachi, Helen Tera, Jakob Mass, Erald Keshi, Shan Wu:
Real-Time System for Daily Modal Split Estimation and OD Matrices Generation Using IoT Data: A Case Study of Tartu City. Sensors 22(8): 3030 (2022) - [j3]Amnir Hadachi, Mozhgan Pourmoradnasseri:
A Survey on the Advancement of Travel Time Estimation Using Mobile Phone Network Data. IEEE Trans. Intell. Transp. Syst. 23(8): 11779-11788 (2022) - [c6]Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Amnir Hadachi:
A Real-Time Model for Pedestrian Flow Estimation in Urban Areas based on IoT Sensors. ITSC 2022: 4124-4130
2010 – 2019
- 2019
- [c5]Mozhgan Pourmoradnasseri, Kaveh Khoshkhah, Artjom Lind, Amnir Hadachi:
OD-Matrix Extraction based on Trajectory Reconstruction from Mobile Data. WiMob 2019: 1-8 - 2018
- [c4]Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri:
Enumerating Minimal Transversals of Hypergraphs without Small Holes. MFCS 2018: 55:1-55:15 - 2017
- [j2]Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
The Rectangle Covering Number of Random Boolean Matrices. Electron. J. Comb. 24(2): 2 (2017) - [j1]Kairi Kangro, Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
Short note on the number of 1-ascents in dispersed Dyck paths. Discret. Math. Algorithms Appl. 9(6): 1750077:1-1750077:8 (2017) - [c3]Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract). CALDAM 2017: 294-307 - [c2]Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
The (Minimum) Rank of Typical Fooling-Set Matrices. CSR 2017: 273-284 - [c1]Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract). TAMC 2017: 529-542 - 2016
- [i4]Mozhgan Pourmoradnasseri:
The (minimum) rank of typical fooling set matrices. CoRR abs/1608.07038 (2016) - [i3]Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract). CoRR abs/1611.08400 (2016) - [i2]Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract). CoRR abs/1611.08419 (2016) - [i1]Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
On the Graph of the Pedigree Polytope. CoRR abs/1611.08431 (2016)
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-10-07 21:20 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:
