Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 94
Number of items: 94
  • Schrijver, A. (1999). Bipartite edge-colouring in $O (\Delta m) $ time. SIAM Journal on Computing, (28), 841-1026.
  • van Vlijmen, S. F. M., Klusener, A. S., & Schrijver, A. (1999). The compact dynamic busstation. Electronic Notes in Theoretical Computer Science, (21), 7. https://doi.org/10.1016/S1571-0661(05)01190-4
  • van der Holst, H., Lovasz, L., & Schrijver, A. (1999). The Colin de Verdière parameter. In L. Lov'asz, G. Kantona, A. Recski, L. A. Sz'ekely, & A. Gy'arfas (Eds.), Graph Theory and Combinational Biology (pp. 29-85). J'anos Bolyai Mathematical Society.
  • Keijsper, J. C. M., & Schrijver, A. (1998). On packing connectors. Journal of Combinatorial Theory Series B, 73, 184-188. https://doi.org/10.1006/jctb.1998.1825
  • Lovasz, L., & Schrijver, A. (1998). A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs. Proceedings of the American Mathematical Society, 126, 1275-1285. https://doi.org/10.1090/S0002-9939-98-04244-0
  • Schrijver, A. (1998). Routing and timetabling by topological search. Documenta Mathematica, Extra Vol.(ICM III), 687-695.
  • Schrijver, A. (1998). Counting 1-factors in regular bipartite graphs. Journal of Combinatorial Theory Series B, 72, 122-135. https://doi.org/10.1006/jctb.1997.1798
  • Schrijver, A. (1998). Bipartite edge-colouring in $O(\Delta m)$ time. SIAM Journal on Computing, 841-846.
  • Pendavingh, R. A. (1998). Spectral and geometrical graph characterizations. [Thesis, fully internal, Universiteit van Amsterdam].
  • Keijsper, J. C. M. (1998). New techniques in network optimization. [Thesis, fully internal, Universiteit van Amsterdam].
Page 7 of 10