Author of the publication

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.

 

Other publications of authors with the same name

Colouring Some Classes of Perfect Graphs Robustly., and . Electron. Notes Discret. Math., (2005)Sperner Oiks., , and . Electron. Notes Discret. Math., (2010)Existentially Polytime Theorems., and . Polyhedral Combinatorics, volume 1 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 83-100. DIMACS/AMS, (1990)Breaking AES-128: Machine Learning-Based SCA Under Different Scenarios and Devices., , and . CSR, page 564-571. IEEE, (2023)Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems., and . Combinatorial Optimization, volume 2570 of Lecture Notes in Computer Science, page 31-33. Springer, (2001)Scarf Oiks., , and . Electron. Notes Discret. Math., (2010)Brick decompositions and the matching rank of graphs., , and . 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., and . Discret. Appl. Math., 11 (2): 95-102 (1985)Exponentiality of the exchange algorithm for finding another room-partitioning., and . Discret. Appl. Math., (2014)