| 2013 | ||
|---|---|---|
| c5 | Stephan Dominique Andres, Winfried Hochstättler: Perfect digraphs and a strong perfect digraph theorem. CTW 2013: 11-13 | |
| 2011 | ||
| j36 | Stephan Dominique Andres, Winfried Hochstättler, Christiane Schallück: The game chromatic index of wheels. Discrete Applied Mathematics 159(16): 1660-1665 (2011) | |
| j35 | Winfried Hochstättler, Robert Nickel: Joins of oriented matroids. Eur. J. Comb. 32(6): 841-852 (2011) | |
| j34 | 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) | |
| j33 | 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) | |
| j32 | Laura Chávez-Lomelí, Luis A. Goddyn, Winfried Hochstättler: Balancing Covectors. SIAM J. Discrete Math. 25(3): 1315-1318 (2011) | |
| 2010 | ||
| j31 | Steffen Hitzemann, Winfried Hochstättler: On the combinatorics of Galois numbers. Discrete Mathematics 310(24): 3551-3557 (2010) | |
| 2008 | ||
| j30 | Winfried Hochstättler, Robert Nickel: On the chromatic number of an oriented matroid. J. Comb. Theory, Ser. B 98(4): 698-706 (2008) | |
| c4 | Thomas Epping, Winfried Hochstättler, Robert Nickel, Peter Oertel: Order sequencing in the automobile industry. Intelligente Systeme zur Entscheidungsunterstützung 2008: 49-66 | |
| 2007 | ||
| j29 | Robert Nickel, Winfried Hochstättler: The flow lattice of oriented matroids. Contributions to Discrete Mathematics 2(1) (2007) | |
| j28 | 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) | |
| j27 | 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 | ||
| j26 | 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) | |
| j25 | 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) | |
| j24 | Winfried Hochstättler, Jaroslav Nesetril: Antisymmetric flows in matroids. Eur. J. Comb. 27(7): 1129-1134 (2006) | |
| j23 | Winfried Hochstättler, Robert Nickel, Britta Peis: Two disjoint negative cycles in a signed graph. Electronic Notes in Discrete Mathematics 25: 107-111 (2006) | |
| c3 | Winfried Hochstättler, Hui Jin, Robert Nickel: Note on an Auction Procedure for a Matching Game in Polynomial Time. AAIM 2006: 387-394 | |
| 2005 | ||
| j22 | Bernhard Fuchs, Winfried Hochstättler, Walter Kern: Online matching on a line. Theor. Comput. Sci. 332(1-3): 251-264 (2005) | |
| 2004 | ||
| j21 | Thomas Epping, Winfried Hochstättler, Peter Oertel: Complexity results on a paint shop problem. Discrete Applied Mathematics 136(2-3): 217-226 (2004) | |
| j20 | 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 | ||
| j19 | Thomas Epping, Winfried Hochstättler: Shortest paths through two-tone pairs. Electronic Notes in Discrete Mathematics 13: 45-48 (2003) | |
| j18 | Bernhard Fuchs, Winfried Hochstättler, Walter Kern: Online Matching On a Line. Electronic Notes in Discrete Mathematics 13: 49-51 (2003) | |
| 2001 | ||
| j17 | 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 | ||
| j16 | 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 | ||
| j15 | Ulrich Blasum, Winfried Hochstättler, Peter Oertel: STEINER-Diagrams. Electronic Notes in Discrete Mathematics 3: 13-18 (1999) | |
| j14 | M. Hayer, Winfried Hochstättler: Test Sets for Vertex Cover Problems. Electronic Notes in Discrete Mathematics 3: 77-81 (1999) | |
| j13 | 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) | |
| j12 | 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) | |
| 1998 | ||
| j11 | Winfried Hochstättler, Bill Jackson: Large Circuits in Binary Matroids of Large Cogirth, I. J. Comb. Theory, Ser. B 74(1): 35-52 (1998) | |
| j10 | Winfried Hochstättler, Bill Jackson: Large Circuits in Binary Matroids of Large Cogirth, II. J. Comb. Theory, Ser. B 74(1): 53-63 (1998) | |
| j9 | 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 | ||
| j8 | Winfried Hochstättler: A Lattice-theoretical Characterization of Oriented Matroids. Eur. J. Comb. 18(5): 563-574 (1997) | |
| j7 | 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) | |
| 1996 | ||
| j6 | 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) | |
| j5 | Winfried Hochstättler, Martin Loebl, Christoph Moll: Generating convex polyominoes at random. Discrete Mathematics 153(1-3): 165-176 (1996) | |
| j4 | Winfried Hochstättler, S. Kromberg: A Pseudoconfiguration of Points without Adjoint. J. Comb. Theory, Ser. B 68(2): 277-294 (1996) | |
| 1995 | ||
| j3 | Winfried Hochstättler, Gottfried Tinhofer: Hamiltonicity in Graphs with Few P4's. Computing 54(3): 213-226 (1995) | |
| j2 | Marion Alfter, Winfried Hochstättler: On Pseudomodular Matroids and Adjoints. Discrete Applied Mathematics 60(1-3): 3-11 (1995) | |
| i3 | 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) | |
| i2 | 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) | |
| i1 | 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) | |
| 1993 | ||
| c2 | Achim Bachem, Winfried Hochstättler, Martin Malich: Simulated Trading - A New Parallel Approach for Solving Vehicle Routing Problems. PARCO 1993: 471-476 | |
| 1990 | ||
| c1 | ||
| 1989 | ||
| j1 | Winfried Hochstättler, Walter Kern: Matroid matching in pseudomodular lattices. Combinatorica 9(2): 145-152 (1989) | |
Colors in the list of coauthors
Last update Tue May 21 11:46:58 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page