callback( { "result":{ "query":":facetid:toc:\"db/conf/walcom/walcom2018.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"69.67" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"23", "@dc":"23", "@oc":"23", "@id":"43418087", "text":":facetid:toc:db/conf/walcom/walcom2018.bht" } }, "hits":{ "@total":"23", "@computed":"23", "@sent":"23", "@first":"0", "hit":[{ "@score":"1", "@id":"2674842", "info":{"authors":{"author":[{"@pid":"198/1092","text":"Abu Reyan Ahmed"},{"@pid":"r/MdSaidurRahman","text":"Md. Saidur Rahman 0001"},{"@pid":"98/2841","text":"Stephen G. Kobourov"}]},"title":"Online Facility Assignment.","venue":"WALCOM","pages":"156-168","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/AhmedRK18","doi":"10.1007/978-3-319-75172-6_14","ee":"https://doi.org/10.1007/978-3-319-75172-6_14","url":"https://dblp.org/rec/conf/walcom/AhmedRK18"}, "url":"URL#2674842" }, { "@score":"1", "@id":"2674843", "info":{"authors":{"author":[{"@pid":"65/358","text":"Hee-Kap Ahn"},{"@pid":"32/5372-1","text":"Taehoon Ahn 0001"},{"@pid":"90/2675","text":"Sang Won Bae"},{"@pid":"42/9279","text":"Jong Min Choi"},{"@pid":"37/3411","text":"Mincheol Kim"},{"@pid":"157/8129","text":"Eunjin Oh 0001"},{"@pid":"54/6122","text":"Chan-Su Shin"},{"@pid":"129/8969","text":"Sang Duk Yoon"}]},"title":"Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases.","venue":"WALCOM","pages":"44-55","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/AhnABCK0SY18","doi":"10.1007/978-3-319-75172-6_5","ee":"https://doi.org/10.1007/978-3-319-75172-6_5","url":"https://dblp.org/rec/conf/walcom/AhnABCK0SY18"}, "url":"URL#2674843" }, { "@score":"1", "@id":"2674844", "info":{"authors":{"author":[{"@pid":"65/358","text":"Hee-Kap Ahn"},{"@pid":"32/5372-1","text":"Taehoon Ahn 0001"},{"@pid":"42/9279","text":"Jong Min Choi"},{"@pid":"37/3411","text":"Mincheol Kim"},{"@pid":"157/8129","text":"Eunjin Oh 0001"}]},"title":"Minimum-Width Square Annulus Intersecting Polygons.","venue":"WALCOM","pages":"56-67","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/AhnACK018","doi":"10.1007/978-3-319-75172-6_6","ee":"https://doi.org/10.1007/978-3-319-75172-6_6","url":"https://dblp.org/rec/conf/walcom/AhnACK018"}, "url":"URL#2674844" }, { "@score":"1", "@id":"2674845", "info":{"authors":{"author":[{"@pid":"202/6686","text":"Aisha Aljohani"},{"@pid":"207/2155","text":"Pavan Poudel"},{"@pid":"60/7865","text":"Gokarna Sharma"}]},"title":"Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement.","venue":"WALCOM","pages":"169-182","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/AljohaniPS18","doi":"10.1007/978-3-319-75172-6_15","ee":"https://doi.org/10.1007/978-3-319-75172-6_15","url":"https://dblp.org/rec/conf/walcom/AljohaniPS18"}, "url":"URL#2674845" }, { "@score":"1", "@id":"2674846", "info":{"authors":{"author":[{"@pid":"161/5755","text":"Md. Aashikur Rahman Azim"},{"@pid":"214/8663","text":"Mohimenul Kabir"},{"@pid":"r/MohammadSohelRahman","text":"M. Sohel Rahman"}]},"title":"A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison.","venue":"WALCOM","pages":"183-194","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/AzimKR18","doi":"10.1007/978-3-319-75172-6_16","ee":"https://doi.org/10.1007/978-3-319-75172-6_16","url":"https://dblp.org/rec/conf/walcom/AzimKR18"}, "url":"URL#2674846" }, { "@score":"1", "@id":"2674847", "info":{"authors":{"author":[{"@pid":"214/8654","text":"Mirza Galib Anwarul Husain Baig"},{"@pid":"52/25","text":"Deepanjan Kesh"}]},"title":"Two New Schemes in the Bitprobe Model.","venue":"WALCOM","pages":"68-79","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/BaigK18","doi":"10.1007/978-3-319-75172-6_7","ee":"https://doi.org/10.1007/978-3-319-75172-6_7","url":"https://dblp.org/rec/conf/walcom/BaigK18"}, "url":"URL#2674847" }, { "@score":"1", "@id":"2674848", "info":{"authors":{"author":[{"@pid":"57/6623-1","text":"Junhee Cho 0001"},{"@pid":"185/0952-1","text":"Sewon Park 0001"},{"@pid":"z/MartinZiegler1","text":"Martin Ziegler 0001"}]},"title":"Computing Periods ... .","venue":"WALCOM","pages":"132-143","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/ChoP018","doi":"10.1007/978-3-319-75172-6_12","ee":"https://doi.org/10.1007/978-3-319-75172-6_12","url":"https://dblp.org/rec/conf/walcom/ChoP018"}, "url":"URL#2674848" }, { "@score":"1", "@id":"2674849", "info":{"authors":{"author":[{"@pid":"200/8461","text":"Jayesh Choudhari"},{"@pid":"158/8471","text":"I. Vinod Reddy"}]},"title":"On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity.","venue":"WALCOM","pages":"228-239","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/ChoudhariR18","doi":"10.1007/978-3-319-75172-6_20","ee":"https://doi.org/10.1007/978-3-319-75172-6_20","url":"https://dblp.org/rec/conf/walcom/ChoudhariR18"}, "url":"URL#2674849" }, { "@score":"1", "@id":"2674850", "info":{"authors":{"author":[{"@pid":"93/3858","text":"Bireswar Das"},{"@pid":"158/8460","text":"Murali Krishna Enduri"},{"@pid":"158/8471","text":"I. Vinod Reddy"}]},"title":"On the Parallel Parameterized Complexity of the Graph Isomorphism Problem.","venue":"WALCOM","pages":"252-264","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/DasER18","doi":"10.1007/978-3-319-75172-6_22","ee":"https://doi.org/10.1007/978-3-319-75172-6_22","url":"https://dblp.org/rec/conf/walcom/DasER18"}, "url":"URL#2674850" }, { "@score":"1", "@id":"2674851", "info":{"authors":{"author":[{"@pid":"91/6620","text":"Marc Demange"},{"@pid":"94/1723","text":"Martin Olsen"}]},"title":"A Note on Online Colouring Problems in Overlap Graphs and Their Complements.","venue":"WALCOM","pages":"144-155","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/DemangeO18","doi":"10.1007/978-3-319-75172-6_13","ee":"https://doi.org/10.1007/978-3-319-75172-6_13","url":"https://dblp.org/rec/conf/walcom/DemangeO18"}, "url":"URL#2674851" }, { "@score":"1", "@id":"2674852", "info":{"authors":{"author":[{"@pid":"63/4119","text":"Takahiro Fujita"},{"@pid":"11/5748","text":"Kohei Hatano"},{"@pid":"36/5061","text":"Eiji Takimoto"}]},"title":"Boosting over Non-deterministic ZDDs.","venue":"WALCOM","pages":"195-206","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/FujitaHT18","doi":"10.1007/978-3-319-75172-6_17","ee":"https://doi.org/10.1007/978-3-319-75172-6_17","url":"https://dblp.org/rec/conf/walcom/FujitaHT18"}, "url":"URL#2674852" }, { "@score":"1", "@id":"2674853", "info":{"authors":{"author":[{"@pid":"25/5430","text":"Toshihiro Fujito"},{"@pid":"71/10949","text":"Kei Kimura"},{"@pid":"214/8661","text":"Yuki Mizuno"}]},"title":"Approximating Partially Bounded Degree Deletion on Directed Graphs.","venue":"WALCOM","pages":"32-43","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/FujitoKM18","doi":"10.1007/978-3-319-75172-6_4","ee":"https://doi.org/10.1007/978-3-319-75172-6_4","url":"https://dblp.org/rec/conf/walcom/FujitoKM18"}, "url":"URL#2674853" }, { "@score":"1", "@id":"2674854", "info":{"authors":{"author":[{"@pid":"85/787","text":"Hanyu Gu"},{"@pid":"17/8877","text":"Julia Memar"},{"@pid":"51/2939","text":"Yakov Zinder"}]},"title":"Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach.","venue":"WALCOM","pages":"119-131","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/GuMZ18","doi":"10.1007/978-3-319-75172-6_11","ee":"https://doi.org/10.1007/978-3-319-75172-6_11","url":"https://dblp.org/rec/conf/walcom/GuMZ18"}, "url":"URL#2674854" }, { "@score":"1", "@id":"2674855", "info":{"authors":{"author":[{"@pid":"214/8638","text":"Manas Jyoti Kashyop"},{"@pid":"214/8644","text":"Tsunehiko Nagayama"},{"@pid":"74/5752","text":"Kunihiko Sadakane"}]},"title":"Faster Network Algorithms Based on Graph Decomposition.","venue":"WALCOM","pages":"80-92","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/KashyopNS18","doi":"10.1007/978-3-319-75172-6_8","ee":"https://doi.org/10.1007/978-3-319-75172-6_8","url":"https://dblp.org/rec/conf/walcom/KashyopNS18"}, "url":"URL#2674855" }, { "@score":"1", "@id":"2674856", "info":{"authors":{"author":[{"@pid":"10/2979","text":"Eiji Miyano"},{"@pid":"04/6930","text":"Toshiki Saitoh"},{"@pid":"02/5150","text":"Ryuhei Uehara"},{"@pid":"214/8664","text":"Tsuyoshi Yagita"},{"@pid":"154/6686","text":"Tom C. van der Zanden"}]},"title":"Complexity of the Maximum k-Path Vertex Cover Problem.","venue":"WALCOM","pages":"240-251","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/MiyanoSUYZ18","doi":"10.1007/978-3-319-75172-6_21","ee":"https://doi.org/10.1007/978-3-319-75172-6_21","url":"https://dblp.org/rec/conf/walcom/MiyanoSUYZ18"}, "url":"URL#2674856" }, { "@score":"1", "@id":"2674857", "info":{"authors":{"author":{"@pid":"n/ShinIchiNakano","text":"Shin-Ichi Nakano"}},"title":"A Simple Algorithm for r-gatherings on the Line.","venue":"WALCOM","pages":"1-7","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/Nakano18","doi":"10.1007/978-3-319-75172-6_1","ee":"https://doi.org/10.1007/978-3-319-75172-6_1","url":"https://dblp.org/rec/conf/walcom/Nakano18"}, "url":"URL#2674857" }, { "@score":"1", "@id":"2674858", "info":{"authors":{"author":[{"@pid":"58/6849-3","text":"Tong Qin 0003"},{"@pid":"w/OsamuWatanabe1","text":"Osamu Watanabe 0001"}]},"title":"An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem.","venue":"WALCOM","pages":"93-105","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/Qin018","doi":"10.1007/978-3-319-75172-6_9","ee":"https://doi.org/10.1007/978-3-319-75172-6_9","url":"https://dblp.org/rec/conf/walcom/Qin018"}, "url":"URL#2674858" }, { "@score":"1", "@id":"2674859", "info":{"authors":{"author":[{"@pid":"153/2170","text":"Suthee Ruangwises"},{"@pid":"94/802","text":"Toshiya Itoh"}]},"title":"Random Popular Matchings with Incomplete Preference Lists.","venue":"WALCOM","pages":"106-118","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/RuangwisesI18","doi":"10.1007/978-3-319-75172-6_10","ee":"https://doi.org/10.1007/978-3-319-75172-6_10","url":"https://dblp.org/rec/conf/walcom/RuangwisesI18"}, "url":"URL#2674859" }, { "@score":"1", "@id":"2674860", "info":{"authors":{"author":[{"@pid":"22/10703","text":"Tatsuya Sasaki"},{"@pid":"214/8660","text":"Bateh Mathias Agbor"},{"@pid":"152/3333","text":"Shingo Masuda"},{"@pid":"86/7079","text":"Yu-ichi Hayashi"},{"@pid":"95/402","text":"Takaaki Mizuki"},{"@pid":"56/4703","text":"Hideaki Sone"}]},"title":"Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph.","venue":"WALCOM","pages":"20-31","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/SasakiAMHMS18","doi":"10.1007/978-3-319-75172-6_3","ee":"https://doi.org/10.1007/978-3-319-75172-6_3","url":"https://dblp.org/rec/conf/walcom/SasakiAMHMS18"}, "url":"URL#2674860" }, { "@score":"1", "@id":"2674861", "info":{"authors":{"author":[{"@pid":"184/6611","text":"Suri Dipannita Sayeed"},{"@pid":"r/MohammadSohelRahman","text":"M. Sohel Rahman"},{"@pid":"10/1151-1","text":"Atif Rahman 0001"}]},"title":"On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract).","venue":"WALCOM","pages":"207-215","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/SayeedRR18","doi":"10.1007/978-3-319-75172-6_18","ee":"https://doi.org/10.1007/978-3-319-75172-6_18","url":"https://dblp.org/rec/conf/walcom/SayeedRR18"}, "url":"URL#2674861" }, { "@score":"1", "@id":"2674862", "info":{"authors":{"author":[{"@pid":"214/8647","text":"Shinya Shiroshita"},{"@pid":"207/7954","text":"Tomoaki Ogasawara"},{"@pid":"137/5187","text":"Hidefumi Hiraishi"},{"@pid":"09/1655","text":"Hiroshi Imai"}]},"title":"FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models.","venue":"WALCOM","pages":"216-227","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/ShiroshitaOHI18","doi":"10.1007/978-3-319-75172-6_19","ee":"https://doi.org/10.1007/978-3-319-75172-6_19","url":"https://dblp.org/rec/conf/walcom/ShiroshitaOHI18"}, "url":"URL#2674862" }, { "@score":"1", "@id":"2674863", "info":{"authors":{"author":[{"@pid":"214/8642","text":"Kazuaki Yamazaki"},{"@pid":"04/6930","text":"Toshiki Saitoh"},{"@pid":"66/1763","text":"Masashi Kiyomi"},{"@pid":"02/5150","text":"Ryuhei Uehara"}]},"title":"Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs.","venue":"WALCOM","pages":"8-19","year":"2018","type":"Conference and Workshop Papers","access":"closed","key":"conf/walcom/YamazakiSKU18","doi":"10.1007/978-3-319-75172-6_2","ee":"https://doi.org/10.1007/978-3-319-75172-6_2","url":"https://dblp.org/rec/conf/walcom/YamazakiSKU18"}, "url":"URL#2674863" }, { "@score":"1", "@id":"2684842", "info":{"authors":{"author":[{"@pid":"r/MohammadSohelRahman","text":"M. Sohel Rahman"},{"@pid":"s/WingKinSung","text":"Wing-Kin Sung"},{"@pid":"02/5150","text":"Ryuhei Uehara"}]},"title":"WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings","venue":["WALCOM","Lecture Notes in Computer Science"],"volume":"10755","publisher":"Springer","year":"2018","type":"Editorship","key":"conf/walcom/2018","doi":"10.1007/978-3-319-75172-6","ee":"https://doi.org/10.1007/978-3-319-75172-6","url":"https://dblp.org/rec/conf/walcom/2018"}, "url":"URL#2684842" } ] } } } )