External Links

    Journal: Inf. Process. Lett.

    Volume 103, Issue 6

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

    Volume 103, Issue 5

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

    Volume 103, Issue 4

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

    Volume 103, Issue 3

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

    Volume 103, Issue 2

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

    Volume 103, Issue 1

    1 -- 4Robert W. Irving. The cycle roommates problem: a hard case of kidney exchange
    5 -- 13Marc Aiguier, Razvan Diaconescu. Stratified institutions and elementary homomorphisms
    14 -- 18Hai-Lung Cheng, Biing-Feng Wang. On Chen and Chen s new tree inclusion algorithm
    19 -- 23Seok Woo Kim, Seong-Hun Paeng, Hee Je Cho. Approximately n-secting an angle
    24 -- 27Hasan Akin, Irfan Siap. On cellular automata over Galois rings
    28 -- 33Jukka Suomela. Approximability of identifying codes and locating-dominating codes
    34 -- 39Nikolai K. Vereshchagin. Kolmogorov complexity of enumerating finite sets
    40 -- 43Min Chih Lin, Jayme Luiz Szwarcfiter. Faster recognition of clique-Helly and hereditary clique-Helly graphs
    44 -- 0Justin 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]
    runs on