
Journals in DBLP
 Jan Kratochvíl, Josep Díaz, Jirí Fiala
Editorial. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:7980 [Journal]
 Zeev Nutov, Raphael Yuster
Packing directed cycles efficiently. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:8291 [Journal]
 Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger
Eliminating graphs by means of parallel knockout schemes. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:92102 [Journal]
 Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
Complexity results in graph reconstruction. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:103118 [Journal]
 Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
Randomized online algorithms and lower bounds for computing large independent sets in disk graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:119136 [Journal]
 Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:137149 [Journal]
 Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
Agentbased randomized broadcasting in large networks. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:150160 [Journal]
 Nadine Baumann, Ekkehard Köhler
Approximating earliest arrival flows with flowdependent transit times. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:161171 [Journal]
 Miroslav Chlebík, Janka Chlebíková
Minimum 2SATDELETION: Inapproximability results and relations to Minimum Vertex Cover. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:172179 [Journal]
 Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
Polynomial time approximation schemes and parameterized complexity. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:180193 [Journal]
 Andre Gronemeier
Approximating Boolean functions by OBDDs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:194209 [Journal]
 Henrik Björklund, Sergei G. Vorobyov
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:210229 [Journal]
 HansJoachim Böckenhauer, Dirk Bongartz
Protein folding in the HP model on grid lattices with diagonals. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:230256 [Journal]
