From post

Algorithmic Improvements on Hilbert and Moore Treemaps for Visualization of Large Tree-structured Datasets.

, , , и . EuroVis (Short Papers), стр. 115-119. Eurographics Association, (2021)

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.

 

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

Geometric Inhomogeneous Random Graphs for Algorithm Engineering.. Karlsruhe Institute of Technology, Germany, (2023)Efficiently Computing Directed Minimum Spanning Trees., , и . ALENEX, стр. 86-95. SIAM, (2023)Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs., , , , , и . ESA, том 144 из LIPIcs, стр. 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Branch-And-Bound Algorithm for Cluster Editing., , , , , , , и . SEA, том 233 из LIPIcs, стр. 13:1-13:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)An Efficient Branch-and-Bound Solver for Hitting Set., , , и . ALENEX, стр. 209-220. SIAM, (2022)Efficiently Computing Directed Minimum Spanning Trees., , и . CoRR, (2022)Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time., , , и . IPEC, том 249 из LIPIcs, стр. 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm., , , , , , , и . IPEC, том 214 из LIPIcs, стр. 27:1-27:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm., , , , , , , и . IPEC, том 214 из LIPIcs, стр. 31:1-31:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Algorithmic Improvements on Hilbert and Moore Treemaps for Visualization of Large Tree-structured Datasets., , , и . EuroVis (Short Papers), стр. 115-119. Eurographics Association, (2021)