( en | de | ru )

 

Disambiguation of "Hochstättler, Winfried"

Author of the publication

copydeleteadd this publication to your clipboard
The complexity of an inverse shortest paths problem.

, , , and . Contemporary Trends in Discrete Mathematics, volume 49 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 113-127. DIMACS/AMS, (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Winfried Hochstättler

Winfried Maier

Winfried Zappe

Winfried Siegel

Winfried Schaefer

 

Other publications of authors with the same name

Sorting with Line Storage Systems., and . OR, page 235-240. Springer, (2002)Balanced Signings and the Chromatic Number of Oriented Matroids., , and . Comb. Probab. Comput., 15 (4): 523-539 (2006)MaxFlow-MinCut Duality for a Paint Shop Problem., , and . OR, page 377-382. Springer, (2002)A semi-strong perfect digraph theorem., , , and . AKCE Int. J. Graphs Comb., 17 (3): 992-994 (2020)An Efficient Computation of the Rank Function of a Positroid., , , and . FCT, volume 14292 of Lecture Notes in Computer Science, page 147-161. Springer, (2023)The flow lattice of oriented matroids., and . Contributions Discret. Math., (2007)Note on an Auction Procedure for a Matching Game in Polynomial Time., , and . AAIM, volume 4041 of Lecture Notes in Computer Science, page 387-394. Springer, (2006)Simulated Trading - A New Parallel Approach for Solving Vehicle Routing Problems., , and . PARCO, page 471-476. Elsevier, (1993)Some Results on a Paint Shop Problem for Words., , and . Electron. Notes Discret. Math., (2001)Perfect digraphs and a strong perfect digraph theorem., and . CTW, volume WP 13-01 of CTIT Workshop Proceedings, page 11-13. (2013)