Matroid matching in pseudomodular lattices. - Winfried Hochstättler; Walter Kern (Comb., 1989)

Shellability of Oriented Matroids. - Winfried Hochstättler (IPCO, 1990)

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

Hamiltonicity in Graphs with Few P4's. - Winfried Hochstättler; Gottfried Tinhofer (Computing, 1995)

On Pseudomodular Matroids and Adjoints. - Marion Alfter; Winfried Hochstättler (Discret. Appl. Math., 1995)

The Nucleon of Cooperative Games and an Algorithm for Matching Games - Ulrich Faigle; Sándor P. Fekete; Winfried Hochstättler; Walter Kern (Electron. Colloquium Comput. Complex., 1995)

On Approximately Fair Cost Allocation in Euclidean TSP Games - Ulrich Faigle; Sándor P. Fekete; Winfried Hochstättler; Walter Kern (Electron. Colloquium Comput. Complex., 1995)

Computational experience with general equilibrium problems. - Achim Bachem; Winfried Hochstättler; Barthel Steckemetz; A. Volmer (Comput. Optim. Appl., 1996)

The Simulated Trading Heuristic for Solving Vehicle Routing Problems. - Achim Bachem; Winfried Hochstättler; Martin Malich (Discret. Appl. Math., 1996)

Generating convex polyominoes at random. - Winfried Hochstättler; Martin Loebl; Christoph Moll (Discret. Math., 1996)

A Pseudoconfiguration of Points without Adjoint. - Winfried Hochstättler; Stephan Kromberg (J. Comb. Theory, Ser. B, 1996)

The complexity of an inverse shortest paths problem. - Sándor P. Fekete; Winfried Hochstättler; Stephan Kromberg; Christoph Moll (Contemporary Trends in Discrete Mathematics, 1997)

Bases of cocycle lattices and submatrices of a Hadamard matrix. - Winfried Hochstättler; Martin Loebl (Contemporary Trends in Discrete Mathematics, 1997)

A Lattice-theoretical Characterization of Oriented Matroids. - Winfried Hochstättler (Eur. J. Comb., 1997)

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

Large Circuits in Binary Matroids of Large Cogirth, I. - Winfried Hochstättler; Bill Jackson (J. Comb. Theory B, 1998)

Large Circuits in Binary Matroids of Large Cogirth, II. - Winfried Hochstättler; Bill Jackson (J. Comb. Theory B, 1998)

STEINER-Diagrams. - Ulrich Blasum; Winfried Hochstättler; Peter Oertel (Electron. Notes Discret. Math., 1999)

Test Sets for Vertex Cover Problems. - M. Hayer; Winfried Hochstättler (Electron. Notes Discret. Math., 1999)

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

Scheduling trams in the morning. - Ulrich Blasum; Michael R. Bussieck; Winfried Hochstättler; Christoph Moll; Hans-Helmut Scheel; Thomas Winter (Math. Methods Oper. Res., 1999)

Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems. - Anja Hamacher; Winfried Hochstättler; Christoph Moll (Discret. Appl. Math., 2000)

Some Results on a Paint Shop Problem for Words. - Thomas Epping; Winfried Hochstättler; Peter Oertel (Electron. Notes Discret. Math., 2001)

Sorting with Line Storage Systems. - Thomas Epping; Winfried Hochstättler (OR, 2002)

MaxFlow-MinCut Duality for a Paint Shop Problem. - Thomas Epping; Winfried Hochstättler; Marco E. Lübbecke (OR, 2002)

Shortest paths through two-tone pairs. - Thomas Epping; Winfried Hochstättler (Electron. Notes Discret. Math., 2003)

Complexity results on a paint shop problem. - Thomas Epping; Winfried Hochstättler; Peter Oertel (Discret. Appl. Math., 2004)

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

Online matching on a line. - Bernhard Fuchs; Winfried Hochstättler; Walter Kern (Theor. Comput. Sci., 2005)

Note on an Auction Procedure for a Matching Game in Polynomial Time. - Winfried Hochstättler; Hui Jin 002; Robert Nickel (AAIM, 2006)

Balanced Signings and the Chromatic Number of Oriented Matroids. - Luis A. Goddyn; Petr Hlinený; Winfried Hochstättler (Comb. Probab. Comput., 2006)

Complexity results on restricted instances of a paint shop problem for words. - Paul S. Bonsma; Thomas Epping; Winfried Hochstättler (Discret. Appl. Math., 2006)

Antisymmetric flows in matroids. - Winfried Hochstättler; Jaroslav Nesetril (Eur. J. Comb., 2006)

Two disjoint negative cycles in a signed graph. - Winfried Hochstättler; Robert Nickel; Britta Peis (Electron. Notes Discret. Math., 2006)

The flow lattice of oriented matroids. - Robert Nickel; Winfried Hochstättler (Contributions Discret. Math., 2007)

Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors. - Annabell Berger; Winfried Hochstättler (Electron. Notes Discret. Math., 2007)

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

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

On the chromatic number of an oriented matroid. - Winfried Hochstättler; Robert Nickel (J. Comb. Theory B, 2008)

On the combinatorics of Galois numbers. - Steffen Hitzemann; Winfried Hochstättler (Discret. Math., 2010)

The game chromatic index of wheels. - Stephan Dominique Andres; Winfried Hochstättler; Christiane Schallück (Discret. Appl. Math., 2011)

Joins of oriented matroids. - Winfried Hochstättler; Robert Nickel (Eur. J. Comb., 2011)

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

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

Balancing Covectors. - Laura Chávez-Lomelí; Luis A. Goddyn; Winfried Hochstättler (SIAM J. Discret. Math., 2011)

Perfect digraphs and a strong perfect digraph theorem. - Stephan Dominique Andres; Winfried Hochstättler (CTW, 2013)

On a base exchange game on bispanning graphs. - Stephan Dominique Andres; Winfried Hochstättler; Markus Merkel (Discret. Appl. Math., 2014)

The game colouring number of powers of forests. - Stephan Dominique Andres; Winfried Hochstättler (Discret. Math. Theor. Comput. Sci., 2015)

Towards a flow theory for the dichromatic number. - Winfried Hochstättler (Electron. Notes Discret. Math., 2015)

Perfect digraphs. - Stephan Dominique Andres; Winfried Hochstättler (J. Graph Theory, 2015)

Bicircular matroids are 3-colorable. - Luis A. Goddyn; Winfried Hochstättler; Nancy Ann Neudauer (Discret. Math., 2016)

A flow theory for the dichromatic number. - Winfried Hochstättler (Eur. J. Comb., 2017)

Sticky matroids and Kantor's Conjecture. - Winfried Hochstättler; Michael Wilhelmi (Electron. Notes Discret. Math., 2017)

A semi-strong perfect digraph theorem. - Stephan Dominique Andres; Helena Bergold; Winfried Hochstättler; Johanna Wiehe (AKCE Int. J. Graphs Comb., 2020)

Complete Acyclic Colorings. - Stefan Felsner; Winfried Hochstättler; Kolja Knauer; Raphael Steiner (Electron. J. Comb., 2020)

On the Complexity of Digraph Colourings and Vertex Arboricity. - Winfried Hochstättler; Felix Schröder; Raphael Steiner (Discret. Math. Theor. Comput. Sci., 2020)

The NL-flow polynomial. - Barbara Altenbokum; Winfried Hochstättler; Johanna Wiehe (Discret. Appl. Math., 2021)

In Memoriam Walter Kern. - Winfried Hochstättler; Johann L. Hurink; Bodo Manthey; Daniël Paulusma; Britta Peis; Georg Still (Discret. Appl. Math., 2021)

Colorings of oriented planar graphs avoiding a monochromatic subgraph. - Helena Bergold; Winfried Hochstättler; Raphael Steiner (Discret. Appl. Math., 2022)

The star dichromatic number. - Winfried Hochstättler; Raphael Steiner (Discuss. Math. Graph Theory, 2022)

The Neighborhood Polynomial of Chordal Graphs. - Helena Bergold; Winfried Hochstättler; Uwe Mayer (Discret. Math. Theor. Comput. Sci., 2022)

An Efficient Computation of the Rank Function of a Positroid. - Lamar Chidiac; Santiago Guzmán-Pro; Winfried Hochstättler; Anthony Youssef (FCT, 2023)

A Classification of Mengerian 4-uniform Hypergraphs Derived from Graphs. - Winfried Hochstättler; Mehrdad Nasernejad (Ars Comb., 2024)

Oriented cobicircular matroids are GSP. - Santiago Guzmán-Pro; Winfried Hochstättler (Discret. Math., 2024)

Lattice Path Bicircular Matroids. - Santiago Guzmán-Pro; Winfried Hochstättler (Graphs Comb., 2024)

The Signed Varchenko Determinant for Complexes of Oriented Matroids. - Winfried Hochstättler; Sophia Keip; Kolja Knauer (Comb., 2025)