Yahav Nussbaum

32 papers A* 5A 3B 3Journal 19Unranked 1
YearRankTypeTitle / Venue / Authors
2018 J jnl
Faster shortest paths in dense distance graphs, with applications.
Theor. Comput. Sci.
Shay Mozes, Yahav Nussbaum, Oren Weimann
2018 A* conf
Minimum Cut of Directed Planar Graphs in
SODA
Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann
2017 J jnl
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.
SIAM J. Comput.
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen
2017 J jnl
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications.
ACM Trans. Algorithms
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
2015 J jnl
Linear-Time Recognition of Probe Interval Graphs.
SIAM J. Discret. Math.
Ross M. McConnell, Yahav Nussbaum
2015 J jnl
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time.
CoRR
Shay Mozes, Cyril Nikolaev, Yahav Nussbaum, Oren Weimann
2014 J jnl
Faster Shortest Paths in Dense Distance Graphs, with Applications.
CoRR
Shay Mozes, Yahav Nussbaum, Oren Weimann
2014 J jnl
Recognition of probe proper interval graphs.
Discret. Appl. Math.
Yahav Nussbaum
2013 J jnl
Isomorphism of graph classes related to the circular-ones property.
Discret. Math. Theor. Comput. Sci.
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2013 J jnl
Linear-Time Recognition of Probe Interval Graphs.
CoRR
Ross M. McConnell, Yahav Nussbaum
2013 J jnl
Min-Cost Flow Duality in Planar Networks.
CoRR
Haim Kaplan, Yahav Nussbaum
2012 J jnl
Isomorphism of graph classes related to the circular-ones property
CoRR
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2012 J jnl
Single Source - All Sinks Max Flows in Planar Digraphs
CoRR
Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
2012 A* conf
Single Source - All Sinks Max Flows in Planar Digraphs.
FOCS
Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
2012 A* conf
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications.
SODA
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
2011 J jnl
A Simpler Linear-Time Recognition of Circular-Arc Graphs.
Algorithmica
Haim Kaplan, Yahav Nussbaum
2011 B conf
Improved Distance Queries in Planar Graphs.
WADS
Yahav Nussbaum
2011 A* conf
Improved algorithms for min cut and max flow in undirected planar graphs.
STOC
Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
2011 J jnl
Maximum Flow in Directed Planar Graphs with Vertex Capacities.
Algorithmica
Haim Kaplan, Yahav Nussbaum
2011 A conf
Minimum s-t cut in undirected planar graphs when the source and the sink are close.
STACS
Haim Kaplan, Yahav Nussbaum
2011 J jnl
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
CoRR
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen
2011 A* conf
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.
FOCS
Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen
2010 J jnl
Improved distance queries in planar graphs
CoRR
Yahav Nussbaum
2010 J jnl
Multiple-source multiple-sink maximum flow in planar graphs
CoRR
Yahav Nussbaum
2009 J jnl
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs.
Discret. Appl. Math.
Haim Kaplan, Yahav Nussbaum
2009 A conf
Linear-Time Recognition of Probe Interval Graphs.
ESA
Ross M. McConnell, Yahav Nussbaum
2009 J jnl
Maximum Flow in Directed Planar Graphs with Vertex Capacities
CoRR
Haim Kaplan, Yahav Nussbaum
2009 A conf
Maximum Flow in Directed Planar Graphs with Vertex Capacities.
ESA
Haim Kaplan, Yahav Nussbaum
2008 B conf
From a Circular-Arc Model to a Proper Circular-Arc Model.
WG
Yahav Nussbaum
2007 — —
Recognition of circular-arc graphs and some subclasses.
Yahav Nussbaum
2006 — conf
A Simpler Linear-Time Recognition of Circular-Arc Graphs.
SWAT
Haim Kaplan, Yahav Nussbaum
2006 B conf
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs.
WG
Haim Kaplan, Yahav Nussbaum