The SCEAS System
Navigation Menu

Conferences in DBLP

Scandinavian Workshop on Algorithm Theory (SWAT) (swat)
2004 (conf/swat/2004)

  1. Charles E. Leiserson
    Design and Analysis of Dynamic Multithreaded Algorithms. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:1-2 [Conf]
  2. Gerth Stølting Brodal
    Cache-Oblivious Algorithms and Data Structures. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:3-13 [Conf]
  3. Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger
    Getting the Best Response for Your Erg. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:14-25 [Conf]
  4. Nir Andelman, Yishay Mansour
    Auctions with Budget Constraints. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:26-38 [Conf]
  5. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
    Tight Approximability Results for Test Set Problems in Bioinformatics. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:39-50 [Conf]
  6. Refael Hassin, Danny Segev
    Robust Subgraphs for Trees and Paths. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:51-63 [Conf]
  7. Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
    Collective Tree Spanners of Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:64-76 [Conf]
  8. Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
    Optimally Competitive List Batching. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:77-89 [Conf]
  9. Joan Boyar, Paul Medvedev
    The Relative Worst Order Ratio Applied to Seat Reservation. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:90-101 [Conf]
  10. Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
    Online Maintenance of k-Medians and k-Covers on a Line. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:102-113 [Conf]
  11. Vladlen Koltun, Carola Wenk
    Matching Polyhedral Terrains Using Overlays of Envelopes. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:114-126 [Conf]
  12. Pankaj K. Agarwal, Nabil H. Mustafa
    Independent Set of Intersection Graphs of Convex Objects in 2D. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:127-137 [Conf]
  13. Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp
    Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:138-149 [Conf]
  14. Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang
    Construction of the Nearest Neighbor Embracing Graph of a Point Set. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:150-160 [Conf]
  15. Norbert Zeh
    Connectivity of Graphs Under Edge Flips. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:161-173 [Conf]
  16. Miroslav Chlebík, Janka Chlebíková
    Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:174-186 [Conf]
  17. Michel Habib, Fabien de Montgolfier, Christophe Paul
    A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:187-198 [Conf]
  18. Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer
    Railway Delay Management: Exploring Its Algorithmic Complexity. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:199-211 [Conf]
  19. Amr Elmasry
    Layered Heaps. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:212-222 [Conf]
  20. Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
    Melding Priority Queues. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:223-235 [Conf]
  21. Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác
    An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:236-247 [Conf]
  22. Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell
    Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:248-259 [Conf]
  23. Kazuhisa Makino, Takeaki Uno
    New Algorithms for Enumerating All Maximal Cliques. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:260-272 [Conf]
  24. Adi Avidor, Michael Langberg
    The Multi-multiway Cut Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:273-284 [Conf]
  25. Andrew Lim, Zhou Xu
    The Bottleneck Problem with Minimum Quantity Commitments. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:285-297 [Conf]
  26. Yossi Azar, Shai Taub
    All-Norm Approximation for Scheduling on Identical Machines. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:298-310 [Conf]
  27. Klaus Jansen
    Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:311-322 [Conf]
  28. Andrew Lim, Brian Rodrigues, Zhou Xu
    Approximation Schemes for the Crane Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:323-335 [Conf]
  29. Raja Jothi, Balaji Raghavachari
    Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:336-348 [Conf]
  30. Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto
    A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:349-361 [Conf]
  31. Klaus Jansen, Guochuan Zhang
    Maximizing the Number of Packed Rectangles. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:362-371 [Conf]
  32. Giovanni Manzini
    Two Space Saving Tricks for Linear Time LCP Array Computation. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:372-383 [Conf]
  33. Mikkel Thorup
    Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:384-396 [Conf]
  34. Leszek Gasieniec, Tomasz Radzik, Qin Xin
    Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:397-407 [Conf]
  35. Leah Epstein, Rob van Stee
    Online Scheduling of Splittable Tasks in Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:408-419 [Conf]
  36. Patchrawat Uthaisombut
    The Optimal Online Algorithms for Minimizing Maximum Lateness. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:420-430 [Conf]
  37. Paz Carmi, Matthew J. Katz
    Power Assignment in Radio Networks with Two Power Levels. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:431-441 [Conf]
  38. Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
    Pointed Binary Encompassing Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:442-454 [Conf]
  39. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    On Geometric Structure of Global Roundings for Graphs and Range Spaces. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:455-467 [Conf]
  40. Jop F. Sibeyn
    External Connected Components. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:468-479 [Conf]
  41. Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
    Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:480-492 [Conf]
  42. Lars Arge, Laura Toma
    Simplified External Memory Algorithms for Planar DAGs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:493-503 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002