Research Institute for Discrete Mathematics

Technical Reports

ErscheinungsJahre / Years of publication

• 1972 1973 1974 1975 1976 1977 1978 1979
• 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989
• 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999
• 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009
• 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019
• 2020 2021 2022 2023

1972

• Bibliography on integer programming and related areas
  Report No. 7201 : Korte, B.
  in: C. Kastning (Ed.:): Integer Programming and Related Areas : A Classified Bibliography. Berlin, Heidelberg, New York : Springer, 1976. (Lecture Notes in Economics and Mathematical Systems ; 128)
• Le Chatelier-Samuelsonsches Prinzip und parameterabhängige Optimierung
  Report No. 7202: Eichhorn, W.; Oettli, W.
  in: Zeitschrift für Operations Research Serie A, 16 (1972), 233-244
• Some numerical methods in stochastic linear programming and their computer implementation
  Report No. 7203: Bereanu, B.
  published under the title: On stochastic linear programming IV. Some numerical methods and their computer implementation, in: B. Bereanu, M. Iosifescu, T. Postelnicu, P. Tautu (Ed.:): Proceedings of the Fourth Conference on Probability Theory, Brasov 1971. Bukarest : Editura Academiei Rep. Soc. Romania, 1973, 13-36
• An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
  Report No. 7204: Oettli, W.
  in: Mathematical Programming, 3 (1972), 302-311
• Das Tableau économique von Francois Quesnay als statisches offenes Leontief-System
  Report No. 7205: Korte, B.
  in: Jahrbuch für Sozialwissenschaft, 23 (1972), 135-144
• Über eine Klasse kombinatorischer Extremalprobleme
  Report No. 7206: Korte, B.
  in: F. Erwe, L. Reich, S. Ruscheweyh (Ed.:): Festband anläßlich des 65. Geburtstages von Herrn Prof. Dr.Dr.h.c. Ernst Peschl am 1. September 1971. München, Wien : Oldenbourg, 1972, 123-134. (Berichte der Gesellschaft für Mathematik und Datenverarbeitung (GMD) ; 57)
• Eine allgemeine, symmetrische Formulierung des Dekompositionsprinzips für duale Paare nichtlinearer minmax- und maxmin-Probleme.
  Report No. 7207: Oettli, W.
  in: Zeitschrift für Operations Research, Serie A, 18 (1972), 1-18
• Lexikographisch monoton steigende Knapsackprobleme
  Report No. 7208: Fabian, C.
• Symmetric duality, and a convergent subgradient method, for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and the contraints
  Report No. 7209: Oettli, W.
  in: Journal of Approximation Theory, 14 (1975), 43-50
• Einzelschrittverfahren zur Lösung konvexer und dual-konvexer Minimierungsprobleme
  Report No. 7210: Oettli, W.
  in: Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 54 (1974), 343-351

1973

Zurück zum Anfang / Back to start

• Matroide - ihre Definition und grundlegenden Eigenschaften
  Report No. 7311: von Randow, R.
  extended (English) version see WP 7427
• Untersuchungen von Auswirkungen der Rohölkrise mittels Input-Output Analysen
  Report No. 7312: Korte, B.

1974

Zurück zum Anfang / Back to start

• Perfect zero-one matrices
  Report No. 7413: Padberg, M.W.
  in: Mathematical Programming, 6 (1974), 180-196
• Perfect-zero-one matrices - II.
  Report No. 7414: Padberg, M.W.
  in: P. Gessner, R. Henn, V. Steinecke, H. Todt (Eds.): Proceedings in Operations Research 3. Würzburg, Wien : Physica-Verlag, 1974, 75-83
• The travelling salesman problem and a class of polyhedra of diameter two
  Report No. 7415: Padberg, M.W.
  in: Mathematical Programming, 7 (1974), 32-45
• Lineare Charakterisierungen von Travelling Salesman Problemen
  Report No. 7416 R 15: Grötschel, M.; Padberg, M.W.
  in: Zeitschrift für Operations Research Serie A, 21 (1977), 33-64
• Partial linear characterizations of the asymmetric travelling salesman polytope
  Report No. 7417 : Grötschel, M.; Padberg, M.W.
  in: Mathematical Programming, 8 (1975), 378-381
• Integer programs with continuous variables (Bonn Workshop on Integer Programming, July 1974)
  Report No. 7418: Johnson, E.L.
• Boolean elements in combinatorial optimization (Bonn Workshop on Integer Programming, July 1974)
  Report No. 7419: Hammer, P.L.
  in: P. L. Hammer, E. L. Johnson, B. Korte (Eds.): Discrete Optimization I. Amsterdam, New York, Oxford : North- Holland, 1979, 51-71. (Annals of Discrete Mathematics ; 4)
• Facet and strong valid inequalities in I.P. with an application to simple n-person cooperative games (Bonn Workshop on Integer Programming, July 1974)
  Report No. 7420: Wolsey, L.A.
  revised version published under the Title: The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs, in: International Journal of Game Theory, 5 (1976), 227- 238
• Dual correspondences for blocking and antiblocking sets (Bonn Workshop on Integer Programming, July 1974)
  Report No. 7421: Tind, J.
• Approximation ganzzahliger Polyeder durch Corner Polyeder
  Report No. 7422 : Bachem, A.
  in: Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 56 (1976), 332-333
• Characterizations of totally unimodular, balanced and perfect matrices (Bonn Workshop on Integer Programming, July 1974)
  Report No. 7423: Padberg, M.W.
  in: B. Roy (Ed.): Combinatorial Programming : Methods and Applications. Dordrecht, Boston : Reidel, 1975, 275- 284. (Nato Advanced Study Institutes Series : C ; 19)
• Verknüpfung des Dekompositionsprinzips von Benders mit dem Prinzip des lexikographischen Suchens
  Report No. 7424: Fabian, C.
  in: A. Schub, H. Späth, J. Stoer, H.-J. Zimmermann, (Eds.): Proceedings in Operations Research 4. Würzburg, Wien : Physica-Verlag, 1974, 192-203
• A note on the total unimodularity of matrices
  Report No. 7425: Padberg, M.W.
  in: Discrete Mathematics, 14 (1976), 273-278
• Solving optimization problems with many constraints by a sequence of subproblems containing only two constraints
  Report No. 7426: Oettli, W.
  in: Mathematische Nachrichten, 71 (1976), 143-145
• Introduction to the theory of matroids
  Report No. 7427: von Randow, R.
  published as: R. von Randow: Introduction to the Theory of Matroids. Berlin, Heidelberg, New York : Springer, 1975. (Lecture Notes in Economics and Mathematical Systems ; 109)
• The theorem of the alternative, the key-theorem, and the vector-maximum problem, for non-polyhedral ordering cones
  Report No. 7428: Lehmann, R.; Oettli, W.
  in: Mathematical Programming, 8 (1975), 332-344
• The principle of feasible directions for nonlinear approximants and infinitely many constraints
  Report No. 7429: Blum E.; Oettli, W.
  in: Istitutio Nazionale di Alta Matematica: Symposia Matematica 19. London, New York : Academic Press, 1976, 91-101
• Zur Oberflächenstruktur des Travelling Salesman Polytopen
  Report No. 7430 : Grötschel, M.; Padberg, M.W.
  in: A. Schub, H. Späth, J. Stoer, H.-J. Zimmermann (Eds.): Proceedings in Operations Research, 4. Würzburg, Wien : Physica-Verlag, 1974, 207-211
• Über Graphen mit Kreisen, die gegebene Wege enthalten
  Report No. 7431: Grötschel, M.
  in: J. Kohlas., O. Seifert, P. Stähly, H.-J. Zimmermann (Eds.): Proceedings in Operations Research, 5. Würzburg,Wien : Physica-Verlag, 1976, 119-121

1975

Zurück zum Anfang / Back to start

• A property of continuous unbounded algorithms
  Report No. 7532 : Grötschel, M.; von Randow, R.
  in: Mathematical Programming, 14 (1978), 373-377
• A solution of a special class of quadratic programming problems using matrix-pseudoinverses
  Report No. 7533: Braun, J.
• Intersection of corner-polyhedra and a decomposition algorithm
  Report No. 7534: Bachem, A.
• Eine Eigenschaft von stetigen unbeschränkten Algorithmen
  Report No. 7535: Grötschel, M.; von Randow, R.
  English translation of WP 7532
• Randomisierungen unendlicher n-Personen-Spiele
  Report No. 7536 : Hausmann, D.
  in: J. Kohlas, O. Seifert, P. Stähly, H.-J. Zimmermann (Eds.): Proceedings in Operations Research, 5. Würzburg, Wien : Physica-Verlag, 1976, 84-85
• Graphs with cycles containing given paths
  Report No. 7537 : Grötschel, M.
  in: P. L. Hammer, E. L. Johnson, B. Korte, G. Nemhauser (Eds.): Studies in Integer Programming, Amsterdam, New York, Oxford : North-Holland, 1977, 233-245. (Annals of Discrete Mathematics ; 1)
• Verallgemeinerungen des Maximum-Prinzips für Optimierungsaufgaben
  Report No. 7538: Bachem, A. (Diplomarbeit)
  
• Reduction and decomposition of integer programs over cones
  Report No. 7539 : Bachem, A.
  in: P. L. Hammer, E. L. Johnson, B. Korte, G. Nemhauser (Eds.): Studies in Integer Programming. Amsterdam, New York, Oxford : North-Holland, 1977, 1-11. (Annals of Discrete Mathematics ; 1)
• Reduction methods for the vertex packing problem
  Report No. 7540: Butz, L.; Hammer, P.L.; Hausmann, D.
• On a class of matroid producing graphs
  Report No. 7541: Foldes, S.; Hammer, P.L.
  in: A. Hajnal, V. T. Sos (Eds.): Combinatorics 1. Amsterdam, Oxford, New York : North-Holland, 1978, 331-352. (Colloquia Mathematica Societatis Janos Bolyai ; 18)

1976

Zurück zum Anfang / Back to start

• Split graphs
  Report No. 7642: Foldes, S.; Hammer, P.L.
  in: F. Hoffman, L. Lesniak-Foster, D. McCarthy, R.C. Mullin, K.B. Reid, R.G. Stanton (Eds.): Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Baton Rouge 1977. Win nipeg : Utilitas Mathematica Publ., 1977, 311-315. (Congressus Numerantium ; 19)
• Reduction and decomposition of modulo optimization problems
  Report No. 7643 : Bachem, A.
  in: W. Oettli, K. Ritter (Eds.): Optimization and Operations Research. Berlin, Heidelberg, New York : Springer, 1976, 1-8. (Lecture Notes in Economics and Mathematical Systems ; 117)
  extended abstract published under the title: Ein Algorithmus zur Modulo-Optimierung strukturierter Matrizen, in: J. Kohlas, O. Seifert, P. Stähly, H.-J. Zimmermann (Eds.): Proceedings in Operations Research, 5. Würzburg, Wien : Physika-Verlag, 1976, 43-45
• The Dilworth number of a graph
  Report No. 7644: Foldes, S.; Hammer, P.L.
  in: B. Alspach, P. Hell, D. J. Miller (Eds.): Algorithmic Aspects of Combinatorics. Amsterdam, New York, Oxford : North-Holland, 1978, 211-220. (Annals of Discrete Mathematics ; 2)
• An analysis of the greedy heuristic for independence systems
  Report No. 7645 : Hausmann, D.; Korte, B.
  in: B. Alspach, P. Hell, D. J. Miller (Eds.): Algorithmic Aspects of Combinatorics. Amsterdam, New York, Oxford : North-Holland, 1978, 65-74. (Annals of Discrete Mathematics ; 2)
• Ganzzahlige Programmmierung (Survey Paper)
  Report No. 7646 : Korte, B.
  in: M. J. Beckmann, G. Menges, R. Selten (Eds.): Handwörterbuch der Mathematischen Wirtschaftswissenschaften, Band 3. Wiesbaden : Gabler, 1979, 45-61
• Colouring criteria for adjacency on 0-1 polyhedra
  Report No. 7647 : Hausmann, D.; Korte, B.
  in: M. L. Balinski, A. J. Hoffman (Eds.): Polyhedral Com binatorics, 1978, 106-127. (Mathematical Programming Study ; 8)
  extended abstract published under the title: Benachbarte Ecken auf 0-1-Polyedern, in: Methods of Operations Research, 25 (1977), 189-191
• Matroidal graphs
  Report No. 7648: Peled, U.N.
  in: Discrete Mathematics, 20 (1978), 263-286
• Integer Programming (Survey Paper)
  Report No. 7649: Korte, B.
  translation of WP 7646
• Bemerkungen zur Optimierung ökonomischer Modelle
  Report No. 7650 : Grötschel, M.; Korte, B.
  in: H. Albach, E. Helmstädter, R. Henn (Eds.): Quantitative Wirtschaftsforschung : Wilhelm Krelle zum 60. Geburtstag. Tübingen : Mohr (Siebeck), 1977, 457-467
• Eine Analyse der Greedy-Heuristik für Unabhängigkeitssysteme
  Report No. 7651 : Hausmann, D.; Korte, B.
  in: Methods of Operations Research, 23 (1977), 132-140
• Fundamentalpunktalgorithmen zur Lösung ganzzahliger Programmierungsaufgaben
  Report No. 7652 : Bachem, A.
  in: Methods of Operations Research, 23 (1977), 1-16
  extended abstract in: Methods of Operations Research, 25 (1977), 141-143

1977

Zurück zum Anfang / Back to start

• Facetten von Matroid-Polytopen
  Report No. 7753 : Grötschel, M.
  in: Methods of Operations Research, 25 (1977), 306-313
• Analyse von heuristischen Algorithmen zur kombinatorischen Optimierung (extended abstract)
  Report No. 7754 : Korte, B.
  in: Methods of Operations Research, 25 (1977), 217-220
• The monotone 2-matching polytope on a complete graph
  Report No. 7755 : Grötschel, M.
  in: Methods of Operations Research, 24 (1977), 72-84
• Adjacency on the branching polyhedron
  Report No. 7756: Hausmann, D.
  (extended version see WP 78112)
• Lower bounds on the worst-case complexity of some oracle algorithms
  Report No. 7757 : Hausmann, D.; Korte, B.
  in: Discrete Mathematics, 24 (1978), 261-276
• Hypohamiltonian facets of the symmetric travelling sales man polytope
  Report No. 7758 : Grötschel, M.
  in: Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 58 (1978), 469-471
• An algorithm for quadratic optimization over transportation polytopes
  Report No. 7759 : Bachem, A.; Korte, B.
  in: Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 58 (1978), 459-461
• Worst-case behaviour of polynomial bounded algorithms for independence systems
  Report No. 7760 : Hausmann, D.; Korte, B.
  in: Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 58 (1978), 477-479
• Die Bestimmung maximaler Elemente in monotonen Mengensystemen
  Report No. 7761: Euler, R. (Köln Univ., Diplomarbeit)
  
• Approximative algorithms for discrete optimization problems
  Report No. 7762 : Korte, B.
  in: P. L. Hammer, E. L. Johnson, B. Korte (Eds.): Discrete Optimization I. Amsterdam, New York, Oxford : North- Holland, 1979, 85-120. (Annals of Discrete Mathematics ; 4)
• A technique for determining blocking and anti-blocking polyhedral descriptions
  Report No. 7763 n.g.: Huang, H.-C.; Trotter, L.E. Jr.
  in: M. W. Padberg (Ed.): Combinatorial Optimization, 1980, 197-205. (Mathematical Programming Study ; 1)
• K-greedy algorithms for independence systems
  Report No. 7764 : Hausmann, D.; Korte, B.
  in: Zeitschrift für Operations Research Serie A, 22 (1978), 219-228
• The theorem of Minkowski for polyhedral monoids and aggregated polyhedral diophantine systems
  Report No. 7765 : Bachem, A.
  in: R. Henn, B. Korte, W. Oettli (Eds.): Optimization and Operations Research. Berlin, Heidelberg, New York : Springer, 1978, 1-13. (Lecture Notes in Economics and Mathematical Systems ; 157)
• Oracle algorithms for fixed-point problems - an axiomatic approach
  Report No. 7766 : Hausmann, D.; Korte, B.
  in: R. Henn, B. Korte, W. Oettli (Eds.): Optimization and Operations Research. Berlin, Heidelberg, New York : Springer, 1978, 137-156. (Lecture Notes in Economics and Mathematical Systems ; 157)
• Quadratic optimization over transportation polytopes
  Report No. 7767: Bachem, D.; Korte, B.
  revised version see WP 79130
• On the symmetric travelling salesman problem I: inequalities
  Report No. 7768 : Grötschel, M.; Padberg, M.W.
  in: Mathematical Programming, 16 (1979), 265-280
• On the symmetric travelling salesmann problem II: lifting theorems and facets
  Report No. 7769 : Grötschel, M.; Padberg, M.W.
  in: Mathematical Programming, 16 (1979), 281-302
• On the symmetric travelling salesman problem: solution of a 120-city problem
  Report No. 7770 : Grötschel, M.
  in: M. W. Padberg (Ed.): Combinatorial Optimization, 1980, 61-77. (Mathematical Programming Study ; 12)
• Ein polynomialer Algorithmus für die Adjazendüberprüfung auf dem Branching Polyeder
  Report No. 7771 : Hausmann, D.
  in: Methods of Operations Research, 28 (1978), 235-240
• Quadratische Optimierung über Transportpolyeder zur Lösung von Schätzproblemen von Input-Output Matrizen
  Report No. 7772 : Bachem, A.; Korte, B.
  in: Methods of Operations Research, 28 (1978), 213-222
• Generating maximum members of independence systems
  Report No. 7773 : Euler, R.
  in: R. Henn, B. Korte, W. Oettli (Eds.): Optimization and Operations Research. Berlin, Heidelberg, New York : Springer, 1978, 87-94. (Lecture Notes in Economics and Mathematical Systems ; 157)
• Matroids on the edge sets of directed graphs
  Report No. 7774 : Matthews. L.R.
  in: R. Henn, B. Korte, W. Oettli (Eds.): Optimization and Operations Research. Berlin, Heidelberg, New York : Springer, 1978, 193-199. (Lecture Notes in Economics and Mathematical Systems ; 157)
• On a theorem of Fulkerson
  Report No. 7775 n.g.: Monma, C.L.; Trotter, L.E. Jr.
  published under the title: On perfect graphs and polyhedra with (0,1)-valued extreme points, in: Mathematical Programming, 17 (1979), 239-242
• Worst-case analysis for a class of combinatorial optimization algorithms
  Report No. 7776 : Hausmann, D.; Korte, B.
  in: J. Stoer (Ed.): Optimization Techniques, Part 2. Berlin, Heidelberg, New York : Springer, 1978, 216-224. (Lecture Notes in Control and Information Sciences ; 7)
• Optimal product positioning in an attribute space
  Report No. 7777: Bachem, A.; Simon, H.
  in: European Journal of Operational Research, 7 (1981), 362-370
• Optimal m*n flow shop sequencing with precedence constraints and lag times
  Report No. 7778: Monma, C.L.
  Extended version with co-author A. H. G. Rinnooy Kan published under the title: A concise survey of efficientlysolvable special cases of the permutation flow-shop problem, in: RAIRO - Recherche Operationelle, 17 (1983), 105-120
• Integer rounding and polyhedral decomposition for totally unimodular systems
  Report No. 7779 : Baum, S.; Trotter, L.E. Jr.
  in: R. Henn, B. Korte, W. Oettli (Eds.): Optimization and Operations Research. Berlin, Heidelberg, New York : Springer, 1978, 15-23. (Lecture Notes in Economics and Mathematical Sytems ; 157)
• On the computational complexity of integer programming problems
  Report No. 7780 : Kannan, R.; Monma, C.L.
  in: R. Henn, B. Korte, W. Oettli (Eds.): Optimization and Operations Research. Berlin, Heidelberg, New York : Springer, 1978, 161-172. (Lecture Notes in Economics and Mathematical Sytems ; 157)
• Worst-case analysis of greedy type algorithms for independence systems
  Report No. 7781 : Hausmann, D.; Jenkyns, T.A.; Korte, B.
  in: M. W. Padberg (Ed.): Combinatorial Optimization, 1980, 120-131. (Mathematical Programming Study ; 12)
• On the symmetric travelling salesman problem: a computational study
  Report No. 7782 n.g.: Hong, S.; Padberg, M.W.
  in: M. W. Padberg (Ed.): Combinatorial Optimization, 1980, 78-107. (Mathematical Programming Study ; 12)
• On the symmetric travelling salesman problem: theory and computation
  Report No. 7783 : Grötschel, M.; Padberg, M.W.
  in: R. Henn, B. Korte, W. Oettli (Eds.): Optimization and Operations Research. Berlin, Heidelberg, New York : Springer, 1978, 105-115. (Lecture Notes in Economics and Mathematical Sytems ; 157)
• Estimating input-output matrices
  Report No. 7784 : Bachem, A.; Korte, B.
  published under the title: Estimating matrices in: Metrika, 28 (1981), 273-286
• Some remarks on a classification of oracle-type algorithms
  Report No. 7785 : Korte, B.; Monma, C.L.
  in: L. Collatz, G. Meinardus, W. Wetterling (Eds.): Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen, Band 2. Basel, Boston, Stuttgart : Birkhäuser, 1979, 195-215. (International Series in Numerical Mathematics ; 46)
• Strong blocks and the optimum branching problem
  Report No. 7786 : Grötschel, M.
  in: L. Collatz, G. Meinardus, W. Wetterling (Eds.): Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen, Band 2. Basel, Boston, Stuttgart : Birkhäuser, 1979, 112-121. (International Series of Numerical Mathematics ; 46)
• A duality theorem and minimal inequalities in mixed integer programming
  Report No. 7787 : Bachem, A.; Schrader, R.
  in: Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 59 (1979), 88-89
• On the monotone symmetric travelling salesman problem: hypohamiltonian/hypotraceable graphs and facets
  Report No. 7788 : Grötschel, M.
  in: Mathematics of Operations Research, 5 (1980), 285- 292
• Exponential lower bounds on a class of Knapsack algorithms
  Report No. 7789 : Hausmann, D.; Kannan, R.; Korte, B.
  in: Mathematics of Operations Resarch, 6 (1981), 225- 232

1978

Zurück zum Anfang / Back to start

• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 7890: Arbeitsbericht 1975-1977 der Abteilung Operations Research
• Hypohamiltonian digraphs
  Report No. 7891 : Grötschel, M.; Wakabayshi, Y.
  in: Methods of Operations Research, 36 (1980), 99-119
• Hypotraceable digraphs
  Report No. 7892: Grötschel, M.; Wakabayshi, Y.
  revised version published under the title: Constructions of hypotraceable digraphs, in: R.W. Cottle, M.L. Kelmanson, B.Korte (Eds.): Mathematical Programming. Proceedings of the International Congress Rio de Janeiro 1981. Am sterdam, New York, Oxford : North-Holland, 1984
• On rank functions of general independence systems
  Report No. 7893: Euler, R.
  extended abstract see WP 78122
• Closure in independence systems
  Report No. 7893 n.g.: Matthews, L.R.
  in: Mathematics of Operations Research, 7 (1982), 159- 171
• Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix
  Report No. 7895 : Bachem, A.; Kannan, R.
  in: SIAM Journal on Computing, 8, (1979), 499-507
• A note on the mutual independence of events
  Report No. 7896: Matthews, L.R.
• A note on a theorem of Jeroslow
  Report No. 7897: Bachem, A.; Schrader, R.
  Revised version see WP 79137
• Graphical properties related to minimal imperfection
  Report No. 7898 n.g.: Bland, R.G.; Huang, H.-C.; Trotter, L.E. Jr.
  in: Discrete Mathematics 27 (1979), 11-22
• On minimal strong blocks
  Report No. 7899 : Grötschel, M.
  in: Journal of Graph Theory, 4 (1979), 213-219
• On the RAS-Algorithm
  Report No. 78100 : Bachem, A.; Korte, B.
  in: Computing, 23 (1979), 189-198
• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 78101: Verzeichnis der Arbeitspapiere - List of Working Papers 7201-78100
• Mathematical programming and estimation of input-output matrices
  Report No. 78102 : Bachem, A.; Korte, B.
  in: G. Castellani, P. Mazzoleni (Eds.): Mathematical Programming and its Economic Application. Milano : Angeli, 1981. 423-451
• Related necessary conditions for completing partial latin squares
  Report No. 78103 n.g.: Giles, R.; Oyama, T.; Trotter, L.E. Jr.
  in: Journal of Combinatorial Theory A, 29 (1980), 20-31
• On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
  Report No. 78104 : Grötschel, M.; Wakabayshi, Y.
  in: Discrete Mathematics, 24 (1981), 43-59
• On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets
  Report No. 78105 : Grötschel, M.; Wakabayishi, Y.
  in: H. König, B. Korte, K. Ritter (Eds.): Mathematical programming at Oberwolfach, 1981, 77-97. (Mathemati cal Programming Study ; 14)
• Symmetric blocking and antiblocking relations for generalized circulations
  Report No. 78106: Trotter, L.E. Jr.; Weinberger, D.B.
  in: M.L. Balinski, A.J. Hoffman (Eds.): Polyhedral Combinatorics, 1978, 141-158. (Mathematical Programming Study ; 8)
• Approximative combinatorial algorithms
  Report No. 78107: Kannan, R.; Korte, B.
  in: R.W. Cottle, M.L.Kelmanson, B. Korte (Eds.): Mathematical Programming : Proceedings of the International Congress, Rio de Janeiro 1981. Amsterdam, New York, Oxford : North-Holland, 1984, 195-248
• Properties and efficient algorithms for certain classes of sequencing problems
  Report No. 78108: Monma, C.L.
  PhD Thesis, Cornell University (extended version published in three parts)
• Finite checkability for integer rounding properties in combinatorial programming problems
  Report No. 78109 n.g.: Baum, S.; Trotter, L.E. Jr.
  in: Mathematical Programming, 22 (1982), 141-147
• Adjacent vertices on the b-matching polyhedron
  Report No. 78110: Hausmann,  D.
  in: Discrete Mathematics, 33 (1981), 37-51
• Complexity of the testing of adjacency on the b-matching polyhedron
  Report No. 78111 : Hausmann, D.
  in: Methods of Operations Research, 32 (1979), 133-141
• Characterizations of adjacency on the branching polyhedron
  Report No. 78112 : Giles, R.; Hausmann, D.
  in: Discrete Mathematics, 26 (1979), 219-226
• A characterization of threshold matroids
  Report No. 78113 n.g.: Giles, R.; Kannan, R.
  in: Discrete Mathematics, 30 (1980), 181-184
• The efficacy of heuristic combining enumeration and the greedy algorithm
  Report No. 78114: Jenkyns, T.A.
• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 78115: Workshop on Combinatorial Optimization, Bonn, September 11-13, 1978 (abstracts and list of participants)
• A polynomial algorithm for the two-variable integer programming problem
  Report No. 78116 n. g.: Kannan, R.
  in: Journal of the Association for Computing Machinery (ACM), 27 (1980), 118-122
• Valuation of games and other discrete production pro cesses by competitive bidding
  Report No. 78117: Young, H.P.
  revised version published under the title: Exploitable sur plus in n-person games, in: S.J. Brams, A. Schotter, G. Schwödiauer (Eds.): Applied Game Theory. Würzburg, Wien : Physika-Verl., 1979, 32-38. (IHS-Studies ; 1)
• Integer theorems of Farkas Lemma type
  Report No. 78118 : Bachem, A.; von Randow, R.
  in: Methods of Operations Research, 32 (1979), 19-28
• Applications of polynomial Smith normal form calculations
  Report No. 78119 : Bachem, A.; Kannan, R.
  in: L. Collatz, G. Meinardus, W. Wetterling (Eds.): Nume rische Methoden bei graphentheoretischen und kombina torischen Problemen, Band 2. Basel, Boston, Stuttgart : Birkhäuser, 1979, 9 - 21. (International Series of Numeri cal Mathematics ; 46)
• Integer rounding for polymatroid and branching optimization problems
  Report No. 78120 n.g.: Baum, S.; Trotter, L.E. Jr.
  in: SIAM Journal on Algebraic and Discrete Methods, 2 (1981), 416-425
• Matroids from directed graphs
  Report No. 78121 : Matthews, L.R.
  in: Discrete Mathematics, 24 (1978), 47-61
• On rank functions of general independence systems (extended abstract)
  Report No. 78122 : Euler, R.
  in: Methods of Operations Research, 32 (1979), 89-91
• Neuere Entwicklungen in den Anwendungen von Mathematik und Operations Research
  Report No. 78123 : Korte, B.
  in: Methods of Operations Research, 31 (1979), 26
• Complexity of matroid property algorithms
  Report No. 78124 : Jensen, P.M.; Korte, B.
  in: SIAM Journal on Computing, 11 (1982), 184-190
• Adjazenzcharakterisierungen für Polyederecken in der kombinatorischen Optimierung
  Report No. 78125: Hausmann, D.
  Translated into English, published under the title: Adjacency on polytopes in combinatorial optimization, in: Mathematical Systems in Economics, 49 (1980)
• Rank-axiomatic characterizations of independence systems
  Report No. 78126 n.g.: Euler, R.
  in: Discrete Mathematics, 32 (1980), 9-17

1979

Zurück zum Anfang / Back to start

• Institut für Ökonometrie und Operations Research, Unversität Bonn
  Report No. 79127: Annual Report 1978
• Adjacency on the Postman polyhedron
  Report No. 79128: Giles. R.
  in: SIAM Journal on Algebraic and Discrete Methods, 2 (1981), 172-175
• The graphs for which all strong orientations are hamiltonian
  Report No. 79129 : Grötschel, M.; Harary, F.
  in: Journal of Graph Theory, 3 (1979), 221-223
• Minimum norm problems over transportation polytopes
  Report No. 79130 : Bachem, A.; Korte, B.
  in: Linear Algebra and its Applications, 31 (1980), 103- 118
• Theorems of the alternative in combinatorial progamming
  Report No. 79131 : Bachem, A.
  in: Methods of Operations Research, 36 (1980), 7-20
• Exponentielle untere Komplexitätsschranken für eine Klasse von Knapsack-Problemen (extended abstract)
  Report No. 79132 : Hausmann, D.; Kannan, R.; Korte, B.
  in: Methods of Operations Research, 32 (1979), 143-147
• Farbklassen und Pseudoknoten für Adjazenzcharakterisierungen
  Report No. 79133 : Hausmann, D.
  in: Methods of Operations Research, 36 (1980), 137-141
• Observations on a class of nasty linear complementarity problems
  Report No. 79134 n.g.: Cottle, R.W.
  in: Discrete Mathematics, 2 (1980), 89-111
• Hypotraceable digraphs
  Report No. 79135 : Grötschel, M.; Thomassen, C.; Wakabayashi, Y.
  in: Journal of Graph Theory, 4 (1980), 377-381
• On stable set polyhedra for K(1,3)-free graphs
  Report No. 79136 n.g.: Giles, R. ; Trotter, L.E. Jr.
  in: Journal of Combinatorial Theory B, 31 (1981), 313- 326
• Minimal inequalities and subadditive duality
  Report No. 79137 : Bachem, A.; Schrader, R.
  in: SIAM Journal on Control and Optimization, 18 (1980), 437-443
• On Q-matrices, centroids and simplotopes
  Report No. 79138 n.g.: Cottle, R.W.; von Randow, R.
  extended abstract published in: Methods of Operations Research, 37 (1980), 119-122
• On perfect graphs and polyhedra with (0,1)-valued extreme points
  Report No. 79139: Monma, C.L.; Trotter, L.E. Jr.
  in: Mathematical Programming, 17 (1979), 239-242
• An algebraic representation of classical systems
  Report No. 79140: Pallaschke, D.
  in: L. Budach (Ed.): Fundamentals of Computation Theo ry - FCT'79. Berlin : Akademie-Verl., 1979, 313-317. (Mathematical Research ; 2)
• Algorithmic versus axiomatic definitions of matroids
  Report No. 79141 : Hausmann, D.; Korte, B.
  in: H. König, B. Korte, K. Ritter (Eds.): Mathematical Programming at Oberwolfach, 1981, 98-111. (Mathemati cal Programming Study ; 14)
• Characterizations of adjacency of faces of polyhedra
  Report No. 79142 : Bachem, A.; Grötschel, M.
  in: H. König, B. Korte, K. Ritter (Eds.): Mathematical Programming at Oberwolfach, 1981, 1-22. (Mathematical Programming Study ; 14)
• The relative strength of oracles for independence systems
  Report No. 79143 : Hausmann, D.; Korte, B.
  in: J. Frehse, D. Pallaschke, U. Trottenberg (Eds.): Special Topics of Applied Mathematics. Amsterdam, New York, Oxford : North-Holland, 1980, 195-211
• Computational relations between various definitions of matroids and independence systems
  Report No. 79144 : Hausmann, D.; Korte, B.
  in: K. Iracki, K. Malanowski, S. Walukiewicz (Eds.): Optimization Techniques Part II. Berlin, Heidelberg, New York : Springer, 1980, 195-198. (Lecture Notes in Control and Information Sciences ; 23)
• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 79145: Sommerschule über Optimierung und Operations Research - Zusammenfassung der Vorträge
• Concepts of algorithmic computation
  Report No. 79146 : Bachem, A.
  in: B. Korte (Ed.): Modern Applied Mathematics : Optimizations and Operations Research. Amsterdam, New York, Oxford : North-Holland, 1982, 3-49
• Approaches to hard combinatorial optimization problems
  Report No. 79147 : Grötschel, M.
  in: B. Korte (Ed.): Modern Applied Mathematics : Optimization and Operations Research. Amsterdam, New York, Oxford : North-Holland, 1982, 437-515
• Matroids and independence systems
  Report No. 79148 : Korte, B.
  in: B. Korte (Ed.): Modern Applied Mathematics : Optimization and Operations Research. Amsterdam, New York, Oxford : North-Holland, 1982, 517-553
• New aspects of polyhedral theory
  Report No. 79149 : Bachem, A.; Grötschel, M.
  in: B. Korte (Ed.): Modern Applied Mathematics : Optimization and Operations Research. Amsterdam, New York, Oxford : North-Holland, 1982, 51-106

1980

Zurück zum Anfang / Back to start

• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 80150: Annual Report 1979
• The ellipsoid method and its consequences in combinatorial optimization
  Report No. 80151 : Grötschel, M.; Lovász, L.; Schrijver, A.
  in: Combinatorica, 1 (1981), 169-197
• Charakterisierungen zusammenhängender zweifacher Blockpläne
  Report No. 80152: Butz, L.
  extended version see WP 81178
• Characterizations of connectivity in row-column designs
  Report No. 80153: Butz, L.
  extended version see WP 81178
• Komplexitätstheorie im Operations Research
  Report No. 80154 n.g.: Bachem, A.
  in: Zeitschrift für Betriebswirtschaft, 50 (1980), 812-844
• Einführung in das Operations Research.
  Report No. 80155 : Bachem, A.; Schrader, R.
  Wiesbaden : Gabler, 1980 (Gabler Studientexte) (Betriebswirtschafts-Akademie)
• A note on convergence proofs for Shor-Khachian methods
  Report No. 80156 : Korte, B.; Schrader, R.
  in: A. Auslender, W. Oettli, J. Stoer (Eds.): Optimization and Optimal Control. Berlin, Heidelberg, New York : Springer, 1981, 51-57. (Lecture Notes in Control and Information Sciences ; 30)
• A note on convex cones and constraint qualifications in infinite-dimensional vector spaces
  Report No. 80157: Klee, V.
  in: Journal of Optimization Theory and Applications, 37 (1982), 277-284
• On computational complexity of optimization combinatorial problems
  Report No. 80158: Frumkin, M.A.; Gens, G.V.; Hmelevskii, J.I.; Levner, E.V.
• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 80159: IV. Workshop on Combinatorial Optimization, Bonn, August 28-30, 1980 - Abstracts and List of Participants
• Polyhedra of additive system problems
  Report No. 80160: Araoz, J.; Johnson, E.L.
  in: Methods of Operations Research, 40 (1981), 211-214
• Connectivity in general designs with two blocking factors (extended abstract)
  Report No. 80161 n. g.: Butz, L.
  in: Methods of Operations Research, 41 (1981), 129-132
• Characterization of facets for multiple right-hand choice linear programs
  Report No. 80162 : Johnson, E.L.
  in: H. König, B. Korte, K. Ritter (Eds.): Mathematical Programming and Oberwolfach, 1981, 112-142. (Mathematical Programming Study ; 14)
• On the existence of fast approximation schemes
  Report No. 80163 : Korte, B.; Schrader, R.
  in: Nonlinear Programming, 4 (1981), 415-437
• A theorem on the partitioning of simplotopes and its application to a property of Q-matrices (extended abstract)
  Report No. 80164 n.g.: Cottle, R.W. ; von Randow, R.
  in: W. Forster (Ed.): Numerical Solutions of Highly Non linear Problems. Amsterdam, New York, Oxford : North- Holland, 1980, 331-335
• The matching rank of halin graphs
  Report No. 80165: Pulleyblank, W.R.
• Homogenization of polyhedra
  Report No. 80166 n. g.: Bachem, A.; Grötschel, M.
  in: Methods of Operations Research, 40 (1981), 215-219
• Degree-two inequalities, clique facets, and biperfect graphs
  Report No. 80167: Johnson, E.L.; Padberg, M.W.
  in: A. Bachem, M. Grötschel, B. Korte (Eds.): Bonn Workshop on Combinatorial Optimization. Amsterdam, New York, Oxford : North-Holland, 1982, 169-188. (Annals of Discrete Mathematics ; 16) (North-Holland Mathematics Studies ; 66)
• Primal and dual methods for updating input-output matrices
  Report No. 80168 : Bachem, A.; Korte, B.
  in: K. Brockhoff, W. Krelle (Eds.): Unternehmensplanung. Berlin, Heidelberg, New York : Springer, 1981, 117-127
• The matching rank of halin graphs (extended abstract)
  Report No. 80169 n. g.: Pulleyblank, W.R.
  in: Methods of Operations Research, 40 (1981), 401-404
• Cycles through prescribed and forbidden point sets
  Report No. 80170: Holton, D.A.; Plummer, M.D.
  in: A. Bachem, M. Grötschel, B. Korte (Eds.): Bonn Workshop on Combinatorial Optimization. Amsterdam, New York, Oxford : North-Holland, 1982, 129-148. (Annals of Discrete Mathematics ; 16) (North-Holland Mathematics Studies; 66)
• Ear decompositions of elementary graphs and GF(2)-rank of perfect matchings
  Report No. 80171: Naddef, D.J.; Pulleyblank, W.R.
  in: A. Bachem, M. Grötschel, B. Korte (Eds.): Bonn Workshop on Combinatorial Optimization. Amsterdam, New York, Oxford : North-Holland, 1982, 241-260. (Annals of Discrete Mathematics ; 16) (North-Holland Mathematics Studies ; 66)
• The travelling salesman polytope and 0,2-matchings
  Report No. 80172: Cornuejols, G.; Pulleyblank, W.R.
  in: A. Bachem, M. Grötschel, B. Korte (Eds.): Bonn Workshop on Combinatorial Optimization. Amsterdam, New York, Oxford : North-Holland, 1982, 27-56. (Annals of Discrete Mathematics ; 16) (North-Holland Mathematics Studies ; 66)

1981

Zurück zum Anfang / Back to start

• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 81173: Annual Report 1980
• Ellipsoid methods
  Report No. 81174 : Schrader, R.
  in: B. Korte (Ed.): Modern Applied Mathematics : Optimization and Operations Research. Amsterdam, New York, Oxford : North-Holland, 1982, 265-311
• Bounding the independence number of a graph
  Report No. 81175: Lovász, L.
  in: A. Bachem, M. Grötschel, B. Korte (Eds.): Bonn Workshop on Combinatorial Optimization. Amsterdam, New York, Oxford : North-Holland, 1982, 213-224. (Annals of Discrete Mathematics ; 16) (North-Holland Mathematics Studies ; 66)
• Polynomial algorithms for perfect graphs
  Report No. 81176: Grötschel, M.; Lovász, L.; Schrijver, A.
  in: C. Berge, V. Chvatal (Eds.): Topics on Perfect Graphs. Amsterdam, New York, Oxford : North-Holland,1984, 325-356. (Annals of Discrete Mathematics ; 21) (North-Holland Mathematics Studies ; 88)
• Can the ellipsoid method be efficient?
  Report No. 81177: Korte, B.; Schrader, R.
  in: H. Hauptmann, W. Krelle, K.C. Mosler (Eds.): Operations Research and Economic Theory. Berlin, Heidelberg, New York : Springer, 1984, 337-343
• Über die Zusammenhangseigenschaft in Versuchsplänen mit mehrfacher Blockbildung : eine kombinatorische Analyse
  Report No. 81178: Butz, L.
  Translated into English and published under the title: Connectivity in Multi-Factor Designs : a Combinatorial Approach. Berlin : Heldermann, 1982. (Research and Education in Mathematics ; 3)
• Facets and mappings for non-abelian group problems
  Report No. 81179: Araoz, J.; Johnson, E.L.
  Revised version published under the title: Mappings and facets for non-abelian group problems, in: SIAM Journal on Algebraic and Discrete Methods, 6 (1985), 171-188
• Total dual integrality and B-matchings
  Report No. 81180 n. g.: Pulleyblank, W.R.
  in: Operations Research Letters, 1 (1981), 28-30
• Some recent results on cycle traversability in graphs
  Report No. 81181: Plummer, M.D.
  in: M. Rosenfeld, J. Zaks (Eds.): Convexity and Graph Theory. Amsterdam, New York, Oxford : North-Holland, 1984, 255-262. (Annals of Discrete Mathematics ; 20) (North-Holland Mathematics Studies ; 87)
• On spherically convex sets and Q-matrices
  Report No. 81182 : Cottle, R.W.; von Randow, R.; Stone, R.E.
  in: Linear Algebra and its Applications, 41 (1981), 73-80
• The bank safe problem
  Report No. 81183 : von Randow, R.
  in: Discrete Applied Mathematics, 4 (1982), 335-337
• A note on equivalent estimability characterizations of completely connected designs for multi-way elimination of heterogeneity
  Report No. 81184 : Butz, L.
  in: Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 62 (1982), 364-365
• On minimizing setups in precedence constrained scheduling
  Report No. 81185: Pulleyblank, W.R.
  to appear in: Discrete Applied Mathematics
• A survey on oracle techniques
  Report No. 81186: Korte, B.; Schrader, R.
  in: J. Gruska, M. Chytil (Eds.): Mathematical Foundations of Computer Science 1981. Berlin, Heidelberg, New York : Springer, 1981, 61-77. (Lecture Notes in Computer Science ; 118)
• A note on approximation algorithms for graph partitioning problems
  Report No. 81187 : Schrader R.
  in: Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 62 (1982), 384-386
• A nine point theorem for 3-connected graphs
  Report No. 81188: Holton, D.A.; McKay, B.D.; Plummer, M.D.; Thomassen, C.
  in: Combinatorica, 2 (1982), 53-62
• Mathematical structures underlying greedy algorithms
  Report No. 81189 n.g.: Korte, B.; Lovász, L.
  in: F. Gecseg (Ed.): Fundamentals of Computation Theory. Berlin, Heidelberg, New York : Springer, 1981, 205- 209. (Lecture Notes in Computer Science ; 117)
• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 81190: Arbeitsbericht 1978-1980 der Abteilung Operations Research
• Kombinatorische Optimierung
  Report No. 81191: Grötschel, M.
  in: Der Rektor der Universität Bonn (Ed.): Forschungsbericht 1978-1980 der Rheinischen Friedrich- Wilhelms-Universität Bonn. Bonn : Bouvier, 1982, 45-54
• On proximity to paths and cycles in 3-connected graphs
  Report No. 81192: Plummer, M.D.; Pulleyblank, W.R.
  in: Ars Combinatorica, 14 (1982), 169-185
  
• Zur Geschichte des maschinellen Rechnens
  Report No. 81193: Korte, B.
  published as: Zur Geschichte des maschinellen Rechnens. Bonn : Bouvier, 1981. (Bonner Akademische Reden ; 54)
• Weakly bibartite graphs and the max-cut problem
  Report No. 81194 n.g.: Grötschel, M.; Pulleyblank, W.R.
  in: Operations Research Letters, 1 (1981), 23-27
• Von Abakus bis Zuse - ein Abriß der Geschichte des Rechnens
  Report No. 81195 n.g.: Korte, B.
  in: Bonner Universitätsblätter (1981), 15-37
• Clique tree inequalities and the travelling salesman problem
  Report No. 81196: Grötschel, M.; Pulleyblank, W.R.
  in: Mathematics of Operations Research, 11 (1986), 537- 569
• A characterization of minimal valid inequalities for mixed integer programs
  Report No. 81197 : Bachem, A.; Johnson, E.L.; Schrader, R.
  in: Operations Research Letters, 1 (1982), 63-66
• Critical graphs, matchings and tours - a hierarchy of relaxations for the travelling salesman problem
  Report No. 81198: Cornuejols, G.; Pulleyblank, W.R.
  in: Combinatorica, 3 (1983), 35-52
• The perfectly matchable subgraph polytope of a bibartite graph
  Report No. 81199: Balas, E.; Pulleyblank, W.R.
  in: Networks, 13 (1983), 495-516
• Matroid properties and matroid oracles
  Report No. 81200: Korte, B.
• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 81201: List of Working Papers 7201-81200
• Approximations to clustering and subgraph problems on trees
  Report No. 81202 : Schrader, R.
  in: Discrete Applied Mathematics, 6 (1983), 301-309
• Polyhedra for composed independence systems
  Report No. 81203: Cunningham, W.H.
  in: A. Bachem, M. Grötschel, B. Korte (Eds.): Bonn Workshop on Combinatorial Optimization. Amsterdam, New York, Oxford : North-Holland, 1982, 57-67. (Annals of Discrete Mathematics ; 16) (North-Holland Mathematics Studies ; 66)
• A class of linear programs convertible to network problems
  Report No. 81204: Cunningham, W.H.
  in: Operations Research, 31 (1983), 387-390
• Finding feasible vectors of Edmonds-Giles polyhedra
  Report No. 81205: Frank, A.
  in: Journal of Combinatorial Theory B, 36 (1984), 221- 239
• Generalized polymatroids
  Report No. 81206: Frank, A.
  in: A. Hajnal, L. Lovász, V.T. Sos (Eds.): Finite and Infinite Sets. Amsterdam, Oxford, New York : North-Holland, 1984, 285-294. (Colloquia Mathematica Societatis Janos Bolyai ; 37, 1)
• Testing membership in matroid polyheda
  Report No. 81207: Cunningham, W.H.
  in: Journal of Combinatorial Theory B, 36 (1984), 161- 188
• A shortest augmenting path method for solving minimal perfect matching problems
  Report No. 81208 : Derigs, U.
  in: Networks, 11 (1981), 379-390

1982

Zurück zum Anfang / Back to start

• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 82209: Annual Report 1981
• Matroids from crossing families
  Report No. 82210: Frank, A.; Tardos, E.
  in: A. Hajnal, L. Lovász, V.T. Sos (Eds.): Finite and Infinite Sets. Amsterdam, Oxford, New York : North-Holland, 1984, 295-304. (Colloquia Mathematica Societatis Janos Bolyai ; 37, 1)
• A polynomial algorithm for the max-cut problem on graphs without long odd cycles
  Report No. 82211: Grötschel, M.; Nemhauser, G.L.
  in: Mathematical Programming, 29 (1984), 28-40
• Polyhedral of the travelling salesman problem I: theory
  Report No. 82212: Grötschel, M.; Padberg, M.W.
  published under the title: Polyhedral theory, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.): The Traveling Salesman Problem. Chichester, New York, Brisbane : Wiley, 1985, 251-306. (Wiley Interscience Series in Discrete Mathematics)
• Decomposition of submodular functions
  Report No. 82213: Cunningham, W.H.
  in: Combinatorica, 3 (1983), 53-68
• Polyhedral aspects of the travelling salesman problem II: computation
  Report No. 82214: Grötschel, M.; Padberg, M.W.
  published under the title: Polyhedral computations, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.): The Traveling Salesman Problem. Chichester, New York, Brisbane : Wiley, 1985, 307-36. (Wiley Interscience Series in Discrete Mathematics)
• On the asyclic subgraph polytope
  Report No. 82215: Grötschel, M.; Jünger, M.; Reinelt, G.
  in: Mathematical Programming, 33 (1985), 28-42
• Disjoint paths in a rectilinear grid
  Report No. 82216: Frank, A.
  in: Combinatorica, 2 (1982), 361-371
  preliminary version published under the title: Disjoint paths in the plane, in: Graph Theory. Springer, 1983, 33- 37. (Lecture Notes in Mathematics ; 1018)
• Facets of the linear ordering polytope
  Report No. 82217: Grötschel, M.; Jünger, M.; Reinelt, G.
  in: Mathematical Programming, 33 (1985), 43-60
• Lifting the facets of polyhedra
  Report No. 82218: Araoz, J.; Edmonds, J.; Griffin, V.
  in: W.R. Pulleyblank (Ed.): Progress in Combinatorial Optimization. Toronto, Orlando, San Diego : Academic Press, 1984, 3-12
• A cutting plane algorithm for the linear ordering problem
  Report No. 82219: Grötschel, M.; Jünger, M.; Reinelt, G.
  in: Operations Research, 32 (1984), 1195-1220
• Packing problems in semigroup programming
  Report No. 82220: Araou, J.
  in: R.E. Burkard, R.A. Cuninghame-Green, U. Zimmermann (Eds.): Algebraic and Combinatorial Methods in Operations Research. Amsterdam, New York, Oxford : North-Holland, 1984, 1-22. (Annals of Discrete Mathematics ; 19) (North-Holland Mathematics Studies ; 95)
• Some greedy ideas for the cardinality matching problem
  Report No. 82221: Derigs, U.; Schrader, R.
  Revised version see WP 84332
• Shortest augmenting paths and sensitivity analysis for optimal matchings
  Report No. 82222: Derigs, U.
  published under the title: Postoptimal analyis for matching problems, in: Methods of Operations Research, 49 (1985), 58-78
• Equi-matchable graphs
  Report No. 82223: Plummer, M.D.; Pulleyblank, W.R.
  extended version with co-author M. Lesk published in: B. Bollobas (Ed.): Graph Theory and Combinatorics. Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös, 1983. London, Orlando, San Diego : Academic Press, 1984, 239-254
• A primal-dual algorithm for submodular flows
  Report No. 82224: Cunningham, W.H.; Frank, A.
  in: Mathematics of Operations Research, 10 (1985), 251- 261
• A simple algorithm for a class of quadratic smoothing problems
  Report No. 82225: Morton, G.; Ringwald, K.; von Randow, R.
  extended version see WP 84336
• An analysis of alternate strategies for implementing matching algorithms
  Report No. 82226 : Ball, M.O.; Derigs, U.
  in: Networks, 13 (1983), 517-549
• Convexity and optimization in discrete structures
  Report No. 82227: Bachem, A.
  in: P.M. Gruber, J.M. Wills (Eds.): Convexity and its Applications. Basel, Boston, Stuttgart : Birkhäuser, 1983, 9-29
• Optimal triangulation of large real-world input-output matrices
  Report No. 82228: Grötschel, M.; Jünger, M.; Reinelt, G.
  in: Statistische Hefte, 25 (1984), 261-295
• Polyhedra of multivalued additive system problems
  Report No. 82229: Araoz, J.; Johnson, E.L.
  
• Greedoids - a structural framework for the greedy algorithm
  Report No. 82230 : Korte, B.; Lovász, L.
  in: W.R. Pulleyblank (Ed.): Progress in Combinatorial Optimization. Toronto, Orlando, San Diego : Academic Press, 1984, 221-244
• Mappings and lifting for group and semigroup problems
  Report No. 82231: Araoz, J.; Johnson, E.L.
  
• Optimale Zuordnungen und Matchings: Anwendungen, Grundlagen und Verfahren
  Report No. 82232 : Derigs, U.
  in: W. Bühler, B. Fleischmann, K.-P. Schuster, L. Streitferdt, H. Zander (Eds.): Operations Research Proceedings 1982 DGOR. Berlin, Heidelberg, New York : Springer, 1983, 335-344
• A case of non-convergent pivoting in assignment problems
  Report No. 82233: Araoz, J.; Edmonds, J.
  revised version published under the title: A case of non-convergent dual changes in assignment problems, in: Discrete Applied Mathematics, 11 (1985), 95-102
• Theory of submodular programs : a fenchel-type min-max theorem and subgradients of submodular functions
  Report No. 82234: Fujishige, S.
  in: Mathematical Programming, 29 (1984), 142-155
• Geometric exchange properties in lattices of finite length
  Report No. 82235: Faigle, U.; Richter, G.; Stern, M.
  in: Algebra Universalis, 19 (1984), 355-365
• Structures of polyhedra determined by submodular functions on crossing families
  Report No. 82236: Fujishige, S.
  in: Mathematical Programming, 29 (1984), 125-141
• Techniques and machines in the history of computing
  Report No. 82237 : Jünger, M.; Reinelt, G.
  in: XI International Symposium on Mathematical Pro gramming, Bonn, August 23-27, 1982. Bonn : Institut für Ökonometrie und Operations Research, 1982
• Reductions to 1-matching polyhedra
  Report No. 82238: Araoz, J.; Cunningham, W.H.; Edmonds, J.; Green-Krotky, J.
  in: Networks, 13 (1983), 455-474
• The max-cut problem on graphs not contractible to K(5)
  Report No. 82239: Barahona, F.
  in: Operations Research Letters, 2 (1983), 107-111
• Subadditive characterization of ordered semigroup problems
  Report No. 82240: Araoz, J.
• Characterization of subdifferentials of submodular functions and its relation to Lovász's extentions of submodular functions
  Report No. 82241: Fujishige, S.
  revised version published under the title: On the subdiffe rential of a submodular function, in: Mathematical Programming, 29 (1984), 348-360
• Structural properties of greedoids
  Report No. 82242 : Korte, B.; Lovász, L.
  in: Combinatorica, 3 (1983), 359-374
• Convergence bounds for the "capacity" max-flow algorithm
  Report No. 82243: Gonzaga, C.C.; Oliveira, A.A.F.
  
• A note on selectors and greedoids
  Report No. 82244 : Korte, B.; Lovász, L.
  in: Combinatorics, 6 (1985), 59-67
• Discrete and combinatorial optimization : Introduction
  Report No. 82245: Derigs, U.; Korte, B.
  in: M.G. Singh (Ed.): Systems and Control Encyclopedia. Oxford, New York, Peking : Pergamon Press, 1987, 1080- 1083
• Combinatorial optimization : Independence systems
  Report No. 82246: Derigs, U.; Korte, B.
  in: M.G.Singh (Ed.): Systems and Control Encyclopedia. Oxford, New York, Peking : Pergamon Press, 1987, 624- 626
• Polyhedral combinatorics and cutting-plane methods
  Report No. 82247: Derigs, U.; Korte, B.
  in: M.G.Singh (Ed.): Systems and Control Encyclopedia. Oxford, New York, Peking : Pergamon Press, 1987, 3735- 3739
• Combinatorial optimization problems : Branch-and-bound approach
  Report No. 82248: Derigs, U.; Korte, B.
  in: M.G.Singh (Ed.): Systems and Control Encyclopedia. Oxford, New York, Peking : Pergamon Press, 1987, 628- 630
• Combinatorial optimization problems : Approximative algorithms
  Report No. 82249: Derigs, U.; Korte, B.
  in: M.G.Singh (Ed.): Systems and Control Encyclopedia. Oxford, New York, Peking : Pergamon Press, 1987, 626- 628
• The partial order of a polymatroid extreme point
  Report No. 82250: Bixby, R.E.; Cunningham, W.H.; Topkis, D.M.
  in: Mathematics of Operations Research, 10 (1985), 367- 378
• On partitioning the edges of a graph into connected subgraphs
  Report No. 82251: Jünger, M.; Pulleyblank, W.R.; Reinelt, G.
  in: Journal of Graph Theory, 9 (1985), 539-549
• An algorithm for the unbounded matroid intersection polyhedron
  Report No. 82252: Frank, A.; Tardos, E.
  in: R.E. Burkard, R.A. Cunninghame-Green, U. Zimmermann (Eds.): Algebraic and Combinatorial Methods in Operations Research. Amsterdam, New York, Oxford : North-Holland, 1984, 129-134. (Annals of Discrete Mathematics ; 19) (North-Holland Mathematics Studies ; 95)
• Binary group and chinese postman polyhedra
  Report No. 82253: Gastou, G.; Johnson, E.L.
  in: Mathematical Programming, 34 (1986), 1-33
• Submodular flows
  Report No. 82254: Frank, A.
  in: W.R. Pulleyblank (Ed.): Progress in Combinatorial Optimization. Toronto, Orlando, San Diego : Academic Press, 1984, 147-165

1983

Zurück zum Anfang / Back to start

• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 83255: Annual Report 1982
• A decomposition of distributive lattices
  Report No. 83256: Fujishige, S.
  in: Discrete Mathematics, 55 (1985), 35-55
• Minimum cuts, modular functions, and matroid polyhedra
  Report No. 83257: Cunningham, W.H.
  in: Networks, 15 (1985), 205-215
• Matroids on ordered sets and the greedy algorithm
  Report No. 83258: Faigle, U.
  in: R.E. Burkard, R.A. Cuninghame-Green, U. Zimmermann (Eds.): Algebraic and Combinatorial Methods in Operations Research. Amsterdam, New York, Oxford : North-Holland, 1984, 115-128. (Annals of Discrete Mathematics ; 19) (North-Holland Mathematics Studies ; 95)
• Submodular systems and related topics
  Report No. 83259: Fujishige, S.
  in: B. Korte, K. Ritter (Eds.): Mathematical Programming at Oberwolfach II, 1984, 113-131. (Mathematical Programming Study ; 22)
• Integral matroids and the greedy algorithm for discrete optimization problems
  Report No. 83260: Faigle, U.
  revised version see WP 85378
• A short note on w-optimal assignable sets and allocation problems
  Report No. 83261: Derigs, U.; Schrader, R.
  in: Bolletino Unione Matematica Italiana (6), 3-A (1984), No. 1, 97-101
• A vector exchange property of submodular systems
  Report No. 83262: Faigle, U.
  in: Discrete Applied Mathematics, 9 (1984), 209-211
• Solving matching problems via shortest path techniques
  Report No. 83263: Derigs, U.
  in: B. Simeone, P. Toth, G. Gallo, F. Maffioli, S. Pallot- tino (Eds.): Fortran Codes for Network Optimization. Basel : Baltzer, 1988, 225-261. (Annals of Operations Research ; 13 (1988)
• Facets of the bipartite subgraph polytope
  Report No. 83264: Barahona, F.; Grötschel, M.; Mahjoub, A.R.
  in: Mathematics of Operations Research, 10 (1985), 340- 358
• Magic graphs - A new characterization
  Report No. 83265: Derigs, U.; Hünten, B.
  
• A system of linear inequalities with a submodular function on (0,1,-1) vectors
  Report No. 83266: Fujishige, S.
  in: Linear Algebra and its Applications, 63 (1984), 253- 266
• Efficiency and time-cost-tradeoffs in transportation problems
  Report No. 83267 : Derigs, U.
  in: Operations Research Spektrum, 4 (1982), 213-222
• Cycle basis interpolation theorems
  Report No. 83268: Harary, F.; Kolasinska, E.; Syslo, M.M.
  in: B.R. Alspach, C.D. Godsil (Eds.): Cycles in Graphs. Amsterdam, New York, Oxford : North-Holland, 1985, 369-380. (Annals of Discrete Mathematics ; 27) (North- Holland Mathematics Studies ; 115)
• Orthogonal sets, matroids, and theorems of the alternative
  Report No, 83269: Faigle, U.
  in: Bollettino Unione Matematica Italiana (6), 4-B (1985), 139-153
• Modelling with integer variables
  Report No. 83270: Jeroslow, R.G.; Lowe, J.
  in: B. Korte, K. Ritter (Eds.): Mathematical Programming at Oberwolfach II, 1984, 167-184. (Mathematical Programming Study ; 22)
• On the cut polytope
  Report No. 83271: Barahona, F.; Mahjoub, A.R.
  in: Mathematical Programming, 32 (1985), 157-173
• The polynomial hierarchy and a simple model for competitive analysis
  Report No. 83272: Jeroslow, R.G.
  in: Mathematical Programming, 32 (1985), 146-164
• On some weakly bipartite graphs
  Report No. 83273: Barahona, F.
  in: Operations Research Letters, 2 (1983), 239-242
• Shelling structures, convexity and a happy end
  Report No. 83274 : Korte, B.; Lovász, L.
  in: B. Bollobas (Ed.): Graph Theory and Combinatorics. Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös, 1983. London, Orlando, San Diego : Academic Press, 1984, 219-232
• Polyhedral theory in oriented matroids
  Report No. 83275: Bachem, A.; Kern, W.
  in: R.W. Cottle, M.L. Kelmanson, B. Korte (Eds.): Mathematical Programming : Proceedings of the International Congress, Rio de Janeiro 1981. Amsterdam, New York, Oxford : North-Holland, 1984, 1-12
• On three basic methods for solving bottleneck transportation problems
  Report No. 83276 : Derigs, U.
  in: Naval Research Logistics Quarterly, 29 (1982), 505- 515
• The ellipsoid method and its implications
  Report No. 83277 n.g.: Schrader, R.
  in: Operations Research Spektrum, 5 (1983), 1-13
• Posets, matroids and greedoids
  Report No. 83278 : Korte, B.; Lovász. L.
  in: L. Lovász, A. Recski (Eds.): Matroid Theory. Amsterdam, Oxford, New York : North-Holland, 1985, 239-265. (Colloquia Mathematica Societatis Janos Bolyai ; 40)
• Series-parallel graphs and depth-first search trees
  Report No. 83279: Syslo, M.M.
  in: IEEE Transactions on Circuits and Systems, 31 (1984), 1029-1033
• On the use of confidence limits for the global optimum in combinatorial optimization problems
  Report No. 83280 : Derigs, U.
  published under the title: Using confidence limits for the global optimum in combinatorial optimization, in: Operations Research, 33 (1985), 1024-1049
• A size-width inequality for distributive lattices
  Report No. 83281: Faigle, U.; Sands, B.
  in: Combinatorica, 6 (1986), 29-33
• On ordered languages and the optimization of linear functions by greedy algorithms
  Report No. 83282: Faigle, U.
  in: Journal of the Association for Computing Machinery (ACM), 32 (1985), 861-870
• A characterization of faces of the base polyhedron associated with a submodular system
  Report No. 83283: Fujishige, S.
  in: Journal of the Operations Research Society of Japan, 27 (1984), 112-128
• A construction for strongly greedy ordered sets
  Report No. 83284: Faigle, U.
  in: G. Hammer, D. Pallaschke (Eds.): Selected Topics in Operations Research and Mathematical Economics. Berlin, Heidelberg, New York : Springer, 1984, 307-314. (Lecture Notes in Economics and Mathematical Systems ; 226)
• Greedoids and linear objective functions
  Report No. 83285 : Korte, B.; Lovász. L.
  in: SIAM Journal on Algebraic and Discrete Methods, 5 (1984), 229-238
• A submodular network simplex method
  Report No. 83286: Barahona, F.; Cunningham, W.H.
  in: B. Korte, K. Ritter (Eds.): Mathematical Programming at Oberwolfach II, 1984, 9-31. (Mathematical Programming Study ; 22)
• Extensions of a theorem of Balas
  Report No. 83287: Blair, C.E.; Jeroslow, R.G.
  in: Discrete Applied Mathematics, 9 (1984), 11-26
• Minimizing the jump number for ordered sets : a graph- theoretic approach
  Report No. 83288: Syslo, M.M.
  in: Order, 1 (1984), 7-19
• An efficient Dijkstra-like labeling method for computing shortest odd/even paths
  Report No. 83289: Derigs, U.
  in: Information Processing Letters, 21 (1985), 253-258
• Experimental results on the new techniques for integer programming formulations
  Report No. 83290: Jeroslow, R.G.; Lowe, J.
  in: Journal of the Operational Research Society, 36 (1985), 393-403
• On two problems related to the travelling salesman problem on Halin graphs
  Report No. 83291: Syslo, M.M.
  in: G. Hammer, D. Pallaschke (Eds.): Selected Topics in Operations Research and Mathematical Economics. Berlin, Heidelberg, New York : Springer, 1984, 325-335. (Lecture Notes in Economics and Mathematical Systems ; 226)
• Alternate strategies for solving bottleneck assignment problems - analysis and computational results
  Report No. 83292: Derigs, U.
  in: Computing, 33 (1984), 95-106
• A short note on the "near equivalence" of two partition strategies for determining the set of k best solutions of a combinatorial optimization problem
  Report No. 83293: Derigs, U.
• NP-complete problems on some tree-structured graphs : a review
  Report No. 83294: Syslo, M.M.
  in: M. Nagl, J. Perl (Eds.): Proceedings of the WG'83 International Workshop on Graphtheoretic Concepts in Computer Science, Osnabrück, 1983. Linz : Trauner, 1983, 342-353
• Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
  Report No. 83295: Derigs, U.
  in: Discrete Applied Mathematics, 11 (1985), 129-141
• A solvable case of the set partitioning problem
  Report No. 83296: Syslo, M.M.
  in: Zastosowania Matematyki, 19 (1987), 265-277
• Algorithmic approaches to setup minimization
  Report No. 83297: Faigle, U.; Gierz, G.; Schrader, R.
  in: SIAM Journal on Computing, 14 (1985), 954-965
• The critical complexity of graph properties
  Report No. 83298: Turan, G.
  in: Information Processing Letters, 18 (1984), 151-154
• On models of computation for graph theoretic problems
  Report No. 83299: Turan, G.
  in: U. Pape (Ed.): Proceedings of the WG '84 International Workshop on Graphtheoretic Concepts in Computer Science, Berlin 1984. Linz : Trauner, 1984, 369-381
• Polymatroid greedoids
  Report No. 83300 : Korte, B.; Lovász, L.
  in: Journal of Combinatorial Theory B, 38 (1985), 41-72
• Institut für Ökonometrie und Operations Research, Universität Bonn
  Report No. 83301: Verzeichnis der Arbeitspapiere - List of Working Papers WP 7201-83300 (1972-1983)
• An algorithmic characterization of total digraphs
  Report No. 83302: Skowronska, M.M; Syslo, M.M.; Zamfirescu, C.
  in: Journal of Algorithms, 7 (1986), 120-133
• Minimizing completion time for a class of scheduling problems
  Report No. 83303: Faigle, U.; Schrader, R.
  in: Information Processing Letters, 19 (1984), 27-30
• Relations between subclasses of greedoids
  Report No. 83304 : Korte, B., Lovász, L.
  in: Zeitschrift für Operations Research A, 29 (1985), 249- 267
• Über eine Anwendung statistischer Schranken in der kombinatorischen Optimierung
  Report No. 83305: Derigs, U.
  in: W. Bühler, K.E. Jäger, C. Schneeweis, J. Schwarze, H. Steckhan (Eds.): Operations Research Proceedings 1983 DGOR. Berlin, Heidelberg, New York : Springer, 1984, 282-288
• Zur Maschinenbelegungsplanung unter TNI-geordneten Restriktionen
  Report No. 83306: Faigle, U.; Schrader, R.
  in: W. Bühler, K.E. Jäger, C. Schneeweis, J. Schwarze, H. Steckhan (Eds.): Operations Research Proceedings 1983 DGOR. Berlin, Heidelberg, New York : Springer, 1984, 279-281
• Dual price function v. dual prices for the capital budgeting problem
  Report No. 83307: Holm, S.
  in: W. Bühler, K.E. Jäger, C. Schneeweis, J. Schwarze, H. Steckhan (Eds.): Operations Research Proceedings 1983 DGOR. Berlin, Heidelberg, New York : Springer, 1984, 274-278
• Comparability graphs and order invariants
  Report No. 83308: Faigle, U.; Schrader, R.
  in: U. Pape (Ed.): Proceedings of the WG '84 International Workshop on Graphtheoretic Concepts in Computer Science, Berlin 1984. Linz : Trauner, 1984, 136-145
• A note in hamilton-connected graphs
  Report No. 83309: Gurgel, M.A.; Wakabayashi, Y.
  
• Compositions for perfect graphs
  Report No. 83310: Cornuejols, G.; Cunningham, W.H.
  in: Discrete Mathematics, 55 (1983), 245-254
• Adjoints of oriented matroids
  Report No. 83311: Bachem, A.; Kern, W.
  in: Combinatorica, 6 (1986), 299-308
• On the three planar sums transportation polytope
  Report No. 83312: Vlach, M.
  revised version published under the title: Conditions for the existence of solutions of the three-dimensional planar transportation problem, in: Discrete Applied Mathematics, 13 (1986), 61-78
• Exchange properties and k-best strategies in combinatorial optimization
  Report No. 83313: Derigs, U.
  in: J.P. Brans (Ed.): Operational Research '84. Amsterdam, New York, Oxford : North-Holland, 1984, 393-406
• On the greedy algorithm for an edge-partitioning problem
  Report No. 83314: Turan, G.
  in: L. Lovász, E. Szemeredi (Eds.): Proceedings of the Colloquium on the Theory of Algorithms, Pecs, Hungary, 1984. Amsterdam, Oxford, New York : North-Holland, 1985, 405-423. (Colloquia Mathematica Societatis Janos Bolyai ; 44)

1984

Zurück zum Anfang / Back to start

• A note on matchings and separability
  Report No. 84315: Cook, W.
  in: Discrete Applied Mathematics, 16 (1985), 203-209
• On the construction of optimal linear extensions for interval orders
  Report No. 84316: Faigle, U.; Schrader, R.
  published under the title: A setup heuristic for interval orders, in: Operations Research Letters, 4 (1985), 185-188
• Optimal attack and reinforcement of a network
  Report No. 84317: Cunningham, W.H.
  in: Journal of the Association for Computing Machinery (ACM), 32 (1985), 549-561
• A generalization of hamilton-connected graphs
  Report No. 84318: Gurgel, M.A.; Wakabayashi, Y.
  published under the title: On k-leaf connected graphs, in: Journal of Combinatorial Theory Series B, 41 (1986), 1-16
• On chains of 3-connected matroids
  Report No. 84319: Bixby, R.E.; Coullard, C.R.
  in: Discrete Applied Mathematics, 15 (1986), 155-166
• Searching in trees, series-parallel and interval orders
  Report No. 84320: Faigle, U.; Lovász, L.; Schrader, R.; Turan, G.
  in: SIAM Journal on Computing, 15 (1986), 1075-1084
• Non-interval greedoids and the transposition property
  Report No. 84321 : Korte, B.; Lovász, L.
  in: Discrete Mathematics, 59 (1986), 297-314
• Adjoints of binary matroids
  Report No. 84322: Bixby, R.E.; Coullard, C.R.
  in: European Journal of Combinatorics, 9 (1988), 139- 147
• Linear systems for constrained matching problems
  Report No. 84323: Cook, W.; Pulleyblank, W.R.
  in: Mathematics of Operations Research, 12 (1987), 97- 120
• Basis graphs of greedoids and 2-connectivity
  Report No. 84324 : Korte, B.; Lovász, L.
  in: R.W. Cottle (Ed.): Mathematical Programming Essays in Honor of George B. Dantzig. Part I, 1985, 158-165. (Mathematical Programming Study ; 24)
  
• Cutting planes in combinatorics
  Report No. 84325: Chvatal, V.
  in: European Journal of Combinatorics,  6 (1985), 217-226
• Cutting-plane proofs and the stability number of a graph
  Report No. 84326: Chvatal, V.
• Packing and covering with integral flows in integral supply-demand networks
  Report No. 84327: Bixby, R.E.; Marcotte, O.M.-C.; Trotter Jr., L.E.
  in: Mathematical Programming, 39 (1987), 231-239
• The shortest augmenting path method for solving as signment problems - motivation and computational experience
  Report No. 84328: Derigs, U.
  in: C.L. Monma (Ed.): Algorithms and Software for Optimization Part I. Basel : Baltzer, 1986, 57-102. (Annals of Operations Research ; 4)
• Algorithmic aspects on some notions in classical mathematics
  Report No. 84329: Lovász, L.
  in: J.W. DeBakker, M. Hazewinkel, J.K. Lenstra (Eds.): Mathematics and Computer Science : Proceedings of the CWI Symposium, Amsterdam 1983. Amsterdam, New York, Oxford : North-Holland, 1986, 51-63. (CWI Monograph ; 1)
• The mathematical notion of complexity
  Report No. 84330: Lovász, L.
  in: Proc. IFAC Symp., Budapest 1984
• Homotopy properties of greedoids
  Report No. 84331 : Björner, A.; Korte, B.; Lovász, L.
  in: Advances in Applied Mathematics, 6 (1985), 447-494
• Bisimplicial edges, Gaussian elimination and matchings in bipartite graphs
  Report No. 84332: Derigs, U.; Goecke, O.; Schrader, R.
  in: U. Pape (Ed.): Proceedings of the WG '84 International Workshop on Graphtheoretic Concepts in Computer Science, Berlin 1984. Linz : Trauner, 1984, 79-87
• A combinatorical bijection between linear extensions of equivalent orders
  Report No. 84333: Faigle, U.; Schrader, R.
  in: Discrete Mathematics, 58 (1986), 295-301
• Forschungsinstitut für Diskrete Mathematik, Universität Bonn
  Report No. 84334: Annual Report 1983
• Forschungsinstitut für Diskrete Mathematik, Universität Bonn
  Report No. 84335: Jahresbericht 1983
• A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory
  Report No. 84336: Morton, G.; von Randow, R.; Ringwald, K.
  in: Mathematical Programming, 32 (1985), 238-241
• Finding a small 3-connected minor maintaining a fixed minor and a fixed element
  Report No. 84337: Bixby, R.E.; Coullard, C.R.
  in: Combinatorica, 7 (1987), 231-242
• Forschungsinstitut für Diskrete Mathematik, Universität Bonn
  Report No. 84338: Vth Bonn Workshop on Combinatorial Optimization: Abstracts of Talks
• A graph-theoretic approach to the jump-number problem
  Report No. 84339 : Syslo, M.M.
  in: I. Rival (Ed.): Graphs and Order. Dordrecht : Reidl, 1985, 185-215
• Corrigendum to our paper "the ellipsoid method and its consequences in combinatorial optimization"
  Report No. 84340: Grötschel. M.; Lovász, L.; Schrijver, A.
  in: Combinatorica, 4 (1984), 291-295
• Relaxations of vertex packing
  Report No. 84341: Grötschel, M.; Lovász, L.; Schrijver, A.
  in: Journal of Combinatorial Theory B, 40 (1986), 330-343
• Remarks on "the algorithmic way of life is the best"
  Report No. 84342: Korte, B.
  published under the title: Algorithmic mathematics versus dialectic mathematics: The College Mathematics Journal (MAA), 16 (1985), 6-8
• Monge sequences and a simple assignment algorithm
  Report No. 84343: Derigs, U.; Goecke, O.; Schrader, R.
  in: Discrete Applied Mathematics, 15 (1986), 241-248
• Short circuits in binary matroids
  Report No. 84344: Bixby, R.E.; Cunningham, W.H.
  in: European Journal of Combinatorics, 8 (1987), 213- 225
• The cardinality matching problem - a state of the art tutorial
  Report No. 84345: Derigs, U.
  in: U. Pape (Ed.): Proceedings of the WG '84 International Workshop on Graphtheoretic Concepts in Computer Science, Berlin 1984. Linz : Trauner, 1984, 58-78
• Solving large scale matching problems efficiently - a new primal matching approach
  Report No. 84346 : Derigs, U.
  in: Networks, 16 (1986), 1-16
• Solving matching problems with linear programming
  Report No. 84347: Grötschel, M.; Holland, O.
  in: Mathematical Programming, 33 (1985), 243-259
• An almost linear-time algorithm for graph realization
  Report No. 84348: Bixby, R.E.; Wagner, D.K.
  in: Mathematics of Operations Research, 13 (1988), 99- 123
• On simplicial decomposition in combinatorial structures
  Report No. 84349: Faigle, U.; Goecke, O.; Schrader, R.
  
• Sorting and recognition problems for ordered sets
  Report No. 84350: Faigle, U.; Turan, G.
  in: K. Mehlhorn (Ed.): STACS 85. Berlin, Heidelberg, New York : Springer, 1985, 109-118. (Lecture Notes in Computer Science ; 182)
• On box totally dual integral polyhedra
  Report No. 84351: Cook, W.
  in: Mathematical Programming, 34 (1986), 48-61
• The complexity of defining a relation on a finite graph
  Report No. 84352: Babai, L.; Turan, G.
  in: Mathematical Logic Quarterly 33, (2006), 277-288
• On some combinatorial properties of algebraic matroids
  Report No. 84353: Lovász, L.; Dress, A.
  in: Combinatorica, 7 (1987), 39-48
• Some algorithmic problems on lattices
  Report No. 84354: Lovász, L.
  in: L. Lovász, E. Szemeredi (Eds.): Proceedings of the Colloquium on the Theory of Algorithms, Pècs, Hungary, 1984. Amsterdam, Oxford, New York : North-Holland, 1985, 323-337. (Colloquia Mathematica Societatis Janos Bolyai ; 44)
• Kombinatorische Optimierung und algorithmische Prinzipien
  Report No. 84355 : Korte, B.
  in: W. Krelle (Ed.): Ökonomische Prognose-, Entscheidungs- und Gleichgewichtsmodelle. Weinheim : VCH- Verl., 1986, 286-341
• A strongly polynomial minimum cost circulation algorithm
  Report No. 84356: Tardos, E.
  in: Combinatorica, 5 (1985), 247-255
• Edge-disjoint paths in planar graphs
  Report No. 84357: Frank, A.
  in: Journal of Combinatorial Theory B, 39 (1985), 164- 178
• Dualität und Polarität in diskreten Strukturen
  Report No. 84358: Bachem, A.
  in: W. Krelle (Ed.): Ökonomische Prognose-, Entscheidungs- und Gleichgewichtsmodelle. Weinheim : VCH- Verl., 1986, 367-388
• On the distribution of distances in finite sets in the plane
  Report No. 84359: Vesztergombi, K.
  in: Discrete Mathematics, 57 (1985), 129-146
• A strongly polynomial algorithm to solve combinatorial linear programs
  Report No. 84360: Tardos, E.
  in: Operations Research, 34 (1986), 250-256

1985

Zurück zum Anfang / Back to start

• Forschungsinstitut für Diskrete Mathematik, Universität Bonn
  Report No. 85361: Jahresbericht 1984
• Forschungsbericht für Diskrete Mathematik, Universität Bonn
  Report No. 85362: Annual Report 1984
• Matrices with the Edmonds-Johnson property
  Report No. 85363: Gerards, A.M.H; Schrijver, A.
  in: Combinatorica, 6 (1986), 365-379
• Homomorphisms and Ramsey properties of antimatroids
  Report No. 85364 : Korte, B.; Lovász, L.
  in: Discrete Applied Mathematics, 15 (1986), 283-290
• Bounds on the number of small distances in a finite planar set
  Report No. 85365: Vesztergombi, K.
  in: Studia Scientiarum Mathematicarum Hungarica, 22 (1987), 95-101
• On the use of optimal fractional mappings for solving the (integer) matching problem
  Report No. 85366: Derigs, U.; Metz, A.
  in: Computing, 36 (1986), 263-270
• An efficient labeling technique for solving sparse as signment problems
  Report No. 85367: Derigs, U.; Metz, A.
  in: Computing, 36 (1986), 301-311
• An algorithmic theory of numbers, graphs, and convexity
  Report No. 85368: Lovász, L.
  published under the title: Theory of Numbers, Graphs and Convexity. Philadelphia : SIAM, 1986. (CBMS-NSF Re gional Conference Series in Mathematics ; 50)
• Sensitivity results in integer linear programming
  Report No. 85369: Cook, W.; Gerards, A.M.H.; Schrijver, A.; Tardos, E.
  in: Mathematical Programming, 34 (1986), 251-264
• Was ist kombinatorische Optimierung?
  Report No. 85370: Korte, B.
  translated into Chinese and published in: Chinese Journal of Operations Research, 4 (1985), 1 ff.
• Composition in the acyclic subdigraph polytope
  Report No. 85371: Barahona, F.; Mahjoub, A.R.
  revised version published under the title: Compositions of graphs and polyhedra IV: acyclic spanning subgraphs (with co-author J. Fonlupt). SIAM Journal on Discrete Mathematics, 7 (1994),390-402
• Exchange properties of combinatorial closure spaces
  Report No. 85372: Faigle, U.
  in: Discrete Applied Mathematics, 15 (1986), 249-260
• On the complexity of interval orders and semiorders
  Report No. 85373: Faigle, U.; Turan, G.
  in: Discrete Mathematics, 63 (1987), 131-141
• Kombinatorische Optimierung: von der Logelei zur anwendbaren Mathematik
  Report No. 85374: Korte, B.
  in: Bild der Wissenschaft, 6 (1985), 110-117
• An application of simultaneous diophantine approximation in combinatorial optimization
  Report No. 85375: Frank, A.; Tardos, E.
  in: Combinatorica, 7 (1987), 49-66
  preliminary version published in: 26th Annual Symposium on Foundations of Computer Science, Washington : IEEE Computer Society Press, 1985, 459-463
• An in-core/out-of core method for solving large scale assignment problems
  Report No. 85376: Derigs, U.; Metz, A.
  in: Zeitschrift für Operations Research, 30 A (1986), 181- 195
• On the complexity of cutting plane proofs
  Report No. 85377: Cook, W.; Coullard, C.R.; Turan, G.
  in: Discrete Applied Mathematics, 18 (1987), 25-38
• Matroids in combinatorial optimization
  Report No. 85378: Faigle, U.
  in: N.L. White (Ed.): Theory of Combinatorial Geometrics, Encyclopedia of Mathematics and its Applications, Chapter 9. Cambridge : Univ. Press, 1987
• On abstract integral dependence
  Report No. 85379: Crystal, D.; Trotter Jr., L.E.
  in: Mathematics of Operations Research, 14 (1989), 626- 638
• Setup minimization techniques for comparability graphs
  Report No. 85380: Faigle, U.; Schrader, R.
  in: H. Noltemeier (Ed.): Proceedings of the WG '85 International Workshop on Graphtheoretic Concepts in Computer Science, Würzburg, 1985. Linz : Trauner, 1985, 101-118
• Remarks on Dilworth partially ordered sets
  Report No. 85381: Syslo, M.M.
  in: H. Noltemeier (Ed.): Proceedings of the WG '85 International Workshop on Graphtheoretic Concepts in Computer Science, Würzburg, 1985. Linz : Trauner, 1985, 355-362
• Interval orders without odd crowns are defect optimal
  Report No. 85382: Faigle, U.; Schrader, R.
  in: Computing, 38 (1987), 59-69
• A very short proof of Seymour's theorem on t-joints
  Report No. 85383: Sebő. A.
  in: Discrete Mathematics, 64 (1987), 101-103
• On submodularity in greedoids and a counterexample
  Report No. 85384: Korte, B.; Lovász, L.
  in: Sezione di Matematica Applicata, 128 (1986). Pisa : Univ., Dipartimento di Matematica, 1-13
• Layered augmenting path algorithms
  Report No. 85385: Tardos, E.; Tovey, C.A.; Trick, M.A.
  in: Mathematics of Operations Research, 11 (1986), 362- 370
• On the computational complexity of the order polynomial
  Report No. 85386: Faigle, U.; Schrader, R.
  in: Discrete Applied Mathematics, 15 (1986), 261-269
• A characterization of undirected branching greedoids
  Report No. 85387: Schmidt, W.
• Greedoids and searches in directed graphs
  Report No. 85388: Schmidt, W.
  in: Journal of Combinatorial Theory B, 45 (1988), 160- 184
• Generalized polymatroids and submodular flows
  Report No. 85389: Frank, A.; Tardos, E.
  in: Mathematical Programming, 42 (1988), 489-563
• Polyhedral results for antimatroids
  Report No. 85390 : Korte, B.; Lovász, L.
  in: G.S. Bloom, E.L. Graham, J. Malkevitch (Eds.): Combinatorial Mathematics : Proceedings of the 3rd International Conference, 1985. New York : Academy of Sciences, 1989, 283-295. (Annals of the New York Academy of Sciences ; 555)
• Programming in networks and graphs - on the combinatorial background and near-equivalence of network flow and matching algorithms
  Report No. 85391: Derigs, U.
  U. Derigs (Ed.): Programming in Networks and Graphs : On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms. Berlin, Heidelberg, New York : Springer, 1988. (Lecture Notes in Economics and Mathematical Systems ; 300)
• Submodular combinatorial structures
  Report No. 85392: Faigle, U.
• Greene-Kleitman extensions of ordered sets
  Report No. 85393: Faigle, U.; Schrader, R.
  in: Methods of Operations Research, 53 (1986), 251-255
• The Schrijver system of odd join polyhedra
  Report No. 85394: Sebő, A.
  in: Combinatorica, 8 (1988), 103-106
• Total dual integrality implies local strong unimodularity
  Report No. 85395: Gerards, A.M.H.; Sebő, A.
  in: Mathematical Programming, 38 (1987), 69-73
• A min-max theorem for greedoids
  Report No, 85396: Schmidt, W.
• Subgradient techniques and combinatorial optimization
  Report No. 85397: Mahey, P.
• Some remarks on natural orders for combinatorial cubes
  Report No. 85398: Prömel, H.-J.
  in: Discrete Mathematics, 73 (1989), 189-198
• Setup optimization problems with matroid structure
  Report No. 85399: Faigle, U.; Schrader, R.
  
• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 85401 : Verzeichnis der Arbeitspapiere - List of Working Papers 7201-85400 (1972-1985)
• Neuere Ansätze in der linearen Optimierung - Motivation, Konzepte und Verfahren
  Report No. 85402: Derigs, U.
  in: L. Streitferdt, H. Hauptmann, A.W. Marusev, D. Ohse, U. Pape (Eds.): Operations Research Proceedings 1985 DGOR. Berlin, Heidelberg, New York : Springer, 1986, 47-58
• Graham-Rothschild parameter sets
  Report No. 85403: Prömel, H.-J.; Voigt, B.
  in: J. Nesetril, V. Rödl (Eds.): Mathematics of Ramsey Theory. Berlin, Heidelberg, New York : Springer, 1990. (Algorithms and Combinatorics)
• Kl+1-free graphs: asymptotic structure and a 0-1 law
  Report No. 85404: Kolaitis, P.G.; Prömel, H.-J.; Rothschild, B.L.
  in: Transactions of the American Mathematical Society (AMS), 303 (1987), 637-671
• Asymptotic enumeration of l-colorable graphs
  Report No. 85405: Prömel, H.-J.
• Bipartition systems and how to partition polygons
  Report No. 85406: Edmonds, J.; Lubiw, A.
  

1986

Zurück zum Anfang / Back to start

• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 86407: Jahresbericht 1985
• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 86408: Annual Report 1985
• Counting unlabeled structures
  Report No. 86409: Prömel, H.-J.
  in: Journal of Combinatorial Theory A, 44 (1987), 83-93
• Partition properties of q-hypergraphs
  Report No. 86410: Prömel, H.-J.
  in: Journal of Combinatorial Theory B, 41 (1986), 356- 385
• Orientability of a pseudomanifold and generalizations of Sperner's Lemma
  Report No. 86411: Yamamoto, Y.
  in: Journal of the Operations Research Society of Japan, 31 (1988), 19-42
• A partition theorem for [0,1]
  Report No. 86412: Prömel, H.-J.; Voigt, B.
  in: Proceedings of the American Mathematical Society (AMS), 109 (1990), 281-285
• The intersection of matroids and antimatroids
  Report No. 86413 : Korte, B; Lovász, L.
  in: Discrete Mathematics, 73 (1988/89), 143-157
• Cutting-plane proofs in polynomial space
  Report No. 86414: Cook. W.
  in: Mathematical Programming, 47 (1990), 11-18
• A path-following algorithm for stationary point problems
  Report No. 86415: Yamamoto, Y.
  in: Journal of the Operations Research Society of Japan, 30 (1987), 181-198
• A Las Vegas-NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues (draft)
  Report No. 86416: Babai, L.
• Structural theory of discrete greedy procedures
  Report No. 86417: Schrader, R.
• On an optimal location problem in a triangle
  Report No. 86418: Randow, R. von
  in: The Mathematical Scientist, 11 (1986), 107-110
• On connectivity properties of Eulerian digraphs
  Report No. 86419: Frank, A.
  in: L. Dovling-Andersen, I. Tafteberg-Jakobsen, C. Thomassen, B. Toft, P.D. Vestergaard (Eds.): Graph Theoryin Memory of G.A. Dirac. Amsterdam, New York, Oxford : North-Holland, 1989, 179-194. (Annals of Discrete Mathematics ; 41)
• A note on detecting simple redundancies in linear systems
  Report No. 86420: Bixby, R. E.; Wagner, D.K.
  in: Operations Research Letters, 6 (1987), 15-17
• A simple linear-time algorithm to recognize interval graphs
  Report No. 86421: Korte, B.; Möhring, R.H.
  in: G. Tinhofer, G. Schmidt (Eds.): Graphtheoretic Concepts in Computer Science : International Workshop WG '86, Bernried, 1986, Proceedings. Berlin, Heidelberg, New York : Springer, 1987, 1-16. (Lecture Notes in Computer Science ; 246)
• A globally convergent simplicial algorithm for stationary point problems of polytopes
  Report No. 86422: Talman, A. J. J.; Yamamoto, Y.
  in: Mathematics of Operations Research, 14 (1989), 383- 399
• A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
  Report No. 86423: Goecke, O.
  in: Discrete Applied Mathematics, 20 (1988), 39-49
• The bandwidth of planar distributive lattices
  Report No. 86424: Faigle, U.; Gierz, G.
  in: G. Tinhofer, G. Schmidt (Eds.): Graphtheoretic Concepts in Computer Science : International Workshop WG '86, Bernried, 1986, Proceedings. Berlin, Heidelberg, New York : Springer, 1987, 94-105. (Lecture Notes in Computer Science ; 246)
• Almost bipartite-making graphs
  Report No. 86425: Prömel, H.-J.
  in: M. Karonski, J, Jaworski, A. Rucinski (Eds.): Random Graphs. New York, Chichester, Brisbane : Wiley, 1990, 275-282
• Church-Rosser decomposition in combinatorial structures
  Report No. 86426: Faigle, U.; Goecke, O.; Schrader, R.
  
• Covering minima and lattice-point-free bodies
  Report No. 86427: Kannan, R.; Lovász, L.
  in: K. Nori (Ed.): Foundations of Software Technology and Theoretical Computer Science. Berlin, Heidelberg, New York : Springer, 1986, 193-213. (Lecture Notes in Computer Science ; 241)
• On the convergence of stationary distributions in simulated annealing
  Report No. 86428: Faigle, U.; Schrader, R.
  in: Information Processing Letters, 27 (1988), 189-194
• Monotone path systems in simple regions
  Report No. 86429: Cameron, K.; Sachs, H.
  
• Simulated Annealing - eine Fallstudie
  Report No. 86430: Faigle, U.; Schrader, R.
  in: Angewandte Informatik, 6 (1988), 259-263
• Representations of bicircular matroids
  Report No. 86431: Coullard, C.R.; delGreco, J.G.; Wagner, D.K.
  in: Discrete Applied Mathematics, 32 (1991), 223-240
• On the graph of large distances
  Report No. 86432: Erdös, P.; Lovász, L.; Vesztergombi, K.
  in: Discrete and Computational Geometry, 4 (1989), 541- 549
• A cutting-plane algorithm for optimal graph partitioning
  Report No. 86433: Faigle, U.; Schrader, R.; Suletzki, R.
  in: Methods of Operations Research, 57 (1987), 109-116
• On a generalization of the Rado-Hall theorem to greedoids
  Report No. 86434: Ding, L.Y.; Yue, M.Y.
  in: Asia-Pacific Journal of Operational Research, 4 (1987), 28-38
• Minor characterization of branching greedoids - a shortproof
  Report No. 86435: Goecke, O.; Schrader, R.
  in: Discrete Mathematics, 82 (1990), 93-99
• MPP-greedoids
  Report No. 86436: Chang, G.J
  
• Finding embedded network rows in linear programs I: extraction heuristics
  Report No. 86437: Bixby, R.E.; Fourer, R.
  in: Management Science, 34 (1988), 342-376
• Total domination in block graphs
  Report No. 86438: Chang, G.J.
  in: Operations Research Letters, 8 (1989), 53-57
• Graphs whose cycles are of length and modulus k
  Report No. 86439: Chang, G.J.; Wu, C.-S.
  
• A cutting plane algorithm for minimum perfect 2-matchings
  Report No. 86440: Grötschel, M.; Holland, O.
  in: Computing, 39 (1987), 327-344
• Zur Bedeutung der diskreten Mathematik für die Konstruktion hochintegrierter Schaltkreise
  Report No. 86441 : Korte, B; Möhring, R.H.
  in: R. Henn (Ed.): Technologie, Wachstum und Beschäftigung. Festschrift für Lothar Späth. Berlin, Heidelberg : Springer, 1987, 582-596
• Labeling algorithms for domination problems in sun-free chordal graphs
  Report No. 86442: Chang, G.J.
  in: Discrete Applied Mathematics, 22 (1988/89), 21-34
• Aspects of asymptotic graph theory
  Report No. 86443: Prömel, H.-J.
  in: A. Kerber (Ed.): Actes du 15e Seminaire Lotharingien. Strasbourg : Publ. I.R.M.A., 1987, 89-95
• Chvatal closures for mixed integer programming problems
  Report No. 86444: Cook, W.; Kannan, R.; Schrijver, A.
  in: Mathematical Programming, 47 (1990), 155-174
• The network penalty method
  Report No. 86445: Conn, A.R.; Gamble, A.B.; Pulleyblank, W.R.
  
• Total dual integrality implies local strong unimodularity
  Report No. 86446: Gerards, A.M.H.; Sebő, A.
  
• Ramsey theorems for finite graphs
  Report No. 86447: Prömel, H.-J.; Voigt, B.
  
• Scheduling project networks with resource constraints and time windows
  Report No. 86448: Bartusch, M.; Möhring, R.H.; Radermacher, F.J.
  in: R.L. Keeney, R.H. Möhring, H. Otway, F.J. Radermacher (Eds.): Multi-Attribute Decision Making via O.R.- Based Expert Systems. Basel : Baltzer, 1988, 201-240. (Annals of Operations Research ; 16)
• A short proof of the restricted Ramsey theorem for finite set systems
  Report No. 86449: Prömel, H.-J.; Voigt, B.
  in: Journal of Combinatorial Theory A, 52 (1989), 313- 320

1987

Zurück zum Anfang / Back to start

• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 87450: Annual Report 1986
• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 87451: Jahresbericht 1986
• On cutting-plane proofs in combinatorial optimization
  Report No. 87452: Chvatal, V.; Cook, W.; Hartmann, M.
  in: Linear Algebra and its Applications, 114/115 (1989), 455-499
• Algorithmic geometry of numbers
  Report No. 87453: Kannan, R.
  in: Annual Reviews of Computer Science, 2 (1987), 231- 267
• Planar multicommodity flows, max-cut, and the Chinese postman problem
  Report No. 87454: Barahona, F.
  in: Proc. Conf. on Discrete Mathematics and Computer Science, Morristown, NJ, 1989
• Experiments in quadratic 0-1 programming
  Report No. 87455: Barahona, F.; Jünger, M.; Reinelt, G.
  in: Mathematical Programming, 44 (1989), 127-137
• Examples and algorithmic properties of greedoids
  Report No. 87456: Goecke, O.; Korte, B.; Lovász, L.
  in: B. Simeone (Ed.): Combinatorial Optimization : Lectures given at the 3rd Session of Centro Internazionale Matematico Estivo, Como, 1986. Berlin, Heidelberg, New York : Springer, 1989, 113-161. (Lecture Notes in Mathematics ; 1403)
• Ramsey theorems for finite graphs II
  Report No. 87457: Prömel, H.-J.; Voigt, B.
  
• Matroid Steiner problems, the Tutte polynomial and network reliability
  Report No. 87458: Colbourn, C.J.; Pulleyblank, W.R.
  in: Journal of Combinatorial Theory B, 47 (1989), 20-31
• On computing the information theoretic bound for sorting: counting the linear extension of posets
  Report No. 87459: Steiner, G.
  published under the title: Polynomial algorithms to count linear extensions in certain posets, in: Congressus Numerantium, 75 (1990), 71-90
• On the information theoretic bound for sorting: balancing the linear extension of posets
  Report No. 87460: Steiner, G.
  published under the title: Polynomial algorithms to count linear extensions in certain posets, in: Congressus Numerantium, 75 (1990), 71-90
  
• Intervallgraphen und MPABäume: Algorithmen und Datenstrukturen zur Manipulation von Intervallgraphen und der Lösung von Seriationsproblemen
  Report No. 87461: Korte, B. (Dissertation)
• Strukturelle Aspekte in der kombinatorischen Optimierung: Greedoide auf Graphen 
  Report No. 87462: Schmidt, W. (Dissertation)
• Eliminationsprozesse in der kombinatorischen Optimierung ein Beitrag zur Greedoidtheorie
  Report No. 87463: Goecke, O. (Dissertation)
• Compositions of graphs and polyhedra II: stable sets
  Report No. 87464: Barahona, F.; Mahjoub, A.R.
  in: SIAM Journal on Discrete Mathematics, 7 (1994), 359-371
• A topological characterization for closed sets under polar duality in Qn
  Report No. 87465: Hartmann, M.; Trotter Jr., L.R.
  in: Mathematical Programming, 49 (1990/91), 281-283
• Two terminal Steiner tree polyhedra
  Report No. 87466: Ball, M. O., W. Liu; Pulleyblank, W.R.
  
• Forest covers and a polyhedral intersection theorem
  Report No. 87467: Gamble, A.B.; Pulleyblank, W.R.
  in: Mathematical Programming, 45 (1989), 49-58
• Computationally tractable classes of ordered sets
  Report No. 87468: Möhring, R.H.
  in: I. Rival (Ed.): Algorithms and Order. Dordrecht, Boston, London : Kluwer, 1989, 105-193. (Nato Advanced Study Institutes Series : C ; 255)
• A sparse Graham-Rothschild theorem
  Report No. 87469: Prömel, H.-J.; Voigt, B.
  in: Transactions of the American Mathematical Society (AMS), 309 ( 1988), 113-137
• The perfect matchable subgraph polytope of a general graph
  Report No. WP 87471: Balas, E.; Pulleyblank, W.R. *Not Published
• Domination in graphs with minimum degree two
  Report No. 87472: McCuaig, B.; Shepherd, B.
  in: Journal of Graph Theory, 13 (1989), 749-762
• Graph connectivity and network flows
  Report No. 87473: Frank, A.
  published under the title: Connectivity and network flows, in: R. Graham, M. Grötschel, L. Lovász
  (Eds.): Handbook of Combinatorics, Volume 1. Amsterdam, Lausanne, New York : Elsevier, 1995, 111-177
• The clique polytope of a graph
  Report No. 87474: Faigle, U.
• Computing the bump number is easy
  Report No. 87475: Habib, M.; Möhring, R.H.; Steiner, G.
  in: Order, 5 (1988), 107-129
• The maximum size of a convex polygon in a restricted set of points in the plane
  Report No. 87476: Alon, N.; Katchalski, M.; Pulleyblank, W.R.
  in: Discrete and Computational Geometry, 4 (1989), 245- 252
• Cutting disjoint discs by straight lines
  Report No. 87477: Alon, N.; Katchalski, M.; Pulleyblank, W.R.
  in: Discrete and Computational Geometry, 4 (1989), 239- 244
• Cores of games with restricted cooperation
  Report No. 87478: Faigle, U.
  in: Zeitschrift für Operations Research, 33 (1989), 405- 422
• Schnittebenenverfahren für Travelling-Salesman- und verwandte Probleme
  Report No. 87479: Holland, O. (Dissertation)
• An extension of Karmarkar's algorithm for bounded linear programming problems
  Report No. 87480: Steger, A.
  in: H. Schellhaas, P. van Beek, H. Isermann, R. Schmidt, M. Zijlstra (Eds.): Operations Research
  Proceedings 1987 DGOR/NSOR. Berlin, Heidelberg, New York : Springer, 1988, 88-95
• Linearity and unprovability of the set union problem strategies (extended abstract)
  Report No. 87481: Loebl, M.; Nesetril, J.
  in: Association for Computing Machinery (ACM): Proceedings of the 20th Annual ACM Symposium
  on Theory of Computing, Chicago, 1988. New York : ACM-Press, 1988, 360-366
• Lexicographically optimal base of a submodular system with respect to a weight vector
  Report No. 87482: Iwamura, K.
  in: RIMS Kokyuroku, (1990), 166-176
• Applications of combinatorics to electrical engineering and rigidity
  Report No. 87483: Recski, A.
  published under the title: Combinatorics in electrical engineering and statics
  in: R. Graham, M. Grötschel, L. Lovász (Eds.): Handbook of Combinatorics, Volume 2. Amsterdam,
  Lausanne, New York : Elsevier, 1995, 1911-1924
• Two infinite sets of primes with fast primality tests
  Report No- 87484: Pintz, J.; Steiger, W.L.; Szemeredi, E.
  in: Association for Computing Machinery (ACM): Procee dings of the 20th Annual ACM Symposium
  on Theory of Computing, Chicago, 1988. New York : ACM-Press, 1988, 504-509
  and published under the title: Infinite sets of primes with fast primality tests and quick generation of
  large primes, in: Mathematics of Computation, 53 (1989), 399-406
• Connectivity properties of graphs and symmetric matroids
  Report No. 87482: Middendorf, M.
• On cycle cones and polyhedra
  Report No. 87486: Coullard, C.R.; Pulleyblank, W.R.
  in: Linear Algebra and its Applications, 114/115 (1989), 613-640
• On the threshold independence system
  Report No. 87487: Milanov, P.B.
• On a problem of Pisier
  Report No. 87488: Nesetril, J.
• Tree-matchings in random graphs
  Report No. 87489: Luczak, T.; Rucinski, A.
  revised version published under the title: Tree-matchings in random graph processes
  in: SIAM Journal on Discrete Mathematics, 4 (1991),107-120
• On polynomial time decidability of induced-minor-closed classes membership
  Report No. 87490: Matousek, J.; Nesetril, J.; Thomas, R.
  in: Commentationes Mathematicae Universitatis Caro linae, 29 (1988), 703-710
• On via minimization
  Report No. 87491: Barahona, F.
  in: IEEE Transactions on Circuits and Systems 37, (1990), 527-530
• One-story buildings as tensegrity frameworks
  Report No. 87492: Recski, A.
• Ramsey theory for discrete structures
  Report No. 87493: Prömel, H.-J. (Habilitation)
• Routing in VLSI layout
  Report No. 87494: Froleyks, B.; Korte, B.; Prömel, H.-J.
  in: Acta Mathematicae Applicatae Sinica, 7 (1991), 53-66
• Apsects of Ramsey theory I: sets
  Report No. 87495: Prömel, H.-J.; Voigt, B.
  
• Some algorithmic problems of linear network solvability
  Report No. 87496: Recski, A.
  in: Institute of Electrical and Electronics Engineers (IEEE): Proceedings of the IEEE International
  Symposium on Circuits and Systems, Helsinki, 1988: Washington : IEEE Computer Society Press, [1988], 135-138
• Aspects of Ramsey theory II: Arithmetic progression
  Report No. 87497: Prömel, H.-J.; Voigt, B.
  

1988

Zurück zum Anfang / Back to start

• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 88498: Annual Report 1987
• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 88499: Jahresbericht 1987
• Partitioning and placement in VLSI-layout
  Report No. 88500: Korte, B.; Prömel, H.-J.; Schwietzke, E. (revised version see Report No. WP 89597)
• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 88501: Verzeichnis der Arbeitspapiere - List of Working Papers, 7201 - 88500 (1972 - 1988)
• Contracting greedoids and a Rado-Hall type theorem
  Report No. 88502: Iwamura, K.
• On cuts and matchings in planar graphs
  Report No. 88503: Barahona, F.
  in: Mathematical Programming, 60 (1993), 53-68
• Planar subgraphs of topological layouts
  Report No. 88504: Kratochvil, J.; Nesetril, J.
  
• Ramsey theory
  Report No. 88505: Nesetril, J.
  in: R. Graham, M. Grötschel, L. Lovász (Eds.): Handbook of Combinatorics, Volume 2. Amsterdam, Lausanne, New York : Elsevier, 1995, 1331-1403
• Solution of large scale symmetric travelling salesman problems
  Report No. 88506: Grötschel, M.; Holland, O.
  in: Mathematical Programming, 51 (1991), 141-202
• Primal-dual algorithm for the lexicographically optimal base of a submodular polyhedron and its relation to a poset greedoid
  Report No. 88507: Iwamura, K.
  in: Arugorizumu (1988), 2-5
• Universality of directed graphs of a given height
  Report No. 88508: Hell, P.; Nesetril, J.
  in: Archivum Mathematicum (BRNO), 25 (1989), 47-54
• Note on Weintraub's minimum cost circulation algorithm
  Report No. 88509: Barahona, F.; Tardos, E.
  in: SIAM Journal on Computing, 18 (1989), 579-583
• Images of rigid digraphs
  Report No. 88510: Hell, P.; Nesetril, J.
  
• Routing multiterminal nets via disjoint connected t-joints
  Report No. 88511: Middendorf, M.; Pfeiffer, F.
  
• Minimal graphs without bilateral symmetry: the case of induced length
  Report No. 88512: Nesetril, J.; Sabidussi, G.
  
• On circuit decomposition of planar Eulerian graphs
  Report No. 88513: Fleischner, H.; Frank, A.
  in: Journal of Combinatorial Theory B, 50 (1990), 245- 253
• An application of submodular flows
  Report No. 88514: Frank, A.; Tardos, E.
  in: Linear Algebra and its Applications, 114/115 (1989), 329-348
• Martingales, isoperimetric inequalities and random graphs
  Report No. 88515: Bollobas, B.
• The travelling salesman problem in the k-dimensional
  Report No. 88516: Bollobas, B.; Meir, A.
  
• Integral infeasibility and testing total dual integrality
  Report No. 88517: Applegate, D.L.; Cook, W.; McCormick, S.T.
  in: Operations Research Letters, 10 (1991), 37-41
• The complexity of communication
  Report No. 88518: Lovász, L.
  in: J. Rau, H.-O. Henkel, L. Lovász, B. Korte, K. Fleischhauer: Mathematik und Technologie. Bonn : Bouvier, 1988, 28-38. (Bonner Akademische Reden ; 70)
• Mathematische Methoden beim Chip-Design
  Report No. 88519: Korte, B.
  in: J. Rau, H.-O. Henkel, L. Lovász, B. Korte, K. Fleischhauer: Mathematik und Technologie. Bonn: Bouvier, 1988, 39-103. (Bonner Akademische Reden ; 70)
• Two edge connected spanning graphs and polyhedra
  Report No. 88520: Mahjoub, A.R.
  in: Mathematical Programming, 64 (1994), 199-208
• On dual integrality in matching problems
  Report No. 88521: Barahona, F.; Cunningham, W.H.
  in: Operations Research Letters, 8 (1989), 245-249
• Homotopic routing methods
  Report No. 88522: Schrijver, A.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 329-371. (Algorithms and Combinatorics ; 9)
• An outline of a disjoint path algorithm
  Report No. 88523: Robertson, N.; Seymour, P.D.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 267-292. (Algorithms and Combinatorics ; 9)
• Graham-Rothschild parameter sets and measure partition
  Report No. 88524: Prömel, H.-J.; Voigt, B.
  in: Combinatorica, 11 (1991), 253-259
• Fast growing functions based on a ramsey theorem
  Report No. 88525: Prömel, H.-J.; Thumser, W.; Voigt, B.
  published under the title: Fast growing functions based on ramsey theorems, in: Discrete Mathematics, 95 (1991), 341-358
• Covering two digraphs with arborescence
  Report No. 88526: Cai, M.-C.
• Reorientation of covering graphs
  Report No. 88527: Brightwell, G.; Nesetril, J.
  in: Discrete Mathematics, 88 (1991), 129-132
• Linearity and unprovability of the set union problem strategies
  Report No. 88528: Nesetril, J.; Loebl, M.
  
• The max clique problem in classes of string graphs
  Report No. 88529: Middendorf, M.; Pfeiffer, F.
  
• Ramsey theory for the Cantor space
  Report No. 88530: Prömel, J.-J.; Voigt, B.
  in: Rostock Math. Kolloquium, 39 (1990), 21-34
• Some of my old and new combinatorial problems
  Report No. 88531: Erdös, P.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 35-45. (Algorithms and Combinatorics ; 9)
• Packing paths, circuits and cuts - a survey
  Report No. 88532: Frank, A.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 47-100. (Algorithms and Combinatorics ; 9)
• Cycles through prescribed elements in a graphs
  Report No. 88533: Lomonosov, M.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 215-234. (Algorithms and Combinatorics ; 9)
• Plane multicommodity flows with a bounded number of requests
  Report No. 88534: Sebő, A.
  revised version published under the title: Integer plane multiflows with a fixed number of demands in: Journal of Combinatorial Theory B, 59 (1993), 163- 171
• B-matching degree-sequence polyhreda
  Report No. 88535: Cunningham, W.H.; Green-Krotki, J.
  
• The communication complexity of interval orders
  Report No. 88536: Faigle, U.; Schrader, R.; Turan, Gy.
  
• Unbounded general factors of graphs
  Report No. 88537: Sebő, A.
• A note on some factor theorems of graphs
  Report No. 88538: Cai, M.-C.
• A remark on minimal polynomials of Boolean functions
  Report No. 88539: Voigt, B.; Wegener, I.
  
• Small travelling salesman polytopes
  Report No. 88540: Boyd, S.C.; Cunningham, W.H.
  
• Applications of combinatorial optimization
  Report No. 88541 : Korte, B.
  in: M. Iri, K. Tanabe (Eds.): Mathematical Programming: Recent Developments and Applications. Dordrecht, Bo ston, London : Kluwer, 1989, 1-55. (Mathematics and its Applications (Japanese Series))
• [a,b]-factorization of graphs
  Report No. 88542: Cai, M.-C.
• Star arboricity
  Report No. 88543: Alon, N.; McDiarmid, C.; Reed, B.
  in: Combinatorica, 12 (1992), 375-380
• One-story buildings as tensegrity frameworks III
  Report No. 88544: Recski, A.; Schwärzler, W.
  in: Discrete Applied Mathematics, 39 (1992), 137-146
• Aspects of Ramsey theory III: parameter sets
  Report No. 88545: Prömel, H.-J.; Voigt, B.
  
• Aspects of Ramsey theory V: topological Ramsey theory
  Report No. 88546: Prömel, H.-J.; Voigt, B.
  
• On the exact upper bound for the multifit processor scheduling algorithm
  Report No. 88547: Yue, M.-Y.
• Partitions of reals, measurable approach
  Report No. 88548: Plewik, Sz.; Voigt, B.
  
• Reducing matching to polynomial size linear programming
  Report No. 88549: Barahona, F.
  in: SIAM Journal on Optimization 3, (1993), 688-695
• 2-layer routing of dense bipartite specifications with ver tex disjoint paths and via holes
  Report No. 88550: Recski, A.
• Packing paths in planar graphs
  Report No. 88551: Frank, A.
  in: Combinatorica, 10 (1990), 329-335

1989

Zurück zum Anfang / Back to start

• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 89552: Annual Report 1988
• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 89553: Jahresbericht 1988
• A separation algorithm for the matchable polytope
  Report No. 89554: Cunningham, W.H.; Green-Krotki, J.
  
• Communication complexity : a survey
  Report No. 89555: Lovász, L.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 235-265. (Algorithms and Combinatorics ; 9)
• Ramsey properties of random graphs
  Report No. 89556: Luczak, T.; Rucinski, A.; Voigt, B.
  
• Representativity of surface embeddings
  Report No. 89557: Robertson, N.; Vitray, R.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 293-328. (Algorithms and Combinatorics ; 9)
• Separator theorems and their applications
  Report No. 89558: Chung, F.R.K.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 17-34. (Algorithms and Combinatorics ; 9)
• On some applications of the Chinese postman problem
  Report No. 89559: Barahona, F.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 1-16. (Algorithms and Combinatorics ; 9)
• Preemptive scheduling on a hypercube
  Report No. 89560: Hoesel, C.P.M. van
• Routing problems in grid graphs
  Report No. 89561: Kaufmann, M.; Mehlhorn, K.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 165-184. (Algorithms and Combinatorics ; 9)
• Which line-graphs are perfectly orderable?
  Report No. 89562: Chvatal, V.
  in: Journal of Graph Theory, 1 (1990), 555-558
• The permutahedron of series-parallel posets
  Report No. 89563: Arnim, A. von; Faigle, U.; Schrader, R.
  in: Discrete Applied Mathematics, 28 (1990), 3-9
• The number of vertices of degree k in a minimally k- edge-connected graph
  Report No. 89564: Cai, M.-C.
• Compositions of graphs and polyhedra III: graphs with no W4 minor
  Report No. 89565: Barahona, F.; Mahjoub, A.R.
  in: SIAM Journal on Discrete Mathematics, 7 (1994), 372-389
• Steiner trees in VLSI-layout
  Report No. 89566: Korte, B.; Prömel, H.-J.; Steger, A.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 185-214. (Algorithms and Combinatorics ; 9)
• Network flow algorithms
  Report No. 89567: Goldberg, A.V.; Tardos, Eva; Tarjan, R.E.
  in: B. Korte, L. Lovász, H.-J. Prömel, A. Schrijver (Eds.): Paths, Flows and VLSI Layout. Berlin, Heidelberg, New York : Springer, 1990, 101-164. (Algorithms and Combinatorics ; 9)
• A linear relaxation heuristic for the generalized as signment problem
  Report No. 89568: Trick, M.A.
• How hard is it to control an election?
  Report No. 89569: Bartholdi III, J.J.; Tovey, C.A.; Trick, M.A.
  
• Most uniform path partitioning and its use in image processing
  Report No. 89570: Lucertini, M.; Perl, Y.; Simeone, B:
  in: ACM Discrete Applied Mathematics 42, (1993), 227-256
• Combining partitioning and global routing in sea-of-cells design
  Report No. 89571 : Korte, B.; Prömel, H.-J.; Steger, A.
  in: Institute of Electrical and Electronics Engineers (IEEE): ICCAD-89 : International Conference in Computer Aided Design. Washington, Los Alamitos, Brussels : IEEE Computer Society Press, 1989, 98-101
• Computational use of group theory in bifurcation analysis of symmetric structures
  Report No. 89572: Murota, K.; Ikeda, K.
  in: SIAM Journal on Scientific and Statistical Computing, 12 (1991), 273-297
• A class of perfectly orderable graphs
  Report No. 89573: Chvatal, V.
• On integer points in polyhedra
  Report No. 89574: Cook, W.; Hartmann, M; Kannan, R.; McDiarmid, C.
  in: Combinatorica, 12 (1992), 27-37
• Partitioning graphs into dense subgraphs
  Report No. 89575: Garbers, J.; Prömel, H.-J.; Steger, A.
  
• Packing odd cuts and multicommodity flows
  Report No. 89576: Sebő, A.
  in: SIAM Journal on Computing 26 (1997), 582–603
• Vorlesung über "Das Steiner Problem in Graphen"
  Report No. 89577: Prömel, H.-J.; Steger, A.
  
• Graphs and orders
  Report No. 89578: Faigle, U.; Schrader, R.
  in: Computing Suppl., (1990), 109-124
• Design, Layout und Produktion von Computer-Hardware mit Verfahren der diskreten Mathematik
  Report No. 89579: Korte, B.
  
• Greedoids
  Report No. 89580: Korte, B.; Lovász; L.; Schrader, R.
  published as: B. Korte, L. Lovász, R. Schrader: Greedoids. Berlin, Heidelberg, New York :
  Springer, 1991. (Algorithms and Combinatorics ; 4)
• Diskrete Mathematik und ihre Anwendungen, auch in der Physik
  Report No. 89581: Korte, B.
  
• Globale und lokale Verdrahtungsalgorithmen für Sea-of-Cells Design
  Report No. 89582 : Hetzel, A.; Korte, B.; Krieger,, R.; Prömel, H.-J.; Radicke, U.; Steger, A.
  in: Informatik - Forschung und Entwicklung, 5 (1990), 2- 19
• On cographic multicommodity flow algorithms
  Report No. 89583: Sebő, A.
• Note on a graph theoretic criterion for structural output controllability
  Report No. 89584: Murota, K.; Poljak, S.
  in: IEEE Transactions on Automatic Control, 35 (1990), 939-942
• On the complexity of the disjoint path problem
  Report No. 89585: Midendorf, M.; Pfeiffer, F.
  
• On disjoint homotopic paths in the plane
  Report No. 89586: Frank, A.
  in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science 1 (1990), 163-170
• The asymptotic number of graphs not containing a fixed color-critical chromatic subgraph
  Report No. 89587: Prömel, H.-J.; Steger, A.
  in: Combinatorica 12 (1992), 463-473
• An Eulerian trail traversing specified edges in given order
  Report No. 89588: Cai, M.C.; Fleischer, H.
  
• A greedy preprocessing algorithm for setup optimization
  Report No. 89589: Faigle, U.; Schrader, R.
  
• Edge-forwarding indices of 2-edge-connected graphs
  Report No. 89590: Cai, M.-C.
• Structure-oriented algorithms for determining dynamical degree
  Report No. 89591: Murota, K.
• VLSI-placement based on routing an timing information
  Report No. 89592: Garbers, J.; Korte, B.; Prömel, H.J.; Schwietzke, E.; Steger, A.
  in: The European Design Automation Conference (EDAC), Glasgow 1990, Proceedings.
  Washington, Brussels, Tokyo : IEEE Computer Society Press, 1990, 317- 321
• Computing Puiseux-series expansion via combinatorial relaxation
  Report No. 89593: Murota, K.
  in: SIAM Journal on Computing, 19 (1990), 1132-1161
• On the complexity of recognizing perfectly orderable graphs
  Report No. 89594: Middendorf, M.; Pfeiffer, F.
  in: Discrete Mathematics, 80 (1990), 327-333
• An O(logn) parallel algorithm for testing bipartite graphs
  Report No. 89595: Hoang, C.T.
• Reversible-segment list
  Report No. 89596: Hars, L.
• Placement in VLSI-layout: combining partitions, global routing and timing analysis
  Report No. 89597: Garbers, J.; Korte, B.; Prömel, H.J.; Schwietzke, E.; Steger, A.
  
• An unprovable Ramsey-type theorem
  Report No. 89598: Leobl, M.; Nesetril, J.
  
• Subgraph packing - a survey
  Report No. 89599: Loebl, M.; Poljak, S.
  in: R. Bodendiek, R. Henn (Eds.): Topics in Combinatorics and Graph Theory : Essays in Honour of Gerhard Ringel. Heidelberg : Physica-Verl., 1990
• Applications of combinatorial optimization in the design, layout and production of computers
  Report No. 89600: Korte, B.
  in: M. Carnevale, M. Lucertini, S. Nicosia (Eds.): Modelling the Innovation : Communications, Automation and Information Systems. Rom : Federation for Information Processing, 1990
• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 89601: Verzeichnis der Arbeitspapiere - List of Working Papers 7201-89600 (1972-1989)
• Allmost all graphs with 1.44n edges are 3-colourable
  Report No. 89602: Chvatal, V.
  in: Random Structures and Algorithms, 2 (1991), 11-28
• On the two-edge-colourings of perfect graphs
  Report No. 89603: Hoang, C.T.
• Partial postorder
  Report No. 89604: Loebl, M.
• Disturbance decoupling and sat infinity of structured descriptor systems
  Report No. 89605: Murota, K.; van der Woude, J.W.
  
• Recognizing dart-free perfect graphs
  Report No. 89606: Chvatal, V. and L. Sun
• Excluding induced subgraphs: quadrilaterals
  Report No. 89607: Prömel, H.-J.
  in: Random Structures and Algorithms, 2 (1991), 55-71
• Preemtive scheduling of independent jobs with release times and deadlines on a hypercube
  Report No. 89608: Plehn, J.
  in: Information Processing Letters, 34 (1990), 161-166
• Graph coloring in linear time
  Report No. 89609: Tuza, Z.
• An optimal algorithm for finding a minimum clique covering of a circular-arc graph
  Report No. 89610: Asano, T.
• A decomposition of strongly unimodular matrices into incidence matrices of digraphs
  Report No. 89611: Crama, Y.; Loebl, M.; Poljak, S.
  
• A sparse Gallai-Witt theorem
  Report No. 89612: Prömel, H.-J.; Voigt, B.
  in: R. Bodendiek, R. Henn (Eds.): Topics in Combinatorics and Graph Theory : Essays in Honour of Gerhard Ringel, Heidelberg : Physica-Verl., 1990, 747-755
• From wgo to bgo via Ellentuck's theorem
  Report No. 89613: Prömel. H.-J.; Voigt, B.
  in: Discrete Mathematics, 108 (1992), 83-106
• A covering problem for finite Boolean lattices
  Report No. 89614: Voigt, B.; Wegener, I.
  
• Faces of submodular functions and related topics
  Report No. 89615: Pisaruk, N.N.
• Morphic liftings between pairs of integer polyhedra
  Report No. 89616: Araoz, J.; Johnson , E.L.
  
• Search in Horn's knowledge bases and the simplex algorithm
  Report No. 89617: Araoz, J.
• Conservative weightings and ear-decompositions of graphs
  Report No. 89618: Frank, A.
  in: R. Kannan, W.R. Pulleyblank (Eds.): Integer Programming and Combinatorial Optimization.
  Waterloo : Univ. of Waterloo Press, 1990, 217-230
• A generalized cut-condition for multiflows in matroids
  Report No. 89619: Schwärzler, W. and A. Sebő
  in: Discrete Mathematics, 113 (1993), 207-221
• Subadditivity ordered structures and integer programming
  Report No. 89620: Araoz, J.
• A tutorial on network flows and matchings
  Report No. 89621: Trick, M.A.

1990

Zurück zum Anfang / Back to start

• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 90622: Jahresbericht 1989
• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 90623: Annual Report 1989
• A faster algorithm for finding a maximum weight clique of a circular-arc graph
  Report No. 90624: Asano, T.
• Recognizing P3-structure
  Report No. 90625: Hayward, R.B.
• Applications of antilexicographic order II. How to sharpen the LYM inequality
  Report No. 90626: Erdös, P.L.; Frankl, P.; Kleitman, D.J.; Saks, M.E.; Szekely, A.
  
• On the reconstruction of combinatorial structures from line-graphs
  Report No. 89627: Erdös, P.L.
• Automatic mulit-chip module wiring
  Report No. 90628: Hars, L.
• Random search in the travelling salesman problem
  Report No. 90629: Hars, L.
• Optimal parallel algorithms for circular-arc graphs
  Report No. 90630: Asano, T.
• Enumeration of rooted forests
  Report No. 90631: Erdös, P.L
• Algorithms for minimum weighted colouring of perfectly ordered, comparability, triangulated, and clique separable graphs
  Report No. 90632: Hoang, C.T.
  
• Unprovable combinatorial statements
  Report No. 90633: Loebl, M.
• Augmenting graphs to meet edge-connectivity requirements
  Report No. 90634: Frank, A.
  in: SIAM Journal on Discrete Mathematics, 5 (1992), 25- 53
  preliminary version published in: Proceedings of the FOCS meeting held in October 1990
• Finding minimally weighted subgraphs
  Report No. 90635: Plehn, J.; Voigt, B.
  
• A path-following procedure to find a proper equilibrium of finite games
  Report No. 90636: Yamamoto, Y.
• Recognition and optimization algorithms for co-triangulated graphs
  Report No. 90637: Hoang, C.T.
• The complexity of recognizing weakly triangulated graphs that are perfectly orderable
  Report No. 90638: Hoang, C.T.
• Die Kleitman-Rothschild Methode
  Report No. 90639: Steger, A.
• Greedy algorithms on convex-ordered sets
  Report No. 90640: Kovalev, M.M.; Pisaruk, N.N.
  
• New properties of perfectly orderable graphs and strongly perfect graphs
  Report No. 90641: Hoang, C.T., F. Maffray; Preissmann, M.
  
• Excluding induced subgraphs II: extremal graphs
  Report No. 90642: Prömel, H.-J.; Steger, A.
  
• Finding the best separating hyperplane of two polytopes
  Report No. 90643: Yamamoto, Y.
• On the Sibling-structure of perfect graphs
  Report No. 90644: Hoang, C.T.
  in: Journal of Combinatorial Theory B, 49 (1990), 282- 286
• A parallel algorithm for minimum weighted colouring of triangulated graphs
  Report No. 90645: Hoang, C.T.
• Dealing with hard problems
  Report No. 90646: Chvatal, V.
• Polynomial uncrossing processes
  Report No. 90647: Karzanov, A.V.
• Postorder strategy for tree compressions
  Report No. 90648: Loebl, M.
• Small transversals in hypergraphs
  Report No. 90649: Chvatal, V.; McDiarmid, C.
  
• Excluding induced subgraphs III: a general asymptotic
  Report No. 90650: Prömel, H.-J.; Steger, A.
  in: Random Structures and Algorithms, 3 (1992), 19-31
• A circuit-based proof of Toda's theorem
  Report No. 90651: Kannan, R.; Venkateswaran, H.; Vinay, V.
  
• Finding clusters in VLSI circuits
  Report No. 90652: Garbers, J.; Prömel, H.J.; Steger, A.
  
• Which claw-free graphs are perfectly orderable?
  Report No. 90653: Chvatal, V.
• A computational study of the job-shop scheduling problem
  Report No. 90654: Applegate, D.; Cook, W.
  in: ORSA Journal on Computing, 3 (1991), 149-156
• The cut cone III: on the role of triangle facets
  Report No. 90655: Deza, M.; Laurent, M.; Poljak, S.
  in: Graphs and Combinatorics, 8 (1992), 125-142
• On the computational complexity of Seidel's switching
  Report No. 90656: Kratochvil, J.; Nesetril, J.; Zyka, O.
  in: J. Nesetril, M. Fiedler (Eds.): Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity, Prachatice 1990. Amsterdam, London, New York : North-Holland, 1992, 161-166. (Annals of Discrete Mathematics ; 51)
• Solution of the Frobenius problem and its generalization
  Report No. 90657: Kannan, R.
• Matroid optimization and algorithms
  Report No. 90658: Bixby, R.E.; Cunningham, W.H.
  in: R. Graham, M. Grötschel, L. Lovász (Eds.): Handbook of Combinatorics, Volume 1.
  Amsterdam, Lausanne, New York : Elsevier, 1995, 551-609
• Greedy compression systems
  Report No. 90659: Loebl, M.
• Submodular functions in graph theory
  Report No. 90660: Frank, A.
• Bouquets of matroids and F-squashed geometries
  Report No. 90661: Deza, M.; Laurent, M.; Pasini, A.
  
• Postorder compression systems (extended abstract)
  Report No.90662: Loebl, M.
• Efficient maximal cubic graph cuts (extended abstract)
  Report No. 90663: Loebl, M.
• Colouring and knot polynomials
  Report No. 90664: Welsh, D.J.A.
• A simple proof of the inequality FFD(L) for the FFD bin- packing algorithm
  Report No. 90665: Yue, M.-Y.
  in: Acta Mathematicae Applicatae Sinica, 7 (1991), 322- 331
• Counting bichromatic evolutionary trees
  Report No. 90666: Erdös, P.L.; Szekely, L.A.
  
• Sharpening the LYM inequality
  Report No. 90667: Erdös, P.L.; Frankl, P.; Kleitmann, P.J.; Saks, M.E.; Szekely, L.A.
  in: Combinatorica, 12 (1992), 287-293
• Extreme hypermetrics and L-polytopes
  Report No. 90668: Deza, M, V.P. Grishukin; Laurent, M.
  in: G. Halasz, L. Lovász, D. Miklos, T. Szönyi (Eds.): Sets, Graphs and Numbers : a Birthday Salute to Vera T. Sos and Andras Hajnal. Amsterdam, Oxford, New York : North-Holland, 1992, 157-209. (Colloquia Mathematica Societatis Janos Bolyai ; 60)
• Simple tournaments and sharply transitive groups
  Report No. 90669: Imrich, W.; Nesetril, J.
  
• Sets in R^d with no large empty convex subsets
  Report No. 90670: Valtr, P.
• The cut cone: simplicial faces and variety of realizations
  Report No. 90671: Deza, M.; Laurent, M.
  
• On a theorem of Mader
  Report No. 90672: Frank, A.
  in: Discrete Mathematics, 101 (1992), 49-57
• Resolvable tree designs
  Report No. 90673: Yue, M.-L.
  in: Journal of Combinatorial Theory A, 61 (1992), 302- 308
• Convex independent sets and 7-holes in restricted planar point sets
  Report No. 90674: Valtr, P.
• Being hamiltonian is not a Tutte invariant
  Report No.90675: Schwärzler, W.
• On multicommodity flows and set discrepancy
  Report No. 90676: Srivastav, A.; Stangier, P.
  
• The core of a graph
  Report No. 90677: Hell, P.; Nesetril, J.
  
• Packing paths and trees in global routing
  Report No. 90678: Srivastav, A.; Stangier, P.
  
• The complexity of knots
  Report No. 90679: Welsh, D.J.A.
  published as: D.J.A. Welsh: Complexity : Knots, Colourings and Counting. Cambridge Univ. Press, 1993. (London Mathematical Society Lecture Note Series ; 186)

1991

Zurück zum Anfang / Back to start

• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 91680: Jahresbericht 1990
• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 91681: Annual Report 1990
• Fast and slow growing (a combinatorial study of unprova bility)
  Report No. 91682: Loebl, M.; Nesetril, J.
  in: A.D. Keedwell (Ed.): Surveys in Combinatorics 1991. Cambridge, New York, Port Chester: Cambridge Univ. Press, 1991, 119-160. (London Mathematical Society Lecture Notes Series ; 166)
• On some of my favourite problems in various branches
  Report No. 91683: Erdös, P.
• On sparse subgraphs preserving connectivity properties
  Report No. 91684: Frank, A.; Ibaraki, T.; Nagamochi, H.
  
• Tutte polynomials computable in polynomial time
  Report No. 91685: Oxley, J.G.; Welsh, D.J.A.
  
• Bipartite subgraphs of triangle-free graphs
  Report No. 91686: Poljak, S.; Tuza, Z.
  
• Combinatorial properties and the complexity of a max-cut approximation
  Report No. 91687: Delorme, C.; Poljak, S.
  
• On the number of knots and links
  Report No. 91688: Welsh, D.J.A.
• Colouring clique-free graphs in linear expected time
  Report No. 91689: Prömel, H.-J.; Steger, A.
  
• Combinatorics in statistical physics
  Report No. 91690: Godsil, C.D.; Grötschel, M.; Welsh, D.J.A.
  in: R.L. Graham, M. Grötschel, L. Lovász (Eds.): Hand books of Combinatorics, Volume 2.
  Amsterdam, Lausanne, New York : Elsevier, 1995, 1925-1954
• Polyhedral eigenvalue approximation of the max-cut problem
  Report No. 91691: Poljak, S.
  in: G. Halasz, L. Lovász, D. Miklos, T. Szönyi (Eds.):Sets, Graphs and Numbers : a Birthday Salute to Vera T. Sos and Andras Hajnal. Amsterdam, Oxford, New York : North-Holland, 1992, 569-581. (Colloquia Mathematica Societatis Janos Bolyai ; 60)
• The computational complexity of Tutte invariants for classes of bipartite matroids
  Report No. 91692: Vertigan, D.L.; Welsh, D.J.A.
  
• Mathematics and art
  Report No. 91693: Nesetril, J.
• A note on induced matchings
  Report No. 91694: Steger, A.; Yue, M.L.
  
• Node-demands and greedy sets: a general look at multi flow problems
  Report No. 91695: Frank, A.; Karzanov, A.V.; Sebő, A.
  
• The computational complexity of knot and matroid poly nomials
  Report No. 91696: Welsh, D.J.A.
• On existence theorems
  Report No. 91697: Poljak, S.
• On Ramsey graphs without bipartite subgraphs
  Report No. 91698: Nesetril, J.; Rödl, V.
  
• A note on the strong chromatic index of a graph
  Report No. 91699: Steger, A.; Yue, M.L.
  
• Über die Existenz und das Finden von Subgraphen
  Report No. 91700: Plehn, J.
• On the gap between the structural controllability of time-varying and time-invariant systems
  Report No. 91701: Poljak, S.
  
• On stability of m-variate C1 interpolation
  Report No. 91702: Peters, J.; Sitharam, M.
  
• Some properties of minimal imperfect graphs
  Report No. 91703: Hoang, C.T.
• The total variation of the tensor product Bernstein-Bezier operator
  Report No. 91704: Cavaretta, A.S.; Sitharam, M.
  
• The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
  Report No.91705: Delorme, C.; Poljak, S.
  in: D. Bresson (Ed.): Proc. 4th Colloquium on Graphs and Combinatorics, Marseille 1990
• Isometric hypercube embedding of generalized bipartite metrics
  Report No. 91706: Deza, M.; Laurent, M.
  
• Characterizing minimum gossip graphs on 16 vertices
  Report No. 91707: Pietsch, C.; Labahn, R.
  
• Some minimum gossip graphs
  Report No. 91708: Labahn, R.
• Computing the degree of determinants via combinatorial relaxation
  Report No. 91709: Murota, K.
• The coefficient of the Tutte polynomial are not unimodular
  Report No. 91710: Schwärzler, W.
  in: Journal of Combinatorial Theory B, 58 (1993), 240- 242
• Minimal asymmetric graphs of induced length 4
  Report No. 91711: Nesetril, J.; Sabidussi, G.
  
• On ordered graphs and graph ordering
  Report No. 91712: Nesetril, J.
• How to calculate the number of perfect matchings in finite sections of certain infinite plain
  Report No. 91713: Sachs, H.
  
• Zeus, promises and perfection
  Report No. 91714: Hoang, C.T.; Kratochvil, J.;Welsh, D.J.A.
  
• Almost all Berge graphs are perfect
  Report No. 91715: Prömel, H.-J.; Steger, A.
  in: Combinatorics, Probability and Computing, 1 (1992), 53-79
• Linear sequences
  Report No. 91716: Klazar, M.; Valtr, P.
  
• On the ultimate independence ratio of a graph
  Report No. 91717: Hahn, G.; Hell, P.; Poljak, S.
  
• Knots, matroids and the Ising model
  Report No. 91718: Schwärzler, W.; Welsh, D.J.A.
  in: Math. Proc. Camb. Phil. Soc., 113, 107-139
• The strongly connected components of l-in, l-out
  Report No. 91719: McDiarmid, C.; Reed, B.A.
  
• Variety of hypercube embeddings of the equidistant metric and design
  Report No. 91720: Deza, M.; Laurent, M.
  
• Many counterexamples to a conjecture of Las Vergnas and Meyniel
  Report No. 91721: Reed, B.A.
• A survey on the known facets of the cut cone
  Report No. 91722: Deza, M.; Laurent, M.
  
• Kantendisjunkte Verdrahtungsprobleme im Chip-Design
  Report No. 91723: Hetzel, A.
• Paths, stars, and the number three
  Report No. 91724: Reed, B.A.
• An algebraic approach to the uniform concurrent multi commodity flow problem: theory and application
  Report No. 91725: Shahrokhi, F.; Szekely, L.A.
  
• Fourier calculus on finite sets and evolutionary trees
  Report No. 91726: Erdös, P.L.; Steel, M.A.; Szekely, L.A.
  
• On weighted multiway cuts
  Report No. 91727: Erdös, P.L.; Szekely, L.A.
  
• Finding approximate separators and computing tree width quickly
  Report No. 91728: Reed, B.A.
• Maximal cuts
  Report No. 91729: Loebl, M.
• Coin graphs, polyhedra, and conformal mapping
  Report No. 91730: Sachs, H.
• Remark on the Dimer problem
  Report No. 91731: Sachs, H.; Zernitz, H.
  
• Maximation over the intersection of two compatible greedy polyhedra
  Report No. 91732: Karzanov, A.V.
• The maximum size of 4-and 6-cycle free bipartite graphs on m, n vertices
  Report No. 91733: Caen, D. de; Szekely, L.A.
  in: G. Halasz, L. Lovász, D. Miklos, T. Szönyi (Eds.): Sets, Graphs and Numbers : a Birthday Salute to Vera T. Sos and Andras Hajnal. Amsterdam, Oxford, New York : North-Holland, 1992, 135-142. (Colloquia Mathematica Societatis Janos Bolyai ; 60)
• The asymptotic structure of h-free graphs
  Report No. 91734: Prömel, H.-J.; Steger, A.
  
• Solving the max-cut problem using eigenvalues
  Report No. 91735: Poljak, S.; Rendl, F.
  in: Proc. Workshop on Optimal Partitioning of Combinatorial Structures, Rome 1991 (Annals of Operations Research)
• Extension operations for cuts
  Report No. 91736: Deza, M.; Laurent, M.
  in: Discrete Mathematics, 106-107 (1992), 163-179
• Graphic vertices of the metric polytope
  Report No. 91737: Laurent, M.
  in: Proc. Graph Theory and Combinatorics, Manila, 1991
• Some new classes of facets for the equicut polytope
  Report No. 91738: DeSouza, C.C.; Laurent, M.
  in: Proc. Int. Workshop on Optimal Partitioning of Combinatorial Structures, Rome 1991 (Annals of Operations Research)
• On derandomized approximation algorithms
  Report No. 91739: Srivastav, A.; Stangier, P.
  

1992

Zurück zum Anfang / Back to start

• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 92740: Jahresbericht 1991
• Forschungsinstitut für Diskrete Mathematik - Institut für Operations Research, Universität Bonn
  Report No. 92741: Annual Report 1991
• The metric polytope
  Report No. 92742: Laurent, M.; Poljak, S.
  in: E. Balas, G. Cornuejols, R. Kannan (Eds.): Integer Programming and Combinatorial Optimization. Proceedings of a Conference held at Carnegie Mellon University, 1992. Pittsburg: Carnegie Mellon Univ., 1992, 274- 286
• l(1)-rigid graphs
  Report No. 92743: Deza, M.; Laurent, M.
  
• Uniform concurrent multicommodity flow in product graphs
  Report No. 92744: Shahrokhi, F.; Szekely, L.A.
  
• Effective lower bounds for crossing number, bisection width and balanced vertex separator in terms of symmetry
  Report No. 92745: Shahrokhi, F.; Szekely, L.A.
  in: E. Balas, G. Cornuejols, R. Kannan (Eds.): Integer Programming and Combinatorial Optimization. Proceedings of a Conference held at Carnegie Mellon University, 1992. Pittsburg: Carnegie Mellon Univ., 1992, 102- 113
• On edge perfectness and classes of bipartite graphs
  Report No. 92746: Müller, H.
• The relation between fractional and integral graph partitioning
  Report No. 92747: Srivastav, A.; Stangier, P.
  
• Excluding minors in cubic graphs
  Report No. 92748: Kilakos, K.; Shepherd, B.
  
• Algorithms and min-max theorems for certain multiway cuts
  Report No. 92749: Erdös, P.L.; Szekely, L.A.
  in: E. Balas, G. Cornuejols, R. Kannan (Eds.): Integer Programming and Combinatorial Optimization. Proceedings of a Conference held at Carnegie Mellon University, 1992. Pittsburg: Carnegie Mellon Univ., 1992, 334-345
• Eulerian trails through a set of terminals in specific, unique and all orders
  Report No. 92750: Bang-Jensen, J.; Poljak, S.
  
• Hypermetric graphs
  Report No. 92751: Deza, M.; Grishukhin, V.P.
  
• Eigenvalues in combinatorial optimization
  Report No. 92752: Mohar, B.; Poljak, S.
  published under the title: Eigenvalue methods in combinatorial optimization, in: R. Brualdi, S. Friedland, V. Klee (Eds.): Combinatorial and Graph-Theory Problems in Linear Algebra. Berlin, Heidelberg, New York : Springer, 1992. (IMA Volumes in Mathematics and its Applications ; 50)
• Strongly perfect infinite graphs
  Report No. 92753: Aharoni, R.; Loebl, M.
  
• Tree-representation of directed circuits
  Report No. 92754: Frank, A.; Jordan, T.
  in: N. Robertson and P.D. Seymour (Eds.): Graph Structure Theory. Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, 1991.Providence : American Mathematical Society, 1993, 195-202. (Contemporary Mathematics ; 147)
• Complexity of circuit intersection in graphs
  Report No. 92755: Fraenkel, A.S.; Loebl, M.
  
• Spectral analysis and a closest tree method for genetic sequences
  Report No. 92756: Erdös, P.L.; Hendy, M.D.; Steel, M.A.; Szekely, L.A.
  in: Applied Mathematics Letters, 5 (1992), 63-67
• The expected relative error of the polyhedral approximation of the max-cut problem
  Report No. 92757: Poljak, S.; Tuza, Z.
  
• Checking robust nonsingularity is NP-hard
  Report No. 92758: Poljak, S.; Rohn, J.
  
• On packing T-cuts
  Report No. 92759: Frank, A.; Szigeti, Z.
  in: Journal of Combinatorial Theory, Series B., 61 (1994), 263-271
• Signierte Polynome und Mehrgüterflüsse auf Matroiden
  Report No. 92760: Schwärzler, W.
• The combinatorics of evolutionary trees - a survey
  Report No. 92761: Erdös, P.L.; Steel, M.A.; Szekely, L.A.
  in: D. Foata (Ed.): Actes du Séminaire Lotharingien de Combinatoire, 28-ième Session, 1992, 129-143. (Publ. Inst. Rech. Math. Avancée)
• Non-interfering network flows
  Report No. 92762: McDiarmid, C.; Reed, B.A.; Schrijver, A.; Shepherd, F.B.
  in: Algorithm Theory - SWAT '92. Berlin, Heidelberg, New York : Springer, 1992, 245-257. (Lecture Notes in Computer Science)
• Finding disjount trees in planar graphs in linear time
  Report No. 92763: Reed, B.A.; Robertson, N.; Schrijver, A.; Seymour, P.D.
  
• When is the assignment bound tight for the asymmetric traveling salesman problem?
  Report No. 92764: Frieze, A.; Karp, R.M.; Reed, B.A.
  
• Tree decompositions in planar graphs
  Report No. 92765: Bodlaender, H., T. Klocks; Reed, B.A.
  
• Almost every graph can be covered by ceiling (delta/2) linear forests
  Report No. 92766: McDiarmid, C.; Reed, B.A.
  
• Rooted routing
  Report No. 92767: Reed, B.A.
• Faster algorithms for k-disjoint paths
  Report No. 92768: Reed, B.A.
• Mick gets some
  Report No. 92769: Chvatal, V.; Reed, B.A.
  
• On splitable sets
  Report No. 92770: Pulleyblank, W.R.; Reed, B.A.; Shepherd, F.B.
  in: J.W. Kennedy, V. Quintas (Eds.): Graph Theory Notes of New York XXIII. New York : Academy of Sciences, 1992, 11-20
• An extremal function for the achromatic number
  Report No. 92771: Bollobas, B.; Reed, B.A.; Thomason, A.
  
• The clique-rank of diamond-free perfect graphs
  Report No. 92772: Fonlupt, J.
• Weighted fractional and integral k-matchings min hyper graphs
  Report No. 92773: Srivastav, A.; Stangier, P.
  
• Kernels of minimum size gossip schemes I
  Report No. 92774: Labahn, R.
• A note on clutter partitions
  Report No. 92775: Shepherd, F.B.
• On the clique-rank and the coloration of perfect graphs
  Report No. 92776: Fonlupt, J.; Sebő, A.
  
• Disjunkte Wege in gerichteten Graphen
  Report No. 92777: Vygen. J. (Diplomarbeit)
  
• Recognizing dart-free perfect graphs
  Report No. 92778: Chvatal, V.; Fonlupt, J.; Sun, L; Zemirline, A.
  
• The crossing number of a graph on a compact 2-manifold
  Report No. 92779: Shahrokhi. F.; Sykora, O.; Szekely, L.A.; Vrto, I.
  
• Ein Menüsystem zur Spezifikation elektrotechnischer Schaltungen
  Report No. 92780: Zimmer, C.
• Integral multicommodity flows with reduced demands
  Report No. 92781: Srivastav, A., Stangier, P.
  
• The relationship between integral and fractional graph partitioning
  Report No. 92782: Srivastav, A.; Stangier, P.
  
• On multiflow problems
  Report No. 92783: Frank, A.; Karzanov, A.V.; Sebő, A.
  
• Preserving and increasing local edge-connectivity in mixed graphs
  Report No. 92784: Bang-Jensen, J.; Frank, A.; Jackson, B.
  in: SIAM Journal on Discrete Mathematics, 8 (1995), 155-178
• Kernels of minimum size gossip schemes II
  Report No. 92785: Labahn, R.
• On the Steiner ratio conjecture (1)
  Report No. 92786: Yue, M.-Y (Manuskript)

1993

Zurück zum Anfang / Back to start

• Report No. WP 93787: not published
• Report No. WP 93788: not published
• Circuit packings on surfaces with at most three cross-caps
  Report No. 93789: Sebő, A.
  published under the title: Cycle packings on surfaces without most three cross caps, in: E. Balas, G. Cornuejols, R. Kannan (Eds.): Integer Programming and Combinatorial Optimization. Proceedings of a Conference held at Carnegie Mellon University, 1992. Pittsburg : Carnegie Mellon Univ., 1992
• Halving graphs is NP-complete
  Report No. 93790: Triesch, E.
• Extremal uniquely hamiltonian graphs
  Report No. 93791: Hougardy, S.; Hundack, C.
  
• Das Sparelogik-Problem
  Report No. 93792: Schietke, J. (Diplomarbeit)
  
• On the geodesic-structure of graphs: a polyhedral approach to metric decomposition
  Report No. 93793: Lomonosov, M.; Sebő, A.
  published under the title: On the geodesics of graphs, in: E. Balas, G. Cornuejols, R. Kannan (Eds.): Integer Programming and Combinatorial Optimization. Proceedings of a Conference held at Carnegie Mellon University, 1992. Pittsburg : Carnegie Mellon Univ., 1992, 102-113
• Random I-colorable graphs
  Report No. 93794: Prömel, J.-J.; Steger, A.
  in: Random Structures and Algorithms, 6 (1995), 21-37
• Even pairs and the strong perfect-graph conjecture
  Report No. 93795: Hougardy, S.
  in: Discrete Mathematics, 153 (1996)
• Formulations for the stable set polytope of a claw-free graph
  Report No. 93796: Pulleyblank, W. R.; Shepherd, F.B. (extended abstract)
  in: G. Rinaldi, L.A. Wolsey (Eds.): Integer Programming and Combinatorial Optimization, Proceedings of a Conference, Erice, Italy 1993. Louvain-la-Neuve : Core, 1993
• Realizability and uniqueness in graphs
  Report No. 93797: Aigner, M.; Triesch, E.
  in: Discrete Mathematics, 136 (1994), 3-20
• Does the Jones polynomial detect unknottedness?
  Report No. 93798: Dasbach, O.; Hougardy, S.
  in: Experimental Mathematics 6, (1997), 51-56
• The connectivity of minimal imperfect graphs
  Report No. 93799: Sebő, A.
• Lectures on extremal set systems and two-colorings of hypergraphs
  Report No. 93800: Karoly, G.
• Irregularities of point distributions relative to homothetic convexe bodies I
  Report No. 93801: Karoly, G.
• Increasing the vertex-connectivity in directed graphs
  Report No. 93802: Jordan, T.
  in: T. Lengauer (Hrsg.): Algorithms - ESA'93. 1993, 236- 247. (Lecture Notes in Computer Science ; 726)
• On Seymour graphs
  Report No. 93803: Szigeti, Z.
• Probabilistische Argumente und algorithmische Probleme in der Diskreten Mathematik
  Report No. 93804: Prömel, H.-J.
  in: Chatterji, S.D., Fuchssteiner, B. Kulisch, U. and R. Liedl (Hrsg.): Jahrbuch Überblick Mathematik 1994. Braunschweig, Wiesbaden : Vieweg, 1994, 28-46
• NP-completeness of some edge-disjoint path problems
  Report No. 93805: Vygen, J.
  in: Discrete Applied Mathematics, 61 (1995), 83-90
• Applications of submodular functions
  Report No. 93806: Frank, A.
  in: K. Walker (Hrsg.): Surveys in Combinatorics. 14th British Combinatorial Conference, 1993.
  Cambridge : Univ. Press, 1993, 85-136. (London Mathematical Society Lecture Notes Series ; 187)
• Minimal edge-coverings of pairs of sets
  Report No. 93807: Frank, A.; Jordan, T.
  in: Journal of Combinatorial Theory, 65 (1995), 73-110
• Counting h-free graphs
  Report No. 93808: Prömel, H.-J.; Steger, A.
  in: Discrete Mathematics 154, (1996), 311-315
• A minimax theorem and a Dulmage-Mendelsohn type de composition for a class of generic partition matrices
  Report No. 93809: Iwata, S.; Murota , K.
  in: SIAM Journal on Matrix Analysis and Applications, 16 (1995), 719-734
• A theorem on the principal structure for independent matchings
  Report No. 93810: Iwata, S.; Murota , K.
  in: Discrete Applied Mathematics, 61 ( 1995), 229-244
• Even and odd pairs in linegraphs of bipartite graphs
  Report No. 93811: Hougardy, S.
  in: European Journal of Combinatorics, 16 (1995), 17-21
• On point covers of multiple intervals and axis-parallel rec tangles
  Report No. 93812: Karoly, G.
• Signed ring families and signed posets
  Report No. 93813: Ando, K.; Fujishige, S.
in: Optimization Methods and Software 36/2-3 (2021), 262-278
• Graph invariants and alternating knot projections
  Report No. 93814: Dasbach, O.T.; Hougardy, S.
  

1994

Zurück zum Anfang / Back to start

• Report No. WP 94815: not published
• Disjoint paths
  Report No. 94816: Vygen, J.
• Coverings of multimatroids by independent sets
  Report No. 94817: Bouchet, A.
  in: SIAM Journal on Discrete Mathematics 10, (1997), 626-646
• A min-max theorem for bisubmodular polyhedra
  Report No. 94818: Fujishige, S.
  in: SIAM Journal on Discrete Mathematics 10, (1997), 294-308
• Delta-Matroids, jump systems and delta-submodular poly hedra
  Report No. 94819: Bouchet, A.; Cunningham, W.H.
  in: SIAM Journal on Discrete Mathematics, 8 (1995), 17-32
• Decomposition of a signed graph into strongly connected components and its signed poset structures
  Report No. 94820: Fujishige, S.; Ando, K.; Nemeto, T.
  in: Discrete Applied Mathematics, 68 (1996), 237 - 248
• On structures of bisubmodular polyhedra
  Report No. 94821: Ando, K.; Fujishige, S.
  in: Mathematical Programming,  74 (1996), 293-317
• On the p4-structure of perfect graphs v. overlap graphs
  Report No. 94822: Hoang, C.T.; Hougardy, S.; Maffray, F.
  in: Journal of Combinatorial Theory Series B, 67 (1996), 212-237
• The box convolution and the Dilworth truncation of bisubmodular functions
  Report:No. 94823: Fujishige, S.; Patkar, S.B.
  
• Orthogonal a-trails of 4-regular graphs embedded in medial graphs in surfaces of low genus
  Report No. 94824: Andersen, L.D.; Bouchet, A.; Jackson, B.
  in: Journal of Combinatorial Theory 66, (1996), 232-246
• On the membership problem over polymatroid intersection
  Report No. 94825: Narayanan, H.; Patkar, S.B.; Subrahmanyam, K.V.
  
• Abstract and generic rigidity in the plane
  Report No. 94826: Patkar, S.B.; Servatius, B.; Subrahmanyam, K.V.
  in: Journal of Combinatorial Theory. Series B, 62 (1994), 107-113
• Approximation algorithms for min-k-overlap problems using the principal lattice of partitions approach
  Report No. 94827: Narayanan, H.; Patkar, S.B.; Roy, S.
  in: Journal of Algorithms, 21 (1996), 306-330
• The minimum-weight ideal problem for signed posets
  Report No. 94828: Ando, K.; Fujishige, S.; Nemeto, T.
  in: Journal of the Operations Research Society of Japan 39, (1996), 558-565
• An efficient cost scaling algorithm for the independent as signment problem
  Report No. 94829: Fujishige, S.; Zhang, X.
  in: Journal of the Operations Research Society of Japan, 38 (1995), 124-136
• The orthant non-interaction theorem for certain combinatorial polyhedra and its implications in the intersection and the Dilworth truncation of bisubmodular functions
  Report No. 94830: Fujishige, S.; Patkar, S.B.
  in: Optimization, 34 (1995), 329-339
• A conjecture of Kauffman on ampicheiral alternating knots
  Report No. 94831: Dasbach, O.T.; Hougardy, S.
  in: Journal of Knot Theory and its Ramifications, (1996)
• On the recognition complexity of some graph properties
  Report No. 94832: Triesch, E.
• A group testing problem for hypergraphs of bounded rank
  Report No. 94833: Triesch, E.
  in: Discrete Applied Mathematics, 66 (1996), 185-188
• Finding optimal minors of valuated bimatroids
  Report No. 94834: Murota, K.
  in: Applied Mathematics Letters, 8 (1995), 37-41
• Fast algorithm for principal partition of a graph
  Report No. 94835: Narayanan, H.; Patkar, S.B.
  in: Foundations of Software Technology and Theoretical Computer Science 560, (1991), 288-306
• A greedy algorithm for minimizing a separable convex function over a finite jump systems
  Report No. 94836: Ando, K.; Fujishige, S.; Naitoh, T.
  in: Journal of the Operations Research Society of Japan, 38 (1995), 362-375

1995

Zurück zum Anfang / Back to start

• Valuated matroids intersection. I. Optimality criteria
  Report No. 95837: Murota, K.
  in: SIAM Journal on Discrete Mathematics, 9 (1996), 545-561
• Valuated matroids intersection. II. Algorithms
  Report No. 95838: Murota, K.
  in: SIAM Journal on Discrete Mathematics, 9 (1996), 562-576
• Fenchel-type duality for matroid valuations
  Report No. 95839: Murota, K.
  in: Mathematical Programming: Series A&B Vol. 82,3 (1998), 357-375
• An approximation algorithm for 3-colourability
  Report No. 95840: Schiermeyer, I. (extended abstract)
  
• On exchange axioms for valuated matroids and valuated delta-matroids
  Report No. 95841: Murota, K.
  in: Combinatorica, 16 (1996), 591-596
• Matroid valuation on independent sets
  Report No. 95842: Murota, K.
  in: Journal of Combinatorial Theory: Series B Vol. 69,1 (1997), 59-78
• Submodular flows problem with a nonseparable cost function
  Report No. 95843: Murota, K.
  in: SIAM Journal on Optimization
  in: Combinatorica, 19 (1999), 87-109
• Mathematical mechanism underlying echelon-mode and shear-band formations: bifurcation hierarchy of 0(2) x 0(2)- equivariant systems
  Report No. 95844: Ikeda, K.; Murota, K.
• The delta-sum of matching delta-matroids
  Report No. 95845: Bouchet, A.; Schwärzler, W.
  in: Discrete Mathematics, 181 (1998), 53-63
• Two algorithms for valuated delta-matroids
  Report No. 95846: Murota, K.
  in: Applied Mathematics Letters, 9 no.3 (1996), 67-71
• The length and width of combinatorial optimization problems
  Report No. 95847: Hu, T.C.
• Convexity and Steinitz's exchange property
  Report No. 95848: Murota, K.
  in: Lecture Notes in Computer Science Vol. 1084(1996), 260-274
  in: Advances in Mathematics, 124 (1996), 272-311
• Characterizing valuated delta-matroids as a family of delta-matroids
  Report No. 95849: Murota, K.
  in: SIAM Journal of Discrete Mathematics Vol. 9 (1996), 562-576
• Optimum alphabetic binary trees
  Report No. 95850: Hu, T.C.
  in: Lecture Notes in Computer Science Vol. 1120(1996), 234-243
• Verdrahtung im VLSI-Design
  Report No. 95851: Hetzel, A. (Dissertation)
• Using the generalized assignment problem in scheduling the ROSAT space telescope
  Report No. 95852: Nowakovski, J.; Schwärzler, W.; Triesch, E.
  in: European Journal of Operations Research Vol. 112,3 (1996), 531-541

1996

Zurück zum Anfang / Back to start

• A resilience strategy for a single source-destination pair
  Report No. 96853: Brightwell, G.; Shepherd, B.
  in: CDAM Research Report CDAM-96-22
• Platzierung im VLSI-Design und ein zweidimensionales Zerlegungsproblem
  Report No. 96854: Vygen, Jens (Dissertation)

1997

Zurück zum Anfang / Back to start

• Vojtech Jarnik's work in combinatorial optimization
  Report No. 97855: Korte, Bernhard ; Nesetril, Jaroslav
  in: Diskr. Math. 235, (2001), 1-17
• Conjectures on the uniqueness of Hamiltonian cycles and the number of perfect matchings
  Report No. 97856: Triesch, Eberhard
• Elusive graph properties
  Report No. 97857: Triesch, Eberhard
  in: SIAM Journal on Computing 23, (1994), 247-254
• Improved results for competitive group testing
  Report No. 97860: Schlaghoff, Jens ; Triesch, Eberhard
• Parallele Heuristiken für sehr große Traveling Salesman Probleme
  Report No. 97859: Rohe, André (Diplomarbeit)
• Perfect matchings in balanced hypergraph - a combinatorical approach
  Report No. 97860: Huck, Andreas; Triesch, Eberhard
  in: Combinatorica 22, (2002), 409-416
• K-independence and the k-residue of a graph
  Report No. 97861: Jelen, Frank
  in: Journal on Graph Teory 32, (1999), 241-249
• The residue of a graph in comparison with other lower bounds on the independence number
  Report No. 97862 : Jelen, Frank
• Computing minimum-weight perfect matchings
  Report No.: 97863 : Cook, William ; Rohe, André
  in: INFORMS Journal on Computing 11 (1999), 138-148
• Reducible configurations for the cycle-double-cover-conjecture
  Report No. 97864 : Huck, Andreas
  in: Discrete Applied Mathematics 99, (2000), 71-90

1998

Zurück zum Anfang / Back to start

• Perfect matchings versus odd cuts
  Report No. 98865 : Szigeti, Zoltan
  in: Combinatorica 22, (2002), 575-589
• On the bipartite travelling salesman problem
  Report No. 98866 : Frank, Andras ; Triesch, Eberhard ; Korte, Bernhard ; Vygen, Jens
• On maximum lengths of Davenport-Schinzel sequences
  Report No. 98867 : Klazar, Martin
  in: Contemporary Trends in Discrete Mathematics AMS (1999), 169-173
• Efficient implementation of the Goldberg-Tarjan minimum-cost flow algorithm
  Report No. 98868 : Bünnagel, Ursula ; Korte, Bernhard ; Vygen, Jens
  in: Optimization Methods and Software 10, (1998), 157-174
• Counting pattern-free set partitions I
  Report No. 98869 : Klazar, Martin
  in: European Journal of Combinatorics 21 (2000), 367-378
• On the graphic matroid parity problem
  Report No. 98870 : Szigeti, Zoltan
  in: Journal of Combinatorial Theory 88, (2003), 247-260
• Edge-disjoint paths in series-parallel graphs
  Report No. 98871 : Vygen, Jens
  in: T. Nishizeki, J. Vygen, X. Zhou, The Edge-Disjoint Paths Problem is NP-complete for Series-Parallel Graphs. Discrete Applied Mathematics 115, (2001), 177-186
• Square grids with long "diagonals"
  Report No. 98872 : Gaspar, Zsolt ; Radics, Norbert ; Recski, Andras
  in: Optimization Methods and Software 10, (1998), 217-231
• On the solution of traveling salesman problems
  Report No. 98873 : Applegate, David ; Bixby, Robert ; Cook, William
  in: Documenta Mathematika (1998), 645-656
• Almost perfect matrices and graphs
  Report No. 98874 : Padberg, Manfred
  in: Mathematics in Operations Research 96, (2001), 1-18
• Approximating separable nonlinear functions via mixed zero-one programs
  Report No. 98875 : Padberg, Manfred
  in: Operations Research Letters 27, (2000), 1-5
• On generalizations of matching-covered graphs
  Report No. 98876 : Szigeti, Zoltan
  in: European Journal of Combinatorics, 22 (2001), 865-877

1999

Zurück zum Anfang / Back to start

• Rigidity of square grids with holes
  Report No. 99877 : Gaspar, Zolt ; Radics, Norbert ; Recski, Andras
  in: Computer Assisted Mechanics and Engineering Sciences 6, (1999), 329-335
• A linear representation of the ear-matroid
  Report No. 99878 : Szegedy, Christian
• The clique-rank of 3-chromatic perfect graphs
  Report No. 99879 : Fonlupt, Jean
  in: Proceedings of the workshop in honor of Manfred Padberg (2001)and in The sharpest cut: the impact of Manfred Padberg and his work, (2004), 39-49
• Timing Optimierung beim physikalischen Layout von nicht-hierarchischen Designs
  Report No. 99880 : Schietke, Jürgen (Dissertation)
• Cycle time and slack optimization for VLSI-Chips
  Report No. 99881 : Albrecht, Christoph; Korte, Bernhard; Schietke, Jürgen; Vygen, Jens
  in: International Conference on Computer Aided Design, (1999), 232-238
  
• Some polynomially solvable subcases of the detailed routing problem in VLSI design
  Report No. 99882 : Recski, Andras
  in: Discrete Applied Mathematics 115 (2001), 199-208
• Inkrementelles Reengineering von Software-Systemen unter Verwendung von Verfahren der diskreten Optimierung am Beispiel eines CAE-Systems
  Report No. 99883 : Seelmann-Eggebert, Jörg (Dissertation)
• An orientation theorem with parity conditions
  Report No. 99884 : Frank, András; Jordan, Tibor; Szigeti, Zoltan
  in: Integer Programming and Combinatorial Optimization (1999), 183-190, Lecture Notes in Computer Science 1610, (1999) and in Discrete Applied Mathematics 115, (2001), 37-47
  in: Discrete Applied Mathematics 115, (2001), 37-47
• Finding tours in the TSP
  Report No. 99885 : Applegate, David; Bixby, Robert; Chvatal, Vasek; Cook, William
• Analyzing the structure of large graphs
  Report No. 99886 : Kannan, Ravi; Vinay, V.
• Chained Lin-Kernighan for large traveling salesman problems
  Report No. 99887 : Applegate, David; Cook, William; Rohe, André
  in: INFORMS Journal on Computing 15 (2003), 82-92
• On the matrix-cut rank of polyhedra
  Report No. 99888 : Cook, William; Dash, Sanjeeb
  in: Mathematics of Operations Research 26, (2001), 19-30
• On dual minimum cost flow algorithms
  Report No. 99889 : Vygen, Jens
  in: Annual ACM Symposium on Theory of Computing, (2000), 117-125 (extended abstract) and in: Mathematical Methods of Operations Research (2001), 101-126
• L1-Steinerbaumprobleme. Exakte und approximative Algorithmen und polynomiell lösbare Spezialfälle
  Report No. 99890 : Hauptmann, Mathias (Diplomarbeit)

2000

Zurück zum Anfang / Back to start

• Embeddability of the combinohedron
  Report No. 00891 : Ramírez Alfonsín, J.L.; Romero, Dav
  in: Discrete Mathematics 254 (2002), 473-483
• A catalog of Hanan grid problems
  Report No. 00892 : Zachariasen, M.
  in: Networks 38, (2001), 76-83
• The Diophantine Frobenius problem
  Report No. 00893 : Ramírez Alfonsín, J.L.
• Das Multicommodity-Flow-Problem und seine Anwendung im Global Routing
  Report No. 00894 : Werber, Jürgen (Diplomarbeit)
• Restricted h-matchings in bipartite graphs
  Report No. 00895 : Frank, András
• The Euclidean-bipartite TSP: NP-completeness and solvable cases
  Report No. 00896 . Ramírez Alfonsín, Jorge L.; Romero, David; Sánchez-Flores, Adolfo
• On linked spatial representations
  Report No. 00897 : Ramírez Alfonsín, Jorge L.
  in: Journal of Knot Theory and its Ramifications 10 (2001), 143-150
• Platzierung im VLSI Design
  Report No. 00898 : Brenner, Ulrich (Diplomarbeit)
• Elmore-Delay optimale Steinerbäume im VLSI-Design
  Report No. 00899 : Peyer, Sven (Diplomarbeit)
• Four-way partitioning of two-dimensional sets
  Report No. 00900 : Vygen, Jens
  published under the title: Geometric quadrisection in linear time, with application to VLSI placement
  in: Discrete Optimization 2, (2005), 362-390
• Gate-Sizing im VLSI-Design
  Report No. 00901 : Langkau, Katharina (Diplomarbeit)
• Disconnected coverings for oriented matroids via simultanious mutations
  Report No. 00902: Forge, D. ; Ramírez Alfonsín, J.L. ; Yeun, H.
  in: Discrete Mathematics 258, (2003), 353-359
• Bisubmodular function minimization
  Report No. 00903 : Fujishige, Satoru; Iwata, Satoru
  in: Lecture Notes in Computer Science 2081, (2001) 160-169
  in:  (2001), 160-169
• Worst-case ratios of networks in the rectlinear plane
  Report No. 00904 : Brenner, Ulrich; Vygen, Jens
  in: Networks 38 (2001), 126-139
• Edge-connection of graphs, digraphs and hypergraphs
  Report No. 00905: Frank, András
  in: More sets, graphs and numbers, (2006), 93-141
• Rectilinear group steiner trees and applications in VLSI design
  Report No. 00906: Zachariasen, Martin ; Rohe, André
  in: Mathematical Programming 94,(2003), 407-433

2001

Zurück zum Anfang / Back to start

• Spatial representations: the figure-eight and T(5,2)
  Report No. 01907: Ramírez Alfonsín, J.L.
  in: Journal of Knot Theory and its Ramifications 10, (2001), 143 - 150
• Zwei kombinatorische Optimierungsprobleme im VLSI-Design: Optimierung der Zykluszeit und der Slackverteilung und globale Verdrahtung
  Report No. 01908: Albrecht, Christoph (Dissertation)
• Routingprobleme bei der Schaltplanerstellung
  Report No. 01909: Trapp, Tobias (Diplomarbeit)
• Das Inverterbaum-Problem im VLSI-Design
  Report No. 01910: Klick, Iris (Diplomarbeit)
• Solution of a min-max vehicle routing problem
  Report No. 01911: Applegate, David ; Cook, William ; Dash, Sanjeeb ; Rohe, André
  in: INFORMS Journal on Computing Vol. 14 (2002), 132-143
• Theory of VLSI layout
  Report No. 01912: Vygen, Jens (Habilitationsschrift)
• Delay-Related secondary objectives for rectilinear Steiner minimum trees
  Report No. 01913: Peyer, Sven ; Zachariasen, Martin ; Jørgensen, David Grove
  in: Discrete Applied Mathematics Vol. 136 (2004), 271-298

2002

Zurück zum Anfang / Back to start

• Sequential and parallel algorithms for local routing
  Report No. 02914: Rohe, André (Dissertation)
• Algorithmen für Potential-Balancierungs-Probleme und Anwendungen im VLSI-Design
  Report No : 02915 : Held, Stephan (Diplomarbeit aus dem Jahr 2001)
  
• An effective Congestion-driven Placement Framework.
  Report No. 02916: Brenner, Ulrich ; Rohe, André
  in: International Symposium on Physical Design (2002), 6-11; and in: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 22, (2003), 387-394
• A note on Schrijver's submodular function minimization algorithm
  Report No. 02917: Vygen, Jens
  in: Journal on Combinatorial Theory Series B 88, (2003), 399-402
• Schnelle Pfadsuche im Global Routing
  Report No. 02918: Köhler, Karl (Diplomarbeit)
• Integrierte Placement- und Timing-Optimierung beim physikalischen Layout von nicht-hierarchischen Designs hochintegrierter Logikchips
  Report No. 02919: Schülter, Dieta (Dissertation)
• New theoretical results on quadratic placement
  Report No. 02920: Vygen, Jens
  in: Integration, the VLSI Journal 40, (2007), 305-314
• Clocktreedesign mit optimalen Ankunftszeitintervallen
  Report No. 02921: Maßberg, Jens (Diplomarbeit)
• Bestimmung der Verdrahtungskapazitäten im Global Routing
  Report No. 02922: Müller, Dirk (Diplomarbeit)
• A tutorial on VLSI placement.
  Report No. 02923: Vygen, Jens

2003

Zurück zum Anfang / Back to start

• Approximation of rectilinear steiner trees with length restrictions on obstacles
  Report No. 03924: Müller-Hannemann, Matthias ; Peyer, Sven
  in: Workshop on Algorithms and Data Structures (WADS), (2003), 207-218
• Legalizing a placement with minimum total movement
  Report No: 03925: Brenner, Ulrich ; Vygen, Jens
  in: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 23 (2004), 1597-1613
• Slack optimization of timing-critical nets
  Report No : 03926: Müller-Hannemann, Matthias ; Zimmermann, Ute
  in: Annual European Symposium on Algorithms (ESA), (2003), 727-739
• Slack in static timing analysis
  Report No : 03927: Vygen, Jens
  in: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25 (2006), 1876-1885
• Clock scheduling and clocktree construction for high performance ASICs
  Report No : 03928: Held, Stephan ; Korte, Bernhard ; Ringe, Matthias ; Vygen, Jens
  in: Proceedings of the IEEE International Conference on Computer Aided Design (2003), 232-239
  
• An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
  Report No : 03929: Asano, Takao
  in: Theoretical Computer Science 354, (2006), 339-353
• Chromatic characterization of biclique cover
  Report No : 03930: Cornaz, Denis ; Fonlupt, Jean
  in: Discrete Mathematics 306, (2006), 495-507
• Asymptotically optimal Boolean circuits for functions of the form gn-1(gn-2(...g3(g2(g1(x1,x2),x3),x4)...,xn-1),xn)
  Report No: 03931: Rautenbach, Dieter ; Szegedy, Christian ; Werber, Jürgen
• Delay optimization of linear depth Boolean circuits with prescribed input arrival times
  Report No : 03932: Rautenbach, Dieter ; Szegedy, Christian ; Werber, Jürgen
  in: Journal of Discrete Algorithms 4, (2006), 526-537
• Fast circuits for functions whose inputs have specified arrival times
  Report No : 03933: Rautenbach, Dieter ; Szegedy, Christian ; Werber, Jürgen
• Bewegungsminimale Legalisierung von Platzierungen im VLSI-Design
  Report No : 03934: Pauli, Anna (Diplomarbeit)
• Near-optimum global routing with coupling delay bounds, and power consumption
  Report No : 03935 : Vygen, Jens
  in: Integer Programming and Combinatorial Optimization; Proceedings of the 10th International IPCO Conference; LNCS 3064, (2004), 308-324

2004

Zurück zum Anfang / Back to start

• Algorithmen, Implementation und Vergleich von Verfahren zur Konstruktion von Inverterbäumen im VLSI-Design
  Report No : 04936 : Zimmermann, Ute (Diplomarbeit)
• Simultaneous large cuts
  Report No : 04937 : Rautenbach, Dieter ; Szigeti, Zoltán
• On parity families
  Report No : 04938 : Szigeti, Zoltán
  in: Discrete Mathematics 308 (2008), 6527-6532
• A class of problems for which cyclic relaxation converges linearly
  Report No : 04939 : Rautenbach, Dieter ; Szegedy, Christian
  in: Computational Optimization and Applications 41 (2008), 53-60
• A subgradient method using alternating projections
  Report No : 04940 : Rautenbach, Dieter ; Szegedy, Christian
• Edge-connectivity augmentations of graphs and hypergraphs
  Report No : 04941 : Szigeti, Zoltán
  in: Research Trends in Combinatorial Optimization, (2004), 483-521
• On the cost of optimal alphabetic code trees with unequal letter costs
  Report No : 04942 : Rautenbach, Dieter ; Szegedy, Christian ; Werber, Jürgen
  in: European Journal Combinatorics 29 (2008), 386-394
• Analytisches Placement im VLSI-Design
  Report No : 04943 : Struzyna, Markus (Diplomarbeit)
• Faster and better global placement by a new transportation algorithm
  Report No : 04944 : Brenner, Ulrich ; Struzyna, Markus
  in: 42nd Design Automation Conference, Proceedings, (2005), 591-596
• On the complexity of the planar directed edge-disjoint paths problem
  Report No : 04945 : Müller, Dirk
  in: Mathematical Programming 105, (2005), 275-288
• Weiszfeld's algorithm revisited once again
  Report No : 04946 : Rautenbach, Dieter ; Struzyna, Markus ; Szegedy, Christian ; Vygen, Jens

2005

Zurück zum Anfang / Back to start

• From stars to comets. Improved local search for universal facility location
  Report No : 05947 : Vygen, Jens
  in: Operations Research Letters 35 (2007), 427-433
• Some applications of the weighted combinatorial Laplacian
  Report No : 05948 : Szegedy, Christian (Dissertation)
• Approximation algorithms for network design and facility location with service capacities
  Report No : 05949 : Maßberg, Jens ; Vygen, Jens
  in: ACM Transactions on Algorithms 4 (2008), Article 50;
  preliminary version in: Approximation, Randomization and Combinatorial Optimization 3624, (2005), 158-169; Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (2005); LNCS 3624, 158-169
• Approximation algorithms for facility location problems
  Report No : 05950 : Vygen, Jens
• Yield improvement by local wiring redundancy
  Report No : 05951 : Bickford, Jeanne ; Hibbeler, Jason ; Bühler, Markus ; Koehl, Jürgen ; Müller, Dirk ; Peyer, Sven ; Schulte, Christian
  in: Proceedings of the 7th International Symposium on Quality Electronic Design (ISQED), (2006), 473-478
• Konstruktion von Inverterbäumen im VLSI-Design unter Berücksichtigung von zeitlichen Beschränkungen
  Report No : 05952 : Bartoschek, Christoph (Diplomarbeit)
  
• Theory and practice of VLSI placement
  Report No : 05953 : Brenner, Ulrich (Dissertation)
  
• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
  Report No : 05954 : Brenner, Ulrich
  in: Operations Research Letters 36, (2008), 408-413

2006

Zurück zum Anfang / Back to start

• Uncomputability and computational completeness below and up to the real halting problem
  Report No : 06955 : Meer, Klaus; Ziegler, Martin
  in: Logical Approaches to Computational Barriers, (2006), 368-377
• On the OBDD size for graphs of bounded tree- and clique-width
  Report No : 06956 : Meer, Klaus; Rautenbach, Dieter
  in: Discrete Math. 309 (2009), 843-851
• Optimization and approximation problems related to polynomial system solving
  Report No : 06957 : Meer, Klaus
  in: Logical Approaches to Computational Barriers; Proceedings of the Second Conference on Computability in Europe; LNCS 3988, (2006), 360-367
• A conjecture of borodin and a coloring of grünbaum
  Report No : 06958 : Rautenbach, Dieter
  in: J. Graph Theory 58 (2008), 139-147
• Large induced forests in C3- and C4-free graphs of maximum degree at most 3
  Report No : 06959 : Rautenbach, Dieter
  
• Efficient generation of short and fast repeater tree topologies
  Report No : 06960 : Bartoschek, Christoph; Held, Stephan; Rautenbach, Dieter; Vygen, Jens
  in: Proceedings of the International Symposium on Physical Design (2006), 120-127
• Optimizing yield in global routing
  Report No : 06961 : Müller, Dirk
  in: Proceedings of the 2006 IEEE/ACM International Conference on Computer-Aided Design, (2006), 480-486
• Bonn Tools: Mathematical innovation for layout and timing closure of systems on a chip
  Report No : 06962 : Korte, Bernhard; Vygen, Jens; Rautenbach, Dieter
  in: Proceedings of the IEEE 95 (2007), 555-572
• Analytical methods in VLSI placement
  Report No : 06963 : Brenner, Ulrich; Vygen, Jens
  in: Handbook of Algorithms for VLSI Physical Design Automation, (2009), 327-346 (C.J. Alpert, D.P. Mehta, S.S. Sapatnekar eds.)
• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
  Report No : 06964 : Peyer, Sven ; Rautenbach, Dieter ; Vygen, Jens
  in: Journal of Discrete Algorithms 7 (2009), 377-390
• Yield Optimierung im Detailed Routing
  Report No : 06965 : Schulte, Christian
  
• Clusteringprobleme im Clocktreedesign
  Report No : 06966 : Berger, Florian (Diplomarbeit)
  

2007

Zurück zum Anfang / Back to start

• VLSI placement with position constraints and local densities
  Report No : 07967 : Struzyna, Markus
• Fast gate sizing and timing closure for multi-million cell designs
  Report No : 07969 : Held, Stephan
• An effective algorithm for mixed-size VLSI placement
  Report No : 07970 : Brenner, Ulrich
• Timing optimization by restructuring long combinatorial paths
  Report No : 07971 : Werber, Jürgen; Rautenbach, Dieter; Szegedy, Christian
  in: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD) 2007, 536-543
• Time-Cost-Tradeoff-Probleme und eine Anwendung in der Timing-Optimierung im VLSI-Design
  Report No : 07972 : Schmedding, Rüdiger (Diplomarbeit)
• Binary trees with choosable edge lengths
  Report No : 07973 : Massberg, Jens; Rautenbach, Dieter
  in: Information Processing Letters 109/18 (2009), 1087-1092
• Combinatorial optimization in VLSI design
  Report No : 07974 : Held, Stephan; Korte, Bernhard; Rautenbach, Dieter; Vygen, Jens
  in: Chvátal, Vasek (Eds.): Combinatorial Optimization: Methods and Applications (2011), 33-96
• On the scheduling model 1|·|s₁|∑_i=1,…,nU_i
  Report No : 07975 : Yue, Minyi
• Logic restructuring for timing optimization in VLSI Design
  Report No : 07976 : Werber, Jürgen (Dissertation)
• Efficient algorithms for short and fast repeater trees. I. Topology generation
  Report No : 07977 : Bartoschek, Christoph; Held, Stephan; Rautenbach, Dieter; Vygen, Jens
• Efficient algorithms for short and fast repeater trees. II. Buffering
  Report No : 07978 : Bartoschek, Christoph; Held, Stephan; Rautenbach, Dieter; Vygen, Jens
• BonnPlace: Placement of leading-edge chips by advanced combinatorial algorithms
  Report No : 07979 : Brenner, Ulrich; Struzyna, Markus; Vygen, Jens
  in: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 27/9 (2008), 1607-1620
• Shortest path and steiner trees in VLSI routing
  Report No : 07980 : Peyer, Sven (Dissertation)

2008

Zurück zum Anfang / Back to start

• A local approximation algorithm for maximum weight matching
  Report No : 08981 : Nieberg, Tim
  in: Proceedings of the 5th International Workshop on Foundations of Mobile Computing (FOMC) 2008, 87-92
• Iterative Balancierungsverfahren und ihre Anwendung für das Clock-Skew-Scheduling
  Report No : 08982 : Kleff, Alexander (Diplomarbeit)
• Combinatorial problems in chip design
  Report No : 08983 : Korte, Bernhard; Vygen, Jens
  in: Grötschel, Martin; Katona, Gyula O. (Eds.): Building Bridges Between Mathematics and Computer Science (2008), 333-368
• Lower bounds for the sink clustering problem
  Report No : 08984 : Maßberg, Jens
• The Floyd-Warshall algorithm on graphs with negative cycles
  Report No : 08985 : Hougardy, Stefan
  in: Information Processing Letters 110/8-9 (2010), 279-281
• Timing closure in chip design
  Report No : 08986 : Held, Stephan (Dissertation)
• Faster min-max resource sharing and applications
  Report No : 08987 : Müller, Dirk; Vygen, Jens
  published as an improved version (Report No : 101013) in: Mathematical Programming Computation 3 (2011), 1-35
• Verbesserte Legalisierung von Platzierungen im VLSI-Design durch Kürzeste-Wege-Methoden
  Report No : 08988 : Krupke, Immo (Diplomarbeit)
• Linear time approximation algorithms for degree constrained subgraph problems
  Report No : 08989 : Hougardy, Stefan
  in: Cook, William J. et al. (Eds.): Research Trends in Combinatorial Optimization (2009), 185-200
• On the complexity of bin packing, scheduling, and placement
  Report No : 08990 : Vygen, Jens
• Fast buffering for optimizing worst slack and resource consumption in repeater trees
  Report No : 08991 : Bartoschek, Christoph; Held, Stephan; Rautenbach, Dieter; Vygen, Jens
  in: Proceedings of the ACM International Symposium on Physical Design (ISPD) 2009, 43-50
• Gate sizing for large cell-based designs
  Report No : 08992 : Held, Stephan
  in: Proceedings of Design, Automation & Test in Europe (DATE) 2009, 827-832
• Mathematik im Chip-Design
  Report No : 08993 : Koehl, Jürgen; Korte, Bernhard; Vygen, Jens
  in: Grötschel, Martin et al. (Eds.): Produktionsfaktor Mathematik (2009), 223-256
• Mathematics in chip design
  Report No : 08993 : Koehl, Jürgen; Korte, Bernhard; Vygen, Jens
  in: Grötschel, Martin et al. (Eds.): Production Factor Mathematics (2010), 179-206

2009

Zurück zum Anfang / Back to start

• Macro-Platzierung im VLSI-Design
  Report No : 09994 : Schneider, Jan (Diplomarbeit)
• Weiterentwicklung der probabilistischen Congestion-Abschätzung
  Report No : 09995 : Menge, Andreas (Diplomarbeit)
• Schneller Algorithmus für kürzeste Wege in irregulären Gittergraphen
  Report No : 09996 : Humpola, Jesco (Diplomarbeit)
• Voronoi-Diagramme von Achtecken in der Maximum-Metrik
  Report No : 09997 : Gester, Michael (Diplomarbeit)
• The repeater tree construction problem
  Report No : 09998 : Bartoschek, Christoph; Held, Stephan; Maßberg, Jens; Rautenbach, Dieter; Vygen, Jens
  in: Information Processing Letters 110/24 (2010), 1079-1083
• Online algorithms for constructing binary minimax and almost minimax trees
  Report No : 09999 : Maßberg, Jens
• Drei Vorlesungen über Bäume
  Report No : 091000 : Vygen, Jens
• Fast resource sharing in VLSI routing
  Report No : 091001 : Müller, Dirk (Dissertation)
• Facility location and clock tree synthesis
  Report No : 091002 : Maßberg, Jens (Dissertation)
• Faster algorithm for optimum Steiner trees
  Report No : 091003 : Vygen, Jens
  in: Information Processing Letters 111/21-22 (2011), 1075-1079

2010

Zurück zum Anfang / Back to start

• Algorithmen für Min-Max Resource Sharing mit schwachen Orakeln
  Report No : 101004 : Radke, Klaus (Diplomarbeit)
• Postoptimierung auf Timing-kritischen Pfaden durch Umplatzierung und Gate Sizing
  Report No : 101005 : Bock, Adrian (Diplomarbeit)
• Timingoptimierung kleiner Fanin Cones durch Logikresynthetisierung im VLSI Design
  Report No : 101006 : Ossenberg-Engels, Dirk (Diplomarbeit)
• On packing squares into a rectangle
  Report No : 101007 : Hougardy, Stefan
  in: Computational Geometry. Theory and Applications 44/8 (2011), 456-463
• Row-placement in VLSI design: The clumping algorithm and a generalization
  Report No : 101008 : Suhl, Ulrike (Diplomarbeit)
• Clusteringverfahren in der Platzierung im physikalischen Entwicklungsprozess von Logikchips
  Report No : 101009 : Lauff, Christoph (Diplomarbeit)
• New approximation algorithms for the weighted matching problem
  Report No : 101010 : Hanke, Sven; Hougardy, Stefan
• An article about steiner ratio conjecture
  Report No : 101011 : Yue, Minyi
• Splitting trees at vertices
  Report No : 101012 : Vygen, Jens
  in: Discrete Mathematics 311/1 (2011), 67-69
• Faster min-max resource sharing in theory and practice
  Report No : 101013 : Müller, Dirk; Radke, Klaus; Vygen, Jens
  in: Mathematical Programming Computation 3/1 (2011), 1-35
• Berechnung optimaler Global Routing Graphen
  Report No : 101014 : Gottschalk, Corinna (Bachelorarbeit)
• Flow-based partitioning and fast global placement in chip design
  Report No : 101015 : Struzyna, Markus (Dissertation)
• A generalization of a theorem of Kleitman and Krieger
  Report No : 101016 : Zernisch, Jan
  in: International Journal of Computational Geometry & Applications 22/2 (2012), 167-185
• Rectangle packing with additional restrictions
  Report No : 101017 : Maßberg, Jens; Schneider, Jan
  in: Theoretical Computer Science 412/50 (2011), 6948-6958
• Effiziente Implementierung eines Multisection-Algorithmus von Brenner
  Report No : 101018 : Ochsendorf, Philipp (Bachelorarbeit)
• Rectilinear paths with minimum segment lengths
  Report No : 101019 : Maßberg, Jens; Nieberg, Tim
  in: Discrete Applied Mathematics 161/12 (2013), 1769-1775
• A scale invariant exact algorithm for dense rectangle packing problems
  Report No : 101020 : Hougardy, Stefan
  published with the title: A Scale Invariant Algorithm for Packing Rectangles Perfectly
  in: Proceedings of the Fourth International Workshop on Bin Packing Placement Constraints (BPPC) 2012
• Safe lower bounds for graph colouring
  Report No : 101021 : Held, Stephan; Sewell, Edward C.; Cook, William J.
  in: Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO) 2011, 261-273
• d-dimensional arrangement revisited
  Report No : 101022 : Rotter, Daniel; Vygen, Jens
  in: Information Processing Letters 113/13 (2013), 498–505
• Approximationsalgorithmen für 2-dimensionales Placement von Hypergraphen
  Report No : 101023 : Rotter, Daniel (Bachelorarbeit)
• Flow-based partitioning and position constraints in VLSI placement
  Report No : 101024 : Struzyna, Markus
  in: Proceedings of Design, Automation & Test in Europe (DATE) 2011, 607-612

2011

Zurück zum Anfang / Back to start

• Sink partitioning im clocktree-design
  Report No : 111025 : Guhlich, Hendrik (Diplomarbeit)
• Netzlängenoptimale Platzierung von VLSI-Chips
  Report No : 111026 : Funke, Julia (Diplomarbeit)
• Gridless pin access in detailed routing
  Report No : 111027 : Nieberg, Tim
  in: Proceedings of the 48th Design Automation Conference (DAC) 2011, 170-175
• Anwendung von Quadratischer Programmierung auf Quadrat-Packungs-Probleme
  Report No : 111028 : Zernisch, Jan (Diplomarbeit)
• Wirelength optimal results for the MCNC block packing instances
  Report No : 111029 : Funke, Julia; Hougardy, Stefan; Schneider, Jan
  published with the title: Wirelength Optimal Rectangle Packings
  in: Proceedings of the Fourth International Workshop on Bin Packing Placement Constraints (BPPC) 2012
• Simple push-relabel algorithms for matroids and submodular flows
  Report No : 111030 : Frank, András; Miklós, Zoltán
  in: Japan Journal of Industrial and Applied Mathematics 39/3 (2012), 419-439
• Sink-stable sets of digraphs
  Report No : 111031 : Erdös, Dóra; Frank, András; Kun, Krisztián
• Konstruktion von blockadenvermeidenden rektlinearen Steinerbäumen im VLSI-Design
  Report No : 111032 : Fritsch, Stefan (Diplomarbeit)
• Min-Cost-Flow mit vielen parallelen Kanten und das unbalancierte Hitchcock-Transportproblem
  Report No : 111033 : Scheifele, Rudolf (Bachelorarbeit)
• Diskrete Time-Cost-Tradeoff-Probleme
  Report No : 111034 : Wittke, Sonja (Bachelorarbeit)
• Packen von Rechtecken
  Report No : 111035 : Hougardy, Stefan
• Netzlängenoptimale Platzierungen
  Report No : 111036 : Engels, Christiane (Bachelorarbeit)
• Rechteckpackungen
  Report No : 111037 : Silvanus, Jannik (Bachelorarbeit)
• Dual consistent systems of linear inequalities and cardinality constrained polytopes
  Report No : 111038 : Fujishige, Satoru; Maßberg, Jens
  in: Mahjoub, Ali Ridha et al. (Eds.): Combinatorial Optimization, 2nd International Symposium (ISCO) (2012), 153-164
• BonnRoute: Algorithms and data structures for fast and good VLSI routing
  Report No : 111039 : Müller, Dirk; Gester, Michael; Nieberg, Tim; Panten, Christian; Schulte, Christian; Vygen, Jens
  in: ACM Transactions on Design Automation of Electronic Systems 18/2 (2013), Art. 32
  preliminary version in: Proceedings of the 49th Design Automation Conference (DAC) 2012, 459-464

2012

Zurück zum Anfang / Back to start

• BonnPlace legalization: Minimizing movement by iterative augmentation
  Report No : 121040 : Brenner, Ulrich
  in: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 32/8 (2012), 1215-1227
• On the structure of regular chrystals of types A, B, C
  Report No : 121041 : Danilov, Vladimir; Karzanov, Alexander; Koshevoy, Gleb
• Shorter tours by nicer ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
  Report No : 121042 : Sebö, András; Vygen, Jens
  in: Combinatorica 34/5 (2014), 597-629
• Conductance aware clustering in the placement of chip design
  Report No : 121043 : Keller, Levin (Diplomarbeit)
• Maximum-weight stable sets and safe lower bounds for graph coloring
  Report No : 121044 : Held, Stephan; Cook, William; Sewell, Edward C.
  in: Mathematical Programming Computation 4/4 (2012), 363-381
• Kapazitätsabschätzung im Global Routing von VLSI-Chips
  Report No : 121045 : Joachimi, Daniel (Diplomarbeit)
• Schnelle Enumeration von Steinerbäumen im Global Routing
  Report No : 121046 : Bellinghausen, Lars (Diplomarbeit)
• Design Rules in VLSI Routing
  Report No : 121047 : Schulte, Christian (Dissertation)
• Approximationsalgorithmen für 2-kantenzusammenhängende aufspannende Subgraphen
  Report No : 121048 : Hunkenschröder, Christoph (Bachelorarbeit)
• Ein Färbungsalgorithmus für Chipverdrahtung
  Report No : 121049 : Ahrens, Markus (Bachelorarbeit)
• Rektilineare Steinerbäume mit Mindestlängen im VLSI Routing
  Report No : 121050 : Petig, Thomas (Diplomarbeit)
• Shallow-light Steiner arborescences with vertex delays
  Report No : 121051 : Held, Stephan; Rotter, Daniel
  in: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO) 2013, 229-241
• Minimum cost flow with parallel edges and the unbalanced Hitchcock transportation problem
  Report No : 121052 : Matsui, Tomomi; Scheifele, Rudolf
• On weighted multicommodity flows in directed networks
  Report No : 121053 : Babenko, Maxim; Karzanov, Alexander
• Light and fast repeater tree topologies
  Report No : 121054 : Rotter, Daniel (Masterarbeit)
• Physikalisches Layout symmetrischer Funktionen
  Report No : 121055 : Kämmerling, Nicolas (Bachelorarbeit)
• Detailed Routing im VLSI-Design unter Berücksichtigung von Multiple-Patterning
  Report No : 121056 : Nohn, Felix (Diplomarbeit)
• New approximation algorithms for the TSP
  Report No : 121057 : Vygen Jens
  in: Optima 90 (2012), 1-12
• Constrained partitioning in chip design
  Report No : 121058 : Ochsendorf, Philipp (Masterarbeit)

2013

Zurück zum Anfang / Back to start

• The uniform orientation Steiner tree problem is NP-hard
  Report No : 131059 : Brazil, Marcus; Zachariasen, Martin
• Sub-quadratic objectives in quadratic placement
  Report No : 131060 : Struzyna, Markus
  in: Proceedings of Design, Automation & Test in Europe (DATE) 2013, 1867-1872
• Fast parallelisation for detailed routing in VLSI Design
  Report No : 131061 : Klewinghaus, Niko (Diplomarbeit)
• Signalbeschleunigung durch Logikrestrukturierung im Chip Design
  Report No : 131062 : Bachner, Christoph (Diplomarbeit)
• Das Gruppensteinerbaumproblem
  Report No : 131063 : Spirkl, Sophie (Bachelorarbeit)
• Ein verschärfter NP_Vollständigkeitsbeweis für das zweite Hamiltonkreisproblem
  Report No : 131064 : Matzke, Christoph (Bachelorarbeit)
• Discrete Time-Cost Tradeoff Problems in Timing Optimization
  Report No : 131065 : Wittke, Sonja (Masterarbeit)
• Eliminating Edges in TSP Instances
  Report No : 131066 : Hougardy, Stefan; Schroeder, Rasmus T.
  in: Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG) 2014, 275-286
• On the Nearest Neighbor Rule for the Metric Traveling Salesman Problem
  Report No : 131067 : Hougardy, Stefan; Wilde, Mirko
  in: Discrete Applied Mathematics 195 (2015), 101-103
• Analyse der Nearest-Neighbor-Rule für das Traveling-Salesman-Problem
  Report No : 131068 : Wilde, Mirko (Bachelorarbeit)
• Timing-Optimale Plazierung im VLSI-Design
  Report No : 131069 : Teichmann, Marvin Tom Tasso (Bachelorarbeit)
• Track Assignment im Routing
  Report No : 131070 : Ruland, Timm (Bachelorarbeit)
• Steiner Trees with Bounded Elmore Delay
  Report No : 131071 : Scheifele, Rudolf (Masterarbeit)
• Die Komplexität des Hamiltonkreisproblems in hamiltonschen Graphen
  Report No : 131072 : Mechandjijski, Tom (Bachelorarbeit)
• Mixed Integer Programming Approach for Leaf Cell Routing
  Report No : 131073 : Weyd, Thomas (Masterarbeit)
• Approximation Algorithms for the Traveling Salesman Problem in Graphs and Digraphs
  Report No : 131074 : Gottschalk, Corinna (Masterarbeit)
• Algorithms for Macro Placement
  Report No : 131075 : Engels, Christiane (Masterarbeit)
• Effiziente Detailverdrahtung (Efficient Detailed Routing)
  Report No : 131076 : Klewinghaus, Niko (Diplomarbeit)
• Fast Exact Steiner Tree Generation Using Dynamic Programming
  Report No : 131077 : Silvanus, Jannik (Masterarbeit)
• The guillotine subdivision approach for TSP with neighborhoods revisited
  Report No : 131078 : Spirkl, Sophie

2014

Zurück zum Anfang / Back to start

• On the Integrality Ratio of the Subtour LP for Euclidean TSP
  Report No : 141079 : Hougardy, Stefan
  in: Operations Research Letters 42/8 (2014), 495-499
• Combinatorial Optimization
  Report No : 141080 : Vygen, Jens
  in: Higham, Nicholas J. et al. (Eds.): Princeton Companion of Applied Mathematics (2015), 564-569
• Chip Design
  Report No : 141081 : Held, Stephan; Hougardy, Stefan; Vygen, Jens
  in: Higham, Nicholas J. et al. (Eds.): Princeton Companion of Applied Mathematics (2015), 804-807
• Transistor-Level Layout of Integrated Circuits
  Report No : 141082 : Schneider, Jan (Dissertation)
• A Fast Algorithm for Rectilinear Steiner Trees with Length Restrictions on Obstacles
  Report No : 141083 : Held, Stephan; Spirkl, Sophie Theresa
  in: Proceedings of the ACM International Symposium on Physical Design (ISPD) 2014, 37-44
• Post-Routing Latch Optimization for Timing Closure
  Report No : 141084 : Held, Stephan; Schorr, Ulrike
  in: Proceedings of the 51st Design Automation Conference (DAC) 2014, 1-6
• Fast Repeater Tree Construction
  Report No : 141085 : Bartoschek, Christoph (Dissertation)
• Dijkstra meets Steiner: A fast exact goal-oriented Steiner tree algorithm
  Report No : 141086 : Hougardy, Stefan; Silvanus, Jannik; Vygen, Jens
  in: Mathematical Programming Computation 9/2 (2017), 135-202
• Boolean Circuit Optimization
  Report No : 141087 : Spirkl, Sophie Theresa (Masterarbeit)
• 2-Dimensional Arrangement in Rectangles
  Report No : 141088 : Brenner, Ulrich; Rotter, Daniel; Schorr, Ulrike
• Pin Access in VLSI-Routing
  Report No : 141089 : Ahrens, Markus Johannes (Masterarbeit)
• Skript zur Vorlesung : Algorithmische Mathematik I
  Report No : 141090 : Hougardy, Stefan; Vygen, Jens
  published with the title: Algorithmische Mathematik (2016)
• Fast Prefix Adders for Non-Uniform Input Arrival Times
  Report No : 141091 : Held, Stephan; Spirkl, Sophie Theresa
  in: Algorithmica 77/1 (2017), 287-308
• Dijkstra meets Steiner: Computational results of a fast exact Steiner tree algorithm
  Report No : 141092 : Hougardy, Stefan; Silvanus, Jannik; Vygen, Jens
  in: 11th DIMACS Implementation Challenge in Collaboration with ICERM: Steiner Tree Problems (2014)
• The Approximation Ratio of the Greedy Algorithm for the Metric Traveling Salesman Problem
  Report No : 141093 : Brecklinghaus, Judith; Hougardy, Stefan
  in: Operations Research Letters 43/3 (2015), 259-261
• Self-Stabilizing BonnPlace - A Self-Stabilizing Global Placement Framework
  Report No : 141094 : Hoppmann, Nils (Masterarbeit)
• Linear Programming in Placement Algorithms
  Report No : 141095 : Weiß, Philipp (Masterarbeit)

2015

Zurück zum Anfang / Back to start

• VLSI Routing for Advanced Technology
  Report No : 151096 : Gester, Michael (Dissertation)
• BonnPlace: A Self-Stabilizing Placement Framework
  Report No : 151097 : Brenner, Ulrich; Hermann, Anna; Hoppmann, Nils; Ochsendorf, Philipp
  in: Proceedings of the ACM International Symposium on Physical Design (ISPD) 2015, 9-16
• Cost-Based Buffering for Multiple Resources
  Report No : 151098 : Romen, Daniel (Masterarbeit)
• On the Shadow Simplex method for curved polyhedra
  Report No : 151099 : Dadush, Daniel; Hähnle, Nicolai
  in: Discrete and Computational Geometry 56/4 (2016), 882-909
• Largest Empty Square Queries in Rectilinear Polygons
  Report No : 151100 : Gester, Michael; Hähnle, Nicolai; Schneider, Jan
  in: Proceedings of the 15th International Conference on Computational Science and Its Applications (ICCSA) 2015, 267-282
• Detailed Routing Algorithms for Advanced Technology Nodes
  Report No : 151101 : Ahrens, Markus; Gester, Michael; Klewinghaus, Niko; Müller, Dirk; Peyer, Sven; Schulte, Christian; Tellez, Gustavo
• Reassembling Trees for the Traveling Salesman
  Report No : 151102 : Vygen, Jens
  in: SIAM Journal on Discrete Mathematics 30/2 (2016), 875-894
• Two-Level Rectilinear Steiner Trees
  Report No : 151103 : Held, Stephan; Kämmerling, Nicolas
  in: Computational Geometry. Theory and Applications 61 (2017), 48-59
• Local Search Algorithms for Timing-Driven Placement under Arbitrary Delay Models
  Report No : 151104 : Bock, Adrian; Held, Stephan; Kämmerling, Nicolas; Schorr, Ulrike
  in: Proceedings of the 52nd Design Automation Conference 2015 (DAC) 2015, Art. 29
• Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two
  Report No : 151105 : Held, Stephan; Spirkl, Sophie Theresa
  in: ACM Transactions on Algorithms 14/1 (2018), Art. 4
• Gate Sizing
  Report No : 151106 : Held, Stephan; Hu, Jiang
  in: Scheffer, Louis K.; Lavagno, Luciano; Martin, Grant; Markov, Igor L. (Eds.): Electronic Design Automation for Integrated Circuits Handbook (2016, 2. Ed.), Chap. 10
• Rektilineare Steinerbäume mit längen- und richtungsbeschränkenden Blockaden
  Report No : 151107 : Bihler, Tilmann (Bachelorarbeit)
• Global Routing with Inherent Static Timing Constraints
  Report No : 151108 : Held, Stephan; Müller, Dirk; Rotter, Daniel; Traub, Vera; Vygen, Jens
  in: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD) 2015, 102-109
• An Exact Algorithm for Wirelength Optimal Placements in VLSI Design
  Report No : 151109 : Funke, Julia; Hougardy, Stefan; Schneider, Jan
  in: Integration. The VLSI Journal 52 (2016), 355-366
• Steiner Trees with Bounded RC-Delay
  Report No : 151110 : Scheifele, Rudolf
  in: Algorithmica 78/1 (2017), 86-109
• Verbesserte Analyse eines Algorithmus für das s-t-Pfad TSP
  Report No : 151111 : Grewing, Meike (Bachelorarbeit)
• Steinerbäume mit geringem RC-Delay
  Report No : 151112 : Heymann, Britta (Bachelorarbeit)
• Verbesserungen von Algorithmen für die Platzierung von Macros
  Report No : 151113 : Michaelis, Friederike (Bachelorarbeit)
• Global Routing mit Delay-Beschränkungen
  Report No : 151114 : Traub, Vera (Bachelorarbeit)
• Time-Cost Tradeoff and Steiner Tree Packing with Multiplicative Weights
  Report No : 151115 : Hähnle, Nicolai
• Timing-Driven Placement Post-Optimization
  Report No : 151116 : Kämmerling, Nicolas (Masterarbeit)
• Better s-t Tours by Gao Trees
  Report No : 151117 : Vygen, Jens; Gottschalk, Corinna
  in: Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO) 2016, 126-137
  in: Mathematical Programming 172/1-2 (2018), 191-207
• Algorithms for the gate sizing and Vt assignment problem
  Report No : 151118 : Daboul, Siad (Masterarbeit)
• Algorithms for Circuit Sizing in VLSI Design
  Report No : 151119 : Schorr, Ulrike (Dissertation)
• Global Routing with exact pin positions
  Report No : 151120 : Saccardi, Pietro (Masterarbeit)

2016

Zurück zum Anfang / Back to start

• Disjoint Steiner Tree Problem in narrow Routing Areas
  Report No : 161121 : Reinsch, Felizia (Masterarbeit)
• Fast Approximation Algorithms for the Generalized Survivable Network Design Problem
  Report No : 161122 : Könemann, Jochen; Pashkovich, Kanstantsin; Feldmann, Andreas Emil; Sanità, Laura
• γ-Soft Packings of Rectangles
  Report No : 161123 : Brenner, Ulrich
  in: Computational Geometry. Theory and Applications 70-71 (2018), 49-64
• RC-Aware Global Routing
  Report No : 161124 : Scheifele, Rudolf
  in: Proceedings of the 35th International Conference on Computer-Aided Design (ICCAD) 2016, Art. 21
• Eine 10/7 Approximation für 2-zusammenhängende spannende Subgraphen
  Report No : 161125 : Heeger, Klaus (Bachelorarbeit)
• Pfadsuche im Detailed Routing
  Report No : 161126 : Henke, Dorothee (Bachelorarbeit)
• Varianten des TSP für die Paketzustellung
  Report No : 161127 : Schmerling, Mareike (Bachelorarbeit)
• Exaktes Leaf Cell Routing
  Report No : 161128 : Klotz, Benjamin (Bachelorarbeit)
• Algorithmische Umsetzung aktueller Design Regeln für einen exakten Leaf Cell Router
  Report No : 161129 : Vicari, Robert (Bachelorarbeit)
• Certified Edge Elimination for TSP Instances
  Report No : 161130 : Miething, Lukas (Masterarbeit)
• A proof of Moser's square packing problem for small instances
  Report No : 161131 : Platz, Alexander (Masterarbeit)
• Two-connected spanning subgraphs with at most 10/7 OPT edges
  Report No : 161132 : Heeger, Klaus; Vygen, Jens
  in: SIAM Journal on Discrete Mathematics 31/3 (2017), 1820-1835
• Optimale Shallow-Light-Steiner-Arboreszenzen
  Report No : 161133 : Rockel, Benjamin (Bachelorarbeit)
• Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
  Report No : 161134 : Kiefner, Annika Kristina
  in: Operations Research Letters 44/6 (2016), 835-838
• Placement Algorithms for Multi-Bit Leaf Cells
  Report No : 161135 : Göke, Alexander (Masterarbeit)

2017

Zurück zum Anfang / Back to start

• Probabilistic Analysis of Edge Elimination for Euclidean TSP
  Report No : 171136 : Zhong, Xianghui (Masterarbeit)
• Automatic Cell Layout in the 7nm Era
  Report No : 171137 : Cremer, Pascal; Hougardy, Stefan; Schneider, Jan; Silvanus, Jannik
  in: Proceedings of the ACM International Symposium on Physical Design (ISPD) 2017, 99-106
• Timing-Constrained Global Routing with Buffered Steiner Trees
  Report No : 171138 : Rotter, Daniel (Dissertation)
• Global Routing with Timing Constraints
  Report No : 171139 : Held, Stephan; Müller, Dirk; Rotter, Daniel; Scheifele, Rudolf; Traub, Vera; Vygen, Jens
  in: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 37/2 (2018), 406-419
• Layers and Matroids for the Traveling Salesman's Paths
  Report No : 171140 : Schalekamp, Frans; Sebö, András; Traub, Vera; van Zuylen, Anke
  in: Operations Research Letters 46/1 (2018), 60-63
• On the Integrality Gap of the Prize-Collecting Steiner Forest LP
  Report No : 171141 : Könemann, Jochen; Olver, Neil; Pashkovich, Kanstantsin, Ravi, R.; Swamy, Chaitanya; Vygen, Jens
  in: Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM) 2017, Art. 17
• Rounding Fractional Global Routings
  Report No : 171142 : Bihler, Tilmann (Masterarbeit)
• Approaching 3/2 for the s-t-path TSP
  Report No : 171143 : Traub, Vera; Vygen, Jens
  in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2018, 1854-1864
  in: Journal of the ACM 66/2 (2019), Art. 14
• Approximationsalgorithmen im Technology Mapping
  Report No : 171144 : Elbert, Lucas (Bachelorarbeit)
• Approximating the s-t-path TSP
  Report No : 171145 : Traub, Vera (Masterarbeit)
• Faster path and Steiner tree computation in continuous global routing
  Report No : 171146 : Rabenstein, Stefan (Bachelorarbeit)
• Vehicle Routing in zwei Phasen
  Report No : 171147 : Erlenbach, Lukas (Bachelorarbeit)
• Vehicle Routing mit Subtouren und Zeitfenstern
  Report No : 171148 : Tröbst, Thorben (Bachelorarbeit)
• Few Sequence Pairs Suffice: Representing All Rectangle Placements
  Report No : 171149 : Silvanus, Jannik; Vygen, Jens
  in: SIAM Journal on Discrete Mathematics 34/4 (2020), 2017-2032
• Faster Adder Circuits for Inputs with Prescribed Arrival Times
  Report No : 171150 : Brenner, Ulrich; Hermann, Anna
• Algorithmen zum Platzieren ineinander gefalteter Transistoren
  Report No : 171151 : Thomä, Simon (Bachelorarbeit)
• Track Assignment based Detailed Routing
  Report No : 171152 : Kühne, Lukas (Masterarbeit)
• Verbesserte Algorithmen für die Platzierung von Makros
  Report No : 171153 : Wochnik, Daniel (Masterarbeit)
• Capacity Estimation in Global Routing
  Report No : 171154 : Michaelis, Friederike (Masterarbeit)
• Algorithms for Routing and Buffer Insertion
  Report No : 171155 : Natura, Bento (Masterarbeit)
• An approximation algorithm for threshold voltage optimization
  Report No : 171156 : Daboul, Siad; Held, Stephan; Vygen, Jens; Wittke, Sonja
  in: ACM Transactions on Design Automation of Electronic Systems 23/6 (2018), Art. 68

2018

Zurück zum Anfang / Back to start

• Provably Fast and Near-Optimum Gate Sizing
  Report No : 181157 : Daboul, Siad; Hähnle, Nicolai; Held, Stephan; Schorr, Ulrike
  in: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 37/12 (2018), 3163-3176
• Vehicle Routing with Subtours
  Report No : 181158 : Held, Stephan; Könemann, Jochen; Vygen, Jens
  in: Discrete Optimization 33 (2019), 87-100
• Optimal Monotone Realizations of And-Or-Paths
  Report No : 181159 : Hegerfeld, Falko (Masterarbeit)
• Beating the integrality ratio for s-t-tours in graphs
  Report No : 181160 : Traub, Vera; Vygen, Jens
  in: Proceedings of the 59th Annual Symposium on Foundations of Computer Science (FOCS) 2018, 766-777
  in: SIAM Journal on Computing, to appear
• Exact Algorithms for Delay-Bounded Steiner Arborescences
  Report No : 181161 : Held, Stephan; Rockel, Benjamin
  in: Proceedings of the 55th Design Automation Conference (DAC) 2018, Art. 44
• Ganzzahligkeitslücke des Subtour-Eliminierungs-LPs für das ATSPP
  Report No : 181162 : Köhne, Anna Christina (Bachelorarbeit)
• Algorithmen für das Technology Mapping
  Report No : 181163 : Zorn, Alexander (Bachelorarbeit)
• Trackless TrackAssignment
  Report No : 181164 : Neuwohner, Meike (Bachelorarbeit)
• Hard to Solve Instances of the Euclidean Traveling Salesman Problem
  Report No : 181165 : Hougardy, Stefan; Zhong, Xianghui
  in: Mathematical Programming Computation 13 (2021), 51-74
• TSP mit dynamischer Programmierung
  Report No : 181166 : Schlomberg, Niklas (Bachelorarbeit)
• Congestion-aware Steiner Trees with Small Elmore Delay
  Report No : 181167 : Heeger, Klaus (Masterarbeit)
• The asymmetric traveling salesman path LP has constant integrality ratio
  Report No : 181168 : Köhne, Anna; Traub, Vera; Vygen, Jens
  in: Proceedings of the 20th Conference on Integer Programming and Combinatorial Optimization (IPCO) 2019, 288-298
  in: Mathematical Programming 183/1-2 (2020), 379-395
• An improved upper bound on the integrality ratio for the s-t-path TSP
  Report No : 181169 : Traub, Vera; Vygen, Jens
  in: Operations Research Letters 47/3 (2019), 225-228
• The 2-Opt Heuristic for the Euclidean TSP on Grid Graphs
  Report No : 181170 : Zaiser, Fabian (Masterarbeit)
• Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time
  Report No : 181171 : Hamm, Thekla (Masterarbeit)
• Faster Leaf Cell Placement Algorithms
  Report No : 181172 : Klotz, Benjamin (Masterarbeit)
• Simplex based graphs yield large integrality gaps for the Bidirected Cut Relaxation
  Report No : 181173 : Vicari, Robert (Masterarbeit)
• A Linear Programming Relaxation with Cycles for the Asymmetric Traveling Salesman Problem
  Report No : 181174 : Henke, Dorothee (Masterarbeit)
• A Mixed Integer Programming Formulation for the Vehicle Routing Problem with Time Windows
  Report No : 181175 : Simon, Ioana (Masterarbeit)

2019

Zurück zum Anfang / Back to start

• Timing-Driven Macro Placement
  Report No : 191176 : Ochsendorf, Philipp (Dissertation)
• Global Gate Sizing and Buffering
  Report No : 191177 : Slot, Lucas (Masterarbeit)
• Exact Algorithms for Interconnect Optimization
  Report No : 191178 : Rockel, Benjamin (Masterarbeit)
• Algorithms for Cell Layout
  Report No : 191179 : Cremer, Pascal (Dissertation)
• Improved Cardinality Bounds for Rectangle Packing Representations
  Report No : 191180 : Silvanus, Jannik (Dissertation)
• Timing-Constrained Global Routing with RC-Aware Steiner Trees and Routing Based Optimization
  Report No : 191181 : Scheifele, Rudolf (Dissertation)
• Cheapest Detailed Routes with Restrictions and Reservations
  Report No : 191182 : Rabenstein, Stefan (Masterarbeit)
• Verallgemeinertes VPN-Problem
  Report No : 191183 : Armbruster, Susanne (Bachelorarbeit)
• RC-aware continuous routing
  Report No : 191184 : Blankenburg, Daniel (Bachelorarbeit)
• Capacitated Vehicle Routing and Cycle Covering Problems
  Report No : 191185 : Tröbst, Thorben (Masterarbeit)
• Reducing Path TSP to TSP
  Report No : 191186 : Traub, Vera; Vygen, Jens; Zenklusen, Rico
  in: Proceedings of the 52nd ACM Symposium on Theory of Computing (STOC) 2020, 14-27
  in: SIAM Journal on Computing 51/3, STOC20-24-STOC20-53
• Global Interconnect Optimization
  Report No : 191187 : Daboul, Siad; Held, Stephan; Natura, Bento; Rotter, Daniel
  in: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD) 2019, 1C.3
• Global routing on rhomboidal tiles
  Report No : 191188 : Hähnle, Nicolai; Saccardi, Pietro
  in: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD) 2019, 10C.1
• Purely MIP-based Cell Layout
  Report No : 191189 : Thomä, Simon (Masterarbeit)
• BonnCell: Automatic Cell Layout in the 7nm Era
  Report No : 191190 : Cremer, Pascal; Hougardy, Stefan; Silvanus, Jannik; Werner, Tobias
  in: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39/10 (2020), 2872-2885
• The Approximation Ratio of the 2-Opt Heuristic for the Metric Traveling Salesman Problem
  Report No : 191191 : Hougardy, Stefan; Zaiser, Fabian; Zhong, Xianghui
  in: Operations Research Letters 48/4 (2020), 401-404
• Das Zerlegen von rektilinearen Polytopen
  Report No : 191192 : Rathke, Silas (Bachelorarbeit)
• PC alignte FET Placements
  Report No : 191193 : Gwilt, Andreas (Bachelorarbeit)
• Approximation Algorithms for Traveling Salesman Problems
  Report No : 191194 : Traub, Vera (Dissertation)

2020

Zurück zum Anfang / Back to start

• An improved approximation algorithm for the ATSP
  Report No : 201195 : Traub, Vera; Vygen, Jens
  in: Proceedings of the 52nd ACM Symposium on Theory of Computing (STOC) 2020, 1-13
  in: SIAM Journal on Computing 51/1 (2022), 139-173
• An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
  Report No : 201196 : Huang, Chien-Chung; Mari, Mathieu; Mathieu, Claire; Schewior, Kevin; Vygen, Jens
  in: SIAM Journal on Discrete Mathematics 35/2 (2021), 752–769
• Global Routing Oracle Algorithms
  Report No : 201197 : Miceli, Federico (Masterarbeit)
• Delay Optimization of Combinational Logic by AND-OR Path Restructuring
  Report No : 201198 : Brenner, Ulrich; Hermann, Anna
• Improving on Best-of-Many-Christofides for T-tours
  Report No : 201199 : Traub, Vera
  in: Operations Research Letters 48/6 (2020), 798-804
• A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering
  Report No : 201200 : Traub, Vera; Tröbst, Thorben
  in: Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO) 2020, 391-404
  in: Mathematical Programming, to appear
• Approximating maximum integral multiflows on bounded genus graphs
  Report No : 201201 : Huang, Chien-Chung; Mathieu, Claire; Mari, Mathieu; Vygen, Jens
  in: Proceedings of the 48th International Colloquium on Automata, Languages and Programming (ICALP) 2021, Art. 80
• Faster Circuits for AND-OR Paths and Binary Addition
  Report No : 201202 : Hermann, Anna (Dissertation)
• Packing Problems in Chip Design
  Report No : 201203 : Neuwohner, Meike (Masterarbeit)
• An Improved Approximation Algorithm for the Capacitated Vehicle Routing Problem
  Report No : 201204 : Blauth, Jannis (Masterarbeit)
• Packen von T-Schnitten
  Report No : 201205 : Ellerbrock, Antonia Clara (Bachelorarbeit)
• Local Search Algorithms for Facility Location Problems
  Report No : 201206 : Ihme, Benjamin (Bachelorarbeit)
• Effiziente MIP-Formulierung zur Fehlerbehebung im Detailed Routing
  Report No : 201207 : Gehring, Lukas (Bachelorarbeit)
• LogSumExp Objectives for VLSI Placement
  Report No : 201208 : Welzel, Karl Stefan (Bachelorarbeit)
• Antenneneffekt im VLSI Global Routing
  Report No : 201209 : Lüderssen, Sebastian (Bachelorarbeit)
• Efficient Algorithms for Routing a Net Subject to VLSI Design Rules
  Report No : 201210 : Ahrens, Markus (Dissertation)
• The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem
  Report No : 201211 : Brodowsky, Ulrich A.; Hougardy, Stefan
  in: Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS) 2021, 18:1-18:15
• Approximating the discrete time-cost tradeoff problem with bounded depth
  Report No : 201212 : Daboul, Siad; Held, Stephan; Vygen, Jens
  in: Proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO) 2021, 30-42
  in: Mathematical Programming, to appear
• On intersecting and dense clutters
  Report No : 201213 : Drees, Martin (Bachelorarbeit)
• Improving the approximation ratio for capacitated vehicle routing
  Report No : 201214 : Blauth, Jannis; Traub, Vera; Vygen, Jens
  in: Proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO) 2021, 1-14
  in: Mathematical Programming, to appear
• Algorithms for exact graph coloring
  Report No : 201215 : Kaul, Matthias (Masterarbeit)
• Constructing depth-optimum circuits for adders and AND-OR paths
  Report No : 201216 : Brenner, Ulrich; Hermann, Anna; Silvanus, Jannik

2021

Zurück zum Anfang / Back to start

• A Fast Optimal Double Row Legalization Algorithm
  Report No : 211217 : Hougardy, Stefan; Neuwohner, Meike; Schorr, Ulrike
  in: Proceedings of the ACM International Symposium on Physical Design (ISPD) 2021, 23-30
• Same-net Error Handling in Steiner Trees for VLSI Routing
  Report No : 211218 : Speth, Mirko (Masterarbeit)
• Approximation Algorithms for the Traveling Salesman Problem
  Report No : 211219 : Zhong, Xianghui (Dissertation)
• Some Bounds Regarding y-Soft Rectangle Packing
  Report No : 211220 : Kiss, Oliver (Masterarbeit)
• Global Timing Optimization in Chip Design
  Report No : 211221 : Daboul, Siad (Dissertation)
• The Limits of Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
  Report No : 211222 : Neuwohner, Meike
  in: Proceedings of the 23rd Conference on Integer Programming and Combinatorial Optimization (IPCO) 2022, 415-428
  published as extended abstract with the title: The Limits of Local Search for Weighted k-Set Packing
• Cycle covers, 2-matching algorithms, and the TSP
  Report No : 211223 : Bischoff, Anna Claudia (Masterarbeit)
• Reducing Moser's Square Packing Problem to a Bounded Number of Squares
  Report No : 211224 : Neuwohner, Meike
• An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
  Report No : 211225 : Neuwohner, Meike
  in: Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS) 2021, 53:1-53:20
• Self-Aligned Double Patterning Cut Mask Generation for Transistor Gates
  Report No : 211226 : Van Cleeff, Pascal
• Local Search with Learned Constraints for Last Mile Routing
  Report No : 211227 : Cook, William; Held, Stephan; Helsgaun, Keld
  in: Winkenbach, Matthias; Parks, Steven; Noszek, Joseph (Eds.): Technical Proceedings of the Amazon Last Mile Routing Research Challenge (Sept. 2021), Art. XXI
• Maximal zufällig aufspannende Bäume
  Report No : 211228 : Tichelmann, Louis (Bachelorarbeit)
• Extending BonnLogic to Multiple Outputs
  Report No : 211229 : Nöbel, Christian (Masterarbeit)
• Detailed Routing and Vertex-Disjoint Paths in Theory and Practice
  Report No : 211230 : Thiele, Hanjo (Masterarbeit)
• Directed Acyclic Graph Partitioning and Applications in Technology Mapping
  Report No : 211231 : Armbruster, Susanne (Masterarbeit)
• Vehicle Routing with Incomplete Information
  Report No : 211232 : Puhlmann, Luise (Masterarbeit)
• Paritätserhaltende Steinerbäume
  Report No : 211233 : Mundt, Max Georg (Bachelorarbeit)
• Hardness of Cost-Distance Steiner Trees
  Report No : 211234 : Heinz, Paula (Bachelorarbeit)
• Kapazitäten im Routing
  Report No : 211235 : Walter, Jan (Bachelorarbeit)
• Time-Dependent Shortest Paths with Preprocessing
  Report No : 211236 : Rathke, Silas (Masterarbeit)
• The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem
  Report No : 211237 : Brodowsky, Ulrich A.; Hougardy, Stefan; Zhong, Xianghui
• Resource sharing revisited: Faster primal-dual convergence and a glimpse of decreasing minimality
  Report No : 211238 : Blankenburg, Daniel (Masterarbeit)
• Efficient Detailed Routing on Optimized Tracks
  Report No : 211239 : Klewinghaus, Niko (Dissertation)
• Performance of BonnPlace using the Weighted Average Model
  Report No : 211240 : Boetticher, Hannes von (Masterarbeit)
• Faster Primal-Dual Convergence for Min-Max Resource Sharing and Stronger Bounds via Local Weak Duality
  Report No : 211241 : Blankenburg, Daniel
• Faster Goal-Orientated Shortest Path Search for Bulk and Incremental Detailed Routing
  Report No : 211242 : Ahrens, Markus; Henke, Dorothee; Rabenstein, Stefan; Vygen, Jens
  in: Proceedings of the 23th Conference on Integer Programming and Combinatorial Optimization (IPCO) 2022, 15-28
• Intersecting and dense restrictions of clutters in polynomial time
  Report No : 211243 : Drees, Martin
  in: Proceedings of the 23th Conference on Integer Programming and Combinatorial Optimization (IPCO) 2022, 210-222
• Passing the Limits of Pure Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
  Report No : 211244 : Neuwohner, Meike
  revised version published with the title: Passing the Limits of Pure Local Search for Weighted k-Set Packing
  in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023, 1090-1137

2022

Zurück zum Anfang / Back to start

• Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
  Report No : 221245 : Blauth, Jannis; Held, Stephan; Müller, Dirk; Schlomberg, Niklas; Traub, Vera; Tröbst, Thorben; Vygen, Jens
• Challenges and Approaches in VLSI Routing
  Report No : 221246 : Posser, Gracieli; Young, Evangeline F. Y.; Held, Stephan; Li, Yih-Lang; Pan, David Z.
in: Proceedings of the ACM International Symposium on Physical Design (ISPD) 2022, 185-192
• Packing cycles in planar and bounded-genus graphs
  Report No : 221247 : Schlomberg, Niklas; Thiele, Hanjo; Vygen, Jens
  in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023, 2069-2086
• MIP-Formulierungen im Detailed Routing
  Report No : 221248 : Biburger, Joes Friedrich (Bachelorarbeit)
• Simplifying the Karlin-Klein-Oveis Gharan Analysis for (3/2 - ε)-Approximating TSP
  Report No : 221249 : Drees, Martin (Masterarbeit)
• Cutting Planes für das Traveling Salesman Problem
  Report No : 221250 : Bülte, Laura (Bachelorarbeit)
• Crossings in 2-optimalen TSP-Touren
  Report No : 221251 : Christalla, Manuel (Bachelorarbeit)
• Worst-Case Beispiele für Cost-Distance Steinerbäume
  Report No : 221252 : Spitzley, Yannik Kyle Dustin (Bachelorarbeit)
• Die LKH-Heuristik für praktische Tourenplanungsprobleme
  Report No : 221253 : Ebert, Daniel (Bachelorarbeit)
• Fast Algorithms for Shortest Path and Distance Computation in Road Graphs
  Report No : 221254 : Rosebrock, Felix (Bachelorarbeit)
• Scheduling breaks in vehicle routing with time-dependent travel times
  Report No : 221255 : Rosebrock, Felix (Masterarbeit)
• Single-Row Circuit Placement and Routing Optimisation
  Report No : 221256 : Gwilt, Andreas Sylvester (Masterarbeit)
• Continuous Routing
  Report No : 221257 : Saccardi, Pietro (Dissertation)
• A (1.5 + ε)-Approximation Algorithm for Weighted Connectivity Augmentation
  Report No : 221258 : Traub, Vera; Zenklusen, Rico
in: Proceedings of the 55th ACM Symposium on Theory of Computing (STOC) 2023, to appear
• Possibilities and Impossibilities in Dissecting Space
  Report No : 221259 : Horchler, Felix (Masterarbeit)
• Approximation Algorithms and LP Relaxations for Clustered TSP Variants
  Report No : 221260 : Gebertz, Eva (Masterarbeit)
• Vereinfachte Korrektur von Grinchuks Beweis zur Tiefe von And-Or-Pfaden
  Report No : 221261 : Ley, Carola (Bachelorarbeit)
• Constrained Local Search for Last-Mile Routing
  Report No : 221262 : Cook, William; Held, Stephan; Helsgaun, Keld
in: INFORMS Transportation Science, to appear
• Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem
  Report No : 221263 : Held, Stephan; Spitzley, Yannik Kyle Dustin
• The Pareto cover problem
  Report No : 221264 : Natura, Bento; Neuwohner, Meike; Weltge, Stefan
in: 30th Annual European Symposium on Algorithms (ESA 2022), 80:1-80:12

2023

Zurück zum Anfang / Back to start

• An improved approximation guarantee for Prize-Collecting TSP
  Report No : 231265 : Blauth, Jannis; Nägele, Martin
in: Proceedings of the 55th ACM Symposium on Theory of Computing (STOC) 2023, to appear
• Cost Allocation in Vehicle Routing
  Report No : 231266 : Ellerbrock, Antonia Clara (Masterarbeit)
• Global Interconnect Optimization
  Report No : 231267 : Daboul, Siad; Held, Stephan; Natura, Bento; Rotter, Daniel
in: ACM Transactions on Design Automation of Electronic Systems, to appear
extended version of Report No : 191187
• SAT-based algorithms for leafcell layout
  Report No : 231268 : Schürks, Jan Malte (Masterarbeit)
• Disjoint Shortest Paths and Rip-up and Reroute in Detailed Routing
  Report No : 231269 : Gehring, Lukas (Masterarbeit)
• Steiner Trees in Triangular Grids
  Report No : 231270 : Rohrßen, Daphne (Masterarbeit)
• Advances on Strictly Δ-Modular IPs
  Report No : 231271 : Nägele, Martin; Nöbel, Christian; Santiago, Richard; Zenklusen, Rico
• Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
  Report No : 231272 : Foos, Josefine; Held, Stephan; Spitzley, Yannik Kyle Dustin
• Algorithms for the Rectilinear and the Euclidean On-Line Steiner Tree Problem
  Report No : 231273 : Richter, Marena (Masterarbeit)