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
[1]
Hilfe
Suche: Author="Pritikin, Dan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Embedding multidimensional grids into optimal hypercubes
Zevi Miller
,
Dan Pritikin
,
I.H. Sudborough
Theoretical Computer Science
552
, 2014, pp. 52-82
Near optimal bounds for Steiner trees in the hypercube
Tao Jiang
,
Zevi Miller
,
Dan Pritikin
SIAM Journal on Computing
40
(5), 2011, pp. 1340-1360
Separation numbers of trees
Tao Jiang
,
Zevi Miller
,
Dan Pritikin
Theoretical Computer Science
410
(38-40), 2009, pp. 3769-3781
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem
Zevi Miller
,
Dan Pritikin
,
Manley Perkel
,
I.H. Sudborough
Networks
45
(3), 2005, pp. 143-164
All unit-distance graphs of order 6197 are 6-colorable
Dan Pritikin
Journal of Combinatorial Theory Series B
73
(2), 1998, pp. 159-163
Near embeddings of hypercubes into Cayley graphs on the symmetric group
Zevi Miller
,
Dan Pritikin
,
I. Hal Sudborough
IEEE Transactions on Computers
43
(1), 1994, January, pp. 13-22
The bichromaticity of cylinder graphs and torus graphs
Dan Pritikin
Journal of Graph Theory
11
(1), 1987, pp. 101-111
Applying a proof of Tverberg to complete bipartite decompositions of digraphs and multigraphs
Dan Pritikin
Journal of Graph Theory
10
(2), 1986, pp. 197-201
Bichromaticity of bipartite graphs
Dan Pritikin
Journal of Graph Theory
9
(4), 1985, pp. 497-502