Winfried Hochstättler

VLDB 2026 Research / reviewers in the wild / expert

dblp:h/WinfriedHochstattler · DBLP profile ↗

← Back

18ranked-venue papers

3as first author

5since 2021 · last 2023

0000-0001-7344-7143ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 18 · 3 first-author · 5 since 2021Databases, data management, data science and information retrieval · 1

Year	Publication	Venue	Position
2023	An Efficient Computation of the Rank Function of a Positroid Lamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef	FCT	3
2022	Colorings of oriented planar graphs avoiding a monochromatic subgraph Helena Bergold, Winfried Hochstättler, Raphael Steiner	Discret. Appl. Math.	2
2021	The Neighborhood Polynomial of Chordal Graphs Helena Bergold, Winfried Hochstättler, Uwe Mayer	WADS	2
2021	The NL-flow polynomial Barbara Altenbokum, Winfried Hochstättler, Johanna Wiehe	Discret. Appl. Math.	2
2021	In Memoriam Walter Kern Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still	Discret. Appl. Math.	1
2014	On a base exchange game on bispanning graphs Stephan Dominique Andres, Winfried Hochstättler, Markus Merkel	Discret. Appl. Math.	2
2011	The game chromatic index of wheels Stephan Dominique Andres, Winfried Hochstättler, Christiane Schallück	Discret. Appl. Math.	2
2011	The game chromatic number and the game colouring number of classes of oriented cactuses Stephan Dominique Andres, Winfried Hochstättler	Inf. Process. Lett.	2
2011	Balancing Covectors abstract Goddyn, Hliněný, and Hochstättler proved that the circular flow number introduced by Goddyn, Tarsi, and Zhang for an oriented matroid of rank [Formula: see text] is bounded by [Formula: see text]. We improve this bound by showing that any oriented matroid without a coloop admits a reorientation such that the imbalance of each covector is at most [Formula: see text]. In particular this yields a new upper bound for the circular flow number. Laura Chávez-Lomelí, Luis A. Goddyn, Winfried Hochstättler	SIAM J. Discret. Math.	3
2006	Note on an Auction Procedure for a Matching Game in Polynomial Time Winfried Hochstättler, Hui Jin 0002, Robert Nickel	AAIM	1
2006	Complexity results on restricted instances of a paint shop problem for words Paul S. Bonsma, Thomas Epping, Winfried Hochstättler	Discret. Appl. Math.	3
2005	Online matching on a line Bernhard Fuchs, Winfried Hochstättler, Walter Kern	Theor. Comput. Sci.	2
2004	Complexity results on a paint shop problem Thomas Epping, Winfried Hochstättler, Peter Oertel	Discret. Appl. Math.	2
2004	Note on the game chromatic index of trees Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern	Theor. Comput. Sci.	3
2000	Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems Anja Hamacher, Winfried Hochstättler, Christoph Moll	Discret. Appl. Math.	2
1996	The Simulated Trading Heuristic for Solving Vehicle Routing Problems Achim Bachem, Winfried Hochstättler, Martin Malich	Discret. Appl. Math.	2
1995	On Pseudomodular Matroids and Adjoints Marion Alfter, Winfried Hochstättler	Discret. Appl. Math.	2
1990	Shellability of Oriented Matroids Winfried Hochstättler	IPCO	1