( en | de | ru )

 

Disambiguation of "Kobayashi, Yasuaki"

Author of the publication

copydeleteadd this publication to your clipboard
A Framework for Secure and Trustworthy Data Management in Supply Chain.

, , , , , and . MobiWIS, volume 11673 of Lecture Notes in Computer Science, page 148-159. Springer, (2019)

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.

Yasuaki Saigusa

Yoshitake Kobayashi

Wakiko Kobayashi

Wataru Kobayashi

Makoto Kobayashi

 

Other publications of authors with the same name

Metric Learning for Ordered Labeled Trees with pq-grams., , , and . ECAI, volume 325 of Frontiers in Artificial Intelligence and Applications, page 1475-1482. IOS Press, (2020)Malware Detection for IoT Devices using Automatically Generated White List and Isolation Forest., , , and . IoTBDS, page 38-47. SCITEPRESS, (2021)Consideration on Data Conformance Toward Building Trust in Supply Chain., , , , , , , and . EuCNC, page 128-132. IEEE, (2020)A Linear Edge Kernel for Two-Layer Crossing Minimization., , , and . COCOON, volume 7936 of Lecture Notes in Computer Science, page 458-468. Springer, (2013)A Framework for Secure and Trustworthy Data Management in Supply Chain., , , , , and . MobiWIS, volume 11673 of Lecture Notes in Computer Science, page 148-159. Springer, (2019)An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion., , , , , , , and . CoRR, (2020)Structural Parameterizations of Vertex Integrity., , , , , and . CoRR, (2023)Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph., , , , and . SPIRE, volume 14240 of Lecture Notes in Computer Science, page 28-34. Springer, (2023)Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets., , , , , , and . MFCS, volume 241 of LIPIcs, page 6:1-6:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Computing Directed Pathwidth in O(1.89n) Time., , , , and . Algorithmica, 75 (1): 138-157 (2016)