| 2008 |
|---|
| 37 | EE | Yehuda Koren,
Ali Civril:
The Binary Stress Model for Graph Drawing.
Graph Drawing 2008: 193-205 |
| 36 | EE | Yifan Hu,
Yehuda Koren,
Chris Volinsky:
Collaborative Filtering for Implicit Feedback Datasets.
ICDM 2008: 263-272 |
| 35 | EE | Yehuda Koren:
Factorization meets the neighborhood: a multifaceted collaborative filtering model.
KDD 2008: 426-434 |
| 34 | EE | Yehuda Koren:
Tutorial on recent progress in collaborative filtering.
RecSys 2008: 333-334 |
| 2007 |
|---|
| 33 | EE | Robert M. Bell,
Yehuda Koren:
Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights.
ICDM 2007: 43-52 |
| 32 | EE | Hanghang Tong,
Christos Faloutsos,
Yehuda Koren:
Fast direction-aware proximity for graph mining.
KDD 2007: 747-756 |
| 31 | EE | Robert M. Bell,
Yehuda Koren,
Chris Volinsky:
Modeling relationships at multiple scales to improve accuracy of large recommender systems.
KDD 2007: 95-104 |
| 30 | EE | Robert M. Bell,
Yehuda Koren:
Lessons from the Netflix prize challenge.
SIGKDD Explorations 9(2): 75-79 (2007) |
| 29 | EE | Yehuda Koren,
Stephen C. North,
Chris Volinsky:
Measuring and extracting proximity graphs in networks.
TKDD 1(3): (2007) |
| 2006 |
|---|
| 28 | EE | Emden R. Gansner,
Yehuda Koren:
Improved Circular Layouts.
Graph Drawing 2006: 386-398 |
| 27 | EE | Yehuda Koren,
Stephen C. North,
Chris Volinsky:
Measuring and extracting proximity in networks.
KDD 2006: 245-255 |
| 26 | EE | Tim Dwyer,
Yehuda Koren,
Kim Marriott:
Drawing Directed Graphs Using Quadratic Programming.
IEEE Trans. Vis. Comput. Graph. 12(4): 536-548 (2006) |
| 25 | EE | Tim Dwyer,
Yehuda Koren,
Kim Marriott:
IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs.
IEEE Trans. Vis. Comput. Graph. 12(5): 821-828 (2006) |
| 2005 |
|---|
| 24 | EE | Tim Dwyer,
Yehuda Koren,
Kim Marriott:
Stress Majorization with Orthogonal Ordering Constraints.
Graph Drawing 2005: 141-152 |
| 23 | EE | Tim Dwyer,
Yehuda Koren:
DIG-COLA: Directed Graph Layout through Constrained Energy Minimization.
INFOVIS 2005: 9 |
| 22 | EE | Yehuda Koren,
David Harel:
One-dimensional layout optimization, with applications to graph drawing by axis separation.
Comput. Geom. 32(2): 115-138 (2005) |
| 21 | EE | Emden R. Gansner,
Yehuda Koren,
Stephen C. North:
Topological Fisheye Views for Visualizing Large Graphs.
IEEE Trans. Vis. Comput. Graph. 11(4): 457-468 (2005) |
| 2004 |
|---|
| 20 | EE | Emden R. Gansner,
Yehuda Koren,
Stephen C. North:
Graph Drawing by Stress Majorization.
Graph Drawing 2004: 239-250 |
| 19 | EE | Craig Gotsman,
Yehuda Koren:
Distributed Graph Layout for Sensor Networks.
Graph Drawing 2004: 273-284 |
| 18 | EE | Emden R. Gansner,
Yehuda Koren,
Stephen C. North:
Topological Fisheye Views for Visualizing Large Graphs.
INFOVIS 2004: 175-182 |
| 17 | | Yehuda Koren:
Graph Drawing by Subspace Optimization.
VisSym 2004: 65-74 |
| 16 | EE | Liran Carmel,
David Harel,
Yehuda Koren:
Combining Hierarchy and Energy Drawing Directed Graphs.
IEEE Trans. Vis. Comput. Graph. 10(1): 46-57 (2004) |
| 15 | EE | Yehuda Koren,
Liran Carmel:
Robust Linear Dimensionality Reduction.
IEEE Trans. Vis. Comput. Graph. 10(4): 459-470 (2004) |
| 14 | EE | David Harel,
Yehuda Koren:
Graph Drawing by High-Dimensional Embedding.
J. Graph Algorithms Appl. 8(2): 195-214 (2004) |
| 2003 |
|---|
| 13 | EE | Yehuda Koren:
On Spectral Graph Drawing.
COCOON 2003: 496-508 |
| 12 | EE | Yehuda Koren,
David Harel:
Axis-by-Axis Stress Minimization.
Graph Drawing 2003: 450-459 |
| 11 | EE | Yehuda Koren,
Liran Carmel:
Visualization of Labeled Data Using Linear Transformations.
INFOVIS 2003 |
| 10 | EE | Yehuda Koren,
David Harel:
A two-way visualization method for clustered data.
KDD 2003: 589-594 |
| 2002 |
|---|
| 9 | EE | Liran Carmel,
David Harel,
Yehuda Koren:
Drawing Directed Graphs Using One-Dimensional Optimization.
Graph Drawing 2002: 193-206 |
| 8 | EE | David Harel,
Yehuda Koren:
Graph Drawing by High-Dimensional Embedding.
Graph Drawing 2002: 207-219 |
| 7 | EE | Yehuda Koren,
Liran Carmel,
David Harel:
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs.
INFOVIS 2002: 137-144 |
| 6 | EE | Yehuda Koren,
David Harel:
A Multi-scale Algorithm for the Linear Arrangement Problem.
WG 2002: 296-309 |
| 5 | EE | David Harel,
Yehuda Koren:
A Fast Multi-Scale Method for Drawing Large Graphs.
J. Graph Algorithms Appl. 6(3): 179-202 (2002) |
| 2001 |
|---|
| 4 | EE | David Harel,
Yehuda Koren:
On Clustering Using Random Walks.
FSTTCS 2001: 18-41 |
| 3 | EE | David Harel,
Yehuda Koren:
Clustering spatial data using random walks.
KDD 2001: 281-286 |
| 2000 |
|---|
| 2 | | David Harel,
Yehuda Koren:
A Fast Multi-Scale Method for Drawing Large Graphs.
Advanced Visual Interfaces 2000: 282-285 |
| 1 | EE | David Harel,
Yehuda Koren:
A Fast Multi-scale Method for Drawing Large Graphs.
Graph Drawing 2000: 183-196 |
