The flow lattice of oriented matroids (2008)
Winfried Hochstättler, Robert Nickel
Abstract. Recently Hochstättler and Neˇsetˇril introduced the flow lattice of an oriented matroid as generalization of the lattice of all integer flows of a digraph or more general a regular...
Matroid Polytopes On the Flow Lattice of Uniform Oriented (2008)
Grundlagen Der Informatik, Winfried Hochstättler, Robert Nickel, W. Hochstättler, ...
Recently Hochstättler and Neˇsetˇril introduced the flow lattice of an oriented matroid as generalization of the lattice of all integer flows of a digraph or more general a regular matroid. This...
David Schiess, Winfried Hochstättler, Robert Nickel
We introduce a new model for two-sided markets that generalizes sta- ble marriages as well as assignment games. Our model is a further gen- eralization of the model introduced by Eriksson and...
Flows On the Chromatic Number of an Oriented Matroid (2007)
Winfried Hochstättler, Robert Nickel, Winfried Hochstättler, Robert Nickel, ...
Winfried Hochstättler, Robert Nickel
We introduce a new maxflow-mincut (MFMC) property for oriented matroids and give necessary and sufficient conditions for a flow lattice of an oriented matroid or more general for an integer lattice...
Winfried Hochstättler, Robert Nickel
We define series/parallel/2-sum connection of two oriented matroids in terms of various axiom systems and an oriented modular join and sum operation by means of signed cocircuits and covectors. 1
Note on an auction procedure for matching games in polynomial time (2006)
Winfried Hochstättler, Hui Jin, Robert Nickel
We derive a polynomial time algorithm to compute a stable solution in a mixed matching market from an auction procedure as presented by Eriksson and Karlander [5]. As a special case we derive an...
Winfried Hochstättler, Robert Nickel, Britta Peis, Proving Polynomiality
Signed graphs have been studied a lot during the last two decades. We address the vertex disjoint negative cycle packing problem posed by Zaslavsky [7, Problem II.A.1a]. Our aim is to find two vertex...
Winfried Hochstättler, Hui Jin, Robert Nickel, Lehrgebiet Mathematik, Lehrstuhl Diskrete, Mathematik Optimierung, ...
We present an algorithm that computes a stable matching in a common generalization of the marriage and the assignment game in O(n 4) time. 1
Campbell, John Frederick (1943)
Nevada Test Site Oral History Project University of Nevada, Las Vegas Interview with John F. Campbell July 23, 2004 Las Vegas, Nevada Interview Conducted By Robert Nickel © 2007 by UNLV Libraries...
Nevada Test Site Oral History Project University of Nevada, Las Vegas Interview with Donald Owen June 23, 2004 Las Vegas, Nevada Interview Conducted By Robert Nickel © 2007 by UNLV Libraries Oral...
Nevada Test Site Oral History Project University of Nevada, Las Vegas Interview with Lawrence Crooks July 21, 2004 Las Vegas, Nevada Interview Conducted By Robert Nickel © 2007 by UNLV Libraries...
Winfried Hochstättler, Robert Nickel, David Schiess
We introduce a new model for two-sided markets that generalizes stable marriages as well as assignment games. Our model is a further generalization of the model introduced by Eriksson and Karlander...