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="Hell, P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Broadcasting in generalized chordal rings
F. Comellas
,
P. Hell
Networks
42
(3), 2003, pp. 123-134
Constructions of large planar networks with given degree and diameter
M. Fellows
,
P. Hell
,
K. Seyffarth
Networks
32
(4), 1998, pp. 275-281
Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament
E. Bampis
,
P. Hell
,
Y. Manoussakis
,
M. Rosenfeld
Lecture Notes in Computer Science
1120
, 1996, pp. 67-73
Complexity of tree homomorphisms
P. Hell
,
J. Nes̑etȓil
,
X. Zhu
Discrete Applied Mathematics
70
(1), 1996, pp. 23-36
Large planar graphs with given diameter and maximum degree
M. Fellows
,
P. Hell
,
K. Seyffarth
Discrete Applied Mathematics
61
, 1995, pp. 133-153
Packing problems in edge-colored graphs
P. Hell
,
Y. Manoussakis
,
Zs. Tuza
Discrete Applied Mathematics
52
(3), 1994, pp. 295-306
Algorithms for degree constrained graph factors of minimum deficiency
P. Hell
,
D.G. Kirkpatrick
Journal of Algorithms
14
(1), 1993, pp. 115-138
Graph endpoint coloring and distributed processing
D. de Werra
,
P. Hell
,
T. Kameda
,
N. Katoh
,
Ph. Solot
,
M. Yamashita
Networks
23
(2), 1993, pp. 93-98
On multiplicative graphs and the product conjecture
R. Häggkvist
,
P. Hell
,
D.J. Miller
,
V. Neumann Lara
Combinatorica
8
(1), 1988, pp. 63-74
Packings by complete bipartite graphs
P. Hell
,
D.G. Kirkpatrick
SIAM Journal on Algebraic Discrete Methods
7
, 1986, pp. 199-209
On the complexity of general graph factor problems
D.G. Kirkpatrick
,
P. Hell
SIAM Journal on Computing
12
(3), 1983, August, pp. 601-610
Parallel sorting with constant time for comparisons
R. Häggkvist
,
P. Hell
SIAM Journal on Computing
10
(3), 1981, August, pp. 465-472
On generalized matching problems
P. Hell
,
D.G. Kirkpatrick
Information Processing Letters
12
(1), 1981, February, pp. 33-35
On the completeness of a generalized matching problem
D.G. Kirkpatrick
,
P. Hell
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC'78 (San Diego, CA, May 1-3, 1978)
, 1978, pp. 240-245
Every finite graph is a full subgraph of a rigid graph
V. Chvátal
,
P. Hell
,
L. Kuc̑era
,
J. Nes̑etȓil
Journal of Combinatorial Theory Series B
11
, 1971, pp. 284-286