( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Exact Crossing Minimization

, , , , , и . Graph Drawing, Limerick, Ireland, September 12-14, 2005, стр. pp. 37-48. Springer, (2006)

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.

Michael Jünger

Michael Jünger

Michael Jünger

Michael Jünger

Michael Ludwig Jünger

 

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

McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems., , , и . ALENEX, стр. 54-66. SIAM, (2022)Caesar Automatic Layout of UML Class Diagrams., , , , , и . GD, том 2265 из Lecture Notes in Computer Science, стр. 461-462. Springer, (2001)AGD: A Library of Algorithms for Graph Drawing., , , , , и . GD, том 2265 из Lecture Notes in Computer Science, стр. 473-474. Springer, (2001)AGD - A Library of Algorithms for Graph Drawing., , , и . Graph Drawing Software, Springer, (2004)Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization, , и . Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Computer Science, (1995)A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width., , и . J. Graph Algorithms Appl., 23 (3): 499-524 (2019)More Compact Orthogonal Drawings by Allowing Additional Bends †., , и . Information, 9 (7): 153 (2018)A Diagramming Software for UML Class Diagrams., , , , , и . Graph Drawing Software, Springer, (2004)Handbooks in Operations Research and Management Science, , и . Volume 7, глава Chapter 4 The traveling salesman problem, стр. 225--330. Elsevier, (1995)A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints., , и . Comput. Optim. Appl., 17 (1): 61-84 (2000)