The following pages link to Yahav Nussbaum (Q634674):
Displaying 19 items.
- Maximum flow in directed planar graphs with vertex capacities (Q634675) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- (Q3113677) (← links)
- Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs (Q3522966) (← links)
- Maximum Flow in Directed Planar Graphs with Vertex Capacities (Q3639262) (← links)
- (Q4607913) (← links)
- Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications (Q4962663) (← links)
- Improved Distance Queries in Planar Graphs (Q5199280) (← links)
- From a Circular-Arc Model to a Proper Circular-Arc Model (Q5302066) (← links)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455) (← links)
- Improved algorithms for min cut and max flow in undirected planar graphs (Q5419101) (← links)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5495015) (← links)
- (Q5743404) (← links)
- (Q5747380) (← links)
- A Simpler Linear-Time Recognition of Circular-Arc Graphs (Q5757898) (← links)
- Linear-Time Recognition of Probe Interval Graphs (Q5899485) (← links)
