@article{Chen-Chen-Samatova-Peng-Wang-Tang/14,
AUTHOR = {Chen, Wenbin and Chen, Zhengzhang and Samatova, Nagiza F. and Peng, Lingxi and Wang, Jianxiong and Tang, Maobin},
TITLE = {Solving the maximum duo-preservation string mapping problem with linear programming},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {530},
PAGES = {1-11},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514001108},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mansour-Patt-Shamir-Rawitz/14,
AUTHOR = {Mansour, Yishay and Patt-Shamir, Boaz and Rawitz, Dror},
TITLE = {Competitive router scheduling with structured data},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {530},
PAGES = {12-22},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514001121},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hanada-Kudo-Nakamura/14,
AUTHOR = {Hanada, Hiroyuki and Kudo, Mineichi and Nakamura, Atsuyoshi},
TITLE = {Average-case linear-time similar substring searching by the $q$-gram distance},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {530},
PAGES = {23-41},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514001285},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blanchet-Sadri-Jiao-Machacek-Quigley-Zhang/14,
AUTHOR = {Blanchet-Sadri, F. and Jiao, Yang and Machacek, John M. and Quigley, J.D. and Zhang, Xufan},
TITLE = {Squares in partial words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {530},
PAGES = {42-57},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514001297},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Teng/14,
AUTHOR = {Lin, Cheng-Kuan and Teng, Yuan-Hsiang},
TITLE = {The diagnosability of triangle-free graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {530},
PAGES = {58-65},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514001303},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blin-Bonizzoni-Dondi-Rizzi-Sikora/14,
AUTHOR = {Blin, Guillaume and Bonizzoni, Paola and Dondi, Riccardo and Rizzi, Romeo and Sikora, Florian},
TITLE = {Complexity insights of the {\sc Minimum Duplication} problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {530},
PAGES = {66-79},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514001315},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liao-Huang/14,
AUTHOR = {Liao, Chung-Shou and Huang, Yamming},
TITLE = {The Covering Canadian Traveller Problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {530},
PAGES = {80-88},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514001327},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chierichetti-Kumar-Mahdian/14,
AUTHOR = {Chierichetti, Flavio and Kumar, Ravi and Mahdian, Mohammad},
TITLE = {The complexity of LSH feasibility},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {530},
PAGES = {89-101},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514001467},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}