Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/Bang-JensenBHY18,
  author       = {J{\o}rgen Bang{-}Jensen and
                  St{\'{e}}phane Bessy and
                  Fr{\'{e}}d{\'{e}}ric Havet and
                  Anders Yeo},
  title        = {Out-degree reducing partitions of digraphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {719},
  pages        = {64--72},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.11.007},
  doi          = {10.1016/J.TCS.2017.11.007},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Bang-JensenBHY18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BarashO18,
  author       = {Mikhail Barash and
                  Alexander Okhotin},
  title        = {Linear-space recognition for grammars with contexts},
  journal      = {Theor. Comput. Sci.},
  volume       = {719},
  pages        = {73--85},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.11.006},
  doi          = {10.1016/J.TCS.2017.11.006},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BarashO18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GolovnevKST18,
  author       = {Alexander Golovnev and
                  Alexander S. Kulikov and
                  Alexander V. Smal and
                  Suguru Tamaki},
  title        = {Gate elimination: Circuit size lower bounds and {\#}SAT upper bounds},
  journal      = {Theor. Comput. Sci.},
  volume       = {719},
  pages        = {46--63},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.11.008},
  doi          = {10.1016/J.TCS.2017.11.008},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GolovnevKST18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GreenhillS18,
  author       = {Catherine S. Greenhill and
                  Matteo Sfragara},
  title        = {The switch Markov chain for sampling irregular graphs and digraphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {719},
  pages        = {1--20},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.11.010},
  doi          = {10.1016/J.TCS.2017.11.010},
  timestamp    = {Wed, 27 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GreenhillS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Schridde18,
  author       = {Christian Schridde},
  title        = {On the construction of graphs with a planar bipartite double cover
                  from boolean formulas and its application to counting satisfying solutions},
  journal      = {Theor. Comput. Sci.},
  volume       = {719},
  pages        = {21--45},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.11.009},
  doi          = {10.1016/J.TCS.2017.11.009},
  timestamp    = {Wed, 14 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Schridde18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/TehAP18,
  author       = {Wen Chean Teh and
                  Adrian Atanasiu and
                  Ghajendran Poovanandran},
  title        = {On strongly \emph{M}-unambiguous prints and {\c{S}}erb{\unicode{462}}nu{\c{t}}{\unicode{462}}'s
                  conjecture for Parikh matrices},
  journal      = {Theor. Comput. Sci.},
  volume       = {719},
  pages        = {86--93},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.11.016},
  doi          = {10.1016/J.TCS.2017.11.016},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/TehAP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}