|
|
Journals in DBLP
- Giuseppe F. Italiano, Alberto Marchetti-Spaccamela
Preface. [Citation Graph (0, 0)][DBLP]
J. Discrete Algorithms, 2006, v:4, n:3, pp:337-338 [Journal]
- Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
Online weighted flow time and deadline scheduling. [Citation Graph (0, 0)][DBLP]
J. Discrete Algorithms, 2006, v:4, n:3, pp:339-352 [Journal]
- Camil Demetrescu, Giuseppe F. Italiano
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. [Citation Graph (0, 0)][DBLP]
J. Discrete Algorithms, 2006, v:4, n:3, pp:353-383 [Journal]
- Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
The strength of weak proximity. [Citation Graph (0, 0)][DBLP]
J. Discrete Algorithms, 2006, v:4, n:3, pp:384-400 [Journal]
- Esteban Feuerstein, Steven S. Seiden, Alejandro Strejilevich de Loma
On Multi-threaded Metrical Task Systems. [Citation Graph (0, 0)][DBLP]
J. Discrete Algorithms, 2006, v:4, n:3, pp:401-413 [Journal]
- Michele Flammini, Alfredo Navarra, Gaia Nicosia
Efficient offline algorithms for the bicriteria k-server problem and online applications. [Citation Graph (0, 0)][DBLP]
J. Discrete Algorithms, 2006, v:4, n:3, pp:414-432 [Journal]
- Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies. [Citation Graph (0, 0)][DBLP]
J. Discrete Algorithms, 2006, v:4, n:3, pp:433-454 [Journal]
- Gianni Franceschini, Fabrizio Luccio, Linda Pagli
Dense trees: a new look at degenerate graphs. [Citation Graph (0, 0)][DBLP]
J. Discrete Algorithms, 2006, v:4, n:3, pp:455-474 [Journal]
- Burkhard Monien, Robert Preis
Upper bounds on the bisection width of 3- and 4-regular graphs. [Citation Graph (0, 0)][DBLP]
J. Discrete Algorithms, 2006, v:4, n:3, pp:475-498 [Journal]
|
