@article{Ambos-Spies-Bakibayev/13,
AUTHOR = {Ambos-Spies, Klaus and Bakibayev, Timur},
TITLE = {Nontriviality for exponential time w.r.t. weak reducibilities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {2-12},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751200480X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Babu-Limaye-Radhakrishnan-Varma/13,
AUTHOR = {Babu, Ajesh and Limaye, Nutan and Radhakrishnan, Jaikumar and Varma, Girish},
TITLE = {Streaming algorithms for language recognition problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {13-23},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {streaming algorithms, randomized algorithms, communication complexity, context free language},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512011437},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feng-Nie-Wu/13,
AUTHOR = {Feng, Rongquan and Nie, Menglong and Wu, Hongfeng},
TITLE = {Twisted Jacobi intersections curves},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {24-35},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {elliptic curves, jacobi intersections, twisted jacobi intersections, scalar multiplication, isomorphism, cryptography},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512011425},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ambainis-Kravchenko-Nahimov-Rivosh-Virza/13,
AUTHOR = {Ambainis, Andris and Kravchenko, Dmitry and Nahimov, Nikolay and Rivosh, Alexander and Virza, Madars},
TITLE = {On symmetric nonlocal games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {36-48},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum games, symmetric nonlocal games, chsh game, mermin-ardehali game},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002120},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{ibulka-Kyncl-Meszaros-Stolar-Valtr/13,
AUTHOR = {ibulka, Josef and Kyn{\v{c}}l, Jan and M{\'e}sz{\'a}ros, Viola and Stola{\v{r}}, Rudolf and Valtr, Pavel},
TITLE = {Graph sharing games: Complexity and connectivity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {49-62},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph sharing game, pspace-complete problem, k -connected graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512011449},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cai-Kowalczyk/13,
AUTHOR = {Cai, Jin-Yi and Kowalczyk, Michael},
TITLE = {Partition functions on $k$-regular graphs with $\{0,1\}$-vertex assignments and real edge functions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {63-74},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {partition function, dichotomy theorem, holant problem, holographic algorithm, counting complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000091},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crespelle-Todinca/13,
AUTHOR = {Crespelle, Christophe and Todinca, Ioan},
TITLE = {An $O(n^2)$-time algorithm for the minimal interval completion problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {75-85},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph algorithms, interval graphs, minimal interval completions},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512011462},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hartung-Niedermeier/13,
AUTHOR = {Hartung, Sepp and Niedermeier, Rolf},
TITLE = {Incremental list coloring of graphs, parameterized by conservation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {86-98},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterized complexity, data reduction, problem kernel, local search, incremental clustering, precoloring extension},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000169},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Uhlmann-Weller/13,
AUTHOR = {Uhlmann, Johannes and Weller, Mathias},
TITLE = {Two-Layer Planarization parameterized by feedback edge set},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {99-111},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph drawing, np-hard problem, edge modification problem, polynomial-time preprocessing, pathwidth-one edge deletion, problem kernel, non-standard parameterization},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000911},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{He-Zhang/13,
AUTHOR = {He, Xin and Zhang, Huaming},
TITLE = {A simple routing algorithm based on Schnyder coordinates},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {112-121},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000674},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bulteau-Fertin-Rusu/13,
AUTHOR = {Bulteau, Laurent and Fertin, Guillaume and Rusu, Irena},
TITLE = {Revisiting the Minimum Breakpoint Linearization problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {122-133},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {comparative genomics, breakpoint distance, partially ordered genome, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512011413},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guillemot-Mnich/13,
AUTHOR = {Guillemot, Sylvain and Mnich, Matthias},
TITLE = {Kernel and fast algorithm for dense triplet inconsistency},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {134-143},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512011474},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kao-Leung-Sun-Zhang/13,
AUTHOR = {Kao, Ming-Yang and Leung, Henry C.M. and Sun, He and Zhang, Yong},
TITLE = {Deterministic polynomial-time algorithms for designing short DNA words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {494},
PAGES = {144-160},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dna word design, deterministic algorithms, derandomization},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512011450},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}