@article{Krivelevich/02,
AUTHOR = {Krivelevich, Michael},
TITLE = {Deciding $k$-colorability in expected polynomial time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {1},
PAGES = {1-6},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lozin/02,
AUTHOR = {Lozin, V.V.},
TITLE = {On maximum induced matchings in bipartite graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {1},
PAGES = {7-11},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chung-Yan/02,
AUTHOR = {Chung, Kuo-Liang and Yan, Wen-Ming},
TITLE = {Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {1},
PAGES = {13-21},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Shi/02a,
AUTHOR = {Shi, Yaoyun},
TITLE = {Entropy lower bounds for quantum decision tree complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {1},
PAGES = {23-27},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Skurczynski/02,
AUTHOR = {Skurczy{\'n}ski, Jerzy},
TITLE = {A characterization of B{\"u}chi tree automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {1},
PAGES = {29-33},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Carpi-Luca/02,
AUTHOR = {Carpi, Arturo and Luca, Aldo de},
TITLE = {A combinatorial property of the factor poset of a word},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {1},
PAGES = {35-39},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hsu-Wu-Wu/02,
AUTHOR = {Hsu, Chien-Lung and Wu, Tzong-Sun and Wu, Tzong-Chen},
TITLE = {Improvements of generalization of threshold signature and authenticated encryption for group communications},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {1},
PAGES = {41-45},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Spriggs-Keil/02,
AUTHOR = {Spriggs, Michael J. and Keil, J. Mark},
TITLE = {A new bound for map labeling with uniform circle pairs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {1},
PAGES = {47-53},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bretto-Ubeda-Zerovnik/02,
AUTHOR = {Bretto, Alain and Ub{\'{e}}da, St{\'{e}}phane and {\v{Z}}erovnik, Janez},
TITLE = {A polynomial algorithm for the strong Helly property},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {1},
PAGES = {55-57},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Branke-Leppert-Middendorf-Eades/02,
AUTHOR = {Branke, J{\"u}rgen and Leppert, Stefan and Middendorf, Martin and Eades, Peter},
TITLE = {Width-restricted layering of acyclic digraphs with consideraton of dummy nodes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {2},
PAGES = {59-63},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Koiran/02,
AUTHOR = {Koiran, Pascal},
TITLE = {Transfer theorems via sign conditions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {2},
PAGES = {65-69},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Noga-Seiden-Woeginger/02,
AUTHOR = {Noga, John and Seiden, Steve and Woeginger, Gerhard J.},
TITLE = {A faster off-line algorithm for the TCP acknowledgement problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {2},
PAGES = {71-73},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Petersen/02,
AUTHOR = {Petersen, Holger},
TITLE = {Bounds for the element distinctness problem on one-tape Turing machines},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {2},
PAGES = {75-79},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bachman-Janiak-Kovalyov/02,
AUTHOR = {Bachman, Aleksander and Janiak, Adam and Kovalyov, Mikhail Y.},
TITLE = {Minimizing the total weighted completion time of deteriorating jobs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {2},
PAGES = {81-84},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kobayashi-Tsuchiya-Kikuno/02,
AUTHOR = {Kobayashi, Noritaka and Tsuchiya, Tatsuhiro and Kikuno, Tohru},
TITLE = {A new method for constructing pair-wise covering designs for software testing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {2},
PAGES = {85-91},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bulterman-Sommen-Zwaan-Verhoeff-Gasteren-Feijen/02,
AUTHOR = {Bulterman, R.W. and Sommen, F.W. van der and Zwaan, G. and Verhoeff, T. and Gasteren, A.J.M. van and Feijen, W.H.J.},
TITLE = {On computing a longest path in a tree --- Eindhoven Tuesday Afternoon Club},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {2},
PAGES = {93-96},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chung-Kim/02,
AUTHOR = {Chung, Tae-Sun and Kim, Hyoung-Joo},
TITLE = {Extracting indexing information from XML DTDs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {2},
PAGES = {97-103},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lai-Eades/02,
AUTHOR = {Lai, Wei and Eades, Peter},
TITLE = {Removing edge-node intersections in drawings of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {2},
PAGES = {105-110},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Goswami-Mall/02,
AUTHOR = {Goswami, D. and Mall, R.},
TITLE = {An efficient method for computing dynamic program slices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {2},
PAGES = {111-117},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Keller/02a,
AUTHOR = {Keller, J{\"o}rg},
TITLE = {A heuristic to accelerate in-situ permutation algorithms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {3},
PAGES = {119-125},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Jonsson-Johansson/02,
AUTHOR = {J{\"o}nsson, Fredrik and Johansson, Thomas},
TITLE = {A fast correlation attack on LILI-128},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {3},
PAGES = {127-132},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cheng-Fang/02,
AUTHOR = {Cheng, Qi and Fang, Fang},
TITLE = {Kolmogorov random graphs only have trivial stable colorings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {3},
PAGES = {133-136},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Gudmundsson-Husfeldt-Levcopoulos/02,
AUTHOR = {Gudmundsson, Joachim and Husfeldt, Thore and Levcopoulos, Christos},
TITLE = {Lower bounds for approximate polygon decomposition and minimum gap},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {3},
PAGES = {137-141},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kwon-Chwa/02,
AUTHOR = {Kwon, Oh-Heum and Chwa, Kyung-Yong},
TITLE = {Approximation algorithms for general parallel task scheduling},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {3},
PAGES = {143-150},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Wang-Li/02,
AUTHOR = {Wang, Lusheng and Li, Zimao},
TITLE = {An approximation algorithm for a bottleneck $k$-Steiner tree problem in the Euclidean plane},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {3},
PAGES = {151-156},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Le-Le/02,
AUTHOR = {Le, Ho{\`{a}}ng-Oanh and Le, Van Bang},
TITLE = {The $NP$-completeness of $(1,r)$-subcolorability of cubic graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {3},
PAGES = {157-162},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cesati/02,
AUTHOR = {Cesati, Marco},
TITLE = {Perfect code is $W[1]$-complete},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {3},
PAGES = {163-168},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lyon/02,
AUTHOR = {Lyon, Gordon},
TITLE = {Comparison of two code scalability tests},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {3},
PAGES = {169-174},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Buki-Szabo/02,
AUTHOR = {B{\"u}ki, Judit and Szab{\'{o}}, Csaba},
TITLE = {Complexity of homomorphisms to direct products of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {4},
PAGES = {175-178},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lee-Yi-Paek/02,
AUTHOR = {Lee, Oukseh and Yi, Kwangkeun and Paek, Yunheung},
TITLE = {A proof method for the correctness of modularized 0CFA},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {4},
PAGES = {179-185},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Araki-Shibata/02,
AUTHOR = {Araki, Toru and Shibata, Yukio},
TITLE = {Pancyclicity of recursive circulant graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {4},
PAGES = {187-190},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Skulrattanakulchai/02,
AUTHOR = {Skulrattanakulchai, San},
TITLE = {4-edge-coloring graphs of maximum degree 3 in linear time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {4},
PAGES = {191-195},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Martel/02,
AUTHOR = {Martel, Chip},
TITLE = {The expected complexity of Prim's minimum spanning tree algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {4},
PAGES = {197-201},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Gavril/02,
AUTHOR = {Gavril, Fanica},
TITLE = {Algorithms for maximum weight induced paths},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {4},
PAGES = {203-208},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Maity-Roy-Nayak/02,
AUTHOR = {Maity, Soumen and Roy, Bimal K. and Nayak, Amiya},
TITLE = {On enumeration of catastrophic fault patterns},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {4},
PAGES = {209-212},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Albers-Karpinski/02,
AUTHOR = {Albers, Susanne and Karpinski, Marek},
TITLE = {Randomized splay trees: Theoretical and experimental results},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {4},
PAGES = {213-221},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Garcia_Olaverri-Hurtado-Noy-Tejel/02,
AUTHOR = {Garc{\'{i}}a Olaverri, Alfredo and Hurtado, Ferran and Noy, Marc and Tejel, Javier},
TITLE = {On the minimum size of visibility graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {4},
PAGES = {223-230},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kobayashi-Sekiguchi/02,
AUTHOR = {Kobayashi, Zenji and Sekiguchi, Takeshi},
TITLE = {On a characterization of the standard Gray code by using its edge type on a hypercube},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {5},
PAGES = {231-237},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lee-Kim/02a,
AUTHOR = {Lee, Dong-Ho and Kim, Hyoung-Joo},
TITLE = {An efficient nearest neighbor search in high-dimensional data spaces},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {5},
PAGES = {239-246},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hassin-Rubinstein/02,
AUTHOR = {Hassin, Refael and Rubinstein, Shlomi},
TITLE = {A $\frac{7}{8}$-approximation algorithm for metric MAX TSP},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {5},
PAGES = {247-251},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Meduna-Kolar/02,
AUTHOR = {Meduna, A. and Kol{\'{a}}{\v{r}}, D.},
TITLE = {Homogeneous grammars with a reduced number of non-context-free productions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {5},
PAGES = {253-257},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{de_Berg-Stappen/02,
AUTHOR = {de Berg, Mark and Stappen, A. Frank van der},
TITLE = {On the fatness of Minkowski sums},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {5},
PAGES = {259-264},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lee-Park-Chwa/02,
AUTHOR = {Lee, Jae-Ha and Park, Sang-Min and Chwa, Kyung-Yong},
TITLE = {Simple algorithms for searching a polygon with flashlights},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {5},
PAGES = {265-270},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Zhou-Shenoy-Nicholls/02,
AUTHOR = {Zhou, Hai and Shenoy, Narendra and Nicholls, William},
TITLE = {Efficient minimum spanning tree construction wothout Delaunay triangulation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {5},
PAGES = {271-276},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Vesel-Zerovnik/02,
AUTHOR = {Vesel, Aleksander and {\v{Z}}erovnik, Janez},
TITLE = {Improved lower bound on the Shannon capacity of $C_7$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {5},
PAGES = {277-282},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kitsios-Makris-Sioutas-Tsakalidis-Tsaknakis-Vassiliadis/02,
AUTHOR = {Kitsios, N. and Makris, C. and Sioutas, S. and Tsakalidis, A. and Tsaknakis, J. and Vassiliadis, B.},
TITLE = {An optimal algorithm for reporting visible rectangles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {5},
PAGES = {283-288},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Koubkova-Koubek/02,
AUTHOR = {Koubkov{\'{a}}, A. and Koubek, V.},
TITLE = {Algorithms for transitive closure},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {6},
PAGES = {289-296},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Naroska-Schwiegelshohn/02,
AUTHOR = {Naroska, Edwin and Schwiegelshohn, Uwe},
TITLE = {On an on-line scheduling problem for parallel jobs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {6},
PAGES = {297-304},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chowdhury-Kaykobad-King/02,
AUTHOR = {Chowdhury, Rezaul Alam and Kaykobad, M. and King, Irwin},
TITLE = {An efficient decoding technique for Huffman codes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {6},
PAGES = {305-308},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Sopena/02,
AUTHOR = {Sopena, {\'{E}}ric},
TITLE = {There exist oriented planar graphs with oriented chromatic number at least sixteen},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {6},
PAGES = {309-312},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chung-Choi-Kim-Lee/02,
AUTHOR = {Chung, Ilyong and Choi, Wankyu and Kim, Youngchel and Lee, Mike},
TITLE = {The design of conference key distribution system employing a symmetric balanced incomplete block design},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {6},
PAGES = {313-318},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
NOTE = {see Erratum in Inf.~Process.~Lett., Vol. 91, No. 6, 2004, 299-300},
}
@article{Hart-Martinez/02,
AUTHOR = {Hart, Andrew G. and Mart{\'{i}}nez, Servet},
TITLE = {Sequential iteration of the Erlang fixed-point equations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {6},
PAGES = {319-325},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Ng-Cheng-Bachman-Janiak/02,
AUTHOR = {Ng, C.T. and Cheng, T.C.E. and Bachman, A. and Janiak, A.},
TITLE = {Three scheduling problems with deteriorating jobs to minimize the total completion time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {6},
PAGES = {327-333},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Zanuttini-Hebrard/02,
AUTHOR = {Zanuttini, Bruno and H{\'{e}}brard, Jean-Jacques},
TITLE = {A unified framework for structure identification},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {6},
PAGES = {335-339},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Mehlhorn-Priebe-Schafer-Sivadasan/02,
AUTHOR = {Mehlhorn, Kurt and Priebe, Volker and Sch{\"a}fer, Guido and Sivadasan, Naveen},
TITLE = {All-pairs shortest-paths computation in the presence of negative cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {81},
NUMBER = {6},
PAGES = {341-343},
YEAR = {2002},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}