| 2008 |
|---|
| 39 | EE | Zbigniew Lonc,
Miroslaw Truszczynski:
On the number of minimal transversals in 3-uniform hypergraphs.
Discrete Mathematics 308(16): 3668-3687 (2008) |
| 2006 |
|---|
| 38 | EE | Zbigniew Lonc,
Miroslaw Truszczynski:
Computing minimal models, stable models and answer sets.
TPLP 6(4): 395-449 (2006) |
| 2005 |
|---|
| 37 | EE | Zbigniew Lonc,
Miroslaw Truszczynski:
Computing minimal models, stable models and answer sets
CoRR abs/cs/0506104: (2005) |
| 2004 |
|---|
| 36 | EE | Jerzy W. Jaromczyk,
Zbigniew Lonc:
Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations.
ISAAC 2004: 594-605 |
| 35 | EE | Zbigniew Lonc,
Mariusz Meszka,
Zdzislaw Skupien:
Edge Decompositions of Multigraphs into 3-Matchings.
Graphs and Combinatorics 20(4): 507-515 (2004) |
| 34 | EE | Mekkia Kouider,
Zbigniew Lonc:
Stability number and [a, b]-factors in graphs.
Journal of Graph Theory 46(4): 254-264 (2004) |
| 33 | | Zbigniew Lonc,
Miroslaw Truszczynski:
Computing stable models: worst-case performance estimates.
TPLP 4(1-2): 193-231 (2004) |
| 2003 |
|---|
| 32 | EE | Zbigniew Lonc,
Miroslaw Truszczynski:
Computing Minimal Models, Stable Models, and Answer Sets.
ICLP 2003: 209-223 |
| 31 | EE | Zbigniew Lonc,
Miroslaw Truszczynski:
Fixed-parameter complexity of semantics for logic programs.
ACM Trans. Comput. Log. 4(1): 91-119 (2003) |
| 30 | EE | Muktar E. Elzobi,
Zbigniew Lonc:
Partitioning Boolean lattices into antichains.
Discrete Mathematics 260(1-3): 45-55 (2003) |
| 2002 |
|---|
| 29 | EE | Zbigniew Lonc,
Miroslaw Truszczynski:
Computing Stable Models: Worst-Case Performance Estimates.
ICLP 2002: 347-362 |
| 28 | EE | Zbigniew Lonc,
Miroslaw Truszczynski:
Computing stable models: worst-case performance estimates
CoRR cs.LO/0205013: (2002) |
| 2001 |
|---|
| 27 | EE | Zbigniew Lonc,
Miroslaw Truszczynski:
Fixed-Parameter Complexity of Semantics for Logic Programs.
ICLP 2001: 197-211 |
| 26 | EE | Zbigniew Lonc,
Miroslaw Truszczynski:
On the problem of computing the well-founded semantics
CoRR cs.LO/0101014: (2001) |
| 25 | EE | Zbigniew Lonc,
Miroslaw Truszczynski:
Fixed-parameter complexity of semantics for logic programs
CoRR cs.LO/0107027: (2001) |
| 24 | EE | Zbigniew Lonc,
Krzysztof Parol,
Jacek Wojciechowski:
On the number of spanning trees in directed circulant graphs.
Networks 37(3): 129-133 (2001) |
| 23 | EE | Krzysztof Brys,
Zbigniew Lonc:
Monochromatic Partitions of Complete Uniform Hypergraphs.
SIAM J. Discrete Math. 14(3): 286-290 (2001) |
| 22 | | Zbigniew Lonc,
Miroslaw Truszczynski:
On the problem of computing the well-founded semantics.
TPLP 1(5): 591-609 (2001) |
| 2000 |
|---|
| 21 | EE | Zbigniew Lonc,
Miroslaw Truszczynski:
On the Problem of Computing the Well-Founded Semantics.
Computational Logic 2000: 673-687 |
| 1999 |
|---|
| 20 | EE | Zbigniew Lonc:
On ordered sets without 2-colourings.
Discrete Mathematics 201(1-3): 171-188 (1999) |
| 19 | EE | Zbigniew Lonc,
Muktar E. Elzobi:
Chain Partitions of Products of Two Chains.
J. Comb. Theory, Ser. A 86(1): 140-150 (1999) |
| 1998 |
|---|
| 18 | EE | Krzysztof Brys,
Zbigniew Lonc:
Clique and anticlique partitions of graphs.
Discrete Mathematics 185(1-3): 41-49 (1998) |
| 1997 |
|---|
| 17 | EE | Zbigniew Lonc:
Delta-system decompositions of graphs.
Discrete Mathematics 164(1-3): 221-224 (1997) |
| 16 | EE | Zbigniew Lonc:
Edge Decomposition into Isomorphic Copies ofsK1, 2Is Polynomial.
J. Comb. Theory, Ser. B 69(2): 164-182 (1997) |
| 15 | EE | Zbigniew Lonc,
Krzysztof Parol,
Jacek Wojciechowski:
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs.
Networks 30(1): 47-56 (1997) |
| 1996 |
|---|
| 14 | | Krzysztof Brys,
Zbigniew Lonc:
Clique and Anticlique Partition of Graphs.
WG 1996: 67-72 |
| 13 | | Mekkia Kouider,
Zbigniew Lonc:
Covering Cycles and k-Term Degree Sums.
Combinatorica 16(3): 407-412 (1996) |
| 12 | EE | Zbigniew Lonc:
On the Complexity of Some Edge-partition Problems for Graphs.
Discrete Applied Mathematics 70(2): 177-183 (1996) |
| 1994 |
|---|
| 11 | EE | Zbigniew Lonc:
Partitions of large Boolean lattices.
Discrete Mathematics 131(1-3): 173-181 (1994) |
| 1993 |
|---|
| 10 | | Zbigniew Lonc:
Toward a Solution of the Holyer's Problem.
WG 1993: 144-152 |
| 9 | EE | Zbigniew Lonc:
Majorization, packing, covering and matroids.
Discrete Mathematics 121(1-3): 151-157 (1993) |
| 1992 |
|---|
| 8 | | Zbigniew Lonc:
Partitions, Packings and Coverings by Families with Nonempty Intersections.
J. Comb. Theory, Ser. A 61(2): 263-278 (1992) |
| 1991 |
|---|
| 7 | | Zbigniew Lonc:
On Complexity of Some Chain and Antichain Partition Problems.
WG 1991: 97-104 |
| 1990 |
|---|
| 6 | EE | Zbigniew Lonc:
Solution of a delta-system decomposition problem.
J. Comb. Theory, Ser. A 55(1): 33-48 (1990) |
| 1989 |
|---|
| 5 | EE | Zbigniew Lonc:
On decomposition of hypergraphs into Delta-systems.
J. Comb. Theory, Ser. A 52(1): 158-162 (1989) |
| 1987 |
|---|
| 4 | EE | Zbigniew Lonc:
Decompositions of hypergraphs into hyperstars.
Discrete Mathematics 66(1-2): 157-168 (1987) |
| 3 | EE | Zbigniew Lonc,
Ivan Rival:
Chains, antichains, and fibres.
J. Comb. Theory, Ser. A 44(2): 207-228 (1987) |
| 1981 |
|---|
| 2 | | Zbigniew Lonc:
A Shotest Linear Organization for Some Uniform Multiattribute Files.
FODO 1981: 137-150 |
| 1 | | Zbigniew Lonc,
Tomasz Traczyk,
Miroslaw Truszczynski:
Optimal F-Graphs for the Family of all K-Subsets of an N-Set.
FODO 1981: 247-270 |
