( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Möbius-invariant natural neighbor interpolation.

, и . SODA, стр. 128-129. ACM/SIAM, (2003)

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.

Ron Julius Eppstein

Bodo David

Erich David

Ernst David

Baruch Davidoff

 

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

Separator based sparsification for dynamic planar graph algorithms., , , и . STOC, стр. 208-217. ACM, (1993)Offline Algorithms for Dynamic Minimum Spanning Tree Problems. Journal of Algorithms, 17 (2): 237 - 250 (1994)A Heuristic Approach to Program Inversion.. IJCAI, стр. 219-221. Morgan Kaufmann, (1985)Track Layouts, Layered Path Decompositions, and Leveled Planarity., , , , и . Algorithmica, 81 (4): 1561-1583 (2019)Combinatorial Pair Testing: Distinguishing Workers from Slackers., , и . WADS, том 8037 из Lecture Notes in Computer Science, стр. 316-327. Springer, (2013)Solving Single-Digit Sudoku Subproblems.. FUN, том 7288 из Lecture Notes in Computer Science, стр. 142-153. Springer, (2012)Algorithms for Stable Matching and Clustering in a Grid., , и . IWCIA, том 10256 из Lecture Notes in Computer Science, стр. 117-131. Springer, (2017)Optimal Möbius Transformations for Information Visualization and Meshing., и . WADS, том 2125 из Lecture Notes in Computer Science, стр. 14-25. Springer, (2001)Optimally Sorting Evolving Data., , , , и . ICALP, том 107 из LIPIcs, стр. 81:1-81:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms., , , и . ICALP, том 107 из LIPIcs, стр. 89:1-89:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)