331 | -- | 349 | Jørgen Bang-Jensen, Anders Yeo. Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs |
351 | -- | 358 | Christian Elsholtz. Lower Bounds For Multidimensional Zero Sums |
359 | -- | 388 | Christian Houdré, Prasad Tetali. Isoperimetric Invariants For Product Markov Chains and Graph Products |
389 | -- | 401 | Alexandr V. Kostochka, Vojtech Rödl. On Graphs With Small Ramsey Numbers, II |
403 | -- | 426 | Michael Krivelevich, Benny Sudakov, Tibor Szabó. Triangle Factors In Sparse Pseudo-Random Graphs |
427 | -- | 440 | Bodo Lass. Matching Polynomials And Duality |
441 | -- | 458 | Wolfgang Mader. High Connectivity Keeping Sets In ::::n::::-Connected Graphs |
459 | -- | 486 | Klaus Metsch. Blocking Subspaces By Lines In PG(n, q) |
487 | -- | 501 | Patrice Ossona de Mendez, Pierre Rosenstiehl. Transitivity And Connectivity Of Permutations |
503 | -- | 524 | Toniann Pitassi, Ran Raz. Regular Resolution Lower Bounds For The Weak Pigeonhole Principle |
525 | -- | 530 | Michael E. Saks, Alex Samorodnitsky, Leonid Zosin. A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks |
531 | -- | 540 | Lutz Volkmann. The Maximum Size Of Graphs With A Unique ::::k::::- Factor |