| Chains, antichains, and fibres Z Lonc, I Rival Journal of Combinatorial Theory, Series A 44 (2), 207-228, 1987 | 57 | 1987 |
| On complexity of some chain and antichain partition problems Z Lonc Graph-Theoretic Concepts in Computer Science: 17th International Workshop …, 1992 | 43 | 1992 |
| Decomposition of graphs into graphs with three edges O Favaron, Z Lonc, M Truszczynski Ars Combin 20, 125-146, 1985 | 33 | 1985 |
| Exact and approximation algorithms for a soft rectangle packing problem A Fügenschuh, K Junosza-Szaniawski, Z Lonc Optimization 63 (11), 1637-1663, 2014 | 30 | 2014 |
| Stability number and [a,b]‐factors in graphs M Kouider, Z Lonc Journal of graph Theory 46 (4), 254-264, 2004 | 29 | 2004 |
| Maximin share allocations on cycles M Truszczynski, Z Lonc Journal of Artificial Intelligence Research 69, 613-655, 2020 | 26 | 2020 |
| On the problem of computing the well-founded semantics Z Lonc, M Truszczyński Theory and practice of Logic Programming 1 (5), 591-609, 2001 | 26 | 2001 |
| On the number of spanning trees in directed circulant graphs Z Lonc, K Parol, JM Wojciechowski Networks: An International Journal 37 (3), 129-133, 2001 | 25 | 2001 |
| Path decompositions and perfect path double covers M Kouider, Z Lonc Australasian Journal of Combinatorics 19, 261-274, 1999 | 25 | 1999 |
| On tours that contain all edges of a hypergraph Z Lonc, P Naroski The electronic journal of combinatorics, R144-R144, 2010 | 22 | 2010 |
| Maximin share allocations on cycles Z Lonc, M Truszczynski arXiv preprint arXiv:1905.03038, 2019 | 21 | 2019 |
| Decomposition of large uniform hypergraphs Z Lonc, M Truszczyński Order 1, 345-350, 1985 | 20 | 1985 |
| Covering cycles andk-term degree sums M Kouider, Z Lonc Combinatorica 16 (3), 407-412, 1996 | 18 | 1996 |
| Proof of a conjecture on partitions of a Boolean lattice Z Lonc Order 8, 17-27, 1991 | 17 | 1991 |
| Minimum size transversals in uniform hypergraphs Z Lonc, K Warno Discrete Mathematics 313 (23), 2798-2815, 2013 | 16 | 2013 |
| Fixed-parameter complexity of semantics for logic programs Z Lonc, M Truszczyński ACM Transactions on Computational Logic (TOCL) 4 (1), 91-119, 2003 | 16 | 2003 |
| Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations JW Jaromczyk, Z Lonc Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong …, 2005 | 15 | 2005 |
| Constructions of asymptotically shortest k-radius sequences JW Jaromczyk, Z Lonc, M Truszczyński Journal of Combinatorial Theory, Series A 119 (3), 731-746, 2012 | 13 | 2012 |
| Computing minimal models, stable models and answer sets Z Lonc, M Truszczyński Theory and Practice of Logic Programming 6 (4), 395-449, 2006 | 13 | 2006 |
| Decomposition of multigraphs M Kouider, M Mahéo, K Bryś, Z Lonc Discussiones Mathematicae Graph Theory 18 (2), 225-232, 1998 | 13 | 1998 |
