default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMilena Mihail
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c29]Milena Mihail, Thorben Tröbst:
Online Matching with High Probability. SAGT 2024: 21-34- 2021
- [i3]Milena Mihail, Thorben Tröbst:
Online Matching with High Probability. CoRR abs/2112.07228 (2021)
2010 – 2019
- 2018
- [j11]Georgios Amanatidis
, Bradley Green, Milena Mihail:
Connected realizations of joint-degree matrices. Discret. Appl. Math. 250: 65-74 (2018) - [c28]Tung Mai, Milena Mihail, Ioannis Panageas, Will Ratcliff, Vijay V. Vazirani, Peter Yunker:
Cycles in Zero-Sum Differential Games and Biological Diversity. EC 2018: 339-350 - 2015
- [i2]Georgios Amanatidis, Bradley Green, Milena Mihail:
Graphic Realizations of Joint-Degree Matrices. CoRR abs/1509.07076 (2015) - 2012
- [i1]Antonio Blanca, Milena Mihail:
Efficient Generation ε-close to G(n,p) and Generalizations. CoRR abs/1204.5834 (2012)
2000 – 2009
- 2007
- [j10]Milena Mihail, Amin Saberi, Prasad Tetali:
Random Walks with Lookahead on Power Law Random Graphs. Internet Math. 3(2): 147-152 (2007) - [c27]Christos Gkantsidis, Gagan Goel, Milena Mihail, Amin Saberi:
Towards Topology Aware Networks. INFOCOM 2007: 2591-2595 - [c26]David A. Bader, Shiva Kintali, Kamesh Madduri, Milena Mihail:
Approximating Betweenness Centrality. WAW 2007: 124-137 - [c25]Christopher P. Lee, Keshav Attrey, Carlos Caballero, Nick Feamster, Milena Mihail, John A. Copeland:
MobCast: Overlay Architecture for Seamless IP Mobility using Scalable Anycast Proxies. WCNC 2007: 3872-3876 - 2006
- [j9]Milena Mihail, Christos H. Papadimitriou, Amin Saberi:
On certain connectivity properties of the internet topology. J. Comput. Syst. Sci. 72(2): 239-251 (2006) - [j8]Christos Gkantsidis, Milena Mihail, Amin Saberi:
Random walks in peer-to-peer networks: Algorithms and evaluation. Perform. Evaluation 63(3): 241-263 (2006) - [c24]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 - 2005
- [j7]Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani:
Strategyproof cost-sharing mechanisms for set cover and facility location games. Decis. Support Syst. 39(1): 11-22 (2005) - [j6]Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi:
Caching with Expiration Times for Internet Applications. Internet Math. 2(2): 165-184 (2005) - [c23]Christos Gkantsidis, Milena Mihail, Amin Saberi:
Hybrid search schemes for unstructured peer-to-peer networks. INFOCOM 2005: 1526-1537 - 2004
- [c22]Christos Gkantsidis, Milena Mihail, Amin Saberi:
Random Walks in Peer-to-Peer Networks. INFOCOM 2004 - 2003
- [c21]Christos Gkantsidis, Milena Mihail, Ellen W. Zegura:
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs. ALENEX 2003: 16-25 - [c20]Milena Mihail, Christos H. Papadimitriou, Amin Saberi:
On Certain Connectivity Properties of the Internet Topology. FOCS 2003: 28-35 - [c19]Christos Gkantsidis, Milena Mihail, Ellen W. Zegura:
Spectral Analysis of Internet Topologies. INFOCOM 2003: 364-374 - [c18]Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani:
Strategyproof cost-sharing mechanisms for set cover and facility location games. EC 2003: 108-114 - [c17]Christos Gkantsidis, Milena Mihail, Amin Saberi:
Conductance and congestion in power law graphs. SIGMETRICS 2003: 148-159 - 2002
- [c16]Milena Mihail, Christos H. Papadimitriou:
On the Eigenvalue Power Law. RANDOM 2002: 254-262 - [c15]Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi:
Caching with expiration times. SODA 2002: 540-547
1990 – 1999
- 1999
- [j5]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) - [c14]Howard J. Karloff, Milena Mihail:
On the Complexity of the View-Selection Problem. PODS 1999: 167-173 - [c13]Milena Mihail:
Set Cover with Requirements and Costs Evolving over Time. RANDOM-APPROX 1999: 63-72 - [r1]William I. Gasarch, Arto Salomaa, Thomas H. Cormen, Lane A. Hemaspaandra, Milena Mihail:
Theoretical Computer Science. Handbook of Discrete and Combinatorial Mathematics 1999 - 1996
- [j4]Milena Mihail, Peter Winkler:
On the Number of Eulerian Orientations of a Graph. Algorithmica 16(4/5): 402-414 (1996) - [c12]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 - 1995
- [j3]David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani:
A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems. Comb. 15(3): 435-454 (1995) - [j2]Adam L. Buchsbaum, Milena Mihail:
Monte Carlo and Markov Chain techniques for network reliability and sampling. Networks 25(3): 117-130 (1995) - [c11]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 - 1994
- [c10]Milena Mihail, Christos H. Papadimitriou:
On the Random Walk Method for Protocol Testing. CAV 1994: 132-141 - 1993
- [c9]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
- [c8]Keh-Wei Lih, Nathaniel Dean, Milena Mihail:
Computing Spanning Trees in NETPAD. Computational Support for Discrete Mathematics 1992: 85-98 - [c7]Adam L. Buchsbaum, Milena Mihail:
Monte Carlo and Markov Chain Techniques for Network Reliability and Sampling. Computational Support for Discrete Mathematics 1992: 199-222 - [c6]Milena Mihail:
On the Expansion of Combinatorial Polytopes. MFCS 1992: 37-49 - [c5]Milena Mihail, Peter Winkler:
On the Number of Eularian Orientations of a Graph. SODA 1992: 138-145 - [c4]Tomás Feder, Milena Mihail:
Balanced Matroids. STOC 1992: 26-38 - 1991
- [c3]William Aiello, Milena Mihail:
Learning the Fourier Spectrum of Probabilistic Lists and Trees. SODA 1991: 291-299
1980 – 1989
- 1989
- [j1]Milena Mihail:
On Coupling and the Approximation of the Permanent. Inf. Process. Lett. 30(2): 91-95 (1989) - [c2]Milena Mihail:
Conductance and Convergence of Markov Chains-A Combinatorial Treatment of Expanders. FOCS 1989: 526-531 - 1988
- [c1]Paul Dagum, Michael Luby, Milena Mihail, Umesh V. Vazirani:
Polytopes, Permanents and Graphs with Large Factors. FOCS 1988: 412-421
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 01:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
