2007 |
33 | EE | Christos Gkantsidis,
Gagan Goel,
Milena Mihail,
Amin Saberi:
Towards Topology Aware Networks.
INFOCOM 2007: 2591-2595 |
32 | EE | David A. Bader,
Shiva Kintali,
Kamesh Madduri,
Milena Mihail:
Approximating Betweenness Centrality.
WAW 2007: 124-137 |
31 | | Milena Mihail,
Amin Saberi,
Prasad Tetali:
Random Walks with Lookahead on Power Law Random Graphs.
Internet Mathematics 3(2): (2007) |
2006 |
30 | EE | Tomás Feder,
Adam Guetz,
Milena Mihail,
Amin Saberi:
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks.
FOCS 2006: 69-76 |
29 | EE | Milena Mihail,
Christos H. Papadimitriou,
Amin Saberi:
On certain connectivity properties of the internet topology.
J. Comput. Syst. Sci. 72(2): 239-251 (2006) |
28 | EE | Christos Gkantsidis,
Milena Mihail,
Amin Saberi:
Random walks in peer-to-peer networks: Algorithms and evaluation.
Perform. Eval. 63(3): 241-263 (2006) |
2005 |
27 | EE | Christos Gkantsidis,
Milena Mihail,
Amin Saberi:
Hybrid search schemes for unstructured peer-to-peer networks.
INFOCOM 2005: 1526-1537 |
26 | EE | Nikhil R. Devanur,
Milena Mihail,
Vijay V. Vazirani:
Strategyproof cost-sharing mechanisms for set cover and facility location games.
Decision Support Systems 39(1): 11-22 (2005) |
25 | | Parikshit Gopalan,
Howard J. Karloff,
Aranyak Mehta,
Milena Mihail,
Nisheeth K. Vishnoi:
Caching with Expiration Times for Internet Applications.
Internet Mathematics 2(2): (2005) |
2004 |
24 | EE | Christos Gkantsidis,
Milena Mihail,
Amin Saberi:
Random Walks in Peer-to-Peer Networks.
INFOCOM 2004 |
2003 |
23 | EE | Nikhil R. Devanur,
Milena Mihail,
Vijay V. Vazirani:
Strategyproof cost-sharing mechanisms for set cover and facility location games.
ACM Conference on Electronic Commerce 2003: 108-114 |
22 | | Christos Gkantsidis,
Milena Mihail,
Ellen W. Zegura:
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs.
ALENEX 2003: 16-25 |
21 | EE | Milena Mihail,
Christos H. Papadimitriou,
Amin Saberi:
On Certain Connectivity Properties of the Internet Topology.
FOCS 2003: 28-35 |
20 | EE | Christos Gkantsidis,
Milena Mihail,
Ellen W. Zegura:
Spectral Analysis of Internet Topologies.
INFOCOM 2003 |
19 | EE | Christos Gkantsidis,
Milena Mihail,
Amin Saberi:
Conductance and congestion in power law graphs.
SIGMETRICS 2003: 148-159 |
2002 |
18 | EE | Milena Mihail,
Christos H. Papadimitriou:
On the Eigenvalue Power Law.
RANDOM 2002: 254-262 |
17 | EE | Parikshit Gopalan,
Howard J. Karloff,
Aranyak Mehta,
Milena Mihail,
Nisheeth K. Vishnoi:
Caching with expiration times.
SODA 2002: 540-547 |
1999 |
16 | EE | Howard J. Karloff,
Milena Mihail:
On the Complexity of the View-Selection Problem.
PODS 1999: 167-173 |
15 | | Milena Mihail:
Set Cover with Requirements and Costs Evolving over Time.
RANDOM-APPROX 1999: 63-72 |
14 | EE | Thomas Erlebach,
Klaus Jansen,
Christos Kaklamanis,
Milena Mihail,
Pino Persiano:
Optimal Wavelength Routing on Directed Fiber Trees.
Theor. Comput. Sci. 221(1-2): 119-137 (1999) |
1996 |
13 | | Milena Mihail,
David Shallcross,
Nate Dean,
Marco Mostrel:
A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer.
SODA 1996: 279-287 |
12 | | Milena Mihail,
Peter Winkler:
On the Number of Eulerian Orientations of a Graph.
Algorithmica 16(4/5): 402-414 (1996) |
1995 |
11 | | Milena Mihail,
Christos Kaklamanis,
Satish Rao:
Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings.
FOCS 1995: 548-557 |
10 | | David P. Williamson,
Michel X. Goemans,
Milena Mihail,
Vijay V. Vazirani:
A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems.
Combinatorica 15(3): 435-454 (1995) |
1994 |
9 | | Milena Mihail,
Christos H. Papadimitriou:
On the Random Walk Method for Protocol Testing.
CAV 1994: 132-141 |
1993 |
8 | EE | David P. Williamson,
Michel X. Goemans,
Milena Mihail,
Vijay V. Vazirani:
A primal-dual approximation algorithm for generalized Steiner network problems.
STOC 1993: 708-717 |
1992 |
7 | | Milena Mihail:
On the Expansion of Combinatorial Polytopes.
MFCS 1992: 37-49 |
6 | EE | Milena Mihail,
Peter Winkler:
On the Number of Eularian Orientations of a Graph.
SODA 1992: 138-145 |
5 | | Tomás Feder,
Milena Mihail:
Balanced Matroids
STOC 1992: 26-38 |
1991 |
4 | | William Aiello,
Milena Mihail:
Learning the Fourier Spectrum of Probabilistic Lists and Trees.
SODA 1991: 291-299 |
1989 |
3 | | Milena Mihail:
Conductance and Convergence of Markov Chains-A Combinatorial Treatment of Expanders
FOCS 1989: 526-531 |
2 | | Milena Mihail:
On Coupling and the Approximation of the Permanent.
Inf. Process. Lett. 30(2): 91-95 (1989) |
1988 |
1 | | Paul Dagum,
Michael Luby,
Milena Mihail,
Umesh V. Vazirani:
Polytopes, Permanents and Graphs with Large Factors
FOCS 1988: 412-421 |