Adam J. Friedlander

According to our database1, Adam J. Friedlander authored at least 2 papers between 2010 and 2012.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time.
Theor. Comput. Sci., 2012

2010
Counting Minimum (<i>s</i>, <i>t</i>)-Cuts in Weighted Planar Graphs in Polynomial Time.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010


  Loading...