Publications

• ¤ I. Safro, L. Segel, "Collective stochastic versions of playable games as metaphors for complex biosystems: Team Collect Four", Complexity 8 (2003), 46-55, download
• ¤ I. Safro, "The minimum linear arrangement problem", M.Sc. Thesis, Weizmann Institute of Science,2002.
• ¤ I. Safro, D. Ron, A. Brandt, "Graph Minimum Linear Arrangement by Multilevel Weighted Edge Contractions", Journal of Algorithms, vol. 60/1, pp. 24-41, 2006, download
• ¤ I. Safro, D. Ron, A. Brandt, "A Multilevel Algorithm for the Minimum 2-sum Problem", Journal of Graph Algorithms and Applications, vol. 10/2, 2006, download
• ¤ L. Klipcan, I. Safro, B. Temkin, M. Safro, "Optimal growth temperature of prokaryotes correlates with class II amino acid composition", FEBS Letters, vol. 580/6, pp. 1672-1676, 2006, download
• ¤ I. Safro, "Multilevel Algorithms for Combinatorial Optimization Problems", Ph.D. Thesis, The Weizmann Institute of Science, 2007, download
• ¤ I. Safro, D. Ron, A. Brandt, "Multilevel Algorithms for Linear Ordering Problems", ACM Journal of Experimental Algorithmics, vol. 13, pp. 1.4-1.20, 2008, download
• ¤ C. Chevalier, I. Safro, "Comparison of coarsening schemes for multilevel graph partitioning", Learning and Intelligent Optimization III, LNCS 5851, pp. 191-205. Springer, 2009, download
• ¤ D. Ron, I. Safro, A. Brandt, "A fast multigrid algorithm for energy minimization under planar density constraints", Submitted, 2009, Preprint ANL/MCS-P1560-1108, download
• ¤ O. Roderick, I. Safro, "Polynomial Interpolation for Predicting Decisions and Recovering Missing Data", Preprint ANL/MCS-P1586-0209, Submitted, 2009.
• ¤ I. Safro, P. Hovland, J. Shin, M. Strout, "Improving random walk performance", In the Proceedings of the International Conference on Scientific Computing (CSC), 2009, download
• ¤ E. Boman, U. Catalyurek, C. Chevalier, K. Devine, I. Safro, M. Wolf, "Advances in Parallel Partitioning, Load Balancing, and Matrix Ordering", Journal of Physics: Conference Series, vol. 180, 2009, download
• ¤ J. Chen, I. Safro, "A Measure of the Connection Strengths between Graph Vertices with Applications", Submitted, 2009
• ¤ O. Roderick, I. Safro, "Learning Highly-Filtered Data by Nonlinear Spectral Methods", Submitted, 2009.
• ¤ J. Chen, I. Safro, "Algebraic Distance on Graphs", Submitted, 2009, download

Book chapters

• ¤ I. Safro, D. Ron, A. Brandt, "Fast Multilevel Algorithms for Linear Ordering Problems", Computational Optimization: New Research Developments, Nova Science Publishers, ISBN: 978-1-60692-671-0.

ArXiv and unpublished

• ¤ I. Safro, "Discovery of new hypotheses about the relation of biological objects using MEDLINE information", 2000.
• ¤ I. Safro, "The minimum linear arrangement problem on proper interval graphs", arXiv, cs.DM/0608008, 2002, download.
• ¤ S. Benditkis, I. Safro, "Generalizations of the Hanoi Towers problem", arXiv, cs.DM/0612070, 1998, download.

Selected extended abstracts

• ¤ L. Brodsky, M. Kositsky, A. Leontovich, Y. Kalaidzidis, I. Safro, M. Shtutman, E. Feinstein, "Gene Expression Analysis Tools", Annual Israeli Bioinformatics Symposium, 2002.
• ¤ I. Safro, D. Ron, A. Brandt, "Multilevel Algorithms for Linear Ordering Problems", SIAM Workshop on Combinatorial Scientific Computing, 2005, download.
• ¤ A. Lyons, I. Safro, "Randomized Heuristics for Exploiting Jacobian Scarcity", Dagstuhl Seminar on Combinatorial Scientific Computing, 2009, download.
• ¤ D. Ron, I. Safro, A. Brandt, "Fast Multilevel Solver for Quadratic Optimization under Planar Density Constraints", European Conference on Operational Research, 2009.
• ¤ I. Safro, "Algebraic Distance and Its Applications to Combinatorial Scientific Computing Problems", SIAM Workshop on Combinatorial Scientific Computing, 2009.

Web albums I
Web albums II

---

Theatre

Look back in anger	An Ordinary Miracle	Lion and panther
A Marriage Proposal	Kean IV

---

Antiscientific collaborations

Under construction

I received my Ph.D. degree from The Weizmann Institute of Science under supervision of Achi Brandt and Dorit Ron, in 2007. As of November 2007, I am a CSCAPES Postdoctoral Fellow in the Laboratory for Advanced Numerical Simulations, Mathematics and Computer Science Division, Argonne National Laboratory (Host: Dr. Paul Hovland).

Research Interests:
¤	Multiscale algorithms
¤	Graph theory, algorithms and applications
¤	Large-scale and massive data problems, high-performance computing
¤	Combinatorial optimization
¤	Iterative methods, sparse matrix computations
¤	Complex biosystems
¤	Predicting decisions and recovering missing data, knowledge discovery and IR
¤	Combinatorial problems in automatic differentiation

Software

Currently I have four multiscale solvers for the following NP-hard problems on (un)weighted graphs:

¤	minimum linear arrangement problem
¤	minimum 2-sum problem
¤	minimum bandwidth problem
¤	minimum workbound problem

The corresponing paper on the multiscale methods for linear ordering problems can be found here. The algorithms are implemented in C++ using LEDA and Lapack/Lapack++. Please send me an email if you need these implementations.

My Erdös number is 3.

Some Recent Professional Activities

¤	Program committee member: Learning and Intelligent Optimization 2010 (Please, submit!)
¤	Referee: Information Sciences, Journal of Algorithms in Cognition, Informatics and Logic