@article{Roh-Yi/08,
AUTHOR = {Roh, Jong-Won and Yi, Byoung-Kee},
TITLE = {Efficient indexing of interval time sequences},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {1-12},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gauwin-Niehren-Roos/08,
AUTHOR = {Gauwin, Olivier and Niehren, Joachim and Roos, Yves},
TITLE = {Streaming tree automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {13-17},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ko-An-Seo/08,
AUTHOR = {Ko, Youngjoong and An, Hongkuk and Seo, Jungyun},
TITLE = {Pseudo-relevance feedback and statistical query expansion for web snippet generation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {18-22},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nagy-Gyorgy-Imreh/08,
AUTHOR = {Nagy-Gy{\"{o}}rgy, J. and Imreh, Cs.},
TITLE = {Online hypergraph coloring},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {23-26},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ganguly-Majumder/08,
AUTHOR = {Ganguly, Sumit and Majumder, Anirban},
TITLE = {Deterministic $K$-set structure},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {27-31},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Epstein-Levin/08,
AUTHOR = {Epstein, Leah and Levin, Asaf},
TITLE = {Asymptotic fully polynomial approximation schemes for variants of open-end bin packing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {32-37},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hurkens-Pendavingh-Woeginger/08,
AUTHOR = {Hurkens, Cor A.J. and Pendavingh, Rudi A. and Woeginger, Gerhard J.},
TITLE = {The Magnus-Derek game revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {38-40},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bollig/08a,
AUTHOR = {Bollig, Beate},
TITLE = {A note on the size of OBDDs for the graph of integer multiplication},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {41-43},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Smorodinsky/08,
AUTHOR = {Smorodinsky, Shakhar},
TITLE = {A note on the online First-Fit algorithm for coloring $k$-inductive graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {44-45},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Montoya/08,
AUTHOR = {Montoya, J. Andr{\'{e}}s},
TITLE = {The parameterized complexity of probability amplification},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {46-53},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Held-Mitchell/08,
AUTHOR = {Held, Martin and Mitchell, Joseph S.B.},
TITLE = {Triangulating input-constrained planar point sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {54-56},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Asano/08,
AUTHOR = {Asano, Tetsuo},
TITLE = {Online uniformity of integer points on a line},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {57-60},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Akl-Islam-Meijer/08,
AUTHOR = {Akl, Selim G. and Islam, Kamrul and Meijer, Henk},
TITLE = {Planar tree transformation: Results and counterexample},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {61-67},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Downey-Fellows-McCartin-Rosamond/08,
AUTHOR = {Downey, Rodney G. and Fellows, Michael R. and McCartin, Catherine and Rosamond, Frances},
TITLE = {Parameterized approximation of dominating set problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {68-70},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lins/08,
AUTHOR = {Lins, Rafael Dueire},
TITLE = {Cyclic reference counting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {71-78},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Atallah-Frederickson-Kundu/08,
AUTHOR = {Atallah, Mikhail J. and Frederickson, Greg N. and Kundu, Ashish},
TITLE = {A tree-covering problem arising in integrity of tree-structured data},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {79-82},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aceto-Ingolfsdottir/08,
AUTHOR = {Aceto, Luca and Ingolfsdottir, Anna},
TITLE = {On the expressibility of priority},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {1},
PAGES = {83-85},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{de_Berg-Thite/08,
AUTHOR = {de Berg, Mark and Thite, Shripad},
TITLE = {Cache-oblivious selection in sorted $X + Y$ matrices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {87-92},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Keil-Vassilev/08,
AUTHOR = {Keil, J. Mark and Vassilev, Tzvetalin S.},
TITLE = {The relative neighbourhood graph is a part of every 30$^\circ$-triangulation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {93-97},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baldoni-Bonnet-Milani-Raynal/08,
AUTHOR = {Baldoni, Roberto and Bonnet, Fran{\c{c}}ois and Milani, Alessia and Raynal, Michel},
TITLE = {Anonymous graph exploration without collision by mobile robots},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {98-103},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Fokkink-van_Glabbeek/08,
AUTHOR = {Chen, Taolue and Fokkink, Wan and van Glabbeek, Rob},
TITLE = {Ready to preorder: The case of weak process semantics},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {104-111},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wu-Chen-Fu-Chang/08,
AUTHOR = {Wu, Ruei-Yu and Chen, Gen-Huey and Fu, Jung-Sheng and Chang, Gerard J.},
TITLE = {Finding cycles in hierarchical hypercube networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {112-115},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Wu/08,
AUTHOR = {Lin, Hwei-Jen and Wu, Hung-Hsuan},
TITLE = {Efficient geometric measure of music similarity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {116-120},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sarkar/08,
AUTHOR = {Sarkar, Palash},
TITLE = {A general mixing strategy for the ECB-Mix-ECB mode of operation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {121-123},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huemer-Hurtado-Pfeifle/08,
AUTHOR = {Huemer, Clemens and Hurtado, Ferran and Pfeifle, Julian},
TITLE = {The rotation graph of $k$-ary trees is Hamiltonian},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {124-129},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Meng/08,
AUTHOR = {Li, Rui and Meng, Jixiang},
TITLE = {Reversals Cayley graphs of symmetric groups},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {130-132},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Srinivasan/08,
AUTHOR = {Srinivasan, Aravind},
TITLE = {A note on the distribution of the number of prime factors of the integers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {133-135},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fusco-Pelc/08,
AUTHOR = {Fusco, Emanuele G. and Pelc, Andrzej},
TITLE = {Acknowledged broadcasting in ad hoc radio networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {136-141},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sadeghi_Bigham-Mohades-Ortega/08,
AUTHOR = {Sadeghi Bigham, Bahram and Mohades, Ali and Ortega, Lidia},
TITLE = {Dynamic polar diagram},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {142-146},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai-Tsai/08a,
AUTHOR = {Lai, Chia-Jui and Tsai, Chang-Hsiung},
TITLE = {On embedding cycles into faulty dual-cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {147-150},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cholvi/08,
AUTHOR = {Cholvi, V.},
TITLE = {Stability bounds in networks with dynamic link capacities},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {151-154},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hurink-Nieberg/08,
AUTHOR = {Hurink, Johann L. and Nieberg, Tim},
TITLE = {Approximating minimum independent dominating sets in wireless networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {155-160},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Su-Lu-Tang/08,
AUTHOR = {Su, Hsin-Hao and Lu, Chin Lung and Tang, Chuan Yi},
TITLE = {An improved algorithm for finding a length-constrained maximum-density subtree in a tree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {161-164},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Akutsu-Fukagawa-Takasu/08,
AUTHOR = {Akutsu, Tatsuya and Fukagawa, Daiji and Takasu, Atsuhiro},
TITLE = {Improved approximation of the largest common subtree of two unordered trees of bounded height},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {109},
NUMBER = {2},
PAGES = {165-170},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Boichut-Heam/08,
AUTHOR = {Boichut, Y. and H{\'e}am, P.-C.},
TITLE = {A theoretical limit for safety verification techniques with regular fix-point computations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {1},
PAGES = {1-2},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {reachability problem, regular tree languages, formal methods, theoretical limit},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S575Y6-1/2/5cebe9a4a3c060a50d21840c62b03b0a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou/08,
AUTHOR = {Zhou, Xiang},
TITLE = {Ehrenfeucht-Fra{\"{i}}ss{\'e} games in finite set theory},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {1},
PAGES = {3-9},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {specification languages, arithmetic predicates, finite set theory, fragments of first order logic, inexpressibility, ehrenfeucht-fra{\'o}ss{\'o} games},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S3G40H-2/2/201ae6af0fac16513550d8a564da9c54},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bordihn-Holzer/08,
AUTHOR = {Bordihn, Henning and Holzer, Markus},
TITLE = {A note on cooperating distributed grammar systems working in combined modes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {1},
PAGES = {10-14},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S80XKY-1/2/36f1e809a099d391a44e4cb09edf63c3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cohen-Katzir/08,
AUTHOR = {Cohen, Reuven and Katzir, Liran},
TITLE = {The Generalized Maximum Coverage Problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {1},
PAGES = {15-22},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {maximum coverage, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S5FJH8-4/2/8de79330266592982b30aaa58179edee},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Droste-Sakarovitch-Vogler/08,
AUTHOR = {Droste, Manfred and Sakarovitch, Jacques and Vogler, Heiko},
TITLE = {Weighted automata with discounting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {1},
PAGES = {23-28},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, formal power series, finite automata, rational series, discounting, weighted automata},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S5FJH8-1/2/08de051d373aa3341d4d735e3f032c83},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liazi-Milis-Zissimopoulos/08,
AUTHOR = {Liazi, Maria and Milis, Ioannis and Zissimopoulos, Vassilis},
TITLE = {A constant approximation algorithm for the densest $k$-subgraph problem on chordal graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {1},
PAGES = {29-32},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {densest k-subgraph, chordal graphs, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S5FJH8-2/2/d645c55e5a33c1bd9565435774783bc9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lim-Lee-Kim/08,
AUTHOR = {Lim, Sung-Hwa and Lee, Byoung-Hoon and Kim, Jai-Hoon},
TITLE = {Diversity and fault avoidance for dependable replication systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {1},
PAGES = {33-37},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, distributed systems, safety/security in digital systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S7BDJG-2/2/0b36ddf596063afa23a21f5a8943494a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schwarz/08,
AUTHOR = {Schwarz, Ulrich M.},
TITLE = {Online scheduling on semi-related machines},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {1},
PAGES = {38-40},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online algorithms, preemptive scheduling, variable profile},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S62RR8-1/2/3c149151b311e5ede009700402613504},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yanovsky/08,
AUTHOR = {Yanovsky, Vladimir},
TITLE = {Approximation algorithm for coloring of dotted interval graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {1},
PAGES = {41-44},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, dotted interval graph, intersection graph, minimum coloring, microsatellite genotyping},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S7BDJG-1/2/76c587ccc82e25c70d0b81f8f9deebf9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Puolamaki-Hanhijarvi-Garriga/08,
AUTHOR = {Puolam{\"a}ki, Kai and Hanhij{\"a}rvi, Sami and Garriga, Gemma C.},
TITLE = {An approximation ratio for biclustering},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {2},
PAGES = {45-49},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, biclustering, one-way clustering},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S5FJH8-3/2/0ae4751e03fd661efbe96a08b1f22b68},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tavares-Maciel-Silva-Oliveira/08,
AUTHOR = {Tavares, Eduardo and Maciel, Paulo and Silva, Bruno and Oliveira, Meuse N., Jr.},
TITLE = {Hard real-time tasks' scheduling considering voltage scaling, precedence and exclusion relations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {2},
PAGES = {50-59},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {real-time systems, scheduling, formal methods, operating systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S6G92H-1/2/40ae4de42b3c7ccd36589acdf4ee57eb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ziegler/08,
AUTHOR = {Ziegler, Valentin},
TITLE = {Approximation algorithms for restricted Bayesian network structures},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {2},
PAGES = {60-63},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, graph algorithms, bayesian network, structure learning},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S5FJH8-5/2/f7adefa6156eaa99567a6e1dd8d5acf3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Czerwinski-Grytczuk/08,
AUTHOR = {Czerwi{\'n}ski, Sebastian and Grytczuk, Jaros{\l}aw},
TITLE = {Invisible runners in finite fields},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {2},
PAGES = {64-67},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, integer distance graphs, the lonely runner problem},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S6G92H-2/2/ba9e0ded9d02870d7563c78c07d7d380},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Masopust/08,
AUTHOR = {Masopust, Tom{\'a}{\v{s}}},
TITLE = {Descriptional complexity of multi-parallel grammars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {2},
PAGES = {68-70},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, multi-parallel grammars, descriptional complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S7J5KK-1/2/243ff5aefb8b34ed1dbcb19b1944cb86},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Goller/08,
AUTHOR = {G{\"o}ller, Stefan},
TITLE = {Reachability on prefix-recognizable graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {2},
PAGES = {71-74},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {reachability, prefix-recognizable graphs, computational complexity, alternation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S8CR86-1/2/c91399c91fe6f99887dd6ff90beabced},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diaconescu/08,
AUTHOR = {Diaconescu, R{\u{a}}zvan},
TITLE = {A categorical study on the finiteness of specifications},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {2},
PAGES = {75-80},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {institutions, specifications, formal methods},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S6P244-1/2/e981f30c981d0fc6e5b0eb60c3e9f08a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hsieh/08,
AUTHOR = {Hsieh, Sun-Yuan},
TITLE = {A note on cycle embedding in folded hypercubes with faulty elements},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {2},
PAGES = {81-81},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, fault tolerance, folded hypercube, cycle embedding},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S7SV63-2/2/166309fd78d639c1c80283f966207101},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ochem-Pinlou/08,
AUTHOR = {Ochem, Pascal and Pinlou, Alexandre},
TITLE = {Oriented colorings of partial 2-trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {2},
PAGES = {82-86},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, partial 2-tree, k4 minor-free graph, series-parallel graph, girth, oriented chromatic number},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S92TR6-1/2/67ca2d1891f4da1e050fd31469f95adf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Wen-Wang/08,
AUTHOR = {Wang, De-Qiang and Wen, Yu-Peng and Wang, Ke-Lun},
TITLE = {A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {87-89},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, planar graph, list coloring, 3-choosable},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S7SV63-1/2/42762e2fa1f2f3a61f620368d4892a10},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Meng/08,
AUTHOR = {Liu, Juan and Meng, Jixiang},
TITLE = {Super-connected and super-arc-connected Cartesian product of digraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {90-93},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cartesian product, super-connected, super-arc-connected, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S85DPC-4/2/d429f54dde17f5d2ab701a3031f73d3e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Minetti-Alba-Luque/08,
AUTHOR = {Minetti, Gabriela and Alba, Enrique and Luque, Gabriel},
TITLE = {Seeding strategies and recombination operators for solving the DNA fragment assembly problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {94-100},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {dna, fragment assembly problem, genetic algorithm, permutation operators, 2-opt heuristic, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S85DPC-3/2/3fbbfeedd6e3189aa42fee237e0eee5d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hericko-Zivkovic-Rozman/08,
AUTHOR = {Heri{\v{c}}ko, Marjan and {\v{Z}}ivkovi{\v{c}}, Ale{\v{s}} and Rozman, Ivan},
TITLE = {An approach to optimizing software development team size},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {101-106},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software development effort, software size estimation, team size, search-based software engineering, software engineering},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S9P5TV-1/2/cfa867702cdf6000a0b16b56331dccfc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pai-Chang-Wang/08,
AUTHOR = {Pai, Kung-Jui and Chang, Jou-Ming and Wang, Yue-Li},
TITLE = {A note on ``An improved upper bound on the queuenumber of the hypercube''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {107-109},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, queue layout, hypercube, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SBHX75-1/2/094e4b6c8daba219d5050196df69f805},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jiao/08,
AUTHOR = {Jiao, Li},
TITLE = {A note on regular Petri nets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {110-114},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {regular petri nets, siphon, state machines, trap, formal methods},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S9P5TV-3/2/63c61ed94571d36f680f4c5b62555c72},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Halava-Harju-Hirvensalo-Karhumaki/08,
AUTHOR = {Halava, Vesa and Harju, Tero and Hirvensalo, Mika and Karhum{\"a}ki, Juhani},
TITLE = {Post correspondence problem for short words},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {115-118},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {post correspondence problem, generalized post correspondence problem, undecidability, tzeitin semigroup, short words, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S9P5TV-5/2/797afb8503c7762c8aa543694afae447},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zemmari/08,
AUTHOR = {Zemmari, Akka},
TITLE = {On handshakes in random graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {119-123},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, randomized algorithms, random graphs, handshakes},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SBY4XM-1/2/e26f775febf7c30d84a727da9328949f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lavallee/08,
AUTHOR = {Lavall{\'e}e, Sylvain},
TITLE = {$N$-rationality of a certain class of formal series},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {124-126},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SB7TY7-1/2/dfc453855d3587f0dc910b3651f4048f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Long/08,
AUTHOR = {Long, Brad},
TITLE = {Managing module dependencies to facilitate continuous testing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {127-131},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software design and implementation, software engineering, testing, continuous integration, software licensing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S9P5TV-6/2/fffd409d004a714ee659abdae842caf7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Haddadi-Layouni/08,
AUTHOR = {Haddadi, Salim and Layouni, Zoubir},
TITLE = {Consecutive block minimization is 1.5-approximable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {132-135},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, consecutive block minimization, traveling salesman, polynomial-time transformation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S98V1V-1/2/ed38db6e7aa9a00502b89e52ced87bd7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bordawekar-Shmueli/08,
AUTHOR = {Bordawekar, Rajesh and Shmueli, Oded},
TITLE = {An algorithm for partitioning trees augmented with sibling edges},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {136-142},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, analysis of algorithms, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S9P5TV-2/2/064cb58124a7c6450850a132d2bc4af4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bottcher-Vilenchik/08,
AUTHOR = {B{\"o}ttcher, Julia and Vilenchik, Dan},
TITLE = {On the tractability of coloring semirandom graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {143-149},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, average case analysis, semi-random models, k-coloring},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S9P5TV-4/2/413bd81332c7164725a16aeee58d3464},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Viana/08,
AUTHOR = {Via{\~n}a, Raquel},
TITLE = {Quick encoding of plane graphs in $\log_2$ 14 bits per edge},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {150-154},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {compression, information retrieval, planar graph, map, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SBHX75-2/2/cb496ab276596c26e2252bf309c080c8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fujiwara-Iwama-Yonezawa/08,
AUTHOR = {Fujiwara, Hiroshi and Iwama, Kazuo and Yonezawa, Kouki},
TITLE = {Online chasing problems for regular polygons},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {155-159},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, analysis of algorithms, competitive analysis, server location problem},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SBY4XM-2/2/415fdc10b5cd2336d7fa9dce85826f91},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rajsbaum-Raynal-Travers/08a,
AUTHOR = {Rajsbaum, Sergio and Raynal, Michel and Travers, Corentin},
TITLE = {An impossibility about failure detectors in the iterated immediate snapshot model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {160-164},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {asynchronous shared memory system, atomic read/write register, distributed computing, distributed computability, failure detector, iterated immediate snapshot model, process crash, snapshot operation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SG4HP3-1/2/d248c4d63d863e8ad1a33c76d3ba8c2b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Skowronek-Kaziow/08a,
AUTHOR = {Skowronek-Kazi{\'o}w, Joanna},
TITLE = {Some digraphs arising from number theory and remarks on the zero-divisor graph of the ring $Z_n$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {3},
PAGES = {165-169},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {digraph, chinese remainder theorem, carmichael [lambda]-function, group theory, zero-divisor graph, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SH0Y3H-1/2/bae6530d2fc3932e03c98a2e438fc839},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ji-Cheng/08,
AUTHOR = {Ji, Min and Cheng, T.C.E.},
TITLE = {An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {171-174},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, eligibility, grade of service, makespan},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SFS0R8-2/2/7ba04fa897f9de86f548edbfd9443a88},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mathieu-Papamanthou/08,
AUTHOR = {Mathieu, Claire and Papamanthou, Charalampos},
TITLE = {Distortion lower bounds for line embeddings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {175-178},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SJG6BS-1/2/795a1115ecbb05765abe3d35ca6d8334},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Steinwandt-Villanyi/08,
AUTHOR = {Steinwandt, Rainer and Vill{\'a}nyi, Vikt{\'o}ria I.},
TITLE = {A one-time signature using run-length encoding},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {179-185},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, digital signature, one-time signature, hash function},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SHVSYX-1/2/cb8143504f0d3ceeb8c7432e00ea94d3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Charbit-Habib-Limouzy-de_Montgolfier-Raffinot-Rao/08,
AUTHOR = {Charbit, Pierre and Habib, Michel and Limouzy, Vincent and de Montgolfier, Fabien and Raffinot, Mathieu and Rao, Micha{\"e}l},
TITLE = {A note on computing set overlap classes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {186-191},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {set system, overlap class, graph algorithms, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SJP7JH-1/2/68068d1b7877653253e52c865e47b696},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin/08a,
AUTHOR = {Lin, Jyhjong},
TITLE = {A conceptual model for negotiating in service-oriented environments},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {192-203},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {service-oriented environment, negotiation, object-orientation, conceptual model, software engineering},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SKB3H0-1/2/4b616a361e85f4d7365976840eea8b17},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Sun-Zhu-Yang/08,
AUTHOR = {Zhang, Changsheng and Sun, Jigui and Zhu, Xingjun and Yang, Qingyun},
TITLE = {An improved particle swarm optimization algorithm for flowshop scheduling problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {204-209},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {flow shop scheduling problem, particle swarm optimization, makespan, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SKB3H0-2/2/34632aa3b512b9e8f4c03cfb47494c9e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bose-Guo-Kranakis-Maheshwari-Morin-Morrison-Smid-Tang/08,
AUTHOR = {Bose, Prosenjit and Guo, Hua and Kranakis, Evangelos and Maheshwari, Anil and Morin, Pat and Morrison, Jason and Smid, Michiel and Tang, Yihui},
TITLE = {On the false-positive rate of Bloom filters},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {210-213},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, analysis of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SMWFJ6-1/2/5f479ecc8eea9b5b67869b97a54c16b6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fung/08,
AUTHOR = {Fung, Stanley P.Y.},
TITLE = {Lower bounds on online deadline scheduling with preemption penalties},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {214-218},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online algorithms, scheduling, preemption penalties},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SMWFJ6-2/2/7e496c58b1aaa2a875c365e063206ce2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Miettinen/08,
AUTHOR = {Miettinen, Pauli},
TITLE = {On the Positive-Negative Partial Set Cover problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {219-221},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, combinatorial problems, hardness of approximation, set cover},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SKB3H0-3/2/e489907c0010afc087de6b7482cd1a60},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Heun/08,
AUTHOR = {Heun, Volker},
TITLE = {Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {222-225},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {ultrametric matrix, ultrametric tree, time-optimal reconstruction, evolutionary tree, clustering, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SKB3H0-4/2/aa8e3ca2f42bc224e3e9b87396800ed3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grauman-Hartke-Jobson-Kinnersley-West-Wiglesworth-Worah-Wu/08,
AUTHOR = {Grauman, Tracy and Hartke, Stephen G. and Jobson, Adam and Kinnersley, Bill and West, Douglas B. and Wiglesworth, Lesley and Worah, Pratik and Wu, Hehui},
TITLE = {The hub number of a graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {226-228},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, complexity, hub number, connected domination},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SPC0T4-1/2/210f7faee871203b74c644f61fa959fd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Takenaga-Arai/08,
AUTHOR = {Takenaga, Yasuhiko and Arai, Shigeru},
TITLE = {PSPACE-completeness of an escape problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {229-233},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, puzzle, rogue, pspace-completeness},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SM1TH1-1/2/889f34b7086edb96ac25cfeb12686f9c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{dos_Santos_Carvalho-Lavor-Protti/08,
AUTHOR = {dos Santos Carvalho, Ricardo and Lavor, Carlile and Protti, F{\'a}bio},
TITLE = {Extending the geometric build-up algorithm for the molecular distance geometry problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {234-237},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational biology, molecular distance geometry problem, nmr spectroscopy, geometric build-up algorithm, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SKB3H0-5/2/0820c349b2e1c38cd29d7f35e3fd737d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kochol-Krivonakova-Smejova-Srankova/08,
AUTHOR = {Kochol, Martin and Krivo{\v{n}}{\'a}kov{\'a}, Nad'a and Smejov{\'a}, Silvia and {\v{S}}rankov{\'a}, Katar{\'{i}}na},
TITLE = {Complexity of approximation of 3-edge-coloring of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {238-241},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {edge-coloring of graphs, np-completeness, approximation algorithms, cyclical edge-connectivity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SM62KB-1/2/e99c8ea41fedbc3f273ef6a71521727b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Heam/08,
AUTHOR = {H{\'e}am, P.-C.},
TITLE = {A note on partially ordered tree automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {242-246},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, formal methods, tree automata},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SM62KB-3/2/292b07ff59d87a340755eca5384f12dc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dourado-Lin-Protti-Szwarcfiter/08,
AUTHOR = {Dourado, Mitre C. and Lin, Min Chih and Protti, F{\'a}bio and Szwarcfiter, Jayme L.},
TITLE = {Improved algorithms for recognizing $p$-Helly and hereditary $p$-Helly hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {247-250},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, p-helly hypergraphs, hereditary p-helly hypergraphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SM62KB-2/2/59677ab5438febebba2256e545d6fc5a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tsur/08,
AUTHOR = {Tsur, Dekel},
TITLE = {Faster algorithms for guided tree edit distance},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {4},
PAGES = {251-254},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, string algorithms, edit distance, ordered trees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SM62KB-4/2/a203d83648800e4b2b29d8e66b06431c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Esperet-Labourel-Ochem/08,
AUTHOR = {Esperet, Louis and Labourel, Arnaud and Ochem, Pascal},
TITLE = {On induced-universal graphs for the class of bounded-degree graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {255-260},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {universal graph, bounded degree, edge partition, homomorphism, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SFS0R8-1/2/0cc8cca581fbcf2be9e79c0eebbcb7c5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fu/08a,
AUTHOR = {Fu, Jung-Sheng},
TITLE = {Fault-free cycles in folded hypercubes with more faulty elements},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {261-263},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hypercube, fault tolerant embedding, folded hypercube, interconnection network},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SRKMMF-1/2/59c3198c0ac09db469ddb6aa7fa8623d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vagvolgyi/08,
AUTHOR = {V{\'a}gv{\"o}lgyi, S{\'a}ndor},
TITLE = {Murg term rewrite systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {264-272},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {term rewrite systems, sets of descendants, formal languages, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SP3ST7-1/2/5f8fd8581ad6cfd9226577af28b6719e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Boulinier-Datta-Larmore-Petit/08,
AUTHOR = {Boulinier, Christian and Datta, Ajoy K. and Larmore, Lawrence L. and Petit, Franck},
TITLE = {Space efficient and time optimal distributed BFS tree construction},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {273-278},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {bfs tree, distributed computing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SMNXXV-1/2/b816353f76d804d9268e792106944c42},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Galindo-Herranz/08,
AUTHOR = {Galindo, David and Herranz, Javier},
TITLE = {On the security of public key cryptosystems with a double decryption mechanism},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {279-283},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, public key encryption, escrowed systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SMNXXV-2/2/535dd0f846b4bc73d0dd2177d8262d2f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aceto-Capobianco-Ingolfsdottir-Luttik/08,
AUTHOR = {Aceto, Luca and Capobianco, Silvio and Ingolfsdottir, Anna and Luttik, Bas},
TITLE = {The equational theory of prebisimilarity over basic CCS with divergence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {284-289},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, process algebra, basic ccs, divergence, prebisimilarity, equational theory, complete axiomatisation, finite basis, non-finitely based equational theory},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SMWFJ6-3/2/e6afb2107f25eb246f1e4fd8430c38f8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Halava-Harju-Karki/08,
AUTHOR = {Halava, Vesa and Harju, Tero and K{\"a}rki, Tomi},
TITLE = {Square-free partial words},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {290-292},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, partial word, square-free, thue-morse word, leech word},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SR7186-1/2/bd08e504837bfa2c73b3b5b81540cb0b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bhattacharyya-Dehne/08,
AUTHOR = {Bhattacharyya, Bishnu and Dehne, Frank},
TITLE = {Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {293-297},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, analysis of algorithms, data structures},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SR7186-2/2/1cb7a9b18d885da4612c8eb9c28a51d2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Downey-Greenberg/08,
AUTHOR = {Downey, Rod and Greenberg, Noam},
TITLE = {Turing degrees of reals of positive effective packing dimension},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {298-303},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, effective packing dimension, array nonrecursive degrees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4ST3YMH-1/2/0c897853d8cdac01bc3560df20ae4179},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ibeas_Martin/08,
AUTHOR = {Ibeas Mart{\'{i}}n, {\'A}lvar},
TITLE = {On the period of the Naor-Reingold sequence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {304-307},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {pseudo-random numbers, cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SS268Y-1/2/2f885a37643a04d181297d346837134f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lange/08,
AUTHOR = {Lange, Martin},
TITLE = {A purely model-theoretic proof of the exponential succinctness gap between CTL$^+$ and CTL},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {308-312},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {specification languages, temporal logics, small model property},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SSND8C-1/2/15d25d0811664d99996bcfa32d1e9bd2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hyyro/08,
AUTHOR = {Hyyr{\"o}, Heikki},
TITLE = {Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {313-319},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, edit distance, approximate string matching, bit-parallel algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4ST3YMH-2/2/123a4fb7d28a6a5d05db9446df7813ab},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crochemore-Iliopoulos-Rahman/08,
AUTHOR = {Crochemore, Maxime and Iliopoulos, Costas S. and Rahman, M. Sohel},
TITLE = {Optimal prefix and suffix queries on texts},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {320-325},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, pattern matching, data structures},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4ST3YMH-3/2/92483bbe7d99a331fb405f3ba0a227c4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai-Tsai/08,
AUTHOR = {Lai, Chia-Jui and Tsai, Chang-Hsiung},
TITLE = {Embedding a family of meshes into twisted cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {326-330},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {twisted cubes, mesh embedding, dilation, expansion, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SW145D-1/2/0680be245f2c199e78045768c0f31d12},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tan/08,
AUTHOR = {Tan, Jinsong},
TITLE = {A note on the inapproximability of correlation clustering},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {331-335},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {correlation clustering, inapproximability, randomized rounding, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4STYV2M-1/2/452ea106bf3a88858f02b039ed7c9c00},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{van_de_Bult-Woeginger/08,
AUTHOR = {van de Bult, Fokko J. and Woeginger, Gerhard J.},
TITLE = {The problem of the moody chess players},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {5},
PAGES = {336-337},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithmic puzzle, sorting problem, worst case analysis, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SWWT7J-1/2/181030d52a781fabe890ce51c5de842b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Youn-Park-Kim-Lim/08,
AUTHOR = {Youn, Taek-Young and Park, Young-Ho and Kim, Changhan and Lim, Jongin},
TITLE = {Weakness in a RSA-based password authenticated key exchange protocol},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {339-342},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {dictionary attack, key exchange, password, rsa, cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SR7186-3/2/3473f93ee22e283089e5ea4c64bd77f0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Karmakar-Roy-Das/08,
AUTHOR = {Karmakar, Arindam and Roy, Sasanka and Das, Sandip},
TITLE = {Fast computation of smallest enclosing circle with center on a query line segment},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {343-346},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {1-center problem, furthest point voronoi diagram, geometric duality, computational geometry, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SX9G1F-1/2/13248a32c2bbaab2ea59921c4fa09c0e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Hou-Liu/08,
AUTHOR = {Liu, Bin and Hou, Jianfeng and Liu, Guizhen},
TITLE = {List edge and list total colorings of planar graphs without short cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {347-351},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, list coloring, planar graph, choosability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SY6W83-1/2/107e0aad4f2441e2a876fca1327a5736},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gagie/08,
AUTHOR = {Gagie, Travis},
TITLE = {Dynamic asymmetric communication},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {352-355},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data compression, asymmetric communication, on-line algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4SYCPXG-1/2/e84dac8c4a4c4a47cbeb2f80a471312b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jarray-Costa-Picouleau/08,
AUTHOR = {Jarray, Fethi and Costa, Marie-Christine and Picouleau, Christophe},
TITLE = {Complexity results for the horizontal bar packing problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {356-359},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {bar packing, discrete tomography, reconstructing problems, computational complexity, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T0MMMR-2/2/4f38d8e2c4eff6b17fd89ff2dc68377c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ann-Yang-Tseng-Hor/08,
AUTHOR = {Ann, Hsing-Yen and Yang, Chang-Biau and Tseng, Chiou-Ting and Hor, Chiou-Yi},
TITLE = {A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {360-364},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, longest common subsequence, run-length encoding, edit distance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T0MMMR-1/2/3244f52bf4613fa16affa5e950ed06bf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lotker-Patt-Shamir-Rawitz/08,
AUTHOR = {Lotker, Zvi and Patt-Shamir, Boaz and Rawitz, Dror},
TITLE = {Ski rental with two general options},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {365-368},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {competitive analysis, ski rental, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T1Y3XB-1/2/538ac751c4feeeef83337f9b4d4b4bfa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Deng-Du/08,
AUTHOR = {Deng, Xiaotie and Du, Ye},
TITLE = {The computation of approximate competitive equilibrium is PPAD-hard},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {369-373},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {competitive equilibrium, leontief economy, ppad, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T2M61X-1/2/9dcc7b59572c5663db20e791d6351905},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Massuthe-Serebrenik-Sidorova-Wolf/08,
AUTHOR = {Massuthe, Peter and Serebrenik, Alexander and Sidorova, Natalia and Wolf, Karsten},
TITLE = {Can I find a partner? Undecidability of partner existence for open nets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {374-378},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {petri net, open net, operability, web service, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T0MMMR-3/2/1ff00b534148ebf918122d25d6ecf330},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang/08,
AUTHOR = {Wang, Yusu},
TITLE = {Approximating nearest neighbor among triangles in convex position},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {379-385},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, computational geometry, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T2DKYB-1/2/b4f034ff9817911e6cadc5f8aac4fa85},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Lin/08,
AUTHOR = {Wang, Shiying and Lin, Shangwei},
TITLE = {$\lambda'$-optimal digraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {386-389},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, restricted edge-connectivity, restricted arc-connectivity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T13CNR-1/2/36c8c52379697039751a7dbdd684f6d7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Procaccia/08,
AUTHOR = {Procaccia, Ariel D.},
TITLE = {A note on the query complexity of the Condorcet winner problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {390-393},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, graph algorithms, theory of computation, concrete complexity, social choice},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T2M61X-2/2/a997b73660c46915fc2439c8bd084791},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dong-Yang-Zhao/08,
AUTHOR = {Dong, Qiang and Yang, Xiaofan and Zhao, Juan},
TITLE = {Embedding a family of disjoint multi-dimensional meshes into a crossed cube},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {394-397},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, crossed cube, multi-dimensional mesh, graph embedding},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T3DD02-1/2/05d3ebc4f7a8d1fb0f1a9dc0e8ba38c8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tan-Yu-Park/08,
AUTHOR = {Tan, Xuegong and Yu, Shun-Zheng and Park, Jin Han},
TITLE = {A note about some properties of BC graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {398-401},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {bc graphs, vertex-pancyclicity, super-connectivity, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T4XRDJ-1/2/f68c9e09aa1aa55d6cd9a07e999077a3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gregor-Dvorak/08,
AUTHOR = {Gregor, Petr and Dvo{\v{r}}{\'a}k, Tom{\'a}{\v{s}}},
TITLE = {Path partitions of hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {402-406},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {path partition, routing, hypercube, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T5TPR5-3/2/1f012999a595f5f98f76b5607747581d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Israeli-Sharon/08,
AUTHOR = {Israeli, Amos and Sharon, Oran},
TITLE = {An approximation algorithm for sequential rectangle placement},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {407-411},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, sequential rectangle placement},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T5TPR5-4/2/f1acfe97bc99d79997ee089f16913313},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fiedorowicz-Haluszczak-Narayanan/08,
AUTHOR = {Fiedorowicz, Anna and Ha{\l}uszczak, Mariusz and Narayanan, Narayanan},
TITLE = {About acyclic edge colourings of planar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {412-417},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, acyclic edge colouring, planar graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T5TPR5-2/2/3b8962025e14bcd7112191c0daf4c535},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gagie/08a,
AUTHOR = {Gagie, Travis},
TITLE = {Sorting streamed multisets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {108},
NUMBER = {6},
PAGES = {418-421},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, on-line algorithms, sorting, streaming algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4T6M85W-1/2/4da48cccb0dfb7a6d68ab25492483d3d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gavril/08,
AUTHOR = {Gavril, Fanica},
TITLE = {Minimum weight feedback vertex sets in circle graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {1},
PAGES = {1-6},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {minimum feedback vertex set, maximum induced forest, circle graph, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RC2S3H-1/1/09c9aaae2abdabdc4405d8b119a8749f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chu/08,
AUTHOR = {Chu, Frank Pok Man},
TITLE = {A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {1},
PAGES = {7-12},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RHFVJM-1/1/e45ec0bd3352b29e468b902cf3f17ad9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Garcia-Vazquez_de_Parga-Lopez/08,
AUTHOR = {Garc{\'{i}}a, Pedro and V{\'a}zquez de Parga, Manuel and L{\'o}pez, Dami{\'a}n},
TITLE = {On the efficient construction of quasi-reversible automata for reversible languages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {1},
PAGES = {13-17},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, reversible language, quasi-reversible automata, residual finite state automaton},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RDR1GR-1/1/0c552ddda06c7c1f2a2d00ed7dbbe881},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai-Hsu/08,
AUTHOR = {Lai, Pao-Lien and Hsu, Hong-Chun},
TITLE = {The two-equal-disjoint path cover problem of Matching Composition Network},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {1},
PAGES = {18-23},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, matching composition networks, k disjoint path cover, two-equal-disjoint path cover, hamiltonian-connectivity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RDS45W-1/1/f9f5c5b9d0c898fd000e4b49851db28c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Chen-Huang/08,
AUTHOR = {Wang, Jianxin and Chen, Jianer and Huang, Min},
TITLE = {An improved lower bound on approximation algorithms for the Closest Substring problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {1},
PAGES = {24-28},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, approximation algorithms, closest substring problem, lower bound, computational biology},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RDS1V1-1/1/5a015e1af6156e3f7b07558f015a5ae7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Segal/08a,
AUTHOR = {Segal, Michael},
TITLE = {Fast algorithm for multicast and data gathering in wireless networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {1},
PAGES = {29-33},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, wireless network, multicasting},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RWK098-1/1/308146eaa26f133ee37321cdef982333},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pessoa/08,
AUTHOR = {Pessoa, Artur Alves},
TITLE = {A note on the construction of error detecting/correcting prefix codes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {1},
PAGES = {34-38},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {prefix codes, approximation algorithms, data compression, information retrieval},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RHFVJM-2/1/73c7b1dbb4ae1fbaefcfeafd8a654053},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gutner/08,
AUTHOR = {Gutner, Shai},
TITLE = {Elementary approximation algorithms for prize collecting Steiner tree problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {1},
PAGES = {39-44},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, prize collecting steiner tree problem, local ratio, primal-dual},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RJYV92-1/1/ce9a4ba77b4c56efba85d25db87bc00f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Juan-Huang-Sun/08,
AUTHOR = {Juan, Justie Su-Tzu and Huang, Chun-Ming and Sun, I-fan},
TITLE = {The strong distance problem on the Cartesian product of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {2},
PAGES = {45-51},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, strong radius, strong diameter, cartesian product, binary hypercubes},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RJK14N-1/1/f6dd5c7306b23d2200235795096e0806},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Almeida-Zeitoun/08,
AUTHOR = {Almeida, Jorge and Zeitoun, Marc},
TITLE = {Description and analysis of a bottom-up DFA minimization algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {2},
PAGES = {52-59},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {finite automaton, minimization, algorithms, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RK5K0Y-1/1/83550e96a53ed2c246cc90c50232d4c1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duffy-OConnell-Sapozhnikov/08,
AUTHOR = {Duffy, K.R. and O'Connell, N. and Sapozhnikov, A.},
TITLE = {Complexity analysis of a decentralised graph colouring algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {2},
PAGES = {60-63},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, graph algorithms, randomised algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RJRVTF-1/1/d35d3d183ffb782e72cac17e7699c790},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bleischwitz-Schoppmann/08,
AUTHOR = {Bleischwitz, Yvonne and Schoppmann, Florian},
TITLE = {New efficiency results for makespan cost sharing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {2},
PAGES = {64-70},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, mechanism design, cost-sharing, cross-monotonicity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RSJDYC-1/1/246197c69f1f06e7e5b7af6f34b2b673},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yunes/08,
AUTHOR = {Yun{\`e}s, Jean-Baptiste},
TITLE = {A 4-states algebraic solution to linear cellular automata synchronization},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {2},
PAGES = {71-75},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parallel algorithms, theory of computation, cellular automata, firing squad, synchronization},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RWH8D4-1/1/5c8f9f5e449f1b02fd18765cc9e61be5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lopez-Reisner/08,
AUTHOR = {Lopez, Mario A. and Reisner, Shlomo},
TITLE = {Hausdorff approximation of 3D convex polytopes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {2},
PAGES = {76-82},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {convex polytopes, approximation algorithms, hausdorff distance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S01WPN-1/1/0b78985a5b43998d4ae63f113c93626b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shim/08,
AUTHOR = {Shim, Kyung-Ah},
TITLE = {Rogue-key attacks on the multi-designated verifiers signature scheme},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {2},
PAGES = {83-86},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, digital signature, multi-designated verifiers signature, bilinear pairing, rogue-key attack},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RSJDYC-2/1/6ec6b03ff1e4d1d3bf4323f61603984f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yan-Zhang/08,
AUTHOR = {Yan, Jun and Zhang, Jian},
TITLE = {An efficient method to generate feasible paths for basis path testing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {3-4},
PAGES = {87-92},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software engineering, basis path testing, path feasibility, test data generation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RTW3WV-1/1/93b043c463b04459411df357a5060599},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Skowronek-Kaziow/08,
AUTHOR = {Skowronek-Kazi{\'o}w, Joanna},
TITLE = {1,2 conjecture --- The multiplicative version},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {3-4},
PAGES = {93-95},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, total weighting, vertex colouring},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RSJDYC-4/1/eb9b1bd2b35cda9b05789806f88ee4f1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Laue-Matijevic/08,
AUTHOR = {Laue, S{\"o}ren and Matijevi{\'c}, Domagoj},
TITLE = {Approximating $k$-hop minimum spanning trees in Euclidean metrics},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {3-4},
PAGES = {96-101},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, minimum spanning trees, depth restriction},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RSJDYC-3/1/3b6c5a149c3d2ce22c527b056a712caf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Sun/08,
AUTHOR = {Zhang, Haihui and Sun, Zhiren},
TITLE = {On 3-choosability of planar graphs without certain cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {3-4},
PAGES = {102-106},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, choosability, planar graph, cycle},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RV17R1-1/1/388dce3810c255348aca107897c7ff1b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Montassier-Raspaud-Wang-Wang/08,
AUTHOR = {Montassier, Micka{\"e}l and Raspaud, Andr{\'e} and Wang, Weifan and Wang, Yingqian},
TITLE = {A relaxation of Havel's 3-color problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {3-4},
PAGES = {107-109},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RX0768-1/1/6c5456498fe8289689b442aed7dfa214},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fu/08,
AUTHOR = {Fu, Jung-Sheng},
TITLE = {Conditional fault Hamiltonicity of the complete graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {3-4},
PAGES = {110-113},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {conditional edge fault, complete graph, fault-tolerant embedding, hamiltonian cycle, hypercube, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RW43BC-1/1/6a9cd125f4897594888bd3ee9535ad13},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moss/08,
AUTHOR = {Moss, Lawrence S.},
TITLE = {Confusion of memory},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {3-4},
PAGES = {114-119},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, models of computation, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RW43BC-2/1/210bbc063050e0fd8e4e95f76678b02d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mitchell-Polishchuk/08,
AUTHOR = {Mitchell, Joseph S.B. and Polishchuk, Valentin},
TITLE = {Minimum-perimeter enclosures},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {3-4},
PAGES = {120-124},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, polygon optimization},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RY8ST5-1/1/70f0863ff0e16ccc7a96704392757b13},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Delbot-Laforest/08,
AUTHOR = {Delbot, Fran{\c{c}}ois and Laforest, Christian},
TITLE = {A better list heuristic for vertex cover},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {3-4},
PAGES = {125-127},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RY6WVS-1/1/6143a9e00644fbdc0b7f21be5b766323},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fitzgerald-Jones/08,
AUTHOR = {Fitzgerald, John S. and Jones, Cliff B.},
TITLE = {The connection between two ways of reasoning about partial functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {3-4},
PAGES = {128-132},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, specification languages, logic, partial functions, lpf, equality},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RY6WVS-3/1/84b4b024bc99f2e951fe813b1527d122},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dunkelman-Keller/08,
AUTHOR = {Dunkelman, Orr and Keller, Nathan},
TITLE = {Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {133-137},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, time-memory tradeoff attacks, time-memory-data tradeoff attacks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RY6WVS-2/2/8de6fab85c353272b62685763f6c215c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chan/08a,
AUTHOR = {Chan, Timothy M.},
TITLE = {Well-separated pair decomposition in linear time?},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {138-141},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, approximation algorithms, quadtrees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S85DPC-1/2/42cd5b28790be4b3df33aad870c8349d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wei-Lin-Lu-Shih/08,
AUTHOR = {Wei, Hsin-Wen and Lin, Kwei-Jay and Lu, Wan-Chen and Shih, Wei-Kuan},
TITLE = {Generalized rate monotonic schedulability bounds using relative period ratios},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {142-148},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {real-time systems, rate monotonic analysis, schedulability conditions},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RY6WVS-4/2/71afe80fbb74c1d78c351bb2de655001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mahajan-MN/08,
AUTHOR = {Mahajan, Meena and M.N., Jayalal Sarma},
TITLE = {Rigidity of a simple extended lower triangular matrix},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {149-153},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, computational complexity, matrix rank},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S0PKKY-1/2/2132806d571856f4cc4f97a285f34d37},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liedloff/08,
AUTHOR = {Liedloff, Mathieu},
TITLE = {Finding a dominating set on bipartite graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {154-157},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, dominating set, bipartite graphs, algorithms, exponential-time algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S0JN3P-1/2/89b0b833c890c9d764809c1dfa8e42b8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chao-Lin-Lin/08,
AUTHOR = {Chao, Yi-Hsiung and Lin, Shun-Shii and Lin, Kwei-Jay},
TITLE = {Schedulability issues for EDZL scheduling on real-time multiprocessor systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {158-164},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, real-time scheduling, edf, llf, edzl, schedulability analysis},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S2F5RS-1/2/796e0a9bff161d9210ce6509b4793266},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chiang-Wang-Tseng/08,
AUTHOR = {Chiang, M.L. and Wang, S.C. and Tseng, L.Y.},
TITLE = {The incremental agreement},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {165-170},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {byzantine agreement, fault diagnosis agreement, fault tolerance, distributed systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S0PKKY-2/2/02563e6a526715bb611b90c88788a5a4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lee-Tan-Hsu/08,
AUTHOR = {Lee, Chung-Meng and Tan, Jimmy J.M. and Hsu, Lih-Hsing},
TITLE = {Embedding Hamiltonian paths in hypercubes with a required vertex in a fixed position},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {171-176},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S0YXS7-1/2/cdef4fe6d6db31faf468cd1f55986149},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Majumder-Bhattacharya/08,
AUTHOR = {Majumder, Subhashis and Bhattacharya, Bhargab B.},
TITLE = {On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {177-182},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, analysis of algorithms, computational geometry},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S0PKKY-3/2/6dee9d4abaa14cc29afc0d50799dd837},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vieira-Buzato/08,
AUTHOR = {Vieira, Gustavo M.D. and Buzato, Luiz E.},
TITLE = {On the coordinator's rule for Fast Paxos},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {183-187},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems, crash-recovery, consensus, paxos},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S0PKKY-4/2/5d1ed9eed99e6a360e548098e5648f35},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Miyazaki/08,
AUTHOR = {Miyazaki, Takunari},
TITLE = {On the asymmetric complexity of the group-intersection problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {188-193},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, permutation groups},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S2667V-1/2/12730577011ce9e3384fa23a2462d657},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Arkin-Mitchell-Snoeyink/08,
AUTHOR = {Arkin, Esther M. and Mitchell, Joseph S.B. and Snoeyink, Jack},
TITLE = {Capturing crossings: Convex hulls of segment and plane intersections},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {5},
PAGES = {194-197},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, analysis of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S85DPC-2/2/c66120638b79f9814e1388e4516f901b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ausiello-Bonifaci-Laura/08,
AUTHOR = {Ausiello, Giorgio and Bonifaci, Vincenzo and Laura, Luigi},
TITLE = {The online Prize-Collecting Traveling Salesman Problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {6},
PAGES = {199-204},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, analysis of algorithms, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S0YXS7-2/2/9bf8673c717ec1dfd9ef48a79b29feed},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Chen/08,
AUTHOR = {Wang, Wen-Qing and Chen, Xie-Bin},
TITLE = {A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {6},
PAGES = {205-210},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hypercube, cycle, edge fault tolerance, hamiltonian cycle, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S2MJ08-1/2/593db5de9c896e37e19bb255e31975f6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shen-Jin/08,
AUTHOR = {Shen, Haibin and Jin, Yier},
TITLE = {Low complexity bit parallel multiplier for GF$(2^m)$ generated by equally-spaced trinomials},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {6},
PAGES = {211-215},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {shifted polynomial basis (spb), equally-spaced trinomial (est), karatsuba method, bit-parallel multiplier, cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S2MJ08-2/2/ff916b8bd6dafffde3e1e015688b568e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Loof-De_Baets-De_Meyer/08,
AUTHOR = {De Loof, K. and De Baets, B. and De Meyer, H.},
TITLE = {On the random generation of monotone data sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {6},
PAGES = {216-220},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, ordered sorting, monotone classification, monotone data sets, weak order extensions, markov chain monte carlo methods},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S2MJ08-4/2/c212471d66a124ecb18ffdcf68ea94a4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Canete-Valdeon-Enriquez-Ortega-Velaquez/08,
AUTHOR = {Ca{\~n}ete-Valde{\'o}n, Jos{\'e} M. and Enr{\'{i}}quez, Fernando and Ortega, Javier and Vel{\'a}quez, Ernesto},
TITLE = {Clarifying the semantics of value in use cases through Jackson's Problem Frames},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {6},
PAGES = {221-229},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software engineering, problem analysis, use cases, problem frames},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S39MRK-1/2/4a801e33223e42484e681284f20f2fdf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Andren-Hellstrom-Markstrom/08,
AUTHOR = {Andr{\'e}n, Daniel and Hellstr{\"o}m, Lars and Markstr{\"o}m, Klas},
TITLE = {Fast multiplication of matrices over a finitely generated semiring},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {6},
PAGES = {230-234},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {matrix multiplication, semirings},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S2MJ08-5/2/ab8555f0ab8d72392511fbe677981f5b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Engelhardt-Moses/08,
AUTHOR = {Engelhardt, Kai and Moses, Yoram},
TITLE = {Single-bit messages are insufficient for data link over duplicating channels},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {6},
PAGES = {235-239},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S3G40H-1/2/2636606a47a40337e3cfb4604592aafa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Goldwasser-Misra/08,
AUTHOR = {Goldwasser, Michael H. and Misra, Arundhati Bagchi},
TITLE = {A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {6},
PAGES = {240-245},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, on-line algorithms, preemption, scheduling},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S2MJ08-7/2/1244eec50535b457fb009b2a081149d0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Parhami/08,
AUTHOR = {Parhami, Behrooz},
TITLE = {On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {6},
PAGES = {246-251},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {chordal ring, double-ring network, hamiltonicity, interconnection networks, loop, parallel processing, petersen graph, ring, symmetric network},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S2MJ08-3/2/c6c61ae069ea227b103cfc7c84bd2e2d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sun-Zhang-Qian/08,
AUTHOR = {Sun, Li and Zhang, Fuji and Qian, Jianguo},
TITLE = {Multi-hop all-to-all optical routings in Cartesian product networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {6},
PAGES = {252-256},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, multi-hop, all-to-all routings, cartesian product},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S2MJ08-6/2/d9d6d6ab832d30ecbf49555c4acada41},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Chen/08,
AUTHOR = {Lin, Min-Sheng and Chen, Yung-Jui},
TITLE = {Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {107},
NUMBER = {6},
PAGES = {257-264},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, counting problems, interval graphs, minimum vertex covers, maximum minimal vertex covers},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4S32NRP-1/2/06f1ccedf38a62363bee853366b030c9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chatterjee-Henzinger/08,
AUTHOR = {Chatterjee, Krishnendu and Henzinger, Thomas A.},
TITLE = {Reduction of stochastic parity to stochastic mean-payoff games},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {1},
PAGES = {1-7},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal verification and model checking, stochastic games, parity objectives, mean-payoff objectives, formal methods},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PXP0XJ-1/1/e26353cfed3d51d9705302deac7a38f9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biskup-Embley-Lochner/08,
AUTHOR = {Biskup, Joachim and Embley, David W. and Lochner, Jan-Hendrik},
TITLE = {Reducing inference control to access control for normalized database schemas},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {1},
PAGES = {8-12},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {access control, controlled query evaluation, databases, inference control, safety/security in digital systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PPMXSN-2/1/bcdd301726518f3a5e889aa28def1ef1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Iliopoulos-Rahman/08,
AUTHOR = {Iliopoulos, Costas S. and Rahman, M. Sohel},
TITLE = {New efficient algorithms for the LCS and constrained LCS problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {1},
PAGES = {13-18},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, longest common subsequence},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PPW76B-1/1/996b96c1f189377878f72c66b0d115f8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sheu-Huang-Chen/08,
AUTHOR = {Sheu, Jyh-Jian and Huang, Wen-Tzeng and Chen, Chin-Hsing},
TITLE = {Strong diagnosability of regular networks under the comparison model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {1},
PAGES = {19-25},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {diagnosability, connectivity, pmc model, comparison model, t-diagnosable, strongly t-diagnosable},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R0CKK0-1/1/fcb637488fd934d23e87f050aa80685d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{He-Chen/08,
AUTHOR = {He, Weiping and Chen, Ing-Ray},
TITLE = {Proxy-based hybrid cache management in Mobile IP systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {1},
PAGES = {26-32},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {performance evaluation, mobile ip networks, cache consistency, query processing, mobility management, mobile applications},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PT7X6P-1/1/404161c8964c621efd1b9b94bad54cbc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Stewart/08,
AUTHOR = {Stewart, Iain A.},
TITLE = {On the fixed-parameter tractability of parameterized model-checking problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {1},
PAGES = {33-36},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, analysis of algorithms, fixed-parameter tractability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PSC2B1-1/1/41b51d5611415d6a320f04097c85dd06},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Georgakopoulos/08,
AUTHOR = {Georgakopoulos, George F.},
TITLE = {Chain-splay trees, or, how to achieve and prove loglog$N$-competitiveness by splaying},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {1},
PAGES = {37-43},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, splay trees, competitive analysis},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PTMXYS-1/1/b515b2641e56405d2c98aad2bb809885},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amtoft/08,
AUTHOR = {Amtoft, Torben},
TITLE = {Slicing for modern program structures: A theory for eliminating irrelevant loops},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {2},
PAGES = {45-51},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {program slicing, control dependence, observable behavior, simulation techniques, programming languages, compilers},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PV94D6-1/1/9bc8e38096855c449f239ea93d511160},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Shen-Li/08,
AUTHOR = {Li, Banghe and Shen, Yuefeng and Li, Bo},
TITLE = {A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {2},
PAGES = {52-58},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hausdorff distance, pattern recognition, computational geometry},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PW05F4-2/1/07ba238d12e997b7c043350fec2f1a86},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ma-Liu-Xu/08,
AUTHOR = {Ma, Meijie and Liu, Guizhen and Xu, Jun-Ming},
TITLE = {The super connectivity of augmented cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {2},
PAGES = {59-63},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, augmented cube, super connectivity, super edge-connectivity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PXM6FJ-1/1/2dfd506dd5a5957e7082a0a5975c5973},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shih-Chiang-Hsu-Tan/08,
AUTHOR = {Shih, Lun-Min and Chiang, Chieh-Feng and Hsu, Lih-Hsing and Tan, Jimmy J.M.},
TITLE = {Strong Menger connectivity with conditional faults on the class of hypercube-like networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {2},
PAGES = {64-69},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {strong menger connectivity, conditional faults, hypercube-like network, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R0CKK0-2/1/301f8b63cafed8077a0a79a6002c2840},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zheng-Xu-Zhang/08,
AUTHOR = {Zheng, Feifeng and Xu, Yinfeng and Zhang, E.},
TITLE = {How much can lookahead help in online single machine scheduling},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {2},
PAGES = {70-74},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online strategies, scheduling, lookahead},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PYP766-1/1/dd8557ec210c76b31c102bbe15681d05},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crochemore-Ilie/08,
AUTHOR = {Crochemore, Maxime and Ilie, Lucian},
TITLE = {Computing Longest Previous Factor in linear time and applications},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {2},
PAGES = {75-80},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, analysis of algorithms, strings, suffix array, longest common prefix, longest previous factor, lempel-ziv factorization, repetitions, runs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PYP766-2/1/b47099125517ce754b8244a7adea25ae},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guo-Niedermeier-Uhlmann/08,
AUTHOR = {Guo, Jiong and Niedermeier, Rolf and Uhlmann, Johannes},
TITLE = {Two fixed-parameter algorithms for Vertex Covering by Paths on Trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {2},
PAGES = {81-86},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, combinatorial problems, fixed-parameter tractability, exact algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PYP766-3/1/1d1e21f1c7021a6d983bbaa1ec8efcb7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Westphal/08,
AUTHOR = {Westphal, Stephan},
TITLE = {A note on the $k$-Canadian Traveller Problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {3},
PAGES = {87-89},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {routing, on-line algorithms, competitiveness},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PXDM6C-1/1/b1bdc4e33a1d885879c9f2fccb0e629f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berard-Chauve-Paul/08,
AUTHOR = {B{\'e}rard, S{\`e}verine and Chauve, Cedric and Paul, Christophe},
TITLE = {A more efficient algorithm for perfect sorting by reversals},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {3},
PAGES = {90-95},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, sorting by reversals, common intervals},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R1MF55-1/1/127e7acbdf83474af7b05a79f87204ba},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vajnovszki/08,
AUTHOR = {Vajnovszki, Vincent},
TITLE = {More restrictive Gray codes for necklaces and Lyndon words},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {3},
PAGES = {96-99},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {necklaces, lyndon words, gray codes, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R0KTBB-1/1/0eacc227d5f35edaa3a650385291f122},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Danvy-Millikin/08,
AUTHOR = {Danvy, Olivier and Millikin, Kevin},
TITLE = {On the equivalence between small-step and big-step abstract machines: A simple application of lightweight fusion},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {3},
PAGES = {100-109},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {program derivation, programming calculi, programming languages, abstract machines, warm fusion, refocusing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R0CKK0-3/1/254affd74c43d32c816b373bada9022d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baswana/08,
AUTHOR = {Baswana, Surender},
TITLE = {Streaming algorithm for graph spanners --- Single pass and constant processing time per edge},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {3},
PAGES = {110-114},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, on-line algorithms, streaming, spanner, shortest path},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R40SRG-1/1/8fba92e19e5d552928bab0ef23407264},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rahn/08,
AUTHOR = {Rahn, Mirko},
TITLE = {More decidable instances of Post's correspondence problem: Beyond counting},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {3},
PAGES = {115-119},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {post correspondence problem, context-free language, decidability, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R40SRG-2/1/b97517610fdb24b9bd84c1b31054e08d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Massart-Meuter-Van_Begin/08,
AUTHOR = {Massart, Thierry and Meuter, C{\'e}dric and Van Begin, Laurent},
TITLE = {On the complexity of partial order trace model checking},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {3},
PAGES = {120-126},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, distributed systems, formal methods},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R40SRG-3/1/b374572753d0f66a910ce07f73a91c98},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mohamed-Ramakrishna/08,
AUTHOR = {Mohamed, Adnan and Ramakrishna, R.S.},
TITLE = {Linear election in pancake graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {3},
PAGES = {127-131},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed algorithms, election, pancake graph, algorithms, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R466HF-1/1/dd233e7f40b167712abe613df1108c3e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Furmanczyk-Kosowski-Zylinski/08,
AUTHOR = {Furma{\'n}czyk, Hanna and Kosowski, Adrian and {\.Z}yli{\'n}ski, Pawe{\l}},
TITLE = {A note on mixed tree coloring},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {4},
PAGES = {133-135},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, mixed graph coloring, trees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R40SRG-4/1/d04b35daadb87ec67efac33820ccb01d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Das-Nandy/08,
AUTHOR = {Das, Gautam K. and Nandy, Subhas C.},
TITLE = {Weighted broadcast in linear radio networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {4},
PAGES = {136-143},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, weighted broadcast, linear network},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R41J43-3/1/d56d818585a5ada5ce4648116335ed60},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diaz-Lotker-Serna/08,
AUTHOR = {D{\'{i}}az, Josep and Lotker, Zvi and Serna, Maria},
TITLE = {The distant-2 chromatic number of random proximity and random geometric graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {4},
PAGES = {144-148},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graph algorithms, random graphs, coloring, distant-2 coloring},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R41J43-1/1/486fa0f673b70be50642974edf3d7c98},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bernath-Joret/08,
AUTHOR = {Bern{\'a}th, Attila and Joret, Gwena{\"e}l},
TITLE = {Well-balanced orientations of mixed graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {4},
PAGES = {149-151},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, well-balanced orientation, mixed graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R41J43-2/1/65eea85e82e66c9b6bfc5ff8595747ed},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Saia-Young/08,
AUTHOR = {Saia, Jared and Young, Maxwell},
TITLE = {Reducing communication costs in robust peer-to-peer networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {4},
PAGES = {152-158},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, distributed computing, fault-tolerance, peer-to-peer, adaptive adversary},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R41J43-4/1/b622c04eeccc42c630c2af2d295f8ac7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fan-Jin/08,
AUTHOR = {Fan, GaoJun and Jin, ShiYao},
TITLE = {A simple coverage-evaluating approach for wireless sensor networks with arbitrary sensing areas},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {4},
PAGES = {159-161},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {sensor network, computational geometry, k-coverage, arbitrary sensing areas},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R53T43-1/1/e943988c97838ab31cf0ca56c9729393},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Szepietowski/08,
AUTHOR = {Szepietowski, Andrzej},
TITLE = {Fooling Turing machines with sublogarithmic space: A note on ``For completeness, sublogarithmic space is no space'' by M. Agrawal},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {4},
PAGES = {162-163},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, sublogarithmic space},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R53T43-2/1/d1aebc0961b101e591c170c08d956f65},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Durand-Hermann/08,
AUTHOR = {Durand, Arnaud and Hermann, Miki},
TITLE = {On the counting complexity of propositional circumscription},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {4},
PAGES = {164-170},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, counting complexity, propositional circumscription, horn, dual horn, bijunctive, and affine formulas, hypergraph transversal},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R53T43-3/1/eedc30806e43b0b41b8d3a76def21e82},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bollig/08,
AUTHOR = {Bollig, Beate},
TITLE = {The optimal read-once branching program complexity for the direct storage access function},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {4},
PAGES = {171-174},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, lower bounds, read-once branching programs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R5F070-1/1/5f6c681f125218b93640787645acfd4d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kurosaki/08,
AUTHOR = {Kurosaki, Tetsuo},
TITLE = {Direct definition of a ternary infinite square-free sequence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {5},
PAGES = {175-179},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {thue-morse sequence, square-free sequence, automatic sequence, combinatorial problems, symbolic dynamics},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R644RR-3/1/888c9548fb05ac1dbcc4acb110358cb2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Collette-Cucu-Goossens/08,
AUTHOR = {Collette, S{\'e}bastien and Cucu, Liliana and Goossens, Jo{\"e}l},
TITLE = {Integrating job parallelism in real-time scheduling theory},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {5},
PAGES = {180-187},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {real-time systems, scheduling, multiprocessor systems, parallel systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R644RR-1/1/f569d0193246344aec98e92f5ea7684c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wu/08,
AUTHOR = {Wu, Xiaodong},
TITLE = {Efficient intensity map splitting algorithms for intensity-modulated radiation therapy},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {5},
PAGES = {188-194},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {intensity map splitting, k-link shortest paths, algorithms, imrt, computational medicine},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R53WFR-1/1/bbf3f0d0c6ae4949fc8564a875a4bb35},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rapaport-Suchan-Todinca/08,
AUTHOR = {Rapaport, Ivan and Suchan, Karol and Todinca, Ioan},
TITLE = {Minimal proper interval completions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {5},
PAGES = {195-202},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, proper interval graphs, minimal proper interval completions, bandwidth},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R644RR-2/1/3e4fe9e6ee136df241ff531d36ebad76},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nutov-Reichman/08,
AUTHOR = {Nutov, Zeev and Reichman, Daniel},
TITLE = {Approximating maximum satisfiable subsystems of linear equations of bounded width},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {5},
PAGES = {203-207},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {linear equations, satisfiable systems, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R5W02C-1/1/3101754ee2b4cf3d8237bd186e30b75d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gradwohl-Yehudayoff/08,
AUTHOR = {Gradwohl, Ronen and Yehudayoff, Amir},
TITLE = {$t$-wise independence with local dependencies},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {5},
PAGES = {208-212},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, limited independence, large deviation bounds},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R5F070-2/1/5b4261a46cb80556a23ec991d7abc69d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Arslan/08,
AUTHOR = {Arslan, Abdullah N.},
TITLE = {An algorithm with linear expected running time for string editing with substitutions and substring reversals},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {5},
PAGES = {213-218},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, edit distance, substring (block) reversal, dynamic programming, expected running time},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R8MDW3-1/1/d89b0c4b005a73754d115e269822fa86},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vogler/08,
AUTHOR = {Vogler, Walter},
TITLE = {Another short proof of optimality for the MIN cache replacement algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {5},
PAGES = {219-220},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, caching},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R9GGXC-2/1/fe46e898eafd752203ed665308c1f69e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chicano-Alba/08,
AUTHOR = {Chicano, Francisco and Alba, Enrique},
TITLE = {Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {6},
PAGES = {221-231},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {program correctness, ant colony optimization, metaheuristics, model checking, hsf-spin},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R7J65P-1/1/f9083466be55556c0d91c63d9586c990},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Klein/08,
AUTHOR = {Klein, Shmuel T.},
TITLE = {Should one always use repeated squaring for modular exponentiation?},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {6},
PAGES = {232-237},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, modular exponentiation, fibonacci number system, cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R7RS80-1/1/621c42496d5f5ad8576b023551d7550e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Solomonoff/08,
AUTHOR = {Solomonoff, Ray J.},
TITLE = {The probability of ``undefined'' (non-converging) output in generating the universal probability distribution},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {6},
PAGES = {238-240},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithmic probability, analysis of algorithms, halting problem, incomputable, kolmogorov complexity, normalization, theory of computation, turing machine, universal probability distribution, universal turing machine},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R8NBG1-1/1/69506a2d3760c78e3755661fb5fedbf1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moser/08b,
AUTHOR = {Moser, Philippe},
TITLE = {Resource-bounded measure on probabilistic classes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {6},
PAGES = {241-245},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {resource-bounded measure, probabilistic complexity classes, computational complexity, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R9GGXC-1/1/0a61b3f02924c949d60dd3d28925c725},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rijmen-Barreto-Filho/08,
AUTHOR = {Rijmen, Vincent and Barreto, Paulo S.L.M. and Filho, D{\'e}cio L. Gazzoni},
TITLE = {Rotation symmetry in algebraically generated cryptographic substitution tables},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {6},
PAGES = {246-250},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, s-box, finite field},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R8WK24-1/1/c4ad9eccd15f5f47b5b29b81598d7708},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Telelis-Zissimopoulos/08,
AUTHOR = {Telelis, Orestis A. and Zissimopoulos, Vassilis},
TITLE = {Dynamic bottleneck optimization for $k$-edge and 2-vertex connectivity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {6},
PAGES = {251-257},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, dynamic graph algorithms, graph connectivity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4R9JTY3-1/1/3f70950be2e9b405543aff4372b588a5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mamut-Vumar/08,
AUTHOR = {Mamut, Aygul and Vumar, Elkin},
TITLE = {Vertex vulnerability parameters of Kronecker products of complete graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {106},
NUMBER = {6},
PAGES = {258-262},
YEAR = {2008},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, kronecker product, cut set, vertex vulnerability parameters},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RC2NSX-1/1/095baae93749029fb1372486b8153afe},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}