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