Yahav Nussbaum

Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy Spinrad, Jayme Luiz Szwarcfiter: Isomorphism of graph classes related to the circular-ones property. Discrete Mathematics & Theoretical Computer Science 15(1): 157-182 (2013)

Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen: Single Source - All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599-608

Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir: Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. SODA 2012: 338-355

Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy Spinrad, Jayme Luiz Szwarcfiter: Isomorphism of graph classes related to the circular-ones property. CoRR abs/1203.4822 (2012)

Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen: Single Source - All Sinks Max Flows in Planar Digraphs. CoRR abs/1210.4811 (2012)

Haim Kaplan, Yahav Nussbaum: Maximum Flow in Directed Planar Graphs with Vertex Capacities. Algorithmica 61(1): 174-189 (2011)

Haim Kaplan, Yahav Nussbaum: A Simpler Linear-Time Recognition of Circular-Arc Graphs. Algorithmica 61(3): 694-737 (2011)

Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. FOCS 2011: 170-179

Haim Kaplan, Yahav Nussbaum: Minimum s-t cut in undirected planar graphs when the source and the sink are close. STACS 2011: 117-128

Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen: Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313-322

Yahav Nussbaum: Improved Distance Queries in Planar Graphs. WADS 2011: 642-653

Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. CoRR abs/1105.2228 (2011)

Yahav Nussbaum: Improved distance queries in planar graphs. CoRR abs/1012.2825 (2010)

Yahav Nussbaum: Multiple-source multiple-sink maximum flow in planar graphs. CoRR abs/1012.4767 (2010)

Haim Kaplan, Yahav Nussbaum: Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. Discrete Applied Mathematics 157(15): 3216-3230 (2009)

Ross M. McConnell, Yahav Nussbaum: Linear-Time Recognition of Probe Interval Graphs. ESA 2009: 349-360

Haim Kaplan, Yahav Nussbaum: Maximum Flow in Directed Planar Graphs with Vertex Capacities. ESA 2009: 397-407

Haim Kaplan, Yahav Nussbaum: Maximum Flow in Directed Planar Graphs with Vertex Capacities. CoRR abs/0905.0451 (2009)

Yahav Nussbaum: From a Circular-Arc Model to a Proper Circular-Arc Model. WG 2008: 324-335

Yahav Nussbaum: Recognition of circular-arc graphs and some subclasses. University of Tel-Aviv 2007, pp. I-IV, 1-88

Haim Kaplan, Yahav Nussbaum: A Simpler Linear-Time Recognition of Circular-Arc Graphs. SWAT 2006: 41-52

Haim Kaplan, Yahav Nussbaum: Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. WG 2006: 289-300