default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs573.bht:"
@article{DBLP:journals/tcs/BiloG0P15, author = {Davide Bil{\`{o}} and Luciano Gual{\`{a}} and Stefano Leucci and Guido Proietti}, title = {The max-distance network creation game on general host graphs}, journal = {Theor. Comput. Sci.}, volume = {573}, pages = {43--53}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.01.044}, doi = {10.1016/J.TCS.2015.01.044}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BiloG0P15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BoroujeniBRV15, author = {Marziyeh Boroujeni and Abdolali Basiri and Sajjad Rahmany and Annick Valibouze}, title = {F4-invariant algorithm for computing SAGBI-Gr{\"{o}}bner bases}, journal = {Theor. Comput. Sci.}, volume = {573}, pages = {54--62}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.01.045}, doi = {10.1016/J.TCS.2015.01.045}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BoroujeniBRV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChatterjeeJ015, author = {Krishnendu Chatterjee and Manas Joglekar and Nisarg Shah}, title = {Average case analysis of the classical algorithm for Markov decision processes with B{\"{u}}chi objectives}, journal = {Theor. Comput. Sci.}, volume = {573}, pages = {71--89}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.01.050}, doi = {10.1016/J.TCS.2015.01.050}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChatterjeeJ015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HenzingerL15, author = {Monika Henzinger and Veronika Loitzenbauer}, title = {Truthful unit-demand auctions with budgets revisited}, journal = {Theor. Comput. Sci.}, volume = {573}, pages = {1--15}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.01.033}, doi = {10.1016/J.TCS.2015.01.033}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HenzingerL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HomanK15, author = {Christopher M. Homan and Sven Kosub}, title = {Dichotomy results for fixed point counting in boolean dynamical systems}, journal = {Theor. Comput. Sci.}, volume = {573}, pages = {16--25}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.01.040}, doi = {10.1016/J.TCS.2015.01.040}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HomanK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LiuWYCC15, author = {Yunlong Liu and Jianxin Wang and Jie You and Jianer Chen and Yixin Cao}, title = {Edge deletion problems: Branching facilitated by modular decomposition}, journal = {Theor. Comput. Sci.}, volume = {573}, pages = {63--70}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.01.049}, doi = {10.1016/J.TCS.2015.01.049}, timestamp = {Fri, 13 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/LiuWYCC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/PandaPP15, author = {Bhawani Sankar Panda and Subhabrata Paul and Dinabandhu Pradhan}, title = {Hardness results, approximation and exact algorithms for liar's domination problem in graphs}, journal = {Theor. Comput. Sci.}, volume = {573}, pages = {26--42}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.01.041}, doi = {10.1016/J.TCS.2015.01.041}, timestamp = {Tue, 25 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/PandaPP15.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.