@article{Fried-Shimony-Benbassat-Wenner/13,
AUTHOR = {Fried, Dror and Shimony, Solomon Eyal and Benbassat, Amit and Wenner, Cenny},
TITLE = {Complexity of Canadian traveler problem variants},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {487},
PAGES = {1-16},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {canadian traveler problem, complexity of navigation under uncertainty, stochastic shortest path with recourse},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002296},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vazquez_de_Parga-Garcia-Lopez/13,
AUTHOR = {V{\'a}zquez de Parga, Manuel and Garc{\'{i}}a, Pedro and L{\'o}pez, Dami{\'a}n},
TITLE = {A polynomial double reversal minimization algorithm for deterministic finite automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {487},
PAGES = {17-22},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dfa minimization, atomic automata, polynomial double reversal algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513001965},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Carrasco-Le_Bars-Viola/13,
AUTHOR = {Carrasco, Nicol{\'a}s and Le Bars, Jean-Marie and Viola, Alfredo},
TITLE = {Enumerative encoding of correlation-immune Boolean functions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {487},
PAGES = {23-36},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {enumerative encoding, uniform random generation, decomposable structures, boolean functions, correlation-immune functions, 1-resilient functions},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513001588},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ndione-Lemay-Niehren/13,
AUTHOR = {Ndione, Antoine and Lemay, Aur{\'e}lien and Niehren, Joachim},
TITLE = {Approximate membership for regular languages modulo the edit distance},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {487},
PAGES = {37-49},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata, probabilistic algorithms, property testing, regular word languages},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513001953},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Campos-Havet-Sampaio-Silva/13,
AUTHOR = {Campos, Victor and Havet, Fr{\'e}d{\'e}ric and Sampaio, Rudini and Silva, Ana},
TITLE = {Backbone colouring: Tree backbones with small diameter in planar graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {487},
PAGES = {50-64},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {backbone colouring, planar graphs, broersma's conjecture},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513001941},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Early-Schellekens/13,
AUTHOR = {Early, D. and Schellekens, M.},
TITLE = {Running time of the Treapsort algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {487},
PAGES = {65-73},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {average-case analysis of algorithms, smoothed complexity, sorting algorithms, moqa},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002132},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shao-Solis-Oba/13,
AUTHOR = {Shao, Zhendong and Solis-Oba, Roberto},
TITLE = {$L2,1$-labelings on the modular product of two graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {487},
PAGES = {74-81},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {frequency assignment, l ( 2 , 1 ) -labeling, graph modular product},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513001114},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Couturier-Heggernes-van_t_Hof-Kratsch/13,
AUTHOR = {Couturier, Jean-Fran{\c{c}}ois and Heggernes, Pinar and van 't Hof, Pim and Kratsch, Dieter},
TITLE = {Minimal dominating sets in graph classes: Combinatorial bounds and enumeration},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {487},
PAGES = {82-94},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {minimal dominating sets, enumeration algorithms, combinatorial bounds, graph classes},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002508},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yu-Wong/13,
AUTHOR = {Yu, Sheng and Wong, Prudence W.H.},
TITLE = {Online scheduling of simple linear deteriorating jobs to minimize the total general completion time},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {487},
PAGES = {95-102},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online scheduling, competitive analysis, simple linear deterioration, total general completion time, single machine, release time},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513001564},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brandstadt-Brito-Klein-Nogueira-Protti/13a,
AUTHOR = {Brandst{\"a}dt, Andreas and Brito, Synara and Klein, Sulamita and Nogueira, Loana Tito and Protti, F{\'a}bio},
TITLE = {Corrigendum to ``Cycle transversals in perfect graphs and cographs''},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {487},
PAGES = {103-105},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cycle transversals, cographs, feedback vertex set, perfect graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002351},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Originally in Theor.~Comput.~Sci., Vol. 469, 2013, 15-23},
}