Journal of Discrete Algorithms, Volume 4

Volume 4, Number 1, March 2006

Alexandros V. Gerbessiotis:
An architecture independent study of parallel segment trees. 1-24
Electronic Edition (link) BibTeX
Janet M. Six, Ioannis G. Tollis:
A framework and algorithms for circular drawings of graphs. 25-50
Electronic Edition (link) BibTeX
Philipp Woelfel:
Symbolic topological sorting with OBDDs. 51-71
Electronic Edition (link) BibTeX
Amotz Bar-Noy, Justin Goshi, Richard E. Ladner:
Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging. 72-105
Electronic Edition (link) BibTeX
George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis:
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem. 106-141
Electronic Edition (link) BibTeX
Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. 142-154
Electronic Edition (link) BibTeX
Igor E. Zverovich, Olga I. Zverovich:
Polar SAT and related graphs. 155-167
Electronic Edition (link) BibTeX
Sébastien Desreux, Eric Rémila:
An optimal algorithm to generate tilings. 168-180
Electronic Edition (link) BibTeX
Thomas Jansen, Ingo Wegener:
On the analysis of a dynamic evolutionary algorithm. 181-199
Electronic Edition (link) BibTeX

Volume 4, Number 2, June 2006

David Pokrass Jacobs, Robert E. Jamison:
Polynomial recognition of equal unions in hypergraphs with few vertices of large degree. 201-208
Electronic Edition (link) BibTeX
Fabrizio Grandoni:
A note on the complexity of minimum dominating set. 209-214
Electronic Edition (link) BibTeX
E. C. Park, Ian F. Blake:
On the mean number of encryptions for tree-based broadcast encryption schemes. 215-238
Electronic Edition (link) BibTeX
Carlo Mereghetti, Beatrice Palano:
The complexity of minimum difference cover. 239-254
Electronic Edition (link) BibTeX
Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Jiri Sgall, Tomás Tichý:
Online competitive algorithms for maximizing weighted throughput of unit jobs. 255-276
Electronic Edition (link) BibTeX
Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
CHECKCOL: Improved local search for graph coloring. 277-298
Electronic Edition (link) BibTeX
Irene Finocchi:
Crossing-constrained hierarchical drawings. 299-312
Electronic Edition (link) BibTeX
Sabine Cornelsen, Dorothea Wagner:
Completely connected clustered graphs. 313-323
Electronic Edition (link) BibTeX
Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski:
Testing set proportionality and the Ádám isomorphism of circulant graphs. 324-335
Electronic Edition (link) BibTeX

Volume 4, Number 3, September 2006

Special issue in honour of Giorgio Ausiello

Giuseppe F. Italiano, Alberto Marchetti-Spaccamela:
Preface. 337-338
Electronic Edition (link) BibTeX
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Online weighted flow time and deadline scheduling. 339-352
Electronic Edition (link) BibTeX
Camil Demetrescu, Giuseppe F. Italiano:
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. 353-383
Electronic Edition (link) BibTeX
Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides:
The strength of weak proximity. 384-400
Electronic Edition (link) BibTeX
Esteban Feuerstein, Steven S. Seiden, Alejandro Strejilevich de Loma:
On Multi-threaded Metrical Task Systems. 401-413
Electronic Edition (link) BibTeX
Michele Flammini, Alfredo Navarra, Gaia Nicosia:
Efficient offline algorithms for the bicriteria k-server problem and online applications. 414-432
Electronic Edition (link) BibTeX
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. 433-454
Electronic Edition (link) BibTeX
Gianni Franceschini, Fabrizio Luccio, Linda Pagli:
Dense trees: a new look at degenerate graphs. 455-474
Electronic Edition (link) BibTeX
Burkhard Monien, Robert Preis:
Upper bounds on the bisection width of 3- and 4-regular graphs. 475-498
Electronic Edition (link) BibTeX

Volume 4, Number 4, December 2006

Fedor V. Fomin, Dimitrios M. Thilikos:
A 3-approximation for the pathwidth of Halin graphs. 499-510
Electronic Edition (link) BibTeX
William Kennedy, Guohui Lin, Guiying Yan:
Strictly chordal graphs are leaf powers. 511-525
Electronic Edition (link) BibTeX
Dieter Rautenbach, Christian Szegedy, Jürgen Werber:
Delay optimization of linear depth boolean circuits with prescribed input arrival times. 526-537
Electronic Edition (link) BibTeX
Issam Dagher:
Art networks with geometrical distances. 538-553
Electronic Edition (link) BibTeX
Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann:
Area-preserving approximations of polygonal paths. 554-566
Electronic Edition (link) BibTeX
Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, Russell A. Martin:
Utilitarian resource assignment. 567-587
Electronic Edition (link) BibTeX
Andrzej Czygrinow, Michal Hanckowiak:
Distributed algorithms for weighted problems in sparse graphs. 588-607
Electronic Edition (link) BibTeX
Jiong Guo, Rolf Niedermeier:
Exact algorithms and applications for Tree-like Weighted Set Cover. 608-622
Electronic Edition (link) BibTeX
Markus Bläser, Bodo Manthey, Jiri Sgall:
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. 623-632
Electronic Edition (link) BibTeX
Vincent Vajnovszki, Timothy Walsh:
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words. 633-648
Electronic Edition (link) BibTeX
Johann Blieberger:
Average case analysis of DJ graphs. 649-675
Electronic Edition (link) BibTeX
Victor Boyarshinov, Malik Magdon-Ismail:
Linear time isotonic and unimodal regression in the L₁ and L_infinity norms. 676-691
Electronic Edition (link) BibTeX