Research interests: I did some graph drawing and visualization.
I am now mostly interested in
approximation
algorithms and algorithmic aspects of linear algebra
with applications in data mining. I also have a special place in
my heart for combinatorics and graph theory.
Work (in historical order):
A Compound
Graph Layout Algorithm for Biological Pathways, Proc. 14th Intl. Symp. Graph Drawing (GD
'04) (with U.
Dogrusoz, E. Giral, A. Cetintas and E. Demir)
SDE: Graph Drawing Using Spectral Distance Embedding, Proc. 15th Intl. Symp. Graph Drawing (GD
'05) (with M. Magdon-Ismail) Important
Note: This is an
unintentional re-invention of Classical Multi-dimensional Scaling which
appeared as a 2 page poster in the proceedings. It was also filed as a
12 page tech report.
SSDE: Fast
Graph Drawing Using Sampled Spectral Distance Embedding, Proc. 16th Intl. Symp. Graph Drawing (GD
'06)- pdf
(with M. Magdon-Ismail
and E.
Bocek-Rivele)
The Binary
Stress Model for Graph Drawing, Proc.
16th Intl. Symp. Graph Drawing (GD '08) - pdf
(with Yehuda Koren)
Deterministic
Sparse Column Based Matrix Reconstruction via Greedy Approximation of
SVD, 19th Intl. Symp. Algorithms and Computation (ISAAC 2008) - pdf (with M. Magdon-Ismail)
On Selecting Maximum
Volume Submatrices of a Matrix and Related Problems - pdf (with M.
Magdon-Ismail)
submitted. Here is a
preliminary 2007 RPI
Tech Report - pdf
A
Layout Algorithm for Undirected Compound Graphs, to appear in Information Sciences
(with U. Dogrusoz, E. Giral, A. Cetintas and E. Demir)