| 2008 |
|---|
| 34 | | Thomas Epping,
Winfried Hochstättler,
Robert Nickel,
Peter Oertel:
Order sequencing in the automobile industry.
Intelligente Systeme zur Entscheidungsunterstützung 2008: 49-66 |
| 33 | EE | Winfried Hochstättler,
Robert Nickel:
On the chromatic number of an oriented matroid.
J. Comb. Theory, Ser. B 98(4): 698-706 (2008) |
| 2007 |
|---|
| 32 | EE | 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) |
| 31 | EE | Ulrich Blasum,
Winfried Hochstättler,
Peter Oertel,
Gerhard J. Woeginger:
Steiner diagrams and k-star hubs.
J. Discrete Algorithms 5(3): 622-634 (2007) |
| 2006 |
|---|
| 30 | EE | Winfried Hochstättler,
Hui Jin,
Robert Nickel:
Note on an Auction Procedure for a Matching Game in Polynomial Time.
AAIM 2006: 387-394 |
| 29 | EE | 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) |
| 28 | EE | 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) |
| 27 | EE | Winfried Hochstättler,
Robert Nickel,
Britta Peis:
Two disjoint negative cycles in a signed graph.
Electronic Notes in Discrete Mathematics 25: 107-111 (2006) |
| 26 | EE | Winfried Hochstättler,
Jaroslav Nesetril:
Antisymmetric flows in matroids.
Eur. J. Comb. 27(7): 1129-1134 (2006) |
| 2005 |
|---|
| 25 | EE | Bernhard Fuchs,
Winfried Hochstättler,
Walter Kern:
Online matching on a line.
Theor. Comput. Sci. 332(1-3): 251-264 (2005) |
| 2004 |
|---|
| 24 | EE | Thomas Epping,
Winfried Hochstättler,
Peter Oertel:
Complexity results on a paint shop problem.
Discrete Applied Mathematics 136(2-3): 217-226 (2004) |
| 23 | EE | 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) |
| 2003 |
|---|
| 22 | EE | Thomas Epping,
Winfried Hochstättler:
Shortest paths through two-tone pairs.
Electronic Notes in Discrete Mathematics 13: 45-48 (2003) |
| 21 | EE | Bernhard Fuchs,
Winfried Hochstättler,
Walter Kern:
Online Matching On a Line.
Electronic Notes in Discrete Mathematics 13: 49-51 (2003) |
| 2001 |
|---|
| 20 | EE | 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) |
| 2000 |
|---|
| 19 | EE | 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) |
| 1999 |
|---|
| 18 | EE | Ulrich Blasum,
Winfried Hochstättler,
Peter Oertel:
STEINER-Diagrams.
Electronic Notes in Discrete Mathematics 3: 13-18 (1999) |
| 17 | EE | M. Hayer,
Winfried Hochstättler:
Test Sets for Vertex Cover Problems.
Electronic Notes in Discrete Mathematics 3: 77-81 (1999) |
| 16 | EE | 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) |
| 1998 |
|---|
| 15 | EE | Winfried Hochstättler,
Bill Jackson:
Large Circuits in Binary Matroids of Large Cogirth, I.
J. Comb. Theory, Ser. B 74(1): 35-52 (1998) |
| 14 | EE | Winfried Hochstättler,
Bill Jackson:
Large Circuits in Binary Matroids of Large Cogirth, II.
J. Comb. Theory, Ser. B 74(1): 53-63 (1998) |
| 13 | | 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) |
| 1997 |
|---|
| 12 | EE | Winfried Hochstättler:
A Lattice-theoretical Characterization of Oriented Matroids.
Eur. J. Comb. 18(5): 563-574 (1997) |
| 1996 |
|---|
| 11 | EE | 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) |
| 10 | EE | Winfried Hochstättler,
Martin Loebl,
Christoph Moll:
Generating convex polyominoes at random.
Discrete Mathematics 153(1-3): 165-176 (1996) |
| 9 | EE | Winfried Hochstättler,
S. Kromberg:
A Pseudoconfiguration of Points without Adjoint.
J. Comb. Theory, Ser. B 68(2): 277-294 (1996) |
| 1995 |
|---|
| 8 | EE | Winfried Hochstättler,
Gottfried Tinhofer:
Hamiltonicity in Graphs with Few P4's.
Computing 54(3): 213-226 (1995) |
| 7 | EE | Marion Alfter,
Winfried Hochstättler:
On Pseudomodular Matroids and Adjoints.
Discrete Applied Mathematics 60(1-3): 3-11 (1995) |
| 6 | EE | 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) |
| 5 | EE | 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) |
| 4 | EE | 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) |
| 1993 |
|---|
| 3 | | Achim Bachem,
Winfried Hochstättler,
Martin Malich:
Simulated Trading - A New Parallel Approach for Solving Vehicle Routing Problems.
PARCO 1993: 471-476 |
| 1990 |
|---|
| 2 | | Winfried Hochstättler:
Shellability of Oriented Matroids.
IPCO 1990: 275-281 |
| 1989 |
|---|
| 1 | | Winfried Hochstättler,
Walter Kern:
Matroid matching in pseudomodular lattices.
Combinatorica 9(2): 145-152 (1989) |
