( en | de | ru )

 

Disambiguation of "Okamoto, Yoshio"

Author of the publication

copydeleteadd this publication to your clipboard
Reforming an Envy-Free Matching.

, , , , , , , and . AAAI, page 5084-5091. AAAI Press, (2022)

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.

Hideakira Okamoto

Yoshio Sakurayama

Yoshio Inoguchi

Takashi Okamoto

Yoshio Hara

 

Other publications of authors with the same name

Core Stability of Minimum Coloring Games., and . WG, volume 3353 of Lecture Notes in Computer Science, page 389-401. Springer, (2004)Some properties of the core on convex geometries.. Math. Methods Oper. Res., 56 (3): 377-386 (2003)Computational complexity and an integer programming model of Shakashaka., , , and . CCCG, Carleton University, Ottawa, Canada, (2013)Algorithmic Theory of Qubit Routing., , , , and . WADS, volume 14079 of Lecture Notes in Computer Science, page 533-546. Springer, (2023)On bipartite powers of bigraphs., , and . Discret. Math. Theor. Comput. Sci., 14 (2): 11-20 (2012)Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View.. ISAAC, volume 2906 of Lecture Notes in Computer Science, page 686-695. Springer, (2003)A parameterized view to the robust recoverable base problem of matroids under structural uncertainty., , , , and . Oper. Res. Lett., 50 (3): 370-375 (2022)Counting the number of independent sets in chordal graphs., , and . J. Discrete Algorithms, 6 (2): 229-242 (2008)Sequentially Swapping Colored Tokens on Graphs., , , , , , , , , and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 435-447. Springer, (2017)Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem., , , and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 452-462. Springer, (2011)