Beating Simplex for Fractional Packing and Covering Linear Programs. - Christos Koufogiannakis; Neal E. Young (FOCS, 2007)

Flooding Overcomes Small Covering Constraints - Christos Koufogiannakis; Neal E. Young (CoRR, 2008)

Greedy D{ ensuremath{ Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. - Christos Koufogiannakis; Neal E. Young (ICALP (1), 2009)

Distributed and parallel algorithms for weighted vertex cover and other covering problems. - Christos Koufogiannakis; Neal E. Young (PODC, 2009)

Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality. - Christos Koufogiannakis; Neal E. Young (DISC, 2009)

Gaming the jammer: Is frequency hopping effective? - Konstantinos Pelechrinis; Christos Koufogiannakis; Srikanth V. Krishnamurthy (WiOpt, 2009)

Approximation Algorithms for Covering Problems. - Christos Koufogiannakis (2009)

On the Efficacy of Frequency Hopping in Coping with Jamming Attacks in 802.11 Networks. - Konstantinos Pelechrinis; Christos Koufogiannakis; Srikanth V. Krishnamurthy (IEEE Trans. Wirel. Commun., 2010)

Distributed algorithms for covering, packing and maximum weighted matching. - Christos Koufogiannakis; Neal E. Young (Distributed Comput., 2011)

Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. - Christos Koufogiannakis; Neal E. Young (Algorithmica, 2013)

A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs. - Christos Koufogiannakis; Neal E. Young (Algorithmica, 2014)