Items where Author is "Hochstättler, Winfried"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 62.

Article

Blasum, Ulrich and Hochstättler, Winfried and Oertel, Peter and Woeginger, Gerhard J. (2007) Steiner-Diagrams and k-Star-Hubs.
Published in: Journal of Discrete Algorithms Vol. 5 (3). pp. 622-634.

Fuchs, Bernhard and Hochstättler, Winfried and Kern, Walter (2005) Online matching on a line.
Published in: Theoretical Computer Science Vol. 332 (1-3). pp. 251-264.

Epping, Thomas and Hochstättler, Winfried and Oertel, Peter (2004) Complexity Results on a Paint Shop Problem.
Published in: Discrete Applied Mathematics Vol. 136 (2-3). pp. 217-226.

Hochstättler, Winfried and Nesetril, Jaroslav (2000) A Note on MaxFlow-MinCut and Homomorphic Equivalence in Matroids.
Published in: Journal of algebraic combinatorics : an international journal Vol. 12 (3). pp. 295-300.

Hamacher, Anja and Hochstättler, Winfried and Moll, Christoph (2000) Tree Partitioning under Constraints -- Clustering for Vehicle Routing Problems.
Published in: Discrete Applied Mathematics Vol. 99 (1-3). pp. 55-69.

Fleiner, Tamas and Hochstättler, Winfried and Laurent, Monique and Loebl, Martin (1999) Cycle bases for lattices of matroids with no Fano dual minor and their one-element extensions.
Published in: Journal of Combinatorial Theory : Series B Vol. 77 (1). pp. 25-38.

Hochstättler, Winfried and Nesetril, Jaroslav (1999) Linear Programming Duality and Morphisms.
Published in: Commentationes mathematicae Universitatis Carolinae : CMUC Vol. 40 (3). pp. 577-592.

Blasum, Ulrich and Bussieck, M. and Hochstättler, Winfried and Moll, Christoph and Scheel, Hans-Helmut and Winter, Thomas (1999) Scheduling Trams in the Morning.
Published in: Mathematical Methods of Operations Research Vol. 49 (1). pp. 137-148.

Hayer, Matthias and Hochstättler, Winfried (1999) Test Sets for Vertex Cover Problems (Extended Abstract).
Published in: Electronic Notes in Discrete Mathematics Vol. 3. pp. 77-81.

Hochstättler, Winfried and Jackson, Bill (1998) Large Circuits in Binary Matroids of Large Cogirth: I.
Published in: Journal of Combinatorial Theory B Vol. 74 (1). pp. 35-52.

Hochstättler, Winfried and Jackson, Bill (1998) Large Circuits in Binary Matroids of Large Cogirth: II.
Published in: Journal of Combinatorial Theory B Vol. 74 (1). pp. 53-63.

Faigle, Ulrich and Fekete, Sandor P. and Hochstättler, Winfried and Kern, Walter (1998) The Nucleon of Cooperative Games and an Algorithm for Matching Games.
Published in: Mathematical Programming Vol. 83 (1-3). pp. 195-211.

Faigle, Ulrich and Fekete, Sandor P. and Hochstättler, Winfried and Kern, Walter (1998) On approximately fair cost allocation in Euclidean TSP games.
Published in: OR Spektrum Vol. 20 (1). pp. 29-37.

Hochstättler, Winfried (1997) A Lattice-Theoretical Characterization of Oriented Matroids.
Published in: European Journal of Combinatorics Vol. 18 (5). pp. 563-574.

Faigle, Ulrich and Fekete, Sandor P. and Hochstättler, Winfried and Kern, Walter (1997) On the Complexity of Testing Membership in the Core of Min-cost Spanning Tree Games.
Published in: International Journal of Game Theory Vol. 26 (3). pp. 361-366.

Hochstättler, Winfried and Kromberg, Stephan (1996) Adjoints and Duals of Matroids Linearly Representable over a Skew Field.
Published in: Mathematica Scandinavica Vol. 78. pp. 5-12.

Albers, Brita and Bachem, Achim and Heesen, Rainer and Hochstättler, Winfried (1996) Benchmarking und Leistungsvergleich in Filialnetzen großer Unternehmen.
Published in: Zeitschrift für Betriebswirtschaft Vol. 66. pp. 1313-1328.

Bachem, Achim and Hochstättler, Winfried and Steckemetz, Barthel and Volmer, Andreas (1996) Computational Experience with General Equilibrium Problems.
Published in: Computational optimization and applications Vol. 6 (3). pp. 213-225.

Hochstättler, Winfried and Kromberg, Stephan (1996) A Pseudoconfiguration of Points without Adjoint.
Published in: Journal of combinatorial theory : Series B Vol. 68 (2). pp. 277-294.

Bachem, Achim and Hochstättler, Winfried and Malich, Martin (1996) The Simulated Trading Heuristic for Solving Vehicle Routing Problems.
Published in: Discrete applied mathematics Vol. 65 (1-3). pp. 47-72.

Blasum, Ulrich and Hochstättler, Winfried and Moll, Christoph and Rieger, Heiko (1996) Using network-flow techniques to solve an optimization problem from surface-physics.
Published in: Journal of physics : A, Mathematical and theoretical Vol. 29 (18). L459-L463.

Hochstättler, Winfried and Tinhofer, Gottfried (1995) Hamiltonicity in Graphs with Few P4 s.
Published in: Computing Vol. 54 (3). pp. 213-225.

Alfter, Marion and Hochstättler, Winfried (1995) On Pseudomodular Matroids and Adjoints.
Published in: Discrete applied mathematics Vol. 60 (1-3). pp. 3-11.

Dress, Andreas and Hochstättler, Winfried and Kern, Walter (1994) Modular Substructures in Pseudomodular Lattices.
Published in: Mathematica Scandinavica Vol. 74. pp. 9-16.

Hochstättler, Winfried (1993) Nested Cones and Onion Skins.
Published in: Applied mathematics letters Vol. 6 (2). pp. 67-69.

Hochstättler, Winfried (1993) A Note on the Weak-Zone-Theorem.
Published in: Congressus Numerantium Vol. 98. pp. 95-103.

Bachem, Achim and Hochstättler, Winfried and Malich, Martin (1993) Simulated Trading - Eine kurze Einführung.
Published in: PARS-Mitteilungen Vol. 11. pp. 81-87.

Hochstättler, Winfried and Rieder, Jörg (1991) A Note on the Lattice of 2-Matroid-Intersections.
Published in: Archiv der Mathematik : ADM Vol. 57 (5). pp. 514-517.

Hochstättler, Winfried and Kern, Walter (1989) Matroid Matching in Pseudomodular Lattices.
Published in: Combinatorica : an international journal on combinatorics and the theory of computing Vol. 9 (2). pp. 145-152.

Collection Item

Schliep, Alexander and Hochstättler, Winfried (2002) Developing Gato and CATBox with Python: Teaching graph algorithms through visualization and experimentation.
Published in: Multimedia tools for communicating mathematics : [compression, simplification and multiresolution]. Springer 2002, pp. 291-310.

Proceedings article

Epping, Thomas and Hochstättler, Winfried and Oertel, Peter (2001) Some Results on a Paint Shop Problem for Words.
Published in: Electronic Notes in Discrete Mathematics 8 Elsevier 2001, pp. 31-33.

Hochstättler, Winfried and Mues, Christopher and Oertel, Peter (2000) Algorithmen für Speditionsroutingprobleme mit Umlademöglichkeit.
Published in: Logistik 2000plus : Herausforderungen, Trends, Konzepte ; 6. Magdeburger Logistik-Tagung, Magdeburg, 16./17. November 2000. Otto-von-Guericke-Universität Magdeburg, Lehrstuhl Betriebswirtschaftslehre, insbesondere Produktion und Logistik ..., Magdeburger Logistik - Logistik aus technischer und ökonomischer Sicht. LOGISCH 2000, pp. 38-51.

Hochstättler, Winfried and Loebl, Martin (1999) Bases of Cocycle Lattices and Submatrices of a Hadamard Matrix.
Published in: Contemporary trends in discrete mathematics : from DIMACS and DIMATIA to the future ; DIMATIA-DIMACS conference, May 19 - 25, 1997, Štiřín Castle, Czech Republic ; [contains papers from a DIMATIA/DIMACS Conference on the Future of Discrete Mathematics], DIMACS series in discrete mathematics and theoretical computer science. 49 American Mathematical Society (AMS). 49 American Mathematical Society (AMS) 1999, pp. 159-168.

Fekete, Sandor P. and Hochstättler, Winfried and Kromberg, Stephan and Moll, Christoph (1999) The Complexity of an Inverse Shortest Path Problem.
Published in: Contemporary trends in discrete mathematics : from DIMACS and DIMATIA to the future ; DIMATIA-DIMACS conference, May 19 - 25, 1997, Štiřín Castle, Czech Republic ; [contains papers from a DIMATIA/DIMACS Conference on the Future of Discrete Mathematics], DIMACS series in discrete mathematics and theoretical computer science. 49 American Mathematical Society (AMS) 1999, pp. 113-127.

Hochstättler, Winfried and Loebl, Martin and Moll, Christoph (1996) Generating Convex Polyominoes at Random.
Published in: Formal power series and algebraic combinatorics ; Conference proceedings ; 21 - 25 june 1993, Discrete mathematics. 153 Elsevier 1996, pp. 165-176.

Bachem, Achim and Hochstättler, Winfried and Malich, Martin (1994) Simulated Trading - A New Parallel Approach For Solving Vehicle Routing Problems.
Published in: Parallel computing : trends and applications ; proceedings of the International Conference ParCo93, Grenoble, France, 7 - 10 September, 1993, Advances in parallel computing. 9 North-Holland 1994, pp. 471-475.

Hochstättler, Winfried (1990) Shellability of Oriented Matroids.
Published in: Integer programming and combinatorial optimization : proceedings of a Conference held at the University of Waterloo, May 28 - 30 1990 Univ. of Waterloo Press 1990, pp. 275-282.

Monograph

Hochstättler, Winfried and Jin, Hui and Nickel, Robert (2005) The Hungarian Method for a Mixed Matching Market.
Technical Report , 13 p.

Hochstättler, Winfried and Nickel, Robert (2005) Note on an Auction Procedure for a Matching Game in Polynomial Time.
Technical Report , 7 p.

Hagemeier, Christian and Hochstättler, Winfried (2004) On a famliy of stars of maximal weight covering exactly k nodes.
Technical Report , 3 p.

Epping, Thomas and Hochstättler, Winfried (2001) Abuse of Multiple Sequence Alignment in a Paint Shop.
Technical Report , 9 p.

Schliep, Alexander and Hochstättler, Winfried and Pattberg, Torsten (2001) Rule-based Animation of Algorithms using Animated Data Structures in Gato.
Technical Report p.

Hochstättler, Winfried and Oertel, Peter (2000) The 5-Star-Hub-Problem is NP-complete.
Technical Report , 4 p.

Blasum, Ulrich and Hochstättler, Winfried (2000) Application of the Branch and Cut Method to the Vehicle Routing Problem.
Technical Report , 20 p.

Epping, Thomas and Hochstättler, Winfried and Oertel, Peter (2000) A Paint Shop Problem for Words.
Technical Report , 7 p.

Blasum, Ulrich and Hochstättler, Winfried and Oertel, Peter (1999) Steiner-Diagrams.
Technical Report , 8 p.

Hochstättler, Winfried (1997) About the Tic-Tac-Toe Matroid.
Technical Report , 5 p.

Hochstättler, Winfried (1997) Duality in Combinatorial Optimization -- Sometimes it Works, Sometimes it Won't.
Technical Report , 57 p.

Hochstättler, Winfried and Nesetril, Jaroslav (1997) Menger's Theorem as Morphism Duality.
Technical Report , 5 p.

Hochstättler, Winfried and Laurent, Monique and Loebl, Martin (1996) Cycle bases for lattices of matroids with no Fano dual minor and their one-element extensions.
Technical Report , 16 p.

Hochstättler, Winfried and Nesetril, Jaroslav (1996) Farkas' Lemma and Morphism Duality.
Technical Report , 12 p.

Hochstättler, Winfried (1996) Semidefinite Programmierung.
Technical Report , 95 p.

Hochstättler, Winfried and Loebl, Martin (1995) On Bases of Circuit Lattices.
Technical Report , 15 p.

Hochstättler, Winfried (1995) Oriented Matroids from Wild Spheres.
Technical Report , 14 p.

Hochstättler, Winfried and Schindler, Heike (1995) Recognizing P4-extendible graphs in linear time.
Technical Report , 13 p.

Hochstättler, Winfried and Kromberg, Stephan and Moll, Christoph (1994) A new Linear Time Algorithm for Computing the Convex Hull of a Simple Polygon in the Plane.
Technical Report , 12 p.

Gerards, Bert and Hochstättler, Winfried (1993) Onion Skins in Oriented Matroid.
Technical Report , 5 p.

Hochstättler, Winfried (1992) A Non-Visiting Path, Nested Cones and Onion Skins.
Technical Report , 8 p.

Bachem, Achim and Hochstättler, Winfried and Wenzel, Walter (1992) Sensitivity Analysis for General Equilibrium Problems.
Technical Report , 117 p.

Hochstättler, Winfried and Kromberg, Stephan and Moll, Christoph (1992) A Simple Proof of the Blossom Expansion Lemma.
Technical Report , 1 p.

Hochstättler, Winfried (1990) Vertex-Edge-Paths and a Forbidden Facet.
Technical Report , 6 p.

Thesis

Hochstättler, Winfried (1992) Seitenflächenverbände orientierter Matroide. PhD thesis.

This list was generated on Mon May 5 04:02:40 2014 CEST.