( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

, , , , , , , и . Proc. 26th Int. Symp. Graph Drawing & Network Vis. (GD'18), том 11282 из Lecture Notes in Computer Science, стр. 509--523. Springer-Verlag, (2018)
DOI: 10.1007/978-3-030-04414-5_36

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.

Hideakira Okamoto

Yoshio Sakurayama

Yoshio Inoguchi

Takashi Okamoto

Yoshio Hara

 

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

On bipartite powers of bigraphs., , и . Discret. Math. Theor. Comput. Sci., 14 (2): 11-20 (2012)Counting the number of independent sets in chordal graphs., , и . J. Discrete Algorithms, 6 (2): 229-242 (2008)A parameterized view to the robust recoverable base problem of matroids under structural uncertainty., , , , и . Oper. Res. Lett., 50 (3): 370-375 (2022)Subgraph Isomorphism on Graph Classes that Exclude a Substructure., , , , , , и . CoRR, (2019)The forbidden minor characterization of line-search antimatroids of rooted digraphs., и . Discret. Appl. Math., 131 (2): 523-533 (2003)Submodular reassignment problem for reallocating agents to tasks with synergy effects., , , и . Discret. Optim., 44 (Part): 100631 (2022)Reforming an Envy-Free Matching., , , , , , , и . AAAI, стр. 5084-5091. AAAI Press, (2022)Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem., , , и . TAMC, том 6648 из Lecture Notes in Computer Science, стр. 452-462. Springer, (2011)Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View.. ISAAC, том 2906 из Lecture Notes in Computer Science, стр. 686-695. Springer, (2003)Sequentially Swapping Colored Tokens on Graphs., , , , , , , , , и . WALCOM, том 10167 из Lecture Notes in Computer Science, стр. 435-447. Springer, (2017)