( en | de | ru )

 

Disambiguation of "Tamaki, Hisao"

Author of the publication

copydeleteadd this publication to your clipboard
Matching Algorithms Are Fast in Sparse Random Graphs.

, , , and . STACS, volume 2996 of Lecture Notes in Computer Science, page 81-92. Springer, (2004)

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.

Hisao Ito

 

Other publications of authors with the same name

Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages.. ICLP, page 376-393. MIT Press, (1987)Optimal branch-decomposition of planar graphs in O(n3) Time., and . ACM Trans. Algorithms, 4 (3): 30:1-30:13 (2008)Existential Continuation., and . New Generation Comput., 6 (4): 421-438 (1989)Finalizing tentative matches from truncated preference lists.. CoRR, (2016)Transformational Logic Program Synthesis., and . FGCS, page 195-201. OHMSHA Ltd. Tokyo and North-Holland, (1984)Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study., , and . SEA, volume 8504 of Lecture Notes in Computer Science, page 388-399. Springer, (2014)An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization., , and . IPEC, volume 89 of LIPIcs, page 25:1-25:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Treedepth Parameterized by Vertex Cover Number., and . IPEC, volume 63 of LIPIcs, page 18:1-18:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)MAX/C on Sakai - A Web-based C-Programming Course., , and . CSEDU (1), page 196-201. INSTICC Press, (2010)Efficient randomized routing algorithms on the two-dimensional mesh of buses., , , and . Theor. Comput. Sci., 261 (2): 227-239 (2001)