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 Volume=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Flooding in weighted sparse random graphs
Hamed Amini
,
Moez Draief
,
Marc Lelarge
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 1-26
On the number of Hamilton cycles in sparse random graphs
Roman Glebov
,
Michael Krivelevich
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 27-42
Near-popular matchings in the roommates problem
Chien-Chung Huang
,
Telikepalli Kavitha
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 43-62
Mixed and circular multichromosomal genomic median problem
Sylvia Boyd
,
Maryam Haghighi
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 63-74
Efficient algorithms for Eulerian extension and rural postman
Frederic Dorn
,
Hannes Moser
,
Rolf Niedermeier
,
Mathias Weller
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 75-94
A local strengthening of Reed's
\omega, \Delta, \chi
conjecture for quasi-line graphs
Maria Chudnovsky
,
Andrew D. King
,
Matthieu Plumettaz
,
Paul Seymour
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 95-108
Stable routing and unique-max coloring on trees
Nicolai Hähnle
,
Laura Sanità
,
Rico Zenklusen
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 109-125
First-fit coloring of incomparability graphs
Bartholomiej Bosek
,
Tomasz Krawczyk
,
Grzegorz Matecki
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 126-140
\{4,5\}
is not coverable: A counterexample to a conjecture of Kaiser and S̑krekovski
Roman C̑ada
,
Shuya Chiba
,
Kenta Ozeki
,
Petr Vrána
,
Kiyoshi Yoshimoto
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 141-144
Repeated degrees in random uniform hypergraphs
Paul Balister
,
Béla Bollobás
,
Jenŏ Lehel
,
Michaƚ Morayne
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 145-154
Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
Naoki Katoh
,
Shin-ichi Tanigawa
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 155-185
A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
Akiyosho Shioura
,
Natalia V. Shakhlevich
,
Vitaly A. Strusevich
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 186-204
Integer representations of convex polygon intersection graphs
Tobias Müller
,
Erik Jan van Leeuwen
,
Jan van Leeuwen
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 205-231
Maximum size of reverse-free sets of permutations
Josef Cibulka
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 232-239
Cover-decomposition and polychromatic numbers
Béla Bollobás
,
David Pritchard
,
Thomas Rothvoss
,
Alex Scott
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 240-256
A lower bound for the complexity of monotone graph properties
Robert Scheidweiler
,
Eberhard Triesch
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 257-265
Nonseparable, concave utilities are easy - In a perfect price discrimination market model
Vijay V. Vazirani
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 266-273
Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs
Zan-Bo Zhang
,
Xiaoyan Zhang
,
Xuelian Wen
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 274-289
Subset feedback vertex set is fixed-parameter tractable
Marek Cygan
,
Marcin Pilipczuk
,
Michaƚ Pilipczuk
,
Jakub Onufry Wojtaszczyk
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 290-309
Target set selection problem for honeycomb networks
Chun-Ying Chiang
,
Liang-Hao Huang
,
Hong-Gwa Yeh
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 310-328
Relationships between pairs of representations of signed binary matroids
Bertrand Guenin
,
Irene Pivotto
,
Paul Wollan
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 329-341
An improved upper bound on the length of the longest cycle of a supercritical random graph
Graeme Kemkes
,
Nicholas Wormald
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 342-362
Adversarial leakage in games
Noga Alon
,
Yuval Emek
,
Michal Feldman
,
Moshe Tennenholtz
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 363-385
Distributions of sparse spanning subgraphs in random graphs
Pu Gao
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 386-401
The complexity of deletion problems for matroids
Michael Snook
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 402-421
Seiten 1
2
3
4
5
6
>