( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization.

, , и . IPEC, том 89 из LIPIcs, стр. 25:1-25:12. 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.

Hisao Ito

 

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

MAX/C on Sakai - A Web-based C-Programming Course., , и . CSEDU (1), стр. 196-201. INSTICC Press, (2010)Finalizing tentative matches from truncated preference lists.. CoRR, (2016)Optimal branch-decomposition of planar graphs in O(n3) Time., и . ACM Trans. Algorithms, 4 (3): 30:1-30:13 (2008)Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages.. ICLP, стр. 376-393. MIT Press, (1987)Transformational Logic Program Synthesis., и . FGCS, стр. 195-201. OHMSHA Ltd. Tokyo and North-Holland, (1984)Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144)., , и . NII Shonan Meet. Rep., (2019)Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets., , и . SCG, стр. 314-323. ACM, (1997)An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization., , и . IPEC, том 89 из LIPIcs, стр. 25:1-25:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Treedepth Parameterized by Vertex Cover Number., и . IPEC, том 63 из LIPIcs, стр. 18:1-18:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study., , и . SEA, том 8504 из Lecture Notes in Computer Science, стр. 388-399. Springer, (2014)