Folgen
Kaveh Khoshkhah
Kaveh Khoshkhah
ITS Lab, Institute of Computer Science, University of Tartu
Bestätigte E-Mail-Adresse bei ut.ee
Titel
Zitiert von
Zitiert von
Jahr
A study of monopolies in graphs
K Khoshkhah, M Nemati, H Soltani, M Zaker
Graphs and Combinatorics 29 (5), 1417-1427, 2013
362013
On dynamic monopolies of graphs: the average and strict majority thresholds
K Khoshkhah, H Soltani, M Zaker
Discrete Optimization 9 (2), 77-83, 2012
262012
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
132020
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
112014
Weighted Upper Edge Cover: Complexity and Approximability.
K Khoshkhah, MK Ghadikolaei, J Monnot, F Sikora
J. Graph Algorithms Appl. 24 (2), 65-88, 2020
92020
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
92019
Enumerating minimal transversals of hypergraphs without small holes
MM Kanté, K Khoshkhah, M Pourmoradnasseri
43rd International Symposium on Mathematical Foundations of Computer Science …, 2018
62018
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
52018
Fooling Sets and the Spanning Tree Polytope
K Khoshkhah, DO Theis
Information Processing Letters, 2017
52017
On finding orientations with the fewest number of vertices with small out-degree
K Khoshkhah
Discrete Applied Mathematics 194, 163-166, 2015
52015
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
32022
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
32019
Extended spanning star forest problems
K Khoshkhah, M Khosravian Ghadikolaei, J Monnot, DO Theis
Combinatorial Optimization and Applications: 11th International Conference …, 2017
32017
On the largest dynamic monopolies of graphs with a given average threshold
K Khoshkhah, M Zaker
Canadian Mathematical Bulletin 58, 306-316, 2015
32015
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
12022
Mining Large-scale Mobility Patterns Using Mobile Phone Network Data
A Hadachi, M Pourmoradnasseri, K Khoshkhah
12020
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
A Bazin, L Beaudou, G Kahn, K Khoshkhah
arXiv preprint arXiv:1807.09030, 2018
12018
Real-Time Calibration of Disaggregated Traffic Demand
M Pourmoradnasseri, K Khoshkhah, A Hadachi
arXiv preprint arXiv:2210.17315, 2022
2022
A Hidden Markov Model Method for Non-Stationary Noise Reduction, Case study on Sentinel Data for Mowing Detection
K Khoshkhah, K Medianovskyi, D Kolesnykov, A Hadachi, K Voormansik
2022
Du nombre maximum d'ensembles fermés en 3 dimensions
A Bazin, L Beaudou, G Kahn, K Khoshkhah
Extraction et Gestion des connaissances, 345--350, 2019
2019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20