PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Kupke, Joachim"

Author of the publication

copydeleteadd this publication to your clipboard
Automatic layout of UML class diagrams in orthogonal style.

, , , , , , , , and . Information Visualization, 3 (3): 189-208 (2004)

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.

PD Dr. phil. Joachim Wündisch University of Stuttgart

Dr. Joachim Pfeiffer University of Stuttgart

Hon. -Prof. Dr. -Ing. Joachim Birk University of Stuttgart

Prof. Dr. -Ing. Joachim Speidel University of Stuttgart

Univ. -Prof. Dr. -Ing. Joachim Groß University of Stuttgart

 

Other publications of authors with the same name

Reusing Optimal TSP Solutions for Locally Modified Input Instances., , , , , , and . IFIP TCS, volume 209 of IFIP, page 251-270. Springer, (2006)Caesar Automatic Layout of UML Class Diagrams., , , , , and . Graph Drawing, volume 2265 of Lecture Notes in Computer Science, page 461-462. Springer, (2001)GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon - System Demonstration., , , and . Graph Drawing, volume 2912 of Lecture Notes in Computer Science, page 123-128. Springer, (2003)The Parameterized Approximability of TSP with Deadlines., , , and . Theory Comput. Syst., 41 (3): 431-444 (2007)Approximation hardness of deadline-TSP reoptimization., , and . Theor. Comput. Sci., 410 (21-23): 2241-2249 (2009)A Diagramming Software for UML Class Diagrams., , , , , and . Graph Drawing Software, Springer, (2004)A Powerful Tool in Lower-Bounding Constantly Ambiguous Automata.. DCFS, page 276-284. New Mexico State University, Las Cruces, New Mexico, USA, (2006)A New Approach for Visualizing UML Class Diagrams., , , , , and . SOFTVIS, page 179-188. ACM, (2003)On Separating Constant from Polynomial Ambiguity of Finite Automata.. SOFSEM, volume 3831 of Lecture Notes in Computer Science, page 379-388. Springer, (2006)On the Approximability of TSP on Local Modifications of Optimally Solved Instances., , , , , , and . Algorithmic Operations Research, 2 (2): 83-93 (2007)