Zbigniew Lonc
Zbigniew Lonc
profesor matematyki, Politechnika Warszawska
Verified email at mini.pw.edu.pl
Title
Cited by
Cited by
Year
Chains, antichains, and fibres
Z Lonc, I Rival
Journal of Combinatorial Theory, Series A 44 (2), 207-228, 1987
511987
On complexity of some chain and antichain partition problems
Z Lonc
International Workshop on Graph-Theoretic Concepts in Computer Science, 97-104, 1991
371991
Decomposition of graphs into graphs with three edges
O Favaron, Z Lonc, M Truszczynski
Ars Combinatoria 20, 125-146, 1985
291985
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
212001
Path decompositions and perfect path double covers
M Kouider, Z Lonc
Australasian Journal of Combinatorics 19, 261-274, 1999
211999
Proof of a conjecture on partitions of a Boolean lattice
Z Lonc
Order 8 (1), 17-27, 1991
171991
Decomposition of large uniform hypergraphs
Z Lonc, M Truszczyński
Order 1 (4), 345-350, 1985
171985
Exact and approximation algorithms for a soft rectangle packing problem
A Fügenschuh, K Junosza-Szaniawski, Z Lonc
Optimization 63 (11), 1637-1663, 2014
162014
Covering cycles andk-term degree sums
M Kouider, Z Lonc
Combinatorica 16 (3), 407-412, 1996
161996
Sequences of radius k: how to fetch many huge objects into small memory for pairwise computations
JW Jaromczyk, Z Lonc
International Symposium on Algorithms and Computation, 594-605, 2004
152004
On tours that contain all edges of a hypergraph
Z Lonc, P Naroski
The electronic journal of combinatorics, R144-R144, 2010
142010
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
132012
Fixed-parameter complexity of semantics for logic programs
Z Lonc, M Truszczyński
ACM Transactions on Computational Logic (TOCL) 4 (1), 91-119, 2003
132003
On the problem of computing the well-founded semantics
Z Lone, M Truszczyński
International Conference on Computational Logic, 673-687, 2000
132000
Decomposition of multigraphs
M Kouider, M Mahéo, K Bryś, Z Lonc
Discussiones Mathematicae Graph Theory 18 (2), 225-232, 1998
131998
Computing minimal models, stable models and answer sets
Z Lonc, M Truszczyński
Theory and Practice of Logic Programming 6 (4), 395-449, 2006
122006
Stability number and [a,b]‐factors in graphs
M Kouider, Z Lonc
Journal of Graph Theory 46 (4), 254-264, 2004
122004
Edge Decomposition into Isomorphic Copies ofsK1, 2Is Polynomial
Z Lonc
journal of combinatorial theory, Series B 69 (2), 164-182, 1997
121997
Minimum size transversals in uniform hypergraphs
Z Lonc, K Warno
Discrete Mathematics 313 (23), 2798-2815, 2013
102013
On the problem of computing the well-founded semantics
Z Lonc, M Truszczynski
arXiv preprint cs/0101014, 2001
102001
The system can't perform the operation now. Try again later.
Articles 1–20