Volume 381,
Numbers 1-3,
August 2007
Fundamental study
Contributions
- Feng Wang, David Hongwei Du, Xiaohua Jia, Ping Deng, Weili Wu, David MacCallum:
Non-unique probe selection and group testing.
29-32
- Helmut Jürgensen, Ludwig Staiger, Hideki Yamasaki:
Finite automata encoding geometric figures.
33-43
- Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
The increase of the instability of networks due to Quasi-Static link capacities.
44-56
- Celina M. Herrera de Figueiredo, Luerbio Faria, Sulamita Klein, R. Sritharan:
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs.
57-67
- Domingo Gómez, Jaime Gutierrez, Álvar Ibeas:
Optimal routing in double loop networks.
68-85
- Frédérique Bassino, Cyril Nicaud:
Enumeration and random generation of accessible automata.
86-104
- David Doty, Jared Nichols:
Pushdown dimension.
105-123
- Mingxia Chen, Jianbo Li, Jianping Li, Weidong Li, Lusheng Wang:
Some approximation algorithms for the clique partition problem in weighted interval graphs.
124-133
- Amirhossein Amiraslani, D. A. Aruliah, Robert M. Corless:
Block LU factors of generalized companion matrix pencils.
134-147
- Ker-I Ko, Fuxiang Yu:
Jordan curves with polynomial inverse moduli of continuity.
148-161
- Tamás Fleiner, Robert W. Irving, David Manlove:
Efficient algorithms for generalized Stable Marriage and Roommates problems.
162-176
- Dalia Krieger, Jeffrey Shallit:
Every real number greater than 1 is a critical exponent.
177-182
- Michal Parnas, Dana Ron:
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms.
183-196
- Carme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, Maria J. Serna:
Communication tree problems.
197-217
- Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu:
On the spanning connectivity and spanning laceability of hypercube-like networks.
218-229
- Jianliang Wu, Jianfeng Hou, Guizhen Liu:
The linear arboricity of planar graphs with no short cycles.
230-233
- Cheng He, Yixun Lin, Jinjiang Yuan:
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan.
234-240
- Weiping Shang, Peng-Jun Wan, F. Frances Yao, Xiaodong Hu:
Algorithms for minimum m-connected k-tuple dominating set problem.
241-247
- Katerina Asdre, Stavros D. Nikolopoulos:
NP-completeness results for some problems on subclasses of bipartite and chordal graphs.
248-259
Notes
Copyright © Mon Nov 2 21:56:28 2009
by Michael Ley (ley@uni-trier.de)
