( en | de | ru )

 

Disambiguation of "Lonc, Zbigniew"

Author of the publication

copydeleteadd this publication to your clipboard
On the Problem of Computing the Well-Founded Semantics.

, and . Computational Logic, volume 1861 of Lecture Notes in Computer Science, page 673-687. Springer, (2000)

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.

Laëtitia Loncan

Robert Loncar

Ivan Lončarević

Ema Loncarek

Maja Loncar

 

Other publications of authors with the same name

On the Problem of Computing the Well-Founded Semantics., and . Computational Logic, volume 1861 of Lecture Notes in Computer Science, page 673-687. Springer, (2000)Toward a Solution of the Holyer's Problem.. WG, volume 790 of Lecture Notes in Computer Science, page 144-152. Springer, (1993)A Combinatorial Algorithm for Sharing a Key., and . ACS, page 393-406. Springer, (2001)Solution of a delta-system decomposition problem.. J. Comb. Theory A, 55 (1): 33-48 (1990)On Complexity of Some Chain and Antichain Partition Problems.. WG, volume 570 of Lecture Notes in Computer Science, page 97-104. Springer, (1991)Maximin Share Allocations on Cycles., and . IJCAI, page 410-416. ijcai.org, (2018)Optimal F-Graphs for the Family of all K-Subsets of an N-Set., , and . FODO, page 247-270. Academic Press, (1981)On Tours that Contain All Edges of a Hypergraph., and . Electron. J. Comb., (2010)Counting Independent Sets in Claw-Free Graphs., , and . WG, volume 6986 of Lecture Notes in Computer Science, page 227-237. Springer, (2011)Maximin Share Allocations on Cycles., and . J. Artif. Intell. Res., (2020)