External Links

    Journal: Inf. Process. Lett.

    Volume 99, Issue 6

    215 -- 221André Große, Jörg Rothe, Gerd Wechsung. On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
    222 -- 226Stavros Tripakis. Folk theorems on the determinization and minimization of timed automata
    227 -- 229C. R. Subramanian. Analysis of a heuristic for acyclic edge colouring
    230 -- 233Adrian Kosowski, Michal Malafiejski, Pawel Zylinski. An approximation algorithm for maximum P::3::-packing in subcubic graphs
    234 -- 238Amin Coja-Oghlan, Lars Kuhtz. An improved algorithm for approximating the chromatic number of G::n, p::
    239 -- 245Felix A. Fischer, Markus Holzer, Stefan Katzenbeisser. The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
    246 -- 251Travis Gagie. Large alphabets and incompressibility

    Volume 99, Issue 5

    171 -- 174Yasuhiko Takenaga, Toby Walsh. Tetravex is NP-complete
    175 -- 180Alistair Moffat, Vo Ngoc Anh. Binary codes for locally homogeneous sequences
    181 -- 186Markus Kuba. On Quickselect, partial sorting and Multiple Quickselect
    187 -- 191Asaf Levin. Real time scheduling with a budget: Parametric-search is better than binary search
    192 -- 194Shisheng Li, Guangzhong Sun, Guoliang Chen. Improved algorithm for finding next-to-shortest paths
    195 -- 198Julián Mestre. On the multi-radius cover problem
    199 -- 202Philippe Janssen, Lhouari Nourine. Minimum implicational basis for meet-semidistributive lattices
    203 -- 207Yoshifumi Sakai. A linear space algorithm for computing a longest common increasing subsequence
    208 -- 214Raymond R. Devillers, Laurent Van Begin. Boundedness undecidability for synchronized nets

    Volume 99, Issue 4

    125 -- 129Minghui Jiang. A new approximation algorithm for labeling points with circle pairs
    130 -- 134Raphael Yuster. Finding and counting cliques and independent sets in r-uniform hypergraphs
    135 -- 138Chik-How Tan. Analysis of improved signcryption scheme with key privacy
    139 -- 144Guangjun Xu, Liying Kang, Erfang Shan. Acyclic domination on bipartite permutation graphs
    145 -- 148Boaz Tsaban. Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
    149 -- 153Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu. The communication complexity of the Hamming distance problem
    154 -- 157Marten van Dijk, Tom A. M. Kevenaar, Geert Jan Schrijen, Pim Tuyls. Improved constructions of secret sharing schemes by applying (lambda, omega)-decompositions
    158 -- 162Olivier Danvy, Henning Korsholm Rohde. On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
    163 -- 170Satoshi Ikeda, Koji Nakazawa. Strong normalization proofs by CPS-translations

    Volume 99, Issue 3

    83 -- 86Konstantinos Bletsas, Neil C. Audsley. Optimal priority assignment in the presence of blocking
    87 -- 91Adi Avidor, Ricky Rosen. A note on Unique Games
    92 -- 95Marcin Peczarski. An improvement of the tree code construction
    96 -- 101Seth Voorhies, Hyunyoung Lee, Andreas Klappenecker. Fair service for mice in the presence of elephants
    102 -- 105T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov. A new algorithm for online uniform-machine scheduling to minimize the makespan
    106 -- 110Shih-Chien Chou, Yuan-Chien Chen. Retrieving reusable components with variation points from software product lines
    111 -- 118Sándor Vágvölgyi. Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
    119 -- 123Stefan Hougardy, Doratha E. Drake Vinkemeier. Approximating weighted matchings in parallel

    Volume 99, Issue 2

    41 -- 46Angelika Hellwig, Lutz Volkmann. Lower bounds on the vertex-connectivity of digraphs and graphs
    47 -- 53Min Chen, Weifan Wang. The 2-dipath chromatic number of Halin graphs
    54 -- 58Amitabha Bagchi, Ankur Bhargava, Torsten Suel. Approximate maximum weight branchings
    59 -- 63Kathie Cameron, Chính T. Hoàng. On the structure of certain intersection graphs
    64 -- 67Chung-Ming Lin, Yin-Te Tsai, Chuan Yi Tang. Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
    68 -- 71Mickaël Montassier. A note on the not 3-choosability of some families of planar graphs
    72 -- 81Olga Xirotiri. Simulation of simultaneous safe recursion over an arbitrary structure

    Volume 99, Issue 1

    1 -- 6Huaming Zhang, Xin He. On simultaneous straight-line grid embedding of a planar graph and its dual
    7 -- 12Robert E. Jamison, Gretchen L. Matthews, John Villalpando. Acyclic colorings of products of trees
    13 -- 18Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter. Complexity aspects of generalized Helly hypergraphs
    19 -- 26Yangjun Chen. On the cost of searching signature trees
    27 -- 32Christian Choffrut, Serge Grigorieff. Separability of rational relations in A* × N:::::::m::::::: by recognizable relations is decidable
    33 -- 39Anca Muscholl, Mathias Samuelides, Luc Segoufin. Complementing deterministic tree-walking automata
    runs on