Mehdi Kadivar

Orcid: 0000-0002-1724-8075

According to our database1, Mehdi Kadivar authored at least 7 papers between 2009 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
A maximal clique based approximation algorithm for shortest link scheduling problem in wireless networks under the SINR model.
Comput. Networks, 2026

2025
TSLS and TSLSU: Two Novel Approximation SINR-Based Shortest Link Scheduling Algorithms in Wireless Networks.
IEEE Trans. Veh. Technol., December, 2025

PDSLS: An approximation SINR-based Shortest Link Scheduling algorithm with power control.
Comput. Commun., 2025

2022
A maximum clique based approximation algorithm for wireless link scheduling under SINR model.
J. Comput. Syst. Sci., 2022

2020
NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem.
IEEE Access, 2020

2011
An adaptive MST-based topology connectivity control algorithm for wireless ad-hoc networks.
Int. J. Commun. Networks Distributed Syst., 2011

2009
Distributed topology control algorithm based on one- and two-hop neighbors' information for ad hoc networks.
Comput. Commun., 2009


  Loading...