( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient Generation of k-Directional Assembly Sequences.

, , , и . SODA, стр. 122-131. ACM/SIAM, (1996)

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 de Kreij

Mark de Snaijer

Henk ˜deœ Berg

Mark Yampolsky

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

Mark Schütte

Crf2 - ein neues Antigen von Aspergillus fumigatus. TU Braunschweig, (2009)
 

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

I/O-Efficient Flow Modeling on Fat Terrains., , , , и . WADS, том 4619 из Lecture Notes in Computer Science, стр. 239-250. Springer, (2007)Data Structures for Fréchet Queries in Trajectory Data., , и . CCCG, стр. 214-219. (2017)Progressive geometric algorithms., , , , , , и . J. Comput. Geom., 6 (2): 72-92 (2015)Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces., , , и . Algorithmica, 82 (5): 1081-1100 (2020)Straight-path queries in trajectory data., и . J. Discrete Algorithms, (2016)Independent-set reconfiguration thresholds of hereditary graph classes., , и . Discret. Appl. Math., (2018)Geometric TSP on Sets., и . ISAAC, том 283 из LIPIcs, стр. 6:1-6:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Maximum-Weight Matching in Sliding Windows and Beyond., , и . ISAAC, том 212 из LIPIcs, стр. 73:1-73:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Clique-Based Separators for Geometric Intersection Graphs., , , и . ISAAC, том 212 из LIPIcs, стр. 22:1-22:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Online Broadcast Range-Assignment Problem., , и . ISAAC, том 181 из LIPIcs, стр. 60:1-60:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)