Oldest pages

Jump to: navigation, search

Showing below up to 24 results in range #1 to #24.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Test png‏‎ (15:43, 21 September 2015)
  2. Discrete Time-Cost Tradeoff Problem‏‎ (08:58, 22 September 2015)
  3. Uniform covers by tours‏‎ (13:13, 23 September 2015)
  4. Popular matchings in non-bipartite graphs‏‎ (18:52, 24 September 2015)
  5. Open problems on element-connectivity‏‎ (05:22, 25 September 2015)
  6. Bipartition-constrained edge-connectivity augmentation avoiding a prescribed perfect matching‏‎ (14:49, 25 September 2015)
  7. High connectivity keeping spanning trees‏‎ (17:12, 27 September 2015)
  8. Long Cycles in Euclidean 2-Factors‏‎ (17:13, 27 September 2015)
  9. Approximability of the Tree Augmentation Problem‏‎ (09:32, 28 September 2015)
  10. Unbalanced Point-to-Point Connectivity Problem‏‎ (15:13, 28 September 2015)
  11. Sparsest Cut by Random Contraction‏‎ (17:44, 28 September 2015)
  12. Minimum Intersection of Tree and Perfect Matching‏‎ (22:13, 28 September 2015)
  13. Minimum Intersection of a Spanning Tree and a Perfect Matching‏‎ (22:16, 28 September 2015)
  14. The 4/3-Conjecture for Eulidean TSP‏‎ (18:13, 29 September 2015)
  15. The 4/3-Conjecture for Euclidean TSP‏‎ (12:14, 30 September 2015)
  16. Poly-time algorithm for L-convex fn minimization‏‎ (13:44, 8 October 2015)
  17. Representation of M^\natural-convex set function‏‎ (21:59, 8 October 2015)
  18. Deterministic algorithm for maximizing a monotone submodular function over a matroid‏‎ (15:41, 9 October 2015)
  19. Partitioning a matroid into independent sets‏‎ (10:17, 12 October 2015)
  20. Coverage Maximization with Uniform Query Sizes in Stochastic Settings‏‎ (20:11, 20 October 2015)
  21. Status of Minimum Bisection on Planar Graphs‏‎ (11:29, 23 November 2015)
  22. Main Page‏‎ (17:57, 23 November 2015)
  23. Volume of the BQP‏‎ (18:05, 23 November 2015)
  24. Is a given graph a k-trail?‏‎ (11:21, 8 December 2015)

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)