( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Counting Triangulations and Other Crossing-Free Structures via Onion Layers.

, , , и . Discret. Comput. Geom., 53 (4): 675-690 (2015)

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.

Karl Bringmann

Karl Bringmann

Karl Bringmann

Karl Bringmann

Karl Bringmann

 

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

On Near-Linear-Time Algorithms for Dense Subset Sum., и . CoRR, (2020)Multivariate Analysis of Orthogonal Range Searching and Graph Distances., , и . IPEC, том 115 из LIPIcs, стр. 4:1-4:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)., , , и . ACM Trans. Algorithms, 16 (4): 48:1-48:22 (2020)Multivariate Analysis of Orthogonal Range Searching and Graph Distances., , и . Algorithmica, 82 (8): 2292-2315 (2020)Polyline simplification has cubic complexity., и . J. Comput. Geom., 11 (2): 94-130 (2020)Faster Sublinear-Time Edit Distance., , , и . CoRR, (2023)The Time Complexity of Fully Sparse Matrix Multiplication., , , и . SODA, стр. 4670-4703. SIAM, (2024)Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution., , и . SODA, стр. 3069-3090. SIAM, (2022)Faster Minimization of Tardy Processing Time on a Single Machine., , , , и . ICALP, том 168 из LIPIcs, стр. 19:1-19:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max., , и . STOC, стр. 943-954. ACM, (2019)