( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Multi-parameter Mechanism Design under Budget and Matroid Constraints.

, и . ESA, том 6942 из Lecture Notes in Computer Science, стр. 192-202. Springer, (2011)

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.

Monika Mühlbauer

Modelling wall interactions of a high-pressure, hollow cone spray. TU Darmstadt, (2009)

Monika Glass

Monika Frey

Monika Dücker

Monika Kramer

 

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

Shared-Memory Branch-and-Reduce for Multiterminal Cuts., , и . ALENEX, стр. 42-55. SIAM, (2020)Dynamic Clustering to Minimize the Sum of Radii., , и . ESA, том 87 из LIPIcs, стр. 48:1-48:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk).. ICALP, том 80 из LIPIcs, стр. 2:1-2:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Simple, Scalable and Effective Clustering via One-Dimensional Projections., , , , и . CoRR, (2023)Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives., , , , и . CAV (2), том 10982 из Lecture Notes in Computer Science, стр. 178-197. Springer, (2018)Combinatorial algorithms for web search engines: three success stories.. SODA, стр. 1022-1026. SIAM, (2007)Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time., , и . SODA, стр. 470-489. SIAM, (2017)Dynamically Maintaining the Persistent Homology of Time Series., , , и . SODA, стр. 243-295. SIAM, (2024)An O(n2) time algorithm for alternating Büchi games., и . SODA, стр. 1386-1399. SIAM, (2012)A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems., , , и . ITCS, том 251 из LIPIcs, стр. 69:1-69:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)