@article{Cantone-Hofri/13,
AUTHOR = {Cantone, Domenico and Hofri, Micha},
TITLE = {Further analysis of the remedian algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {495},
PAGES = {1-16},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {median selection problem, remedian algorithm, approximate algorithms, probabilistic analysis, asymptotic bounds},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513004519},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bucci-De_Luca-Zamboni/13,
AUTHOR = {Bucci, Michelangelo and De Luca, Alessandro and Zamboni, Luca Q.},
TITLE = {Reversible Christoffel factorizations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {495},
PAGES = {17-24},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sturmian word, christoffel word, reversible christoffel factorization, three-interval exchange transformation},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513004544},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dehghan-Sadeghi-Ahadi/13,
AUTHOR = {Dehghan, Ali and Sadeghi, Mohammad-Reza and Ahadi, Arash},
TITLE = {Algorithmic complexity of proper labeling problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {495},
PAGES = {25-36},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {proper labeling, computational complexity, multiplicative vertex-coloring weightings, gap vertex-distinguishing edge colorings, fictional coloring, vertex-labeling by maximum, 1, 2, 3-conjecture, multiplicative 1, 2, 3-conjecture},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513003988},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dereniowski-Dyer/13,
AUTHOR = {Dereniowski, Dariusz and Dyer, Danny},
TITLE = {On minimum cost edge searching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {495},
PAGES = {37-49},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithm, graph searching, minimum cost, monotonicity, search strategy},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513004635},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elzinga-Wang/13,
AUTHOR = {Elzinga, Cees H. and Wang, Hui},
TITLE = {Versatile string kernels},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {495},
PAGES = {50-65},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {string kernel, string matching, subsequences, gap-penalizing, soft matching, run-length encoding, partial rankings},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751300460X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Adar-Epstein/13,
AUTHOR = {Adar, Ron and Epstein, Leah},
TITLE = {Selfish bin packing with cardinality constraints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {495},
PAGES = {66-80},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic game theory, variants of bin packing, price of anarchy},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513004532},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cordon-Franco-van_Ditmarsch-Fernandez-Duque-Soler-Toscano/13,
AUTHOR = {Cord{\'o}n-Franco, Andr{\'e}s and van Ditmarsch, Hans and Fern{\'a}ndez-Duque, David and Soler-Toscano, Fernando},
TITLE = {A colouring protocol for the generalized Russian cards problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {495},
PAGES = {81-95},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cryptography, information protocol, secret exchange},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513003617},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gu-Lu/13,
AUTHOR = {Gu, Manzhan and Lu, Xiwen},
TITLE = {The expected asymptotical ratio for preemptive stochastic online problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {495},
PAGES = {96-112},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, online algorithm, asymptotical optimality, uniform machines},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513004477},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}