- Vladlen Koltun, Carola Wenk:
Matching Polyhedral Terrains Using Overlays of Envelopes. SWAT 2004: 114-126 - Charles E. Leiserson:
Design and Analysis of Dynamic Multithreaded Algorithms. SWAT 2004: 1-2 - Andrew Lim, Brian Rodrigues, Zhou Xu:
Approximation Schemes for the Crane Scheduling Problem. SWAT 2004: 323-335 - Andrew Lim, Zhou Xu:
The Bottleneck Problem with Minimum Quantity Commitments. SWAT 2004: 285-297 - Kazuhisa Makino, Takeaki Uno:
New Algorithms for Enumerating All Maximal Cliques. SWAT 2004: 260-272 - Giovanni Manzini:
Two Space Saving Tricks for Linear Time LCP Array Computation. SWAT 2004: 372-383 - Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick:
Melding Priority Queues. SWAT 2004: 223-235 - Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger:
Getting the Best Response for Your Erg. SWAT 2004: 14-25 - Jop F. Sibeyn:
External Connected Components. SWAT 2004: 468-479 - Mikkel Thorup:
Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. SWAT 2004: 384-396 - Patchrawat Uthaisombut:
The Optimal Online Algorithms for Minimizing Maximum Lateness. SWAT 2004: 420-430 - Norbert Zeh:
Connectivity of Graphs Under Edge Flips. SWAT 2004: 161-173 - Torben Hagerup, Jyrki Katajainen:
Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings. Lecture Notes in Computer Science 3111, Springer 2004, ISBN 3-540-22339-8 [contents]