Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Zbigniew Lonc
2010 – today
- 2012
[j37]- [j36]Zbigniew Lonc, Pawel Naroski: A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph. Discrete Mathematics & Theoretical Computer Science 14(1): 147-158 (2012)
- [j35]Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski: Constructions of asymptotically shortest k-radius sequences. J. Comb. Theory, Ser. A 119(3): 731-746 (2012)
- 2011
- [j34]Zbigniew Lonc, Miroslaw Truszczynski: On graph equivalences preserved under extensions. Discrete Mathematics 311(12): 966-977 (2011)
- [c11]Konstanty Junosza-Szaniawski, Zbigniew Lonc, Michal Tuczynski: Counting Independent Sets in Claw-Free Graphs. WG 2011: 227-237
- 2010
- [j33]Zbigniew Lonc, Pawel Naroski: On Tours that Contain All Edges of a Hypergraph. Electr. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j32]Krzysztof Brys, Zbigniew Lonc: Polynomial cases of graph decomposition: A complete solution of Holyer's problem. Discrete Mathematics 309(6): 1294-1326 (2009)
- [j31]Zbigniew Lonc, Monika Pszczola: Edge decompositions into two kinds of graphs. Discrete Mathematics 309(22): 6368-6374 (2009)
- 2008
- [j30]Zbigniew Lonc, Miroslaw Truszczynski: On the number of minimal transversals in 3-uniform hypergraphs. Discrete Mathematics 308(16): 3668-3687 (2008)
- 2006
- [j29]Zbigniew Lonc, Miroslaw Truszczynski: Computing minimal models, stable models and answer sets. TPLP 6(4): 395-449 (2006)
- 2005
- [i4]Zbigniew Lonc, Miroslaw Truszczynski: Computing minimal models, stable models and answer sets. CoRR abs/cs/0506104 (2005)
- 2004
- [j28]Zbigniew Lonc, Mariusz Meszka, Zdzislaw Skupien: Edge Decompositions of Multigraphs into 3-Matchings. Graphs and Combinatorics 20(4): 507-515 (2004)
- [j27]Mekkia Kouider, Zbigniew Lonc: Stability number and [a, b]-factors in graphs. Journal of Graph Theory 46(4): 254-264 (2004)
- [j26]Zbigniew Lonc, Miroslaw Truszczynski: Computing stable models: worst-case performance estimates. TPLP 4(1-2): 193-231 (2004)
- [c10]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
- 2003
- [j25]Muktar E. Elzobi, Zbigniew Lonc: Partitioning Boolean lattices into antichains. Discrete Mathematics 260(1-3): 45-55 (2003)
- [j24]Zbigniew Lonc, Miroslaw Truszczynski: Fixed-parameter complexity of semantics for logic programs. ACM Trans. Comput. Log. 4(1): 91-119 (2003)
- [c9]Zbigniew Lonc, Miroslaw Truszczynski: Computing Minimal Models, Stable Models, and Answer Sets. ICLP 2003: 209-223
- 2002
- [c8]Zbigniew Lonc, Miroslaw Truszczynski: Computing Stable Models: Worst-Case Performance Estimates. ICLP 2002: 347-362
- [i3]Zbigniew Lonc, Miroslaw Truszczynski: Computing stable models: worst-case performance estimates. CoRR cs.LO/0205013 (2002)
- 2001
- [j23]Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski: On the number of spanning trees in directed circulant graphs. Networks 37(3): 129-133 (2001)
- [j22]Krzysztof Brys, Zbigniew Lonc: Monochromatic Partitions of Complete Uniform Hypergraphs. SIAM J. Discrete Math. 14(3): 286-290 (2001)
- [j21]Zbigniew Lonc, Miroslaw Truszczynski: On the problem of computing the well-founded semantics. TPLP 1(5): 591-609 (2001)
- [c7]Zbigniew Lonc, Miroslaw Truszczynski: Fixed-Parameter Complexity of Semantics for Logic Programs. ICLP 2001: 197-211
- [i2]Zbigniew Lonc, Miroslaw Truszczynski: On the problem of computing the well-founded semantics. CoRR cs.LO/0101014 (2001)
- [i1]Zbigniew Lonc, Miroslaw Truszczynski: Fixed-parameter complexity of semantics for logic programs. CoRR cs.LO/0107027 (2001)
- 2000
- [c6]Zbigniew Lonc, Miroslaw Truszczynski: On the Problem of Computing the Well-Founded Semantics. Computational Logic 2000: 673-687
1990 – 1999
- 1999
- [j20]
- [j19]Zbigniew Lonc, Muktar E. Elzobi: Chain Partitions of Products of Two Chains. J. Comb. Theory, Ser. A 86(1): 140-150 (1999)
- 1998
- [j18]Krzysztof Brys, Zbigniew Lonc: Clique and anticlique partitions of graphs. Discrete Mathematics 185(1-3): 41-49 (1998)
- [j17]Krzysztof Brys, Mekkia Kouider, Zbigniew Lonc, Maryvonne Mahéo: Decomposition of multigraphs. Discussiones Mathematicae Graph Theory 18(2): 225-232 (1998)
- 1997
- [j16]
- [j15]Zbigniew Lonc: Edge Decomposition into Isomorphic Copies ofsK1, 2Is Polynomial. J. Comb. Theory, Ser. B 69(2): 164-182 (1997)
- [j14]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
- [j13]Mekkia Kouider, Zbigniew Lonc: Covering Cycles and k-Term Degree Sums. Combinatorica 16(3): 407-412 (1996)
- [j12]Zbigniew Lonc: On the Complexity of Some Edge-partition Problems for Graphs. Discrete Applied Mathematics 70(2): 177-183 (1996)
- [j11]Zbigniew Lonc: Clique packings and clique partitions of graphs without odd chordles cycles. Discussiones Mathematicae Graph Theory 16(2): 143-149 (1996)
- [c5]
- 1994
- [j10]
- 1993
- [j9]Zbigniew Lonc: Majorization, packing, covering and matroids. Discrete Mathematics 121(1-3): 151-157 (1993)
- [c4]
- 1992
- [j8]Zbigniew Lonc: Packing, covering and decomposing of a complete uniform hypergraph into delta-systems. Graphs and Combinatorics 8(4): 333-341 (1992)
- [j7]Zbigniew Lonc: Partitions, Packings and Coverings by Families with Nonempty Intersections. J. Comb. Theory, Ser. A 61(2): 263-278 (1992)
- 1991
- [c3]
- 1990
- [j6]Zbigniew Lonc: Solution of a delta-system decomposition problem. J. Comb. Theory, Ser. A 55(1): 33-48 (1990)
1980 – 1989
- 1989
- [j5]Zbigniew Lonc: On decomposition of hypergraphs into Delta-systems. J. Comb. Theory, Ser. A 52(1): 158-162 (1989)
- [j4]
- 1988
- [j3]Zbigniew Lonc: On resolvable tree-decompositions of complete graphs. Journal of Graph Theory 12(2): 295-303 (1988)
- 1987
- [j2]Zbigniew Lonc: Decompositions of hypergraphs into hyperstars. Discrete Mathematics 66(1-2): 157-168 (1987)
- [j1]Zbigniew Lonc, Ivan Rival: Chains, antichains, and fibres. J. Comb. Theory, Ser. A 44(2): 207-228 (1987)
- 1981
- [c2]Zbigniew Lonc: A Shotest Linear Organization for Some Uniform Multiattribute Files. FODO 1981: 137-150
- [c1]Zbigniew Lonc, Tomasz Traczyk, Miroslaw Truszczynski: Optimal F-Graphs for the Family of all K-Subsets of an N-Set. FODO 1981: 247-270
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-16 22:08 CEST by the dblp team