Zbigniew Lonc

Publication Activity (10 Years)

Years Active: 1981-2023
Publications (10 Years): 20

Top Topics

Bipartite Graph

Directed Acyclic

Top Venues

Discret. Appl. Math.

Publications

Zbigniew Lonc
Approximating Fair Division on D-Claw-Free Graphs. IJCAI (2023)
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)
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 (2022)
Zbigniew Lonc, Nataliya Petryshyn
Edge decompositions and rooted packings of graphs. Discret. Math. 345 (12) (2022)
Miroslaw Truszczynski, Zbigniew Lonc
Maximin Share Allocations on Cycles. J. Artif. Intell. Res. 69 (2020)
Michal Debski, Konstanty Junosza-Szaniawski, Zbigniew Lonc
Bundling all shortest paths. Discret. Appl. Math. 277 (2020)
Zbigniew Lonc, Miroslaw Truszczynski
Maximin share allocations on cycles. CoRR (2019)
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
Achromatic and Harmonious Colorings of Circulant Graphs. J. Graph Theory 87 (1) (2018)
Zbigniew Lonc, Miroslaw Truszczynski
Maximin Share Allocations on Cycles. IJCAI (2018)
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
Harmonious and achromatic colorings of fragmentable hypergraphs. Eur. J. Comb. 66 (2017)
J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski
Erratum: Constructing Optimal k-Radius Sequences. SIAM J. Discret. Math. 31 (1) (2017)
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
Sequences of radius k for complete bipartite graphs. Discret. Appl. Math. 225 (2017)
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
Sequences of radius k for complete bipartite graphs. CoRR (2017)
Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski
Tight Euler tours in uniform hypergraphs - computational aspects. Discret. Math. Theor. Comput. Sci. 19 (3) (2017)
Zbigniew Lonc
Note on a construction of short k-radius sequences. Discret. Math. 340 (3) (2017)
Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski
Tight Euler tours in uniform hypergraphs - computational aspects. CoRR (2017)
J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski
Constructing Optimal k-Radius Sequences. SIAM J. Discret. Math. 30 (1) (2016)
Zbigniew Lonc, Miroslaw Truszczynski
Packing analogue of k-radius sequences. Eur. J. Comb. 57 (2016)
Michal Debski, Zbigniew Lonc
Universal Cycle Packings and Coverings for k-Subsets of an n-Set. Graphs Comb. 32 (6) (2016)
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
Sequences of Radius k for Complete Bipartite Graphs. WG (2016)
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
Harmonious and achromatic colorings of fragmentable hypergraphs. Electron. Notes Discret. Math. 49 (2015)
Michal Debski, Zbigniew Lonc
Sequences of large radius. Eur. J. Comb. 41 (2014)
Zbigniew Lonc, Nataliya Petryshyn
On Rooted Packings, Decompositions, and Factors of Graphs. J. Graph Theory 76 (2) (2014)
Zbigniew Lonc, Karolina Warno
Minimum size transversals in uniform hypergraphs. Discret. Math. 313 (23) (2013)
Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski
Constructions of asymptotically shortest k-radius sequences. J. Comb. Theory, Ser. A 119 (3) (2012)
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) (2012)
Jaroslaw Grytczuk, Zbigniew Lonc
Preface. Discret. Math. 312 (23) (2012)
Zbigniew Lonc, Miroslaw Truszczynski
On graph equivalences preserved under extensions. Discret. Math. 311 (12) (2011)
Konstanty Junosza-Szaniawski, Zbigniew Lonc, Michal Tuczynski
Counting Independent Sets in Claw-Free Graphs. WG (2011)
Zbigniew Lonc, Pawel Naroski
On Tours that Contain All Edges of a Hypergraph. Electron. J. Comb. 17 (1) (2010)
Krzysztof Brys, Zbigniew Lonc
Polynomial cases of graph decomposition: A complete solution of Holyer's problem. Discret. Math. 309 (6) (2009)
Zbigniew Lonc, Monika Pszczola
Edge decompositions into two kinds of graphs. Discret. Math. 309 (22) (2009)
Zbigniew Lonc, Miroslaw Truszczynski
On the number of minimal transversals in 3-uniform hypergraphs. Discret. Math. 308 (16) (2008)
Zbigniew Lonc, Miroslaw Truszczynski
Computing minimal models, stable models and answer sets. Theory Pract. Log. Program. 6 (4) (2006)
Zbigniew Lonc, Miroslaw Truszczynski
Computing minimal models, stable models and answer sets CoRR (2005)
Jerzy W. Jaromczyk, Zbigniew Lonc
Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations. ISAAC (2004)
Zbigniew Lonc, Miroslaw Truszczynski
Computing stable models: worst-case performance estimates. Theory Pract. Log. Program. 4 (1-2) (2004)
Mekkia Kouider, Zbigniew Lonc
]-factors in graphs. J. Graph Theory 46 (4) (2004)
Zbigniew Lonc, Mariusz Meszka, Zdzislaw Skupien
Edge Decompositions of Multigraphs into 3-Matchings. Graphs Comb. 20 (4) (2004)
Muktar E. Elzobi, Zbigniew Lonc
Partitioning Boolean lattices into antichains. Discret. Math. 260 (1-3) (2003)
Zbigniew Lonc, Miroslaw Truszczynski
Fixed-parameter complexity of semantics for logic programs. ACM Trans. Comput. Log. 4 (1) (2003)
Zbigniew Lonc, Miroslaw Truszczynski
Computing Minimal Models, Stable Models, and Answer Sets. ICLP (2003)
Zbigniew Lonc, Miroslaw Truszczynski
Computing Stable Models: Worst-Case Performance Estimates. ICLP (2002)
Zbigniew Lonc, Miroslaw Truszczynski
Computing stable models: worst-case performance estimates CoRR (2002)
Krzysztof Brys, Zbigniew Lonc
Monochromatic Partitions of Complete Uniform Hypergraphs. SIAM J. Discret. Math. 14 (3) (2001)
Zbigniew Lonc, Miroslaw Truszczynski
Fixed-Parameter Complexity of Semantics for Logic Programs. ICLP (2001)
Zbigniew Lonc, Miroslaw Truszczynski
Fixed-parameter complexity of semantics for logic programs CoRR (2001)
Zbigniew Lonc, Marian Srebrny
A Combinatorial Algorithm for Sharing a Key. ACS (2001)
Zbigniew Lonc, Miroslaw Truszczynski
On the problem of computing the well-founded semantics CoRR (2001)
Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski
On the number of spanning trees in directed circulant graphs. Networks 37 (3) (2001)
Zbigniew Lonc, Miroslaw Truszczynski
On the problem of computing the well-founded semantics. Theory Pract. Log. Program. 1 (5) (2001)
Zbigniew Lonc, Miroslaw Truszczynski
On the Problem of Computing the Well-Founded Semantics. Computational Logic (2000)
Zbigniew Lonc
On ordered sets without 2-colourings. Discret. Math. 201 (1-3) (1999)
Mekkia Kouider, Zbigniew Lonc
Path decompositions and perfect path double covers. Australas. J Comb. 19 (1999)
Zbigniew Lonc, Muktar E. Elzobi
Chain Partitions of Products of Two Chains. J. Comb. Theory, Ser. A 86 (1) (1999)
Krzysztof Brys, Zbigniew Lonc
Clique and anticlique partitions of graphs. Discret. Math. 185 (1-3) (1998)
Krzysztof Brys, Mekkia Kouider, Zbigniew Lonc, Maryvonne Mahéo
Decomposition of multigraphs. Discuss. Math. Graph Theory 18 (2) (1998)
Zbigniew Lonc
Is Polynomial. J. Comb. Theory, Ser. B 69 (2) (1997)
Zbigniew Lonc
Delta-system decompositions of graphs. Discret. Math. 164 (1-3) (1997)
Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs. Networks 30 (1) (1997)
Zbigniew Lonc
Clique packings and clique partitions of graphs without odd chordles cycles. Discuss. Math. Graph Theory 16 (2) (1996)
Zbigniew Lonc
On the Complexity of Some Edge-partition Problems for Graphs. Discret. Appl. Math. 70 (2) (1996)
Mekkia Kouider, Zbigniew Lonc
-Term Degree Sums. Comb. 16 (3) (1996)
Krzysztof Brys, Zbigniew Lonc
Clique and Anticlique Partition of Graphs. WG (1996)
Zbigniew Lonc
Partitions of large Boolean lattices. Discret. Math. 131 (1-3) (1994)
Zbigniew Lonc
Toward a Solution of the Holyer's Problem. WG (1993)
Zbigniew Lonc
Majorization, packing, covering and matroids. Discret. Math. 121 (1-3) (1993)
Zbigniew Lonc
Packing, covering and decomposing of a complete uniform hypergraph into delta-systems. Graphs Comb. 8 (4) (1992)
Zbigniew Lonc
Partitions, Packings and Coverings by Families with Nonempty Intersections. J. Comb. Theory, Ser. A 61 (2) (1992)
Zbigniew Lonc
On Complexity of Some Chain and Antichain Partition Problems. WG (1991)
Zbigniew Lonc
Solution of a delta-system decomposition problem. J. Comb. Theory, Ser. A 55 (1) (1990)
Zbigniew Lonc
On decomposition of hypergraphs into Delta-systems. J. Comb. Theory, Ser. A 52 (1) (1989)
Zbigniew Lonc
Decompositions of graphs into trees. J. Graph Theory 13 (4) (1989)
Zbigniew Lonc
On resolvable tree-decompositions of complete graphs. J. Graph Theory 12 (2) (1988)
Zbigniew Lonc, Ivan Rival
Chains, antichains, and fibres. J. Comb. Theory, Ser. A 44 (2) (1987)
Zbigniew Lonc
Decompositions of hypergraphs into hyperstars. Discret. Math. 66 (1-2) (1987)
Zbigniew Lonc
A Shotest Linear Organization for Some Uniform Multiattribute Files. FODO (1981)
Zbigniew Lonc, Tomasz Traczyk, Miroslaw Truszczynski
Optimal F-Graphs for the Family of all K-Subsets of an N-Set. FODO (1981)