( en | de | ru )

 

Disambiguation of "Weyand, Christopher"

Author of the publication

copydeleteadd this publication to your clipboard
An Efficient Branch-and-Bound Solver for Hitting Set.

, , , and . ALENEX, page 209-220. SIAM, (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. You can also use the button next to the name to display some publications already assigned to the person.

Heiko Weyand

Manfred Weyand

Kerstin Weyand

Kurt Weyand

Klaus Weyand

 

Other publications of authors with the same name

Geometric Inhomogeneous Random Graphs for Algorithm Engineering.. Karlsruhe Institute of Technology, Germany, (2023)Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs., , , , , and . CoRR, (2019)Efficiently Computing Directed Minimum Spanning Trees., , and . ALENEX, page 86-95. SIAM, (2023)Algorithmic Improvements on Hilbert and Moore Treemaps for Visualization of Large Tree-structured Datasets., , , and . EuroVis (Short Papers), page 115-119. Eurographics Association, (2021)Efficiently Computing Maximum Flows in Scale-Free Networks., , and . ESA, volume 204 of LIPIcs, page 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Branch-And-Bound Algorithm for Cluster Editing., , , , , , , and . SEA, volume 233 of LIPIcs, page 13:1-13:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Efficiently Computing Maximum Flows in Scale-Free Networks., , and . CoRR, (2020)An Efficient Branch-and-Bound Solver for Hitting Set., , , and . CoRR, (2021)Efficiently generating geometric inhomogeneous and hyperbolic random graphs., , , , , and . Netw. Sci., 10 (4): 361-380 (December 2022)Efficiently Computing Directed Minimum Spanning Trees., , and . CoRR, (2022)