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 Volume=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A bound on the precision required to estimate a Boolean perceptron from its average satisfying assignment
Paul W. Goldberg
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 328-343
The minor crossing number
Drago Bokal
,
Gas̑per Fijavz̑
,
Bojan Mohar
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 344-356
The bidimensional theory of bounded-genus graphs
Erik D. Demaine
,
MohammadTaghi Hajiaghayi
,
Dimitrios M. Thilikos
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 357-371
Classification of bipartite Boolean constraint satisfaction through delta-matroid intersection
Tomás Feder
,
Daniel Ford
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 372-394
The volume of the giant component of a random graph with given expected degrees
Fan Chung
,
Linyuan Lu
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 395-411
On the spanning ratio of Gabriel graphs and
\beta
-skeletons
Prosenjit Bose
,
Luc Devroye
,
William Evans
,
David Kirkpatrick
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 412-427
Full color theorems for
L(2,1)
-colorings
Peter C. Fishburn
,
Fred S. Roberts
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 428-443
A linear-time algorithm for finding a maximal planar subgraph
Hristo N. Djidjev
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 444-462
Sparse sourcewise and pairwise distance preservers
Don Coppersmith
,
Michael Elkin
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 463-501
On the greedy superstring conjecture
Maik Weinard
,
Georg Schnitger
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 502-522
A note on unsatisfiable
k
-CNF formulas with few occurrences per variable
Shlomo Hoory
,
Stefan Szeider
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 523-528
On graph associations
Landon Rabern
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 529-535
Construction of large graphs with no optimal surjective
L(2,1)
-labelings
Daniel Král'
,
Riste S̑krekovski
,
Martin Tancer
SIAM Journal on Discrete Mathematics
20
(2), 2006, pp. 536-543
On preemptive resource constrained scheduling: Polynomial-time approximation schemes
Klaus Jansen
,
Lorant Porkolab
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 545-563
Multicolored parallelisms of isomorphic spanning trees
S. Akbari
,
A. Alipour
,
H.L. Fu
,
Y.H. Lo
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 564-567
Autocorrelations of maximum period FCSR sequences
Hong Xu
,
Wen-Feng Qi
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 568-577
A splitter theorem for internally 4-connected binary matroids
Jim Geelen
,
Xiangqian Zhou
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 578-587
Matroid
T
-connectivity
Jim Geelen
,
Bert Gerards
,
Geoff Whittle
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 588-596
A note on quasi-triangulated graphs
Ion Gorgos
,
Chính T. Hoàng
,
Vitaly Voloshin
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 597-602
Cycle decompositions of
K_{n,n}-I
Jun Ma
,
Liqun Pu
,
Hao Shen
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 603-609
Shortest paths in the tower of Hanoi graph and finite automata
Dan Romik
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 610-622
Dense arrangements are locally very dense. I
József Solymosi
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 623-627
Comparing partial rankings
Ronald Fagin
,
Ravi Kumar
,
Mohammad Mahdian
,
D. Sivakumar
,
Erik Vee
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 628-648
A combinatorial interpretation of the Chebyshev polynomials
Emanuele Munarini
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 649-655
A new periodicity lemma
Kangmin Fan
,
Simon J. Puglisi
,
W.F. Smyth
,
Andrew Turpin
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 656-668
Seiten
<
1
2
3
4
>