| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Boris Aronov, Muriel Dulieu |
How to Cover a Point Set with a V-Shape of Minimum Width.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Nonner |
PTAS for Densest k-Subgraph in Interval Graphs.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella |
On the Area Requirements of Euclidean Minimum Spanning Trees.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahav Nussbaum |
Improved Distance Queries in Planar Graphs.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Beat Gfeller |
Finding Longest Approximate Periodic Patterns.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jie Gao, Dengpan Zhou |
Resilient and Low Stretch Routing through Embedding into Tree Metrics.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Christ |
Beyond Triangulation: Covering Polygons with Triangles.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Endre Tarjan |
Theory vs. Practice in the Design and Analysis of Algorithms.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael L. Fredman |
On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Brent Heeringa, Marius Catalin Iordan, Louis Theran |
Searching in Dynamic Tree-Like Partial Orders.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil R. Devanur, Uriel Feige |
An O(n log n) Algorithm for a Load Balancing Problem on Paths.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Ali Abam, Mark de Berg, Amirali Khosravi |
Piecewise-Linear Approximations of Uncertain Functions.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Minming Li |
Register Loading via Linear Programming.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhou Xu, Xiaofan Lai |
A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Z. Chen, Haitao Wang |
New Algorithms for 1-D Facility Location and Path Equipartition Problems.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Maarten Löffler |
Tracking Moving Objects with Few Handovers.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Saswata Shannigrahi |
Streaming Algorithms for 2-Coloring Uniform Hypergraphs.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira |
Flow Computations on Imprecise Terrains.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira |
Adjacency-Preserving Spatial Treemaps.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Damaschke, Leonid Molokov |
Parameterized Reductions and Algorithms for Another Vertex Cover Generalization.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim |
Binary Identification Problems for Weighted Trees.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Meng He, J. Ian Munro |
Space Efficient Data Structures for Dynamic Orthogonal Range Counting.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele |
On Rectilinear Partitions with Minimum Stabbing Number.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David G. Kirkpatrick, Sandra Zilles |
Competitive Search in Symmetric Trees.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christof Doll, Tanja Hartmann, Dorothea Wagner |
Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shoshana Neuburger, Dina Sokol |
Succinct 2D Dictionary Matching with No Slowdown.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Muriel Dulieu, Ferran Hurtado |
Witness Rectangle Graphs.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl |
Counting Plane Graphs: Flippability and Its Applications.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Dehne, John Iacono, Jörg-Rüdiger Sack (eds.) |
Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor |
Frequency Capping in Online Advertising.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Evangelos Kranakis, Oscar Morales Ponce, Jukka Suomela |
Planar Subgraphs without Low-Degree Nodes.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter |
Consistent Labeling of Rotating Maps.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou |
Multi-target Ray Searching Problems.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyle Fox |
Upper Bounds for Maximally Greedy Binary Search Trees.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young |
Faster Optimal Algorithms for Segment Minimization with Small Maximal Value.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Fischer |
Inducing the LCP-Array.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip N. Klein, Shay Mozes |
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shay Solomon |
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Sarah Eisenstat |
Flattening Fixed-Angle Chains Is Strongly NP-Hard.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Görke, Andrea Schumm, Dorothea Wagner |
Density-Constrained Graph Clustering.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Christiano, Erik D. Demaine, Shaunak Kishore |
Lossless Fault-Tolerant Data Structures with Additive Overhead.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides |
Connecting a Set of Circles with Minimum Sum of Radii.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Vinayak Pathak |
Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk |
Computing the Fréchet Distance between Folded Polygons.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | P. Thomas Fletcher, John Moeller, Jeff M. Phillips, Suresh Venkatasubramanian |
Horoball Hulls and Extents in Positive Definite Space.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao |
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Jørgensen, Maarten Löffler, Jeff M. Phillips |
Geometric Computations on Indecisive Points.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee |
A (5/3 + ε)-Approximation for Strip Packing.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pegah Kamousi, Timothy M. Chan, Subhash Suri |
Closest Pair and the Post Office Problem for Stochastic Points.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaw-Ling Lin, Charles B. Ward, Bharat Jain, Steven Skiena |
Constructing Orthogonal de Bruijn Sequences.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yakov Nekrich |
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentin Polishchuk, Mikko Sysikaski |
Faster Algorithms for Minimum-Link Paths with Restricted Orientations.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jing He, Hongyu Liang, Guang Yang |
Reversing Longest Previous Factor Tables is Hard.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bonsma, Daniel Lokshtanov |
Feedback Vertex Set in Mixed Graphs.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao |
Path Minima Queries in Dynamic Weighted Trees.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Lesvia Elena Ruiz Velázquez |
Orthogonal Cartograms with Few Corners Per Face.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang |
Multicut in Trees Viewed through the Eyes of Vertex Cover.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger |
Enumerating Minimal Subset Feedback Vertex Sets.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhijin Adiga, Jasine Babu, L. Sunil Chandran |
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang |
Convex Transversals.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Casimiro, Rogério de Lemos, Cristina Gacek (eds.) |
Architecting Dependable Systems VII  |
WADS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Görke, Tanja Hartmann, Dorothea Wagner |
Dynamic Graph Clustering Using Minimum-Cut Trees.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Allan Grønlund Jørgensen, Thomas Mølhave |
Fault Tolerant External Memory Algorithms.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew J. Katz, Gila Morgenstern |
A Scheme for Computing Minimum Covers within Simple Regions.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine |
Algorithms Meet Art, Puzzles, and Magic.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Fabrizio Frati, Michael Kaufmann |
Straight-Line Rectangular Drawings of Clustered Graphs.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski |
Approximation Algorithms for Buy-at-Bulk Geometric Network Design.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker |
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Elena Mumford |
Orientation-Constrained Rectangular Layouts.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor P. Fekete, Tom Kamphans, Nils Schweer |
Online Square Packing.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David L. Millman, Jack Snoeyink |
Computing the Implicit Voronoi Diagram in Triple Precision.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
Low-degree primitives, Robust computation, Randomized algorithm, Voronoi diagram |
| 1 | Adrian Dumitrescu, Minghui Jiang |
On Reconfiguration of Disks in the Plane and Related Problems.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Spyros Angelopoulos |
Online Priority Steiner Tree Problems.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chenyu Yan, Yang Xiang, Feodor F. Dragan |
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Emma S. Spiro |
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
Integer Programming: Optimization and Evaluation Are Equivalent.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon |
Minimal Locked Trees.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Bhaskar DasGupta, Marek Karpinski |
Approximating Transitive Reductions for Directed Networks.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Farzad Hassanzadeh, David Rappaport |
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
Intersecting Polygon, Approximation Algorithm, Computational Geometry, Line Segment |
| 1 | Travis Gagie, Yakov Nekrich |
Worst-Case Optimal Adaptive Prefix Coding.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel M. Kane, Gregory N. Price, Erik D. Demaine |
A Pseudopolynomial Algorithm for Alexandrov's Theorem.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber |
Plane Graphs with Parity Constraints.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Marina L. Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth (eds.) |
Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Marcin Kaminski, Erik D. Demaine |
Reconfiguration of List Edge-Colorings in a Graph.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Sandy Irani, Kim S. Larsen |
A Comparison of Performance Measures for Online Algorithms.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann |
Connect the Dot: Computing Feed-Links with Minimum Dilation.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Karim Douïeb |
Efficient Construction of Near-Optimal Binary and Multiway Search Trees.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christiane Lammersen, Anastasios Sidiropoulos, Christian Sohler |
Streaming Embeddings with Slack.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Knauer, Joachim Spoerhase |
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, John Howat, Pat Morin |
A Distribution-Sensitive Dictionary with Low Space Overhead.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Derryberry, Daniel Dominic Sleator |
Skip-Splay: Toward Achieving the Unified Bound in the BST Model.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin |
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Gilbers, Rolf Klein |
New Results on Visibility in Simple Polygons.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
Computational geometry, visibility, VC-dimension, art galleries, guards |
| 1 | Jianer Chen, Yang Liu 0002 |
An Improved SAT Algorithm in Terms of Formula Length.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Lars Prädel, Ulrich M. Schwarz |
Two for One: Tight Approximation of 2D Bin Packing.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
approximation, bin packing, rectangle packing |
| 1 | Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer |
Delaunay Triangulation of Imprecise Points Simplified and Extended.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Günter Rote, André Schulz |
Resolving Loads with Positive Interior Stresses.  |
WADS  |
2009 |
DBLP DOI BibTeX RDF |
|