Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/AloupisDGV15,
  author       = {Greg Aloupis and
                  Erik D. Demaine and
                  Alan Guo and
                  Giovanni Viglietta},
  title        = {Classic Nintendo games are (computationally) hard},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {135--160},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.02.037},
  doi          = {10.1016/J.TCS.2015.02.037},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AloupisDGV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BorassiCHKMT15,
  author       = {Michele Borassi and
                  Pierluigi Crescenzi and
                  Michel Habib and
                  Walter A. Kosters and
                  Andrea Marino and
                  Frank W. Takes},
  title        = {Fast diameter and radius BFS-based computation in (weakly connected)
                  real-world graphs: With an application to the six degrees of separation
                  games},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {59--80},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.02.033},
  doi          = {10.1016/J.TCS.2015.02.033},
  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BorassiCHKMT15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Brand15,
  author       = {Michael Brand},
  title        = {No easy puzzles: Hardness results for jigsaw puzzles},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {2--11},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.02.030},
  doi          = {10.1016/J.TCS.2015.02.030},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Brand15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenD15,
  author       = {Ke Chen and
                  Adrian Dumitrescu},
  title        = {Nonconvex cases for carpenter's rulers},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {12--25},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.02.031},
  doi          = {10.1016/J.TCS.2015.02.031},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChenD15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CicaleseCGMPV15,
  author       = {Ferdinando Cicalese and
                  Gennaro Cordasco and
                  Luisa Gargano and
                  Martin Milanic and
                  Joseph G. Peters and
                  Ugo Vaccaro},
  title        = {Spread of influence in weighted networks under time and budget constraints},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {40--58},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.02.032},
  doi          = {10.1016/J.TCS.2015.02.032},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/CicaleseCGMPV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DemaineD15,
  author       = {Erik D. Demaine and
                  Martin L. Demaine},
  title        = {Fun with fonts: Algorithmic typography},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {111--119},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.01.054},
  doi          = {10.1016/J.TCS.2015.01.054},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DemaineD15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FertinJK15,
  author       = {Guillaume Fertin and
                  Shahrad Jamshidi and
                  Christian Komusiewicz},
  title        = {Towards an algorithmic guide to Spiral Galaxies},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {26--39},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.01.051},
  doi          = {10.1016/J.TCS.2015.01.051},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FertinJK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeorgiouKK15,
  author       = {Konstantinos Georgiou and
                  Evangelos Kranakis and
                  Danny Krizanc},
  title        = {Excuse me! or the courteous theatregoers' problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {95--110},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.01.053},
  doi          = {10.1016/J.TCS.2015.01.053},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GeorgiouKK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KostitsynaLP15,
  author       = {Irina Kostitsyna and
                  Maarten L{\"{o}}ffler and
                  Valentin Polishchuk},
  title        = {Optimizing airspace closure with respect to politicians' egos},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {161--175},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.04.014},
  doi          = {10.1016/J.TCS.2015.04.014},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KostitsynaLP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Viglietta15,
  author       = {Giovanni Viglietta},
  title        = {Lemmings is PSPACE-complete},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {120--134},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.01.055},
  doi          = {10.1016/J.TCS.2015.01.055},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Viglietta15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Widmayer15,
  author       = {Peter Widmayer},
  title        = {{FUN} with algorithms},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {1},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.05.009},
  doi          = {10.1016/J.TCS.2015.05.009},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Widmayer15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YamanakaDIKKOSS15,
  author       = {Katsuhisa Yamanaka and
                  Erik D. Demaine and
                  Takehiro Ito and
                  Jun Kawahara and
                  Masashi Kiyomi and
                  Yoshio Okamoto and
                  Toshiki Saitoh and
                  Akira Suzuki and
                  Kei Uchizawa and
                  Takeaki Uno},
  title        = {Swapping labeled tokens on graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {586},
  pages        = {81--94},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.01.052},
  doi          = {10.1016/J.TCS.2015.01.052},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/YamanakaDIKKOSS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics