Остановите войну!
for scientists:
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 123 matches
- 2024
- Kent Quanrud:
Faster exact and approximation algorithms for packing and covering matroids via push-relabel. SODA 2024: 2305-2336 - Thijs van der Horst, Tim Ophelders:
Faster Fréchet Distance Approximation through Truncated Smoothing. CoRR abs/2401.14815 (2024) - 2023
- Stanislav I. Protasov, Marina O. Lisnichenko:
Faster quantum state decomposition with Tucker tensor approximation. Quantum Mach. Intell. 5(2): 1-10 (2023) - Juha Harviainen, Mikko Koivisto:
A Faster Practical Approximation Scheme for the Permanent. AAAI 2023: 12216-12224 - Vedangi Bengali, Nate Veldt:
Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CIKM 2023: 78-87 - Kent Quanrud:
Faster exact and approximation algorithms for packing and covering matroids via push-relabel. CoRR abs/2303.01478 (2023) - Vedangi Bengali, Nate Veldt:
Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CoRR abs/2306.04884 (2023) - Ernest van Wijland, Hang Zhou:
Faster Approximation Schemes for k-TSP and k-MST in the Euclidean Space. CoRR abs/2307.08069 (2023) - Yuga Kanaya, Kenjiro Takazawa:
A Faster Deterministic Approximation Algorithm for TTP-2. CoRR abs/2310.02592 (2023) - 2022
- Fernando G. S. L. Brandão, Richard Kueng, Daniel Stilck França:
Faster quantum and classical SDP approximations for quadratic binary optimization. Quantum 6: 625 (2022) - Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA 2022: 50:1-50:19 - Shipu Zhao, Zachary Frangella, Madeleine Udell:
NysADMM: faster composite convex optimization via low-rank approximation. ICML 2022: 26824-26840 - Amrit Nagarajan, Sanchari Sen, Jacob R. Stevens, Anand Raghunathan:
AxFormer: Accuracy-driven Approximation of Transformers for Faster, Smaller and more Accurate NLP Models. IJCNN 2022: 1-8 - Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu:
Brief Announcement: Faster Stencil Computations using Gaussian Approximations. SPAA 2022: 291-293 - Alexsandro Oliveira Alexandrino, Klairton Lima Brito, Andre Rodrigues Oliveira, Ulisses Dias, Zanoni Dias:
A 1.375-Approximation Algorithm for Sorting by Transpositions with Faster Running Time. BSB 2022: 147-157 - Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR abs/2206.13481 (2022) - 2021
- Haiyong Wang:
How much faster does the best polynomial approximation converge than Legendre projection? Numerische Mathematik 147(2): 481-503 (2021) - Guillaume Ducoffe:
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs. SIAM J. Discret. Math. 35(2): 953-969 (2021) - Fabrizio Grandoni, Tobias Mömke, Andreas Wiese:
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ESA 2021: 49:1-49:15 - Ariel Kulik, Roy Schwartz, Hadas Shachnai:
A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. CoRR abs/2102.12879 (2021) - Nate Veldt:
Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion. CoRR abs/2111.10699 (2021) - Xiao Ling, Tim Menzies:
Faster Multi-Goal Simulation-Based Testing Using DoLesS (Domination with Least Square Approximation). CoRR abs/2112.01598 (2021) - 2020
- Zhi-Zhong Chen, Youta Harada, Yuna Nakamura, Lusheng Wang:
Faster Exact Computation of rSPR Distance via Better Approximation. IEEE ACM Trans. Comput. Biol. Bioinform. 17(3): 916-929 (2020) - Timothy M. Chan, Qizheng He:
Faster Approximation Algorithms for Geometric Set Cover. SoCG 2020: 27:1-27:14 - Talya Eden, Dana Ron, C. Seshadhri:
Faster sublinear approximation of the number of k-cliques in low-arboricity graphs. SODA 2020: 1467-1478 - Timothy M. Chan, Qizheng He:
Faster Approximation Algorithms for Geometric Set Cover. CoRR abs/2003.13420 (2020) - Adiel Statman, Liat Rozenberg, Dan Feldman:
Faster Projective Clustering Approximation of Big Data. CoRR abs/2011.13476 (2020) - 2019
- Sandy Heydrich, Andreas Wiese:
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem. ACM Trans. Algorithms 15(4): 47:1-47:28 (2019) - Guillaume Ducoffe:
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs. ICALP 2019: 49:1-49:13 - Pasin Manurangsi:
A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation. SOSA 2019: 15:1-15:21
skipping 93 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-04-25 23:06 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