default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs646.bht:"
@article{DBLP:journals/tcs/0001CD16, author = {Stefano Beretta and Mauro Castelli and Riccardo Dondi}, title = {Parameterized tractability of the maximum-duo preservation string mapping problem}, journal = {Theor. Comput. Sci.}, volume = {646}, pages = {16--25}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.07.011}, doi = {10.1016/J.TCS.2016.07.011}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/0001CD16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AvniT16, author = {Guy Avni and Tami Tamir}, title = {Cost-sharing scheduling games on restricted unrelated machines}, journal = {Theor. Comput. Sci.}, volume = {646}, pages = {26--39}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.07.012}, doi = {10.1016/J.TCS.2016.07.012}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AvniT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GlasserSS16, author = {Christian Gla{\ss}er and Heinz Schmitz and Victor L. Selivanov}, title = {Efficient algorithms for membership in boolean hierarchies of regular languages}, journal = {Theor. Comput. Sci.}, volume = {646}, pages = {86--108}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.07.017}, doi = {10.1016/J.TCS.2016.07.017}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GlasserSS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Harland16, author = {James Harland}, title = {Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)}, journal = {Theor. Comput. Sci.}, volume = {646}, pages = {61--85}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.07.016}, doi = {10.1016/J.TCS.2016.07.016}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Harland16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Ho16, author = {Nhan Bao Ho}, title = {Three-pile Sharing Nim and the quadratic time winning strategy}, journal = {Theor. Comput. Sci.}, volume = {646}, pages = {49--60}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.07.015}, doi = {10.1016/J.TCS.2016.07.015}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Ho16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KacemK16, author = {Imed Kacem and Hans Kellerer}, title = {Semi-online scheduling on a single machine with unexpected breakdown}, journal = {Theor. Comput. Sci.}, volume = {646}, pages = {40--48}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.07.014}, doi = {10.1016/J.TCS.2016.07.014}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KacemK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KelkFMW16, author = {Steven Kelk and Mareike Fischer and Vincent Moulton and Taoyang Wu}, title = {Reduction rules for the maximum parsimony distance on phylogenetic trees}, journal = {Theor. Comput. Sci.}, volume = {646}, pages = {1--15}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2016.07.010}, doi = {10.1016/J.TCS.2016.07.010}, timestamp = {Wed, 11 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/KelkFMW16.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.