Остановите войну!
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 71 matches
- 2019
- Douglas S. Altner, Erica K. Mason, Leslie D. Servi:
Two-stage stochastic days-off scheduling of multi-skilled analysts with training options. J. Comb. Optim. 38(1): 111-129 (2019) - Micheal Arockiaraj, Jessie Abraham, Arul Jeya Shalini:
Node set optimization problem for complete Josephus cubes. J. Comb. Optim. 38(4): 1180-1195 (2019) - Mohamed Barkaoui, Jean Berger, Abdeslem Boukhtouta:
An evolutionary approach for the target search problem in uncertain environment. J. Comb. Optim. 38(3): 808-835 (2019) - Maksim Barketau:
Determining the interset distance. J. Comb. Optim. 38(1): 316-332 (2019) - L. Bayón, Pedro Fortuny, J. M. Grau, Antonio M. Oller-Marcén, M. M. Ruiz:
The Best-or-Worst and the Postdoc problems with random number of candidates. J. Comb. Optim. 38(1): 86-110 (2019) - Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa:
Approximation algorithms for Median Hub Location Problems. J. Comb. Optim. 38(2): 375-401 (2019) - Pierre Bergé, Jean Desmarchelier, Wen Guo, Aurélie Lefebvre, Arpad Rimmel, Joanna Tomasik:
Multiple Canadians on the road: minimizing the distance competitive ratio. J. Comb. Optim. 38(4): 1086-1100 (2019) - Boris Brimkov, Derek Mikesell, Logan A. Smith:
Connected power domination in graphs. J. Comb. Optim. 38(1): 292-315 (2019) - Yulin Chang, Qiancheng Ouyang, Guanghui Wang:
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10. J. Comb. Optim. 38(1): 185-196 (2019) - Yong Chen, Randy Goebel, Guohui Lin, Bing Su, Yao Xu, An Zhang:
An improved approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 38(1): 150-164 (2019) - Chen Chen, Yu Wei:
Robust multiobjective portfolio optimization: a set order relations approach. J. Comb. Optim. 38(1): 21-49 (2019) - Byung-Cheon Choi, Changmuk Kang:
A linear time-cost tradeoff problem with multiple milestones under a comb graph. J. Comb. Optim. 38(2): 341-361 (2019) - Ali Çivril:
Approximation of Steiner forest via the bidirected cut relaxation. J. Comb. Optim. 38(4): 1196-1212 (2019) - Federico Della Croce, Rosario Scatamacchia, Vincent T'kindt:
A tight linear time $$\frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{\max }$$ problem. J. Comb. Optim. 38(2): 608-617 (2019) - Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim. 38(1): 165-184 (2019) - Peter Damaschke:
Parameterized Mixed Graph Coloring. J. Comb. Optim. 38(2): 362-374 (2019) - Mahsa Darkooti, Abdollah Alhevaz, Sadegh Rahimi, Hadi Rahbani:
On perfect Roman domination number in trees: complexity and bounds. J. Comb. Optim. 38(3): 712-720 (2019) - Zola Donovan, Gregory Z. Gutin, Vahan Mkrtchyan, K. Subramani:
Clustering without replication in combinatorial circuits. J. Comb. Optim. 38(2): 481-501 (2019) - Madalina M. Drugan:
Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem. J. Comb. Optim. 38(4): 1213-1262 (2019) - Leah Epstein:
A lower bound for online rectangle packing. J. Comb. Optim. 38(3): 846-866 (2019) - Wai Lam Fong, Wai Hong Chan:
The edge coloring game on trees with the number of colors greater than the game chromatic index. J. Comb. Optim. 38(2): 456-480 (2019) - Yuan Gao, Jinjiang Yuan:
Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs. J. Comb. Optim. 38(3): 698-711 (2019) - Li Guan, Jianping Li, Weidong Li, Junran Lichen:
Improved approximation algorithms for the combination problem of parallel machine scheduling and path. J. Comb. Optim. 38(3): 689-697 (2019) - Majid Hajian, Michael A. Henning, Nader Jafari Rad:
A new lower bound on the domination number of a graph. J. Comb. Optim. 38(3): 721-738 (2019) - Damir Hasic, Eric Tannier:
Gene tree reconciliation including transfers with replacement is NP-hard and FPT. J. Comb. Optim. 38(2): 502-544 (2019) - Michael A. Henning, Pawaton Kaemawichanurat:
Semipaired domination in maximal outerplanar graphs. J. Comb. Optim. 38(3): 911-926 (2019) - Marika Ivanová, Dag Haugland:
Integer programming formulations for the shared multicast tree problem. J. Comb. Optim. 38(3): 927-956 (2019) - Yiwei Jiang, Ping Zhou, Wei Zhou:
MapReduce machine covering problem on a small number of machines. J. Comb. Optim. 38(4): 1066-1076 (2019) - Liying Kang, Lele Liu, Erfang Shan:
The eigenvectors to the p-spectral radius of general hypergraphs. J. Comb. Optim. 38(2): 556-569 (2019) - Shih-Shun Kao, Kung-Jui Pai, Sun-Yuan Hsieh, Ro-Yu Wu, Jou-Ming Chang:
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. J. Comb. Optim. 38(3): 972-986 (2019)
skipping 41 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-15 03:57 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