( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies.

, , , и . INFOCOM, стр. 1649-1658. IEEE, (2022)

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.

Josef Hanauer

Alfred Hanauer

Werner Hanauer

Patricia Hanauer

Wilhelm Hanauer

 

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

On b-Matching and Fully-Dynamic Maximum k-Edge Coloring., , и . CoRR, (2023)Improved Exact and Heuristic Algorithms for Maximum Weight Clique., , , , и . CoRR, (2023)Fully Dynamic Single-Source Reachability in Practice: An Experimental Study., , и . CoRR, (2019)Faster Fully Dynamic Transitive Closure in Practice., , и . SEA, том 160 из LIPIcs, стр. 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Linear Orderings of Sparse Graphs. Passau University, Germany, (2018)base-search.net (ftunivpassau:oai:kobv.de-opus4-uni-passau:552).Characterizing Planarity by the Splittable Deque., , , и . GD, том 8242 из Lecture Notes in Computer Science, стр. 25-36. Springer, (2013)O'Reach: Even Faster Reachability in Large Graphs., , и . SEA, том 190 из LIPIcs, стр. 13:1-13:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)., , и . SAND, том 221 из LIPIcs, стр. 1:1-1:47. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Recognizing Outer 1-Planar Graphs in Linear Time., , , , , , и . GD, том 8242 из Lecture Notes in Computer Science, стр. 107-118. Springer, (2013)Assisted Normative Reasoning with Aristotelian Diagrams., , и . JURIX, том 379 из Frontiers in Artificial Intelligence and Applications, стр. 89-94. IOS Press, (2023)