@article{Fernau-Fomin-Philip-Saurabh/15,
AUTHOR = {Fernau, Henning and Fomin, Fedor V. and Philip, Geevarghese and Saurabh, Saket},
TITLE = {On the parameterized complexity of vertex cover and edge cover with connectivity constraints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {565},
PAGES = {1-15},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {parameterized complexity, connectivity problems, kernel lower bounds, vertex cover, edge cover},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514008275},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hellmuth-Marc/15,
AUTHOR = {Hellmuth, Marc and Marc, Tilen},
TITLE = {On the Cartesian skeleton and the factorization of the strong product of digraphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {565},
PAGES = {16-29},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {directed graph, strong product, prime factor decomposition algorithms, dispensable, cartesian skeleton},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514008378},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shyu/15,
AUTHOR = {Shyu, Shyong Jian},
TITLE = {Visual cryptograms of random grids for threshold access structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {565},
PAGES = {30-49},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {visual cryptography, threshold visual secret sharing, random grids, pixel expansion},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514008408},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Faulkner-Yassawi/15,
AUTHOR = {Faulkner, Nicholas and Yassawi, Reem},
TITLE = {A family of sand automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {565},
PAGES = {50-62},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {sand automata, higher-dimensional cellular automata, equicontinuity, surjectivity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514008482},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gyorgyi-Kis/15,
AUTHOR = {Gy{\"o}rgyi, P{\'e}ter and Kis, Tam{\'a}s},
TITLE = {Reductions between scheduling problems with non-renewable resources and knapsack problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {565},
PAGES = {63-76},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {approximation preserving reductions, scheduling problems, knapsack problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514008500},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Punnen-Sripratak-Karapetyan/15,
AUTHOR = {Punnen, Abraham P. and Sripratak, Piyashat and Karapetyan, Daniel},
TITLE = {Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {565},
PAGES = {77-89},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {quadratic programming, boolean variables, heuristics, worst-case analysis, domination analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514008512},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fedou-Fici/15,
AUTHOR = {F{\'e}dou, Jean-Marc and Fici, Gabriele},
TITLE = {Vertical representation of $C^\infty$-words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {565},
PAGES = {90-101},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {kolakoski word, c $\infty$ -words, directed acyclic graph, recursive function, directed set},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514008548},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kasperski-Zielinski/15,
AUTHOR = {Kasperski, Adam and Zieli{\'n}ski, Pawe{\l}},
TITLE = {Combinatorial optimization problems with uncertain costs and the OWA criterion},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {565},
PAGES = {102-112},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {combinatorial optimization, owa operator, robust optimization, computational complexity, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514008561},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}