callback( { "result":{ "query":":facetid:toc:\"db/journals/mst/mst62.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"66.41" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"79", "@dc":"79", "@oc":"79", "@id":"43371428", "text":":facetid:toc:db/journals/mst/mst62.bht" } }, "hits":{ "@total":"79", "@computed":"79", "@sent":"30", "@first":"0", "hit":[{ "@score":"1", "@id":"2432720", "info":{"authors":{"author":[{"@pid":"71/4752-1","text":"Shantanu Das 0001"},{"@pid":"d/DDereniowski","text":"Dariusz Dereniowski"},{"@pid":"163/9096","text":"Christina Karousatou"}]},"title":"Collaborative Exploration of Trees by Energy-Constrained Mobile Robots.","venue":"Theory Comput. Syst.","volume":"62","number":"5","pages":"1223-1240","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/0001DK18","doi":"10.1007/S00224-017-9816-3","ee":"https://doi.org/10.1007/s00224-017-9816-3","url":"https://dblp.org/rec/journals/mst/0001DK18"}, "url":"URL#2432720" }, { "@score":"1", "@id":"2432721", "info":{"authors":{"author":[{"@pid":"00/4199","text":"Spyros Angelopoulos 0001"},{"@pid":"d/ChristophDurr","text":"Christoph Dürr"},{"@pid":"59/577","text":"Shahin Kamali"},{"@pid":"86/11131","text":"Marc P. Renault"},{"@pid":"r/AdiRosen","text":"Adi Rosén"}]},"title":"Online Bin Packing with Advice of Small Size.","venue":"Theory Comput. Syst.","volume":"62","number":"8","pages":"2006-2034","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/0001DKRR18","doi":"10.1007/S00224-018-9862-5","ee":"https://doi.org/10.1007/s00224-018-9862-5","url":"https://dblp.org/rec/journals/mst/0001DKRR18"}, "url":"URL#2432721" }, { "@score":"1", "@id":"2432722", "info":{"authors":{"author":[{"@pid":"67/10948","text":"R. Krithika 0001"},{"@pid":"171/3758","text":"Diptapriyo Majumdar"},{"@pid":"25/2134","text":"Venkatesh Raman 0001"}]},"title":"Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels.","venue":"Theory Comput. Syst.","volume":"62","number":"8","pages":"1690-1714","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/0001M018","doi":"10.1007/S00224-017-9837-Y","ee":"https://doi.org/10.1007/s00224-017-9837-y","url":"https://dblp.org/rec/journals/mst/0001M018"}, "url":"URL#2432722" }, { "@score":"1", "@id":"2432723", "info":{"authors":{"author":[{"@pid":"64/3320","text":"Faisal N. Abu-Khzam"},{"@pid":"138/8052","text":"Christine Markarian"},{"@pid":"h/FMaufderHeide","text":"Friedhelm Meyer auf der Heide"},{"@pid":"08/4607","text":"Michael Schubert"}]},"title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks.","venue":"Theory Comput. Syst.","volume":"62","number":"8","pages":"1673-1689","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/Abu-KhzamMHS18","doi":"10.1007/S00224-017-9836-Z","ee":"https://doi.org/10.1007/s00224-017-9836-z","url":"https://dblp.org/rec/journals/mst/Abu-KhzamMHS18"}, "url":"URL#2432723" }, { "@score":"1", "@id":"2432724", "info":{"authors":{"author":[{"@pid":"138/2437","text":"Archita Agarwal"},{"@pid":"c/VTChakaravarthy","text":"Venkatesan T. Chakaravarthy"},{"@pid":"02/3718","text":"Anamitra R. Choudhury"},{"@pid":"71/1647","text":"Sambudha Roy"},{"@pid":"57/3685","text":"Yogish Sabharwal"}]},"title":"Set Cover Problems with Small Neighborhood Covers.","venue":"Theory Comput. Syst.","volume":"62","number":"8","pages":"1763-1797","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/AgarwalCCRS18","doi":"10.1007/S00224-017-9842-1","ee":"https://doi.org/10.1007/s00224-017-9842-1","url":"https://dblp.org/rec/journals/mst/AgarwalCCRS18"}, "url":"URL#2432724" }, { "@score":"1", "@id":"2432725", "info":{"authors":{"author":[{"@pid":"144/7801","text":"Akanksha Agrawal 0001"},{"@pid":"11/5491","text":"Saket Saurabh 0001"},{"@pid":"119/4936","text":"Roohani Sharma"},{"@pid":"133/1023","text":"Meirav Zehavi"}]},"title":"Parameterised Algorithms for Deletion to Classes of DAGs.","venue":"Theory Comput. Syst.","volume":"62","number":"8","pages":"1880-1909","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/Agrawal0SZ18","doi":"10.1007/S00224-018-9852-7","ee":"https://doi.org/10.1007/s00224-018-9852-7","url":"https://dblp.org/rec/journals/mst/Agrawal0SZ18"}, "url":"URL#2432725" }, { "@score":"1", "@id":"2432726", "info":{"authors":{"author":[{"@pid":"164/1737","text":"Niranka Banerjee"},{"@pid":"164/1759","text":"Sankardeep Chakraborty"},{"@pid":"25/2134","text":"Venkatesh Raman 0001"},{"@pid":"r/SSrinivasaRao","text":"Srinivasa Rao Satti"}]},"title":"Space Efficient Linear Time Algorithms for BFS, DFS and Applications.","venue":"Theory Comput. Syst.","volume":"62","number":"8","pages":"1736-1762","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/BanerjeeC0S18","doi":"10.1007/S00224-017-9841-2","ee":"https://doi.org/10.1007/s00224-017-9841-2","url":"https://dblp.org/rec/journals/mst/BanerjeeC0S18"}, "url":"URL#2432726" }, { "@score":"1", "@id":"2432727", "info":{"authors":{"author":[{"@pid":"69/5601","text":"Nikhil Bansal 0001"},{"@pid":"173/4575","text":"Marek Eliás 0001"},{"@pid":"09/813","text":"Lukasz Jez"},{"@pid":"174/1741","text":"Grigorios Koumoutsos"},{"@pid":"p/KirkPruhs","text":"Kirk Pruhs"}]},"title":"Tight Bounds for Double Coverage Against Weak Adversaries.","venue":"Theory Comput. Syst.","volume":"62","number":"2","pages":"349-365","year":"2018","type":"Journal Articles","access":"open","key":"journals/mst/BansalEJKP18","doi":"10.1007/S00224-016-9703-3","ee":"https://doi.org/10.1007/s00224-016-9703-3","url":"https://dblp.org/rec/journals/mst/BansalEJKP18"}, "url":"URL#2432727" }, { "@score":"1", "@id":"2432728", "info":{"authors":{"author":[{"@pid":"26/3717","text":"Verónica Becher"},{"@pid":"13/6092","text":"Olivier Carton"},{"@pid":"17/101","text":"Pablo Ariel Heiber"}]},"title":"Finite-State Independence.","venue":"Theory Comput. Syst.","volume":"62","number":"7","pages":"1555-1572","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/BecherCH18","doi":"10.1007/S00224-017-9821-6","ee":"https://doi.org/10.1007/s00224-017-9821-6","url":"https://dblp.org/rec/journals/mst/BecherCH18"}, "url":"URL#2432728" }, { "@score":"1", "@id":"2432729", "info":{"authors":{"author":[{"@pid":"71/7412","text":"René van Bevern"},{"@pid":"133/1147","text":"Vincent Froese"},{"@pid":"69/1771","text":"Christian Komusiewicz"}]},"title":"Parameterizing Edge Modification Problems Above Lower Bounds.","venue":"Theory Comput. Syst.","volume":"62","number":"3","pages":"739-770","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/BevernFK18","doi":"10.1007/S00224-016-9746-5","ee":"https://doi.org/10.1007/s00224-016-9746-5","url":"https://dblp.org/rec/journals/mst/BevernFK18"}, "url":"URL#2432729" }, { "@score":"1", "@id":"2432730", "info":{"authors":{"author":[{"@pid":"129/2787","text":"Anup Bhattacharya"},{"@pid":"63/1704","text":"Ragesh Jaiswal"},{"@pid":"k/AmitKumar1","text":"Amit Kumar 0001"}]},"title":"Faster Algorithms for the Constrained k-means Problem.","venue":"Theory Comput. Syst.","volume":"62","number":"1","pages":"93-115","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/BhattacharyaJK18","doi":"10.1007/S00224-017-9820-7","ee":"https://doi.org/10.1007/s00224-017-9820-7","url":"https://dblp.org/rec/journals/mst/BhattacharyaJK18"}, "url":"URL#2432730" }, { "@score":"1", "@id":"2432731", "info":{"authors":{"author":[{"@pid":"32/3463","text":"Philip Bille"},{"@pid":"166/1656","text":"Anders Roy Christiansen"},{"@pid":"129/1722","text":"Patrick Hagge Cording"},{"@pid":"96/705","text":"Inge Li Gørtz"}]},"title":"Finger Search in Grammar-Compressed Strings.","venue":"Theory Comput. Syst.","volume":"62","number":"8","pages":"1715-1735","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/BilleCCG18","doi":"10.1007/S00224-017-9839-9","ee":"https://doi.org/10.1007/s00224-017-9839-9","url":"https://dblp.org/rec/journals/mst/BilleCCG18"}, "url":"URL#2432731" }, { "@score":"1", "@id":"2432732", "info":{"authors":{"author":{"@pid":"b/VittorioBilo","text":"Vittorio Bilò"}},"title":"A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games.","venue":"Theory Comput. Syst.","volume":"62","number":"5","pages":"1288-1317","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/Bilo18","doi":"10.1007/S00224-017-9826-1","ee":"https://doi.org/10.1007/s00224-017-9826-1","url":"https://dblp.org/rec/journals/mst/Bilo18"}, "url":"URL#2432732" }, { "@score":"1", "@id":"2432733", "info":{"authors":{"author":[{"@pid":"b/ManuelBodirsky","text":"Manuel Bodirsky"},{"@pid":"32/2251","text":"Marcello Mamino"}]},"title":"Tropically Convex Constraint Satisfaction.","venue":"Theory Comput. Syst.","volume":"62","number":"3","pages":"481-509","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/BodirskyM18","doi":"10.1007/S00224-017-9762-0","ee":"https://doi.org/10.1007/s00224-017-9762-0","url":"https://dblp.org/rec/journals/mst/BodirskyM18"}, "url":"URL#2432733" }, { "@score":"1", "@id":"2432734", "info":{"authors":{"author":[{"@pid":"06/8196-1","text":"Martin Böhm 0001"},{"@pid":"143/7938","text":"Pavel Veselý 0001"}]},"title":"Online Chromatic Number is PSPACE-Complete.","venue":"Theory Comput. Syst.","volume":"62","number":"6","pages":"1366-1391","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/BohmV18","doi":"10.1007/S00224-017-9797-2","ee":"https://doi.org/10.1007/s00224-017-9797-2","url":"https://dblp.org/rec/journals/mst/BohmV18"}, "url":"URL#2432734" }, { "@score":"1", "@id":"2432735", "info":{"authors":{"author":[{"@pid":"132/1918","text":"Katerina Böhmová"},{"@pid":"216/4835","text":"Luca Häfliger"},{"@pid":"39/6388","text":"Matús Mihalák"},{"@pid":"98/6015","text":"Tobias Pröger"},{"@pid":"39/7347","text":"Gustavo Sacomoto"},{"@pid":"53/296","text":"Marie-France Sagot"}]},"title":"Computing and Listing st-Paths in Public Transportation Networks.","venue":"Theory Comput. Syst.","volume":"62","number":"3","pages":"600-621","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/BohmovaHMPSS18","doi":"10.1007/S00224-016-9747-4","ee":"https://doi.org/10.1007/s00224-016-9747-4","url":"https://dblp.org/rec/journals/mst/BohmovaHMPSS18"}, "url":"URL#2432735" }, { "@score":"1", "@id":"2432736", "info":{"authors":{"author":[{"@pid":"19/4585","text":"Bartlomiej Bosek"},{"@pid":"83/9661","text":"Dariusz Leniowski"},{"@pid":"80/4282","text":"Piotr Sankowski"},{"@pid":"33/6470","text":"Anna Zych-Pawlewicz"}]},"title":"Shortest Augmenting Paths for Online Matchings on Trees.","venue":"Theory Comput. Syst.","volume":"62","number":"2","pages":"337-348","year":"2018","type":"Journal Articles","access":"open","key":"journals/mst/BosekLSZ18","doi":"10.1007/S00224-017-9838-X","ee":"https://doi.org/10.1007/s00224-017-9838-x","url":"https://dblp.org/rec/journals/mst/BosekLSZ18"}, "url":"URL#2432736" }, { "@score":"1", "@id":"2432737", "info":{"authors":{"author":[{"@pid":"04/2119","text":"Olivier Bournez"},{"@pid":"34/2570","text":"Johanne Cohen"},{"@pid":"08/9698","text":"Mikaël Rabie"}]},"title":"Homonym Population Protocols.","venue":"Theory Comput. Syst.","volume":"62","number":"5","pages":"1318-1346","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/BournezCR18","doi":"10.1007/S00224-017-9833-2","ee":"https://doi.org/10.1007/s00224-017-9833-2","url":"https://dblp.org/rec/journals/mst/BournezCR18"}, "url":"URL#2432737" }, { "@score":"1", "@id":"2432738", "info":{"authors":{"author":[{"@pid":"b/JoanBoyar","text":"Joan Boyar"},{"@pid":"37/768","text":"Lene M. Favrholdt"},{"@pid":"147/5035","text":"Christian Kudahl"},{"@pid":"146/0522","text":"Jesper W. Mikkelsen"}]},"title":"Weighted Online Problems with Advice.","venue":"Theory Comput. Syst.","volume":"62","number":"6","pages":"1443-1469","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/BoyarFKM18","doi":"10.1007/S00224-017-9806-5","ee":"https://doi.org/10.1007/s00224-017-9806-5","url":"https://dblp.org/rec/journals/mst/BoyarFKM18"}, "url":"URL#2432738" }, { "@score":"1", "@id":"2432739", "info":{"authors":{"author":[{"@pid":"b/JABrzozowski","text":"Janusz A. Brzozowski"},{"@pid":"97/10625","text":"Marek Szykula"},{"@pid":"23/5064","text":"Yuli Ye"}]},"title":"Syntactic Complexity of Regular Ideals.","venue":"Theory Comput. Syst.","volume":"62","number":"5","pages":"1175-1202","year":"2018","type":"Journal Articles","access":"open","key":"journals/mst/BrzozowskiSY18","doi":"10.1007/S00224-017-9803-8","ee":"https://doi.org/10.1007/s00224-017-9803-8","url":"https://dblp.org/rec/journals/mst/BrzozowskiSY18"}, "url":"URL#2432739" }, { "@score":"1", "@id":"2432740", "info":{"authors":{"author":[{"@pid":"b/HarryBuhrman","text":"Harry Buhrman"},{"@pid":"14/1317-1","text":"Michal Koucký 0001"},{"@pid":"51/3628","text":"Bruno Loff"},{"@pid":"56/10263","text":"Florian Speelman"}]},"title":"Catalytic Space: Non-determinism and Hierarchy.","venue":"Theory Comput. Syst.","volume":"62","number":"1","pages":"116-135","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/BuhrmanKLS18","doi":"10.1007/S00224-017-9784-7","ee":"https://doi.org/10.1007/s00224-017-9784-7","url":"https://dblp.org/rec/journals/mst/BuhrmanKLS18"}, "url":"URL#2432740" }, { "@score":"1", "@id":"2432741", "info":{"authors":{"author":[{"@pid":"54/2541","text":"Michaël Cadilhac"},{"@pid":"35/4442","text":"Andreas Krebs"},{"@pid":"14/1904","text":"Pierre McKenzie"}]},"title":"The Algebraic Theory of Parikh Automata.","venue":"Theory Comput. Syst.","volume":"62","number":"5","pages":"1241-1268","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/CadilhacKM18","doi":"10.1007/S00224-017-9817-2","ee":"https://doi.org/10.1007/s00224-017-9817-2","url":"https://dblp.org/rec/journals/mst/CadilhacKM18"}, "url":"URL#2432741" }, { "@score":"1", "@id":"2432742", "info":{"authors":{"author":[{"@pid":"c/CSCalude","text":"Cristian S. Calude"},{"@pid":"s/LudwigStaiger","text":"Ludwig Staiger"}]},"title":"Liouville, Computable, Borel Normal and Martin-Löf Random Numbers.","venue":"Theory Comput. Syst.","volume":"62","number":"7","pages":"1573-1585","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/CaludeS18","doi":"10.1007/S00224-017-9767-8","ee":"https://doi.org/10.1007/s00224-017-9767-8","url":"https://dblp.org/rec/journals/mst/CaludeS18"}, "url":"URL#2432742" }, { "@score":"1", "@id":"2432743", "info":{"authors":{"author":[{"@pid":"28/9840L","text":"Clément L. Canonne"},{"@pid":"d/IliasDiakonikolas","text":"Ilias Diakonikolas"},{"@pid":"122/9933","text":"Themis Gouleakis"},{"@pid":"r/RonittRubinfeld","text":"Ronitt Rubinfeld"}]},"title":"Testing Shape Restrictions of Discrete Distributions.","venue":"Theory Comput. Syst.","volume":"62","number":"1","pages":"4-62","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/CanonneDGR18","doi":"10.1007/S00224-017-9785-6","ee":"https://doi.org/10.1007/s00224-017-9785-6","url":"https://dblp.org/rec/journals/mst/CanonneDGR18"}, "url":"URL#2432743" }, { "@score":"1", "@id":"2432744", "info":{"authors":{"author":{"@pid":"126/2966","text":"Adam Case"}},"title":"Bounded Turing Reductions and Data Processing Inequalities for Sequences.","venue":"Theory Comput. Syst.","volume":"62","number":"7","pages":"1586-1598","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/Case18","doi":"10.1007/S00224-017-9804-7","ee":"https://doi.org/10.1007/s00224-017-9804-7","url":"https://dblp.org/rec/journals/mst/Case18"}, "url":"URL#2432744" }, { "@score":"1", "@id":"2432745", "info":{"authors":{"author":[{"@pid":"c/DouglasCenzer","text":"Douglas Cenzer"},{"@pid":"149/4567","text":"Christopher P. Porter"}]},"title":"The Random Members of a Π10 Class.","venue":"Theory Comput. Syst.","volume":"62","number":"7","pages":"1637-1671","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/CenzerP18","doi":"10.1007/S00224-017-9824-3","ee":"https://doi.org/10.1007/s00224-017-9824-3","url":"https://dblp.org/rec/journals/mst/CenzerP18"}, "url":"URL#2432745" }, { "@score":"1", "@id":"2432746", "info":{"authors":{"author":[{"@pid":"68/561","text":"Xujin Chen"},{"@pid":"168/4761","text":"Zhuo Diao"},{"@pid":"h/XiaodongHu","text":"Xiaodong Hu 0001"},{"@pid":"180/5696","text":"Zhongzheng Tang"}]},"title":"Covering Triangles in Edge-Weighted Graphs.","venue":"Theory Comput. Syst.","volume":"62","number":"6","pages":"1525-1552","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/ChenDHT18","doi":"10.1007/S00224-018-9860-7","ee":"https://doi.org/10.1007/s00224-018-9860-7","url":"https://dblp.org/rec/journals/mst/ChenDHT18"}, "url":"URL#2432746" }, { "@score":"1", "@id":"2432747", "info":{"authors":{"author":[{"@pid":"122/3039","text":"Kamiel Cornelissen"},{"@pid":"78/11131","text":"Ruben Hoeksma"},{"@pid":"m/BodoManthey","text":"Bodo Manthey"},{"@pid":"n/NSNarayanaswamy","text":"N. S. Narayanaswamy"},{"@pid":"136/5838","text":"C. S. Rahul 0001"},{"@pid":"174/1854","text":"Marten Waanders"}]},"title":"Approximation Algorithms for Connected Graph Factors of Minimum Weight.","venue":"Theory Comput. Syst.","volume":"62","number":"2","pages":"441-464","year":"2018","type":"Journal Articles","access":"open","key":"journals/mst/CornelissenHMNR18","doi":"10.1007/S00224-016-9723-Z","ee":"https://doi.org/10.1007/s00224-016-9723-z","url":"https://dblp.org/rec/journals/mst/CornelissenHMNR18"}, "url":"URL#2432747" }, { "@score":"1", "@id":"2432748", "info":{"authors":{"author":[{"@pid":"56/7270","text":"Wojciech Czerwinski"},{"@pid":"65/164","text":"Claire David"},{"@pid":"14/4251","text":"Filip Murlak"},{"@pid":"36/5522","text":"Pawel Parys"}]},"title":"Reasoning about integrity constraints for tree-structured data.","venue":"Theory Comput. Syst.","volume":"62","number":"4","pages":"941-976","year":"2018","type":"Journal Articles","access":"closed","key":"journals/mst/CzerwinskiDMP18","doi":"10.1007/S00224-017-9771-Z","ee":"https://doi.org/10.1007/s00224-017-9771-z","url":"https://dblp.org/rec/journals/mst/CzerwinskiDMP18"}, "url":"URL#2432748" }, { "@score":"1", "@id":"2432749", "info":{"authors":{"author":{"@pid":"53/3104","text":"Peter Damaschke"}},"title":"The Solution Space of Sorting with Recurring Comparison Faults.","venue":"Theory Comput. Syst.","volume":"62","number":"6","pages":"1427-1442","year":"2018","type":"Journal Articles","access":"open","key":"journals/mst/Damaschke18","doi":"10.1007/S00224-017-9807-4","ee":"https://doi.org/10.1007/s00224-017-9807-4","url":"https://dblp.org/rec/journals/mst/Damaschke18"}, "url":"URL#2432749" } ] } } } )