-
1
-
-
34547657141
-
Partial orders
-
Graph connections. Beineke L., and Wilson R. (Eds), Oxford Univ. Press, New York
-
Brightwell G. Partial orders. In: Beineke L., and Wilson R. (Eds). Graph connections. Oxford Lecture Ser. Math. Appl. volume 5 (1997), Oxford Univ. Press, New York 52-69
-
(1997)
Oxford Lecture Ser. Math. Appl.
, vol.5
, pp. 52-69
-
-
Brightwell, G.1
-
2
-
-
0041978574
-
Fractional dimension of partial orders
-
Brightwell G.R., and Scheinerman E.R. Fractional dimension of partial orders. Order 9 2 (1992) 139-158
-
(1992)
Order
, vol.9
, Issue.2
, pp. 139-158
-
-
Brightwell, G.R.1
Scheinerman, E.R.2
-
3
-
-
0001387789
-
A decomposition theorem for partially ordered sets
-
Dilworth R.P. A decomposition theorem for partially ordered sets. Ann. of Math. (2) 51 (1950) 161-166
-
(1950)
Ann. of Math. (2)
, vol.51
, pp. 161-166
-
-
Dilworth, R.P.1
-
5
-
-
0032178928
-
Zero knowledge and the chromatic number
-
Feige U., and Kilian J. Zero knowledge and the chromatic number. J. Comput. System Sci. 57 2 (1998) 187-199
-
(1998)
J. Comput. System Sci.
, vol.57
, Issue.2
, pp. 187-199
-
-
Feige, U.1
Kilian, J.2
-
6
-
-
34547657137
-
-
Complexity 96-The Eleventh Annual IEEE Conference on Computational Complexity (Philadelphia, PA)
-
-
-
-
7
-
-
0042226624
-
Dimension, graph and hypergraph coloring
-
Felsner S., and Trotter W.T. Dimension, graph and hypergraph coloring. Order 17 2 (2000) 167-177
-
(2000)
Order
, vol.17
, Issue.2
, pp. 167-177
-
-
Felsner, S.1
Trotter, W.T.2
-
9
-
-
34547658987
-
-
A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences
-
-
-
-
11
-
-
0000203509
-
On the ratio of optimal integral and fractional covers
-
Lovász L. On the ratio of optimal integral and fractional covers. Discrete Math. 13 4 (1975) 383-390
-
(1975)
Discrete Math.
, vol.13
, Issue.4
, pp. 383-390
-
-
Lovász, L.1
-
12
-
-
0028514351
-
On the hardness of approximating minimization problems
-
Lund C., and Yannakakis M. On the hardness of approximating minimization problems. J. Assoc. Comput. Mach. 41 5 (1994) 960-981
-
(1994)
J. Assoc. Comput. Mach.
, vol.41
, Issue.5
, pp. 960-981
-
-
Lund, C.1
Yannakakis, M.2
-
13
-
-
21344489538
-
Dimension and algorithms
-
Orders, algorithms, and applications. (Lyon, 1994), Springer, Berlin
-
Spinrad J. Dimension and algorithms. Orders, algorithms, and applications. (Lyon, 1994). Lecture Notes in Comput. Sci. volume 831 (1994), Springer, Berlin 33-52
-
(1994)
Lecture Notes in Comput. Sci.
, vol.831
, pp. 33-52
-
-
Spinrad, J.1
-
14
-
-
34250393424
-
A forbidden subposet characterization of an order-dimension inequality
-
Trotter W.T. A forbidden subposet characterization of an order-dimension inequality. Math. Systems Theory 10 1 (1976) 91-96
-
(1976)
Math. Systems Theory
, vol.10
, Issue.1
, pp. 91-96
-
-
Trotter, W.T.1
-
15
-
-
24944529657
-
Dimension theory
-
Combinatorics and partially ordered sets, Johns Hopkins University Press, Baltimore, MD
-
Trotter W.T. Dimension theory. Combinatorics and partially ordered sets. Johns Hopkins Series in the Mathematical Sciences (1992), Johns Hopkins University Press, Baltimore, MD
-
(1992)
Johns Hopkins Series in the Mathematical Sciences
-
-
Trotter, W.T.1
-
16
-
-
0042643338
-
Graphs and partially ordered sets: recent results and new directions
-
Surveys in graph theory (San Francisco, CA, 1995)
-
Trotter W.T. Graphs and partially ordered sets: recent results and new directions. Congr. Numer. 116 (1996) 253-278 Surveys in graph theory (San Francisco, CA, 1995)
-
(1996)
Congr. Numer.
, vol.116
, pp. 253-278
-
-
Trotter, W.T.1
-
17
-
-
0000434570
-
The complexity of the partial order dimension problem
-
Yannakakis M. The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods 3 3 (1982) 351-358
-
(1982)
SIAM J. Algebraic Discrete Methods
, vol.3
, Issue.3
, pp. 351-358
-
-
Yannakakis, M.1
|