@article{Briceno-Rapaport/13,
AUTHOR = {Brice{\~n}o, Raimundo and Rapaport, Ivan},
TITLE = {Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {468},
PAGES = {1-11},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {communication complexity, intrinsic universality, cellular automata},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010419},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bucci-De_Luca-Fici/13,
AUTHOR = {Bucci, Michelangelo and De Luca, Alessandro and Fici, Gabriele},
TITLE = {Enumeration and structure of trapezoidal words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {468},
PAGES = {12-22},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sturmian words, trapezoidal words, rich words, closed words, special factors, palindromes, enumerative formula},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010377},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Calamoneri-Montefusco-Petreschi-Sinaimeri/13,
AUTHOR = {Calamoneri, T. and Montefusco, E. and Petreschi, R. and Sinaimeri, B.},
TITLE = {Exploring pairwise compatibility graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {468},
PAGES = {23-36},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {pcg, leaf power graphs, threshold graphs, graph complement, disjoint union of graphs, twins},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010456},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Lyuu/13,
AUTHOR = {Chang, Ching-Lueh and Lyuu, Yuh-Dauh},
TITLE = {Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {468},
PAGES = {37-49},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010468},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Li-Chen/13,
AUTHOR = {Chen, Yebin and Li, Ying and Chen, Tao},
TITLE = {Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {468},
PAGES = {50-58},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {directed double-loop networks, fault-tolerant routing, fault-tolerant diameter, shortest path},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010389},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{David-Nourine/13,
AUTHOR = {David, J. and Nourine, L.},
TITLE = {A parameterizable enumeration algorithm for sequence mining},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {468},
PAGES = {59-68},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010353},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guillaume/13,
AUTHOR = {Guillaume, Delalleau},
TITLE = {Ancestors graph and an upper bound for the subword complexity function},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {468},
PAGES = {69-82},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010444},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gao-Mao-Sun-Zuo/13,
AUTHOR = {Gao, Yihan and Mao, Jieming and Sun, Xiaoming and Zuo, Song},
TITLE = {On the sensitivity complexity of bipartite graph properties},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {468},
PAGES = {83-91},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sensitivity complexity, bipartite graph, graph properties, turan conjecture, decision tree},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010365},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lee-Na-Park-Park-Sim/13,
AUTHOR = {Lee, Taehyung and Na, Joong Chae and Park, Heejin and Park, Kunsoo and Sim, Jeong Seop},
TITLE = {Finding consensus and optimal alignment of circular strings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {468},
PAGES = {92-101},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {consensus strings, circular strings, multiple alignments},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010481},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mou-Wang-Li/13,
AUTHOR = {Mou, Chenqi and Wang, Dongming and Li, Xiaoliang},
TITLE = {Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {468},
PAGES = {102-113},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {simple set, regular set, triangular decomposition, finite field, radical ideal, p th root extraction},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010390},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhao-Lu/13,
AUTHOR = {Zhao, Kejun and Lu, Xiwen},
TITLE = {Approximation schemes for two-agent scheduling on parallel machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {468},
PAGES = {114-121},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {agent scheduling, parallel machines, algorithm, dynamic programming, fully polynomial time approximation scheme},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010031},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}