Остановите войну!
for scientists:
default search action
Zbigniew Lonc
- > Home > Persons > Zbigniew Lonc
Publications
- 2020
- [j52]Miroslaw Truszczynski, Zbigniew Lonc:
Maximin Share Allocations on Cycles. J. Artif. Intell. Res. 69: 613-655 (2020) - 2019
- [i7]Zbigniew Lonc, Miroslaw Truszczynski:
Maximin share allocations on cycles. CoRR abs/1905.03038 (2019) - 2018
- [c14]Zbigniew Lonc, Miroslaw Truszczynski:
Maximin Share Allocations on Cycles. IJCAI 2018: 410-416 - 2016
- [j45]Zbigniew Lonc, Miroslaw Truszczynski:
Packing analogue of k-radius sequences. Eur. J. Comb. 57: 57-70 (2016) - 2012
- [j36]Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski:
Constructions of asymptotically shortest k-radius sequences. J. Comb. Theory, Ser. A 119(3): 731-746 (2012) - 2011
- [j35]Zbigniew Lonc, Miroslaw Truszczynski:
On graph equivalences preserved under extensions. Discret. Math. 311(12): 966-977 (2011) - 2008
- [j31]Zbigniew Lonc, Miroslaw Truszczynski:
On the number of minimal transversals in 3-uniform hypergraphs. Discret. Math. 308(16): 3668-3687 (2008) - 2006
- [j30]Zbigniew Lonc, Miroslaw Truszczynski:
Computing minimal models, stable models and answer sets. Theory Pract. Log. Program. 6(4): 395-449 (2006) - 2005
- [i4]Zbigniew Lonc, Miroslaw Truszczynski:
Computing minimal models, stable models and answer sets. CoRR abs/cs/0506104 (2005) - 2004
- [j27]Zbigniew Lonc, Miroslaw Truszczynski:
Computing stable models: worst-case performance estimates. Theory Pract. Log. Program. 4(1-2): 193-231 (2004) - 2003
- [j25]Zbigniew Lonc, Miroslaw Truszczynski:
Fixed-parameter complexity of semantics for logic programs. ACM Trans. Comput. Log. 4(1): 91-119 (2003) - [c10]Zbigniew Lonc, Miroslaw Truszczynski:
Computing Minimal Models, Stable Models, and Answer Sets. ICLP 2003: 209-223 - 2002
- [c9]Zbigniew Lonc, Miroslaw Truszczynski:
Computing Stable Models: Worst-Case Performance Estimates. ICLP 2002: 347-362 - [i3]Zbigniew Lonc, Miroslaw Truszczynski:
Computing stable models: worst-case performance estimates. CoRR cs.LO/0205013 (2002) - 2001
- [j22]Zbigniew Lonc, Miroslaw Truszczynski:
On the problem of computing the well-founded semantics. Theory Pract. Log. Program. 1(5): 591-609 (2001) - [c7]Zbigniew Lonc, Miroslaw Truszczynski:
Fixed-Parameter Complexity of Semantics for Logic Programs. ICLP 2001: 197-211 - [i2]Zbigniew Lonc, Miroslaw Truszczynski:
On the problem of computing the well-founded semantics. CoRR cs.LO/0101014 (2001) - [i1]Zbigniew Lonc, Miroslaw Truszczynski:
Fixed-parameter complexity of semantics for logic programs. CoRR cs.LO/0107027 (2001) - 2000
- [c6]Zbigniew Lonc, Miroslaw Truszczynski:
On the Problem of Computing the Well-Founded Semantics. Computational Logic 2000: 673-687 - 1981
- [c1]Zbigniew Lonc, Tomasz Traczyk, Miroslaw Truszczynski:
Optimal F-Graphs for the Family of all K-Subsets of an N-Set. FODO 1981: 247-270
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint