-
1
-
-
0003495202
-
-
John Wiley and Sons, London
-
Barlow R.E., Bartholomew D.J., Bremner J.M., and Brunk H.D. Statistical Inference under Order Restrictions (1972), John Wiley and Sons, London
-
(1972)
Statistical Inference under Order Restrictions
-
-
Barlow, R.E.1
Bartholomew, D.J.2
Bremner, J.M.3
Brunk, H.D.4
-
4
-
-
84957380248
-
A bayesian paradigm for dynamic graph layout
-
Proc. 5th Int. Symp. Graph Drawing. GD'97, Springer
-
Brandes U., and Wagner D. A bayesian paradigm for dynamic graph layout. Proc. 5th Int. Symp. Graph Drawing. GD'97. LNCS vol. 1353 (1997), Springer 236-247
-
(1997)
LNCS
, vol.1353
, pp. 236-247
-
-
Brandes, U.1
Wagner, D.2
-
5
-
-
0000488282
-
The Matrix market: A web resource for test matrix collections
-
Chapman Hall
-
Boisvert R., Pozo R., Remington K., Barrett R., and Dongarra J. The Matrix market: A web resource for test matrix collections. Quality of Numerical Software, Assessment and Enhancement (1997), Chapman Hall 125-137
-
(1997)
Quality of Numerical Software, Assessment and Enhancement
, pp. 125-137
-
-
Boisvert, R.1
Pozo, R.2
Remington, K.3
Barrett, R.4
Dongarra, J.5
-
7
-
-
33846998645
-
Directed graph layout through constrained energy minimization
-
T. Dwyer, Y. Koren, Dig-CoLa: Directed graph layout through constrained energy minimization, IEEE Symposium on Information Visualization, Infovis'05, 2005, pp. 65-72
-
(2005)
IEEE Symposium on Information Visualization, Infovis'05
, pp. 65-72
-
-
Dwyer, T.1
Koren, Y.2
CoLa, D.3
-
9
-
-
84860053662
-
Fast node overlap removal (Addendum)
-
Technical Report
-
T. Dwyer, K. Marriott, P.J. Stuckey, Fast node overlap removal (Addendum), Technical Report, Monash University. http://www.csse.monash.edu.au/~tdwyer/FNORAddendum.pdf
-
-
-
Dwyer, T.1
Marriott, K.2
Stuckey, P.J.3
-
12
-
-
33845647173
-
IPSep-CoLa: an incremental procedure for separation constraint layout of graphs
-
Dwyer T., Koren Y., and Marriott K. IPSep-CoLa: an incremental procedure for separation constraint layout of graphs. IEEE Trans. Visualization Comput. Graphics 12 5 (2006) 821-828
-
(2006)
IEEE Trans. Visualization Comput. Graphics
, vol.12
, Issue.5
, pp. 821-828
-
-
Dwyer, T.1
Koren, Y.2
Marriott, K.3
-
13
-
-
0006767318
-
Navigating clustered graphs using force-directed methods
-
Eades P., and Huang M.L. Navigating clustered graphs using force-directed methods. J. Graph Algorithms Appl. 4 12 (2000) 157-181
-
(2000)
J. Graph Algorithms Appl.
, vol.4
, Issue.12
, pp. 157-181
-
-
Eades, P.1
Huang, M.L.2
-
14
-
-
0012758383
-
A new heuristic for the feedback arc set problem
-
Eades P., and Lin X. A new heuristic for the feedback arc set problem. Australian J. Combin. 12 (1995) 15-26
-
(1995)
Australian J. Combin.
, vol.12
, pp. 15-26
-
-
Eades, P.1
Lin, X.2
-
16
-
-
24144496062
-
Graph drawing by stress majorization
-
Proc. 12th Int. Symp. Graph Drawing. GD'04, Springer
-
Gansner E., Koren Y., and North S. Graph drawing by stress majorization. Proc. 12th Int. Symp. Graph Drawing. GD'04. LNCS vol. 3383 (2004), Springer 239-250
-
(2004)
LNCS
, vol.3383
, pp. 239-250
-
-
Gansner, E.1
Koren, Y.2
North, S.3
-
17
-
-
84957633546
-
Constrained graph layout
-
Proc. 3rd Int. Symp. Graph Drawing. GD'96, Springer
-
He W., and Marriott K. Constrained graph layout. Proc. 3rd Int. Symp. Graph Drawing. GD'96. LNCS vol. 1190 (1996), Springer 217-232
-
(1996)
LNCS
, vol.1190
, pp. 217-232
-
-
He, W.1
Marriott, K.2
-
18
-
-
0011777545
-
Constrained graph layout
-
He W., and Marriott K. Constrained graph layout. Constraints 3 (1998) 289-314
-
(1998)
Constraints
, vol.3
, pp. 289-314
-
-
He, W.1
Marriott, K.2
-
19
-
-
24144446983
-
The metro map layout problem
-
Proc. 12th Int. Symp. Graph Drawing. GD'04, Springer
-
Hong S., Merrick D., and Nascimento H. The metro map layout problem. Proc. 12th Int. Symp. Graph Drawing. GD'04. LNCS vol. 3383 (2004), Springer 482-491
-
(2004)
LNCS
, vol.3383
, pp. 482-491
-
-
Hong, S.1
Merrick, D.2
Nascimento, H.3
-
20
-
-
0024640140
-
An algorithm for drawing general undirected graphs
-
Kamada T., and Kawai S. An algorithm for drawing general undirected graphs. Inform. Process. Lett. 31 (1989) 7-15
-
(1989)
Inform. Process. Lett.
, vol.31
, pp. 7-15
-
-
Kamada, T.1
Kawai, S.2
-
26
-
-
0036354771
-
Warm-start strategies in interior-point methods for linear programming
-
Yildirim E.A., and Wright S.J. Warm-start strategies in interior-point methods for linear programming. SIAM J. Optim. 12 3 (2002) 782-810
-
(2002)
SIAM J. Optim.
, vol.12
, Issue.3
, pp. 782-810
-
-
Yildirim, E.A.1
Wright, S.J.2
|