4 | -- | 5 | Horst W. Hamacher, Matthias Ehrgott. Special section: Using discrete mathematics to model multileaf collimators in radiation therapy |
6 | -- | 34 | Davaatseren Baatar, Horst W. Hamacher, Matthias Ehrgott, Gerhard J. Woeginger. Decomposition of integer matrices and multileaf collimator sequencing |
35 | -- | 51 | Konrad Engel. A new algorithm for optimal multileaf collimator field segmentation |
52 | -- | 88 | Thomas Kalinowski. A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint |
89 | -- | 108 | Eduardo A. Canale, José Gómez. Asymptotically large (::::Delta::::, ::::D::::)-graphs |
109 | -- | 122 | Katarína Cechlárová, David Manlove. The exchange-stable marriage problem |
123 | -- | 138 | Amir Daneshgar, Hossein Hajiabolhassan. Unique list-colourability and the fixing chromatic number of graphs |
139 | -- | 158 | David Gamarnik, Maxim Sviridenko. Hamiltonian completions of sparse random graphs |
159 | -- | 175 | Wei Ho. The ::::m::::-step, same-step, and any-step competition graphs |
176 | -- | 186 | Chính T. Hoàng, Mekkia Kouider. On the ::::b::::-dominating coloring of graphs |
187 | -- | 212 | Wen An Liu, Wei-Guo Zhang, Zan Kan Nie. Searching for two counterfeit coins with two-arms balance |
213 | -- | 228 | Meinard Müller, Tomoko Adachi, Masakazu Jimbo. Cluttered orderings for the complete bipartite graph |
229 | -- | 245 | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover |
246 | -- | 256 | Anders Sune Pedersen, Preben D. Vestergaard. The number of independent sets in unicyclic graphs |
257 | -- | 265 | Pranava K. Jha, Sandi Klavzar, Aleksander Vesel. Optimal ::::L::::(::::d::::, 1)-labelings of certain direct products of cycles and Cartesian products of cycles |
266 | -- | 272 | Mahnhoon Lee, Sridhar Radhakrishnan. Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph |