( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.

, , и . SoCG, том 164 из LIPIcs, стр. 51:1-51:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Stefan Neumann

Stefan Neumann

Stefan Neumann

Stefan Neumann

Stefan Neumann

 

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

Biclustering and Boolean Matrix Factorization in Data Streams., и . CoRR, (2020)Finding Tiny Clusters in Bipartite Graphs.. GI-Jahrestagung, том P-294 из LNI, стр. 253-254. GI, (2019)Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning., и . ESA, том 57 из LIPIcs, стр. 48:1-48:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Dynamic Maintenance of Monotone Dynamic Programs and Applications., , , и . STACS, том 254 из LIPIcs, стр. 36:1-36:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Recent Developments in Boolean Matrix Factorization., и . IJCAI, стр. 4922-4928. ijcai.org, (2020)Survey track.Ranking the Teams in European Football Leagues with Agony., , и . MLSA@PKDD/ECML, том 2284 из CEUR Workshop Proceedings, стр. 55-66. CEUR-WS.org, (2018)Analyzing the Communication Clusters in Datacenters✱., , , , , , и . WWW, стр. 3022-3032. ACM, (2023)Adversaries with Limited Information in the Friedkin-Johnsen Model., , и . KDD, стр. 2201-2210. ACM, (2023)Sublinear-Time Clustering Oracle for Signed Graphs., и . ICML, том 162 из Proceedings of Machine Learning Research, стр. 16496-16528. PMLR, (2022)Modeling the Impact of Timeline Algorithms on Opinion Dynamics Using Low-rank Updates., , , и . WWW, стр. 2694-2702. ACM, (2024)