( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Complexity of Digraph Colourings and Vertex Arboricity.

, , и . Discret. Math. Theor. Comput. Sci., (2020)

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.

Winfried Hochstättler

Winfried Krüger

Winfried Keutner

Winfried Oppelt

Winfried Ludewig

 

Другие публикации лиц с тем же именем

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