Zbigniew Lonc

81 papers A* 2A 1B 10Journal 64Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Approximating Proportional and Maximin Allocations on D-Claw-Free Graphs.
J. Artif. Intell. Res.
Zbigniew Lonc
2025 A conf
On Approximate MMS Allocations on Restricted Graph Classes.
ECAI
Václav Blazej, Michal Debski, Zbigniew Lonc, Marta Piecyk, Pawel Rzazewski
2025 J jnl
On Approximate MMS Allocations on Restricted Graph Classes.
CoRR
Václav Blazej, Michal Debski, Zbigniew Lonc, Marta Piecyk, Pawel Rzazewski
2023 A* conf
Approximating Fair Division on D-Claw-Free Graphs.
IJCAI
Zbigniew Lonc
2022 B conf
Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws.
ISAAC
Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
2022 J jnl
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws.
CoRR
Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
2022 J jnl
Edge decompositions and rooted packings of graphs.
Discret. Math.
Zbigniew Lonc, Nataliya Petryshyn
2020 J jnl
Bundling all shortest paths.
Discret. Appl. Math.
Michal Debski, Konstanty Junosza-Szaniawski, Zbigniew Lonc
2020 J jnl
Maximin Share Allocations on Cycles.
J. Artif. Intell. Res.
Miroslaw Truszczynski, Zbigniew Lonc
2019 J jnl
Maximin share allocations on cycles.
CoRR
Zbigniew Lonc, Miroslaw Truszczynski
2018 J jnl
Achromatic and Harmonious Colorings of Circulant Graphs.
J. Graph Theory
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2018 A* conf
Maximin Share Allocations on Cycles.
IJCAI
Zbigniew Lonc, Miroslaw Truszczynski
2017 J jnl
Erratum: Constructing Optimal k-Radius Sequences.
SIAM J. Discret. Math.
J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski
2017 J jnl
Harmonious and achromatic colorings of fragmentable hypergraphs.
Eur. J. Comb.
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2017 J jnl
Note on a construction of short k-radius sequences.
Discret. Math.
Zbigniew Lonc
2017 J jnl
Sequences of radius k for complete bipartite graphs.
CoRR
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2017 J jnl
Sequences of radius k for complete bipartite graphs.
Discret. Appl. Math.
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2017 J jnl
Tight Euler tours in uniform hypergraphs - computational aspects.
CoRR
Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski
2017 J jnl
Tight Euler tours in uniform hypergraphs - computational aspects.
Discret. Math. Theor. Comput. Sci.
Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski
2016 J jnl
Constructing Optimal k-Radius Sequences.
SIAM J. Discret. Math.
J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski
2016 J jnl
Packing analogue of k-radius sequences.
Eur. J. Comb.
Zbigniew Lonc, Miroslaw Truszczynski
2016 B conf
Sequences of Radius k for Complete Bipartite Graphs.
WG
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2016 J jnl
Universal Cycle Packings and Coverings for k-Subsets of an n-Set.
Graphs Comb.
Michal Debski, Zbigniew Lonc
2015 J jnl
Harmonious and achromatic colorings of fragmentable hypergraphs.
Electron. Notes Discret. Math.
Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2014 J jnl
On Rooted Packings, Decompositions, and Factors of Graphs.
J. Graph Theory
Zbigniew Lonc, Nataliya Petryshyn
2014 J jnl
Sequences of large radius.
Eur. J. Comb.
Michal Debski, Zbigniew Lonc
2013 J jnl
Minimum size transversals in uniform hypergraphs.
Discret. Math.
Zbigniew Lonc, Karolina Warno
2012 J jnl
A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph.
Discret. Math. Theor. Comput. Sci.
Zbigniew Lonc, Pawel Naroski
2012 J jnl
Constructions of asymptotically shortest k-radius sequences.
J. Comb. Theory A
Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski
2012 J jnl
Preface.
Discret. Math.
Jaroslaw Grytczuk, Zbigniew Lonc
2011 B conf
Counting Independent Sets in Claw-Free Graphs.
WG
Konstanty Junosza-Szaniawski, Zbigniew Lonc, Michal Tuczynski
2011 J jnl
On graph equivalences preserved under extensions.
Discret. Math.
Zbigniew Lonc, Miroslaw Truszczynski
2010 J jnl
On Tours that Contain All Edges of a Hypergraph.
Electron. J. Comb.
Zbigniew Lonc, Pawel Naroski
2009 J jnl
Edge decompositions into two kinds of graphs.
Discret. Math.
Zbigniew Lonc, Monika Pszczola
2009 J jnl
Polynomial cases of graph decomposition: A complete solution of Holyer's problem.
Discret. Math.
Krzysztof Brys, Zbigniew Lonc
2008 J jnl
On the number of minimal transversals in 3-uniform hypergraphs.
Discret. Math.
Zbigniew Lonc, Miroslaw Truszczynski
2006 J jnl
Computing minimal models, stable models and answer sets.
Theory Pract. Log. Program.
Zbigniew Lonc, Miroslaw Truszczynski
2005 J jnl
Computing minimal models, stable models and answer sets
CoRR
Zbigniew Lonc, Miroslaw Truszczynski
2004 J jnl
Computing stable models: worst-case performance estimates.
Theory Pract. Log. Program.
Zbigniew Lonc, Miroslaw Truszczynski
2004 J jnl
Edge Decompositions of Multigraphs into 3-Matchings.
Graphs Comb.
Zbigniew Lonc, Mariusz Meszka, Zdzislaw Skupien
2004 B conf
Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations.
ISAAC
Jerzy W. Jaromczyk, Zbigniew Lonc
2004 J jnl
Stability number and [
J. Graph Theory
Mekkia Kouider, Zbigniew Lonc
2003 B conf
Computing Minimal Models, Stable Models, and Answer Sets.
ICLP
Zbigniew Lonc, Miroslaw Truszczynski
2003 J jnl
Fixed-parameter complexity of semantics for logic programs.
ACM Trans. Comput. Log.
Zbigniew Lonc, Miroslaw Truszczynski
2003 J jnl
Partitioning Boolean lattices into antichains.
Discret. Math.
Muktar E. Elzobi, Zbigniew Lonc
2002 B conf
Computing Stable Models: Worst-Case Performance Estimates.
ICLP
Zbigniew Lonc, Miroslaw Truszczynski
2002 J jnl
Computing stable models: worst-case performance estimates
CoRR
Zbigniew Lonc, Miroslaw Truszczynski
2001 — conf
A Combinatorial Algorithm for Sharing a Key.
ACS
Zbigniew Lonc, Marian Srebrny
2001 B conf
Fixed-Parameter Complexity of Semantics for Logic Programs.
ICLP
Zbigniew Lonc, Miroslaw Truszczynski
2001 J jnl
Fixed-parameter complexity of semantics for logic programs
CoRR
Zbigniew Lonc, Miroslaw Truszczynski
2001 J jnl
Monochromatic Partitions of Complete Uniform Hypergraphs.
SIAM J. Discret. Math.
Krzysztof Brys, Zbigniew Lonc
2001 J jnl
On the number of spanning trees in directed circulant graphs.
Networks
Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski
2001 J jnl
On the problem of computing the well-founded semantics
CoRR
Zbigniew Lonc, Miroslaw Truszczynski
2001 J jnl
On the problem of computing the well-founded semantics.
Theory Pract. Log. Program.
Zbigniew Lonc, Miroslaw Truszczynski
2000 — conf
On the Problem of Computing the Well-Founded Semantics.
Computational Logic
Zbigniew Lonc, Miroslaw Truszczynski
1999 J jnl
Chain Partitions of Products of Two Chains.
J. Comb. Theory A
Zbigniew Lonc, Muktar E. Elzobi
1999 J jnl
On ordered sets without 2-colourings.
Discret. Math.
Zbigniew Lonc
1999 J jnl
Path decompositions and perfect path double covers.
Australas. J Comb.
Mekkia Kouider, Zbigniew Lonc
1998 J jnl
Clique and anticlique partitions of graphs.
Discret. Math.
Krzysztof Brys, Zbigniew Lonc
1998 J jnl
Decomposition of multigraphs.
Discuss. Math. Graph Theory
Krzysztof Brys, Mekkia Kouider, Zbigniew Lonc, Maryvonne Mahéo
1997 J jnl
Delta-system decompositions of graphs.
Discret. Math.
Zbigniew Lonc
1997 J jnl
Edge Decomposition into Isomorphic Copies of
J. Comb. Theory B
Zbigniew Lonc
1997 J jnl
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs.
Networks
Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski
1996 B conf
Clique and Anticlique Partition of Graphs.
WG
Krzysztof Brys, Zbigniew Lonc
1996 J jnl
Clique packings and clique partitions of graphs without odd chordles cycles.
Discuss. Math. Graph Theory
Zbigniew Lonc
1996 J jnl
Covering Cycles and
Comb.
Mekkia Kouider, Zbigniew Lonc
1996 J jnl
On the Complexity of Some Edge-partition Problems for Graphs.
Discret. Appl. Math.
Zbigniew Lonc
1994 J jnl
Partitions of large Boolean lattices.
Discret. Math.
Zbigniew Lonc
1993 J jnl
Majorization, packing, covering and matroids.
Discret. Math.
Zbigniew Lonc
1993 B conf
Toward a Solution of the Holyer's Problem.
WG
Zbigniew Lonc
1992 J jnl
Packing, covering and decomposing of a complete uniform hypergraph into delta-systems.
Graphs Comb.
Zbigniew Lonc
1992 J jnl
Partitions, Packings and Coverings by Families with Nonempty Intersections.
J. Comb. Theory A
Zbigniew Lonc
1991 B conf
On Complexity of Some Chain and Antichain Partition Problems.
WG
Zbigniew Lonc
1990 J jnl
Solution of a delta-system decomposition problem.
J. Comb. Theory A
Zbigniew Lonc
1989 J jnl
Decompositions of graphs into trees.
J. Graph Theory
Zbigniew Lonc
1989 J jnl
On decomposition of hypergraphs into Delta-systems.
J. Comb. Theory A
Zbigniew Lonc
1988 J jnl
On resolvable tree-decompositions of complete graphs.
J. Graph Theory
Zbigniew Lonc
1987 J jnl
Chains, antichains, and fibres.
J. Comb. Theory A
Zbigniew Lonc, Ivan Rival
1987 J jnl
Decompositions of hypergraphs into hyperstars.
Discret. Math.
Zbigniew Lonc
1981 — conf
A Shotest Linear Organization for Some Uniform Multiattribute Files.
FODO
Zbigniew Lonc
1981 — conf
Optimal F-Graphs for the Family of all K-Subsets of an N-Set.
FODO
Zbigniew Lonc, Tomasz Traczyk, Miroslaw Truszczynski