Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 94
Number of items: 94
  • Open Access
    Gijswijt, D. C. (2005). Matrix algebras and semidefinite programming techniques for codes. [Thesis, fully internal, Universiteit van Amsterdam].
  • Mohar, B., & Schrijver, A. (2003). Blocking nonorientability of a surface. Journal of Combinatorial Theory Series B, 87, 2-16. https://doi.org/10.1016/S0095-8956(02)00025-4
  • Gerards, A. H., Maróti, G., & Schrijver, A. (2003). Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "A generalization of the perfect graph theorem under the disjunctive index''. Mathematics of operations research, 28, 884-885. https://doi.org/10.1287/moor.28.4.884.20516
  • Schrijver, A. (2003). Matching, edge-colouring, dimers. Lecture Notes in Computer Science, 2880, 13-22.
  • Schrijver, A. (2003). Combinatorial optimization. Polyhedra and efficiency. (Algorithms and Combinatorics; No. 24). Springer Verlag.
  • Gijswijt, D. C., & Schrijver, A. (2003). On the b-stable set polytope of graphs without bad K-4. SIAM Journal on Discrete Mathematics, 16(3), 511-516. https://doi.org/10.1137/S0895480102417343
  • Schrijver, A. (2002). A short proof of Guenin's characterization of weakly bipartite graphs. Journal of Combinatorial Theory Series B, 85(2), 255-260. https://doi.org/10.1006/jctb.2001.2101
  • Schrijver, A. (2002). Strong t-perfection of bad K-4 graphs. SIAM Journal on Discrete Mathematics, 15(3), 403-415. https://doi.org/10.1137/S0895480101401101
  • Schrijver, A. (2002). On the history of the transportation and the maximum flow problems. Mathematical programming, 91, 437-445. https://doi.org/10.1007/s101070100259
  • Schrijver, A. (2001). A short proof of Mader's S-paths theorem. Journal of Combinatorial Theory Series B, 82, 319-321. https://doi.org/10.1006/jctb.2000.2029
Page 5 of 10