From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Two-layer Drawings of Bipartite Graphs.

A. Diwan, B. Roy, и S. Ghosh. Electron. Notes Discret. Math., (2017)

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.

Partitions of planar point sets into polygons.A. Diwan, и B. Roy. CCCG, стр. 147-154. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)Some results on point visibility graphs.S. Ghosh, и B. Roy. Theor. Comput. Sci., (2015)On Colouring Point Visibility Graphs.A. Diwan, и B. Roy. CALDAM, том 10156 из Lecture Notes in Computer Science, стр. 156-165. Springer, (2017)Complexity of Maximum Cut on Interval Graphs.R. Adhikary, K. Bose, S. Mukherjee, и B. Roy. Discret. Comput. Geom., 70 (2): 307-322 (сентября 2023)Consistent Subset Problem with Two Labels.K. Khodamoradi, R. Krishnamurti, и B. Roy. CALDAM, том 10743 из Lecture Notes in Computer Science, стр. 131-142. Springer, (2018)Vertex Guarding in Weak Visibility Polygons.P. Bhattacharya, S. Ghosh, и B. Roy. CoRR, (2014)On colouring point visibility graphs.A. Diwan, и B. Roy. Discret. Appl. Math., (2020)Range assignment of base-stations maximizing coverage area without interference.A. Acharyya, M. De, S. Nandy, и B. Roy. Theor. Comput. Sci., (2020)Two-layer Drawings of Bipartite Graphs.A. Diwan, B. Roy, и S. Ghosh. Electron. Notes Discret. Math., (2017)Drawing Bipartite Graphs in Two Layers with Specified Crossings.A. Diwan, B. Roy, и S. Ghosh. CALDAM, том 11394 из Lecture Notes in Computer Science, стр. 97-108. Springer, (2019)