Journal: Inf. Process. Lett.

Volume 97, Issue 6

213 -- 218Stéphanie Delaune. Easy intruder deduction problems with homomorphisms
219 -- 224Bo Gyeong Kang, Je Hong Park. On the relationship between squared pairings and plain pairings
225 -- 230Nicolas Markey, Ph. Schnoebelen. Mu-calculus path checking
231 -- 237Mirela Damian, Sriram V. Pemmaraju. APX-hardness of domination problems in circle graphs
238 -- 243Jeng Farn Lee, Meng Chang Chen, Ming-Tat Ko, Wanjiun Liao. Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
244 -- 250Dungjade Shiowattana, Satyanarayana V. Lokam. An optimal lower bound for 2-query locally decodable linear codes

Volume 97, Issue 5

171 -- 176Yves F. Verhoeven. Enhanced algorithms for Local Search
177 -- 180Adam Kasperski, Pawel Zielinski. An approximation algorithm for interval data minmax regret combinatorial optimization problems
181 -- 185Pavlos Efraimidis, Paul G. Spirakis. Weighted random sampling with a reservoir
186 -- 190Morteza Fayyazi, David R. Kaeli, Waleed Meleis. An adjustable linear time parallel algorithm for maximum weight bipartite matching
191 -- 196Fedor V. Fomin, Kjartan Høie. Pathwidth of cubic graphs and exact algorithms
197 -- 202Ewa Misiolek, Danny Z. Chen. Two flow network simplification algorithms
203 -- 207Kang Li, Lusheng Wang. A polynomial time approximation scheme for embedding a directed hypergraph on a ring
208 -- 211Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita. Quantum lower bounds for the Goldreich-Levin problem

Volume 97, Issue 4

129 -- 132Pak Ching Li, Michel Toulouse. Variations of the maximum leaf spanning tree problem for bipartite graphs
138 -- 145Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu. Robustness of ::::k::::-gon Voronoi diagram construction
146 -- 152Zheng Sun, Tian-Ming Bu. On discretization methods for approximating optimal paths in regions with direction-dependent costs
153 -- 155Hossein Ghodosi, Rahim Zaare-Nahandi. Comments on the ::::m:::: out of ::::n:::: oblivious transfer
156 -- 160Mohammad Taghi Hajiaghayi, Harald Räcke. An O(sqrt(n))-approximation algorithm for directed sparsest cut
161 -- 169Neal Lesh, Michael Mitzenmacher. BubbleSearch: A simple heuristic for improving priority-based greedy algorithms

Volume 97, Issue 3

83 -- 87Sangwon Kim, Joonwon Lee, Jinsoo Kim. Runtime feasibility check for non-preemptive real-time periodic tasks
88 -- 93Xiaofan Yang, Jianqiu Cao, Graham M. Megson, Jun Luo. Minimum neighborhood in a generalized cube
94 -- 97Jun Ming Xu, Meijie Ma, Min Lü. Paths in Möbius cubes and crossed cubes
98 -- 103Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos. Weighted Coloring: further complexity and approximability results
104 -- 108Srecko Brlek, Sardaouna Hamadou, John Mullins. A flaw in the electronic commerce protocol SET
109 -- 114Jiong Guo, Rolf Niedermeier. A fixed-parameter tractability result for multicommodity demand flow in trees
115 -- 117Wenjun Xiao, Behrooz Parhami. Cayley graphs as models of deterministic small-world networks
118 -- 123Jung Hee Cheon, Woo-Hwan Kim, Hyun Soo Nam. Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
124 -- 127Yuan Li, Thomas W. Cusick. Linear structures of symmetric functions over finite fields

Volume 97, Issue 2

41 -- 45Jacques Dubrois, Jean-Guillaume Dumas. Efficient polynomial time algorithms computing industrial-strength primitive roots
46 -- 51René Vestergaard. A constructive approach to sequential Nash equilibria
52 -- 57Mitsugu Iwamoto, Hirosuke Yamamoto. Strongly secure ramp secret sharing schemes for general access structures
58 -- 63Christel Baier, Nathalie Bertrand, Ph. Schnoebelen. A note on the attractor-property of infinite-state Markov chains
64 -- 67Wen-Hung Kuo, Dar-Li Yang. Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
68 -- 72Marek Chrobak, Claire Kenyon, Neal E. Young. The reverse greedy algorithm for the metric ::::k::::-median problem
73 -- 81Guohui Lin, Zhipeng Cai, Dekang Lin. Vertex covering by paths on trees with its applications in machine translation

Volume 97, Issue 1

1 -- 3Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. Fung, Chung Keung Poon, Yinfeng Xu. A tight lower bound for job scheduling with cancellation
4 -- 11Xiaotie Deng, Li-Sha Huang. On the complexity of market equilibria with maximum social welfare
12 -- 18Amos Beimel, Enav Weinreb. Monotone circuits for monotone weighted threshold functions
19 -- 22Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser. Transforming spanning trees and pseudo-triangulations
23 -- 27Haim Kaplan, Nira Shafrir. The greedy algorithm for edit distance with moves
28 -- 30Bolette Ammitzbøll Madsen. An algorithm for Exact Satisfiability analysed with the number of clauses as parameter
31 -- 35Uriel Feige, Daniel Reichman. On the hardness of approximating Max-Satisfy
36 -- 40Salvatore Caporaso. A decidable characterization of the classes between lintime and exptime