Milena Mihail

44 papers A* 20A 1B 3C 1Journal 14Unranked 4
YearRankTypeTitle / Venue / Authors
2024 B conf
Online Matching with High Probability.
SAGT
Milena Mihail, Thorben Tröbst
2021 J jnl
Online Matching with High Probability.
CoRR
Milena Mihail, Thorben Tröbst
2018 J jnl
Connected realizations of joint-degree matrices.
Discret. Appl. Math.
Georgios Amanatidis, Bradley Green, Milena Mihail
2018 A* conf
Cycles in Zero-Sum Differential Games and Biological Diversity.
EC
Tung Mai, Milena Mihail, Ioannis Panageas, Will Ratcliff, Vijay V. Vazirani, Peter Yunker
2015 J jnl
Graphic Realizations of Joint-Degree Matrices.
CoRR
Georgios Amanatidis, Bradley Green, Milena Mihail
2012 J jnl
Efficient Generation ε-close to G(n,p) and Generalizations
CoRR
Antonio Blanca, Milena Mihail
2007 C conf
Approximating Betweenness Centrality.
WAW
David A. Bader, Shiva Kintali, Kamesh Madduri, Milena Mihail
2007 B conf
MobCast: Overlay Architecture for Seamless IP Mobility using Scalable Anycast Proxies.
WCNC
Christopher P. Lee, Keshav Attrey, Carlos Caballero, Nick Feamster, Milena Mihail, John A. Copeland
2007 J jnl
Random Walks with Lookahead on Power Law Random Graphs.
Internet Math.
Milena Mihail, Amin Saberi, Prasad Tetali
2007 A* conf
Towards Topology Aware Networks.
INFOCOM
Christos Gkantsidis, Gagan Goel, Milena Mihail, Amin Saberi
2006 A* conf
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks.
FOCS
Tomás Feder, Adam Guetz, Milena Mihail, Amin Saberi
2006 J jnl
On certain connectivity properties of the internet topology.
J. Comput. Syst. Sci.
Milena Mihail, Christos H. Papadimitriou, Amin Saberi
2006 J jnl
Random walks in peer-to-peer networks: Algorithms and evaluation.
Perform. Evaluation
Christos Gkantsidis, Milena Mihail, Amin Saberi
2005 J jnl
Caching with Expiration Times for Internet Applications.
Internet Math.
Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi
2005 A* conf
Hybrid search schemes for unstructured peer-to-peer networks.
INFOCOM
Christos Gkantsidis, Milena Mihail, Amin Saberi
2005 J jnl
Strategyproof cost-sharing mechanisms for set cover and facility location games.
Decis. Support Syst.
Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani
2004 A* conf
Random Walks in Peer-to-Peer Networks.
INFOCOM
Christos Gkantsidis, Milena Mihail, Amin Saberi
2003 A* conf
Conductance and congestion in power law graphs.
SIGMETRICS
Christos Gkantsidis, Milena Mihail, Amin Saberi
2003 A* conf
On Certain Connectivity Properties of the Internet Topology.
FOCS
Milena Mihail, Christos H. Papadimitriou, Amin Saberi
2003 A* conf
Spectral Analysis of Internet Topologies.
INFOCOM
Christos Gkantsidis, Milena Mihail, Ellen W. Zegura
2003 A* conf
Strategyproof cost-sharing mechanisms for set cover and facility location games.
EC
Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani
2003 A conf
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs.
ALENEX
Christos Gkantsidis, Milena Mihail, Ellen W. Zegura
2002 A* conf
Caching with expiration times.
SODA
Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi
2002 — conf
On the Eigenvalue Power Law.
RANDOM
Milena Mihail, Christos H. Papadimitriou
1999 A* conf
On the Complexity of the View-Selection Problem.
PODS
Howard J. Karloff, Milena Mihail
1999 J jnl
Optimal Wavelength Routing on Directed Fiber Trees.
Theor. Comput. Sci.
Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano
1999 — conf
Set Cover with Requirements and Costs Evolving over Time.
RANDOM-APPROX
Milena Mihail
1999 — ch.
Theoretical Computer Science.
Handbook of Discrete and Combinatorial Mathematics
William I. Gasarch, Arto Salomaa, Thomas H. Cormen, Lane A. Hemaspaandra, Milena Mihail
1996 A* conf
A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer.
SODA
Milena Mihail, David Shallcross, Nate Dean, Marco Mostrel
1996 J jnl
On the Number of Eulerian Orientations of a Graph.
Algorithmica
Milena Mihail, Peter Winkler
1995 J jnl
A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems.
Comb.
David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani
1995 A* conf
Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings.
FOCS
Milena Mihail, Christos Kaklamanis, Satish Rao
1995 J jnl
Monte Carlo and Markov Chain techniques for network reliability and sampling.
Networks
Adam L. Buchsbaum, Milena Mihail
1994 A* conf
On the Random Walk Method for Protocol Testing.
CAV
Milena Mihail, Christos H. Papadimitriou
1993 A* conf
A primal-dual approximation algorithm for generalized Steiner network problems.
STOC
David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani
1992 A* conf
Balanced Matroids
STOC
Tomás Feder, Milena Mihail
1992 — conf
Computing Spanning Trees in NETPAD.
Computational Support for Discrete Mathematics
Keh-Wei Lih, Nathaniel Dean, Milena Mihail
1992 — conf
Monte Carlo and Markov Chain Techniques for Network Reliability and Sampling.
Computational Support for Discrete Mathematics
Adam L. Buchsbaum, Milena Mihail
1992 B conf
On the Expansion of Combinatorial Polytopes.
MFCS
Milena Mihail
1992 A* conf
On the Number of Eularian Orientations of a Graph.
SODA
Milena Mihail, Peter Winkler
1991 A* conf
Learning the Fourier Spectrum of Probabilistic Lists and Trees.
SODA
William Aiello, Milena Mihail
1989 A* conf
Conductance and Convergence of Markov Chains-A Combinatorial Treatment of Expanders
FOCS
Milena Mihail
1989 J jnl
On Coupling and the Approximation of the Permanent.
Inf. Process. Lett.
Milena Mihail
1988 A* conf
Polytopes, Permanents and Graphs with Large Factors
FOCS
Paul Dagum, Michael Luby, Milena Mihail, Umesh V. Vazirani