From post

Simultaneous Orthogonal Planarity

, , , , , , , , , и . Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD'16), том 9801 из Lecture Notes in Computer Science, стр. 532--545. Springer-Verlag, (сентября 2016)
DOI: 10.1007/978-3-319-50106-2_41

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.

 

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

Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)., , и . ICALP (1), том 5125 из Lecture Notes in Computer Science, стр. 294-305. Springer, (2008)Distance Constrained Labelings of Graphs of Bounded Treewidth., , и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 360-372. Springer, (2005)Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width., и . MFCS, том 7464 из Lecture Notes in Computer Science, стр. 348-359. Springer, (2012)Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity., и . TAMC, том 4978 из Lecture Notes in Computer Science, стр. 182-191. Springer, (2008)Completion of the Mixed Unit Interval Graphs Hierarchy., и . TAMC, том 9076 из Lecture Notes in Computer Science, стр. 284-296. Springer, (2015)On tractability of Cops and Robbers game., , и . IFIP TCS, том 273 из IFIP, стр. 171-185. Springer, (2008)Noncrossing Subgraphs in Topological Layouts., , и . SIAM J. Discret. Math., 4 (2): 223-244 (1991)Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous., , , и . SWAT, том 2368 из Lecture Notes in Computer Science, стр. 160-169. Springer, (2002)Preface., и . Eur. J. Comb., (2018)Complexity of choosing subsets from color sets., , и . Discret. Math., 191 (1-3): 139-148 (1998)