default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th WADS 2019: Edmonton, AB, Canada
- Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour:
Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings. Lecture Notes in Computer Science 11646, Springer 2019, ISBN 978-3-030-24765-2 - Hüseyin Acan
, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Data Structures for Families of Interval Graphs. 1-13 - Katerina Altmanová, Petr Kolman, Jan Voborník:
On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow. 14-27 - Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan:
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. 28-42 - Max Bannach, Sebastian Berndt:
Positive-Instance Driven Dynamic Programming for Graph Searching. 43-56 - Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli:
How to Morph a Tree on a Small Grid. 57-70 - Aniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss:
Approximating Robust Bin Packing with Budgeted Uncertainty. 71-84 - Tim Baumann, Torben Hagerup:
Rank-Select Indices Without Tears. 85-98 - Amariah Becker, Philip N. Klein, Aaron Schild:
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs. 99-111 - Amariah Becker, Alice Paul:
A Framework for Vehicle Routing Approximation Schemes in Trees. 112-125 - Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable Vertices and Edges in Graphs. 126-139 - Ahmad Biniaz:
Plane Hop Spanners for Unit Disk Graphs. 140-154 - Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. 155-167 - Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse:
Parameterized Complexity of Conflict-Free Graph Coloring. 168-180 - Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. 181-195 - Prosenjit Bose, Pilar Cano, Maria Saumell, Rodrigo I. Silveira:
Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs. 196-210 - Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid:
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. 211-224 - Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen:
Online Bin Covering with Advice. 225-238 - Toni Böhnlein, Oliver Schaudt, Joachim Schauer:
Stackelberg Packing Games. 239-253 - Matteo Ceccarello, Anne Driemel, Francesco Silvestri:
FRESH: Fréchet Similarity with Hashing. 254-268 - Timothy M. Chan, Saladi Rahul, Jie Xue:
Range Closest-Pair Search in Higher Dimensions. 269-282 - Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid:
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. 283-295 - Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. 296-310 - Vincent Chau, Shengzhong Feng, Minming Li, Yinling Wang, Guochuan Zhang, Yong Zhang:
Weighted Throughput Maximization with Calibrations. 311-324 - Jong Min Choi, Sergio Cabello, Hee-Kap Ahn:
Maximizing Dominance in the Plane and Its Applications. 325-338 - Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati:
Extending Upward Planar Graph Drawings. 339-352 - Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Reconfiguring Undirected Paths. 353-365 - Sándor P. Fekete, Sven von Höveling, Christian Scheffer:
Online Circle Packing. 366-379 - Moran Feldman:
Guess Free Maximization of Submodular and Linear Sums. 380-394 - David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild:
Efficient Second-Order Shape-Constrained Function Fitting. 395-408 - Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Dynamic Dictionary Matching in the Online Model. 409-422 - Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced Stable Marriage: How Close Is Close Enough? 423-437 - Chien-Chung Huang, Naonori Kakimura:
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. 438-451 - Yang Jiao, R. Ravi:
Inventory Routing Problem with Facility Location. 452-465 - Christopher Johnson, Haitao Wang:
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space. 466-480 - Sang-Sub Kim, Rolf Klein, David Kübel, Elmar Langetepe, Barbara Schwarzwald:
Geometric Firefighting in the Half-Plane. 481-494 - Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
Most Vital Segment Barriers. 495-509 - Caleb C. Levy, Robert E. Tarjan:
Splaying Preorders and Postorders. 510-522 - Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. 523-537 - Clément Maria, Hannah Schreiber:
Discrete Morse Theory for Computing Zigzag Persistence. 538-552 - Richard Peng, Bryce Sandlund, Daniel Dominic Sleator:
Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity. 553-565 - Robert E. Tarjan, Caleb C. Levy, Stephen Timmel:
Zip Trees. 566-577 - Haitao Wang, Jie Xue:
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. 578-591
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 2026-03-06 21:11 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:
