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 Information

Conference Venue Address

IDA Mødecenter, Kalvebod Brygge 31-33, DK-1780 Copenhagen V


Served from 8:30-11:00 at the conference venue.

Local Organisers

Philip Bille, Inge Li Gørtz, Patrick Hagge Cording,

Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind


View SWAT 2014 in a larger map
10:20-10:45 Paul Bonsma, Marcin Kamiński and Marcin Wrochna. Reconfiguring Independent Sets in Claw-Free Graphs N.S. Narayanaswamy and Anup Joshi. Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments Vincent Froese, André Nichterlein and Rolf Niedermeier. Win-Win Kernelization for Degree Sequence Completion Problems
10:45-11:10 Ekkehard Köhler and Lalla Mouatadid. Linear Time LexDFS on Cocomparability Graphs Mark de Berg, Ali Mehrabi and Farnaz Sheikhi. Separability of Imprecise Points Keigo Oka and Yoichi Iwata. Fast Dynamic Graph Algorithms for Parameterized Problems
11:10-11:35 Feodor Dragan, Ekkehard Köhler and Arne Leitert. Line-distortion, Bandwidth and Path-length of a graph Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher and Perouz Taslakian. Competitive Online Routing on Delaunay Triangulations Fedor Fomin, Mathieu Liedloff, Pedro Montealegre and Ioan Todinca. Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
11:35-12:00 Pavel Klavík, Jan Kratochvil, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell and Tomas Vyskocil. Extending Partial Representations of Proper and Unit Interval Graphs Susanne Albers and Matthias Hellwig. Online Makespan Minimization with Parallel Schedules Yota Otachi and Pascal Schweitzer. Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
12:00-13:30 Lunch Lunch Lunch
13:30-13:55 Takuro Fukunaga. Covering problems in edge- and node-weighted graphs Boris Klemz, Tamara Mchedlidze and Martin Nöllenburg. Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams Trevor Brown. B-slack trees: Space Efficient B-trees
13:55-14:20 Toshihiro Fujito. On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem Therese Biedl. Trees and co-trees with bounded degrees in planar 3-connected graphs Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn and Adrian Neumann. New Approximability Results for the Robust k-Median Problem
14:20-14:45 Mathias Bæk Tejs Knudsen. Additive spanners: A simple construction Edyta Szymanska, Marek Karpinski, Andrzej Ruciński and Andrzej Dudek. Approximate Counting of Matchings in (3,3)-Hypergraphs Søren Dahlgaard and Mikkel Thorup. Approximately Minwise Independence with Twisted Tabulation
14:45-15:10 Coffee Break Lukasz Kowalik and Arkadiusz Socala. Assigning channels via the meet-in-the-middle approach Peyman Afshani and Nodari Sitchinava. I/O-efficient Range Minima Queries
15:10-15:35 Ian Munro, Gonzalo Navarro, Rahul Shah and Sharma V. Thankachan. Ranked Document Selection Coffee Break Coffee Break
15:35-16:00 Konstantin Kutzkov and Rasmus Pagh. Consistent Subset Sampling Søren Vind and Roberto Grossi. Colored Range Searching in Linear Space György Dósa and Leah Epstein. 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).

Huxley Bennett and Chee Yap. Amortized Analysis of Smooth Quadtrees in All Dimensions Vittorio Bilo', Michele Flammini and Gianpiero Monaco. Approximating the Revenue Maximization Problem with Sharp Demands
17:00 Conference Reception

Reception shared with SEA 2014 participants.
Takes place at Munkekælderen (Monk Cellar), one of the oldest buildings of the University of Copenhagen.

Nørregade 10
1017 København K

16:25-16:50 Konstantin Kutzkov and Rasmus Pagh. Triangle counting in dynamic graph streams Djamal Belazzougui, Gerth Stølting Brodal and Jesper Sindahl Nielsen. Expected Linear Time Sorting for Word Size Ω(log2 n log log n)
16:50-17:15 Francois Le Gall and Harumichi Nishimura. Quantum Algorithms for Matrix Products over Semirings Gerth Stølting Brodal and Kasper Green Larsen. Optimal Planar Orthogonal Skyline Counting Queries
19:00 Conference Dinner

Takes place at IDA Mødecenter (the conference venue).