Winfried Hochstättler

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 16

Top Topics

Efficient Computation

Graph Theoretic

Top Venues

Discret. Appl. Math.

Discret. Math. Theor. Comput. Sci.

Electron. Notes Discret. Math.

Publications

Santiago Guzmán-Pro, Winfried Hochstättler
Lattice Path Bicircular Matroids. Graphs Comb. 40 (1) (2024)
Santiago Guzmán-Pro, Winfried Hochstättler
. Discret. Math. 347 (1) (2024)
Lamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef
An Efficient Computation of the Rank Function of a Positroid. FCT (2023)
Helena Bergold, Winfried Hochstättler, Uwe Mayer
The Neighborhood Polynomial of Chordal Graphs. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Helena Bergold, Winfried Hochstättler, Raphael Steiner
Colorings of oriented planar graphs avoiding a monochromatic subgraph. Discret. Appl. Math. 320 (2022)
Winfried Hochstättler, Raphael Steiner
The star dichromatic number. Discuss. Math. Graph Theory 42 (1) (2022)
Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still
In Memoriam Walter Kern. Discret. Appl. Math. 303 (2021)
Helena Bergold, Winfried Hochstättler, Uwe Mayer
The Neighborhood Polynomial of Chordal Graphs. WADS (2021)
Barbara Altenbokum, Winfried Hochstättler, Johanna Wiehe
The NL-flow polynomial. Discret. Appl. Math. 296 (2021)
Stefan Felsner, Winfried Hochstättler, Kolja Knauer, Raphael Steiner
Complete Acyclic Colorings. Electron. J. Comb. 27 (2) (2020)
Helena Bergold, Winfried Hochstättler, Uwe Mayer
The Neighborhood Polynomial of Chordal Graphs. CoRR (2020)
Winfried Hochstättler, Felix Schröder, Raphael Steiner
On the Complexity of Digraph Colourings and Vertex Arboricity. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
Stephan Dominique Andres, Helena Bergold, Winfried Hochstättler, Johanna Wiehe
A semi-strong perfect digraph theorem. AKCE Int. J. Graphs Comb. 17 (3) (2020)
Winfried Hochstättler
A flow theory for the dichromatic number. Eur. J. Comb. 66 (2017)
Winfried Hochstättler, Michael Wilhelmi
Sticky matroids and Kantor's Conjecture. Electron. Notes Discret. Math. 61 (2017)
Luis A. Goddyn, Winfried Hochstättler, Nancy Ann Neudauer
Bicircular matroids are 3-colorable. Discret. Math. 339 (5) (2016)
Stephan Dominique Andres, Winfried Hochstättler
The game colouring number of powers of forests. Discret. Math. Theor. Comput. Sci. 18 (1) (2015)
Stephan Dominique Andres, Winfried Hochstättler
Perfect digraphs. J. Graph Theory 79 (1) (2015)
Winfried Hochstättler
Towards a flow theory for the dichromatic number. Electron. Notes Discret. Math. 49 (2015)
Stephan Dominique Andres, Winfried Hochstättler, Markus Merkel
On a base exchange game on bispanning graphs. Discret. Appl. Math. 165 (2014)
Stephan Dominique Andres, Winfried Hochstättler
Perfect digraphs and a strong perfect digraph theorem. CTW (2013)
Winfried Hochstättler, Robert Nickel
Joins of oriented matroids. Eur. J. Comb. 32 (6) (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) (2011)
Laura Chávez-Lomelí, Luis A. Goddyn, Winfried Hochstättler
Balancing Covectors. SIAM J. Discret. Math. 25 (3) (2011)
Stephan Dominique Andres, Winfried Hochstättler, Christiane Schallück
The game chromatic index of wheels. Discret. Appl. Math. 159 (16) (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) (2011)
Steffen Hitzemann, Winfried Hochstättler
On the combinatorics of Galois numbers. Discret. Math. 310 (24) (2010)
Thomas Epping, Winfried Hochstättler, Robert Nickel, Peter Oertel
Order sequencing in the automobile industry. Intelligente Systeme zur Entscheidungsunterstützung (2008)
Winfried Hochstättler, Robert Nickel
On the chromatic number of an oriented matroid. J. Comb. Theory, Ser. B 98 (4) (2008)
Annabell Berger, Winfried Hochstättler
Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors. Electron. Notes Discret. Math. 28 (2007)
Ulrich Blasum, Winfried Hochstättler, Peter Oertel, Gerhard J. Woeginger
Steiner diagrams and k-star hubs. J. Discrete Algorithms 5 (3) (2007)
Robert Nickel, Winfried Hochstättler
The flow lattice of oriented matroids. Contributions Discret. Math. 2 (1) (2007)
Luis A. Goddyn, Petr Hlinený, Winfried Hochstättler
Balanced Signings and the Chromatic Number of Oriented Matroids. Comb. Probab. Comput. 15 (4) (2006)
Winfried Hochstättler, Hui Jin, Robert Nickel
Note on an Auction Procedure for a Matching Game in Polynomial Time. AAIM (2006)
Winfried Hochstättler, Jaroslav Nesetril
Antisymmetric flows in matroids. Eur. J. Comb. 27 (7) (2006)
Paul S. Bonsma, Thomas Epping, Winfried Hochstättler
Complexity results on restricted instances of a paint shop problem for words. Discret. Appl. Math. 154 (9) (2006)
Winfried Hochstättler, Robert Nickel, Britta Peis
Two disjoint negative cycles in a signed graph. Electron. Notes Discret. Math. 25 (2006)
Bernhard Fuchs, Winfried Hochstättler, Walter Kern
Online matching on a line. Theor. Comput. Sci. 332 (1-3) (2005)
Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern
Note on the game chromatic index of trees. Theor. Comput. Sci. 313 (3) (2004)
Thomas Epping, Winfried Hochstättler, Peter Oertel
Complexity results on a paint shop problem. Discret. Appl. Math. 136 (2-3) (2004)
Thomas Epping, Winfried Hochstättler
Shortest paths through two-tone pairs. Electron. Notes Discret. Math. 13 (2003)
Bernhard Fuchs, Winfried Hochstättler, Walter Kern
Online Matching On a Line. Electron. Notes Discret. Math. 13 (2003)
Thomas Epping, Winfried Hochstättler
Sorting with Line Storage Systems. OR (2002)
Thomas Epping, Winfried Hochstättler, Marco E. Lübbecke
MaxFlow-MinCut Duality for a Paint Shop Problem. OR (2002)
Thomas Epping, Winfried Hochstättler, Peter Oertel
Some Results on a Paint Shop Problem for Words. Electron. Notes Discret. Math. 8 (2001)
Anja Hamacher, Winfried Hochstättler, Christoph Moll
Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems. Discret. Appl. Math. 99 (1-3) (2000)
Ulrich Blasum, Michael R. Bussieck, Winfried Hochstättler, Christoph Moll, Hans-Helmut Scheel, Thomas Winter
Scheduling trams in the morning. Math. Methods Oper. Res. 49 (1) (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) (1999)
Ulrich Blasum, Winfried Hochstättler, Peter Oertel
STEINER-Diagrams. Electron. Notes Discret. Math. 3 (1999)
M. Hayer, Winfried Hochstättler
Test Sets for Vertex Cover Problems. Electron. Notes Discret. Math. 3 (1999)
Winfried Hochstättler, Bill Jackson
Large Circuits in Binary Matroids of Large Cogirth, I. J. Comb. Theory, Ser. B 74 (1) (1998)
Winfried Hochstättler, Bill Jackson
Large Circuits in Binary Matroids of Large Cogirth, II. J. Comb. Theory, Ser. B 74 (1) (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 (1998)
Winfried Hochstättler, Martin Loebl
Bases of cocycle lattices and submatrices of a Hadamard matrix. Contemporary Trends in Discrete Mathematics (1997)
Sándor P. Fekete, Winfried Hochstättler, Stephan Kromberg, Christoph Moll
The complexity of an inverse shortest paths problem. Contemporary Trends in Discrete Mathematics (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) (1997)
Winfried Hochstättler
A Lattice-theoretical Characterization of Oriented Matroids. Eur. J. Comb. 18 (5) (1997)
Achim Bachem, Winfried Hochstättler, Martin Malich
The Simulated Trading Heuristic for Solving Vehicle Routing Problems. Discret. Appl. Math. 65 (1-3) (1996)
Winfried Hochstättler, Stephan Kromberg
A Pseudoconfiguration of Points without Adjoint. J. Comb. Theory, Ser. B 68 (2) (1996)
Winfried Hochstättler, Martin Loebl, Christoph Moll
Generating convex polyominoes at random. Discret. Math. 153 (1-3) (1996)
Achim Bachem, Winfried Hochstättler, Barthel Steckemetz, A. Volmer
Computational experience with general equilibrium problems. Comput. Optim. Appl. 6 (3) (1996)
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
On Approximately Fair Cost Allocation in Euclidean TSP Games Electron. Colloquium Comput. Complex. 2 (16) (1995)
Marion Alfter, Winfried Hochstättler
On Pseudomodular Matroids and Adjoints. Discret. Appl. Math. 60 (1-3) (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 Electron. Colloquium Comput. Complex. 2 (12) (1995)
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
The Nucleon of Cooperative Games and an Algorithm for Matching Games Electron. Colloquium Comput. Complex. 2 (7) (1995)
Winfried Hochstättler, Gottfried Tinhofer
Hamiltonicity in Graphs with Few P4's. Computing 54 (3) (1995)
Achim Bachem, Winfried Hochstättler, Martin Malich
Simulated Trading - A New Parallel Approach for Solving Vehicle Routing Problems. PARCO (1993)
Winfried Hochstättler
Shellability of Oriented Matroids. IPCO (1990)
Winfried Hochstättler, Walter Kern
Matroid matching in pseudomodular lattices. Comb. 9 (2) (1989)