The following pages link to Kaveh Khoshkhah (Q448964):
Displayed 15 items.
- On dynamic monopolies of graphs: the average and strict majority thresholds (Q448965) (← links)
- On finding orientations with the fewest number of vertices with small out-degree (Q494438) (← links)
- Extended spanning star forest problems (Q1699782) (← links)
- Fooling sets and the spanning tree polytope (Q1705643) (← links)
- Correction to: ``Weighted upper edge cover: complexity and approximability'' (Q2327516) (← links)
- Weighted upper edge cover: complexity and approximability (Q2327526) (← links)
- On the combinatorial lower bound for the extension complexity of the spanning tree polytope (Q2417165) (← links)
- Complexity and approximability of extended spanning star forest problems in general and complete graphs (Q2419107) (← links)
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks (Q2449109) (← links)
- (Q5005157) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold (Q5252193) (← links)
- On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope (Q6282824) (← links)
- Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs (Q6304570) (← links)
- Real-Time Calibration of Disaggregated Traffic Demand (Q6415650) (← links)