The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Winfried Hochstättler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Winfried Hochstättler, Hui Jin 0002, Robert Nickel
    Note on an Auction Procedure for a Matching Game in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:387-394 [Conf]
  2. Winfried Hochstättler
    Shellability of Oriented Matroids. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:275-281 [Conf]
  3. Achim Bachem, Winfried Hochstättler, Martin Malich
    Simulated Trading - A New Parallel Approach for Solving Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP]
    PARCO, 1993, pp:471-476 [Conf]
  4. Winfried Hochstättler, Walter Kern
    Matroid matching in pseudomodular lattices. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:2, pp:145-152 [Journal]
  5. Winfried Hochstättler, Gottfried Tinhofer
    Hamiltonicity in Graphs with Few P4's. [Citation Graph (0, 0)][DBLP]
    Computing, 1995, v:54, n:3, pp:213-226 [Journal]
  6. Marion Alfter, Winfried Hochstättler
    On Pseudomodular Matroids and Adjoints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:3-11 [Journal]
  7. Achim Bachem, Winfried Hochstättler, Martin Malich
    The Simulated Trading Heuristic for Solving Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:47-72 [Journal]
  8. Thomas Epping, Winfried Hochstättler, Peter Oertel
    Complexity results on a paint shop problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:217-226 [Journal]
  9. Anja Hamacher, Winfried Hochstättler, Christoph Moll
    Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:55-69 [Journal]
  10. Paul S. Bonsma, Thomas Epping, Winfried Hochstättler
    Complexity results on restricted instances of a paint shop problem for words. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:9, pp:1335-1343 [Journal]
  11. Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
    The Nucleon of Cooperative Games and an Algorithm for Matching Games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:7, pp:- [Journal]
  12. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:12, pp:- [Journal]
  13. Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
    On Approximately Fair Cost Allocation in Euclidean TSP Games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:16, pp:- [Journal]
  14. Winfried Hochstättler
    A Lattice-theoretical Characterization of Oriented Matroids. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:5, pp:563-574 [Journal]
  15. Winfried Hochstättler, Jaroslav Nesetril
    Antisymmetric flows in matroids. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1129-1134 [Journal]
  16. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:25-38 [Journal]
  17. Winfried Hochstättler, Bill Jackson
    Large Circuits in Binary Matroids of Large Cogirth, I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:1, pp:35-52 [Journal]
  18. Winfried Hochstättler, Bill Jackson
    Large Circuits in Binary Matroids of Large Cogirth, II. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:1, pp:53-63 [Journal]
  19. Winfried Hochstättler, S. Kromberg
    A Pseudoconfiguration of Points without Adjoint. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:68, n:2, pp:277-294 [Journal]
  20. Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler
    The nucleon of cooperative games and an algorithm for matching games. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:83, n:, pp:195-211 [Journal]
  21. Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern
    Note on the game chromatic index of trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:371-376 [Journal]
  22. Bernhard Fuchs, Winfried Hochstättler, Walter Kern
    Online matching on a line. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:251-264 [Journal]
  23. Winfried Hochstättler, Martin Loebl, Christoph Moll
    Generating convex polyominoes at random. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:153, n:1-3, pp:165-176 [Journal]

  24. Order sequencing in the automobile industry. [Citation Graph (, )][DBLP]


  25. Balanced Signings and the Chromatic Number of Oriented Matroids. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002