An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time. - Andrew R. Curtis; Clemente Izurieta; Benson L. Joeris; Scott M. Lundberg; Ross M. McConnell (WG, 2006)

Efficient Algorithms For Optimizing Policy-Constrained Routing. - Andrew R. Curtis; Ross M. McConnell; Daniel Massey (IWQoS, 2007)

Capacity Provisioning a Valiant Load-Balanced Network. - Andrew R. Curtis; Alejandro López-Ortiz (INFOCOM, 2009)

LEGUP: using heterogeneity to reduce the cost of data center network upgrades. - Andrew R. Curtis; Srinivasan Keshav; Alejandro López-Ortiz (CoNEXT, 2010)

DevoFlow: cost-effective flow management for high performance enterprise networks. - Jeffrey C. Mogul; Jean Tourrilhes; Praveen Yalagandula; Puneet Sharma; Andrew R. Curtis; Sujata Banerjee (HotNets, 2010)

An implicit representation of chordal comparability graphs in linear time. - Andrew R. Curtis; Clemente Izurieta; Benson L. Joeris; Scott M. Lundberg; Ross M. McConnell (Discret. Appl. Math., 2010)

Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection. - Andrew R. Curtis; Wonho Kim; Praveen Yalagandula (INFOCOM, 2011)

DevoFlow: scaling flow management for high-performance networks. - Andrew R. Curtis; Jeffrey C. Mogul; Jean Tourrilhes; Praveen Yalagandula; Puneet Sharma; Sujata Banerjee (SIGCOMM, 2011)

REWIRE: An optimization-based framework for unstructured data center network design. - Andrew R. Curtis; Tommy Carpenter; Mustafa Elsheikh; Alejandro López-Ortiz; Srinivasan Keshav (INFOCOM, 2012)

It's not easy being green. - Peter Xiang Gao; Andrew R. Curtis; Bernard Wong 001; Srinivasan Keshav (SIGCOMM, 2012)

Isomorphism of graph classes related to the circular-ones property. - Andrew R. Curtis; Min Chih Lin; Ross M. McConnell; Yahav Nussbaum; Francisco J. Soulignac; Jeremy P. Spinrad; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2013)