Остановите войну!
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 358 matches
- 2024
- Jiwoo Son, Minsu Kim, Sanghyeok Choi, Hyeonah Kim, Jinkyoo Park:
Equity-Transformer: Solving NP-Hard Min-Max Routing Problems as Sequential Generation with Equity Context. AAAI 2024: 20265-20273 - Evripidis Bampis, Bruno Escoffier, Michalis Xefteris:
Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems. CoRR abs/2402.02062 (2024) - Fernando Rubio, Ismael Rodríguez:
Water-Based Metaheuristics: How Water Dynamics Can Help Us to Solve NP-Hard Problems. CoRR abs/2403.12058 (2024) - Mohammed Alromema, Mohammed A. Makarem:
Enhancing Evolutionary Solver Efficiency for NP Hard Single Machine Scheduling Problems. CoRR abs/2403.19109 (2024) - Karthik C. S., Pasin Manurangsi:
On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results. Electron. Colloquium Comput. Complex. TR24: TR24-007 (2024) - 2023
- Annika Tonnius:
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems. University of Duisburg-Essen, Germany, 2023 - Jehn-Ruey Jiang, Chun-Wei Chu:
Classifying and Benchmarking Quantum Annealing Algorithms Based on Quadratic Unconstrained Binary Optimization for Solving NP-Hard Problems. IEEE Access 11: 104165-104178 (2023) - Bahram Sadeghi Bigham:
Minimum constraint removal problem for line segments is NP-hard. Discret. Math. Algorithms Appl. 15(1): 2250055:1-2250055:10 (2023) - Michael Sun:
PP-GNN: Pretraining Position-aware Graph Neural Networks with the NP-hard metric dimension problem. Neurocomputing 561: 126848 (2023) - Tim Zeitz:
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times. Inf. Process. Lett. 179: 106287 (2023) - Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theor. Comput. Sci. 947: 113691 (2023) - Katharina Kreuzer, Tobias Nipkow:
Verification of NP-Hardness Reduction Functions for Exact Lattice Problems. CADE 2023: 365-381 - Marc Hellmuth, Guillaume E. Scholz:
Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs. COCOON (1) 2023: 115-126 - Kameng Nip:
On the NP-Hardness of Two Scheduling Problems Under Linear Constraints. IJTCS-FAW 2023: 58-70 - Dorit S. Hochbaum:
Unified New Techniques for NP-Hard Budgeted Problems with Applications in Team Collaboration, Pattern Recognition, Document Summarization, Community Detection and Imaging. KDIR 2023: 365-372 - Lehilton L. C. Pedrosa, Mauro R. C. da Silva, Rafael C. S. Schouery:
Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement). LAGOS 2023: 400-402 - Jargalsaikhan Artag, Moe Shimada, Jun-ichi Shirakashi:
Parallel Quantum Annealing: A Novel Approach to Solving Multiple NP-Hard Problems Concurrently. QCE 2023: 328-329 - Jiwoo Son, Minsu Kim, Sanghyeok Choi, Jinkyoo Park:
Solving NP-hard Min-max Routing Problems as Sequential Generation with Equity Context. CoRR abs/2306.02689 (2023) - Marc Hellmuth, Guillaume E. Scholz:
Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs. CoRR abs/2306.04367 (2023) - Katharina Kreuzer, Tobias Nipkow:
Verification of NP-hardness Reduction Functions for Exact Lattice Problems. CoRR abs/2306.08375 (2023) - Reiner Czerwinski:
NP-hard problems are not in BQP. CoRR abs/2311.05624 (2023) - Karthik C. S., Pasin Manurangsi:
On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results. CoRR abs/2312.17140 (2023) - 2022
- Gábor Kondor:
NP-hardness of m-dimensional weighted matching problems. Theor. Comput. Sci. 930: 33-36 (2022) - Victor Lagerkvist, Magnus Wahlström:
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. ACM Trans. Comput. Theory 14(1): 2:1-2:54 (2022) - Anne Elorza, Leticia Hernando, José Antonio Lozano:
Transitions from P to NP-hardness: the case of the Linear Ordering Problem. CEC 2022: 1-8 - Vijay Bhattiprolu, Euiwoong Lee, Madhur Tulsiani:
Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem. ITCS 2022: 22:1-22:17 - Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken:
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. SWAT 2022: 29:1-29:19 - Leo Ardon:
Reinforcement Learning to Solve NP-hard Problems: an Application to the CVRP. CoRR abs/2201.05393 (2022) - Anne Elorza, Leticia Hernando, José Antonio Lozano:
Transitions from P to NP-hardness: the case of the Linear Ordering Problem. CoRR abs/2205.12943 (2022) - Sumedh Pendurkar, Taoan Huang, Sven Koenig, Guni Sharon:
The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems. CoRR abs/2209.03393 (2022)
skipping 328 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-24 01:23 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