The following pages link to Algorithm Theory – SWAT 2014 (Q3188876):
Displaying 33 items.
- Triangle counting in dynamic graph streams (Q334947) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- I/O-Efficient Range Minima Queries (Q3188877) (← links)
- Expected Linear Time Sorting for Word Size Ω(log2 n loglogn) (Q3188879) (← links)
- Amortized Analysis of Smooth Quadtrees in All Dimensions (Q3188880) (← links)
- New Approximability Results for the Robust k-Median Problem (Q3188881) (← links)
- Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs (Q3188882) (← links)
- Approximating the Revenue Maximization Problem with Sharp Demands (Q3188883) (← links)
- Reconfiguring Independent Sets in Claw-Free Graphs (Q3188884) (← links)
- Competitive Online Routing on Delaunay Triangulations (Q3188885) (← links)
- Optimal Planar Orthogonal Skyline Counting Queries (Q3188886) (← links)
- B-slack Trees: Space Efficient B-Trees (Q3188888) (← links)
- Approximately Minwise Independence with Twisted Tabulation (Q3188889) (← links)
- Separability of Imprecise Points (Q3188890) (← links)
- Line-Distortion, Bandwidth and Path-Length of a Graph (Q3188891) (← links)
- Colorful Bin Packing (Q3188892) (← links)
- Win-Win Kernelization for Degree Sequence Completion Problems (Q3188894) (← links)
- On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem (Q3188895) (← links)
- Colored Range Searching in Linear Space (Q3188897) (← links)
- Fast Dynamic Graph Algorithms for Parameterized Problems (Q3188899) (← links)
- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams (Q3188901) (← links)
- Additive Spanners: A Simple Construction (Q3188902) (← links)
- Assigning Channels via the Meet-in-the-Middle Approach (Q3188903) (← links)
- Consistent Subset Sampling (Q3188904) (← links)
- Linear Time LexDFS on Cocomparability Graphs. (Q3188906) (← links)
- Quantum Algorithms for Matrix Products over Semirings (Q3188907) (← links)
- Ranked Document Selection (Q3188908) (← links)
- Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments (Q3188909) (← links)
- Reduction Techniques for Graph Isomorphism in the Context of Width Parameters (Q3188910) (← links)
- Approximate Counting of Matchings in (3,3)-Hypergraphs (Q3188911) (← links)
