List of accepted papers for WADS 2007:


P. Gubbala and B. Raghavachari.
A 4/3-approximation algorithm for minimum 3-edge-connectivity.

D. Eppstein, M. van Kreveld, E. Mumford, and B. Speckmann.
Edges and switches, tunnels and bridges.

M. van Kreveld, M. Loeffler, and R. Silveira.
Optimization for first order Delaunay triangulations.

O. Aichholzer, F. Aurenhammer, T. Hackl, B. Juettler, M. Oberneder, and Z. Sir.
Computational and structural advantages of circular boundary representation.

B. Bhattacharya and Q. Shi.
Optimal algorithms for the weighted p-center problems for points on a real line.

G. Nong and S. Zhang.
Optimal lightweight construction of suffix arrays.

M. Loeffler and M. van Kreveld.
Largest bounding box, smallest diameter, and related problems on imprecise points.

S. A. Vinterbo.
A stab at approximating minimum subadditive join.

P. Bose, P. Carmi, M. Couture, M. Smid, and D. Xu.
On a family of strong geometric spanners that admit local routing strategies.

M. Farach-Colton and M. A. Mosteiro.
Initializing sensor networks of non-uniform density in the weak sensor model.

M. M. Halldorsson, C. Knauer, A. Spillner, and T. Tokuyama.
Parameterized algorithms and complexity of non-crossing spanning trees.

M. Mueller-Hannemann and S. Tazari.
A near linear time approximation scheme for Steiner tree amng obstacles in the plane.

J. Remy, R. Spoehel, and A. Weissl.
On Euclidean vehicle routing with allocation.

L. Epstein and R. van Stee.
Improved results for a memory allocation problem.

T. Jacobs.
Constant factor approximations for the hotlink assignment problem.

S. B. Roy, G. Das, and S. Das.
Computing best coverage path in the presence of obstacles in a sensor field.

R. I. Silveira and R. van Oostrum.
Flooding countries and destroying dams.

D. Attali, H. Edelsbrunner, J. Harer, and Y. Mileyko.
Alpha-beta witness complexes.

M. de Berg, O. Cheong, H. Haverkort, J. G. Lim, and L. Toma.
I/O-efficient flow modeling on fat terrains.

T. Biedl, A Lubiw, and M. Spriggs.
Cauchy's theorem and edge lengths of convex polyhedra.

M. de Berg and C. Gray.
Computing the visibility map of fat objects.

P. Bose, A. Lee, and M. Smid.
On generalized diamond spanners.

A. Chaudhary, D. Z. Chen, R. Fleischer, X. S. Hu, J. Li, M. T. Niemier, Z. Xie, and H. Zhu.
Approximating the maximum sharing problem.

A. G. Jorgensen, G. Moruz, and T. Molhave.
Priority queues resilient to memory faults.

F. V. Fomin, P. A. Golovach, J. Kratochvil, D. Kratsch, and M. Liedloff.
Branch and recharge: Exact algorithms for generalized domination.

G. Di Battista, G. Drovandi, and F. Frati.
How to draw a clustered tree.

P. Angelini, G. Di Battista, and M. Patrignani.
Computing a minimum-depth planar graph embedding in O(n^4) time.

D. Eppstein and M. T. Goodrich.
Space-efficient straggler identification in round-trip data streams via Newton's identities and invertible bloom filters.

Y. Nekrich.
Orthogonal range searching in linear and almost-linear space.

J. Chen, F. V. Fomin, Y. Liu, S. Lu, and Y. Villanger.
Improved algorithms for the feedback vertex set problems.

F. N. Abu-Khzam.
Kernelization algorithms for d-hitting set problems.

F. Botelho, R. Pagh, and N. Ziviani.
Simple and efficient space-optimal minimal perfect hash functions.

M. J. Atallah, M. Blanton, M. T. Goodrich, and S. Polu.
Discrepancy-sensitive dynamic fractional cascading, dominated maxima searching, and 2-d nearest neighbors in any Minkowski metric.

H. Koga.
Dynamic TCP acknowledgment with sliding window.

K. Terasawa and Y. Tanaka.
Spherical LSH for approximate nearest neigbor search on unit hypersphere.

M. Bienkowski and J. Kutylowski.
The k-resource problem on uniform and on uniformly decomposable metric spaces.

M. Badent, E. Di Giacomo, and G. Liotta.
Drawing colored graphs on colored points.

J. Guo and J. Uhlmann.
Kernelization and complexity results for connectivity augmentation problems.

M. M. Halldorsson and E. Losievskaja.
Independent sets in bounded-degree hypergraphs.

M. Gatto and P. Widmayer.
On robust online job shop scheduling.

A. Deshpande, T. Kim, E. D. Demaine, and S. E. Sarma.
A pseudopolynomial time O(log^2 n)-approximation algorithm for art gallery problems.

O. Keller, T. Kopelowitz, and M. Lewenstein.
Range non-overlapping indexing and successive list indexing.

J. Chen, Y. Liu, and S. Lu.
An improved parameterized algorithm for the minimum node multiway cut problem.

G. D. da Fonseca.
Approximate range searching: the absolute model.

K. Iwama, S. Miyazaki, and H. Yanagisawa.
Approximation algorithms for the sex-equal stable marriage problem.

O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, A. Por, F. Santos, B. Speckmann, and B. Vogtenhuber.
Maximizing maximal angles for plane straight-line graphs.

J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman, and O. Weimann.
The Stackelberg minimum spanning tree game.

M. Fuerer and S. P. Kasiviswanathan.
Spanners for geometric intersection graphs.

P. Berman and S. P. Kasiviswanathan.
Faster approximation of distances in graphs.

G. Borradaile, P. N. Klein, and C. Mathieu.
Steiner tree in planar graphs: An O(n log n) approximation scheme with singly exponential dependence on epsilon.

J. Derungs, R. Jacob, and P. Widmayer.
Approximate shortest paths guided by a small index.

D. Ajwani, S. Ray, R. Seidel, and H. R. Tiwary.
On computing the centroid of the vertices of an arrangement and related problems.

L. Kowalik and M. Mucha.
35/44-Approximation for asymmetric maxTSP with triangle inequality.

E. Rafalin and D. L. Souvaine.
Cuttings for disks and axis-aligned rectangles in three-space.