A Shotest Linear Organization for Some Uniform Multiattribute Files. - Zbigniew Lonc (FODO, 1981)

Optimal F-Graphs for the Family of all K-Subsets of an N-Set. - Zbigniew Lonc; Tomasz Traczyk; Miroslaw Truszczynski (FODO, 1981)

Decompositions of hypergraphs into hyperstars. - Zbigniew Lonc (Discret. Math., 1987)

Chains, antichains, and fibres. - Zbigniew Lonc; Ivan Rival (J. Comb. Theory A, 1987)

On resolvable tree-decompositions of complete graphs. - Zbigniew Lonc (J. Graph Theory, 1988)

On decomposition of hypergraphs into Delta-systems. - Zbigniew Lonc (J. Comb. Theory A, 1989)

Decompositions of graphs into trees. - Zbigniew Lonc (J. Graph Theory, 1989)

Solution of a delta-system decomposition problem. - Zbigniew Lonc (J. Comb. Theory A, 1990)

On Complexity of Some Chain and Antichain Partition Problems. - Zbigniew Lonc (WG, 1991)

Packing, covering and decomposing of a complete uniform hypergraph into delta-systems. - Zbigniew Lonc (Graphs Comb., 1992)

Partitions, Packings and Coverings by Families with Nonempty Intersections. - Zbigniew Lonc (J. Comb. Theory A, 1992)

Toward a Solution of the Holyer's Problem. - Zbigniew Lonc (WG, 1993)

Majorization, packing, covering and matroids. - Zbigniew Lonc (Discret. Math., 1993)

Partitions of large Boolean lattices. - Zbigniew Lonc (Discret. Math., 1994)

Clique and Anticlique Partition of Graphs. - Krzysztof Brys; Zbigniew Lonc (WG, 1996)

Covering Cycles and k-Term Degree Sums. - Mekkia Kouider; Zbigniew Lonc (Comb., 1996)

On the Complexity of Some Edge-partition Problems for Graphs. - Zbigniew Lonc (Discret. Appl. Math., 1996)

Clique packings and clique partitions of graphs without odd chordles cycles. - Zbigniew Lonc (Discuss. Math. Graph Theory, 1996)

Delta-system decompositions of graphs. - Zbigniew Lonc (Discret. Math., 1997)

Edge Decomposition into Isomorphic Copies ofsK1, 2Is Polynomial. - Zbigniew Lonc (J. Comb. Theory B, 1997)

On the asymptotic behavior of the maximum number of spanning trees in circulant graphs. - Zbigniew Lonc; Krzysztof Parol; Jacek Wojciechowski (Networks, 1997)

Clique and anticlique partitions of graphs. - Krzysztof Brys; Zbigniew Lonc (Discret. Math., 1998)

Decomposition of multigraphs. - Krzysztof Brys; Mekkia Kouider; Zbigniew Lonc; Maryvonne Mahéo (Discuss. Math. Graph Theory, 1998)

Path decompositions and perfect path double covers. - Mekkia Kouider; Zbigniew Lonc (Australas. J Comb., 1999)

On ordered sets without 2-colourings. - Zbigniew Lonc (Discret. Math., 1999)

Chain Partitions of Products of Two Chains. - Zbigniew Lonc; Muktar E. Elzobi (J. Comb. Theory A, 1999)

A Combinatorial Algorithm for Sharing a Key. - Zbigniew Lonc; Marian Srebrny (ACS, 2001)

On the number of spanning trees in directed circulant graphs. - Zbigniew Lonc; Krzysztof Parol; Jacek Wojciechowski (Networks, 2001)

Monochromatic Partitions of Complete Uniform Hypergraphs. - Krzysztof Brys; Zbigniew Lonc (SIAM J. Discret. Math., 2001)

On the problem of computing the well-founded semantics. - Zbigniew Lonc; Miroslaw Truszczynski (Theory Pract. Log. Program., 2001)

Partitioning Boolean lattices into antichains. - Muktar E. Elzobi; Zbigniew Lonc (Discret. Math., 2003)

Fixed-parameter complexity of semantics for logic programs. - Zbigniew Lonc; Miroslaw Truszczynski (ACM Trans. Comput. Log., 2003)

Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations. - Jerzy W. Jaromczyk; Zbigniew Lonc (ISAAC, 2004)

Edge Decompositions of Multigraphs into 3-Matchings. - Zbigniew Lonc; Mariusz Meszka; Zdzislaw Skupien (Graphs Comb., 2004)

Stability number and [a, b]-factors in graphs. - Mekkia Kouider; Zbigniew Lonc (J. Graph Theory, 2004)

Computing stable models: worst-case performance estimates. - Zbigniew Lonc; Miroslaw Truszczynski (Theory Pract. Log. Program., 2004)

Computing minimal models, stable models and answer sets. - Zbigniew Lonc; Miroslaw Truszczynski (Theory Pract. Log. Program., 2006)

On the number of minimal transversals in 3-uniform hypergraphs. - Zbigniew Lonc; Miroslaw Truszczynski (Discret. Math., 2008)

Polynomial cases of graph decomposition: A complete solution of Holyer's problem. - Krzysztof Brys; Zbigniew Lonc (Discret. Math., 2009)

Edge decompositions into two kinds of graphs. - Zbigniew Lonc; Monika Pszczola (Discret. Math., 2009)

On Tours that Contain All Edges of a Hypergraph. - Zbigniew Lonc; Pawel Naroski (Electron. J. Comb., 2010)

Counting Independent Sets in Claw-Free Graphs. - Konstanty Junosza-Szaniawski; Zbigniew Lonc; Michal Tuczynski (WG, 2011)

On graph equivalences preserved under extensions. - Zbigniew Lonc; Miroslaw Truszczynski (Discret. Math., 2011)

Preface. - Jaroslaw Grytczuk; Zbigniew Lonc (Discret. Math., 2012)

A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph. - Zbigniew Lonc; Pawel Naroski (Discret. Math. Theor. Comput. Sci., 2012)

Constructions of asymptotically shortest k-radius sequences. - Jerzy W. Jaromczyk; Zbigniew Lonc; Miroslaw Truszczynski (J. Comb. Theory A, 2012)

Minimum size transversals in uniform hypergraphs. - Zbigniew Lonc; Karolina Warno (Discret. Math., 2013)

Sequences of large radius. - Michal Debski; Zbigniew Lonc (Eur. J. Comb., 2014)

On Rooted Packings, Decompositions, and Factors of Graphs. - Zbigniew Lonc; Nataliya Petryshyn (J. Graph Theory, 2014)

Harmonious and achromatic colorings of fragmentable hypergraphs. - Michal Debski; Zbigniew Lonc; Pawel Rzazewski (Electron. Notes Discret. Math., 2015)

Packing analogue of k-radius sequences. - Zbigniew Lonc; Miroslaw Truszczynski (Eur. J. Comb., 2016)

Universal Cycle Packings and Coverings for k-Subsets of an n-Set. - Michal Debski; Zbigniew Lonc (Graphs Comb., 2016)

Constructing Optimal k-Radius Sequences. - J. Adrian Bondy; Zbigniew Lonc; Pawel Rzazewski (SIAM J. Discret. Math., 2016)

Sequences of radius k for complete bipartite graphs. - Michal Debski; Zbigniew Lonc; Pawel Rzazewski (Discret. Appl. Math., 2017)

Note on a construction of short k-radius sequences. - Zbigniew Lonc (Discret. Math., 2017)

Tight Euler tours in uniform hypergraphs - computational aspects. - Zbigniew Lonc; Pawel Naroski; Pawel Rzazewski (Discret. Math. Theor. Comput. Sci., 2017)

Erratum: Constructing Optimal k-Radius Sequences. - J. Adrian Bondy; Zbigniew Lonc; Pawel Rzazewski (SIAM J. Discret. Math., 2017)

Achromatic and Harmonious Colorings of Circulant Graphs. - Michal Debski; Zbigniew Lonc; Pawel Rzazewski (J. Graph Theory, 2018)

Bundling all shortest paths. - Michal Debski; Konstanty Junosza-Szaniawski; Zbigniew Lonc (Discret. Appl. Math., 2020)

Maximin Share Allocations on Cycles. - Miroslaw Truszczynski; Zbigniew Lonc (J. Artif. Intell. Res., 2020)

Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. - Michal Debski; Zbigniew Lonc; Karolina Okrasa; Marta Piecyk; Pawel Rzazewski (ISAAC, 2022)

Edge decompositions and rooted packings of graphs. - Zbigniew Lonc; Nataliya Petryshyn (Discret. Math., 2022)

Approximating Fair Division on D-Claw-Free Graphs. - Zbigniew Lonc (IJCAI, 2023)

On Approximate MMS Allocations on Restricted Graph Classes. - Václav Blazej; Michal Debski; Zbigniew Lonc; Marta Piecyk; Pawel Rzazewski (CoRR, 2025)