Kaveh Khoshkhah

According to our database, Kaveh Khoshkhah authored at least 20 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

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., October, 2023

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

Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Sadok Ben Yahia, Amnir Hadachi

CoRR, 2023

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

Proceedings of the 1st ACM SIGSPATIAL International Workshop on Sustainable Mobility, 2023

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

A Real-Time Model for Pedestrian Flow Estimation in Urban Areas based on IoT Sensors.

Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Amnir Hadachi

Proceedings of the 25th IEEE International Conference on Intelligent Transportation Systems, 2022

2020

Weighted Upper Edge Cover: Complexity and Approximability.

Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora

J. Graph Algorithms Appl., 2020

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

OD-Matrix Extraction based on Trajectory Reconstruction from Mobile Data.

Mozhgan Pourmoradnasseri, Kaveh Khoshkhah, Artjom Lind, Amnir Hadachi

Proceedings of the 2019 International Conference on Wireless and Mobile Computing, 2019

Correction to: Weighted Upper Edge Cover: Complexity and Approximability.

Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Du nombre maximum d'ensembles fermés en 3 dimensions.

Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah

Proceedings of the Extraction et Gestion des connaissances, 2019

2018

On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope.

Kaveh Khoshkhah, Dirk Oliver Theis

Oper. Res. Lett., 2018

Fooling sets and the Spanning Tree polytope.

Kaveh Khoshkhah, Dirk Oliver Theis

Inf. Process. Lett., 2018

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs.

Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah

CoRR, 2018

Enumerating Minimal Transversals of Hypergraphs without Small Holes.

Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

Extended Spanning Star Forest Problems.

Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis

Proceedings of the Combinatorial Optimization and Applications, 2017

2015

On finding orientations with the fewest number of vertices with small out-degree.

Kaveh Khoshkhah

Discret. Appl. Math., 2015

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 fewest number of vartices with small out-degree.

Kaveh Khoshkhah

CoRR, 2014

2013

A Study of Monopolies in Graphs.

Kaveh Khoshkhah, M. Nemati, Hossein Soltani, Manouchehr Zaker

Graphs Comb., 2013

2012

On dynamic monopolies of graphs: The average and strict majority thresholds.

Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker

Discret. Optim., 2012