Gary W. Atkinson

According to our database, Gary W. Atkinson authored at least 6 papers between 1998 and 2019.

Collaborative distances:

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

2019

The network OS: Carrier-grade SDN control of multi-domain, multi-layer networks.

Marina Thottan, Catello Di Martino, Young-Jin Kim, Gary W. Atkinson, Nakjung Choi, Nishok Mohanasamy, Lalita Jagadeesan, Veena B. Mendiratta, Jesse E. Simsarian, Bartek Kozicki

Bell Labs Tech. J., 2019

2015

Network Global Expectation Model of Routing and Grooming in Multilayer Service Transport.

Steven K. Korotky, Jesse E. Simsarian, Gary W. Atkinson

JOCN, 2015

2014

Network global expectation model of optimized routing and grooming in multi-layer service transport.

Steven K. Korotky, Jesse E. Simsarian, Gary W. Atkinson

Proceedings of the European Conference on Optical Communication, 2014

2010

A min-max theorem for plane bipartite graphs.

Hernán G. Abeledo, Gary W. Atkinson

Discret. Appl. Math., 2010

1998

Polyhedral Combinatorics of Benzenoid Problems.

Hernán G. Abeledo, Gary W. Atkinson

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

The Clar and Fries problems for benzenoid hydrocarbons are linear programs.

Hernán G. Abeledo, Gary W. Atkinson

Proceedings of the Discrete Mathematical Chemistry, 1998