1 | -- | 13 | Néstor E. Aguilera, Mariana S. Escalante, Graciela L. Nasini. The disjunctive procedure and blocker duality |
15 | -- | 26 | Yuichi Asahiro, Refael Hassin, Kazuo Iwama. Complexity of finding dense subgraphs |
27 | -- | 49 | Immanuel M. Bomze, Marco Budinich, Marcello Pelillo, Claudio Rossi. Annealed replication: a new heuristic for the maximum clique problem |
51 | -- | 60 | Alewyn P. Burger, Christina M. Mynhardt. An upper bound for the minimum number of queens covering the n x n chessboard |
61 | -- | 72 | Robin Chi-Feng Chan, Chiuyuan Chen, Zhi-Xin Hong. A simple algorithm to find the steps of double-loop networks |
73 | -- | 82 | Celina M. Herrera de Figueiredo, Sulamita Klein, Kristina Vuskovic. The graph sandwich problem for 1-join composition is NP-complete |
83 | -- | 101 | Isabelle Fagnot, Laurent Vuillon. Generalized balances in Sturmian words |
103 | -- | 118 | Jean-Claude Falmagne, Sergei Ovchinnikov. Media theory |
119 | -- | 128 | Sylvain Gravier. Total domination number of grid graphs |
129 | -- | 138 | Gregory Gutin, Anders Yeo. Orientations of digraphs almost preserving diameter |
139 | -- | 153 | Ryan B. Hayward, Paul E. Kearney, Andrew J. Malton. NeST graphs |
155 | -- | 180 | Harald Hempel, Dieter Kratsch. On claw-free asteroidal triple-free graphs |
181 | -- | 192 | Jing Huang, Gary MacGillivray, Anders Yeo. Pushing vertices in digraphs without long induced cycles |
193 | -- | 202 | Wataru Kishimoto, Koji Okada, Kaoru Kurosawa, Wakaha Ogata. On the bound for anonymous secret sharing schemes |
203 | -- | 213 | Tero Laihonen, Sanna M. Ranto. Families of optimal codes for strong identification |
215 | -- | 227 | Stephan Olariu, Maria Cristina Pinotti, Larry Wilson. Greedy algorithms for tracking mobile users in special mobility graphs |
229 | -- | 245 | Jürgen Rietz, Guntram Scheithauer, Johannes Terno. Families of non-IRUP instances of the one-dimensional cutting stoc problem |
247 | -- | 260 | Andrew Vince. A framework for the greedy algorithm |
261 | -- | 277 | Tongnyoul Yi, Katta G. Murty, Cosimo Spera. Matchings in colored bipartite networks |
279 | -- | 294 | Jianxing Yin. A survey on maximum distance holey packings |
295 | -- | 306 | Fuji Zhang, Zhibo Chen. Ordering graphs with small index and its application |
307 | -- | 315 | Malwina J. Luczak, Steven D. Noble. Optimal arrangement of data in a tree directory |