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: Journal=SIAM J. Disc.~Math. AND YEAR=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Constructing finite field extensions with large order elements
Qi Cheng
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 726-730
A two-set problem on coloring the integers
Jeffrey A. Ryan
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 731-736
Crossing stars in topological graphs
Gábor Tardos
,
Géza Tóth
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 737-749
Optimal Lee-type local structures in Cartesian products of cycles and paths
Simon S̑pacapan
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 750-762
Cayley digraphs of finite Abelian groups and monomial ideals
Domingo Gómez
,
Jaime Gutierrez
,
Álvar Ibeas
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 763-784
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
Avoiding monochromatic sequences with special gaps
Bruce M. Landman
,
Aaron Robertson
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 794-801
On Rota's basis conjecture
Jim Geelen
,
Kerri Webb
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 802-804
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
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
Mod
(2p + 1)
-orientations and
K_{1,2p+1}
-decompositions
Hong-Jian Lai
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 844-850
On the existence of
(K_5 \setminus e)
-designs with application to optical networks
Gennian Ge
,
Alan C.H. Ling
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 851-864
Improved asymptotic bounds for codes using distinguished divisors of global function fields
Harald Niederreiter
,
Ferruh Özbudak
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 865-899
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
Lower bounds on locality sensitive hashing
Rajeev Motwani
,
Assaf Naor
,
Rina Panigrahy
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 930-935
A worst-case analysis of the sequential method to list the minimal hitting sets of a hypergraph
Ken Takata
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 936-946
On the number of fixed pairs in a random instance of the stable marriage problem
B. Pittel
,
L. Shepp
,
E. Veklerov
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 947-958
Constant weight conflict-avoiding codes
Koji Momihara
,
Meinard Müller
,
Junya Satoh
,
Masakazu Jimbo
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 959-979
Ramsey numbers and the size of graphs
Benny Sudakov
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 980-986
On
k
-term DNF with the largest number of prime implicants
Robert H. Sloan
,
Balázs Szörényi
,
György Turán
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 987-998
Coloring bull-free perfectly contractile graphs
Benjamin Lévéque
,
Frédéric Maffray
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 999-1018
Combinatorial optimization with explicit delineation of the ground set by a collection of subsets
Moshe Dror
,
James B. Orlin
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 1019-1034
Average distance and edge-connectivity II
Peter Dankelmann
,
Simon Mukwembi
,
Henda C. Swart
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 1035-1052
Explicit construction of small Folkman graphs
Linyuan Lu
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 1053-1060
Seiten
<
1
2
3
4
>