default search action
14. WADS 2015: Victoria, BC, Canada
- Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege:
Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings. Lecture Notes in Computer Science 9214, Springer 2015, ISBN 978-3-319-21839-7 - Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov
, Sergey Pupyrev, André Schulz, Torsten Ueckerdt:
Contact Graphs of Circular Arcs. 1-13 - Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov
Contact Representations of Graphs in 3D. 14-27 - Aaron M. Andrews, Haitao Wang:
Minimizing the Aggregate Movements for Interval Coverage. 28-39 - Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault
Online Bin Packing with Advice of Small Size. 40-53 - Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan:
On the Approximability of Orthogonal Order Preserving Layout Adjustment. 54-65 - Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. 66-78 - William Bird, Wendy J. Myrvold
Generation of Colourings and Distinguishing Colourings of Graphs. 79-90 - Gerth Stølting Brodal
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. 91-102 - Andreas Bärtschi
On Conflict-Free Multi-coloring. 103-114 - Sergio Cabello
Semi-dynamic Connectivity in the Plane. 115-126 - Sergio Cabello
Interval Selection in the Streaming Model. 127-139 - Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi:
On the Bounded-Hop Range Assignment Problem. 140-151 - Parinya Chalermsook, Mayank Goswami, László Kozma
Greedy Is an Almost Optimal Deque. 152-165 - Yi-Jun Chang
A New Approach for Contact Graph Representations and Its Applications. 166-177 - Jianer Chen, Chao Xu, Jianxin Wang:
Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm. 178-188 - Ke Chen, Adrian Dumitrescu:
Select with Groups of 3 or 4. 189-199 - Michael B. Cohen
Approximating Nearest Neighbor Distances. 200-211 - Christophe Crespelle, Tien-Nam Le
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs. 212-223 - Philip Dasler
On the Complexity of an Unregulated Traffic Crossing. 224-235 - Mark de Berg, Joachim Gudmundsson
Finding Pairwise Intersections Inside a Query Range. 236-248 - Erik D. Demaine, Vineet Gopal, William Hasenplaugh:
Cache-Oblivious Iterated Predecessor Queries via Range Coalescing. 249-262 - Erik D. Demaine, Tim Kaler, Quanquan C. Liu, Aaron Sidford, Adam Yedidia:
Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing. 263-275 - Feodor F. Dragan, Arne Leitert:
On the Minimum Eccentricity Shortest Path Problem. 276-288 - Adrian Dumitrescu, Csaba D. Tóth:
Convex Polygons in Geometric Triangulations. 289-300 - Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon
Straight-Line Drawability of a Planar Graph Plus an Edge. 301-313 - Eduard Eiben, Robert Ganian
Solving Problems on Graphs of High Rank-Width. 314-326 - David Eppstein:
The Parametric Closure Problem. 327-338 - David Eppstein, J. Michael McCarthy
Rooted Cycle Bases. 339-350 - Chenglin Fan, Omrit Filtser
On the Chain Pair Simplification Problem. 351-362 - Martin Farach-Colton
Finding Articulation Points of Large Graphs in Linear Time. 363-372 - Zachary Friggstad, Mohsen Rezapour
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. 373-385 - Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Universal Reconstruction of a String. 386-397 - Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono
The Complexity of Dominating Set Reconfiguration. 398-409 - Falk Hüffner
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes. 410-421 - Takehiro Ito, Yota Otachi
Competitive Diffusion on Weighted Graphs. 422-433 - Varunkumar Jayapaul
Sorting and Selection with Equality Comparisons. 434-445 - Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. 446-457 - Adam Karczmarz
Fast and Simple Connectivity in Graph Timelines. 458-469 - Tsvi Kopelowitz, Seth Pettie, Ely Porat:
Dynamic Set Intersection. 470-481 - Matias Korman, Wolfgang Mulzer
Time-Space Trade-offs for Triangulations and Voronoi Diagrams. 482-494 - Wenjun Li, Jianxin Wang, Jianer Chen, Yixin Cao
A 2k-vertex Kernel for Maximum Internal Spanning Tree. 495-505 - Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan
Reconfiguration on Sparse Graphs. 506-517 - Bodo Manthey:
Smoothed Analysis of Local Search Algorithms. 518-527 - Sebastian Buchwald, Manuel Mohr, Ignaz Rutter
Optimal Shuffle Code with Permutation Instructions. 528-541 - Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Non-preemptive Scheduling on Machines with Setup Times. 542-553 - Atsuki Nagao, Kazuhisa Seto
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. 554-565 - Fahad Panolan
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids. 566-577 - Christian Knauer, Fabian Stehn:
Elastic Geometric Shape Matching for Point Sets under Translations. 578-592 - Takeaki Uno:
Constant Time Enumeration by Amortization. 593-605 - Haitao Wang, Jingru Zhang:
Computing the Center of Uncertain Points on Tree Networks. 606-618 - Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi
Swapping Colored Tokens on Graphs. 619-628 - Boting Yang:
Positive Semidefinite Zero Forcing: Complexity and Lower Bounds. 629-639
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-12-13 18:58 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: