Winfried Hochstättler

71 papers B 3C 2Journal 60Unranked 6
YearRankTypeTitle / Venue / Authors
2025 J jnl
The Signed Varchenko Determinant for Complexes of Oriented Matroids.
Comb.
Winfried Hochstättler, Sophia Keip, Kolja Knauer
2024 J jnl
A Classification of Mengerian 4-uniform Hypergraphs Derived from Graphs.
Ars Comb.
Winfried Hochstättler, Mehrdad Nasernejad
2024 J jnl
Lattice Path Bicircular Matroids.
Graphs Comb.
Santiago Guzmán-Pro, Winfried Hochstättler
2024 J jnl
Oriented cobicircular matroids are
Discret. Math.
Santiago Guzmán-Pro, Winfried Hochstättler
2023 B conf
An Efficient Computation of the Rank Function of a Positroid.
FCT
Lamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef
2022 J jnl
Colorings of oriented planar graphs avoiding a monochromatic subgraph.
Discret. Appl. Math.
Helena Bergold, Winfried Hochstättler, Raphael Steiner
2022 J jnl
The Neighborhood Polynomial of Chordal Graphs.
Discret. Math. Theor. Comput. Sci.
Helena Bergold, Winfried Hochstättler, Uwe Mayer
2022 J jnl
The star dichromatic number.
Discuss. Math. Graph Theory
Winfried Hochstättler, Raphael Steiner
2021 J jnl
In Memoriam Walter Kern.
Discret. Appl. Math.
Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still
2021 J jnl
The NL-flow polynomial.
Discret. Appl. Math.
Barbara Altenbokum, Winfried Hochstättler, Johanna Wiehe
2021 B conf
The Neighborhood Polynomial of Chordal Graphs.
WADS
Helena Bergold, Winfried Hochstättler, Uwe Mayer
2020 J jnl
A semi-strong perfect digraph theorem.
AKCE Int. J. Graphs Comb.
Stephan Dominique Andres, Helena Bergold, Winfried Hochstättler, Johanna Wiehe
2020 J jnl
Complete Acyclic Colorings.
Electron. J. Comb.
Stefan Felsner, Winfried Hochstättler, Kolja Knauer, Raphael Steiner
2020 J jnl
On the Complexity of Digraph Colourings and Vertex Arboricity.
Discret. Math. Theor. Comput. Sci.
Winfried Hochstättler, Felix Schröder, Raphael Steiner
2020 J jnl
The Neighborhood Polynomial of Chordal Graphs.
CoRR
Helena Bergold, Winfried Hochstättler, Uwe Mayer
2017 J jnl
A flow theory for the dichromatic number.
Eur. J. Comb.
Winfried Hochstättler
2017 J jnl
Sticky matroids and Kantor's Conjecture.
Electron. Notes Discret. Math.
Winfried Hochstättler, Michael Wilhelmi
2016 J jnl
Bicircular matroids are 3-colorable.
Discret. Math.
Luis A. Goddyn, Winfried Hochstättler, Nancy Ann Neudauer
2015 J jnl
Perfect digraphs.
J. Graph Theory
Stephan Dominique Andres, Winfried Hochstättler
2015 J jnl
The game colouring number of powers of forests.
Discret. Math. Theor. Comput. Sci.
Stephan Dominique Andres, Winfried Hochstättler
2015 J jnl
Towards a flow theory for the dichromatic number.
Electron. Notes Discret. Math.
Winfried Hochstättler
2014 J jnl
On a base exchange game on bispanning graphs.
Discret. Appl. Math.
Stephan Dominique Andres, Winfried Hochstättler, Markus Merkel
2013 C conf
Perfect digraphs and a strong perfect digraph theorem.
CTW
Stephan Dominique Andres, Winfried Hochstättler
2011 J jnl
Balancing Covectors.
SIAM J. Discret. Math.
Laura Chávez-Lomelí, Luis A. Goddyn, Winfried Hochstättler
2011 J jnl
Joins of oriented matroids.
Eur. J. Comb.
Winfried Hochstättler, Robert Nickel
2011 J jnl
Some heuristics for the binary paint shop problem and their expected number of colour changes.
J. Discrete Algorithms
Stephan Dominique Andres, Winfried Hochstättler
2011 J jnl
The game chromatic index of wheels.
Discret. Appl. Math.
Stephan Dominique Andres, Winfried Hochstättler, Christiane Schallück
2011 J jnl
The game chromatic number and the game colouring number of classes of oriented cactuses.
Inf. Process. Lett.
Stephan Dominique Andres, Winfried Hochstättler
2010 J jnl
On the combinatorics of Galois numbers.
Discret. Math.
Steffen Hitzemann, Winfried Hochstättler
2008 J jnl
On the chromatic number of an oriented matroid.
J. Comb. Theory B
Winfried Hochstättler, Robert Nickel
2008 — conf
Order sequencing in the automobile industry.
Intelligente Systeme zur Entscheidungsunterstützung
Thomas Epping, Winfried Hochstättler, Robert Nickel, Peter Oertel
2007 J jnl
Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors.
Electron. Notes Discret. Math.
Annabell Berger, Winfried Hochstättler
2007 J jnl
Steiner diagrams and k-star hubs.
J. Discrete Algorithms
Ulrich Blasum, Winfried Hochstättler, Peter Oertel, Gerhard J. Woeginger
2007 J jnl
The flow lattice of oriented matroids.
Contributions Discret. Math.
Robert Nickel, Winfried Hochstättler
2006 J jnl
Antisymmetric flows in matroids.
Eur. J. Comb.
Winfried Hochstättler, Jaroslav Nesetril
2006 J jnl
Balanced Signings and the Chromatic Number of Oriented Matroids.
Comb. Probab. Comput.
Luis A. Goddyn, Petr Hlinený, Winfried Hochstättler
2006 J jnl
Complexity results on restricted instances of a paint shop problem for words.
Discret. Appl. Math.
Paul S. Bonsma, Thomas Epping, Winfried Hochstättler
2006 C conf
Note on an Auction Procedure for a Matching Game in Polynomial Time.
AAIM
Winfried Hochstättler, Hui Jin, Robert Nickel
2006 J jnl
Two disjoint negative cycles in a signed graph.
Electron. Notes Discret. Math.
Winfried Hochstättler, Robert Nickel, Britta Peis
2005 J jnl
Online matching on a line.
Theor. Comput. Sci.
Bernhard Fuchs, Winfried Hochstättler, Walter Kern
2004 J jnl
Complexity results on a paint shop problem.
Discret. Appl. Math.
Thomas Epping, Winfried Hochstättler, Peter Oertel
2004 J jnl
Note on the game chromatic index of trees.
Theor. Comput. Sci.
Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern
2003 J jnl
Online Matching On a Line.
Electron. Notes Discret. Math.
Bernhard Fuchs, Winfried Hochstättler, Walter Kern
2003 J jnl
Shortest paths through two-tone pairs.
Electron. Notes Discret. Math.
Thomas Epping, Winfried Hochstättler
2002 — conf
MaxFlow-MinCut Duality for a Paint Shop Problem.
OR
Thomas Epping, Winfried Hochstättler, Marco E. Lübbecke
2002 — conf
Sorting with Line Storage Systems.
OR
Thomas Epping, Winfried Hochstättler
2001 J jnl
Some Results on a Paint Shop Problem for Words.
Electron. Notes Discret. Math.
Thomas Epping, Winfried Hochstättler, Peter Oertel
2000 J jnl
Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems.
Discret. Appl. Math.
Anja Hamacher, Winfried Hochstättler, Christoph Moll
1999 J jnl
Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions.
J. Comb. Theory B
Tamás Fleiner, Winfried Hochstättler, Monique Laurent, Martin Loebl
1999 J jnl
STEINER-Diagrams.
Electron. Notes Discret. Math.
Ulrich Blasum, Winfried Hochstättler, Peter Oertel
1999 J jnl
Scheduling trams in the morning.
Math. Methods Oper. Res.
Ulrich Blasum, Michael R. Bussieck, Winfried Hochstättler, Christoph Moll, Hans-Helmut Scheel, Thomas Winter
1999 J jnl
Test Sets for Vertex Cover Problems.
Electron. Notes Discret. Math.
M. Hayer, Winfried Hochstättler
1998 J jnl
Large Circuits in Binary Matroids of Large Cogirth, I.
J. Comb. Theory B
Winfried Hochstättler, Bill Jackson
1998 J jnl
Large Circuits in Binary Matroids of Large Cogirth, II.
J. Comb. Theory B
Winfried Hochstättler, Bill Jackson
1998 J jnl
The nucleon of cooperative games and an algorithm for matching games.
Math. Program.
Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler
1997 J jnl
A Lattice-theoretical Characterization of Oriented Matroids.
Eur. J. Comb.
Winfried Hochstättler
1997 — conf
Bases of cocycle lattices and submatrices of a Hadamard matrix.
Contemporary Trends in Discrete Mathematics
Winfried Hochstättler, Martin Loebl
1997 J jnl
On the complexity of testing membership in the core of min-cost spanning tree games.
Int. J. Game Theory
Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler
1997 — conf
The complexity of an inverse shortest paths problem.
Contemporary Trends in Discrete Mathematics
Sándor P. Fekete, Winfried Hochstättler, Stephan Kromberg, Christoph Moll
1996 J jnl
A Pseudoconfiguration of Points without Adjoint.
J. Comb. Theory, Ser. B
Winfried Hochstättler, Stephan Kromberg
1996 J jnl
Computational experience with general equilibrium problems.
Comput. Optim. Appl.
Achim Bachem, Winfried Hochstättler, Barthel Steckemetz, A. Volmer
1996 J jnl
Generating convex polyominoes at random.
Discret. Math.
Winfried Hochstättler, Martin Loebl, Christoph Moll
1996 J jnl
The Simulated Trading Heuristic for Solving Vehicle Routing Problems.
Discret. Appl. Math.
Achim Bachem, Winfried Hochstättler, Martin Malich
1995 J jnl
Hamiltonicity in Graphs with Few P4's.
Computing
Winfried Hochstättler, Gottfried Tinhofer
1995 J jnl
On Approximately Fair Cost Allocation in Euclidean TSP Games
Electron. Colloquium Comput. Complex.
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
1995 J jnl
On Pseudomodular Matroids and Adjoints.
Discret. Appl. Math.
Marion Alfter, Winfried Hochstättler
1995 J jnl
On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games
Electron. Colloquium Comput. Complex.
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
1995 J jnl
The Nucleon of Cooperative Games and an Algorithm for Matching Games
Electron. Colloquium Comput. Complex.
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
1993 — conf
Simulated Trading - A New Parallel Approach for Solving Vehicle Routing Problems.
PARCO
Achim Bachem, Winfried Hochstättler, Martin Malich
1990 B conf
Shellability of Oriented Matroids.
IPCO
Winfried Hochstättler
1989 J jnl
Matroid matching in pseudomodular lattices.
Comb.
Winfried Hochstättler, Walter Kern