( en | de | ru )

 

Disambiguation of "Iwata, Yoichi"

Author of the publication

copydeleteadd this publication to your clipboard
Linear-Time Kernelization for Feedback Vertex Set.

. ICALP, volume 80 of LIPIcs, page 68:1-68:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Takashi Iwata

Koichiro Iwata

Yoichi Kiuchi

Yoichi Otani

Yoichi Ishikawa

 

Other publications of authors with the same name

Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover., and . ALENEX, page 70-81. SIAM, (2015)Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling., , , , and . AAAI, page 2-8. AAAI Press, (2015)Improved Analysis of Highest-Degree Branching for Feedback Vertex Set., and . Algorithmica, 83 (8): 2503-2520 (2021)An Exact Algorithm for Diameters of Large Real Directed Graphs., , and . SEA, volume 9125 of Lecture Notes in Computer Science, page 56-67. Springer, (2015)On the Equivalence among Problems of Bounded Width., and . ESA, volume 9294 of Lecture Notes in Computer Science, page 754-765. Springer, (2015)On the Power of Tree-Depth for Fully Polynomial FPT Algorithms., , and . STACS, volume 96 of LIPIcs, page 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Linear-Time Kernelization for Feedback Vertex Set.. ICALP, volume 80 of LIPIcs, page 68:1-68:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A Faster Algorithm for Dominating Set Analyzed by the Potential Method.. IPEC, volume 7112 of Lecture Notes in Computer Science, page 41-54. Springer, (2011)Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction., , and . CIKM, page 909-918. ACM, (2013)Cut Tree Construction from Massive Graphs., , , , and . ICDM, page 775-780. IEEE Computer Society, (2016)