Остановите войну!
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 49 matches
- 2021
- Alexsandro Oliveira Alexandrino, Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer, Zanoni Dias:
Length-weighted λ-rearrangement distance. J. Comb. Optim. 41(3): 579-602 (2021) - Ha-Bang Ban:
A metaheuristic for the delivery man problem with time windows. J. Comb. Optim. 41(4): 794-816 (2021) - Navdeep Bohra, Vishal Bhatnagar:
Group level social media popularity prediction by MRGB and Adam optimization. J. Comb. Optim. 41(2): 328-347 (2021) - Steffen Borgwardt, Stephan Patterson:
On the computational complexity of finding a sparse Wasserstein barycenter. J. Comb. Optim. 41(3): 736-761 (2021) - Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang:
A randomized approximation algorithm for metric triangle packing. J. Comb. Optim. 41(1): 12-27 (2021) - Byung-Cheon Choi, Myoung-Ju Park:
Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty. J. Comb. Optim. 41(4): 781-793 (2021) - Roberto Cruz, Juan Daniel Monsalve, Juan Rada:
The balanced double star has maximum exponential second Zagreb index. J. Comb. Optim. 41(2): 544-552 (2021) - Hamid Darabi, Yaser Alizadeh, Sandi Klavzar, Kinkar Chandra Das:
On the relation between Wiener index and eccentricity of a graph. J. Comb. Optim. 41(4): 817-829 (2021) - Randy Davila, Michael A. Henning:
Zero forcing versus domination in cubic graphs. J. Comb. Optim. 41(2): 553-577 (2021) - Magda Dettlaff, Magdalena Lemanska, Juan A. Rodríguez-Velázquez:
Secure Italian domination in graphs. J. Comb. Optim. 41(1): 56-72 (2021) - Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis:
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity. J. Comb. Optim. 41(1): 80-104 (2021) - Tínaz Ekim, Mordechai Shalom, Oylum Seker:
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation. J. Comb. Optim. 41(3): 710-735 (2021) - Michitaka Furuya:
A continuous generalization of domination-like invariants. J. Comb. Optim. 41(4): 905-922 (2021) - Hong Gao, Tingting Feng, Yuansheng Yang:
Italian domination in the Cartesian product of paths. J. Comb. Optim. 41(2): 526-543 (2021) - Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi:
Approximation algorithm for the multicovering problem. J. Comb. Optim. 41(2): 433-450 (2021) - Frank Gurski, Dominique Komander, Carolin Rehs:
On characterizations for subclasses of directed co-graphs. J. Comb. Optim. 41(1): 234-266 (2021) - Mohammad Reza Hassani, Javad Behnamian:
A scenario-based robust optimization with a pessimistic approach for nurse rostering problem. J. Comb. Optim. 41(1): 143-169 (2021) - Teresa W. Haynes, Michael A. Henning:
Bounds on the semipaired domination number of graphs with minimum degree at least two. J. Comb. Optim. 41(2): 451-486 (2021) - Zaobo He, Akshita Maradapu Vera Venkata Sai, Yan Huang, Daehee Seo, Hanzhou Zhang, Qilong Han:
Differentially private approximate aggregation based on feature selection. J. Comb. Optim. 41(2): 318-327 (2021) - Ruyan He, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. J. Comb. Optim. 41(2): 504-525 (2021) - Rangel Hernández-Ortiz, Luis Pedro Montejano, Juan Alberto Rodríguez-Velázquez:
Secure domination in rooted product graphs. J. Comb. Optim. 41(2): 401-413 (2021) - Soheyl Khalilpourazari, Seyed Hamid Reza Pasandideh:
Designing emergency flood evacuation plans using robust optimization and artificial intelligence. J. Comb. Optim. 41(3): 640-677 (2021) - Wenjie Li, Jinjiang Yuan:
Single-machine online scheduling of jobs with non-delayed processing constraint. J. Comb. Optim. 41(4): 830-843 (2021) - Ke Liu, Mei Lu:
Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs. J. Comb. Optim. 41(4): 923-933 (2021) - Xianliang Liu, Zishen Yang, Wei Wang:
The t-latency bounded strong target set selection problem in some kinds of special family of graphs. J. Comb. Optim. 41(1): 105-117 (2021) - Henan Liu, Huili Zhang, Yi Xu:
The m-Steiner Traveling Salesman Problem with online edge blockages. J. Comb. Optim. 41(4): 844-860 (2021) - Jinn Lu, Hung-Lin Fu:
Quaternary splitting algorithm in group testing. J. Comb. Optim. 41(1): 73-79 (2021) - Yong Lu, Qiannan Zhou:
On sufficient topological indices conditions for properties of graphs. J. Comb. Optim. 41(2): 487-503 (2021) - Wei Lv, Chenchen Wu:
An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties. J. Comb. Optim. 41(4): 888-904 (2021) - Zhenhua Lyu:
Digraphs that contain at most t distinct walks of a given length with the same endpoints. J. Comb. Optim. 41(3): 762-779 (2021)
skipping 19 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-06-27 19:34 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