Yoram J. Sussmann

According to our database1, Yoram J. Sussmann authored at least 12 papers between 1996 and 2006.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
A Delta-Wye-Delta Reduction for Planar Grid Graphs in Subquadratic Time.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2003
Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry.
J. Graph Algorithms Appl., 2003

2001
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry.
Proceedings of the Algorithm Engineering, 2001

2000
Fault tolerant K-center problems.
Theor. Comput. Sci., 2000

The Capacitated <i>K</i>-Center Problem.
SIAM J. Discret. Math., 2000

The full-degree spanning tree problem.
Networks, 2000

1998
Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997).
SIGACT News, 1998

Facility Location with Dynamic Distance Functions.
J. Comb. Optim., 1998

Facility Location with Dynamic Distance Function (Extended Abstract).
Proceedings of the Algorithm Theory, 1998

Low-Bandwidth Routing and Electrical Power Networks.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Speeding up Bulk-Loading of Quadtrees.
Proceedings of the GIS '97. Proceedings of the 5th International Workshop on Advances in Geographic Information Systems, 1997

1996
The Capacitated K-Center Problem (Extended Abstract).
Proceedings of the Algorithms, 1996


  Loading...