@article{Wu-Du-Jia-Li-Huang/06,
AUTHOR = {Wu, Weili and Du, Hongwei and Jia, Xiaohua and Li, Yingshu and Huang, Scott C.-H.},
TITLE = {Minimum connected dominating sets and maximal independent sets in unit disk graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {1-7},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {connected dominating set, independent set, unit disk graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HGM986-1/2/83f98becaeae234f39bbeff32a8c5f82},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hitczenko-Johnson-Huang/06,
AUTHOR = {Hitczenko, Pawel and Johnson, Jeremy R. and Huang, Hung-Jen},
TITLE = {Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {8-30},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automated performance tuning, performance models, algorithm search space, walsh-hadamard transform, divide and conquer recurrences, random compositions, martingales, central limit theorem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HDGKH3-1/2/75b0d551f80c1135791fe2cd63eb2bdf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Glen/06,
AUTHOR = {Glen, Amy},
TITLE = {Occurrences of palindromes in characteristic Sturmian words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {31-46},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, characteristic sturmian word, singular word, palindrome, morphism, return word, overlap},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HJYXWD-2/2/dfaab401804953d55c5d2f35dea370f5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zverovich/06a,
AUTHOR = {Zverovich, Igor Edm.},
TITLE = {Satgraphs and independent domination. Part 1},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {47-56},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {satgraphs, satisfiability problem, hereditary class of graphs, forbidden induced subgraph characterization, independent domination problem, polar graphs, perfect graphs, np-complete, polynomial-time algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HSXV6P-1/2/df14b92a64ac6229ee6badc3dd8a6fba},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tanaka/06a,
AUTHOR = {Tanaka, Genjiro},
TITLE = {On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {57-70},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {group code, bifix code, syntactic monoid, completely simple semigroup},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HHPBRW-3/2/538f6b6d33ae9e94d9a6345718672d3a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xavier-Miyazawa/06a,
AUTHOR = {Xavier, E.C. and Miyazawa, F.K.},
TITLE = {Approximation schemes for knapsack problems with shelf divisions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {71-84},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, approximation schemes, knapsack problem, shelf packing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HJ41PX-2/2/67661ce6a95159a57d931ae8cb1aef89},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mubayi-Turan-Zhao/06,
AUTHOR = {Mubayi, Dhruv and Tur{\'a}n, Gy{\"o}rgy and Zhao, Yi},
TITLE = {The DNF exception problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {85-96},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {disjunctive normal form, updating, occam algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HHX2C4-2/2/2a7b70a90871913cee55ee88f1566fa6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Terrier/06,
AUTHOR = {Terrier, V{\'e}ronique},
TITLE = {Closure properties of cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {97-107},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, closure properties, real time and linear time classes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HHX2C4-3/2/41c172b3701dc8f29dc489c5c1442bf5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dal_Palu-Pontelli-Ranjan/06,
AUTHOR = {Dal Pal{\'u}, A. and Pontelli, E. and Ranjan, D.},
TITLE = {Sequential and parallel algorithms for the NCA problem on pure pointer machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {108-135},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {nearest common ancestor, dynamic data structures, pointer machines},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HNS5DK-2/2/a10ac0207aa76a74e2f2cd0a3d5b502f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Poblete-Ian_Munro-Papadakis/06,
AUTHOR = {Poblete, Patricio V. and Ian Munro, J. and Papadakis, Thomas},
TITLE = {The binomial transform and the analysis of skip lists},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {136-158},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {binomial transform, skip lists, analysis of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HM7YBK-1/2/b3a9a5d660ae6888aa5e245b9790ae50},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ferbus-Zanda-Grigorieff/06,
AUTHOR = {Ferbus-Zanda, Marie and Grigorieff, Serge},
TITLE = {Kolmogorov complexities $K_{max}$, $K_{min}$ on computable partially ordered sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {159-180},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {kolmogorov complexity, infinite computation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HNS7HD-1/2/55fe127e539a79d0a9e45ed4dde1656b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Papakonstantinou/06,
AUTHOR = {Papakonstantinou, Periklis A.},
TITLE = {Hierarchies for classes of priority algorithms for job scheduling},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {181-189},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {greedy algorithm, classes, algorithmic paradigms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HRDXC0-1/2/956f0b6f9bdbf3f6b02737ffb3154b09},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Colcombet-Niwinski/06,
AUTHOR = {Colcombet, Thomas and Niwi{\'n}ski, Damian},
TITLE = {On the positional determinacy of edge-labeled games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {190-196},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parity games, positional determinacy, winning condition},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HPD9VM-3/2/1ffc56f7fde63bc7158b25aa611c12ab},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bao-Hwang-Li/06,
AUTHOR = {Bao, Xuewen and Hwang, Frank K. and Li, Qiao},
TITLE = {Rearrangeability of bit permutation networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {197-214},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {multistage interconnection network, rearrangeability, layered cross product, permutation, balanced matrix},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HPD9VM-2/2/627f78560b3e919ce02fd66d796614b6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zverovich-Zverovich/06,
AUTHOR = {Zverovich, Igor {\'E}. and Zverovich, Olga I.},
TITLE = {Independent domination in hereditary classes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {215-225},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {independent domination, satgraph, np-complete problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HSY3F3-1/2/5894d25b1f0f833bd370e846a8839586},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moothathu/06,
AUTHOR = {Moothathu, T.K. Subrahmonian},
TITLE = {Set of periods of additive cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {226-231},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {additive cellular automata, set of periods, binomial coefficient},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HV72FW-1/2/d2b68526b6c1a907bfeaf58672fe5d69},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Guo-Hwang/06,
AUTHOR = {Chang, F.H. and Guo, J.Y. and Hwang, F.K.},
TITLE = {Wide-sense nonblocking for multi-$\log_d N$ networks under various routing strategies},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {232-239},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HV72FW-2/2/933f8bb32d0532e0d984709a9fd36bec},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huynh-Hon-Lam-Sung/06,
AUTHOR = {Huynh, Trinh N.D. and Hon, Wing-Kai and Lam, Tak-Wah and Sung, Wing-Kin},
TITLE = {Approximate string matching using compressed suffix arrays},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {240-249},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HVDMDH-1/2/e6c45e1e1a3f83b38448c1ce116b4462},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Frederickson-Solis-Oba/06,
AUTHOR = {Frederickson, Greg N. and Solis-Oba, Roberto},
TITLE = {Efficient algorithms for robustness in resource allocation and scheduling problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {250-265},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {robustness, optimization, scheduling, partition matroid},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HV72FW-4/2/6b1d0b7681f20d8742a3e09ccb91e5aa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Navarro-Chavez/06,
AUTHOR = {Navarro, Gonzalo and Ch{\'a}vez, Edgar},
TITLE = {A metric index for approximate string matching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {266-279},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {indexed approximate string matching, metric spaces, metric indexes, suffix trees, suffix arrays},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HXBGSH-1/2/889a42ca051eca9d71743577b1672cc4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhao-Dong-Wang/06,
AUTHOR = {Zhao, Zhu and Dong, Zhongqi and Wang, Yongge},
TITLE = {Security analysis of a password-based authentication protocol proposed to IEEE 1363},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {280-287},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {password-based key agreement, dictionary attacks, autha, eke},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HWXD73-1/2/1a9eb5c3484f0b89f5156b91e3bebbd3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Youssef-Gong/06,
AUTHOR = {Youssef, A.M. and Gong, G.},
TITLE = {On linear complexity of sequences over $GF(2^n)$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {288-292},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {linear complexity, berlekamp-massey algorithm, cryptanalysis, finite fields},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J1JFHX-4/2/2ac12edd605ebfafd5db858e00b86e53},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ballet/06,
AUTHOR = {Ballet, S.},
TITLE = {An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {293-305},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithm, bilinear complexity, finite fields, algebraic function fields, algebraic curves},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J1JFHX-6/2/8c0f70465c17b766011ffe590d990b05},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brlek-Dulucq-Ladouceur-Vuillon/06,
AUTHOR = {Brlek, S. and Dulucq, S. and Ladouceur, A. and Vuillon, L.},
TITLE = {Combinatorial properties of smooth infinite words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {306-317},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics, smooth words, kolakoski word, substitutions},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J2KP04-1/2/a5b6a8c3beca2de18d8786b07d9e321d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hajiaghayi-Leighton/06,
AUTHOR = {Hajiaghayi, M.T and Leighton, Tom},
TITLE = {On the max-flow min-cut ratio for directed multicommodity flows},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {318-321},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithm, directed graph, multicommodity flow and multicut},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HHPBRW-4/2/76ace8add06233591dfc97e58329834e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhu-Wang/06,
AUTHOR = {Zhu, Daming and Wang, Lusheng},
TITLE = {On the complexity of unsigned translocation distance},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {322-328},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {unsigned translocation, np-hardness, inapproximability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HSY3F3-2/2/8cc741416daba00a4d270fb3763d62f9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tomescu/06,
AUTHOR = {Tomescu, Ioan},
TITLE = {A characterization of the words occurring as factors in a minimum number of words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {329-331},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {word, factor, injective proof, autocorrelation polynomial},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J1JFHX-3/2/dca5c138a43d1a74cd4b3095fddd5dbb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Das-Das-Nandy/06,
AUTHOR = {Das, Gautam K. and Das, Sandip and Nandy, Subhas C.},
TITLE = {Range assignment for energy efficient broadcasting in linear radio networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {332-341},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {range assignment, broadcast, mobile communication, algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J1JFHX-5/2/2e289ccc85cadbee7f64ca0bbdebfbe9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ibarra-Dang/06,
AUTHOR = {Ibarra, Oscar H. and Dang, Zhe},
TITLE = {On the solvability of a class of diophantine equations and applications},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {342-346},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {diophantine equation, counter machine},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J1JFHX-7/2/74ba97b5841de4c93a0b7841f7be6e55},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krumke-de_Paepe-Poensgen-Stougie/06,
AUTHOR = {Krumke, Sven O. and de Paepe, Willem E. and Poensgen, Diana and Stougie, Leen},
TITLE = {Erratum to ''News from the online traveling repairman''},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {352},
NUMBER = {1-3},
PAGES = {347-348},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, competitive analysis, traveling repairman, latency, dial-a-ride problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4HVDMDH-2/2/4e331694878302a727cb5e2e09f5d1b9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Originally in Theor.~Comput.~Sci., Vol. 295, 2003, No. 1-3, 279-294},
}