|
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:79-80 [Journal]
- Zeev Nutov, Raphael Yuster
Packing directed cycles efficiently. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:82-91 [Journal]
- Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger
Eliminating graphs by means of parallel knock-out schemes. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:92-102 [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:103-118 [Journal]
- Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
Randomized on-line 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:119-136 [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:137-149 [Journal]
- Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
Agent-based randomized broadcasting in large networks. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:150-160 [Journal]
- Nadine Baumann, Ekkehard Köhler
Approximating earliest arrival flows with flow-dependent transit times. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:161-171 [Journal]
- Miroslav Chlebík, Janka Chlebíková
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:172-179 [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:180-193 [Journal]
- Andre Gronemeier
Approximating Boolean functions by OBDDs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:194-209 [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:210-229 [Journal]
- Hans-Joachim 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:230-256 [Journal]
|