default search action
13. WADS 2013: London, ON, Canada
- Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack:
Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings. Lecture Notes in Computer Science 8037, Springer 2013, ISBN 978-3-642-40103-9 - Mahmuda Ahmed, Iffat Chowdhury, Matt Gibson, Mohammad Shahedul Islam, Jessica Sherrette:
On Maximum Weight Objects Decomposable into Based Rectilinear Convex Objects. 1-12 - Hee-Kap Ahn
, Helmut Alt, Sang Won Bae
Bundling Three Convex Polygons to Minimize Area or Perimeter. 13-24 - Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav
Smart-Grid Electricity Allocation via Strip Packing with Slicing. 25-36 - Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava:
On (Dynamic) Range Minimum Queries in External Memory. 37-48 - Boris Aronov
Distance-Sensitive Planar Point Location. 49-60 - Tetsuo Asano, David G. Kirkpatrick:
Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems. 61-72 - Andrei Asinowski
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. 73-84 - Georgios Askalidis, Nicole Immorlica, Augustine Kwanashie, David F. Manlove
Socially Stable Matchings in the Hospitals/Residents Problem. 85-96 - Michael J. Bannister, Sergio Cabello
Parameterized Complexity of 1-Planarity. 97-108 - Luis Barba, Prosenjit Bose
On the Stretch Factor of the Theta-4 Graph. 109-120 - Djamal Belazzougui, Travis Gagie
Better Space Bounds for Parameterized Range Majority and Minority. 121-132 - Marcin Bienkowski
Online Control Message Aggregation in Chain Networks. 133-145 - Philip Bille
Fingerprints in Compressed Strings. 146-157 - Michael Biro, Justin Iwerks, Irina Kostitsyna
Beacon-Based Algorithms for Geometric Routing. 158-169 - Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer:
Interval Selection with Machine-Dependent Intervals. 170-181 - Prosenjit Bose
On the Spanning Ratio of Theta-Graphs. 182-194 - Joan Boyar
Relative Interval Analysis of Paging Algorithms on Access Graphs. 195-206 - Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz
On Explaining Integer Vectors by Few Homogenous Segments. 207-218 - Kevin Buchin
Trajectory Grouping Structure. 219-230 - Timothy M. Chan:
The Art of Shaving Logs. 231 - Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Treewidth and Pathwidth Parameterized by the Vertex Cover Number. 232-243 - Danny Z. Chen, Haitao Wang:
Visibility and Ray Shooting Queries in Polygonal Domains. 244-255 - Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou:
Lift-and-Project Methods for Set Cover and Knapsack. 256-267 - Bang-Sin Dai, Mong-Jen Kao, D. T. Lee:
Optimal Time-Convex Hull under the L p Metrics. 268-279 - Erik D. Demaine, Pavel Panchekha, David A. Wilson, Edward Z. Yang:
Blame Trees. 280-290 - Stephane Durocher, Debajyoti Mondal:
Plane 3-trees: Embeddability and Approximation - (Extended Abstract). 291-303 - Zdenek Dvorák
A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs. 304-315 - David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg:
Combinatorial Pair Testing: Distinguishing Workers from Slackers. 316-327 - Dror Epstein, Martin Charles Golumbic, Gila Morgenstern:
Approximation Algorithms for B 1-EPG Graphs. 328-340 - Radoslav Fulek
Universal Point Sets for Planar Three-Trees. 341-352 - Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
Planar Packing of Binary Trees. 353-364 - Michael Hamann
Hierarchies of Predominantly Connected Communities. 365-377 - Avinatan Hassidim, Haim Kaplan, Omry Tuval:
Joint Cache Partition and Job Assignment on Multi-core Processors. 378-389 - Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty:
Finding the Minimum-Weight k-Path. 390-401 - Wing-Kai Hon
Compressed Persistent Index for Efficient Rank/Select Queries. 402-414 - Philipp Hupp, Riko Jacob:
Tight Bounds for Low Dimensional Star Stencils in the External Memory Model. 415-426 - Jan Baumbach
Neighborhood-Preserving Mapping between Trees. 427-438 - Klaus Jansen, Felix Land, Kati Land:
Bounding the Running Time of Algorithms for Scheduling and Packing Problems. 439-450 - Iyad A. Kanj, Ge Xia:
When Is Weighted Satisfiability FPT? 451-462 - Philipp Kindermann
Two-Sided Boundary Labeling with Adjacent Sides. 463-474 - Frederic Koehler, Samir Khuller:
Optimal Batch Schedules for Parallel Machines. 475-486 - Maarten Löffler, Wolfgang Mulzer
Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition. 487-498 - Maarten Löffler, Joseph A. Simons, Darren Strash
Dynamic Planar Point Location with Sub-logarithmic Local Updates. 499-511 - Naomi Nishimura, Narges Simjour:
Parameterized Enumeration of (Locally-) Optimal Aggregations. 512-523 - Sergei Vassilvitskii:
MapReduce Algorithmics. 524 - Aaron Williams:
The Greedy Gray Code Algorithm. 525-536
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: