Clayton W. Commander

According to our database, Clayton W. Commander authored at least 8 papers between 2007 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

Semidefinite Programming and the Sensor Network Localization Problem, SNLP.

Clayton W. Commander, Michelle A. Ragle, Yinyu Ye

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Maximum Cut Problem, MAX-CUT.

Clayton W. Commander

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Broadcast Scheduling Problem.

Clayton W. Commander

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Polynomial-time identification of robust network flows under uncertain arc failures.

Vladimir Boginski, Clayton W. Commander, Timofey Turko

Optim. Lett., 2009

Detecting critical nodes in sparse graphs.

Ashwin Arulselvan, Clayton W. Commander, Lily Elefteriadou, Panos M. Pardalos

Comput. Oper. Res., 2009

A combinatorial algorithm for the TDMA message scheduling problem.

Clayton W. Commander, Panos M. Pardalos

Comput. Optim. Appl., 2009

2008

Jamming communication networks under complete uncertainty.

Clayton W. Commander, Panos M. Pardalos, Valeriy Ryabchenko, Oleg V. Shylo, Stan Uryasev, Grigoriy Zrazhevsky

Optim. Lett., 2008

2007

The wireless network jamming problem.

Clayton W. Commander, Panos M. Pardalos, Valeriy Ryabchenko, Stan Uryasev, Grigoriy Zrazhevsky

J. Comb. Optim., 2007