Mozhgan Pourmoradnasseri

Orcid: 0000-0002-2092-816X

According to our database1, Mozhgan Pourmoradnasseri authored at least 16 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Random Walk Approach for Simulation-Based Continuous Dynamic Traffic Assignment.
CoRR, 2023

Exploring Machine Learning Techniques to Identify Important Factors Leading to Injury in Curve Related Crashes.
CoRR, 2023

COVID-19, From Lockdown to Recovery: Exploring the Dynamics of Bike-Sharing and Public Transport in Tartu, Estonia.
Proceedings of the 1st ACM SIGSPATIAL International Workshop on Sustainable Mobility, 2023

Power of the Data in the Analysis and Evaluation of Bicycle-sharing Integration in an Urban Ecosystem: a Case Study in Tartu City.
Proceedings of the 8th International Conference on Models and Technologies for Intelligent Transportation Systems, 2023

2022
A Survey on the Advancement of Travel Time Estimation Using Mobile Phone Network Data.
IEEE Trans. Intell. Transp. Syst., 2022

Real-Time System for Daily Modal Split Estimation and OD Matrices Generation Using IoT Data: A Case Study of Tartu City.
Sensors, 2022

A Real-Time Model for Pedestrian Flow Estimation in Urban Areas based on IoT Sensors.
Proceedings of the 25th IEEE International Conference on Intelligent Transportation Systems, 2022

2019
OD-Matrix Extraction based on Trajectory Reconstruction from Mobile Data.
Proceedings of the 2019 International Conference on Wireless and Mobile Computing, 2019

2018
Enumerating Minimal Transversals of Hypergraphs without Small Holes.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Short note on the number of 1-ascents in dispersed Dyck paths.
Discret. Math. Algorithms Appl., 2017

The Rectangle Covering Number of Random Boolean Matrices.
Electron. J. Comb., 2017

Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract).
Proceedings of the Theory and Applications of Models of Computation, 2017

The (Minimum) Rank of Typical Fooling-Set Matrices.
Proceedings of the Computer Science - Theory and Applications, 2017

The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract).
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
The (minimum) rank of typical fooling set matrices.
CoRR, 2016

On the Graph of the Pedigree Polytope.
CoRR, 2016


  Loading...