Christos Koufogiannakis

13 papers A* 2A 1B 1Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2020 J jnl
Distributed algorithms for covering, packing and maximum weighted matching.
CoRR
Christos Koufogiannakis, Neal E. Young
2014 J jnl
A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs.
Algorithmica
Christos Koufogiannakis, Neal E. Young
2013 J jnl
Greedy
Algorithmica
Christos Koufogiannakis, Neal E. Young
2011 J jnl
Distributed algorithms for covering, packing and maximum weighted matching.
Distributed Comput.
Christos Koufogiannakis, Neal E. Young
2010 J jnl
On the Efficacy of Frequency Hopping in Coping with Jamming Attacks in 802.11 Networks.
IEEE Trans. Wirel. Commun.
Konstantinos Pelechrinis, Christos Koufogiannakis, Srikanth V. Krishnamurthy
2009 — —
Approximation Algorithms for Covering Problems.
Christos Koufogiannakis
2009 A conf
Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality.
DISC
Christos Koufogiannakis, Neal E. Young
2009 A* conf
Distributed and parallel algorithms for weighted vertex cover and other covering problems.
PODC
Christos Koufogiannakis, Neal E. Young
2009 B conf
Gaming the jammer: Is frequency hopping effective?
WiOpt
Konstantinos Pelechrinis, Christos Koufogiannakis, Srikanth V. Krishnamurthy
2009 — conf
Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost.
ICALP (1)
Christos Koufogiannakis, Neal E. Young
2008 J jnl
Beating Simplex for Fractional Packing and Covering Linear Programs
CoRR
Christos Koufogiannakis, Neal E. Young
2008 J jnl
Flooding Overcomes Small Covering Constraints
CoRR
Christos Koufogiannakis, Neal E. Young
2007 A* conf
Beating Simplex for Fractional Packing and Covering Linear Programs.
FOCS
Christos Koufogiannakis, Neal E. Young