ALENEX/ANALCO 2005: Vancouver, BC, Canada

Camil Demetrescu, Robert Sedgewick, Roberto Tamassia (Eds.): Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005. SIAM 2005, ISBN 0-89871-596-2 BibTeX

Workshop on Algorithm Engineering and Experiments

Bernard M. E. Moret:
Computational Challenges from the Tree of Life. 3-16
Electronic Edition (link) BibTeX
Dorothea Wagner, Thomas Willhalm:
Drawing Graphs to Speed Up Shortest-Path Computations. 17-25
Electronic Edition (link) BibTeX
Andrew V. Goldberg, Renato Fonseca F. Werneck:
Computing Point-to-Point Shortest Paths from External Memory. 26-40
Electronic Edition (link) BibTeX
Umut A. Acar, Guy E. Blelloch, Jorge L. Vittes:
An Experimental Analysis of Change Propagation in Dynamic Trees. 41-54
Electronic Edition (link) BibTeX
Alexander Hall, Heiko Schilling:
Flows over Time: Towards a More Realistic and Computationally Tractable Model. 55-67
Electronic Edition (link) BibTeX
Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti:
Solving the Prize-Collecting Steiner Tree Problem to Optimality. 68-76
Electronic Edition (link) BibTeX
Klaus-Bernd Schürmann, Jens Stoye:
An Incomplex Algorithm for Fast Suffix Array Construction. 78-85
Electronic Edition (link) BibTeX
Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders:
Better External Memory Suffix Array Construction. 86-97
Electronic Edition (link) BibTeX
Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink:
Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. 98-110
Electronic Edition (link) BibTeX
Quanfu Fan, Alon Efrat, Vladlen Koltun, Shankar Krishnan, Suresh Venkatasubramanian:
Hardware-Assisted Natural Neighbor Interpolation. 111-120
Electronic Edition (link) BibTeX
Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret:
Approximating the True Evolutionary Distance between Two Genomes. 121-129
Electronic Edition (link) BibTeX
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
On the Adaptiveness of Quicksort. 130-140
Electronic Edition (link) BibTeX
Gregory L. Heileman, Wenbin Luo:
How Caching Affects Hashing. 141-154
Electronic Edition (link) BibTeX
Leonor Frias:
Extending STL Maps Using LBSTs. 155-166
Electronic Edition (link) BibTeX
Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. 167-179
Electronic Edition (link) BibTeX
Tanveer A. Faruquie, Hemanta Kumar Maji, Raghavendra Udupa:
A New Decoding Algorithm for Statistical Machine Translation: Design and Implementation. 180-194
Electronic Edition (link) BibTeX

Workshop on Analytic Algorithmics and Combinatorics

Simon Bliudze, Daniel Krob:
Performance Evaluation of Demodulation with DiversityØA Combinatorial Approach III: Threshold Analysis. 195-205
Electronic Edition (link) BibTeX
Jennie C. Hansen, Eric Schmutz:
Comparison of Two CDS Algorithms on Random Unit Ball Graphs. 206-211
Electronic Edition (link) BibTeX
Daniel Berend, Amir Sapir:
Complexity of the Path Multi-Peg Tower of Hanoi. 212-217
Electronic Edition (link) BibTeX
Dana Randall, Peter Winkler:
Mixing Points on an Interval. 218-221
Electronic Edition (link) BibTeX
Charles Knessl, Wojciech Szpankowski:
Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. 222-229
Electronic Edition (link) BibTeX
Yuriy A. Reznik:
On the Average Density and Selectivity of Nodes in Multi-Digit Tries. 230-239
Electronic Edition (link) BibTeX
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah:
Mixing Times for Random Walks on Geometric Random Graphs. 240-249
Electronic Edition (link) BibTeX
Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang, Xuerong Yong:
Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results. 250-258
Electronic Edition (link) BibTeX
Graham Brightwell, Peter Winkler:
Counting Eulerian Circuits is #P-Complete. 259-262
Electronic Edition (link) BibTeX
Martin Fürer, Shiva Prasad Kasiviswanathan:
Approximately Counting Perfect Matchings in General Graphs. 263-272
Electronic Edition (link) BibTeX