The Clar and Fries problems for benzenoid hydrocarbons are linear programs. - Hernán G. Abeledo; Gary W. Atkinson (Discrete Mathematical Chemistry, 1998)

Polyhedral Combinatorics of Benzenoid Problems. - Hernán G. Abeledo; Gary W. Atkinson (IPCO, 1998)

A min-max theorem for plane bipartite graphs. - Hernán G. Abeledo; Gary W. Atkinson (Discret. Appl. Math., 2010)

Network global expectation model of optimized routing and grooming in multi-layer service transport. - Steven K. Korotky; Jesse E. Simsarian; Gary W. Atkinson (ECOC, 2014)

Network Global Expectation Model of Routing and Grooming in Multilayer Service Transport. - Steven K. Korotky; Jesse E. Simsarian; Gary W. Atkinson (JOCN, 2015)

The network OS: Carrier-grade SDN control of multi-domain, multi-layer networks. - Marina Thottan; Catello Di Martino; Young-Jin Kim 001; Gary W. Atkinson; Nakjung Choi; Nishok Mohanasamy; Lalita Jagadeesan; Veena B. Mendiratta; Jesse E. Simsarian; Bartek Kozicki (Bell Labs Tech. J., 2019)