| 211 | -- | 232 | Lali Barrière. Symmetry properties of chordal rings of degree 3 |
| 233 | -- | 262 | András A. Benczúr. Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems |
| 263 | -- | 283 | Martina Bosíková. Minimum 3-geodetically connected graphs |
| 285 | -- | 303 | Andreas Brandstädt, Feodor F. Dragan. On linear and circular structure of (claw, net)-free graphs |
| 305 | -- | 318 | Peter Dankelmann, Ortrud Oellermann. Bounds on the average connectivity of a graph |
| 319 | -- | 328 | Italo J. Dejter, Oriol Serra. Efficient dominating sets in Cayley graphs |
| 329 | -- | 343 | Guoli Ding, Peter P. Chen. Generating r-regular graphs |
| 345 | -- | 359 | Fedor V. Fomin, Petr A. Golovach. Interval degree and bandwidth of a graph |
| 361 | -- | 369 | Krzysztof Giaro, Robert Janczewski, Michal Malafiejski. The complexity of the T-coloring problem for graphs with small degree |
| 371 | -- | 382 | Krzysztof Giaro, Robert Janczewski, Michal Malafiejski. A polynomial algorithm for finding T-span of generalized cacti |
| 383 | -- | 397 | Xiaofeng Guo, Fuji Zhang. Planar k-cycle resonant graphs with k=1, 2 |
| 399 | -- | 407 | Harri Haanpää, Patric R. J. Östergård. Classification of whist tournaments with up to 12 players |
| 409 | -- | 419 | Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn. Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori |
| 421 | -- | 431 | Hua-Min Huang, Frank K. Hwang, Jian-Feng Ma. Using transforming matrices to generate DNA clone grids |
| 433 | -- | 447 | Yoshiyuki Karuno, Hiroshi Nagamochi. 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times |
| 449 | -- | 460 | Sandi Klavzar, Aleksander Vesel. Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers |
| 461 | -- | 473 | Stavros G. Kolliopoulos. Approximating covering integer programs with multiplicity constraints |
| 475 | -- | 486 | Hiroshi Nagamochi, Toshimasa Ishii. On the minimum local-vertex-connectivity augmentation in graphs |
| 487 | -- | 498 | M. Nakamura. Excluded-minor characterizations of antimatroids arisen from posets and graph searches |
| 499 | -- | 511 | Eunseuk Oh, Jianer Chen. On strong Menger-connectivity of star graphs |
| 513 | -- | 520 | Gregory Gutin, Alek Vainshtein, Anders Yeo. Domination analysis of combinatorial optimization problems |
| 521 | -- | 532 | Andreas Brandstädt, Raffaele Mosca. On variations of P::4::-sparse graphs |
| 533 | -- | 538 | Gregory Gutin, Anders Yeo. Upper bounds on ATSP neighborhood size |
| 539 | -- | 544 | Romeo Rizzi. A simple minimum T-cut algorithm |
| 545 | -- | 548 | John C. Wierman. Pairs of graphs with site and bond percolation critical probabilities in opposite orders |