Michael Jünger is involved in relevant fields of research such as Melanoma and Glioblastoma in the field of Cancer research. His study deals with a combination of Melanoma and Cancer research. Many of his studies on Graph involve topics that are commonly interrelated, such as Theoretical computer science. His Theoretical computer science study typically links adjacent topics like Graph. His Internal medicine study often links to related topics such as Chemotherapy. Chemotherapy is often connected to Internal medicine in his work. Many of his studies on Anticancer drug involve topics that are commonly interrelated, such as Drug. In his articles, he combines various disciplines, including Drug and Pharmacology. The study of Pharmacology is intertwined with the study of Anticancer drug in a number of ways.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
An application of combinatorial optimization to statistical physics and circuit layout design
Francisco Barahona;Martin Grötschel;Michael Jünger;Gerhard Reinelt.
Operations Research (1988)
A Cutting Plane Algorithm for the Linear Ordering Problem
Martin Grötschel;Michael Jünger;Gerhard Reinelt.
Operations Research (1984)
50 years of integer programming 1958-2008 : from the early years to the state-of-the-art
M. Jünger.
(2010)
Drawing large graphs with a potential-field-based multilevel algorithm
Stefan Hachul;Michael Jünger.
graph drawing (2004)
Graph Drawing Software
Michael Junger;Petra Mutzel.
(2003)
2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
Michael Jünger;Petra Mutzel.
Journal of Graph Algorithms and Applications (1997)
Experiments in quadratic 0-1 programming
F. Barahona;M. Junger;G. Reinelt.
Mathematical Programming (1989)
50 Years of Integer Programming 1958-2008
Michael Jünger;Thomas M. Liebling;Denis Naddef;George L. Nemhauser.
(2010)
Facets of the linear ordering polytope
Martin Grötschel;Michael Jünger;Gerhard Reinelt.
Mathematical Programming (1985)
An experimental comparison of fast algorithms for drawing general large graphs
Stefan Hachul;Michael Jünger.
Lecture Notes in Computer Science (2006)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Bonn
Heidelberg University
Heinrich Heine University Düsseldorf
University of Arizona
United States Military Academy
Polytechnique Montréal
Université Catholique de Louvain
Max Planck Institute for Informatics
Max Planck Institute for Informatics
University of Tübingen
University of Edinburgh
Claude Bernard University Lyon 1
Leipzig University
Walter and Eliza Hall Institute of Medical Research
Washington University in St. Louis
University of Nottingham
United States Department of Agriculture
Vita-Salute San Raffaele University
University of British Columbia
Johns Hopkins University Applied Physics Laboratory
University of Duisburg-Essen
Oswaldo Cruz Foundation
National Institutes of Biomedical Innovation, Health and Nutrition
Albert Einstein College of Medicine
University of Colorado Denver
Medical University of Vienna