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.

 

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

The complexity of generalized clique covering., и . Discret. Appl. Math., 22 (2): 109-118 (1989)Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope., и . IPCO, том 1610 из Lecture Notes in Computer Science, стр. 166-182. Springer, (1999)Critical extreme points of the 2-edge connected spanning subgraph polytope., и . Math. Program., 105 (2-3): 289-310 (2006)The Clique-Rank of 3-Chromatic Perfect Graphs.. The Sharpest Cut, том 4 из MPS-SIAM series on optimization, SIAM, (2004)On the number of common bases of two matroids., и . Discret. Math., 45 (2-3): 217-228 (1983)Recognizing dart-free perfect graphs., , , и . SODA, стр. 50-53. ACM/SIAM, (2000)Compositions in the bipartite subgraph polytope., , и . Discret. Math., 105 (1-3): 73-91 (1992)Chromatic characterization of biclique covers., и . Discret. Math., 306 (5): 495-507 (2006)An integer analogue of Carathéodory's theorem., , и . J. Comb. Theory, Ser. B, 40 (1): 63-70 (1986)On the Clique-Rank and the Coloration of Perfect Graphs., и . IPCO, стр. 201-216. University of Waterloo Press, (1990)