@article{Gritti-Susilo-Plantard-Win/15,
AUTHOR = {Gritti, Cl{\'e}mentine and Susilo, Willy and Plantard, Thomas and Win, Khin Than},
TITLE = {Privacy-preserving encryption scheme using DNA parentage test},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {580},
PAGES = {1-13},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {attribute-based encryption, chosen-ciphertext security, collusion resistance},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515001188},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Muller-Jiang/15,
AUTHOR = {M{\"u}ller, Johannes and Jiang, Hengrui},
TITLE = {Graphical limit sets for general cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {580},
PAGES = {14-27},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {cellular automata, graphical limit sets},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515001528},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xie-Xu-Zhang-Bai/15,
AUTHOR = {Xie, Fang and Xu, Zhe and Zhang, Yuzhong and Bai, Qingguo},
TITLE = {Scheduling games on uniform machines with activation cost},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {580},
PAGES = {28-35},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {uniform machine scheduling, cost sharing games, price of anarchy, price of stability, nash equilibrium},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751500153X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ji-Yang-Yao-Cheng/15,
AUTHOR = {Ji, Min and Yang, Qinyun and Yao, Danli and Cheng, T.C.E.},
TITLE = {Single-machine batch scheduling of linear deteriorating jobs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {580},
PAGES = {36-49},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {scheduling, deteriorating jobs, batch, np-hardness, fptas, non-approximability},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515001553},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bu-Bao/15,
AUTHOR = {Bu, Yuehua and Bao, Xudong},
TITLE = {Backbone coloring of planar graphs for $C8$-free or $C9$-free},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {580},
PAGES = {50-58},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {planar graph, backbone coloring, spanning tree, cycle},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515001565},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yang-Liu-Wang-Makeig/15,
AUTHOR = {Yang, Yu and Liu, Hongbo and Wang, Hua and Makeig, Scott},
TITLE = {Enumeration of BC-subtrees of trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {580},
PAGES = {59-74},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {block-cutpoint-tree, bicolorable tree, bc-subtrees, extremal trees, middle part, enumeration},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515001589},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Damaschke/15,
AUTHOR = {Damaschke, Peter},
TITLE = {Finding and enumerating large intersections},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {580},
PAGES = {75-82},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {intersection, disjoint sets, enumeration, family of sets, parameterized algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751500170X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Istrate/15,
AUTHOR = {Istrate, Gabriel},
TITLE = {Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {580},
PAGES = {83-93},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {discrete complex systems, lights-out games, reachability},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515001711},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Braunschvig-Chechik-Peleg-Sealfon/15,
AUTHOR = {Braunschvig, Gilad and Chechik, Shiri and Peleg, David and Sealfon, Adam},
TITLE = {Fault tolerant additive and $(\mu,\alpha)$-spanners},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {580},
PAGES = {94-100},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {fault tolerance, spanners, additive spanners, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515001723},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amini-Coudert-Nisse/15,
AUTHOR = {Amini, Omid and Coudert, David and Nisse, Nicolas},
TITLE = {Non-deterministic graph searching in trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {580},
PAGES = {101-121},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {graph searching, treewidth, pathwidth, trees},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515001747},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}