The following pages link to Algorithm Theory – SWAT 2006 (Q5757873):
Displayed 36 items.
- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights (Q5757874) (← links)
- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus (Q5757875) (← links)
- Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes (Q5757876) (← links)
- Paging with Request Sets (Q5757877) (← links)
- Unbiased Matrix Rounding (Q5757878) (← links)
- Sorting by Merging or Merging by Sorting? (Q5757879) (← links)
- Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers (Q5757880) (← links)
- Generalized Powers of Graphs and Their Algorithmic Use (Q5757881) (← links)
- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems (Q5757882) (← links)
- Largest and Smallest Tours and Convex Hulls for Imprecise Points (Q5757883) (← links)
- Approximating Rational Objectives Is as Easy as Approximating Linear Ones (Q5757884) (← links)
- An Approximation Algorithm for the Wireless Gathering Problem (Q5757885) (← links)
- Scheduling Jobs on Grid Processors (Q5757886) (← links)
- Approximability of Minimum AND-Circuits (Q5757887) (← links)
- Acyclic Orientation of Drawings (Q5757888) (← links)
- Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles (Q5757889) (← links)
- On Guarding Rectilinear Domains (Q5757890) (← links)
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours (Q5757891) (← links)
- Variable Sized Online Interval Coloring with Bandwidth (Q5757892) (← links)
- On the Approximation Hardness of Some Generalizations of TSP (Q5757893) (← links)
- Exact Computation of Maximum Induced Forest (Q5757894) (← links)
- Decentralization and Mechanism Design for Online Machine Scheduling (Q5757895) (← links)
- Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines (Q5757896) (← links)
- Finding the Position of the k-Mismatch and Approximate Tandem Repeats (Q5757897) (← links)
- A Simpler Linear-Time Recognition of Circular-Arc Graphs (Q5757898) (← links)
- An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering (Q5757899) (← links)
- Linear-Time Algorithms for Tree Root Problems (Q5757900) (← links)
- On Spanners of Geometric Graphs (Q5757901) (← links)
- In-Place Algorithms for Computing (Layers of) Maxima (Q5757902) (← links)
- Minimum Membership Set Covering and the Consecutive Ones Property (Q5757903) (← links)
- Better Approximation Schemes for Disk Graphs (Q5757904) (← links)
- Triangles, 4-Cycles and Parameterized (In-)Tractability (Q5757905) (← links)
- Dynamic Matching Markets and Voting Paths (Q5757906) (← links)
- Improved Algorithms for Quantum Identification of Boolean Oracles (Q5757907) (← links)
- Simultaneous Embedding with Two Bends per Edge in Polynomial Area (Q5757908) (← links)
- Approximation Algorithms for the Minimum Convex Partition Problem (Q5757909) (← links)