@article{DAngelo-DEmidio-Frigioni/14a,
AUTHOR = {D'Angelo, Gianlorenzo and D'Emidio, Mattia and Frigioni, Daniele},
TITLE = {A loop-free shortest-path routing algorithm for dynamic networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {1-19},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distributed networks, loop-free routing, shortest-path, dynamic algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008190},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duchene-Renault/14,
AUTHOR = {Duch{\^e}ne, Eric and Renault, Gabriel},
TITLE = {Vertex Nim played on graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {20-27},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorial games, nim, graph theory},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008694},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duh-Chen-Wang/14,
AUTHOR = {Duh, Dyi-Rong and Chen, Tzu-Lung and Wang, Yue-Li},
TITLE = {$(n-3)$-edge-fault-tolerant weak-pancyclicity of $(n,k)$-star graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {28-39},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {weak-pancyclicity, ( n , k ) -star graph, cayley graph, cycle embedding, fault-tolerance},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751300844X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dennunzio-Formenti-Weiss/14,
AUTHOR = {Dennunzio, Alberto and Formenti, Enrico and Weiss, Michael},
TITLE = {Multidimensional cellular automata: Closing property, quasi-expansivity, and (un)decidability issues},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {40-59},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, symbolic dynamics, decidability, tiling},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008232},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gast-Hauptmann/14,
AUTHOR = {Gast, Mikael and Hauptmann, Mathias},
TITLE = {Approximability of the vertex cover problem in power-law graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {60-70},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, vertex cover problem, power-law graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008220},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Abbes-Hbaib-Merkhi/14,
AUTHOR = {Abbes, F. and Hbaib, M. and Merkhi, M.},
TITLE = {$\beta$-expansion and transcendence in $\mathbb F_q((x^{-1}))$-star},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {71-77},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal power series, $\beta$-expansion, algebraic series, mahler measure, dynamical system, numeration, q-automatic, transcendental},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751300861X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Karthick/14,
AUTHOR = {Karthick, T.},
TITLE = {On atomic structure of $P_5$-free subclasses and Maximum Weight Independent Set problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {78-85},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph algorithms, clique separators, modular decomposition, maximum weight independent set problem, p 5 -free graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008633},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kowalik-Mucha/14,
AUTHOR = {Kowalik, {\L}ukasz and Mucha, Marcin},
TITLE = {A $9k$ kernel for nonseparating independent set in planar graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {86-95},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {fixed parameter algorithms, kernelization, planar graphs, connected vertex cover, nonseparating independent set},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008657},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Maffray/14,
AUTHOR = {Maffray, Fr{\'e}d{\'e}ric},
TITLE = {Fast recognition of doubled graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {96-100},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {double split graph, recognition},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008645},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Okhotin/14,
AUTHOR = {Okhotin, Alexander},
TITLE = {Parsing by matrix multiplication generalized to Boolean grammars},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {101-120},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {boolean grammars, conjunctive grammars, context-free grammars, matrix multiplication, parsing},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513006919},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Levin-Vainer/14,
AUTHOR = {Levin, Asaf and Vainer, Aleksander},
TITLE = {Adaptivity in the stochastic blackjack knapsack problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {121-126},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {knapsack problem, benefit of adaptivity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008736},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Meduna-Zemek/14a,
AUTHOR = {Meduna, Alexander and Zemek, Petr},
TITLE = {One-sided random context grammars with a limited number of right random context rules},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {127-132},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal languages, one-sided random context grammars, right random context rules, reduction},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751300827X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ni-Wu/14,
AUTHOR = {Ni, Wei-Ping and Wu, Jian-Liang},
TITLE = {Edge coloring of planar graphs which any two short cycles are adjacent at most once},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {516},
PAGES = {133-138},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {planar graph, edge coloring, maximum degree, cycle},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008426},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}