default search action
Kaveh Khoshkhah
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j10]Kaveh Khoshkhah, Kyrylo Medianovskyi, Dmitry Kolesnykov, Amnir Hadachi, Kaupo Voormansik:
A hidden Markov model method for non-stationary noise reduction: case study on Sentinel data for mowing detection. Signal Image Video Process. 17(7): 3477-3483 (2023) - 2022
- [j9]Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Amnir Hadachi, Helen Tera, Jakob Mass, Erald Keshi, Shan Wu:
Real-Time System for Daily Modal Split Estimation and OD Matrices Generation Using IoT Data: A Case Study of Tartu City. Sensors 22(8): 3030 (2022) - 2020
- [j8]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Weighted Upper Edge Cover: Complexity and Approximability. J. Graph Algorithms Appl. 24(2): 65-88 (2020) - 2019
- [j7]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis:
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. Theor. Comput. Sci. 775: 1-15 (2019) - 2018
- [j6]Kaveh Khoshkhah, Dirk Oliver Theis:
Fooling sets and the Spanning Tree polytope. Inf. Process. Lett. 132: 11-13 (2018) - [j5]Kaveh Khoshkhah, Dirk Oliver Theis:
On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope. Oper. Res. Lett. 46(3): 352-355 (2018) - 2015
- [j4]Kaveh Khoshkhah:
On finding orientations with the fewest number of vertices with small out-degree. Discret. Appl. Math. 194: 163-166 (2015) - 2014
- [j3]Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker:
Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks. Discret. Appl. Math. 171: 81-89 (2014) - 2013
- [j2]Kaveh Khoshkhah, M. Nemati, Hossein Soltani, Manouchehr Zaker:
A Study of Monopolies in Graphs. Graphs Comb. 29(5): 1417-1427 (2013) - 2012
- [j1]Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker:
On dynamic monopolies of graphs: The average and strict majority thresholds. Discret. Optim. 9(2): 77-83 (2012)
Conference and Workshop Papers
- 2023
- [c8]Mozhgan Pourmoradnasseri, Karl Gustav Loog, Kaveh Khoshkhah:
COVID-19, From Lockdown to Recovery: Exploring the Dynamics of Bike-Sharing and Public Transport in Tartu, Estonia. SuMob@SIGSPATIAL 2023: 5-8 - 2022
- [c7]Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Amnir Hadachi:
A Real-Time Model for Pedestrian Flow Estimation in Urban Areas based on IoT Sensors. ITSC 2022: 4124-4130 - 2019
- [c6]Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah:
Du nombre maximum d'ensembles fermés en 3 dimensions. EGC 2019: 345-350 - [c5]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Weighted Upper Edge Cover: Complexity and Approximability. WALCOM 2019: 235-247 - [c4]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Correction to: Weighted Upper Edge Cover: Complexity and Approximability. WALCOM 2019 - [c3]Mozhgan Pourmoradnasseri, Kaveh Khoshkhah, Artjom Lind, Amnir Hadachi:
OD-Matrix Extraction based on Trajectory Reconstruction from Mobile Data. WiMob 2019: 1-8 - 2018
- [c2]Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri:
Enumerating Minimal Transversals of Hypergraphs without Small Holes. MFCS 2018: 55:1-55:15 - 2017
- [c1]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis:
Extended Spanning Star Forest Problems. COCOA (1) 2017: 195-209
Informal and Other Publications
- 2023
- [i8]Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Sadok Ben Yahia, Amnir Hadachi:
A Random Walk Approach for Simulation-Based Continuous Dynamic Traffic Assignment. CoRR abs/2311.12440 (2023) - 2018
- [i7]Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah:
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. CoRR abs/1807.09030 (2018) - [i6]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Weighted Upper Edge Cover: Complexity and Approximability. CoRR abs/1811.02599 (2018) - 2017
- [i5]Kaveh Khoshkhah, Dirk Oliver Theis:
Fooling Sets and the Spanning Tree Polytope. CoRR abs/1701.00350 (2017) - [i4]Kaveh Khoshkhah, Dirk Oliver Theis:
On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope. CoRR abs/1702.01424 (2017) - 2014
- [i3]Kaveh Khoshkhah:
On finding orientations with fewest number of vartices with small out-degree. CoRR abs/1410.8154 (2014) - 2012
- [i2]Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker:
On dynamic monopolies of graphs: the average and strict majority thresholds. CoRR abs/1202.1146 (2012) - [i1]Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker:
Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks. CoRR abs/1212.3682 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint