Остановите войну!
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 1,045 matches
- 2024
- Benjamin Doerr, Amirhossein Rajabi, Carsten Witt:
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. Algorithmica 86(1): 64-89 (2024) - Sheng-Yen Ko, Ho-Lin Chen, Siu-Wing Cheng, Wing-Kai Hon, Chung-Shou Liao:
Polynomial-time Combinatorial Algorithm for General Max-Min Fair Allocation. Algorithmica 86(2): 485-504 (2024) - Junyan Dai, Tobias Rubel, Yunheng Han, Erin K. Molloy:
Dollo-CDP: a polynomial-time algorithm for the clade-constrained large Dollo parsimony problem. Algorithms Mol. Biol. 19(1): 2 (2024) - Young-Soo Myung:
A polynomial time algorithm for the triangle packing problem on interval graphs. Discret. Appl. Math. 343: 180-183 (2024) - Shiyong Zhu, Jianquan Lu, Daniel W. C. Ho, Jinde Cao:
Minimal Control Nodes for Strong Structural Observability of Discrete-Time Iterative Systems: Explicit Formulas and Polynomial-Time Algorithms. IEEE Trans. Autom. Control. 69(4): 2158-2173 (2024) - Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. SODA 2024: 625-638 - Maciej Drozdowski:
On SAT information content, its polynomial-time solvability and fixed code algorithms. CoRR abs/2401.00947 (2024) - Alfredo Goñi Sarriguren:
SARRIGUREN: a polynomial-time complete algorithm for random k-SAT with relatively dense clauses. CoRR abs/2401.09234 (2024) - Sergey S. Ketkov, Oleg A. Prokopyev:
On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms. CoRR abs/2401.12010 (2024) - Ben Jourdan, Peter Macgregor, He Sun:
Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime. CoRR abs/2402.08545 (2024) - Matthias Bentert, Klaus Heeger, Tomohiro Koana:
Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. CoRR abs/2403.01839 (2024) - 2023
- Sebastiano Fichera, Gregorio Mariggiò, Mauro Corrado, Giulio Ventura:
Integration of Polynomials Times Double Step Function in Quadrilateral Domains for XFEM Analysis. Algorithms 16(6): 290 (2023) - Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing. Algorithms 16(3): 144 (2023) - Jing Xu, Chaofan Ren, Xiaonan Chang:
Robot Time-Optimal Trajectory Planning Based on Quintic Polynomial Interpolation and Improved Harris Hawks Algorithm. Axioms 12(3): 245 (2023) - Jiseung Kim, Changmin Lee:
A polynomial time algorithm for breaking NTRU encryption with multiple keys. Des. Codes Cryptogr. 91(8): 2779-2789 (2023) - Peng Li, Aifa Wang:
Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs. J. Comb. Optim. 45(1): 45 (2023) - Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl. 27(3): 173-194 (2023) - Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. J. Mach. Learn. Res. 24: 213:1-213:45 (2023) - Jason M. Altschuler, Enric Boix-Adserà:
Polynomial-time algorithms for multimarginal optimal transport problems with structure. Math. Program. 199(1): 1107-1178 (2023) - David T. Mildebrath:
A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation. Optim. Lett. 17(2): 265-282 (2023) - Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games. SIAM J. Comput. 52(5): 1083-1096 (2023) - An-Yang Lu, Guang-Hong Yang:
A Polynomial-Time Algorithm for the Secure State Estimation Problem Under Sparse Sensor Attacks via State Decomposition Technique. IEEE Trans. Autom. Control. 68(12): 7451-7465 (2023) - Anders Aamand, Mikkel Abrahamsen, Peter M. R. Rasmussen, Thomas D. Ahle:
Tiling with Squares and Packing Dominos in Polynomial Time. ACM Trans. Algorithms 19(3): 30:1-30:28 (2023) - Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. ACM Trans. Algorithms 19(4): 31:1-31:17 (2023) - Manuel Lafond:
Recognizing k-Leaf Powers in Polynomial Time, for Constant k. ACM Trans. Algorithms 19(4): 35:1-35:35 (2023) - Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. TheoretiCS 2 (2023) - Mordecai J. Golin, Elfarouk Harb:
A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes. IEEE Trans. Inf. Theory 69(10): 6269-6278 (2023) - Balázs Vass, Erika R. Bérczi-Kovács, Ábel Barabás, Zsombor L. Hajdú, János Tapolcai:
A Whirling Dervish: Polynomial-Time Algorithm for the Regional SRLG-Disjoint Paths Problem. IEEE/ACM Trans. Netw. 31(6): 3051-3062 (2023) - Matthias Bentert, Klaus Heeger, Tomohiro Koana:
Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. ESA 2023: 16:1-16:16 - Marcin Wojnakowski, Remigiusz Wisniewski, Mateusz Poplawski:
A Polynomial-Time Algorithm for Detecting Potentially Unbounded Places in a Petri Net-Based Concurrent System. Euro-Par Workshops 2023: 277-283
skipping 1,015 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-05-04 11:18 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