default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZbigniew Lonc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c16]Zbigniew Lonc:
Approximating Fair Division on D-Claw-Free Graphs. IJCAI 2023: 2826-2834- 2022
- [j54]Zbigniew Lonc
, Nataliya Petryshyn:
Edge decompositions and rooted packings of graphs. Discret. Math. 345(12): 113057 (2022) - [c15]Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski:
Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. ISAAC 2022: 14:1-14:16 - [i8]Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski:
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws. CoRR abs/2205.13270 (2022) - 2020
- [j53]Michal Debski, Konstanty Junosza-Szaniawski, Zbigniew Lonc:
Bundling all shortest paths. Discret. Appl. Math. 277: 82-91 (2020) - [j52]Miroslaw Truszczynski, Zbigniew Lonc:
Maximin Share Allocations on Cycles. J. Artif. Intell. Res. 69: 613-655 (2020)
2010 – 2019
- 2019
- [i7]Zbigniew Lonc, Miroslaw Truszczynski:
Maximin share allocations on cycles. CoRR abs/1905.03038 (2019) - 2018
- [j51]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Achromatic and Harmonious Colorings of Circulant Graphs. J. Graph Theory 87(1): 18-34 (2018) - [c14]Zbigniew Lonc, Miroslaw Truszczynski:
Maximin Share Allocations on Cycles. IJCAI 2018: 410-416 - 2017
- [j50]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Sequences of radius k for complete bipartite graphs. Discret. Appl. Math. 225: 51-63 (2017) - [j49]Zbigniew Lonc:
Note on a construction of short k-radius sequences. Discret. Math. 340(3): 504-507 (2017) - [j48]Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski:
Tight Euler tours in uniform hypergraphs - computational aspects. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j47]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Harmonious and achromatic colorings of fragmentable hypergraphs. Eur. J. Comb. 66: 60-80 (2017) - [j46]J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski:
Erratum: Constructing Optimal k-Radius Sequences. SIAM J. Discret. Math. 31(1): 645-646 (2017) - [i6]Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski:
Tight Euler tours in uniform hypergraphs - computational aspects. CoRR abs/1706.09356 (2017) - [i5]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Sequences of radius k for complete bipartite graphs. CoRR abs/1711.05091 (2017) - 2016
- [j45]Zbigniew Lonc, Miroslaw Truszczynski:
Packing analogue of k-radius sequences. Eur. J. Comb. 57: 57-70 (2016) - [j44]Michal Debski, Zbigniew Lonc:
Universal Cycle Packings and Coverings for k-Subsets of an n-Set. Graphs Comb. 32(6): 2323-2337 (2016) - [j43]J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski:
Constructing Optimal k-Radius Sequences. SIAM J. Discret. Math. 30(1): 452-464 (2016) - [c13]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Sequences of Radius k for Complete Bipartite Graphs. WG 2016: 1-12 - 2015
- [j42]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Harmonious and achromatic colorings of fragmentable hypergraphs. Electron. Notes Discret. Math. 49: 309-314 (2015) - 2014
- [j41]Michal Debski, Zbigniew Lonc:
Sequences of large radius. Eur. J. Comb. 41: 197-204 (2014) - [j40]Zbigniew Lonc, Nataliya Petryshyn:
On Rooted Packings, Decompositions, and Factors of Graphs. J. Graph Theory 76(2): 106-128 (2014) - 2013
- [j39]Zbigniew Lonc, Karolina Warno:
Minimum size transversals in uniform hypergraphs. Discret. Math. 313(23): 2798-2815 (2013) - 2012
- [j38]Jaroslaw Grytczuk, Zbigniew Lonc:
Preface. Discret. Math. 312(23): 3425 (2012) - [j37]Zbigniew Lonc, Pawel Naroski:
A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph. Discret. Math. Theor. Comput. Sci. 14(1): 147-158 (2012) - [j36]Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski:
Constructions of asymptotically shortest k-radius sequences. J. Comb. Theory 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) - [c12]Konstanty Junosza-Szaniawski, Zbigniew Lonc, Michal Tuczynski:
Counting Independent Sets in Claw-Free Graphs. WG 2011: 227-237 - 2010
- [j34]Zbigniew Lonc, Pawel Naroski:
On Tours that Contain All Edges of a Hypergraph. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j33]Krzysztof Brys, Zbigniew Lonc:
Polynomial cases of graph decomposition: A complete solution of Holyer's problem. Discret. Math. 309(6): 1294-1326 (2009) - [j32]Zbigniew Lonc, Monika Pszczola:
Edge decompositions into two kinds of graphs. Discret. Math. 309(22): 6368-6374 (2009) - 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
- [j29]Zbigniew Lonc, Mariusz Meszka, Zdzislaw Skupien:
Edge Decompositions of Multigraphs into 3-Matchings. Graphs Comb. 20(4): 507-515 (2004) - [j28]Mekkia Kouider, Zbigniew Lonc:
Stability number and [a, b]-factors in graphs. J. Graph Theory 46(4): 254-264 (2004) - [j27]Zbigniew Lonc, Miroslaw Truszczynski:
Computing stable models: worst-case performance estimates. Theory Pract. Log. Program. 4(1-2): 193-231 (2004) - [c11]Jerzy W. Jaromczyk, Zbigniew Lonc:
Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations. ISAAC 2004: 594-605 - 2003
- [j26]Muktar E. Elzobi, Zbigniew Lonc:
Partitioning Boolean lattices into antichains. Discret. Math. 260(1-3): 45-55 (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
- [j24]Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski:
On the number of spanning trees in directed circulant graphs. Networks 37(3): 129-133 (2001) - [j23]Krzysztof Brys, Zbigniew Lonc:
Monochromatic Partitions of Complete Uniform Hypergraphs. SIAM J. Discret. Math. 14(3): 286-290 (2001) - [j22]Zbigniew Lonc, Miroslaw Truszczynski:
On the problem of computing the well-founded semantics. Theory Pract. Log. Program. 1(5): 591-609 (2001) - [c8]Zbigniew Lonc, Marian Srebrny:
A Combinatorial Algorithm for Sharing a Key. ACS 2001: 393-406 - [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
1990 – 1999
- 1999
- [j21]Mekkia Kouider, Zbigniew Lonc:
Path decompositions and perfect path double covers. Australas. J Comb. 19: 261-274 (1999) - [j20]Zbigniew Lonc:
On ordered sets without 2-colourings. Discret. Math. 201(1-3): 171-188 (1999) - [j19]Zbigniew Lonc, Muktar E. Elzobi:
Chain Partitions of Products of Two Chains. J. Comb. Theory A 86(1): 140-150 (1999) - 1998
- [j18]Krzysztof Brys, Zbigniew Lonc:
Clique and anticlique partitions of graphs. Discret. Math. 185(1-3): 41-49 (1998) - [j17]Krzysztof Brys, Mekkia Kouider, Zbigniew Lonc, Maryvonne Mahéo:
Decomposition of multigraphs. Discuss. Math. Graph Theory 18(2): 225-232 (1998) - 1997
- [j16]Zbigniew Lonc:
Delta-system decompositions of graphs. Discret. Math. 164(1-3): 221-224 (1997) - [j15]Zbigniew Lonc:
Edge Decomposition into Isomorphic Copies ofsK1, 2Is Polynomial. J. Comb. Theory B 69(2): 164-182 (1997) - [j14]Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski:
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs. Networks 30(1): 47-56 (1997) - 1996
- [j13]Mekkia Kouider, Zbigniew Lonc:
Covering Cycles and k-Term Degree Sums. Comb. 16(3): 407-412 (1996) - [j12]Zbigniew Lonc:
On the Complexity of Some Edge-partition Problems for Graphs. Discret. Appl. Math. 70(2): 177-183 (1996) - [j11]Zbigniew Lonc:
Clique packings and clique partitions of graphs without odd chordles cycles. Discuss. Math. Graph Theory 16(2): 143-149 (1996) - [c5]Krzysztof Brys, Zbigniew Lonc:
Clique and Anticlique Partition of Graphs. WG 1996: 67-72 - 1994
- [j10]Zbigniew Lonc:
Partitions of large Boolean lattices. Discret. Math. 131(1-3): 173-181 (1994) - 1993
- [j9]Zbigniew Lonc:
Majorization, packing, covering and matroids. Discret. Math. 121(1-3): 151-157 (1993) - [c4]Zbigniew Lonc:
Toward a Solution of the Holyer's Problem. WG 1993: 144-152 - 1992
- [j8]Zbigniew Lonc:
Packing, covering and decomposing of a complete uniform hypergraph into delta-systems. Graphs Comb. 8(4): 333-341 (1992) - [j7]Zbigniew Lonc:
Partitions, Packings and Coverings by Families with Nonempty Intersections. J. Comb. Theory A 61(2): 263-278 (1992) - 1991
- [c3]Zbigniew Lonc:
On Complexity of Some Chain and Antichain Partition Problems. WG 1991: 97-104 - 1990
- [j6]Zbigniew Lonc:
Solution of a delta-system decomposition problem. J. Comb. Theory A 55(1): 33-48 (1990)
1980 – 1989
- 1989
- [j5]Zbigniew Lonc:
On decomposition of hypergraphs into Delta-systems. J. Comb. Theory A 52(1): 158-162 (1989) - [j4]Zbigniew Lonc:
Decompositions of graphs into trees. J. Graph Theory 13(4): 393-403 (1989) - 1988
- [j3]Zbigniew Lonc:
On resolvable tree-decompositions of complete graphs. J. Graph Theory 12(2): 295-303 (1988) - 1987
- [j2]Zbigniew Lonc:
Decompositions of hypergraphs into hyperstars. Discret. Math. 66(1-2): 157-168 (1987) - [j1]Zbigniew Lonc, Ivan Rival:
Chains, antichains, and fibres. J. Comb. Theory A 44(2): 207-228 (1987) - 1981
- [c2]Zbigniew Lonc:
A Shotest Linear Organization for Some Uniform Multiattribute Files. FODO 1981: 137-150 - [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
Coauthor Index
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-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
