Winfried Hochstättler

Stephan Dominique Andres, Winfried Hochstättler: Perfect digraphs and a strong perfect digraph theorem. CTW 2013: 11-13

Stephan Dominique Andres, Winfried Hochstättler, Christiane Schallück: The game chromatic index of wheels. Discrete Applied Mathematics 159(16): 1660-1665 (2011)

Winfried Hochstättler, Robert Nickel: Joins of oriented matroids. Eur. J. Comb. 32(6): 841-852 (2011)

Stephan Dominique Andres, Winfried Hochstättler: The game chromatic number and the game colouring number of classes of oriented cactuses. Inf. Process. Lett. 111(5): 222-226 (2011)

Stephan Dominique Andres, Winfried Hochstättler: Some heuristics for the binary paint shop problem and their expected number of colour changes. J. Discrete Algorithms 9(2): 203-211 (2011)

Laura Chávez-Lomelí, Luis A. Goddyn, Winfried Hochstättler: Balancing Covectors. SIAM J. Discrete Math. 25(3): 1315-1318 (2011)

Steffen Hitzemann, Winfried Hochstättler: On the combinatorics of Galois numbers. Discrete Mathematics 310(24): 3551-3557 (2010)

Winfried Hochstättler, Robert Nickel: On the chromatic number of an oriented matroid. J. Comb. Theory, Ser. B 98(4): 698-706 (2008)

Thomas Epping, Winfried Hochstättler, Robert Nickel, Peter Oertel: Order sequencing in the automobile industry. Intelligente Systeme zur Entscheidungsunterstützung 2008: 49-66

Robert Nickel, Winfried Hochstättler: The flow lattice of oriented matroids. Contributions to Discrete Mathematics 2(1) (2007)

Annabell Berger, Winfried Hochstättler: Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors. Electronic Notes in Discrete Mathematics 28: 69-76 (2007)

Ulrich Blasum, Winfried Hochstättler, Peter Oertel, Gerhard J. Woeginger: Steiner diagrams and k-star hubs. J. Discrete Algorithms 5(3): 622-634 (2007)

Luis A. Goddyn, Petr Hlinený, Winfried Hochstättler: Balanced Signings and the Chromatic Number of Oriented Matroids. Combinatorics, Probability & Computing 15(4): 523-539 (2006)

Paul S. Bonsma, Thomas Epping, Winfried Hochstättler: Complexity results on restricted instances of a paint shop problem for words. Discrete Applied Mathematics 154(9): 1335-1343 (2006)

Winfried Hochstättler, Jaroslav Nesetril: Antisymmetric flows in matroids. Eur. J. Comb. 27(7): 1129-1134 (2006)

Winfried Hochstättler, Robert Nickel, Britta Peis: Two disjoint negative cycles in a signed graph. Electronic Notes in Discrete Mathematics 25: 107-111 (2006)

Winfried Hochstättler, Hui Jin, Robert Nickel: Note on an Auction Procedure for a Matching Game in Polynomial Time. AAIM 2006: 387-394

Bernhard Fuchs, Winfried Hochstättler, Walter Kern: Online matching on a line. Theor. Comput. Sci. 332(1-3): 251-264 (2005)

Thomas Epping, Winfried Hochstättler, Peter Oertel: Complexity results on a paint shop problem. Discrete Applied Mathematics 136(2-3): 217-226 (2004)

Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern: Note on the game chromatic index of trees. Theor. Comput. Sci. 303(3): 371-376 (2004)

Thomas Epping, Winfried Hochstättler: Shortest paths through two-tone pairs. Electronic Notes in Discrete Mathematics 13: 45-48 (2003)

Bernhard Fuchs, Winfried Hochstättler, Walter Kern: Online Matching On a Line. Electronic Notes in Discrete Mathematics 13: 49-51 (2003)

Thomas Epping, Winfried Hochstättler, Peter Oertel: Some Results on a Paint Shop Problem for Words. Electronic Notes in Discrete Mathematics 8: 31-33 (2001)

Anja Hamacher, Winfried Hochstättler, Christoph Moll: Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems. Discrete Applied Mathematics 99(1-3): 55-69 (2000)

Ulrich Blasum, Winfried Hochstättler, Peter Oertel: STEINER-Diagrams. Electronic Notes in Discrete Mathematics 3: 13-18 (1999)

M. Hayer, Winfried Hochstättler: Test Sets for Vertex Cover Problems. Electronic Notes in Discrete Mathematics 3: 77-81 (1999)

Tamás Fleiner, Winfried Hochstättler, Monique Laurent, Martin Loebl: Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions. J. Comb. Theory, Ser. B 77(1): 25-38 (1999)

Ulrich Blasum, Michael R. Bussieck, Winfried Hochstättler, Christoph Moll, Hans-Helmut Scheel, Thomas Winter: Scheduling trams in the morning. Math. Meth. of OR 49(1): 137-148 (1999)

Winfried Hochstättler, Bill Jackson: Large Circuits in Binary Matroids of Large Cogirth, I. J. Comb. Theory, Ser. B 74(1): 35-52 (1998)

Winfried Hochstättler, Bill Jackson: Large Circuits in Binary Matroids of Large Cogirth, II. J. Comb. Theory, Ser. B 74(1): 53-63 (1998)

Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler: The nucleon of cooperative games and an algorithm for matching games. Math. Program. 83: 195-211 (1998)

Winfried Hochstättler: A Lattice-theoretical Characterization of Oriented Matroids. Eur. J. Comb. 18(5): 563-574 (1997)

Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler: On the complexity of testing membership in the core of min-cost spanning tree games. Int. J. Game Theory 26(3): 361-366 (1997)

Achim Bachem, Winfried Hochstättler, Martin Malich: The Simulated Trading Heuristic for Solving Vehicle Routing Problems. Discrete Applied Mathematics 65(1-3): 47-72 (1996)

Winfried Hochstättler, Martin Loebl, Christoph Moll: Generating convex polyominoes at random. Discrete Mathematics 153(1-3): 165-176 (1996)

Winfried Hochstättler, S. Kromberg: A Pseudoconfiguration of Points without Adjoint. J. Comb. Theory, Ser. B 68(2): 277-294 (1996)

Winfried Hochstättler, Gottfried Tinhofer: Hamiltonicity in Graphs with Few P4's. Computing 54(3): 213-226 (1995)

Marion Alfter, Winfried Hochstättler: On Pseudomodular Matroids and Adjoints. Discrete Applied Mathematics 60(1-3): 3-11 (1995)

Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern: The Nucleon of Cooperative Games and an Algorithm for Matching Games. Electronic Colloquium on Computational Complexity (ECCC) 2(7) (1995)

Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern: On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games. Electronic Colloquium on Computational Complexity (ECCC) 2(12) (1995)

Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern: On Approximately Fair Cost Allocation in Euclidean TSP Games. Electronic Colloquium on Computational Complexity (ECCC) 2(16) (1995)

Achim Bachem, Winfried Hochstättler, Martin Malich: Simulated Trading - A New Parallel Approach for Solving Vehicle Routing Problems. PARCO 1993: 471-476

Winfried Hochstättler: Shellability of Oriented Matroids. IPCO 1990: 275-281

Winfried Hochstättler, Walter Kern: Matroid matching in pseudomodular lattices. Combinatorica 9(2): 145-152 (1989)