DMO 
Publikationen

Bücher

  1. Hochstättler W: Algorithmische Mathematik, Springer Verlag (2010)
  2. Hochstättler W, Schliep A: CATBox - An Interactive Course in Combinatorial Optimization, Springer Verlag (2010)

2015

  1. Andres SD, Hochstättler W: Perfect digraphs, Journal of Graph Theory (2015) 79 (1), 21–29
  2. Andres SD, Theuser A: Note on the game colouring number of powers of graphs, Discussiones Mathematicae Graph Theory (to appear)
  3. Hochstättler W, Kirsch W, Warzel S: Semicircle law for a matrix ensemble with dependent entries, Journal of Theor. Prob. (to appear)

2014

  1. Andres SD, Hochstättler W, Merkel M: On a base exchange game on bispanning graphs, Discrete Applied Mathematics (2014) 165, 25–36

2012

  1. Andres SD: Game-perfect digraphs, Math. Meth. Oper. Res. 76 (2012), 321-341
  2. Andres SD: On characterizing game-perfect graphs by forbidden induced subgraphs, Contributions to Discrete Math. 7 (2012), 21– 34

2011

  1. Hochstättler W, Chávez-Lomelí L, Goddyn L: Balancing Covectors, SIAM J. Discrete Math. (2011) 25, 1315–1318
  2. Andres SD, Hochstättler W: Some heuristics for the binary paint shop problem and their expected number of color changes, J. Discrete Algorithms (2011) 9(2), 203–211
  3. Andres SD, Hochstättler W, Schallück C: The game chromatic index of wheels, Discrete Applied Mathematics (2011) 159(16), 1660–1665
  4. Hochstättler W, Nickel R: Joins of Oriented Matroids, European Journal of Combinatorics (2011) 32(6), 841– 852
  5. Andres SD: On multiperiodic infinite recursions and their finite core, Journal of Integer Sequences (2011) 14, Art. 11.2.7
  6. Andres SD, Hochstättler W: The game chromatic and the game colouring number of classes of oriented cactuses, Information Processing Letters (2011) 111, 222–226

2010

  1. Hitzemann St, Hochstättler W: On the Combinatorics of Galois Numbers, , Discrete Mathematics, (2010) 310, 3551–3557
  2. Hochstättler W: Algorithmische Mathematik, Springer Verlag (2010)
  3. Hochstättler W, Schliep A: CATBox - An Interactive Course in Combinatorial Optimization, Springer Verlag (2010)
  4. Andres SD: Note on the number of rooted complete N-ary trees, Ars Combin. (2010) 94, 465–469
  5. Andres SD: Directed defective asymmetric graph coloring games, Discrete Appl. Math. (2010) 158, 251–260

2009

  1. Andres SD: Classification of all associative mono-n-ary algebras with 2 elements, Int. J. Math. Math. Sci. (2009), Art. ID 678987
  2. Andres SD: The incidence game chromatic number, Discrete Applied Mathematics (2009) 157, 1980–1987
  3. Andres SD: Lightness of digraphs in surfaces and directed game chromatic number, Discrete Mathematics (2009) 309, 3564–3579
  4. Andres SD: Asymmetric directed graph coloring games, Discrete Mathematics (2009) 309, 5799–5802
  5. Andres SD: Game-perfect graphs, Mathematical Methods of Operations Research (2009) 69, 235–250

2008

  1. Hochstättler W, Nickel R: On the Chromatic Number of an Oriented Matroid, Journal of Combinatorial Theory, Series B (2008) 98, 698–706
  2. Epping T, Hochstättler W, Nickel R, Oertel P in Lars Mönch, Giselher Pankratz (eds.) "Intelligente Systeme zur Entscheidungsunterstützung", Teilkonferenz der Multikonferenz Wirtschaftsinformatik München, 26.02.2008–28.02.2008, SCS Publishing House e. V., 49–64

2007

  1. Blasum U, Hochstättler W, Oertel P, Woeginger G: Steiner diagrams and k-star hubs, Journal of Discrete Algorithms (2007) 5, 622–634
  2. Hochstättler W, Nickel R: The Flow Lattice of Oriented Matroids, Contributions to Discrete Mathematics (2007) 2 (1), 68–86
  3. Berger A, Hochstättler W: Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors, Electronic Notes in Discrete Mathematics (2007) 28, 69–76

2006

  1. Andres SD: The game chromatic index of forests of maximum degree Delta at least 5, Discrete Applied Mathematics (2006) 154, 1317–1323
  2. Hochstättler W, Jin H, Nickel R: Note on an Auction Procedure for a Matching Game in Polynomial Time, AAIM Proceedings (2006) 387–394
  3. Hochstättler W, Nickel R, Peis B: Two disjoint negative cycles in a signed graph, Electronic Notes in Discrete Mathematics, CTW2006 - Cologne-Twente Workshop on Graphs and Combinatorial Optimization (2006) 25, 107–111.
  4. Hochstättler W, Nešetřil J: Antisymmetric Flows in Matroids, European Journal of Combinatorics (2006) 27 (7), 1129–1134
  5. Feder T, Hell P, Hochstättler W: Generalized Colorings (Matrix Partitions) of Cographs, Graph Theory in Paris, Trends in Mathematics (2006) 149–167
  6. Goddyn L, Hlineny P, Hochstättler W: Balanced Signings of Oriented Matroids and Chromatic Number, Combinatorics, Probability and Computing (2006) 15 (4), 523–539
  7. Bonsma P S, Epping Th, Hochstättler W: Complexity results on restricted instances of a paint shop problem for words, Discrete Applied Mathematics (2006) 154 (9), 1335–1343

2005

  1. Fuchs B, Hochstättler W, Kern W: Online Matching on a Line, Theoretical Computer Science (2005) 332, 1–3, 251–264

2004

  1. Erdös P, Faigle U, Hochstättler W, Kern W: Note on the Game Chromatic Index of Trees, Journal of Theoretical Computer Science (2004) 313, 371–376
  2. Epping T, Hochstättler W, Oertel P: Complexity Results on a Paint Shop Problem, Discrete Applied Mathematics (2004) 136, 217–226
  3. Hochstättler W: Diskrete Mathematik (Vorlesungsmanuskript 2004), zu beziehen über das WWW unter der URL http://www.math.tu-cottbus.de/INSTITUT/lsgdi/

2003

  1. Epping T and Hochstättler W: Shortest Paths through Two-tone Pairs (Extended Abstracts), Electronic Notes in Discrete Mathematics (2003) Volume 13
  2. Epping T and Hochstättler W: Sorting with Line Storage Systems, U. Leopold-Wildburger, F. Rendl, G. Wätcher (Eds.): Operations Research Proceedings 2002 Springer Verlag (2003) 235–240
  3. Epping T and Hochstättler W, Lübecke M.E: Max-Flow Min-Cut Duality for a Paint Shop Problem, U. Leopold-Wildburger, F. Rendl, G. Wätcher (Eds.): Operations Research Proceedings 2002 Springer Verlag (2003) 377–382
  4. Hochstättler W: Lineare Algebra für Informatik und IMT (Vorlesungsmanuskript 2003), zu beziehen über das WWW unter der URL http://www.math.tu-cottbus.de/INSTITUT/lsgdi/

2002

  1. Hochstättler W: Oriented Matroids from Wild Spheres, Journal of Computational Technologies (2002) 7, 14–24
  2. Schliep A, Hochstättler W: Developing Gato and CATBox with Python: Teaching graph algorithms through visualization and experimentation, J. Borwein, M.H. Morales, K. Polthier, J.F. Rodrigues eds. Multimedia Tools for Communicating Mathematics Springer Verlag (2002) 291–310
  3. Epping T and Hochstättler W: Storage and Retrieval of Car Bodies by the Use of Line Storage Systems, Technical report (2002) btu–lsgdi–001.02

2001

  1. Hochstättler W: Tic-Tac-Toe or Is the dual of an algebraic matroid algebraic? O. Pangrac, ed.: Graph Theory Day V, KAM-DIMATIA-Series (2001) Prague
  2. Hochstättler W, Mues C and Oertel P: Algorithmen für Speditionsroutingprobleme mit Umlademöglichkeit Proceedings of Fachtagung Logistik 2000plus 11/00 Magdeburg
  3. Blasum U, Hochstättler W and Oertel P: Steiner-Diagrams (Extended Abstract), Electronic Notes in Discrete Mathematics (2001) 8
  4. Hochstättler W: Operations Research I (Lineare Programmierung) (Vorlesungsmanuskript 2001), zu beziehen über das WWW unter der URL http://www.math.tu-cottbus.de/INSTITUT/lsgdi/materials.html
  5. Hochstättler W: Algorithmische Graphentheorie (Vorlesungsmanuskript 2001), zu beziehen über das WWW unter der URL http://www.math.tu-cottbus.de/INSTITUT/lsgdi/materials.html
  6. Epping T and Hochstättler W: Abuse of Multiple Sequence Alignment in a Paint Shop, ZAIK Report 2001–418

2000

  1. Hochstättler W, Nešetřil J: A Note on MaxFlow-MinCut and Homomorphic Equivalence in Matroids, Journal of Algebraic Combinatorics (2000) 12, 293–298
  2. Hamacher A, Hochstättler W, Moll C: Tree Partitioning under Constraints – Clustering for Vehicle Routing Problems, Discrete Applied Mathematics (2000) 99, 55–69
  3. Hochstättler W: Kombinatorische Optimierung (Vorlesungsmanuskript 2000), BTU Cottbus
  4. Epping T, Hochstättler W and Oertel P: A Paint Shop Problem for Words, ZAIK Report 2000–395
  5. Blasum U, Hochstättler W: Application of Branch and Cut to the Capacitated Vehicle Routing Problem, ZAIK Report 2000–386
  6. Hochstättler W and Oertel P: The 5-Star-Hub-Problem is NP-complete, ZAIK Report 2000–385
  7. Blasum U, Hochstättler W and Oertel P: Steiner-Diagrams and k-star hubs, ZAIK Report 2000–384

1999

  1. Hochstättler W, Nešetřil J: Linear Programming Duality and Morphisms, Comment. Math. Univ. Carolinae (1999) 40, 577–599
  2. Fleiner T, Hochstättler W, Laurent M, Loebl M: Cycle bases for lattices of matroids with no Fano dual minor and their one-element extensions, Journal of Combinatorial Theory, Series B (1999) 77, 25–38
  3. Blasum U, Bussieck M, Hochstättler W, Moll C, Scheel H H, Winter T: Scheduling Trams in the Morning, Mathematical Methods of Operations Research (1999) MMOR 49, 137–148
  4. Fekete S P, Hochstättler W, Kromberg S, Moll C: The Complexity of an Inverse Shortest Path Problem, R.L. Graham, J. Kratochvil, J. Nešetril, F.S. Roberts, eds. Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future. DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, AMS publication (1999) 49, 113–127
  5. Hochstättler W, Loebl M: On Bases of Cocycle Lattices and Submatrices of a Hadamard Matrix, R.L. Graham, J. Kratochvil, J. Nešetril, F.S. Roberts, eds. Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future. DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, AMS publication (1999) 49, 159–168
  6. Hayer M, Hochstättler W: Test Sets for Vertex Cover Problems in: Electronic Notes in Discrete Mathematics, Volume 3, Guest Editors: H.J. Broersma , U. Faigle , C. Hoede and J.L. Hurink: 6th Twente Workshop on Graphs and Combinatorial Optimization University of Twente (Enschede, the Netherlands) (1999) May 26-28
  7. Hochstättler W: Algorithmische Mathematik (für Wirtschaftsinformatiker) (Vorlesungsmanuskript 1999), zu beziehen über das WWW unter der URL http://www.zaik.de/AFS/publications/lecture_notes/algomat99/
  8. Hochstättler W: Logik (Diskrete Mathematik) (Vorlesungsmanuskript 1999), BTU Cottbus
  9. Blasum U, Hochstättler W, Oertel P: Steiner-Diagrams, ZAIK Report 1999–342

1998

  1. Faigle U, Fekete S, Hochstättler W, Kern W: On approximately fair cost allocation in Euclidean TSP games, OR Spektrum (1998) 20, 29–37
  2. Faigle U, Kern W, Fekete S, Hochstättler W: The Nukleon of Cooperative Games and an Algorithm for Matching Games, Mathematical Programming (1998) 83, 195–211
  3. Hochstättler W, Jackson B: Large Circuits in Binary Matroids of Large Cogirth: I. Journal of Combinatorial Theory, Series B (1998) 74, 35–52
  4. Hochstättler W, Jackson B: Large Circuits in Binary Matroids of Large Cogirth: II. Journal of Combinatorial Theory, Series B (1998) 74, 53–63
  5. Hochstättler W: Grundalgorithmen der kombinatorischen Optimierung (Vorlesungsmanuskript 1998), zu beziehen über das WWW unter der URL http://www.zpr.uni-koeln.de/˜catbox/vorlesung.html

1997

  1. Hochstättler W: A Lattice-Theoretical Characterization of Oriented Matroids, Europ. J. Combinatorics (1997) 18, 563–574
  2. Faigle U, Fekete S, Hochstättler W, Kern W: On the Complexity of Testing Membership in the Core of Min-cost Spanning Tree Games, Int. J. Game Theory (1997) 26, 361–366
  3. Hochstättler W: Matroide (Vorlesungsmanuskript 1997), zu beziehen über das WWW unter der URL http://www.zaik.de/AFS/publications/lecture_notes/Matroide/
  4. Hochstättler W: Duality in Combinatorial Optimization – Sometimes it Works, Sometimes it Won't, Habilitationsschrift, Universität zu Köln 1997
  5. Hochstättler W and Nešetřil J: Menger's Theorem as Morphism Duality, Tech Report 1997–286
  6. Hochstättler W: About the Tic-Tac-Toe matroid, Tech Report 1997–272

1996

  1. Hochstättler W, Loebl M, Moll C: Generating Convex Polyominoes at Random, Discrete Mathematics (1996) 153, 165–176
  2. Bachem A, Hochstättler W, Steckemetz B, Volmer A: Computational Experience with General Equilibrium Problems, Computational Optimization and Applications (1996) 6, 213–225
  3. Bachem A, Hochstättler W, Malich M: The Simulated Trading Heuristic for Solving Vehicle Routing Problems, Discrete Applied Mathematics (1996) 65, 47–72
  4. Hochstättler W, Kromberg S: Adjoints and Duals of Matroids Representable over a Skew Field, Math. Scand. (1996) 78, 5–12
  5. Hochstättler W, Kromberg S: A Pseudoconfiguration of Points without Adjoint, Journal of Combinatorial Theory, Series B (1996) 68 2, 277–294
  6. Albers B, Bachem A, Heesen R, Hochstättler W: Benchmarking und Leistungsvergleich in Filialnetzen großer Unternehmen, Zeitschrift für Betriebswirtschaft (1996) 66, 1313–1328
  7. Blasum U, Hochstättler W, Moll C, Rieger J: Using network-flow techniques to solve an optimization problem from surface-physics, J. Phys. A: Math. Gen 29 (1996) 459–463
  8. Hochstättler W: Semidefinite Programmierung (Vorlesungsmanuskript 1996), zu beziehen über das WWW unter der URL http://www.zaik.de/AFS/publications/lecture_notes/semidefinite/
  9. Hochstättler W and Nešetřil J: Farkas' Lemma and Morphism Duality, Tech Report 1996–251

1995

  1. Hochstättler W, Tinhofer G: Hamiltonicity in Graphs with few P4s, Computing (1995) 54, 213–225
  2. Alfter M, Hochstättler W: On Adjoints and Pseudomodular Matroids, Discrete Applied Mathematics (1995) 60, 3–11
  3. Bachem A, Heesen R, Hecht B, Hochstättler W: Benchmarking und Leistungsvergleich in Filialnetzen großer Unternehmen, in: P. Kleinschmidt et. al. (eds): Operations Research Proceedings Springer Verlag (1995) 119-124
  4. Hochstättler W, Loebl M: On Bases of Cocircuit Lattices, Tech Report 1995–208
  5. Hochstättler W, Schindler H: Recognizing P4-extendible graphs in linear time, Tech Report 1995–188

1994

  1. Dress A, Hochstättler W, Kern W: Modular Substructures in Pseudomodular Lattices, Math. Scand. (1994) 74, 9–16
  2. Bachem A, Hochstättler W, Malich M: Simulated Trading – A New Parallel Approach for Solving Vehicle Routing Problems, G.R. Joubert, D. Tystram, F.J. Peters and D.J. Evans (edts.): Parallel Computing: Tends and Applications, North-Holland (1994) 471-475

1993

  1. Hochstättler W: Nested Cones and Onion Skins, Appl. Math. Letters (1993) 6 2, 67–69
  2. Hochstättler W: A Note on the Weak Zone Theorem, Congressus Numerantium (1993) 98, 95–103
  3. Bachem A, Hochstättler W, Malich M: Simulated Trading – Eine kurze Einführung, PASA Mitteilungen 1993
  4. Faigle U, Fekete S, Hochstättler W, Kern W: Approximating the Core of Euclidean TSP games, in: A. Bachem, U. Derigs, R. Schrader: Operations Research Physica-Verlag (1993) 153–156
  5. Hochstättler, W, Loebl M, Moll C: Generating Convex Polyominoes at Random, in: A. Bachem, U. Derigs, R. Schrader: Operations Research Physica-Verlag (1993) 259–262
  6. Hochstättler W, Kromberg S, Moll C: A New Linear Time Algorithm for Computing the Convex Hull of a Simple Polygon in: A. Bachem, U. Derigs, R. Schrader: Operations Research Physica-Verlag (1993) 263-265
  7. Gerards A.M.H., Hochstättler W: Onion Skins in Oriented Matroids, Tech Report 1993–138

1992

  1. Hochstättler W: Seitenflächenverbände orientierter Matroide, Dissertationsschrift, Universität zu Köln 1992
  2. Bachem A, Hochstättler W, Wenzel W: Sensitivity Analysis for General Equilibrium Problems, Tech Report 1992–116
  3. Hochstättler W, Kromberg S, Moll C: A Simple Proof of the Blossom Expansion Lemma, Tech Report 1992–127
  4. Hochstättler W: A non-visiting Path, Nested Cones and Onion Skins, Tech Report 1992–126

1991

  1. Hochstättler W, Rieder J: A Note on the Lattice of 2-Matroid-Intersection, Archiv der Mathematik (1991) 57, 514–517

1990

  1. Hochstättler W: Shellability of Oriented Matroids, Proceedings of the ICPO (Waterloo, Canada 1990), 275–281

1989

  1. Hochstättler W, Kern W: Pseudomodular Matroid Matching, Combinatorica (1989) 9 2, 145–152

1988

  1. Hochstättler W: Matroid Matching in pseudomodularen Verbänden, Diplomarbeit, Universität zu Köln 1988
Formel Fluss Fliessband Fanos