callback( { "result":{ "query":":facetid:toc:\"db/journals/tcs/tcs573.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"209.47" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"7", "@dc":"7", "@oc":"7", "@id":"43473374", "text":":facetid:toc:db/journals/tcs/tcs573.bht" } }, "hits":{ "@total":"7", "@computed":"7", "@sent":"7", "@first":"0", "hit":[{ "@score":"1", "@id":"3489462", "info":{"authors":{"author":[{"@pid":"31/5143","text":"Davide Bilò"},{"@pid":"26/1384","text":"Luciano Gualà"},{"@pid":"37/8821","text":"Stefano Leucci 0001"},{"@pid":"p/GProietti","text":"Guido Proietti"}]},"title":"The max-distance network creation game on general host graphs.","venue":"Theor. Comput. Sci.","volume":"573","pages":"43-53","year":"2015","type":"Journal Articles","access":"open","key":"journals/tcs/BiloG0P15","doi":"10.1016/J.TCS.2015.01.044","ee":"https://doi.org/10.1016/j.tcs.2015.01.044","url":"https://dblp.org/rec/journals/tcs/BiloG0P15"}, "url":"URL#3489462" }, { "@score":"1", "@id":"3489481", "info":{"authors":{"author":[{"@pid":"159/8791","text":"Marziyeh Boroujeni"},{"@pid":"93/3532","text":"Abdolali Basiri"},{"@pid":"44/7550","text":"Sajjad Rahmany"},{"@pid":"45/6928","text":"Annick Valibouze"}]},"title":"F4-invariant algorithm for computing SAGBI-Gröbner bases.","venue":"Theor. Comput. Sci.","volume":"573","pages":"54-62","year":"2015","type":"Journal Articles","access":"open","key":"journals/tcs/BoroujeniBRV15","doi":"10.1016/J.TCS.2015.01.045","ee":"https://doi.org/10.1016/j.tcs.2015.01.045","url":"https://dblp.org/rec/journals/tcs/BoroujeniBRV15"}, "url":"URL#3489481" }, { "@score":"1", "@id":"3489521", "info":{"authors":{"author":[{"@pid":"92/5602","text":"Krishnendu Chatterjee"},{"@pid":"15/9508","text":"Manas Joglekar"},{"@pid":"95/9508-1","text":"Nisarg Shah 0001"}]},"title":"Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives.","venue":"Theor. Comput. Sci.","volume":"573","pages":"71-89","year":"2015","type":"Journal Articles","access":"open","key":"journals/tcs/ChatterjeeJ015","doi":"10.1016/J.TCS.2015.01.050","ee":"https://doi.org/10.1016/j.tcs.2015.01.050","url":"https://dblp.org/rec/journals/tcs/ChatterjeeJ015"}, "url":"URL#3489521" }, { "@score":"1", "@id":"3489668", "info":{"authors":{"author":[{"@pid":"h/MonikaRauchHenzinger","text":"Monika Henzinger"},{"@pid":"132/9047","text":"Veronika Loitzenbauer"}]},"title":"Truthful unit-demand auctions with budgets revisited.","venue":"Theor. Comput. Sci.","volume":"573","pages":"1-15","year":"2015","type":"Journal Articles","access":"open","key":"journals/tcs/HenzingerL15","doi":"10.1016/J.TCS.2015.01.033","ee":"https://doi.org/10.1016/j.tcs.2015.01.033","url":"https://dblp.org/rec/journals/tcs/HenzingerL15"}, "url":"URL#3489668" }, { "@score":"1", "@id":"3489675", "info":{"authors":{"author":[{"@pid":"h/VPless","text":"Christopher M. Homan"},{"@pid":"14/925","text":"Sven Kosub"}]},"title":"Dichotomy results for fixed point counting in boolean dynamical systems.","venue":"Theor. Comput. Sci.","volume":"573","pages":"16-25","year":"2015","type":"Journal Articles","access":"open","key":"journals/tcs/HomanK15","doi":"10.1016/J.TCS.2015.01.040","ee":"https://doi.org/10.1016/j.tcs.2015.01.040","url":"https://dblp.org/rec/journals/tcs/HomanK15"}, "url":"URL#3489675" }, { "@score":"1", "@id":"3489770", "info":{"authors":{"author":[{"@pid":"32/306-1","text":"Yunlong Liu 0001"},{"@pid":"75/2669-1","text":"Jianxin Wang 0001"},{"@pid":"143/5300","text":"Jie You"},{"@pid":"c/JianerChen","text":"Jianer Chen"},{"@pid":"20/8038-1","text":"Yixin Cao 0001"}]},"title":"Edge deletion problems: Branching facilitated by modular decomposition.","venue":"Theor. Comput. Sci.","volume":"573","pages":"63-70","year":"2015","type":"Journal Articles","access":"open","key":"journals/tcs/LiuWYCC15","doi":"10.1016/J.TCS.2015.01.049","ee":"https://doi.org/10.1016/j.tcs.2015.01.049","url":"https://dblp.org/rec/journals/tcs/LiuWYCC15"}, "url":"URL#3489770" }, { "@score":"1", "@id":"3489812", "info":{"authors":{"author":[{"@pid":"38/1994","text":"Bhawani Sankar Panda"},{"@pid":"135/6268","text":"Subhabrata Paul"},{"@pid":"82/2341","text":"Dinabandhu Pradhan"}]},"title":"Hardness results, approximation and exact algorithms for liar's domination problem in graphs.","venue":"Theor. Comput. Sci.","volume":"573","pages":"26-42","year":"2015","type":"Journal Articles","access":"open","key":"journals/tcs/PandaPP15","doi":"10.1016/J.TCS.2015.01.041","ee":"https://doi.org/10.1016/j.tcs.2015.01.041","url":"https://dblp.org/rec/journals/tcs/PandaPP15"}, "url":"URL#3489812" } ] } } } )