@article{Fomin-Giroire-Jean-Marie-Mazauric-Nisse/14,
AUTHOR = {Fomin, Fedor V. and Giroire, Fr{\'e}d{\'e}ric and Jean-Marie, Alain and Mazauric, Dorian and Nisse, Nicolas},
TITLE = {To satisfy impatient Web surfers is hard},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {526},
PAGES = {1-17},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000267},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Golovnev-Kutzkov/14,
AUTHOR = {Golovnev, Alexander and Kutzkov, Konstantin},
TITLE = {New exact algorithms for the 2-constraint satisfaction problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {526},
PAGES = {18-27},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000279},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bang-Jensen-Bessy/14,
AUTHOR = {Bang-Jensen, J{\o}rgen and Bessy, St{\'e}phane},
TITLE = {(Arc-)disjoint flows in networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {526},
PAGES = {28-40},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000280},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nikolopoulos-Palios-Papadopoulos/14,
AUTHOR = {Nikolopoulos, Stavros D. and Palios, Leonidas and Papadopoulos, Charis},
TITLE = {Counting spanning trees using modular decomposition},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {526},
PAGES = {41-57},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000292},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brodal-Kaporis-Papadopoulos-Sioutas-Tsakalidis-Tsichlas/14,
AUTHOR = {Brodal, Gerth St{\o}lting and Kaporis, Alexis C. and Papadopoulos, Apostolos N. and Sioutas, Spyros and Tsakalidis, Konstantinos and Tsichlas, Kostas},
TITLE = {Dynamic 3-sided planar range queries with expected doubly-logarithmic time},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {526},
PAGES = {58-74},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000310},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Binucci-Didimo-Patrignani/14,
AUTHOR = {Binucci, Carla and Didimo, Walter and Patrignani, Maurizio},
TITLE = {Upward and quasi-upward planarity testing of embedded mixed graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {526},
PAGES = {75-89},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000322},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kumar-Mishra-Devi-Saurabh/14,
AUTHOR = {Kumar, Mrinal and Mishra, Sounaka and Devi, N. Safina and Saurabh, Saket},
TITLE = {Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {526},
PAGES = {90-96},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000474},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Genkin-Kaminski-Peterfreund/14,
AUTHOR = {Genkin, Daniel and Kaminski, Michael and Peterfreund, Liat},
TITLE = {A note on the emptiness problem for alternating finite-memory automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {526},
PAGES = {97-107},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000486},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ota-Fukae-Morita/14,
AUTHOR = {Ota, Takahiro and Fukae, Hirotada and Morita, Hiroyoshi},
TITLE = {Dynamic construction of an antidictionary with linear complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {526},
PAGES = {108-119},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000498},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Wu-A/14,
AUTHOR = {Chang, Jian and Wu, Jian-Liang and A, Yong-Ga},
TITLE = {Total colorings of planar graphs with sparse triangles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {526},
PAGES = {120-129},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000504},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}