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="Griggs, J.R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constructions of optical orthogonal codes from finite geometry
T.L. Alderson
,
Keith E. Mellinger
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 785-793
Turán's theorem in the hypercube
Noga Alon
,
Anja Krech
,
Tibor Szabó
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 66-72
Graph powers, Delsarte, Hoffman, Ramsey, and Shannon
Noga Alon
,
Eyal Lubetzky
SIAM Journal on Discrete Mathematics
21
(2), 2007, pp. 329-348
Large complete bipartite subgraphs in incidence graphs of points and hyperplanes
Roel Apfelbaum
,
Micha Sharir
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 707-725
Every monotone 3-graph property is testable
Christian Avart
,
Vojtȇch Rödl
,
Mathias Schacht
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 73-92
Graphs having small number of sizes on induced
k
-subgraphs
Maria Axenovich
,
József Balogh
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 264-272
Labelings of graphs with fixed and variable edge-weights
Robert Babilon
,
Vít Jelínek
,
Daniel Král'
,
Pavel Valtr
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 688-706
Algorithms for fault-tolerant routing in circuit-switched networks
Amitabha Bagchi
,
Amitabh Chaudhary
,
Christian Scheideler
,
Petr Kolman
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 141-157
On the minimum order of extremal graphs to have a prescribed girth
C. Balbuena
,
P. García-V\'a}zquez
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 251-257
Adjacent vertex distinguishing edge-colorings
P.N. Balister
,
E. Györi
,
J. Lehel
,
R.H. Schelp
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 237-250
Quadratically many colorful simplices
Imre Bárány
,
Jiȓí Matous̑ek
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 191-198
The spectrum of the corona of two graphs
S. Barik
,
S. Pati
,
B.K. Sarma
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 47-56
Locating servers for reliability and affine embeddings
Kenneth A. Berman
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 637-646
Neighborhood broadcasting in hypercubes
Jean-Claude Bermond
,
Afonso Ferreira
,
Stéphane Pérennes
,
Joseph G. Peters
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 823-843
Recognizing chordal probe graphs and cycle-bicolorable graphs
Anne Berry
,
Martin Charles Golumbic
,
Marina Lipshteyn
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 573-591
Crossing graphs as joins of graphs and Cartesian products of median graphs
Bos̑tjan Bres̑ar
,
Sandi Klavz̑ar
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 26-32
On the metric dimension of Cartesian products of graphs
José Cáceres
,
Carmen Hernando
,
Mercè Mora
,
Ignacio M. Pelayo
,
María L. Puertas
,
Carlos Seara
,
David R. Wood
SIAM Journal on Discrete Mathematics
21
(2), 2007, pp. 423-441
The complexity of the list partition problem for graphs
Kathie Cameron
,
Elaine M. Eschen
,
Chinh T. Hoàng
,
R. Sritharan
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 900-929
On extremal
k
-graphs without repeated copies of 2-intersecting edges
Yeow Meng Chee
,
Alan C.H. Ling
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 805-821
Constructing finite field extensions with large order elements
Qi Cheng
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 726-730
Approximation algorithms for network design with metric costs
Joseph Cheriyan
,
Adrian Vetta
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 612-636
The complexity of combinatorial optimization problems on
d
-dimensional boxes
Miroslav Chlebík
,
Janka Chlebíková
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 158-169
A generalization of Kotzig's theorem and its application
Richard Cole
,
Łukasz Kowalik
,
Riste S̑krekovski
SIAM Journal on Discrete Mathematics
21
(1), 2007, pp. 93-106
The mixing set with flows
Michele Conforti
,
Marco Di Summa
,
Laurence A. Wolsey
SIAM Journal on Discrete Mathematics
21
(2), 2007, pp. 396-407
Packing odd circuits
Michele Conforti
,
Bert Gerards
SIAM Journal on Discrete Mathematics
21
(2), 2007, pp. 273-302
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>