@article{Crespelle-Gambette/14,
AUTHOR = {Crespelle, Christophe and Gambette, Philippe},
TITLE = {(Nearly-)tight bounds on the contiguity and linearity of cographs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {522},
PAGES = {1-12},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {contiguity, linearity, cographs, graph encoding},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008803},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bopardikar-Suri/14,
AUTHOR = {Bopardikar, Shaunak D. and Suri, Subhash},
TITLE = {$k$-capture in multiagent pursuit evasion, or the lion and the hyenas},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {522},
PAGES = {13-23},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {pursuit-evasion games, algorithms, multiagent systems, convex hull, k-hull},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008918},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Shen-Dong-Jiang/14,
AUTHOR = {Zhang, Yi-Hao and Shen, Yue-Hong and Dong, Min and Jiang, Yi-Min},
TITLE = {A method of batching conflict routings in shuffle-exchange networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {522},
PAGES = {24-33},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {covering function, eigenfunction, least no-conflict routing grouping, maximal no-conflict routing group, shuffle-exchange network},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008943},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dabrowski-Golovach-Paulusma/14,
AUTHOR = {Dabrowski, Konrad K. and Golovach, Petr A. and Paulusma, Daniel},
TITLE = {Colouring of graphs with Ramsey-type forbidden subgraphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {522},
PAGES = {34-43},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {colouring, independent set, clique, forbidden induced subgraphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009067},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Plociennik/14,
AUTHOR = {Plociennik, Kai},
TITLE = {A probabilistic PTAS for shortest common superstring},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {522},
PAGES = {44-53},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {shortest common superstring, approximation, average-case analysis, semi-random input, greedy superstring},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009079},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Wu-Wu/14,
AUTHOR = {Wang, Huijuan and Wu, Lidong and Wu, Jianliang},
TITLE = {Total coloring of planar graphs with maximum degree 8},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {522},
PAGES = {54-61},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {planar graph, total coloring, cycle},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009080},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Egidi-Manzini/14,
AUTHOR = {Egidi, Lavinia and Manzini, Giovanni},
TITLE = {Design and analysis of periodic multiple seeds},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {522},
PAGES = {62-76},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {spaced seed, difference set, difference family, steiner system, approximate string matching, lossless filtration},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009092},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duval-Lecroq-Lefebvre/14,
AUTHOR = {Duval, J.-P. and Lecroq, T. and Lefebvre, A.},
TITLE = {Linear computation of unbordered conjugate on unordered alphabet},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {522},
PAGES = {77-84},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, border, conjugate, unbordered word, unordered alphabet},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009109},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feng-Wang-Chen/14,
AUTHOR = {Feng, Qilong and Wang, Jianxin and Chen, Jianer},
TITLE = {Matching and weighted $P_2$-packing: Algorithms and kernels},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {522},
PAGES = {85-94},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterized algorithm, kernelization, weighted p 2 -packing, matching},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009237},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Greco-Scarcello/14,
AUTHOR = {Greco, Gianluigi and Scarcello, Francesco},
TITLE = {Tree projections and structural decomposition methods: Minimality and game-theoretic characterization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {522},
PAGES = {95-114},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {structural decomposition methods, treewidth, generalized hypertree width, games on hypergraphs, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009249},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}