The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Zbigniew Lonc: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  38. Computing minimal models, stable models and answer sets [Citation Graph (, )][DBLP]


  39. On the number of minimal transversals in 3-uniform hypergraphs. [Citation Graph (, )][DBLP]


  40. Edge decompositions into two kinds of graphs. [Citation Graph (, )][DBLP]


  41. Polynomial cases of graph decomposition: A complete solution of Holyer's problem. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002