Author of the publication

SDE: Graph Drawing Using Spectral Distance Embedding.

, , and . GD, volume 3843 of Lecture Notes in Computer Science, page 512-513. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Column Subset Selection Problem is UG-hard.. J. Comput. Syst. Sci., 80 (4): 849-859 (2014)Column subset selection for approximating data matrices.. Rensselaer Polytechnic Institute, USA, (2009)A Compound Graph Layout Algorithm for Biological Pathways., , , , and . GD, volume 3383 of Lecture Notes in Computer Science, page 442-447. Springer, (2004)Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD, and . Algorithms and Computation, volume 5369 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2008)Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD., and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 414-423. Springer, (2008)9/7-Approximation for Two-Edge-Connectivity.. CoRR, (2024)The Binary Stress Model for Graph Drawing., and . GD, volume 5417 of Lecture Notes in Computer Science, page 193-205. Springer, (2008)SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding., , and . GD, volume 4372 of Lecture Notes in Computer Science, page 30-41. Springer, (2006)A Layout Algorithm for Undirected Compound Graphs, , , , and . Inf. Sci., 179 (7): 980--994 (March 2009)SDE: Graph Drawing Using Spectral Distance Embedding, , and . Graph Drawing, volume 3843 of Lecture Notes in Computer Science, Springer, Berlin / Heidelberg, (2006)