( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover.

, , , , и . CoRR, (2023)

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.

Yasuaki Saigusa

Yoshitake Kobayashi

Wakiko Kobayashi

Wataru Kobayashi

Makoto Kobayashi

 

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

A Framework for Secure and Trustworthy Data Management in Supply Chain., , , , , и . MobiWIS, том 11673 из Lecture Notes in Computer Science, стр. 148-159. Springer, (2019)Computing the Largest Bond and the Maximum Connected Cut of a Graph., , , , , , , , и . Algorithmica, 83 (5): 1421-1458 (2021)An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion., , , , , , , и . CoRR, (2020)Structural Parameterizations of Vertex Integrity., , , , , и . CoRR, (2023)Parameterized Complexity of Finding Dissimilar Shortest Paths., , и . CoRR, (2024)A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization., и . Algorithmica, 72 (3): 778-790 (2015)A Linear Edge Kernel for Two-Layer Crossing Minimization., , , и . COCOON, том 7936 из Lecture Notes in Computer Science, стр. 458-468. Springer, (2013)Consideration on Data Conformance Toward Building Trust in Supply Chain., , , , , , , и . EuCNC, стр. 128-132. IEEE, (2020)Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability., , , и . CoRR, (2020)Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets., , , , , , и . MFCS, том 241 из LIPIcs, стр. 6:1-6:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)