iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.uni-trier.de/pid/61/11063.xml
Yoichi Iwata
Yoichi Iwata Yutaro Yamaguchi 0001 Finding a Shortest Non-Zero Path in Group-Labeled Graphs. 1253-1282 2022 December 42 Comb. Supplement 2 https://doi.org/10.1007/s00493-021-4736-x db/journals/combinatorica/combinatorica42.html#IwataY22
Yoichi Iwata Yusuke Kobayashi 0001 Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. 2503-2520 2021 83 Algorithmica 8 https://doi.org/10.1007/s00453-021-00815-w db/journals/algorithmica/algorithmica83.html#IwataK21
Yoichi Iwata Takuto Shigemura Separator-Based Pruned Dynamic Programming for Steiner Tree. 1520-1527 2019 AAAI https://doi.org/10.1609/aaai.v33i01.33011520 conf/aaai/2019 db/conf/aaai/aaai2019.html#IwataS19 Édouard Bonnet Yoichi Iwata Bart M. P. Jansen Lukasz Kowalik Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. 23:1-23:14 2019 ESA https://doi.org/10.4230/LIPIcs.ESA.2019.23 conf/esa/2019 db/conf/esa/esa2019.html#BonnetIJK19 Yoichi Iwata Yusuke Kobayashi 0001 Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. 22:1-22:11 2019 IPEC https://doi.org/10.4230/LIPIcs.IPEC.2019.22 conf/iwpec/2019 db/conf/iwpec/ipec2019.html#IwataK19
Yoichi Iwata Yusuke Kobayashi 0001 Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. 2019 abs/1905.12233 CoRR http://arxiv.org/abs/1905.12233 db/journals/corr/corr1905.html#abs-1905-12233
Édouard Bonnet Yoichi Iwata Bart M. P. Jansen Lukasz Kowalik Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. 2019 abs/1908.09325 CoRR http://arxiv.org/abs/1908.09325 db/journals/corr/corr1908.html#abs-1908-09325
Hidefumi Hiraishi Hiroshi Imai Yoichi Iwata Bingkai Lin Parameterized Algorithms to Compute Ising Partition Function. 1398-1403 2018 101-A IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 9 https://doi.org/10.1587/transfun.E101.A.1398 http://search.ieice.org/bin/summary.php?id=e101-a_9_1398 db/journals/ieicet/ieicet101a.html#HiraishiIIL18
Yoichi Iwata Yutaro Yamaguchi 0001 Yuichi Yoshida 0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms. 462-473 2018 FOCS https://doi.org/10.1109/FOCS.2018.00051 https://doi.ieeecomputersociety.org/10.1109/FOCS.2018.00051 conf/focs/2018 db/conf/focs/focs2018.html#IwataYY18 Yoichi Iwata Tomoaki Ogasawara Naoto Ohsaka On the Power of Tree-Depth for Fully Polynomial FPT Algorithms. 41:1-41:14 2018 STACS https://doi.org/10.4230/LIPIcs.STACS.2018.41 conf/stacs/2018 db/conf/stacs/stacs2018.html#IwataOO18 Yoichi Iwata Linear-Time Kernelization for Feedback Vertex Set. 68:1-68:14 2017 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2017.68 conf/icalp/2017 db/conf/icalp/icalp2017.html#Iwata17
Yoichi Iwata Yutaro Yamaguchi 0001 Yuichi Yoshida Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing. 2017 abs/1704.02700 CoRR http://arxiv.org/abs/1704.02700 db/journals/corr/corr1704.html#IwataYY17
Yoichi Iwata Tomoaki Ogasawara Naoto Ohsaka On the Power of Tree-Depth for Fully Polynomial FPT Algorithms. 2017 abs/1710.04376 CoRR http://arxiv.org/abs/1710.04376 db/journals/corr/corr1710.html#abs-1710-04376
Yoichi Iwata Magnus Wahlström Yuichi Yoshida Half-integrality, LP-branching, and FPT Algorithms. 1377-1411 2016 45 SIAM J. Comput. 4 https://doi.org/10.1137/140962838 db/journals/siamcomp/siamcomp45.html#IwataWY16
Takuya Akiba Yoichi Iwata Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover. 211-225 2016 609 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.09.023 db/journals/tcs/tcs609.html#AkibaI16
Takuya Akiba Yoichi Iwata Yosuke Sameshima Naoto Mizuno Yosuke Yano Cut Tree Construction from Massive Graphs. 775-780 2016 ICDM https://doi.org/10.1109/ICDM.2016.0089 https://doi.ieeecomputersociety.org/10.1109/ICDM.2016.0089 conf/icdm/2016 db/conf/icdm/icdm2016.html#AkibaISMY16
Yoichi Iwata Linear-time Kernelization for Feedback Vertex Set. 2016 abs/1608.01463 CoRR http://arxiv.org/abs/1608.01463 db/journals/corr/corr1608.html#Iwata16
Takuya Akiba Yoichi Iwata Yosuke Sameshima Naoto Mizuno Yosuke Yano Cut Tree Construction from Massive Graphs. 2016 abs/1609.08723 CoRR http://arxiv.org/abs/1609.08723 db/journals/corr/corr1609.html#AkibaISMY16
Takuya Akiba Takanori Hayashi 0002 Nozomi Nori Yoichi Iwata Yuichi Yoshida Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. 2-8 2015 AAAI https://doi.org/10.1609/aaai.v29i1.9154 conf/aaai/2015 db/conf/aaai/aaai2015.html#AkibaHNIY15 Takuya Akiba Yoichi Iwata Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover. 70-81 2015 ALENEX https://doi.org/10.1137/1.9781611973754.7 conf/alenex/2015 db/conf/alenex/alenex2015.html#AkibaI15 Yoichi Iwata Yuichi Yoshida On the Equivalence among Problems of Bounded Width. 754-765 2015 ESA https://doi.org/10.1007/978-3-662-48350-3_63 conf/esa/2015 db/conf/esa/esa2015.html#IwataY15 Takuya Akiba Yoichi Iwata Yuki Kawata An Exact Algorithm for Diameters of Large Real Directed Graphs. 56-67 2015 SEA https://doi.org/10.1007/978-3-319-20086-6_5 conf/wea/2015 db/conf/wea/sea2015.html#AkibaIK15
Yoichi Iwata Yuichi Yoshida On the Equivalence among Problems of Bounded Width. 2015 abs/1509.01014 CoRR http://arxiv.org/abs/1509.01014 db/journals/corr/corr1509.html#IwataY15
Takanori Maehara Takuya Akiba Yoichi Iwata Ken-ichi Kawarabayashi Computing Personalized PageRank Quickly by Exploiting Graph Structures. 1023-1034 2014 7 Proc. VLDB Endow. 12 http://www.vldb.org/pvldb/vol7/p1023-maehara.pdf https://doi.org/10.14778/2732977.2732978 db/journals/pvldb/pvldb7.html#MaeharaAIK14
Takuya Akiba Yoichi Iwata Ken-ichi Kawarabayashi Yuki Kawata Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. 147-154 2014 ALENEX https://doi.org/10.1137/1.9781611973198.14 conf/alenex/2014 db/conf/alenex/alenex2014.html#AkibaIKK14 Yoichi Iwata Keigo Oka Yuichi Yoshida Linear-Time FPT Algorithms via Network Flow. 1749-1761 2014 SODA https://doi.org/10.1137/1.9781611973402.127 conf/soda/2014 db/conf/soda/soda2014.html#IwataOY14 Yoichi Iwata Keigo Oka Fast Dynamic Graph Algorithms for Parameterized Problems. 241-252 2014 SWAT https://doi.org/10.1007/978-3-319-08404-6_21 conf/swat/2014 db/conf/swat/swat2014.html#IwataO14 Takuya Akiba Yoichi Iwata Yuichi Yoshida Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. 237-248 2014 WWW https://doi.org/10.1145/2566486.2568007 conf/www/2014 db/conf/www/www2014.html#AkibaIY14
Yoichi Iwata Keigo Oka Fast Dynamic Graph Algorithms for Parameterized Problems. 2014 abs/1404.7307 CoRR http://arxiv.org/abs/1404.7307 db/journals/corr/corr1404.html#IwataO14
Takuya Akiba Yoichi Iwata Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover. 2014 abs/1411.2680 CoRR http://arxiv.org/abs/1411.2680 db/journals/corr/corr1411.html#AkibaI14
Takuya Akiba Yoichi Iwata Yuichi Yoshida Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction. 909-918 2013 CIKM https://doi.org/10.1145/2505515.2505751 conf/cikm/2013 db/conf/cikm/cikm2013.html#AkibaIY13 Yosuke Yano Takuya Akiba Yoichi Iwata Yuichi Yoshida Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. 1601-1606 2013 CIKM https://doi.org/10.1145/2505515.2505724 conf/cikm/2013 db/conf/cikm/cikm2013.html#YanoAIY13 Takuya Akiba Yoichi Iwata Yuichi Yoshida Fast exact shortest-path distance queries on large networks by pruned landmark labeling. 349-360 2013 SIGMOD Conference https://doi.org/10.1145/2463676.2465315 conf/sigmod/2013 db/conf/sigmod/sigmod2013.html#AkibaIY13 Yoichi Iwata Yuichi Yoshida Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra. 127-138 2013 STACS https://doi.org/10.4230/LIPIcs.STACS.2013.127 conf/stacs/2013 db/conf/stacs/stacs2013.html#IwataY13
Takuya Akiba Yoichi Iwata Yuichi Yoshida Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling http://arxiv.org/abs/1304.4661 2013 CoRR abs/1304.4661 db/journals/corr/corr1304.html#abs-1304-4661
Yoichi Iwata Keigo Oka Yuichi Yoshida Linear-Time FPT Algorithms via Network Flow. 2013 CoRR http://arxiv.org/abs/1307.4927 abs/1307.4927 db/journals/corr/corr1307.html#IwataOY13
Yoichi Iwata A Faster Algorithm for Dominating Set Analyzed by the Potential Method. 41-54 2011 IPEC https://doi.org/10.1007/978-3-642-28050-4_4 conf/iwpec/2011 db/conf/iwpec/ipec2011.html#Iwata11 Takuya Akiba Édouard Bonnet Takanori Hayashi 0002 Hidefumi Hiraishi Hiroshi Imai Bart M. P. Jansen Ken-ichi Kawarabayashi Yuki Kawata Yusuke Kobayashi 0001 Lukasz Kowalik Bingkai Lin Takanori Maehara Naoto Mizuno Nozomi Nori Tomoaki Ogasawara Naoto Ohsaka Keigo Oka Yosuke Sameshima Takuto Shigemura Magnus Wahlström Yutaro Yamaguchi 0001 Yosuke Yano Yuichi Yoshida