default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12. WADS 2011: New York, NY, USA
- Frank Dehne, John Iacono, Jörg-Rüdiger Sack:
Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings. Lecture Notes in Computer Science 6844, Springer 2011, ISBN 978-3-642-22299-3 - Mohammad Ali Abam, Mark de Berg, Amirali Khosravi:
Piecewise-Linear Approximations of Uncertain Functions. 1-12 - Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs. 13-24 - Patrizio Angelini
, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella:
On the Area Requirements of Euclidean Minimum Spanning Trees. 25-36 - Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou:
Multi-target Ray Searching Problems. 37-48 - Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang:
Convex Transversals. 49-60 - Boris Aronov, Muriel Dulieu:
How to Cover a Point Set with a V-Shape of Minimum Width. 61-72 - Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness Rectangle Graphs. 73-85 - Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young:
Faster Optimal Algorithms for Segment Minimization with Small Maximal Value. 86-97 - Therese Biedl, Lesvia Elena Ruiz Velázquez:
Orthogonal Cartograms with Few Corners Per Face. 98-109 - Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao:
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. 110-121 - Paul S. Bonsma, Daniel Lokshtanov:
Feedback Vertex Set in Mixed Graphs. 122-133 - Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari:
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. 134-146 - Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor:
Frequency Capping in Online Advertising. 147-158 - Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-Preserving Spatial Treemaps. 159-170 - Gruia Calinescu, Minming Li:
Register Loading via Linear Programming. 171-182 - Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a Set of Circles with Minimum Sum of Radii. 183-194 - Timothy M. Chan, Vinayak Pathak:
Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. 195-206 - Danny Z. Chen, Haitao Wang:
New Algorithms for 1-D Facility Location and Path Equipartition Problems. 207-218 - Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang:
Multicut in Trees Viewed through the Eyes of Vertex Cover. 219-230 - Tobias Christ:
Beyond Triangulation: Covering Polygons with Triangles. 231-242 - Paul F. Christiano, Erik D. Demaine, Shaunak Kishore:
Lossless Fault-Tolerant Data Structures with Additive Overhead. 243-254 - Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim:
Binary Identification Problems for Weighted Trees. 255-266 - Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk:
Computing the Fréchet Distance between Folded Polygons. 267-278 - Peter Damaschke, Leonid Molokov:
Parameterized Reductions and Algorithms for Another Vertex Cover Generalization. 279-289 - Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
Path Minima Queries in Dynamic Weighted Trees. 290-301 - Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele:
On Rectilinear Partitions with Minimum Stabbing Number. 302-313 - Erik D. Demaine, Sarah Eisenstat:
Flattening Fixed-Angle Chains Is Strongly NP-Hard. 314-325 - Nikhil R. Devanur, Uriel Feige:
An O(n log n) Algorithm for a Load Balancing Problem on Paths. 326-337 - Christof Doll, Tanja Hartmann, Dorothea Wagner:
Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. 338-349 - Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira:
Flow Computations on Imprecise Terrains. 350-361 - David Eppstein, Michael T. Goodrich, Maarten Löffler:
Tracking Moving Objects with Few Handovers. 362-373 - Johannes Fischer:
Inducing the LCP-Array. 374-385 - P. Thomas Fletcher, John Moeller, Jeff M. Phillips, Suresh Venkatasubramanian:
Horoball Hulls and Extents in Positive Definite Space. 386-398 - Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger:
Enumerating Minimal Subset Feedback Vertex Sets. 399-410 - Kyle Fox:
Upper Bounds for Maximally Greedy Binary Search Trees. 411-422 - Michael L. Fredman:
On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations. 423-437 - Jie Gao, Dengpan Zhou:
Resilient and Low Stretch Routing through Embedding into Tree Metrics. 438-450 - Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Consistent Labeling of Rotating Maps. 451-462 - Beat Gfeller:
Finding Longest Approximate Periodic Patterns. 463-474 - Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee:
A (5/3 + ε)-Approximation for Strip Packing. 475-487 - Jing He, Hongyu Liang, Guang Yang:
Reversing Longest Previous Factor Tables is Hard. 488-499 - Meng He, J. Ian Munro:
Space Efficient Data Structures for Dynamic Orthogonal Range Counting. 500-511 - Brent Heeringa, Marius Catalin Iordan, Louis Theran:
Searching in Dynamic Tree-Like Partial Orders. 512-523 - Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl:
Counting Plane Graphs: Flippability and Its Applications. 524-535 - Allan Jørgensen, Maarten Löffler, Jeff M. Phillips:
Geometric Computations on Indecisive Points. 536-547 - Pegah Kamousi, Timothy M. Chan, Subhash Suri:
Closest Pair and the Post Office Problem for Stochastic Points. 548-559 - David G. Kirkpatrick, Sandra Zilles:
Competitive Search in Symmetric Trees. 560-570 - Philip N. Klein, Shay Mozes:
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time. 571-582 - Evangelos Kranakis, Oscar Morales-Ponce, Jukka Suomela:
Planar Subgraphs without Low-Degree Nodes. 583-594 - Yaw-Ling Lin, Charles B. Ward, Bharat Jain, Steven Skiena:
Constructing Orthogonal de Bruijn Sequences. 595-606 - Yakov Nekrich:
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. 607-618 - Shoshana Neuburger, Dina Sokol:
Succinct 2D Dictionary Matching with No Slowdown. 619-630 - Tim Nonner:
PTAS for Densest k-Subgraph in Interval Graphs. 631-641 - Yahav Nussbaum:
Improved Distance Queries in Planar Graphs. 642-653 - János Pach, Gábor Tardos:
Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers. 654 - Valentin Polishchuk, Mikko Sysikaski:
Faster Algorithms for Minimum-Link Paths with Restricted Orientations. 655-666 - Jaikumar Radhakrishnan, Saswata Shannigrahi:
Streaming Algorithms for 2-Coloring Uniform Hypergraphs. 667-678 - Robert Görke, Andrea Schumm, Dorothea Wagner:
Density-Constrained Graph Clustering. 679-690 - Shay Solomon:
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. 691-702 - Robert Endre Tarjan:
Theory vs. Practice in the Design and Analysis of Algorithms. 703 - Zhou Xu, Xiaofan Lai:
A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint. 704-715
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-09-21 01:30 CEST 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:
