default search action
Theoretical Computer Science, Volume 494
Volume 494, July 2013
- Jirí Fiala, Jan Kratochvíl, Angsheng Li:
Preface. 1
- Klaus Ambos-Spies, Timur Bakibayev:
Nontriviality for exponential time w.r.t. weak reducibilities. 2-12 - Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma:
Streaming algorithms for language recognition problems. 13-23 - Rongquan Feng, Menglong Nie, Hongfeng Wu:
Twisted Jacobi intersections curves. 24-35 - Andris Ambainis, Dmitry Kravchenko, Nikolay Nahimov, Alexander Rivosh, Madars Virza:
On symmetric nonlocal games. 36-48 - Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Graph sharing games: Complexity and connectivity. 49-62 - Jin-Yi Cai, Michael Kowalczyk:
Partition functions on kk-regular graphs with {0, 1}{0, 1}-vertex assignments and real edge functions. 63-74 - Christophe Crespelle, Ioan Todinca:
An O(n2)O(n2)-time algorithm for the minimal interval completion problem. 75-85 - Sepp Hartung, Rolf Niedermeier:
Incremental list coloring of graphs, parameterized by conservation. 86-98 - Johannes Uhlmann, Mathias Weller:
Two-Layer Planarization parameterized by feedback edge set. 99-111 - Xin He, Huaming Zhang:
A simple routing algorithm based on Schnyder coordinates. 112-121 - Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Revisiting the Minimum Breakpoint Linearization Problem. 122-133 - Sylvain Guillemot, Matthias Mnich:
Kernel and fast algorithm for dense triplet inconsistency. 134-143 - Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang:
Deterministic polynomial-time algorithms for designing short DNA words. 144-160
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.