35 citations to 10.1002/net.3230210602 (Crossref Cited-By Service)
  1. Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh, “Compacting cuts”, ACM Trans. Algorithms, 5, no. 3, 2009, 1  crossref
  2. Yonatan Aumann, Yuval Rabani, “An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm”, SIAM J. Comput., 27, no. 1, 1998, 291  crossref
  3. Nicolas Catusse, Victor Chepoi, Yann Vaxès, “Embedding into the rectilinear plane in optimal O(n2) time”, Theoretical Computer Science, 412, no. 22, 2011, 2425  crossref
  4. Paradigms of Combinatorial Optimization, 2014, 707  crossref
  5. Michel Deza, Monique Laurent, “Applications of cut polyhedra — I”, Journal of Computational and Applied Mathematics, 55, no. 2, 1994, 191  crossref
  6. David Avis, Hiroshi Imai, Tsuyoshi Ito, “On the relationship between convex bodies related to correlation experiments with dichotomic observables”, J. Phys. A: Math. Gen., 39, no. 36, 2006, 11283  crossref
  7. Meera Sitharam, Joel Willoughby, 9201, Automated Deduction in Geometry, 2015, 129  crossref
  8. Michel Deza, Monique Laurent, “Hypercube embedding of generalized bipartite metrics”, Discrete Applied Mathematics, 56, no. 2-3, 1995, 215  crossref
  9. Krzysztof Onak, Anastasios Sidiropoulos, Proceedings of the twenty-fourth annual symposium on Computational geometry, 2008, 28  crossref
  10. Selim Esedoḡ Lu, Felix Otto, “Threshold Dynamics for Networks with Arbitrary Surface Tensions”, Comm Pure Appl Math, 68, no. 5, 2015, 808  crossref
Previous
1
2
3
4
Next