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: Journal=SIAM J. Disc.~Math. AND YEAR=2008
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Asymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs
Reza Akhtar
,
Tao Jiang
,
Zevi Miller
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 425-449
Polychromatic colorings of subcubes of the hypercube
David Offner
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 450-454
Matroid complexity and nonsuccinct descriptions
Dillon Mayhew
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 455-466
On Ramsey minimal graphs
V. Rödl
,
M. Siggers
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 467-488
Graph-different permutations
János Körner
,
Claudia Malvenuto
,
Gábor Simonyi
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 489-499
Realizing degree sequences with graphs having nowhere-zero 3-flows
Rong Luo
,
Rui Xu
,
Wenan Zang
,
Cun-Quan Zhang
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 500-519
Hamilton cycles in random lifts of directed graphs
Prasad Chebolu
,
Alan Frieze
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 520-540
Coloring of triangle-free graphs on the double torus
Daniel Král'
,
Matȇj Stehlík
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 541-553
Power domination in product graphs
Paul Dorbec
,
Michel Mollard
,
Sandi Klavz̑ar
,
Simon S̑pacapan
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 554-567
Planar graphs of odd-girth at least 9 are homomorphic to the Petersen graph
Z. Dvoȓák
,
R. S̑krekovski
,
T. Valla
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 568-591
Hat guessing games
Steve Butler
,
Mohammad T. Hajiaghayi
,
Robert D. Kleinberg
,
Tom Leighton
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 592-605
The windy general routing polyhedron: A global view of many known arc routing polyhedra
Angel Corberán
,
Isaac Plana
,
José M. Sanchis
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 606-628
On complexity of the subpattern problem
Shlomo Ahal
,
Yuri Rabinovich
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 629-649
Cubic monomial bent functions: A subclass of
\mathcal{M}
Pascale Charpin
,
Gohar M. Kyureghyan
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 650-665
Rank-width and well-quasi-ordering
Sang-il Oum
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 666-682
Coloring an orthogonality graph
C.D. Godsil
,
M.W. Newman
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 683-692
Finding a maximum independent set in a sparse random graph
Uriel Feige
,
Eran Ofek
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 693-718
A census of small Latin hypercubes
Brendan D. McKay
,
Ian M. Wanless
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 719-736
The nine morse generic tetrahedra
D. Siersma
,
M. van Manen
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 737-746
Walkers on the cycle and the grid
J. Díaz
,
X. Pérez
,
M.J. Serna
,
N.C. Wormald
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 747-775
Combinatorial properties of a rooted graph polynomial
David Eisenstat
,
Gary Gordon
,
Amanda Redlich
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 776-785
Testing triangle-freeness in general graphs
Noga Alon
,
Tali Kaufman
,
Michael Krivelevich
,
Dana Ron
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 786-819
A note on Reed's conjecture
Landon Rabern
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 820-827
The minimum number of distinct areas of triangles determined by a set of
n
points in the plane
Rom Pinchasi
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 828-831
On the complexity of ordered colorings
Arvind Gupta
,
Jan van den Heuvel
,
Ján Man̑uch
,
Ladislav Stacho
,
Xiaohong Zhao
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 832-847
Seiten
<
1
2
3
4
>