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=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Upward topological book embeddings of DAGs
Emilio Di Giacomo
,
Francesco Giordano
,
Giuseppe Liotta
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 479-489
Near-unanimity polymorphisms on structures with finite duality
Cynthia Loten
,
Claude Tardif
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 490-496
Searching for a visible, lazy fugitive
David Richerby
,
Dimitrios M. Thilikos
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 497-513
Every plane graph of maximum degree 8 has an edge-face 9-coloring
Ross J. Kang
,
Jean-Sébastien Sereni
,
Matȇj Stehlík
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 514-533
On vertex partitions of hypercubes by isometric trees
Michel Mollard
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 534-538
Bijective proof of a symplectic dual pair identity
A.M. Hamel
,
R.C. King
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 539-560
Estimate of the Bézout number for linear piecewise algebraic curves over arbitrary triangulations
Shaofan Wang
,
Renhong Wang
,
Dehui Kong
,
Baocai Yin
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 561-582
Parameterized complexity of arc-weighted directed Steiner problems
Jiong Guo
,
Rolf Niedermeier
,
Ondȓej Suchý
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 583-599
The
\alpha
-arboricity of complete uniform hypergraphs
J.-C. Bermond
,
Y.M. Chee
,
N. Cohen
,
X. Zhang
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 600-610
Eulerian subgraphs containing given vertices
Zhao. Zhang
,
Hao Li
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 611-621
Two-generator numerical semigroups and Fermat and Mersenne numbers
Shalom Eliahou
,
Jorge Ramírez Alfonsín
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 622-630
Sparse balanced partitions and the complexity of subgraph problems
Noga Alon
,
Dániel Marx
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 631-644
Boundary length of reconstructions in discrete tomography
Birgit van Dalen
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 645-659
The bipartite swapping trick on graph homomorphisms
Yufei Zhao
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 660-680
The Erdŏs-Falconer distance problem on the unit sphere in vector spaces over finite fields
Le Anh Vinh
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 681-684
On a certain generalization of the Balog-Szemerédi-Gowers theorem
Evan Borenstein
,
Ernie Croot
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 685-694
Augmenting undirected node-connectivity by one
László A. Végh
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 695-718
On the zone complexity of a vertex
Shira Zerbib
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 719-730
Erratum to ``Lot-sizing with stock upper bounds and fixed charges''
Marco Di Summa
,
Laurence A. Wolsey
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 731-732
On the diameter of the set of satisfying assignments in random satisfiable
k
-CNF formulas
Uriel Feige
,
Abraham D. Flaxman
,
Dan Vilenchik
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 736-749
Quiet planting in the locked constraint satisfaction problems
Lenka Zdeborová
,
Florent Krzakala
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 750-770
Reconstruction and clustering in random constraint satisfaction problems
Andrea Montanari
,
Ricardo Restrepo
,
Prasad Tetali
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 771-808
Reconstruction for colorings on trees
Nayantara Bhatnagar
,
Juan Vera
,
Eric Vigoda
,
Dror Weitz
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 809-826
The Glauber dynamics for colorings of bounded degree trees
B. Lucier
,
M. Molloy
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 827-853
A computational method for bounding the probability of reconstruction on trees
Nayantara Bhatnagar
,
Elitza Maneva
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 854-871
Seiten
<
1
2
3
4
5
>