| 
| |  | |  |
On the Complexity of the View-Selection Problem
Note: Links lead to the DBLP on the Web.
Milena Mihail
14
Howard J. Karloff
, Milena Mihail: On the Complexity of the View-Selection Problem.
PODS 1999
: 167-173
13
Thomas Erlebach
,
Klaus Jansen
,
Christos Kaklamanis
, Milena Mihail,
Pino Persiano
: Optimal Wavelength Routing on Directed Fiber Trees.
TCS 221
(1-2): 119-137 (1999)
12
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
11
Milena Mihail,
Peter Winkler
: On the Number of Eulerian Orientations of a Graph.
Algorithmica 16
(4/5): 402-414 (1996)
10
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
9
Milena Mihail,
Christos H. Papadimitriou
: On the Random Walk Method for Protocol Testing.
CAV 1994
: 132-141
8
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
7
Milena Mihail: On the Expansion of Combinatorial Polytopes.
MFCS 1992
: 37-49
6
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
4
William Aiello
, Milena Mihail: Learning the Fourier Spectrum of Probabilistic Lists and Trees.
SODA 1991
: 291-299
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.
IPL 30
(2): 91-95 (1989)
1
Paul Dagum
,
Michael Luby
, Milena Mihail,
Umesh V. Vazirani
: Polytopes, Permanents and Graphs with Large Factors.
FOCS 1988
: 412-421
Copyright(C) 2000 ACM | | | | | | |
