Welcome to my site.


Etcheverry Hall

University of California

Berkeley, CA 94720

TEL: (510) 642-4998

FAX: (510) 642-1403

hochbaum at ieor.berkeley.edu


The neuron segmentation algorithm HNCcorr is the leading algorithm in the Neurofinder . benchmark for cell identification in calcium imaging movies. The algorithm is HNC (Hochbaum Normalized Cut), aka NC', with similarities based on distances in correlation space. This is joint work with Quico Spaen and Roberto Asin.

As for older news:

I was elected as a Fellow of the Society for Industrial and Applied Mathematics List of SIAM Fellows 2014 and citations. "SIAM Fellows are nominated by peers for their d uished contributions to the fields of applied mathematics and computational science and related disciplines. They will be recognized at the 2014 SIAM Annual Meeting to be held in Chicago in July."

My paper Polynomial time algorithms for ratio regions and a variant of normalized cut , is the winner of the ICS2011 computing prize (awarded at INFORMS NC Nov 15, 2011). And I was awarded an NSF award on "Novel efficient clustering techniques for data mining, ranking, pattern recognition and segmentation of large scale data sets."

I try to be an optimizer in whatever I do, and my research interests reflect that. Some problem applications I am interested in include:

  • Data mining and pattern recognition with flow techniques
  • Image segmentation and detecting hidden features in medical images
  • Detecting security threats - domestic nuclear threat detection The DoNuTS project
  • Information technology issues in supply chain management
  • Manufacturing of VLSI circuit
  • Testing and designing circuits
  • Scheduling problems
  • Planning of mining operations
  • Locations of facilities
  • Distribution and logistics
  • And, baking cakes optimally

Please consult the list of publications or technical reports for specific titles.

I also have substantial interest in algorithms that solve problems as efficiently as possible and exploring complexity issues. These include approximation algorithms, strongly polynomial algorithms, practical integer programming algorithms for discrete optimization problems, problems on graphs, and nonlinear problems.

Various software for algorithms used and developed in my research is available here.

A collection of algorithms with Java interfaces is included in our RIOT Project site. An algorithm about baseball elimination problem is included here.

Topics in nonlinear complexity and combinatorial optimization: IEOR 290G, Spring 2017 -

in Lecture notes Spring 2017.

Network Flows and Graph Algorithms: IEOR 266, updated Fall 2016 -

in Lecture notes Fall 2016.

Integer Programming and Combinatorial Optimization: IEOR 269 -

in Lecture notes Spring 2010.