Tuesday, July 1st 2014 | Wednesday, July 2nd 2014 | Thursday, July 3rd 2014 | Friday, July 4th 2014 | |
8:30-9:00 | Breakfast & Registration | Breakfast | Breakfast | |
9:00-10:00 | Invited Speaker: Carsten Thomassen | Invited Speaker: Mikkel Thorup | Invited Speaker: Nikhil Bansal | |
10:00-10:20 | Coffee Break | Coffee Break | Coffee Break | |
SWAT 2014 Important InformationConference Venue AddressIDA Mødecenter, Kalvebod Brygge 31-33, DK-1780 Copenhagen V BreakfastServed from 8:30-11:00 at the conference venue. Local OrganisersPhilip Bille, Inge Li Gørtz, Patrick Hagge Cording, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind MapView SWAT 2014 in a larger map |
10:20-10:45 | Reconfiguring Independent Sets in Claw-Free Graphs | Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments | Win-Win Kernelization for Degree Sequence Completion Problems |
10:45-11:10 | Linear Time LexDFS on Cocomparability Graphs | Separability of Imprecise Points | Fast Dynamic Graph Algorithms for Parameterized Problems | |
11:10-11:35 | Line-distortion, Bandwidth and Path-length of a graph | Competitive Online Routing on Delaunay Triangulations | Algorithms parameterized by vertex cover and modular width, through potential maximal cliques | |
11:35-12:00 | Extending Partial Representations of Proper and Unit Interval Graphs | Online Makespan Minimization with Parallel Schedules | Reduction Techniques for Graph Isomorphism in the Context of Width Parameters | |
12:00-13:30 | Lunch | Lunch | Lunch | |
13:30-13:55 | Covering problems in edge- and node-weighted graphs | Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams | B-slack trees: Space Efficient B-trees | |
13:55-14:20 | On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem | Trees and co-trees with bounded degrees in planar 3-connected graphs | New Approximability Results for the Robust k-Median Problem | |
14:20-14:45 | Additive spanners: A simple construction | Approximate Counting of Matchings in (3,3)-Hypergraphs | Approximately Minwise Independence with Twisted Tabulation | |
14:45-15:10 | Coffee Break | Assigning channels via the meet-in-the-middle approach | I/O-efficient Range Minima Queries | |
15:10-15:35 | Ranked Document Selection | Coffee Break | Coffee Break | |
15:35-16:00 | Consistent Subset Sampling | Colored Range Searching in Linear Space | Colorful bin packing | |
16:00-16:25 | 16:30 Canal trip & Business meeting
Canal trip in Copenhagen Harbour and SWAT business meeting. Possibly followed by visit at Tivoli Gardens (this is voluntary, entrance fee not included in conference fee). |
Amortized Analysis of Smooth Quadtrees in All Dimensions | Approximating the Revenue Maximization Problem with Sharp Demands | |
17:00 Conference Reception
Reception shared with SEA 2014 participants.
Address: |
16:25-16:50 | Triangle counting in dynamic graph streams | Expected Linear Time Sorting for Word Size Ω(log2 n log log n) | |
16:50-17:15 | Quantum Algorithms for Matrix Products over Semirings | Optimal Planar Orthogonal Skyline Counting Queries | ||
19:00 Conference Dinner
Takes place at IDA Mødecenter (the conference venue). |