Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Lonc, Zbigniew"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On rooted packings, decompositions, and factors of graphs
Zbigniew Lonc
,
Nataliya Petryshyn
Journal of Graph Theory
76
(2), 2014, pp. 106-128
Constructions of asymptotically shortest
k
-radius sequences
Jerzy W. Jaromczyk
,
Zbigniew Lonc
,
Mirosƚaw Truszczyński
Journal of Combinatorial Theory Series A
119
(3), 2012, pp. 731-746
Counting independent sets in claw-free graphs
Konstanty Junosza-Szaniawski
,
Zbigniew Lonc
,
Michaƚ Tuczyński
Lecture Notes in Computer Science
6986
, 2011, pp. 227-237
Sequences of radius
k
: How to fetch many huge objects into small memory for pairwise computations
Jerzy W. Jaromczyk
,
Zbigniew Lonc
Lecture Notes in Computer Science
3341
, 2004, pp. 594-605
Stability number and
[a,b]
-factors in graphs
Mekkia Kouider
,
Zbigniew Lonc
Journal of Graph Theory
46
(4), 2004, pp. 254-264
Edge decompositions of multigraphs into 3-matchings
Zbigniew Lonc
,
Mariusz Meszka
,
Zdzisƚaw Skupień
Graphs and Combinatorics
20
(4), 2004, pp. 507-515
Monochromatic partitions of complete uniform hypergraphs
Krzysztof Bryś
,
Zbigniew Lonc
SIAM Journal on Discrete Mathematics
14
(3), 2001, pp. 286-290
On the number of spanning trees in directed circulant graphs
Zbigniew Lonc
,
Krzysztof Parol
,
Jacek M. Wojciechowski
Networks
37
(3), 2001, pp. 129-133
Chain partitions of products of two chains
Zbigniew Lonc
,
Muktar E. Elzobi
Journal of Combinatorial Theory Series A
86
(1), 1999, pp. 140-150
Clique and anticlique partitions of graphs
Krzysztof Bryś
,
Zbigniew Lonc
Lecture Notes in Computer Science
1197
, 1997, pp. 67-72
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
Zbigniew Lonc
,
Krzysztof Parol
,
Jacek M. Wojciechowski
Networks
30
(1), 1997, pp. 47-56
Edge decomposition into isomorphic copies of
sK_{1,2}
is polynomial
Zbigniew Lonc
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 164-182
Covering cycles and
k
-term degree sums
Mekkia Kouider
,
Zbigniew Lonc
Combinatorica
16
(3), 1996, pp. 407-412
On the complexity of some edge-partition problems for graphs
Zbigniew Lonc
Discrete Applied Mathematics
70
(2), 1996, pp. 177-183
Majorization, packing, covering and matroids
Zbigniew Lonc
Discrete Mathematics
121
(1-3), 1993, pp. 151-157
Towards a solution of the Holyer's problem
Zbigniew Lonc
Lecture Notes in Computer Science
790
, 1993, pp. 144-152
Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
Zbigniew Lonc
Graphs and Combinatorics
8
, 1992, pp. 333-341
Partitions, packings and coverings by families with nonempty intersections
Zbigniew Lonc
Journal of Combinatorial Theory Series A
61
(2), 1992, pp. 263-278
On complexity of some chain and antichain partition problem
Zbigniew Lonc
Technical Report (39), 1991, June
On complexity of some chain and antichain partition problems
Zbigniew Lonc
Lecture Notes in Computer Science
570
, 1991, pp. 97-104
Solution of a delta-system decomposition problem
Zbigniew Lonc
Journal of Combinatorial Theory Series A
55
, 1990, pp. 33-48
Decompositions of graphs into trees
Zbigniew Lonc
Journal of Graph Theory
13
(4), 1989, pp. 393-403
On decomposition of hypergraphs into
\Delta
-systems
Zbigniew Lonc
Journal of Combinatorial Theory Series A
52
, 1989, pp. 158-162
On resolvable tree-decompositions of complete graphs
Zbigniew Lonc
Journal of Graph Theory
12
(2), 1988, pp. 295-303
Chains, antichains, and fibres
Zbigniew Lonc
,
Ivan Rival
Journal of Combinatorial Theory Series A
44
, 1987, pp. 207-228