@article{Connie-Teoh-Goh-Ngo/05,
AUTHOR = {Connie, Tee and Teoh, Andrew and Goh, Michael and Ngo, David},
TITLE = {PalmHashing: A novel approach for cancelable biometrics},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {1},
PAGES = {1-5},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {safety/security in digital systems, biohashing, cancelable biometrics},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.014},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fukagawa-Akutsu/05,
AUTHOR = {Fukagawa, Daiji and Akutsu, Tatsuya},
TITLE = {Performance analysis of a greedy algorithm for inferring Boolean functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {1},
PAGES = {7-12},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, unbalanced function, uniform distribution, machine learning},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.017},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kaplan-Shafrir/05,
AUTHOR = {Kaplan, Haim and Shafrir, Nira},
TITLE = {The greedy algorithm for shortest superstrings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {1},
PAGES = {13-17},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, analysis of algorithms, approximation algorithms, shortest superstring},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.012},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou-Xu-Chen/05,
AUTHOR = {Zhou, Fengfeng and Xu, Yinlong and Chen, Guoliang},
TITLE = {No-wait scheduling in single-hop multi-channel LANs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {1},
PAGES = {19-24},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {lan, no-wait, makespan, approximation ratio, scheduling},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.013},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Quisquater-Preneel-Vandewalle/05,
AUTHOR = {Quisquater, Micha{\"e}l and Preneel, Bart and Vandewalle, Joos},
TITLE = {Spectral characterization of cryptographic Boolean functions satisfying the (extended) propagation criterion of degree $l$ and order $k$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {1},
PAGES = {25-28},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {boolean function, cryptography, propagation criterion},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.08.011},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zheng-Latifi-Regentova-Luo-Wu/05,
AUTHOR = {Zheng, Jun and Latifi, Shahram and Regentova, Emma and Luo, Kai and Wu, Xiaolong},
TITLE = {Diagnosability of star graphs under the comparison diagnosis model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {1},
PAGES = {29-36},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {diagnosability, comparison diagnosis model, star graph, interconnection networks},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.011},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou-Jones/05,
AUTHOR = {Zhou, Sheng and Jones, Christopher B.},
TITLE = {HCPO: An efficient insertion order for incremental Delaunay triangulation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {1},
PAGES = {37-42},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, incremental delaunay triangulation, insertion order},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.020},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han-Lee/05,
AUTHOR = {Han, Daewan and Lee, Moonsik},
TITLE = {An algebraic attack on the improved summation generator with 2-bit memory},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {1},
PAGES = {43-46},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, algebraic attack, improved summation generator},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.08.012},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duran_Diaz-Munoz_Masque/05,
AUTHOR = {Dur{\'a}n D{\'{i}}az, R. and Mu{\~n}oz Masqu{\'e}, J.},
TITLE = {Optimal strong primes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {1},
PAGES = {47-52},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {strong prime, computational complexity, public key cryptosystem, cryptography},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.015},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dourado-Protti-Szwarcfiter/05,
AUTHOR = {Dourado, Mitre C. and Protti, Fabio and Szwarcfiter, Jayme L.},
TITLE = {The Helly property on subfamilies of limited size},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {2},
PAGES = {53-56},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Noore-Cross/05,
AUTHOR = {Noore, A. and Cross, P.L.},
TITLE = {Modeling the reliability of large dynamic distributed non-homogeneous networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {2},
PAGES = {57-61},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jung/05a,
AUTHOR = {Jung, Haejae},
TITLE = {The d-deap*: A fast and simple cache-aligned d-ary deap},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {2},
PAGES = {63-67},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, double-ended priority queue},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Heber-Savage/05,
AUTHOR = {Heber, Steffen and Savage, Carla D.},
TITLE = {Common intervals of trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {2},
PAGES = {69-74},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.016},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{de_Figueiredo-de_Sa/05,
AUTHOR = {de Figueiredo, Celina M.H. and de S{\'a}, Vinicius G.P.},
TITLE = {Note on the homogeneous set sandwich problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {2},
PAGES = {75-81},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.022},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barequet-Elber/05,
AUTHOR = {Barequet, Gill and Elber, Gershon},
TITLE = {Optimal bounding cones of vectors in three dimensions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {2},
PAGES = {83-89},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.019},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wong-Wu-Gibbons-Faloutsos/05,
AUTHOR = {Wong, Angeline and Wu, Leejay and Gibbons, Phillip B. and Faloutsos, Christos},
TITLE = {Fast estimation of fractal dimension and correlation integral on stream data},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {2},
PAGES = {91-97},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.018},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pan-Chang/05,
AUTHOR = {Pan, Jun-Jie and Chang, Gerard J.},
TITLE = {Isometric-path numbers of block graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {2},
PAGES = {99-102},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.021},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fujiyoshi/05,
AUTHOR = {Fujiyoshi, Akio},
TITLE = {Linearity and nondeletion on monadic context-free tree grammars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {3},
PAGES = {103-107},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, context-free tree grammar, tree adjoining grammar},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.008},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pelc-Peleg/05,
AUTHOR = {Pelc, Andrzej and Peleg, David},
TITLE = {Broadcasting with locally bounded Byzantine faults},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {3},
PAGES = {109-115},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.007},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fernandez/05,
AUTHOR = {Fern{\'a}ndez, Mirtha-Lina},
TITLE = {Relaxing monotonicity for innermost termination},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {3},
PAGES = {117-123},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.005},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sunil_Chandran-Grandoni/05,
AUTHOR = {Sunil Chandran, L. and Grandoni, Fabrizio},
TITLE = {Refined memorization for vertex cover},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {3},
PAGES = {125-131},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fan-Lin-Jia/05,
AUTHOR = {Fan, Jianxi and Lin, Xiaola and Jia, Xiaohua},
TITLE = {Node-pancyclicity and edge-pancyclicity of crossed cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {3},
PAGES = {133-138},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.026},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Seppanen/05,
AUTHOR = {Sepp{\"a}nen, Jouni K.},
TITLE = {Upper bound for the approximation ratio of a class of hypercube segmentation algorithms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {3},
PAGES = {139-141},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, combinatorial problems, clustering, data mining},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Seal-Komarina-Aluru/05,
AUTHOR = {Seal, Sudip and Komarina, Srikanth and Aluru, Srinivas},
TITLE = {An optimal hierarchical clustering algorithm for gene expression data},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {3},
PAGES = {143-147},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Staiger/05,
AUTHOR = {Staiger, Ludwig},
TITLE = {Constructive dimension equals Kolmogorov complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {3},
PAGES = {149-153},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.023},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fernandez/05a,
AUTHOR = {Fern{\'a}ndez, Mirtha-Lina},
TITLE = {On proving $C_\varepsilon$-termination of rewriting by size-change termination},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {4},
PAGES = {155-162},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {program correctness, term rewriting, termination},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Thomasian/05,
AUTHOR = {Thomasian, Alexander},
TITLE = {Reconstruct versus read-modify writes in RAID},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {4},
PAGES = {163-168},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.009},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lingas-Wahlen/05,
AUTHOR = {Lingas, Andrzej and Wahlen, Martin},
TITLE = {A note on maximum independent set and related problems on box graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {4},
PAGES = {169-171},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.013},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jiang/05,
AUTHOR = {Jiang, Minghui},
TITLE = {UPS-$k$: A set partitioning problem with applications in UPS pickup-delivery system},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {4},
PAGES = {173-175},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {$NP$-complete, approximation algorithms, set partitioning, strip packing, ups scheduling},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.010},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Her-Ramakrishna/05,
AUTHOR = {Her, Jun-Ho and Ramakrishna, R.S.},
TITLE = {External-memory depth-first search algorithm for solid grid graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {4},
PAGES = {177-183},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.025},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Segerlind/05,
AUTHOR = {Segerlind, Nathan},
TITLE = {Exponential separation between Res$(k)$ and Res$(k+1)$ for $k\leq \varepsilon \log n$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {4},
PAGES = {185-190},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.09.024},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Poovendran-McGrew/05,
AUTHOR = {Li, Mingyan and Poovendran, Radha and McGrew, David A.},
TITLE = {Minimizing center key storage in hybrid one-way function based group key management with communication constraints},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {4},
PAGES = {191-198},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, key management/distribution, group rekey, secure multicast/broadcast, optimization, one-way function},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.012},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cimato-de_Santis-Ferrara-Masucci/05,
AUTHOR = {Cimato, Stelvio and de Santis, Alfredo and Ferrara, Anna Lisa and Masucci, Barbara},
TITLE = {Ideal contrast visual cryptography schemes with reversing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {4},
PAGES = {199-206},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.011},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kulkarni-Bolen-Oleszkiewicz-Robinson/05,
AUTHOR = {Kulkarni, Sandeep S. and Bolen, Chase and Oleszkiewicz, John and Robinson, Andrew},
TITLE = {Alternators in read/write atomicity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {5},
PAGES = {207-215},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.009},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mousavi-Reniers-Groote/05a,
AUTHOR = {Mousavi, MohammadReza and Reniers, Michel and Groote, Jan Friso},
TITLE = {A syntactic commutativity format for SOS},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {5},
PAGES = {217-223},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.007},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Leprevost-Monnerat-Varrette-Vaudenay/05,
AUTHOR = {Lepr{\'e}vost, Franck and Monnerat, Jean and Varrette, Sebastien and Vaudenay, Serge},
TITLE = {Generating anomalous elliptic curves},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {5},
PAGES = {225-230},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.008},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nagamochi/05,
AUTHOR = {Nagamochi, Hiroshi},
TITLE = {On computing minimum $(s,t)$-cuts in digraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {5},
PAGES = {231-237},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, edge connectivity, minimum cuts, maximum flows, sparsification, digraphs},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chataigner/05,
AUTHOR = {Chataigner, Fr{\'e}d{\'e}ric},
TITLE = {Approximating the maximum agreement forest on $k$ trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {5},
PAGES = {239-244},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, approximation algorithms},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Xu-Hou/05,
AUTHOR = {Xu, Min and Xu, Jun-Ming and Hou, Xin-Min},
TITLE = {Fault diameter of Cartesian product graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {5},
PAGES = {245-248},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.005},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yang-Huang-Chao/05,
AUTHOR = {Yang, I-Hsuan and Huang, Chien-Pin and Chao, Kun-Mao},
TITLE = {A fast algorithm for computing a longest common increasing subsequence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {5},
PAGES = {249-253},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.014},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shi-Liang-Lee-Lu-Wang/05,
AUTHOR = {Shi, X.H. and Liang, Y.C. and Lee, H.P. and Lu, C. and Wang, L.M.},
TITLE = {An improved GA and a novel PSO-GA-based hybrid algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {5},
PAGES = {255-261},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nielsen-Nock/05,
AUTHOR = {Nielsen, Frank and Nock, Richard},
TITLE = {A fast deterministic smallest enclosing disk approximation algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {6},
PAGES = {263-268},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.12.006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kato-Watanabe/05,
AUTHOR = {Kato, Ryoichi and Watanabe, Osamu},
TITLE = {Substring search and repeat search using factor oracles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {6},
PAGES = {269-274},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.011},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kim/05,
AUTHOR = {Kim, Sung Kwon},
TITLE = {Finding a longest nonnegative path in a constant degree tree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {6},
PAGES = {275-279},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.012},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Leino/05,
AUTHOR = {Leino, K. Rustan M.},
TITLE = {Efficient weakest preconditions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {6},
PAGES = {281-288},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
KEYWORDS = {program correctness, formal semantics, automatic theorem proving},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.10.015},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Froschle/05,
AUTHOR = {Fr{\"o}schle, S.B.},
TITLE = {The decidability border of hereditary history preserving bisimilarity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {6},
PAGES = {289-293},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.11.010},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fabila_Monroy-Urrutia/05,
AUTHOR = {Fabila Monroy, Ruy and Urrutia, J.},
TITLE = {Graham triangulations and triangulations with a center are Hamiltonian},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {6},
PAGES = {295-299},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.12.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kano-Merino-Urrutia/05,
AUTHOR = {Kano, M. and Merino, C. and Urrutia, J.},
TITLE = {On plane spanning trees and cycles of multicolored point sets with few intersections},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {6},
PAGES = {301-306},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.12.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Garcia-Seme/05,
AUTHOR = {Garcia, Thierry and Sem{\'e}, David},
TITLE = {A coarse-grained multicomputer algorithm for the detection of repetitions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {93},
NUMBER = {6},
PAGES = {307-313},
YEAR = {2005},
EDITOR = {Tarlecki, A.},
URL = {http://dx.doi.org/10.1016/j.ipl.2004.12.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}