Author of the publication

Integer Programming for the Maximum Cut Problem: A Refined Model and Implications for Branching.

, , and . ACDA, page 63-74. SIAM, (2023)

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.

 

Other publications of authors with the same name

A Diagramming Software for UML Class Diagrams., , , , , and . Graph Drawing Software, Springer, (2004)A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks., , , , and . OR, page 197-202. (2006)More Compact Orthogonal Drawings by Allowing Additional Bends †., , and . Information, 9 (7): 153 (2018)An Index For Temporal Closeness Computation in Evolving Graphs., and . SDM, page 280-288. SIAM, (2023)Parameterized Algorithms for Stochastic Steiner Tree Problems., , and . MEMICS, volume 7721 of Lecture Notes in Computer Science, page 143-154. Springer, (2012)The Crossing Number of Seq-Shellable Drawings of Complete Graphs., and . IWOCA, volume 10979 of Lecture Notes in Computer Science, page 273-284. Springer, (2018)Compact Layered Drawings of General Directed Graphs., , , , and . GD, volume 9801 of Lecture Notes in Computer Science, page 209-221. Springer, (2016)An Alternative Method to Crossing Minimization on Hierarchical Graphs.. GD, volume 1190 of Lecture Notes in Computer Science, page 318-333. Springer, (1996)Faster Kernels for Graphs with Continuous Attributes via Hashing., , , and . ICDM, page 1095-1100. IEEE Computer Society, (2016)Engineering A* Search for the Flip Distance of Plane Triangulations., and . SEA, volume 301 of LIPIcs, page 23:1-23:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)