The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Raimund Seidel
    Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily). [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:1- [Conf]
  2. Robert Endre Tarjan
    Results and Problems on Self-adjusting Search Trees and Related Data Structures. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:2- [Conf]
  3. Kazuo Iwama
    Classic and Quantum Network Coding. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:3-4 [Conf]
  4. Yossi Azar, Nir Levy
    Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:5-16 [Conf]
  5. Joan Boyar, Lene M. Favrholdt
    Scheduling Jobs on Grid Processors. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:17-28 [Conf]
  6. Leah Epstein, Thomas Erlebach, Asaf Levin
    Variable Sized Online Interval Coloring with Bandwidth. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:29-40 [Conf]
  7. Haim Kaplan, Yahav Nussbaum
    A Simpler Linear-Time Recognition of Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:41-52 [Conf]
  8. Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
    An O(n2.75) Algorithm for Online Topological Ordering. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:53-64 [Conf]
  9. David J. Abraham, Telikepalli Kavitha
    Dynamic Matching Markets and Voting Paths. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:65-76 [Conf]
  10. Gianni Franceschini
    Sorting by Merging or Merging by Sorting? [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:77-89 [Conf]
  11. Haim Kaplan, Ely Porat, Nira Shafrir
    Finding the Position of the k-Mismatch and Approximate Tandem Repeats. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:90-101 [Conf]
  12. Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
    Unbiased Matrix Rounding. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:102-112 [Conf]
  13. Michael H. Goldwasser, Mark Pedigo
    Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:113-123 [Conf]
  14. Leah Epstein, Rob van Stee, Tami Tamir
    Paging with Request Sets. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:124-135 [Conf]
  15. Birgit Heydenreich, Rudolf Müller, Marc Uetz
    Decentralization and Mechanism Design for Online Machine Scheduling. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:136-147 [Conf]
  16. Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
    Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:148-159 [Conf]
  17. Igor Razgon
    Exact Computation of Maximum Induced Forest. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:160-171 [Conf]
  18. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
    Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:172-183 [Conf]
  19. Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
    On the Approximation Hardness of Some Generalizations of TSP. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:184-195 [Conf]
  20. Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
    Reoptimization of Minimum and Maximum Traveling Salesman's Tours. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:196-207 [Conf]
  21. Spyros Angelopoulos
    The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:208-219 [Conf]
  22. Matthew J. Katz, Gabriel S. Roisman
    On Guarding Rectilinear Domains. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:220-231 [Conf]
  23. Christian Knauer, Andreas Spillner
    Approximation Algorithms for the Minimum Convex Partition Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:232-241 [Conf]
  24. Matthias Müller-Hannemann, Anna Schulze
    Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:242-254 [Conf]
  25. Frank Kammer
    Simultaneous Embedding with Two Bends per Edge in Polynomial Area. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:255-267 [Conf]
  26. Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
    Acyclic Orientation of Drawings. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:268-279 [Conf]
  27. Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra, Shigeru Yamashita
    Improved Algorithms for Quantum Identification of Boolean Oracles. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:280-291 [Conf]
  28. Jan Arpe, Bodo Manthey
    Approximability of Minimum AND-Circuits. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:292-303 [Conf]
  29. Venkatesh Raman, Saket Saurabh
    Triangles, 4-Cycles and Parameterized (In-)Tractability. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:304-315 [Conf]
  30. Erik Jan van Leeuwen
    Better Approximation Schemes for Disk Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:316-327 [Conf]
  31. Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
    An Approximation Algorithm for the Wireless Gathering Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:328-338 [Conf]
  32. Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
    Minimum Membership Set Covering and the Consecutive Ones Property. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:339-350 [Conf]
  33. José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi
    Approximating Rational Objectives Is as Easy as Approximating Linear Ones. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:351-362 [Conf]
  34. Henrik Blunck, Jan Vahrenhold
    In-Place Algorithms for Computing (Layers of) Maxima. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:363-374 [Conf]
  35. Maarten Löffler, Marc J. van Kreveld
    Largest and Smallest Tours and Convex Hulls for Imprecise Points. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:375-387 [Conf]
  36. Joachim Gudmundsson, Michiel H. M. Smid
    On Spanners of Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:388-399 [Conf]
  37. Josiah Carlson, David Eppstein
    The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:400-410 [Conf]
  38. Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu
    Linear-Time Algorithms for Tree Root Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:411-422 [Conf]
  39. Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan
    Generalized Powers of Graphs and Their Algorithmic Use. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:423-434 [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