From post

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

Computing Maximum Independent Set on Outerstring Graphs and Their Relatives.

P. Bose, P. Carmi, J. Keil, A. Maheshwari, S. Mehrabi, D. Mondal, и M. Smid. WADS, том 11646 из Lecture Notes in Computer Science, стр. 211-224. Springer, (2019)

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.

Mark Oliver Keil

Mark J Boda

Mark Yampolsky

Maßnahmen zur Sicherung von E2E-QoS bei verketteten DienstenM. Yampolsky. Uni München, (2009)

Mark Schütte

Crf2 - ein neues Antigen von Aspergillus fumigatusM. Schütte. TU Braunschweig, (2009)

Heinrich J J Mieschendahl

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

Computing Maximum Independent Set on Outerstring Graphs and Their Relatives.P. Bose, P. Carmi, J. Keil, A. Maheshwari, S. Mehrabi, D. Mondal, и M. Smid. WADS, том 11646 из Lecture Notes in Computer Science, стр. 211-224. Springer, (2019)Minimum Ply Covering of Points with Unit Squares.S. Durocher, J. Keil, и D. Mondal. CoRR, (2022)Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks.M. Watson, и J. Keil. ICCSA (1), том 3980 из Lecture Notes in Computer Science, стр. 121-130. Springer, (2006)Boundary Labeling for Rectangular Diagrams.P. Bose, P. Carmi, J. Keil, S. Mehrabi, и D. Mondal. SWAT, том 101 из LIPIcs, стр. 12:1-12:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Delauney Triangulation Closely Approximates the Complete Euclidean Graph.J. Keil, и C. Gutwin. WADS, том 382 из Lecture Notes in Computer Science, стр. 47-56. Springer, (1989)The Bichromatic Rectangle Problem in High Dimensions.J. Backer, и J. Keil. CCCG, стр. 157-160. (2009)Minimum spanning trees on polyhedra.M. Spriggs, и J. Keil. CCCG, (1999)Decomposing a Polygon into Simpler Components.J. Keil. SIAM J. Comput., 14 (4): 799-817 (1985)Clustering Algorithms Based on Minimum and Maximum Spanning Trees.T. Asano, B. Bhattacharya, J. Keil, и F. Yao. SCG, стр. 252-257. ACM, (1988)Finding a Maximum Clique in a Disk Graph.J. Espenant, J. Keil, и D. Mondal. SoCG, том 258 из LIPIcs, стр. 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

BibSonomy

Disambiguation