![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Yehuda Koren Liran Carmel , David Harel , Yehuda Koren: Combining Hierarchy and Energy Drawing Directed Graphs. IEEE Transactions on Visualization and Computer Graphics 10 (1): 46-57 (2004) Yehuda Koren: On Spectral Graph Drawing. COCOON 2003 : 496-508 Yehuda Koren, David Harel : Axis-by-Axis Stress Minimization. Graph Drawing 2003 : 450-459 Yehuda Koren, David Harel : A two-way visualization method for clustered data. KDD 2003 : 589-594 Liran Carmel , David Harel , Yehuda Koren: Drawing Directed Graphs Using One-Dimensional Optimization. Graph Drawing 2002 : 193-206 David Harel , Yehuda Koren: Graph Drawing by High-Dimensional Embedding. Graph Drawing 2002 : 207-219 Yehuda Koren, Liran Carmel , David Harel : ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs. INFOVIS 2002 : 137-144 Yehuda Koren, David Harel : A Multi-scale Algorithm for the Linear Arrangement Problem. WG 2002 : 296-309 David Harel , Yehuda Koren: A Fast Multi-Scale Method for Drawing Large Graphs. J. Graph Algorithms Appl. 6 (3): 179-202 (2002) David Harel , Yehuda Koren: On Clustering Using Random Walks. FSTTCS 2001 : 18-41 David Harel , Yehuda Koren: Clustering spatial data using random walks. KDD 2001 : 281-286 David Harel , Yehuda Koren: A Fast Multi-Scale Method for Drawing Large Graphs. Advanced Visual Interfaces 2000 : 282-285 David Harel , Yehuda Koren: A Fast Multi-scale Method for Drawing Large Graphs. Graph Drawing 2000 : 183-196 1 [ 7 ] [ 9 ] [ 13 ] 2 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 13 ] ![]() ©2004 Association for Computing Machinery |