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=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Spanning trees with bounded maximum degrees of graphs on surfaces
Kenta Ozeki
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 422-435
Nonrepetitive choice number of trees
Jakub Kozik
,
Piotr Micek
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 436-446
On the singularity of random combinatorial matrices
Hoi H. Nguyen
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 447-458
A tropical intersection product in matroidal fans
Kristin M. Shaw
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 459-491
Nullity and loop complementation for delta-matroids
Robert Brijder
,
Hendrik Jan Hoogeboom
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 492-506
Hypergraphic LP relaxations for Steiner trees
Deeparnab Chakrabarty
,
Jochen Könemann
,
David Pritchard
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 507-533
Coloring claw-free graphs with
\Delta-1
colors
Daniel W. Cranston
,
Landon Rabern
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 534-549
The number of edges in
k
-quasi-planar graphs
Jacob Fox
,
János Pach
,
Andrew Suk
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 550-561
Minimizing the number of carries in addition
Noga Alon
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 562-566
Matroid-based packing of arborescences
Olivier Durand de Gevigney
,
Viet-Hang Nguyen
,
Zoltán Szigeti
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 567-574
A bound for the maximum weight of a linear code
Simeon Ball
,
Aart Blokhuis
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 575-583
A relaxation of Steinberg's conjecture
Owen Hill
,
Gexin Yu
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 584-596
An optimal binding number condition for bipancyclism
Zhiquan Hu
,
Ka Ho Law
,
Wenan Zang
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 597-618
Improved lower bounds on book crossing numbers of complete graphs
E. de Klerk
,
D.V. Pasechnik
,
G. Salazar
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 619-633
Diametral pairs of linear extensions
Graham Brightwell
,
Mareike Massow
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 634-649
Peeling the grid
Sariel Har-Peled
,
Bernard Lidický
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 650-655
Basic network creation games
Noga Alon
,
Erik D. Demaine
,
Mohammad T. Hajiaghayi
,
Tom Leighton
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 656-668
Decomposition of binary signed-graphic matroids
Konstantinos Papalamprou
,
Leonidas Pitsoulis
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 669-692
Digraph girth via chromatic number
Peter Keevash
,
Zhentao Li
,
Bojan Mohar
,
Bruce Reed
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 693-696
Forcing large complete (topological) minors in infinite graphs
Maya Stein
,
José Zamora
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 697-707
Uniqueness of vertex magic constants
Allen O'Neal
,
Peter J. Slater
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 708-716
Geodetic number versus hull number in
P_3
-convexity
C.C. Centeno
,
L.D. Penso
,
D. Rautenbach
,
V.G. Pereira de Sá
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 717-731
Vertex-pursuit in random directed acyclic graphs
Antony Bonato
,
Dieter Mitsche
,
Paweƚ Praƚat
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 732-756
Bridgeless cubic graphs are (7,2)-edge-choosable
Edita Mác̑ajová
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 757-767
On the game chromatic number of sparse random graphs
Alan Frieze
,
Simcha Haber
,
Mikhail Lavrov
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 768-790
Seiten
<
1
2
3
4
5
6
>