( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Linear-Time Kernelization for Feedback Vertex Set.

. ICALP, том 80 из LIPIcs, стр. 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.

Takashi Iwata

Koichiro Iwata

Yoichi Kiuchi

Yoichi Ishikawa

Yoichi Otani

 

Другие публикации лиц с тем же именем

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