Остановите войну!
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 2,387 matches
- 2024
- Linqing Gao, Dengzhe Ha, Litao Ma, Jiqiang Chen:
The prediction model of water level in front of the check gate of the LSTM neural network based on AIW-CLPSO. J. Comb. Optim. 47(2): 5 (2024) - Yingying Guo, Qiaoliang Li:
Approximation algorithms for the fault-tolerant facility location problem with submodular penalties. J. Comb. Optim. 47(2): 14 (2024) - G. Jaykrishnan, Asaf Levin:
EPTAS for parallel identical machine scheduling with time restrictions. J. Comb. Optim. 47(2): 10 (2024) - Tengteng Liang, Mingzu Zhang, Sufang Liu:
Concentration behavior: 50 percent of h-extra edge connectivity of pentanary n-cube with exponential faulty edges. J. Comb. Optim. 47(2): 3 (2024) - Hechao Liu, Lihua You, Yufei Huang, Zenan Du:
On sufficient conditions for Hamiltonicity of graphs, and beyond. J. Comb. Optim. 47(2): 11 (2024) - Shikha Mehta:
Improved shuffled Frog leaping algorithm with unsupervised population partitioning strategies for complex optimization problems. J. Comb. Optim. 47(2): 6 (2024) - A. Mohanapriya, P. Renjith, N. Sadagopan:
On convexity in split graphs: complexity of Steiner tree and domination. J. Comb. Optim. 47(2): 8 (2024) - Reza Naserasr, Weiqiang Yu:
On the packing number of antibalanced signed simple planar graphs of negative girth at least 5. J. Comb. Optim. 47(2): 9 (2024) - Lin Niu, Xiangwen Li:
On the Alon-Tarsi number of semi-strong product of graphs. J. Comb. Optim. 47(1): 1 (2024) - Francisco J. Tapia-Ubeda, Pablo A. Miranda Gonzalez, Gabriel Gutiérrez-Jarpa:
Integrating supplier selection decisions into an inventory location problem for designing the supply chain network. J. Comb. Optim. 47(2): 2 (2024) - Manuel V. C. Vieira:
A linear ordering problem with weighted rank. J. Comb. Optim. 47(2): 13 (2024) - Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen:
A branch-and-cut algorithm for the balanced traveling salesman problem. J. Comb. Optim. 47(2): 4 (2024) - Jun Wu, Zhen Yang, Guiqing Zhang, Yongxi Cheng:
An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem. J. Comb. Optim. 47(2): 7 (2024) - Guangwei Wu, Fu Zuo, Feng Shi, Jian-Xin Wang:
On scheduling multiple parallel two-stage flowshops with Johnson's Rule. J. Comb. Optim. 47(2): 12 (2024) - 2023
- Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Hui Lei, Yongtang Shi:
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs. J. Comb. Optim. 45(1): 40 (2023) - Retraction Note: Smart logistics with IoT-based enterprise management system using global manufacturing. J. Comb. Optim. 45(3): 97 (2023)
- Mohammad Amin Amani, Mohammad Mahdi Nasiri:
A novel cross docking system for distributing the perishable products considering preemption: a machine learning approach. J. Comb. Optim. 45(5): 130 (2023) - Aflatoun Amouzandeh, Ahmad Moradi:
On the computational complexity of Roman2-domination in grid graphs. J. Comb. Optim. 45(3): 94 (2023) - Matheus Diógenes Andrade, Fábio Luiz Usberti:
A theoretical and computational study of green vehicle routing problems. J. Comb. Optim. 45(5): 118 (2023) - Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis:
Faster algorithms for k-subset sum and variations. J. Comb. Optim. 45(1): 24 (2023) - Julio Aracena, Christopher Thraves Caro:
The weighted sitting closer to friends than enemies problem in the line. J. Comb. Optim. 45(1): 9 (2023) - Jorge Arenas, Juan Pablo Torres-Martínez:
Reconsidering the existence of stable solutions in three-sided matching problems with mixed preferences. J. Comb. Optim. 45(2): 62 (2023) - Ritxar Arlegi, Dinko Dimitrov:
League competitions and fairness. J. Comb. Optim. 45(4): 101 (2023) - Bogdan Armaselu:
Approximation algorithms for some extensions of the maximum profit routing problem. J. Comb. Optim. 45(1): 26 (2023) - Yuhang Bai, Zhiwei Guo, Shenggui Zhang, Yandong Bai:
Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs. J. Comb. Optim. 45(2): 73 (2023) - Javad Behnamian, Z. Gharabaghli:
Multi-objective outpatient scheduling in health centers considering resource constraints and service quality: a robust optimization approach. J. Comb. Optim. 45(2): 80 (2023) - Yuehua Bu, Zewei Zhang, Hongguo Zhu:
2-Distance coloring of planar graphs without adjacent 5-cycles. J. Comb. Optim. 45(5): 126 (2023) - John S. Caughman IV, Charles L. Dunn, Joshua D. Laison, Nancy Ann Neudauer, Colin L. Starr:
Area, perimeter, height, and width of rectangle visibility graphs. J. Comb. Optim. 46(3): 18 (2023) - Zian Chen, Bin Chen, Zhongzheng Tang, Zhuo Diao:
A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size. J. Comb. Optim. 45(1): 37 (2023) - Zihan Chen, Bin Liu, Hongmin W. Du:
Streaming submodular maximization under d-knapsack constraints. J. Comb. Optim. 45(1): 15 (2023)
skipping 2,357 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-16 13:39 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