Information Processing Letters, Volume 103

Volume 103, Number 1, June 2007

Robert W. Irving:
The cycle roommates problem: a hard case of kidney exchange. 1-4
Electronic Edition (link) BibTeX
Marc Aiguier, Razvan Diaconescu:
Stratified institutions and elementary homomorphisms. 5-13
Electronic Edition (link) BibTeX
Hai-Lung Cheng, Biing-Feng Wang:
On Chen and Chen's new tree inclusion algorithm. 14-18
Electronic Edition (link) BibTeX
Seok Woo Kim, Seong-Hun Paeng, Hee Je Cho:
Approximately n-secting an angle. 19-23
Electronic Edition (link) BibTeX
Hasan Akin, Irfan Siap:
On cellular automata over Galois rings. 24-27
Electronic Edition (link) BibTeX
Jukka Suomela:
Approximability of identifying codes and locating-dominating codes. 28-33
Electronic Edition (link) BibTeX
Nikolai K. Vereshchagin:
Kolmogorov complexity of enumerating finite sets. 34-39
Electronic Edition (link) BibTeX
Min Chih Lin, Jayme Luiz Szwarcfiter:
Faster recognition of clique-Helly and hereditary clique-Helly graphs. 40-43
Electronic Edition (link) BibTeX
Justin Colannino, Godfried T. Toussaint:
Corrigendum to "An algorithm for computing the restriction Scaffold assignment problem in computational biology" [Inform Process Lett 95 (4) (2005) 466-471]. 44
Electronic Edition (link) BibTeX

Wei-Wei Wang, Meijie Ma, Jun-Ming Xu:
Fault-tolerant pancyclicity of augmented cubes. 52-56
Electronic Edition (link) BibTeX
Kofi A. Laing:
Name-independent compact routing in trees. 57-60
Electronic Edition (link) BibTeX
Nina Amenta, Matthew Godwin, Nicolay Postarnakevich, Katherine St. John:
Approximating geodesic tree distance. 61-65
Electronic Edition (link) BibTeX
Mikhail Ju. Moshkov:
On algorithms for construction of all irreducible partial covers. 66-70
Electronic Edition (link) BibTeX
Ryuhei Uehara, Gabriel Valiente:
Linear structure of bipartite permutation graphs and the longest path problem. 71-77
Electronic Edition (link) BibTeX
Wen An Liu, Kun Meng, Shu Min Xing:
Q-ary search with one lie and bi-interval queries. 78-81
Electronic Edition (link) BibTeX
Brendan Lucier, Tao Jiang, Ming Li:
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility. 45-51
Electronic Edition (link) BibTeX

Igor Shparlinski:
Bounds on the Fourier coefficients of the weighted sum function. 83-87
Electronic Edition (link) BibTeX
Volker Turau:
Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. 88-93
Electronic Edition (link) BibTeX
Anuj Dawar, David Janin:
The monadic theory of finite representations of infinite words. 94-101
Electronic Edition (link) BibTeX
Aduri Pavan, Fengming Wang:
Robustness of PSPACE-complete sets. 102-104
Electronic Edition (link) BibTeX
Christoph Minnameier:
Local and global deadlock-detection in component-based systems are NP-hard. 105-111
Electronic Edition (link) BibTeX
Florin Manea, Victor Mitrana:
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size. 112-118
Electronic Edition (link) BibTeX
Joseph Y.-T. Leung, Haibing Li, Michael Pinedo, Jiawei Zhang:
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines. 119-129
Electronic Edition (link) BibTeX

Philip M. Long, Rocco A. Servedio, Hans-Ulrich Simon:
Discriminative learning can succeed where generative learning fails. 131-135
Electronic Edition (link) BibTeX
Georg Gottlob, Stephanie Tien Lee:
A logical approach to multicut problems. 136-141
Electronic Edition (link) BibTeX
Amihood Amir, Leszek Gasieniec, B. Riva Shalom:
Improved approximate common interval. 142-149
Electronic Edition (link) BibTeX
Xiaofang Luo, Min Chen, Weifan Wang:
On 3-colorable planar graphs without cycles of four lengths. 150-156
Electronic Edition (link) BibTeX
David Ruiz, Rafael Corchuelo, José Luis Arjona:
Generating non-conspiratorial executions. 157-162
Electronic Edition (link) BibTeX
Matthias Hagen:
On the fixed-parameter tractability of the equivalence test of monotone normal forms. 163-167
Electronic Edition (link) BibTeX

X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, Q. X. Wang:
Particle swarm optimization-based algorithms for TSP and generalized TSP. 169-176
Electronic Edition (link) BibTeX
Louise Leenen, Thomas Andreas Meyer, Aditya Ghose:
Relaxations of semiring constraint satisfaction problems. 177-182
Electronic Edition (link) BibTeX
Adam Janiak, Radoslaw Rudek:
The learning effect: Getting to the core of the problem. 183-187
Electronic Edition (link) BibTeX
Flemming Nielson, Hanne Riis Nielson, Henrik Pilegaard:
What is a free name in a process algebra? 188-194
Electronic Edition (link) BibTeX
Paulo Feofiloff, Cristina G. Fernandes, Carlos Eduardo Ferreira, José Coelho de Pina:
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem. 195-202
Electronic Edition (link) BibTeX
Barbara König, Vitali Kozioura:
Incremental construction of coverability graphs. 203-209
Electronic Edition (link) BibTeX

Igor Shparlinski, Arne Winterhof:
Quantum period reconstruction of approximate sequences. 211-215
Electronic Edition (link) BibTeX
Shin-ichi Nakayama, Shigeru Masuyama:
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs. 216-221
Electronic Edition (link) BibTeX
Jun-Ming Xu, Qiang Zhu, Min Xu:
Fault-tolerant analysis of a class of networks. 222-226
Electronic Edition (link) BibTeX
Petri Kontkanen, Petri Myllymäki:
A linear-time algorithm for computing the multinomial stochastic complexity. 227-233
Electronic Edition (link) BibTeX
Lutz Volkmann:
Restricted arc-connectivity of digraphs. 234-239
Electronic Edition (link) BibTeX
Yun Sheng Chung, Chin Lung Lu, Chuan Yi Tang:
Efficient algorithms for regular expression constrained sequence alignment. 240-246
Electronic Edition (link) BibTeX
Areej Zuhily, Alan Burns:
Optimal (D-J)-monotonic priority assignment. 247-250
Electronic Edition (link) BibTeX