Yahav Nussbaum

Teaching

• Data Structures (2009 - )
• Communication Networks (2008)

My publications

Interval graphs, circular-arc graphs

• A simpler linear-time recognition of circular-arc graphs, with Haim Kaplan
  journal (Algorithmica) conference (SWAT 06)
• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs, with Haim Kaplan
  journal (Discrete Applied Mathematics) conference (WG 06)
• From a circular-arc model to a proper circular-arc model
  conference (WG 08)
• Linear-time recognition of probe interval graphs, with Ross McConnell
  conference (ESA 09)

Planar graphs

• Maximum flow in directed planar graphs with vertex capacities, with Haim Kaplan
  journal (Algorithmica) conference (ESA 09) preprint
• Minimum s-t cut in undirected planar graphs when the source and the sink are close, with Haim Kaplan
  conference (STACS 2011)
• Improved algorithms for min cut and max flow in undirected planar graphs, with Giuseppe F. Italiano, Piotr Sankowski and Christian Wulff-Nilsen
  conference (STOC 2011)
• Improved distance queries in planar graphs
  conference (WADS 2011) preprint
• Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time, with Glencora Borradaile, Philip N. Klein, Shay Mozes and Christian Wulff-Nilsen
  conference (FOCS 2011) preprint
• Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications, with Haim Kaplan, Shay Mozes and Micha Sharir
  conference (SODA 2012)