Sagi Hed

According to our database, Sagi Hed authored at least 4 papers between 2011 and 2017.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2017

Minimum-Cost Flows in Unit-Capacity Networks.

Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan

Theory Comput. Syst., 2017

2015

Minimum Cost Flows in Graphs with Unit Capacities.

Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search.

Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck

Proceedings of the Algorithms - ESA 2015, 2015

2011

Maximum Flows by Incremental Breadth-First Search.

Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck

Proceedings of the Algorithms - ESA 2011, 2011