Yahav Nussbaum

According to our database1, Yahav Nussbaum authored at least 20 papers between 2007 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Faster shortest paths in dense distance graphs, with applications.
Theor. Comput. Sci., 2018

Minimum Cut of Directed Planar Graphs in O(n log log n) Time.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications.
ACM Trans. Algorithms, 2017

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.
SIAM J. Comput., 2017

2015
Linear-Time Recognition of Probe Interval Graphs.
SIAM J. Discrete Math., 2015

Minimum Cut of Directed Planar Graphs in O(nloglogn) Time.
CoRR, 2015

2014
Recognition of probe proper interval graphs.
Discret. Appl. Math., 2014

2013
Isomorphism of graph classes related to the circular-ones property.
Discrete Mathematics & Theoretical Computer Science, 2013

Min-Cost Flow Duality in Planar Networks.
CoRR, 2013

2012
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Single Source - All Sinks Max Flows in Planar Digraphs.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
A Simpler Linear-Time Recognition of Circular-Arc Graphs.
Algorithmica, 2011

Maximum Flow in Directed Planar Graphs with Vertex Capacities.
Algorithmica, 2011

Improved Distance Queries in Planar Graphs.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Improved algorithms for min cut and max flow in undirected planar graphs.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Minimum s-t cut in undirected planar graphs when the source and the sink are close.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010
Multiple-source multiple-sink maximum flow in planar graphs
CoRR, 2010

2009
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs.
Discret. Appl. Math., 2009

2008
From a Circular-Arc Model to a Proper Circular-Arc Model.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007
Recognition of circular-arc graphs and some subclasses.
PhD thesis, 2007


  Loading...