Polytopes, Permanents and Graphs with Large Factors - Paul Dagum; Michael Luby; Milena Mihail; Umesh V. Vazirani (FOCS, 1988)

Conductance and Convergence of Markov Chains-A Combinatorial Treatment of Expanders - Milena Mihail (FOCS, 1989)

On Coupling and the Approximation of the Permanent. - Milena Mihail (Inf. Process. Lett., 1989)

Learning the Fourier Spectrum of Probabilistic Lists and Trees. - William Aiello; Milena Mihail (SODA, 1991)

Computing Spanning Trees in NETPAD. - Keh-Wei Lih; Nathaniel Dean; Milena Mihail (Computational Support for Discrete Mathematics, 1992)

On the Expansion of Combinatorial Polytopes. - Milena Mihail (MFCS, 1992)

On the Number of Eularian Orientations of a Graph. - Milena Mihail; Peter Winkler 001 (SODA, 1992)

Balanced Matroids - Tomás Feder; Milena Mihail (STOC, 1992)

On the Random Walk Method for Protocol Testing. - Milena Mihail; Christos H. Papadimitriou (CAV, 1994)

Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. - Milena Mihail; Christos Kaklamanis; Satish Rao (FOCS, 1995)

A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems. - David P. Williamson; Michel X. Goemans; Milena Mihail; Vijay V. Vazirani (Comb., 1995)

Monte Carlo and Markov Chain techniques for network reliability and sampling. - Adam L. Buchsbaum; Milena Mihail (Networks, 1995)

A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer. - Milena Mihail; David Shallcross; Nate Dean; Marco Mostrel (SODA, 1996)

On the Number of Eulerian Orientations of a Graph. - Milena Mihail; Peter Winkler 001 (Algorithmica, 1996)

On the Complexity of the View-Selection Problem. - Howard J. Karloff; Milena Mihail (PODS, 1999)

Set Cover with Requirements and Costs Evolving over Time. - Milena Mihail (RANDOM-APPROX, 1999)

Optimal Wavelength Routing on Directed Fiber Trees. - Thomas Erlebach; Klaus Jansen; Christos Kaklamanis; Milena Mihail; Pino Persiano (Theor. Comput. Sci., 1999)

Theoretical Computer Science. - William I. Gasarch; Arto Salomaa; Thomas H. Cormen; Lane A. Hemaspaandra; Milena Mihail (Handbook of Discrete and Combinatorial Mathematics, 1999)

On the Eigenvalue Power Law. - Milena Mihail; Christos H. Papadimitriou (RANDOM, 2002)

Caching with expiration times. - Parikshit Gopalan; Howard J. Karloff; Aranyak Mehta; Milena Mihail; Nisheeth K. Vishnoi (SODA, 2002)

The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs. - Christos Gkantsidis; Milena Mihail; Ellen W. Zegura (ALENEX, 2003)

Spectral Analysis of Internet Topologies. - Christos Gkantsidis; Milena Mihail; Ellen W. Zegura (INFOCOM, 2003)

Conductance and congestion in power law graphs. - Christos Gkantsidis; Milena Mihail; Amin Saberi (SIGMETRICS, 2003)

Random Walks in Peer-to-Peer Networks. - Christos Gkantsidis; Milena Mihail; Amin Saberi (INFOCOM, 2004)

Hybrid search schemes for unstructured peer-to-peer networks. - Christos Gkantsidis; Milena Mihail; Amin Saberi (INFOCOM, 2005)

Strategyproof cost-sharing mechanisms for set cover and facility location games. - Nikhil R. Devanur; Milena Mihail; Vijay V. Vazirani (Decis. Support Syst., 2005)

Caching with Expiration Times for Internet Applications. - Parikshit Gopalan; Howard J. Karloff; Aranyak Mehta; Milena Mihail; Nisheeth K. Vishnoi (Internet Math., 2005)

A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks. - Tomás Feder; Adam Guetz; Milena Mihail; Amin Saberi (FOCS, 2006)

On certain connectivity properties of the internet topology. - Milena Mihail; Christos H. Papadimitriou; Amin Saberi (J. Comput. Syst. Sci., 2006)

Random walks in peer-to-peer networks: Algorithms and evaluation. - Christos Gkantsidis; Milena Mihail; Amin Saberi (Perform. Evaluation, 2006)

Towards Topology Aware Networks. - Christos Gkantsidis; Gagan Goel; Milena Mihail; Amin Saberi (INFOCOM, 2007)

Approximating Betweenness Centrality. - David A. Bader; Shiva Kintali; Kamesh Madduri; Milena Mihail (WAW, 2007)

MobCast: Overlay Architecture for Seamless IP Mobility using Scalable Anycast Proxies. - Christopher P. Lee 001; Keshav Attrey; Carlos Caballero; Nick Feamster; Milena Mihail; John A. Copeland (WCNC, 2007)

Random Walks with Lookahead on Power Law Random Graphs. - Milena Mihail; Amin Saberi; Prasad Tetali (Internet Math., 2007)

Efficient Generation ε-close to G(n,p) and Generalizations - Antonio Blanca; Milena Mihail (CoRR, 2012)

Graphic Realizations of Joint-Degree Matrices. - Georgios Amanatidis; Bradley Green; Milena Mihail (CoRR, 2015)

Cycles in Zero-Sum Differential Games and Biological Diversity. - Tung Mai; Milena Mihail; Ioannis Panageas; Will Ratcliff; Vijay V. Vazirani; Peter Yunker (EC, 2018)

Connected realizations of joint-degree matrices. - Georgios Amanatidis; Bradley Green; Milena Mihail (Discret. Appl. Math., 2018)

Online Matching with High Probability. - Milena Mihail; Thorben Tröbst (SAGT, 2024)