| A study of monopolies in graphs K Khoshkhah, M Nemati, H Soltani, M Zaker Graphs and Combinatorics 29 (5), 1417-1427, 2013 | 36 | 2013 |
| Unveiling large-scale commuting patterns based on mobile phone cellular network data A Hadachi, M Pourmoradnasseri, K Khoshkhah Journal of Transport Geography 89, 102871, 2020 | 29 | 2020 |
| On dynamic monopolies of graphs: the average and strict majority thresholds K Khoshkhah, H Soltani, M Zaker Discrete Optimization 9 (2), 77-83, 2012 | 28 | 2012 |
| OD-matrix extraction based on trajectory reconstruction from mobile data M Pourmoradnasseri, K Khoshkhah, A Lind, A Hadachi 2019 International Conference on Wireless and Mobile Computing, Networking …, 2019 | 15 | 2019 |
| Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks K Khoshkhah, H Soltani, M Zaker Discrete Applied Mathematics 171, 81-89, 2014 | 14 | 2014 |
| Weighted Upper Edge Cover: Complexity and Approximability. K Khoshkhah, MK Ghadikolaei, J Monnot, F Sikora J. Graph Algorithms Appl. 24 (2), 65-88, 2020 | 12 | 2020 |
| Real-time system for daily modal split estimation and OD matrices generation using IoT data: A case study of Tartu City K Khoshkhah, M Pourmoradnasseri, A Hadachi, H Tera, J Mass, E Keshi, ... Sensors 22 (8), 3030, 2022 | 10 | 2022 |
| A real-time model for pedestrian flow estimation in urban areas based on IoT sensors K Khoshkhah, M Pourmoradnasseri, A Hadachi 2022 IEEE 25th International Conference on Intelligent Transportation …, 2022 | 8 | 2022 |
| Near-real-time dynamic noise mapping and exposure assessment using calibrated microscopic traffic simulations S Baclet, K Khoshkhah, M Pourmoradnasseri, R Rumpler, A Hadachi Transportation Research Part D: Transport and Environment 124, 103922, 2023 | 7 | 2023 |
| On the combinatorial lower bound for the extension complexity of the spanning tree polytope K Khoshkhah, DO Theis Operations Research Letters 46 (3), 352-355, 2018 | 5 | 2018 |
| Enumerating minimal transversals of hypergraphs without small holes MM Kanté, K Khoshkhah, M Pourmoradnasseri 43rd International Symposium on Mathematical Foundations of Computer Science …, 2018 | 5 | 2018 |
| Fooling Sets and the Spanning Tree Polytope K Khoshkhah, DO Theis Information Processing Letters, 2017 | 5 | 2017 |
| On finding orientations with the fewest number of vertices with small out-degree K Khoshkhah Discrete Applied Mathematics 194, 163-166, 2015 | 5 | 2015 |
| Complexity and approximability of extended spanning star forest problems in general and complete graphs K Khoshkhah, MK Ghadikolaei, J Monnot, DO Theis Theoretical Computer Science 775, 1-15, 2019 | 3 | 2019 |
| Extended spanning star forest problems K Khoshkhah, M Khosravian Ghadikolaei, J Monnot, DO Theis International Conference on Combinatorial Optimization and Applications, 195-209, 2017 | 3 | 2017 |
| On the largest dynamic monopolies of graphs with a given average threshold K Khoshkhah, M Zaker Canadian Mathematical Bulletin 58, 306-316, 2015 | 3 | 2015 |
| Leveraging IoT data stream for near‐real‐time calibration of city‐scale microscopic traffic simulation M Pourmoradnasseri, K Khoshkhah, A Hadachi IET Smart Cities 5 (4), 269-290, 2023 | 2 | 2023 |
| Bounding the number of minimal transversals in tripartite 3-uniform hypergraphs A Bazin, L Beaudou, G Kahn, K Khoshkhah Discrete Mathematics & Theoretical Computer Science 23 (Special issues), 2023 | 2 | 2023 |
| Real-time calibration of disaggregated traffic demand M Pourmoradnasseri, K Khoshkhah, A Hadachi arXiv preprint arXiv:2210.17315, 2022 | 2 | 2022 |
| A Random Walk Approach for Simulation-Based Continuous Dynamic Traffic Assignment K Khoshkhah, M Pourmoradnasseri, SB Yahia, A Hadachi arXiv preprint arXiv:2311.12440, 2023 | 1 | 2023 |
Mozhgan PourmoradnasseriInstitute of Computer Science, University of TartuVerified email at ut.ee
