Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/AraujoCRHM15,
  author       = {J{\'{u}}lio Ara{\'{u}}jo and
                  Nathann Cohen and
                  Susanna F. de Rezende and
                  Fr{\'{e}}d{\'{e}}ric Havet and
                  Phablo F. S. Moura},
  title        = {On the proper orientation number of bipartite graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {566},
  pages        = {59--75},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2014.11.037},
  doi          = {10.1016/J.TCS.2014.11.037},
  timestamp    = {Wed, 02 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AraujoCRHM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChechikP15,
  author       = {Shiri Chechik and
                  David Peleg},
  title        = {The fault-tolerant capacitated K-center problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {566},
  pages        = {12--25},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2014.11.017},
  doi          = {10.1016/J.TCS.2014.11.017},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChechikP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GarganoR15,
  author       = {Luisa Gargano and
                  Adele A. Rescigno},
  title        = {Complexity of conflict-free colorings of graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {566},
  pages        = {39--49},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2014.11.029},
  doi          = {10.1016/J.TCS.2014.11.029},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GarganoR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/OkhotinS15,
  author       = {Alexander Okhotin and
                  Kai Salomaa},
  title        = {Descriptional complexity of unambiguous input-driven pushdown automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {566},
  pages        = {1--11},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2014.11.015},
  doi          = {10.1016/J.TCS.2014.11.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/OkhotinS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Turek15,
  author       = {Ondrej Turek},
  title        = {Abelian properties of Parry words},
  journal      = {Theor. Comput. Sci.},
  volume       = {566},
  pages        = {26--38},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2014.11.024},
  doi          = {10.1016/J.TCS.2014.11.024},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Turek15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ZhangW15,
  author       = {Wenwen Zhang and
                  Jian{-}Liang Wu},
  title        = {Some sufficient conditions for 1-planar graphs to be Class 1},
  journal      = {Theor. Comput. Sci.},
  volume       = {566},
  pages        = {50--58},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2014.11.031},
  doi          = {10.1016/J.TCS.2014.11.031},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ZhangW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}