Kaveh Khoshkhah

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Real-Time Calibration of Disaggregated Traffic Demand	2022-10-26	Paper
Enumerating minimal transversals of hypergraphs without small holes	2021-08-04	Paper
Weighted upper edge cover: complexity and approximability Journal of Graph Algorithms and Applications	2020-02-17	Paper
Weighted upper edge cover: complexity and approximability (available as arXiv preprint)	2019-10-15	Paper
Correction to: ``Weighted upper edge cover: complexity and approximability	2019-10-15	Paper
On the combinatorial lower bound for the extension complexity of the spanning tree polytope Operations Research Letters	2019-06-11	Paper
Complexity and approximability of extended spanning star forest problems in general and complete graphs Theoretical Computer Science	2019-05-29	Paper
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs	2018-07-24	Paper
Fooling sets and the spanning tree polytope Information Processing Letters	2018-03-16	Paper
Extended spanning star forest problems	2018-02-26	Paper
On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope (available as arXiv preprint)	2017-02-05	Paper
On finding orientations with the fewest number of vertices with small out-degree Discrete Applied Mathematics	2015-09-01	Paper
On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold Canadian Mathematical Bulletin	2015-05-29	Paper
Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks Discrete Applied Mathematics	2014-05-06	Paper
A study of monopolies in graphs Graphs and Combinatorics	2013-09-26	Paper
On dynamic monopolies of graphs: the average and strict majority thresholds Discrete Optimization	2012-09-11	Paper

Research outcomes over time

This page was built for person: Kaveh Khoshkhah