Search dblp for Publications

export results for "toc:db/journals/tcs/tcs516.bht:"

 download as .bib file

@article{DBLP:journals/tcs/AbbesHM14,
  author       = {F. Abbes and
                  M. Hbaib and
                  M. Merkhi},
  title        = {{\(\beta\)}-expansion and transcendence in F\({}_{\mbox{q}}\)((x\({}^{\mbox{-1}}\)))},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {71--77},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.017},
  doi          = {10.1016/J.TCS.2013.11.017},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AbbesHM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DAngeloDF14,
  author       = {Gianlorenzo D'Angelo and
                  Mattia D'Emidio and
                  Daniele Frigioni},
  title        = {A loop-free shortest-path routing algorithm for dynamic networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {1--19},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.001},
  doi          = {10.1016/J.TCS.2013.11.001},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/DAngeloDF14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DennunzioFW14,
  author       = {Alberto Dennunzio and
                  Enrico Formenti and
                  Michael Weiss},
  title        = {Multidimensional cellular automata: closing property, quasi-expansivity,
                  and (un)decidability issues},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {40--59},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.005},
  doi          = {10.1016/J.TCS.2013.11.005},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DennunzioFW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DucheneR14,
  author       = {{\'{E}}ric Duch{\^{e}}ne and
                  Gabriel Renault},
  title        = {Vertex Nim played on graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {20--27},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.025},
  doi          = {10.1016/J.TCS.2013.11.025},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DucheneR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuhCW14,
  author       = {Dyi{-}Rong Duh and
                  Tzu{-}Lung Chen and
                  Yue{-}Li Wang},
  title        = {(n-3)-edge-fault-tolerant weak-pancyclicity of (n, k)-star graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {28--39},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.013},
  doi          = {10.1016/J.TCS.2013.11.013},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DuhCW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GastH14,
  author       = {Mikael Gast and
                  Mathias Hauptmann},
  title        = {Approximability of the vertex cover problem in power-law graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {60--70},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.004},
  doi          = {10.1016/J.TCS.2013.11.004},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GastH14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Karthick14,
  author       = {T. Karthick},
  title        = {On atomic structure of P\({}_{\mbox{5}}\)-free subclasses and Maximum
                  Weight Independent Set problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {78--85},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.019},
  doi          = {10.1016/J.TCS.2013.11.019},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Karthick14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KowalikM14,
  author       = {Lukasz Kowalik and
                  Marcin Mucha},
  title        = {A 9k kernel for nonseparating independent set in planar graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {86--95},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.021},
  doi          = {10.1016/J.TCS.2013.11.021},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KowalikM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LevinV14,
  author       = {Asaf Levin and
                  Aleksander Vainer},
  title        = {Adaptivity in the stochastic blackjack knapsack problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {121--126},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.029},
  doi          = {10.1016/J.TCS.2013.11.029},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/LevinV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Maffray14,
  author       = {Fr{\'{e}}d{\'{e}}ric Maffray},
  title        = {Fast recognition of doubled graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {96--100},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.020},
  doi          = {10.1016/J.TCS.2013.11.020},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Maffray14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MedunaZ14,
  author       = {Alexander Meduna and
                  Petr Zemek},
  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},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.009},
  doi          = {10.1016/J.TCS.2013.11.009},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MedunaZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NiW14,
  author       = {Wei{-}Ping Ni and
                  Jian{-}Liang Wu},
  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},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.011},
  doi          = {10.1016/J.TCS.2013.11.011},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NiW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Okhotin14,
  author       = {Alexander Okhotin},
  title        = {Parsing by matrix multiplication generalized to Boolean grammars},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {101--120},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.09.011},
  doi          = {10.1016/J.TCS.2013.09.011},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Okhotin14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics