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=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Monotone proper interval digraphs and min-max orderings
Pavol Hell
,
Arash Rafiey
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1576-1596
The dichotomy of minimum cost homomorphism problems for digraphs
Pavol Hell
,
Arash Rafiey
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1597-1608
Turán densities of some hypergraphs related to
K_{k+1}^{k}
József Balogh
,
Tom Bohman
,
Béla Bollobás
,
Yi Zhao
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1609-1617
Succinct representation of codes with applications to testing
Elena Grigorescu
,
Tali Kaufman
,
Madhu Sudan
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1618-1634
Cycle Killer...Qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set
Steven Kelk
,
Leo van Iersel
,
Nela Lekić
,
Simone Linz
,
Celine Scornavacca
,
Leen Stougie
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1635-1656
Almost intersecting families of sets
Dániel Gerbner
,
Nathan Lemons
,
Cory Palmer
,
Balázs Patkós
,
Vajk Szécsi
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1657-1669
Nonconvex representations of plane graphs
Giuseppe Di Battista
,
Fabrizio Frati
,
Maurizio Patrignani
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1670-1681
On 3-colorable
P_5
-free graphs
Frédéric Maffray
,
Grégory Morel
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1682-1708
From pathwidth to connected pathwidth
Dariusz Dereniowski
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1709-1732
Rigidity of frameworks supported on surfaces
A. Nixon
,
J.C. Owen
,
S.C. Power
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1733-1757
Maximum
r
-regular induced subgraph problem: Fast exponential algorithms and combinatorial bounds
Sushmita Gupta
,
Venkatesh Raman
,
Saket Saurabh
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1758-1780
A bound on the minimum distance of quasi-cyclic codes
Cem Güneri
,
Ferruh Özbudak
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1781-1796
Cycles in graphs and covers
Deanna Dreher
SIAM Journal on Discrete Mathematics
26
(4), 2012, pp. 1797-1819
Seiten
<
1
2
3
4
5