Остановите войну!
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 79 matches
- 2018
- Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Marzieh Soroudi:
Nordhaus-Gaddum bounds for total Roman domination. J. Comb. Optim. 35(1): 126-133 (2018) - Francisco J. Aragón Artacho, Rubén Campoy, Ilias S. Kotsireas, Matthew K. Tam:
A feasibility approach for constructing combinatorial designs of circulant type. J. Comb. Optim. 35(4): 1061-1085 (2018) - L. Bayón, Pedro Fortuny Ayuso, J. M. Grau, Antonio M. Oller-Marcén, M. M. Ruiz:
The Best-or-Worst and the Postdoc problems. J. Comb. Optim. 35(3): 703-723 (2018) - Sylvain Béal, Anna B. Khmelnitskaya, Philippe Solal:
Two-step values for games with two-level communication structure. J. Comb. Optim. 35(2): 563-587 (2018) - József Békési, Gábor Galambos:
Tight bounds for NF-based bounded-space online bin packing algorithms. J. Comb. Optim. 35(2): 350-364 (2018) - Ivan Belik, Kurt Jörnsten:
Critical objective function values in linear sum assignment problems. J. Comb. Optim. 35(3): 842-852 (2018) - Piotr Borowiecki:
Computational aspects of greedy partitioning of graphs. J. Comb. Optim. 35(2): 641-665 (2018) - Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
The maximum cardinality cut problem in co-bipartite chain graphs. J. Comb. Optim. 35(1): 250-265 (2018) - Qingqiong Cai, Xueliang Li, Di Wu:
Some extremal results on the colorful monochromatic vertex-connectivity of a graph. J. Comb. Optim. 35(4): 1300-1311 (2018) - Hua Cai, Jianliang Wu, Lin Sun:
Vertex arboricity of planar graphs without intersecting 5-cycles. J. Comb. Optim. 35(2): 365-372 (2018) - Jing Chen, Genghua Fan:
Large even factors of graphs. J. Comb. Optim. 35(1): 162-169 (2018) - Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang:
An approximation algorithm for maximum internal spanning tree. J. Comb. Optim. 35(3): 955-979 (2018) - Ming-Zhu Chen, Xiao-Dong Zhang:
The number of edges, spectral radius and Hamilton-connectedness of graphs. J. Comb. Optim. 35(4): 1104-1127 (2018) - Xiaohan Cheng, Jianliang Wu:
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven. J. Comb. Optim. 35(1): 1-13 (2018) - Ananya Christman, William Forcier, Aayam Poudel:
From theory to practice: maximizing revenues for on-line dial-a-ride. J. Comb. Optim. 35(2): 512-529 (2018) - Costas K. Constantinou, Georgios Ellinas:
Minimal path decomposition of complete bipartite graphs. J. Comb. Optim. 35(3): 684-702 (2018) - Ante Custic, Abraham P. Punnen:
A characterization of linearizable instances of the quadratic minimum spanning tree problem. J. Comb. Optim. 35(2): 436-453 (2018) - Dmitry Dagaev, Alex Suzdaltsev:
Competitive intensity and quality maximizing seedings in knock-out tournaments. J. Comb. Optim. 35(1): 170-188 (2018) - Laihao Ding, Guanghui Wang, Jianliang Wu:
Generalized acyclic edge colorings via entropy compression. J. Comb. Optim. 35(3): 906-920 (2018) - Srinath Doss, Roselyn Kaondera-Shava:
An optimal Tate pairing computation using Jacobi quartic elliptic curves. J. Comb. Optim. 35(4): 1086-1103 (2018) - Xing Feng, Lianzhu Zhang, Mingzu Zhang:
An O(|E(G)|2) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs. J. Comb. Optim. 35(3): 740-753 (2018) - Chenchen Fu, Vincent Chau, Minming Li, Chun Jason Xue:
Race to idle or not: balancing the memory sleep time with DVS for energy minimization. J. Comb. Optim. 35(3): 860-894 (2018) - Ling Gai, Guochuan Zhang:
Online lazy bureaucrat scheduling with a machine deadline. J. Comb. Optim. 35(2): 530-537 (2018) - Dániel Gerbner, Máté Vizer:
Smart elements in combinatorial group testing problems. J. Comb. Optim. 35(4): 1042-1060 (2018) - Wayne Goddard, Michael A. Henning:
A note on domination and total domination in prisms. J. Comb. Optim. 35(1): 14-20 (2018) - Wayne Goddard, Robert Melville:
Properly colored trails, paths, and bridges. J. Comb. Optim. 35(2): 463-472 (2018) - Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov:
FPT-algorithms for some problems related to integer programming. J. Comb. Optim. 35(4): 1128-1146 (2018) - Jun Guo, Jun Liu:
Deterministic construction of compressed sensing matrices based on semilattices. J. Comb. Optim. 35(1): 148-161 (2018) - Jan Hackfeld, Arie M. C. A. Koster:
The matching extension problem in general graphs is co-NP-complete. J. Comb. Optim. 35(3): 853-859 (2018) - Yijie Han, Sanjeev Saxena:
Algorithms for testing occurrences of length 4 patterns in permutations. J. Comb. Optim. 35(1): 189-208 (2018)
skipping 49 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-25 14:14 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