Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs494.bht:"
@article{DBLP:journals/tcs/AmbainisKNRV13, author = {Andris Ambainis and Dmitry Kravchenko and Nikolay Nahimov and Alexander Rivosh and Madars Virza}, title = {On symmetric nonlocal games}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {36--48}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.03.011}, doi = {10.1016/J.TCS.2013.03.011}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AmbainisKNRV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Ambos-SpiesB13, author = {Klaus Ambos{-}Spies and Timur Bakibayev}, title = {Nontriviality for exponential time w.r.t. weak reducibilities}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {2--12}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.05.022}, doi = {10.1016/J.TCS.2012.05.022}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Ambos-SpiesB13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BabuLRV13, author = {Ajesh Babu and Nutan Limaye and Jaikumar Radhakrishnan and Girish Varma}, title = {Streaming algorithms for language recognition problems}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {13--23}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.12.028}, doi = {10.1016/J.TCS.2012.12.028}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BabuLRV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BulteauFR13, author = {Laurent Bulteau and Guillaume Fertin and Irena Rusu}, title = {Revisiting the Minimum Breakpoint Linearization Problem}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {122--133}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.12.026}, doi = {10.1016/J.TCS.2012.12.026}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BulteauFR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CaiK13, author = {Jin{-}Yi Cai and Michael Kowalczyk}, title = {Partition functions on \emph{k}k-regular graphs with \{0, 1\}\{0, 1\}-vertex assignments and real edge functions}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {63--74}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.12.043}, doi = {10.1016/J.TCS.2012.12.043}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CaiK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CibulkaKMSV13, author = {Josef Cibulka and Jan Kyncl and Viola M{\'{e}}sz{\'{a}}ros and Rudolf Stolar and Pavel Valtr}, title = {Graph sharing games: Complexity and connectivity}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {49--62}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.12.029}, doi = {10.1016/J.TCS.2012.12.029}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CibulkaKMSV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CrespelleT13, author = {Christophe Crespelle and Ioan Todinca}, title = {An \emph{O}(\emph{n}\({}^{\mbox{2}}\))O(n2)-time algorithm for the minimal interval completion problem}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {75--85}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.12.031}, doi = {10.1016/J.TCS.2012.12.031}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CrespelleT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FengNW13, author = {Rongquan Feng and Menglong Nie and Hongfeng Wu}, title = {Twisted Jacobi intersections curves}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {24--35}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.12.027}, doi = {10.1016/J.TCS.2012.12.027}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FengNW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FialaKL13, author = {Jir{\'{\i}} Fiala and Jan Kratochv{\'{\i}}l and Angsheng Li}, title = {Preface}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {1}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.05.030}, doi = {10.1016/J.TCS.2013.05.030}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FialaKL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GuillemotM13, author = {Sylvain Guillemot and Matthias Mnich}, title = {Kernel and fast algorithm for dense triplet inconsistency}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {134--143}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.12.032}, doi = {10.1016/J.TCS.2012.12.032}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GuillemotM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HartungN13, author = {Sepp Hartung and Rolf Niedermeier}, title = {Incremental list coloring of graphs, parameterized by conservation}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {86--98}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.12.049}, doi = {10.1016/J.TCS.2012.12.049}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HartungN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HeZ13, author = {Xin He and Huaming Zhang}, title = {A simple routing algorithm based on Schnyder coordinates}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {112--121}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.01.017}, doi = {10.1016/J.TCS.2013.01.017}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HeZ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KaoL0Z13, author = {Ming{-}Yang Kao and Henry C. M. Leung and He Sun and Yong Zhang}, title = {Deterministic polynomial-time algorithms for designing short {DNA} words}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {144--160}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.12.030}, doi = {10.1016/J.TCS.2012.12.030}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KaoL0Z13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/UhlmannW13, author = {Johannes Uhlmann and Mathias Weller}, title = {Two-Layer Planarization parameterized by feedback edge set}, journal = {Theor. Comput. Sci.}, volume = {494}, pages = {99--111}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.01.029}, doi = {10.1016/J.TCS.2013.01.029}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/UhlmannW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.