Zbigniew Lonc

Orcid: 0000-0001-6650-6774

According to our database1, Zbigniew Lonc authored at least 63 papers between 1981 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Approximating Fair Division on D-Claw-Free Graphs.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Edge decompositions and rooted packings of graphs.
Discret. Math., 2022

Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2020
Maximin Share Allocations on Cycles.
J. Artif. Intell. Res., 2020

Bundling all shortest paths.
Discret. Appl. Math., 2020

2018
Achromatic and Harmonious Colorings of Circulant Graphs.
J. Graph Theory, 2018

2017
Erratum: Constructing Optimal k-Radius Sequences.
SIAM J. Discret. Math., 2017

Tight Euler tours in uniform hypergraphs - computational aspects.
Discret. Math. Theor. Comput. Sci., 2017

Note on a construction of short k-radius sequences.
Discret. Math., 2017

Sequences of radius k for complete bipartite graphs.
Discret. Appl. Math., 2017

2016
Constructing Optimal k-Radius Sequences.
SIAM J. Discret. Math., 2016

Universal Cycle Packings and Coverings for k-Subsets of an n-Set.
Graphs Comb., 2016

Packing analogue of k-radius sequences.
Eur. J. Comb., 2016

2015
Harmonious and achromatic colorings of fragmentable hypergraphs.
Electron. Notes Discret. Math., 2015

2014
On Rooted Packings, Decompositions, and Factors of Graphs.
J. Graph Theory, 2014

Sequences of large radius.
Eur. J. Comb., 2014

2013
Minimum size transversals in uniform hypergraphs.
Discret. Math., 2013

2012
Constructions of asymptotically shortest k-radius sequences.
J. Comb. Theory A, 2012

A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph.
Discret. Math. Theor. Comput. Sci., 2012

Preface.
Discret. Math., 2012

2011
On graph equivalences preserved under extensions.
Discret. Math., 2011

Counting Independent Sets in Claw-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010
On Tours that Contain All Edges of a Hypergraph.
Electron. J. Comb., 2010

2009
Edge decompositions into two kinds of graphs.
Discret. Math., 2009

Polynomial cases of graph decomposition: A complete solution of Holyer's problem.
Discret. Math., 2009

2008
On the number of minimal transversals in 3-uniform hypergraphs.
Discret. Math., 2008

2006
Computing minimal models, stable models and answer sets.
Theory Pract. Log. Program., 2006

2004
Computing stable models: worst-case performance estimates.
Theory Pract. Log. Program., 2004

Stability number and [<i>a, b</i>]-factors in graphs.
J. Graph Theory, 2004

Edge Decompositions of Multigraphs into 3-Matchings.
Graphs Comb., 2004

Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003
Fixed-parameter complexity of semantics for logic programs.
ACM Trans. Comput. Log., 2003

Partitioning Boolean lattices into antichains.
Discret. Math., 2003

2001
On the problem of computing the well-founded semantics.
Theory Pract. Log. Program., 2001

Monochromatic Partitions of Complete Uniform Hypergraphs.
SIAM J. Discret. Math., 2001

On the number of spanning trees in directed circulant graphs.
Networks, 2001

A Combinatorial Algorithm for Sharing a Key.
Proceedings of the Advanced Computer Systems, Eighth International Conference, 2001

1999
Chain Partitions of Products of Two Chains.
J. Comb. Theory A, 1999

On ordered sets without 2-colourings.
Discret. Math., 1999

Path decompositions and perfect path double covers.
Australas. J Comb., 1999

1998
Decomposition of multigraphs.
Discuss. Math. Graph Theory, 1998

Clique and anticlique partitions of graphs.
Discret. Math., 1998

1997
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs.
Networks, 1997

Edge Decomposition into Isomorphic Copies of<i>sK</i><sub>1, 2</sub>Is Polynomial.
J. Comb. Theory B, 1997

Delta-system decompositions of graphs.
Discret. Math., 1997

1996
Clique packings and clique partitions of graphs without odd chordles cycles.
Discuss. Math. Graph Theory, 1996

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

Covering Cycles and <i>k</i>-Term Degree Sums.
Comb., 1996

Clique and Anticlique Partition of Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1994
Partitions of large Boolean lattices.
Discret. Math., 1994

1993
Majorization, packing, covering and matroids.
Discret. Math., 1993

Toward a Solution of the Holyer's Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992
Partitions, Packings and Coverings by Families with Nonempty Intersections.
J. Comb. Theory A, 1992

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

1991
On Complexity of Some Chain and Antichain Partition Problems.
Proceedings of the 17th International Workshop, 1991

1990
Solution of a delta-system decomposition problem.
J. Comb. Theory A, 1990

1989
Decompositions of graphs into trees.
J. Graph Theory, 1989

On decomposition of hypergraphs into Delta-systems.
J. Comb. Theory A, 1989

1988
On resolvable tree-decompositions of complete graphs.
J. Graph Theory, 1988

1987
Chains, antichains, and fibres.
J. Comb. Theory A, 1987

Decompositions of hypergraphs into hyperstars.
Discret. Math., 1987

1981
Optimal F-Graphs for the Family of all K-Subsets of an N-Set.
Proceedings of the Data Base File Organization, 1981

A Shotest Linear Organization for Some Uniform Multiattribute Files.
Proceedings of the Data Base File Organization, 1981


  Loading...