default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 56 matches
- 2018
- Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. ACM Trans. Algorithms 14(3): 27:1-27:23 (2018) - Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang:
Computing the Gromov-Hausdorff Distance for Metric Trees. ACM Trans. Algorithms 14(2): 24:1-24:20 (2018) - Pankaj K. Agarwal, Kyle Fox, Oren Salzman:
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. ACM Trans. Algorithms 14(4): 46:1-46:21 (2018) - Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. ACM Trans. Algorithms 14(2): 16:1-16:29 (2018) - Evangelos Anagnostopoulos, Ioannis Z. Emiris, Ioannis Psarros:
Randomized Embeddings with Slack and High-Dimensional Approximate Nearest Neighbor. ACM Trans. Algorithms 14(2): 18:1-18:21 (2018) - Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese:
A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path. ACM Trans. Algorithms 14(4): 55:1-55:23 (2018) - Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. ACM Trans. Algorithms 14(4): 54:1-54:24 (2018) - Boris Aronov, Matthew J. Katz:
Batched Point Location in SINR Diagrams via Algebraic Tools. ACM Trans. Algorithms 14(4): 41:1-41:29 (2018) - Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms 14(2): 25:1-25:20 (2018) - Jérémy Barbay, Pablo Pérez-Lantero:
Adaptive Computation of the Swap-Insert Correction Distance. ACM Trans. Algorithms 14(4): 49:1-49:16 (2018) - Florian Barbero, Christophe Paul, Michal Pilipczuk:
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. ACM Trans. Algorithms 14(3): 38:1-38:31 (2018) - Mark de Berg, Joachim Gudmundsson, Mehran Mehr:
Faster Algorithms for Computing Plurality Points. ACM Trans. Algorithms 14(3): 36:1-36:23 (2018) - Arnab Bhattacharyya, Fabrizio Grandoni, Aleksandar Nikolov, Barna Saha, Saket Saurabh, Aravindan Vijayaraghavan, Qin Zhang:
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. ACM Trans. Algorithms 14(3): 26:1-26:2 (2018) - Marcin Bienkowski, Tomasz Jurdzinski, Miroslaw Korzeniowski, Dariusz R. Kowalski:
Distributed Online and Stochastic Queueing on a Multiple Access Channel. ACM Trans. Algorithms 14(2): 21:1-21:22 (2018) - Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
Subexponential Parameterized Algorithm for Interval Completion. ACM Trans. Algorithms 14(3): 35:1-35:62 (2018) - Jean-Daniel Boissonnat, Karthik C. S.:
An Efficient Representation for Filtrations of Simplicial Complexes. ACM Trans. Algorithms 14(4): 44:1-44:21 (2018) - Niv Buchbinder, Moran Feldman:
Deterministic Algorithms for Submodular Maximization Problems. ACM Trans. Algorithms 14(3): 32:1-32:20 (2018) - Timothy M. Chan:
Improved Deterministic Algorithms for Linear Programming in Low Dimensions. ACM Trans. Algorithms 14(3): 30:1-30:10 (2018) - T.-H. Hubert Chan, Fei Chen, Xiaowei Wu:
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity. ACM Trans. Algorithms 14(2): 12:1-12:25 (2018) - T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang:
Online Submodular Maximization with Free Disposal. ACM Trans. Algorithms 14(4): 56:1-56:29 (2018) - T.-H. Hubert Chan, Shaofeng H.-C. Jiang:
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. ACM Trans. Algorithms 14(1): 9:1-9:18 (2018) - Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Selection and Sorting in the "Restore" Model. ACM Trans. Algorithms 14(2): 11:1-11:18 (2018) - Shiri Chechik, Christian Wulff-Nilsen:
Near-Optimal Light Spanners. ACM Trans. Algorithms 14(3): 33:1-33:15 (2018) - Lin Chen, Guochuan Zhang:
Packing Groups of Items into Multiple Knapsacks. ACM Trans. Algorithms 14(4): 51:1-51:24 (2018) - Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs. ACM Trans. Algorithms 14(1): 1:1-1:33 (2018) - Edith Cohen:
Stream Sampling Framework and Application for Frequency Cap Statistics. ACM Trans. Algorithms 14(4): 52:1-52:40 (2018) - Nikhil R. Devanur, Zhiyi Huang:
Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms. ACM Trans. Algorithms 14(1): 5:1-5:30 (2018) - Ran Duan, Seth Pettie, Hsin-Hao Su:
Scaling Algorithms for Weighted Matching in General Graphs. ACM Trans. Algorithms 14(1): 8:1-8:35 (2018) - David Eppstein:
The Parametric Closure Problem. ACM Trans. Algorithms 14(1): 2:1-2:22 (2018) - Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. ACM Trans. Algorithms 14(4): 48:1-48:23 (2018)
skipping 26 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-25 11:14 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint