Publications
- Christos
Koufogiannakis and Neal Young, "Beating
Simplex
for
Fractional
Packing
and
Covering
Linear
Programs",
The 48th IEEE Symposium on Foundations
of
Computer Science (FOCS 2007)
- Christos
Koufogiannakis and Neal Young, "Greedy
Δ-approximation
Algorithm
for
Covering
with
Arbitrary
Constraints
and
Submodular
Cost", The 36th
International Colloquium on Automata, Languages and Programming (ICALP
2009), LNCS 5555, pp. 634–652
- Konstantinos Pelechrinis, Chirstos
Koufogiannakis,
Shrikanth V. Krisnamurthy, "Gaming
the Jammer:
Is Frequency Hoping Effective?", The 7th Intl. Symposium on
Modeling
and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2009)
- Christos
Koufogiannakis and Neal Young, "Distributed
and
Parallel
Algorithms
for
Weighted
Vertex
Cover
and
other
Covering
Problems", The 28th ACM SIGACT-SIGOPS Symposium on
Principles
of Distributed Computing (PODC 2009)
- Christos
Koufogiannakis and Neal Young, "Distributed
Fractional
Packing
and
Maximum
Weighted
b-Matching
via
Tail-Recursive
Duality", The 23rd International Symposium on Distributed
Computing (DISC 2009), LNCS 5805, pp.
221–238
- Konstantinos Pelechrinis, Chirstos
Koufogiannakis,
Shrikanth V. Krisnamurthy, "On
the
Efficacy
of
Frequency
Hopping
in
Coping with Jamming Attacks in 802.11
Networks", IEEE Transactions on
Wireless Communications, 9(10): pp. 3258 –
3271, 2010
- Christos
Koufogiannakis and Neal Young, "Distributed
Algorithms
for
Covering,
Packing
and
Maximum
Weighted
Matching", Distributed Computing, 24(1), pp.45–63, 2011
- Christos
Koufogiannakis and Neal Young, "Greedy
Δ-approximation
Algorithm
for
Covering
with
Arbitrary
Constraints
and
Submodular
Cost", Algorithmica, accepted for publication
- Christos
Koufogiannakis and Neal Young, "A
Nearly
Linear
Time
PTAS
for
Explicitly
Given
Fractional
Packing and
Covering Linear Programs", under submission