default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWinfried Hochstättler
Person information
- affiliation: University of Hagen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j55]Winfried Hochstättler, Sophia Keip, Kolja Knauer:
The Signed Varchenko Determinant for Complexes of Oriented Matroids. Comb. 45(2): 19 (2025)- 2024
- [j54]Santiago Guzmán-Pro
, Winfried Hochstättler:
Oriented cobicircular matroids are GSP. Discret. Math. 347(1): 113686 (2024) - [j53]Santiago Guzmán-Pro, Winfried Hochstättler:
Lattice Path Bicircular Matroids. Graphs Comb. 40(1): 21 (2024) - 2023
- [c10]Lamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef:
An Efficient Computation of the Rank Function of a Positroid. FCT 2023: 147-161 - 2022
- [j52]Helena Bergold, Winfried Hochstättler, Raphael Steiner:
Colorings of oriented planar graphs avoiding a monochromatic subgraph. Discret. Appl. Math. 320: 81-94 (2022) - [j51]Winfried Hochstättler, Raphael Steiner:
The star dichromatic number. Discuss. Math. Graph Theory 42(1): 277-298 (2022) - [j50]Helena Bergold, Winfried Hochstättler, Uwe Mayer:
The Neighborhood Polynomial of Chordal Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - 2021
- [j49]Barbara Altenbokum, Winfried Hochstättler, Johanna Wiehe:
The NL-flow polynomial. Discret. Appl. Math. 296: 193-202 (2021) - [j48]Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still:
In Memoriam Walter Kern. Discret. Appl. Math. 303: 2-3 (2021) - [c9]Helena Bergold, Winfried Hochstättler, Uwe Mayer:
The Neighborhood Polynomial of Chordal Graphs. WADS 2021: 158-171 - 2020
- [j47]Stephan Dominique Andres, Helena Bergold, Winfried Hochstättler, Johanna Wiehe:
A semi-strong perfect digraph theorem. AKCE Int. J. Graphs Comb. 17(3): 992-994 (2020) - [j46]Stefan Felsner, Winfried Hochstättler, Kolja Knauer, Raphael Steiner:
Complete Acyclic Colorings. Electron. J. Comb. 27(2): 2 (2020) - [j45]Winfried Hochstättler, Felix Schröder, Raphael Steiner:
On the Complexity of Digraph Colourings and Vertex Arboricity. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [i5]Helena Bergold, Winfried Hochstättler, Uwe Mayer:
The Neighborhood Polynomial of Chordal Graphs. CoRR abs/2008.08349 (2020)
2010 – 2019
- 2017
- [j44]Winfried Hochstättler:
A flow theory for the dichromatic number. Eur. J. Comb. 66: 160-167 (2017) - [j43]Winfried Hochstättler, Michael Wilhelmi:
Sticky matroids and Kantor's Conjecture. Electron. Notes Discret. Math. 61: 601-606 (2017) - 2016
- [j42]Luis A. Goddyn, Winfried Hochstättler, Nancy Ann Neudauer:
Bicircular matroids are 3-colorable. Discret. Math. 339(5): 1425-1429 (2016) - 2015
- [j41]Stephan Dominique Andres, Winfried Hochstättler:
The game colouring number of powers of forests. Discret. Math. Theor. Comput. Sci. 18(1) (2015) - [j40]Winfried Hochstättler:
Towards a flow theory for the dichromatic number. Electron. Notes Discret. Math. 49: 101-106 (2015) - [j39]Stephan Dominique Andres, Winfried Hochstättler:
Perfect digraphs. J. Graph Theory 79(1): 21-29 (2015) - 2014
- [j38]Stephan Dominique Andres, Winfried Hochstättler, Markus Merkel:
On a base exchange game on bispanning graphs. Discret. Appl. Math. 165: 25-36 (2014) - 2013
- [i4]Stephan Dominique Andres, Winfried Hochstättler:
Perfect digraphs and a strong perfect digraph theorem. CTW 2013: 11-13 - 2011
- [j37]Stephan Dominique Andres, Winfried Hochstättler, Christiane Schallück:
The game chromatic index of wheels. Discret. Appl. Math. 159(16): 1660-1665 (2011) - [j36]Winfried Hochstättler, Robert Nickel:
Joins of oriented matroids. Eur. J. Comb. 32(6): 841-852 (2011) - [j35]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) - [j34]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) - [j33]Laura Chávez-Lomelí, Luis A. Goddyn, Winfried Hochstättler:
Balancing Covectors. SIAM J. Discret. Math. 25(3): 1315-1318 (2011) - 2010
- [j32]Steffen Hitzemann, Winfried Hochstättler:
On the combinatorics of Galois numbers. Discret. Math. 310(24): 3551-3557 (2010)
2000 – 2009
- 2008
- [j31]Winfried Hochstättler, Robert Nickel:
On the chromatic number of an oriented matroid. J. Comb. Theory B 98(4): 698-706 (2008) - [c8]Thomas Epping, Winfried Hochstättler, Robert Nickel, Peter Oertel:
Order sequencing in the automobile industry. Intelligente Systeme zur Entscheidungsunterstützung 2008: 49-66 - 2007
- [j30]Robert Nickel, Winfried Hochstättler:
The flow lattice of oriented matroids. Contributions Discret. Math. 2(1) (2007) - [j29]Annabell Berger, Winfried Hochstättler:
Minconvex graph factors of prescribed size and a simpler reduction to weighted f-factors. Electron. Notes Discret. Math. 28: 69-76 (2007) - [j28]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
- [j27]Luis A. Goddyn, Petr Hlinený, Winfried Hochstättler:
Balanced Signings and the Chromatic Number of Oriented Matroids. Comb. Probab. Comput. 15(4): 523-539 (2006) - [j26]Paul S. Bonsma, Thomas Epping, Winfried Hochstättler:
Complexity results on restricted instances of a paint shop problem for words. Discret. Appl. Math. 154(9): 1335-1343 (2006) - [j25]Winfried Hochstättler, Jaroslav Nesetril:
Antisymmetric flows in matroids. Eur. J. Comb. 27(7): 1129-1134 (2006) - [j24]Winfried Hochstättler, Robert Nickel, Britta Peis:
Two disjoint negative cycles in a signed graph. Electron. Notes Discret. Math. 25: 107-111 (2006) - [c7]Winfried Hochstättler, Hui Jin, Robert Nickel:
Note on an Auction Procedure for a Matching Game in Polynomial Time. AAIM 2006: 387-394 - 2005
- [j23]Bernhard Fuchs, Winfried Hochstättler, Walter Kern:
Online matching on a line. Theor. Comput. Sci. 332(1-3): 251-264 (2005) - 2004
- [j22]Thomas Epping, Winfried Hochstättler, Peter Oertel:
Complexity results on a paint shop problem. Discret. Appl. Math. 136(2-3): 217-226 (2004) - [j21]Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern:
Note on the game chromatic index of trees. Theor. Comput. Sci. 313(3): 371-376 (2004) - 2003
- [j20]Thomas Epping, Winfried Hochstättler:
Shortest paths through two-tone pairs. Electron. Notes Discret. Math. 13: 45-48 (2003) - [j19]Bernhard Fuchs, Winfried Hochstättler, Walter Kern:
Online Matching On a Line. Electron. Notes Discret. Math. 13: 49-51 (2003) - 2002
- [c6]Thomas Epping, Winfried Hochstättler:
Sorting with Line Storage Systems. OR 2002: 235-240 - [c5]Thomas Epping, Winfried Hochstättler, Marco E. Lübbecke:
MaxFlow-MinCut Duality for a Paint Shop Problem. OR 2002: 377-382 - 2001
- [j18]Thomas Epping, Winfried Hochstättler, Peter Oertel:
Some Results on a Paint Shop Problem for Words. Electron. Notes Discret. Math. 8: 31-33 (2001) - 2000
- [j17]Anja Hamacher, Winfried Hochstättler, Christoph Moll:
Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems. Discret. Appl. Math. 99(1-3): 55-69 (2000)
1990 – 1999
- 1999
- [j16]Ulrich Blasum, Winfried Hochstättler, Peter Oertel:
STEINER-Diagrams. Electron. Notes Discret. Math. 3: 13-18 (1999) - [j15]M. Hayer, Winfried Hochstättler:
Test Sets for Vertex Cover Problems. Electron. Notes Discret. Math. 3: 77-81 (1999) - [j14]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 B 77(1): 25-38 (1999) - [j13]Ulrich Blasum, Michael R. Bussieck, Winfried Hochstättler, Christoph Moll, Hans-Helmut Scheel, Thomas Winter:
Scheduling trams in the morning. Math. Methods Oper. Res. 49(1): 137-148 (1999) - 1998
- [j12]Winfried Hochstättler, Bill Jackson:
Large Circuits in Binary Matroids of Large Cogirth, I. J. Comb. Theory B 74(1): 35-52 (1998) - [j11]Winfried Hochstättler, Bill Jackson:
Large Circuits in Binary Matroids of Large Cogirth, II. J. Comb. Theory B 74(1): 53-63 (1998) - [j10]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
- [j9]Winfried Hochstättler:
A Lattice-theoretical Characterization of Oriented Matroids. Eur. J. Comb. 18(5): 563-574 (1997) - [j8]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) - [c4]Sándor P. Fekete, Winfried Hochstättler, Stephan Kromberg, Christoph Moll:
The complexity of an inverse shortest paths problem. Contemporary Trends in Discrete Mathematics 1997: 113-127 - [c3]Winfried Hochstättler, Martin Loebl:
Bases of cocycle lattices and submatrices of a Hadamard matrix. Contemporary Trends in Discrete Mathematics 1997: 159-168 - 1996
- [j7]Achim Bachem, Winfried Hochstättler, Barthel Steckemetz, A. Volmer:
Computational experience with general equilibrium problems. Comput. Optim. Appl. 6(3): 213-225 (1996) - [j6]Achim Bachem, Winfried Hochstättler, Martin Malich:
The Simulated Trading Heuristic for Solving Vehicle Routing Problems. Discret. Appl. Math. 65(1-3): 47-72 (1996) - [j5]Winfried Hochstättler, Martin Loebl, Christoph Moll:
Generating convex polyominoes at random. Discret. Math. 153(1-3): 165-176 (1996) - [j4]Winfried Hochstättler, Stephan 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. Discret. Appl. Math. 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. Electron. Colloquium Comput. Complex. TR95 (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. Electron. Colloquium Comput. Complex. TR95 (1995) - [i1]Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern:
On Approximately Fair Cost Allocation in Euclidean TSP Games. Electron. Colloquium Comput. Complex. TR95 (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]Winfried Hochstättler:
Shellability of Oriented Matroids. IPCO 1990: 275-281
1980 – 1989
- 1989
- [j1]Winfried Hochstättler, Walter Kern:
Matroid matching in pseudomodular lattices. Comb. 9(2): 145-152 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 01:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
