Zbigniew Lonc

From MaRDI portal
Person:298334

Available identifiers

zbMath Open lonc.zbigniewMaRDI QIDQ298334

List of research outcomes

PublicationDate of PublicationType
Towards a solution of the Holyer's problem2024-01-05Paper
Edge decompositions and rooted packings of graphs2022-09-26Paper
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws2022-05-26Paper
Maximin Share Allocations on Cycles2020-11-03Paper
Dilworth's Theorem for Borel Posets2020-04-05Paper
Bundling all shortest paths2020-03-23Paper
https://portal.mardi4nfdi.de/entity/Q45602032018-12-10Paper
Achromatic and Harmonious Colorings of Circulant Graphs2018-02-23Paper
Harmonious and achromatic colorings of fragmentable hypergraphs2017-09-11Paper
Fixed-parameter complexity of semantics for logic programs2017-06-13Paper
Erratum: Constructing Optimal $k$-Radius Sequences2017-05-24Paper
Sequences of radius \(k\) for complete bipartite graphs2017-05-12Paper
Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set2017-01-13Paper
Note on a construction of short \(k\)-radius sequences2016-12-22Paper
Sequences of Radius k for Complete Bipartite Graphs2016-12-22Paper
Harmonious and achromatic colorings of fragmentable hypergraphs2016-10-14Paper
Packing analogue of \(k\)-radius sequences2016-06-20Paper
Constructing Optimal $k$-Radius Sequences2016-04-04Paper
Exact and approximation algorithms for a soft rectangle packing problem2014-10-24Paper
Sequences of large radius2014-09-02Paper
On Rooted Packings, Decompositions, and Factors of Graphs2014-05-28Paper
https://portal.mardi4nfdi.de/entity/Q54030202014-03-25Paper
Minimum size transversals in uniform hypergraphs2014-01-24Paper
Constructions of asymptotically shortest \(k\)-radius sequences2012-02-11Paper
Counting Independent Sets in Claw-Free Graphs2011-12-16Paper
On graph equivalences preserved under extensions2011-05-16Paper
On tours that contain all edges of a hypergraph2010-12-16Paper
Edge decompositions into two kinds of graphs2009-12-15Paper
Logic Programming2009-08-06Paper
Polynomial cases of graph decomposition: A complete solution of Holyer's problem2009-06-17Paper
On the number of minimal transversals in 3-uniform hypergraphs2008-07-11Paper
Computing minimal models, stable models and answer sets2006-10-12Paper
https://portal.mardi4nfdi.de/entity/Q54813392006-08-09Paper
Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations2005-12-22Paper
Edge decompositions of multigraphs into 3-matchings2005-01-20Paper
https://portal.mardi4nfdi.de/entity/Q48208162004-10-01Paper
Computing stable models: worst-case performance estimates2004-09-24Paper
Stability number and [a,b‐factors in graphs]2004-08-16Paper
https://portal.mardi4nfdi.de/entity/Q48129702004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47365132004-08-09Paper
On the problem of computing the well-founded semantics2004-03-01Paper
https://portal.mardi4nfdi.de/entity/Q44059342003-08-25Paper
Partitioning Boolean lattices into antichains2003-03-16Paper
https://portal.mardi4nfdi.de/entity/Q27670952002-04-28Paper
On the number of spanning trees in directed circulant graphs2001-06-26Paper
Monochromatic Partitions of Complete Uniform Hypergraphs2001-06-21Paper
Clique and anticlique partitions of graphs2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q42622511999-11-11Paper
Chain partitions of products of two chains1999-10-18Paper
On ordered sets without 2-colourings1999-09-12Paper
Decomposition of multigraphs1999-06-29Paper
Delta-system decompositions of graphs1998-01-04Paper
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs1997-09-21Paper
Clique packings and clique partitions of graphs without odd chordles cycles1997-08-07Paper
https://portal.mardi4nfdi.de/entity/Q43367491997-06-26Paper
Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial1997-06-03Paper
Covering cycles and \(k\)-term degree sums1996-12-16Paper
On the complexity of some edge-partition problems for graphs1996-10-09Paper
https://portal.mardi4nfdi.de/entity/Q46975811996-04-08Paper
https://portal.mardi4nfdi.de/entity/Q46975841995-08-06Paper
Chain partitions of ordered sets1995-07-23Paper
https://portal.mardi4nfdi.de/entity/Q43266461995-03-22Paper
Fibres of width 3 ordered sets1995-02-16Paper
Partitions of large Boolean lattices1994-08-29Paper
Factors of claw-free graphs1994-08-28Paper
Majorization, packing, covering and matroids1994-05-05Paper
https://portal.mardi4nfdi.de/entity/Q42031741994-02-02Paper
https://portal.mardi4nfdi.de/entity/Q46947221993-06-29Paper
Packing, covering and decomposing of a complete uniform hypergraph into delta-systems1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40271761993-02-21Paper
Partitions, packings and coverings by families with nonempty intersections1993-01-17Paper
Proof of a conjecture on partitions of a Boolean lattice1992-06-27Paper
Solution of a delta-system decomposition problem1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39774991992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47130921992-06-25Paper
On decomposition of hypergraphs into \(\Delta\)-systems1989-01-01Paper
Decompositions of graphs into trees1989-01-01Paper
On resolvable tree-decompositions of complete graphs1988-01-01Paper
Chains, antichains, and fibres1987-01-01Paper
Decompositions of hypergraphs into hyperstars1987-01-01Paper
Decomposition of large uniform hypergraphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37416441985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37623461985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33350211983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33350221983-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Zbigniew Lonc