Yahav Nussbaum

Generating author description...

All published works

Action	Title	Year	Authors
+	Faster shortest paths in dense distance graphs, with applications	2017	Shay Mozes Yahav Nussbaum Oren Weimann
+ PDF Chat	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	2017	Glencora Borradaile Philip N. Klein Shay Mozes Yahav Nussbaum Christian Wulff‐Nilsen
+	Minimum Cut of Directed Planar Graphs in O(nloglogn) Time	2015	Shay Mozes Cyril Nikolaev Yahav Nussbaum Oren Weimann
+ PDF Chat	Linear-Time Recognition of Probe Interval Graphs	2015	Ross M. McConnell Yahav Nussbaum
+	Minimum Cut of Directed Planar Graphs in O(nloglogn) Time	2015	Shay Mozes Cyril Nikolaev Yahav Nussbaum Oren Weimann
+	Faster Shortest Paths in Dense Distance Graphs, with Applications	2014	Shay Mozes Yahav Nussbaum Oren Weimann
+ PDF Chat	Isomorphism of graph classes related to the circular-ones property	2013	Andrew R. Curtis Min Chih Lin Ross M. McConnell Yahav Nussbaum Francisco J. Soulignac Jeremy Spinrad Jayme L. Szwarcfiter
+	Min-Cost Flow Duality in Planar Networks	2013	Haim Kaplan Yahav Nussbaum
+	Linear-Time Recognition of Probe Interval Graphs	2013	Ross M. McConnell Yahav Nussbaum
+	Single Source - All Sinks Max Flows in Planar Digraphs	2012	Jakub Łącki Yahav Nussbaum Piotr Sankowski Christian Wulff‐Nilsen
+ PDF Chat	Single Source -- All Sinks Max Flows in Planar Digraphs	2012	Jakub Łącki Yahav Nussbaum Piotr Sankowski Christian Wulff‐Nilsen
+	Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications	2012	Haim Kaplan Shay Mozes Yahav Nussbaum Micha Sharir
+	Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications	2012	Haim Kaplan Shay Mozes Yahav Nussbaum Micha Sharir
+	Single Source - All Sinks Max Flows in Planar Digraphs	2012	Jakub Łącki Yahav Nussbaum Piotr Sankowski Christian Wulff-Nilsen
+ PDF Chat	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	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	2011	Glencora Borradaile Philip N. Klein Shay Mozes Yahav Nussbaum Christian Wulff‐Nilsen
+ PDF Chat	Improved Distance Queries in Planar Graphs	2011	Yahav Nussbaum
+	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	2011	Glencora Borradaile Philip N. Klein Shay Mozes Yahav Nussbaum Christian Wulff-Nilsen
+	Improved distance queries in planar graphs	2010	Yahav Nussbaum
+ PDF Chat	Maximum Flow in Directed Planar Graphs with Vertex Capacities	2010	Haim Kaplan Yahav Nussbaum
+	Multiple-source multiple-sink maximum flow in planar graphs	2010	Yahav Nussbaum
+	Improved distance queries in planar graphs	2010	Yahav Nussbaum
+ PDF Chat	Linear-Time Recognition of Probe Interval Graphs	2009	Ross M. McConnell Yahav Nussbaum
+ PDF Chat	Maximum Flow in Directed Planar Graphs with Vertex Capacities	2009	Haim Kaplan Yahav Nussbaum
+	Maximum Flow in Directed Planar Graphs with Vertex Capacities	2009	Haim Kaplan Yahav Nussbaum
+	From a Circular-Arc Model to a Proper Circular-Arc Model	2008	Yahav Nussbaum
+ PDF Chat	A Simpler Linear-Time Recognition of Circular-Arc Graphs	2006	Haim Kaplan Yahav Nussbaum

Common Coauthors

Coauthor	Papers Together
Shay Mozes	10
Haim Kaplan	7
Christian Wulff‐Nilsen	5
Oren Weimann	4
Glencora Borradaile	4
Ross M. McConnell	4
Philip N. Klein	4
Jakub Łącki	3
Piotr Sankowski	3
Cyril Nikolaev	2
Micha Sharir	2
Christian Wulff-Nilsen	2
Andrew R. Curtis	1
Jayme L. Szwarcfiter	1
Min Chih Lin	1
Francisco J. Soulignac	1
Jeremy Spinrad	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time	2010	Shay Mozes Christian Wulff‐Nilsen	7
+ PDF Chat	Maximum Flow in Directed Planar Graphs with Vertex Capacities	2010	Haim Kaplan Yahav Nussbaum	4
+	Partition of planar flow networks	1983	D. Barton Johnson Shankar M. Venkatesan	3
+	An Efficient Test for Circular-Arc Graphs	1980	Alan Tucker	3
+	Geometric applications of a matrix-searching algorithm	1987	Alok Aggarwal Maria Klawe Shlomo Moran Peter W. Shor Robert Wilber	3
+	A survey of very large-scale neighborhood search techniques	2002	Ravindra K. Ahuja Özlem Ergün James B. Orlin Abraham P. Punnen	3
+	Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications	2012	Haim Kaplan Shay Mozes Yahav Nussbaum Micha Sharir	3
+ PDF Chat	Finding shortest non-trivial cycles in directed graphs on surfaces	2010	Sergio Cabello Éric Colin de Verdière Francis Lazarus	2
+	Finding the Maximal Empty Rectangle Containing a Query Point	2011	Haim Kaplan Micha Sharir	2
+	Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images	1984	Stuart Geman Donald Geman	2
+ PDF Chat	Multiple-Source Shortest Paths in Embedded Graphs	2013	Sergio Cabello Erin Wolf Chambers Jeff Erickson	2
+ PDF Chat	Multiplying matrices faster than coppersmith-winograd	2012	Virginia Vassilevska Williams	2
+ PDF Chat	Improved Distance Queries in Planar Graphs	2011	Yahav Nussbaum	2
+ PDF Chat	Linear-Time Recognition of Helly Circular-Arc Models and Graphs	2009	Benson Joeris Min Chih Lin Ross M. McConnell Jeremy Spinrad Jayme L. Szwarcfiter	2
+	Probe Matrix Problems: Totally Balanced Matrices	2007	David B. Chandler Jiong Guo Ton Kloks Rolf Niedermeier	2
+	PC trees and circular-ones arrangements	2003	Wen−Lian Hsu Ross M. McConnell	2
+ PDF Chat	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	2011	Glencora Borradaile Philip N. Klein Shay Mozes Yahav Nussbaum Christian Wulff‐Nilsen	2
+ PDF Chat	Computing the Girth of a Planar Graph in Linear Time	2013	Hsien-Chih Chang Hsueh-I Lu	2
+ PDF Chat	Matrix characterizations of circular-arc graphs	1971	Alan Tucker	2
+	Convex-Round and Concave-Round Graphs	2000	Jørgen Bang‐Jensen Jing Huang Anders Yeo	1
+	Perspectives of Monge properties in optimization	1996	Rainer E. Burkard Bettina Klinz Rüdiger Rudolf	1
+	The PIGs Full Monty – A Floor Show of Minimal Separators	2005	Gerard J. Chang A.J.J. Kloks Jiping Liu Sheng‐Lung Peng	1
+ PDF Chat	Structured recursive separator decompositions for planar graphs in linear time	2013	Philip N. Klein Shay Mozes Christian Sommer	1
+	Shortest non-trivial cycles in directed surface graphs	2011	Jeff Erickson	1
+	Improved Bounds for Shortest Paths in Dense Distance Graphs	2016	Paweł Gawrychowski Adam Karczmarz	1
+ PDF Chat	Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time	2010	Glencor Borradaile Piotr Sankowski Christian Wulff‐Nilsen	1
+ PDF Chat	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	2017	Glencora Borradaile Philip N. Klein Shay Mozes Yahav Nussbaum Christian Wulff‐Nilsen	1
+	Practical and Efficient Circle Graph Recognition	2011	Emeric Gioan Christophe Paul Marc Tedder Derek G. Corneil	1
+	Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time	2010	Glencora Borradaile Piotr Sankowski Christian Wulff‐Nilsen	1
+	Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time	2009	Shay Mozes Christian Wulff‐Nilsen	1
+	Multiple-Source Shortest Paths in Embedded Graphs	2012	Sergio Cabello Erin Wolf Chambers Jeff Erickson	1
+ PDF Chat	Maximum st-Flow in Directed Planar Graphs via Shortest Paths	2013	Glencora Borradaile Anna Harutyunyan	1
+	Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications	2012	Haim Kaplan Shay Mozes Yahav Nussbaum Micha Sharir	1
+	Finding the Maximal Empty Rectangle Containing a Query Point	2011	Haim Kaplan Micha Sharir	1
+	Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space	2012	Johannes Köbler Sebastian Kuhnert Oleg Verbitsky	1
+	Extremal Graph Theory	1978	Béla Bollobás	1
+	Finding the largest axis aligned rectangle in a polygon in o(n log n) time.	2001	Ralph P. Boland Jorge Urrutia	1
+	Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs	2006	Min Chih Lin Jayme L. Szwarcfiter	1
+	Avoiding matrix multiplication	1991	Tze-Heng Ma Jeremy Spinrad	1
+	From a Circular-Arc Model to a Proper Circular-Arc Model	2008	Yahav Nussbaum	1
+	Querying for the Largest Empty Geometric Object in a Desired Location	2010	John Augustine Sandip Das Anil Maheshwari Subhas C. Nandy Sasanka Roy Swami Sarvattomananda	1
+	ON SIMPLE LINEAR PROGRAMMING PROBLEMS	2003	Alan J. Hoffman	1
+	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time	2010	Philip N. Klein Shay Mozes	1
+	Girth of a Planar Digraph with Real Edge Weights in O(n(log n)^3) Time	2009	Christian Wulff‐Nilsen	1
+ PDF Chat	Improved Submatrix Maximum Queries in Monge Matrices	2014	Paweł Gawrychowski Shay Mozes Oren Weimann	1
+	Multiple source, single sink maximum flow in a planar graph	2010	Glencora Borradaile Christian Wulff‐Nilsen	1
+ PDF Chat	Min <i>st</i> -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time	2015	Glencora Borradaile Piotr Sankowski Christian Wulff‐Nilsen	1
+	A selected tour of the theory of identification matrices	2000	Lin Chen	1
+ PDF Chat	A Simpler Linear-Time Recognition of Circular-Arc Graphs	2006	Haim Kaplan Yahav Nussbaum	1
+	Combinatorial Geometry in the Plane.	1965	G. P. Johnson H. Hadwiger Hans Debrunner Victor Klee	1