From post

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.

 

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

Sperner Oiks., , и . Electron. Notes Discret. Math., (2010)Colouring Some Classes of Perfect Graphs Robustly., и . Electron. Notes Discret. Math., (2005)Breaking AES-128: Machine Learning-Based SCA Under Different Scenarios and Devices., , и . CSR, стр. 564-571. IEEE, (2023)Existentially Polytime Theorems., и . Polyhedral Combinatorics, том 1 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 83-100. DIMACS/AMS, (1990)Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems., и . Combinatorial Optimization, том 2570 из Lecture Notes in Computer Science, стр. 31-33. Springer, (2001)Scarf Oiks., , и . Electron. Notes Discret. Math., (2010)Brick decompositions and the matching rank of graphs., , и . Comb., 2 (3): 247-274 (1982)Maximum matching and a polyhedron with 0, 1-vertices. Journal of Research of the National Bureau of Standards B, (1965)A case of non-convergent dual changes in assignment problems., и . Discret. Appl. Math., 11 (2): 95-102 (1985)Exponentiality of the exchange algorithm for finding another room-partitioning., и . Discret. Appl. Math., (2014)