Prof. Ofer Neiman

neimano foto Professor
Advisor for honour students

Research: My research focuses on theoretical computer science, more specifically: graph algorithms, combinatorics, discrete geometry, metric spaces, and their application to computer science and algorithms.
A typical problem in metric embedding is how well can one embed a given graph into a simpler space, i.e Euclidean space or a sparse sub-graph, while (approximately) maintaining the pairwise distance between vertices. Recently, I'm also studying other data structures that preserve distances (compact routing, distance oracles, spanners, hopsets).

Contacts

Email:
Homepage:
Office: 215 in 37 building
Phone number: 08-6428113
Fax number: 08-6477650
Box number: 67
Office hours: Sun 14:00-16:00

Teaching

Fall 2018-2019 20225831 Algorithms 2
Spring 2019 20214631 Topics in randomized algorithms
Spring 2019 20211061 Discrete Structures and Combinatorics
Fall 2017-2018 20224771 Introduction to Computational Complexity
Fall 2017-2018 20221561 Theory Seminar
Fall 2017-2018 20224851 Spectral Graph Theory
Spring 2018 20211061 Discrete Structures and Combinatorics
Spring 2018 20224711 Inverse Course in Metric Embedding
Fall 2016-2017 20217771 Research experience 1 for oustanding Students in "Dkalim" Program
Fall 2016-2017 20224771 Introduction to Computational Complexity
Fall 2016-2017 20217773 Research experience 2 for oustanding Students in "Dkalim" Program
Fall 2016-2017 20225831 Algorithms 2
Spring 2017 20215481 Topics in The Frontiers of Computer Science for Honor Students 2
Spring 2017 20211061 Discrete Structures and Combinatorics
Fall 2015-2016 20221111 Complexity of Computations
Fall 2015-2016 20224851 Spectral Graph Theory
Spring 2016 20211061 Discrete Structures and Combinatorics
Spring 2016 20215481 Topics in The Frontiers of Computer Science for Honor Students 2
Spring 2016 20214221 project for honor students
Fall 2014-2015 20225561 Research Seminar 1
Fall 2014-2015 20225951 Randomized Algorithms
Fall 2014-2015 20221111 Complexity of Computations
Fall 2014-2015 20225831 Algorithms 2
Spring 2015 20211061 Discrete Structures and Combinatorics
Fall 2013-2014 20225831 Algorithms 2
Fall 2013-2014 20221561 Theory Seminar
Fall 2013-2014 20225561 Research Seminar 1
Fall 2013-2014 20221111 Complexity of Computations
Fall 2013-2014 20214001 Research Project
Spring 2014 20225891 Metric Embedding and its Algorithmic Applications
Spring 2014 20211061 Discrete Structures and Combinatorics
Fall 2012-2013 20225831 Algorithms 2
Fall 2012-2013 20221111 Complexity of Computations
Fall 2012-2013 20225551 Research Seminar
Spring 2013 20211061 Discrete Structures and Combinatorics
Fall 2011-2012 20225711 Approximation Algorithms
Spring 2012 20019071 Introduction to Programming for IAF
Spring 2012 20211061 Discrete Structures and Combinatorics

Research groups

Algorithms
Distributed Algorithms
Low Distortion Embeddings