On dynamic monopolies of graphs: The average and strict majority thresholds. - Kaveh Khoshkhah; Hossein Soltani; Manouchehr Zaker (Discret. Optim., 2012)

A Study of Monopolies in Graphs. - Kaveh Khoshkhah; M. Nemati; Hossein Soltani; Manouchehr Zaker (Graphs Comb., 2013)

On finding orientations with fewest number of vartices with small out-degree. - Kaveh Khoshkhah (CoRR, 2014)

Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks. - Kaveh Khoshkhah; Hossein Soltani; Manouchehr Zaker (Discret. Appl. Math., 2014)

On finding orientations with the fewest number of vertices with small out-degree. - Kaveh Khoshkhah (Discret. Appl. Math., 2015)

Extended Spanning Star Forest Problems. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Dirk Oliver Theis (COCOA (1), 2017)

Enumerating Minimal Transversals of Hypergraphs without Small Holes. - Mamadou Moustapha Kanté; Kaveh Khoshkhah; Mozhgan Pourmoradnasseri (MFCS, 2018)

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. - Alexandre Bazin; Laurent Beaudou; Giacomo Kahn; Kaveh Khoshkhah (CoRR, 2018)

Fooling sets and the Spanning Tree polytope. - Kaveh Khoshkhah; Dirk Oliver Theis (Inf. Process. Lett., 2018)

On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope. - Kaveh Khoshkhah; Dirk Oliver Theis (Oper. Res. Lett., 2018)

Du nombre maximum d'ensembles fermés en 3 dimensions. - Alexandre Bazin; Laurent Beaudou; Giacomo Kahn; Kaveh Khoshkhah (EGC, 2019)

Correction to: Weighted Upper Edge Cover: Complexity and Approximability. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (WALCOM, 2019)

OD-Matrix Extraction based on Trajectory Reconstruction from Mobile Data. - Mozhgan Pourmoradnasseri; Kaveh Khoshkhah; Artjom Lind; Amnir Hadachi (WiMob, 2019)

Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Dirk Oliver Theis (Theor. Comput. Sci., 2019)

Weighted Upper Edge Cover: Complexity and Approximability. - Kaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (J. Graph Algorithms Appl., 2020)

A Real-Time Model for Pedestrian Flow Estimation in Urban Areas based on IoT Sensors. - Kaveh Khoshkhah; Mozhgan Pourmoradnasseri; Amnir Hadachi (ITSC, 2022)

Real-Time System for Daily Modal Split Estimation and OD Matrices Generation Using IoT Data: A Case Study of Tartu City. - Kaveh Khoshkhah; Mozhgan Pourmoradnasseri; Amnir Hadachi; Helen Tera; Jakob Mass; Erald Keshi; Shan Wu (Sensors, 2022)

COVID-19, From Lockdown to Recovery: Exploring the Dynamics of Bike-Sharing and Public Transport in Tartu, Estonia. - Mozhgan Pourmoradnasseri; Karl Gustav Loog; Kaveh Khoshkhah (SuMob@SIGSPATIAL, 2023)

A Random Walk Approach for Simulation-Based Continuous Dynamic Traffic Assignment. - Kaveh Khoshkhah; Mozhgan Pourmoradnasseri; Sadok Ben Yahia; Amnir Hadachi (CoRR, 2023)

A hidden Markov model method for non-stationary noise reduction: case study on Sentinel data for mowing detection. - Kaveh Khoshkhah; Kyrylo Medianovskyi; Dmitry Kolesnykov; Amnir Hadachi; Kaupo Voormansik (Signal Image Video Process., 2023)

Refining Urban Microscopic Traffic Simulations Accuracy Using a Customized Random Walk Model for Dynamic Stochastic Route Choice. - Kaveh Khoshkhah; Mozhgan Pourmoradnasseri; Behzad Bamdad Mehrabani; Sadok Ben Yahia; Amnir Hadachi (SAC, 2025)