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
[3]
Hilfe
Suche: Journal=SIAM J. Disc.~Math. AND YEAR=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An interlacing result on normalized Laplacians
Guantao Chen
,
George Davis
,
Frank Hall
,
Zhongshan Li
,
Kinnari Patel
,
Michael Stewart
SIAM Journal on Discrete Mathematics
18
(2), 2004, pp. 353-361
Three-dimensional periodicity and its application to pattern matching
Zvi Galil
,
Jong Geun Park
,
Kunsoo Park
SIAM Journal on Discrete Mathematics
18
(2), 2004, pp. 362-381
Resolving the existence of full-rank tilings of binary Hamming spaces
Patric R.J. Östergård
,
Alexander Vardy
SIAM Journal on Discrete Mathematics
18
(2), 2004, pp. 382-387
Extremal graphs without topological complete subgraphs
M. Cera
,
A. Diánez
,
A. Márquez
SIAM Journal on Discrete Mathematics
18
(2), 2004, pp. 388-396
Noncrossing partitions for the group
D_n
Christos A. Athanasiadis
,
Victor Reiner
SIAM Journal on Discrete Mathematics
18
(2), 2004, pp. 397-417
On the multiplicity of parts in a random composition of a large integer
Pawel Hitczenko
,
Carla D. Savage
SIAM Journal on Discrete Mathematics
18
(2), 2004, pp. 418-435
Split-perfect graphs: Characterizations and algorithmic use
Andreas Brandstädt
,
Van Bang Le
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 341-360
Coloring the maximal cliques of graphs
Gábor Bacsó
,
Sylvain Gravier
,
András Gyárfás
,
Myriam Preissmann
,
András Sebŏ
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 361-376
Number theoretic designs for directed regular graphs of small diameter
William D. Banks
,
Alessandro Conflitti
,
Igor E. Shparlinski
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 377-383
Improved approximation algorithms for the demand routing and slotting problem with unit demands on rings
Christine T. Cheng
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 384-402
Graph imperfection with a co-site constraint
Stefanie Gerke
,
Colin McDiarmid
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 403-425
Error exponents of expander codes under linear-complexity decoding
Alexander Barg
,
Gilles Zémor
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 426-445
Equivalence of the 1-rate model to the classical model on strictly nonblocking switching networks
W.R. Chen
,
F.K. Hwang
,
Xuding Zhu
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 446-452
Constraint satisfaction problems on intervals and lengths
Andrei Krokhin
,
Peter Jeavons
,
Peter Jonsson
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 453-477
The degree-diameter problem for several varieties of Cayley graphs I: The Abelian case
Randall Dougherty
,
Vance Faber
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 478-519
Lower bounds on the broadcasting and gossiping time of restricted protocols
Michele Flammini
,
Stéphane Pérennès
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 521-540
On local versus global satisfiability
Luca Trevisan
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 541-547
On the maximal codes of length 3 with the 2-identifiable parent property
Vu Dong Tô
,
Reihaneh Safavi-Naini
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 548-570
Radius three trees in graphs with large chromatic number
H.A. Kierstead
,
Yingxian Zhu
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 571-581
Minimizing wirelength in zero and bounded skew clock trees
Moses Charikar
,
Jon Kleinberg
,
Ravi Kumar
,
Sridhar Rajagopalan
,
Amit Sahai
,
Andrew Tomkins
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 582-595
Encoding fullerenes and geodesic domes
Jack E. Graver
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 596-614
Independent sets in regular hypergraphs and multidimensional runlength-limited constraints
Erik Ordentlich
,
Ron M. Roth
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 615-623
On distributions computable by random walks on graphs
Guy Kindler
,
Dan Romik
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 624-633
Listen to your neighbors: How (not) to reach a consensus
Nabil H. Mustafa
,
Aleksandar Pekec̑
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 634-660
Fractional packing of
T
-joins
Francisco Barahona
SIAM Journal on Discrete Mathematics
17
(4), 2004, pp. 661-669
Seiten
<
1
2
3
>