From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Optimal F-Graphs for the Family of all K-Subsets of an N-Set.

Z. Lonc, T. Traczyk, и M. Truszczynski. FODO, стр. 247-270. Academic Press, (1981)

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.

A Combinatorial Algorithm for Sharing a Key.Z. Lonc, и M. Srebrny. ACS, стр. 393-406. Springer, (2001)Toward a Solution of the Holyer's Problem.Z. Lonc. WG, том 790 из Lecture Notes in Computer Science, стр. 144-152. Springer, (1993)On the Problem of Computing the Well-Founded Semantics.Z. Lonc, и M. Truszczynski. Computational Logic, том 1861 из Lecture Notes in Computer Science, стр. 673-687. Springer, (2000)Solution of a delta-system decomposition problem.Z. Lonc. J. Comb. Theory A, 55 (1): 33-48 (1990)Maximin Share Allocations on Cycles.Z. Lonc, и M. Truszczynski. IJCAI, стр. 410-416. ijcai.org, (2018)Optimal F-Graphs for the Family of all K-Subsets of an N-Set.Z. Lonc, T. Traczyk, и M. Truszczynski. FODO, стр. 247-270. Academic Press, (1981)On Complexity of Some Chain and Antichain Partition Problems.Z. Lonc. WG, том 570 из Lecture Notes in Computer Science, стр. 97-104. Springer, (1991)On graph equivalences preserved under extensions.Z. Lonc, и M. Truszczynski. Discret. Math., 311 (12): 966-977 (2011)On the number of spanning trees in directed circulant graphs.Z. Lonc, K. Parol, и J. Wojciechowski. Networks, 37 (3): 129-133 (2001)Counting Independent Sets in Claw-Free Graphs.K. Junosza-Szaniawski, Z. Lonc, и M. Tuczynski. WG, том 6986 из Lecture Notes in Computer Science, стр. 227-237. Springer, (2011)