Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs617.bht:"
@article{DBLP:journals/tcs/BoissonnatM16, author = {Jean{-}Daniel Boissonnat and Dorian Mazauric}, title = {On the complexity of the representation of simplicial complexes by trees}, journal = {Theor. Comput. Sci.}, volume = {617}, pages = {28--44}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2015.12.034}, doi = {10.1016/J.TCS.2015.12.034}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BoissonnatM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MoralesCLT16, author = {Sandra Astete Morales and Marie{-}Liesse Cauwet and Jialin Liu and Olivier Teytaud}, title = {Simple and cumulative regret for continuous noisy optimization}, journal = {Theor. Comput. Sci.}, volume = {617}, pages = {12--27}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2015.09.032}, doi = {10.1016/J.TCS.2015.09.032}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MoralesCLT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Park16, author = {Jung{-}Heum Park}, title = {Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs}, journal = {Theor. Comput. Sci.}, volume = {617}, pages = {45--64}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2015.12.036}, doi = {10.1016/J.TCS.2015.12.036}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Park16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ShibataKOKM16, author = {Masahiro Shibata and Shinji Kawai and Fukuhito Ooshita and Hirotsugu Kakugawa and Toshimitsu Masuzawa}, title = {Partial gathering of mobile agents in asynchronous unidirectional rings}, journal = {Theor. Comput. Sci.}, volume = {617}, pages = {1--11}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2015.09.012}, doi = {10.1016/J.TCS.2015.09.012}, timestamp = {Tue, 04 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ShibataKOKM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/TianWFY16, author = {Ji Tian and Qian Wang and Ruyan Fu and Jinjiang Yuan}, title = {Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time}, journal = {Theor. Comput. Sci.}, volume = {617}, pages = {65--68}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.01.001}, doi = {10.1016/J.TCS.2016.01.001}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/TianWFY16.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.