Christos Koufogiannakis

Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality

Christos Koufogiannakis, Neal E. Young, N. Young, 2009, DISC.

Sequential, Parallel, Online, and Distributed Covering

Christos Koufogiannakis, Neal E. Young, 2008 .

Gaming the jammer: Is frequency hopping effective?

Srikanth V. Krishnamurthy, Konstantinos Pelechrinis, Christos Koufogiannakis, 2009, 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

Approximation Algorithms for Covering Problems

Christos Koufogiannakis, Christos Koufogiannakis, 2009 .

Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

Christos Koufogiannakis, Neal E. Young, 2009, ICALP.

Distributed algorithms for covering, packing and maximum weighted matching

Christos Koufogiannakis, Neal E. Young, N. Young, 2011, Distributed Computing.

Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

Christos Koufogiannakis, Neal E. Young, N. Young, 2013, Algorithmica.

Flooding Overcomes Small Covering Constraints pdf

Christos Koufogiannakis, Neal E. Young, 2008, ArXiv.

On the Efficacy of Frequency Hopping in Coping with Jamming Attacks in 802.11 Networks

Srikanth V. Krishnamurthy, Konstantinos Pelechrinis, Christos Koufogiannakis, 2010, IEEE Transactions on Wireless Communications.

A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs

Christos Koufogiannakis, Neal E. Young, 2013, Algorithmica.

Distributed and parallel algorithms for weighted vertex cover and other covering problems

Christos Koufogiannakis, Neal E. Young, N. Young, 2009, PODC '09.