 | 2011 |
|---|
| 9 |       | Christos Koufogiannakis,
Neal E. Young:
Distributed algorithms for covering, packing and maximum weighted matching.
Distributed Computing 24(1): 45-63 (2011) |
| 2010 |
|---|
| 8 | | Konstantinos Pelechrinis,
Christos Koufogiannakis,
Srikanth V. Krishnamurthy:
On the Efficacy of Frequency Hopping in Coping with Jamming Attacks in 802.11 Networks.
IEEE Transactions on Wireless Communications 9(10): 3258-3271 (2010) |
| 2009 |
|---|
| 7 | | Christos Koufogiannakis,
Neal E. Young:
Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality.
DISC 2009: 221-238 |
| 6 | | Christos Koufogiannakis,
Neal E. Young:
Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost.
ICALP (1) 2009: 634-652 |
| 5 | | Christos Koufogiannakis,
Neal E. Young:
Distributed and parallel algorithms for weighted vertex cover and other covering problems.
PODC 2009: 171-179 |
| 4 | | Konstantinos Pelechrinis,
Christos Koufogiannakis,
Srikanth V. Krishnamurthy:
Gaming the jammer: Is frequency hopping effective?
WiOpt 2009: 1-10 |
| 2008 |
|---|
| 3 | | Christos Koufogiannakis,
Neal E. Young:
Beating Simplex for Fractional Packing and Covering Linear Programs
CoRR abs/0801.1987: (2008) |
| 2 | | Christos Koufogiannakis,
Neal E. Young:
Flooding Overcomes Small Covering Constraints
CoRR abs/0807.0644: (2008) |
| 2007 |
|---|
| 1 | | Christos Koufogiannakis,
Neal E. Young:
Beating Simplex for Fractional Packing and Covering Linear Programs.
FOCS 2007: 494-504 |
Data released under the ODC-BY 1.0 license — See also our legal information page