Остановите войну!
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 88 matches
- 2017
- Matthew Aldridge, Leonardo Baldassini, Karen Gunderson:
Almost separable matrices. J. Comb. Optim. 33(1): 215-236 (2017) - A. Bahremandpour, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Roman game domination number of a graph. J. Comb. Optim. 33(2): 713-725 (2017) - Ying Bai, Xiangwen Li, Gexin Yu:
Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable. J. Comb. Optim. 33(4): 1354-1364 (2017) - Peter Brown, Yuedong Yang, Yaoqi Zhou, Wayne J. Pullan:
A heuristic for the time constrained asymmetric linear sum assignment problem. J. Comb. Optim. 33(2): 551-566 (2017) - Reinhard Bürgy, Heinz Gröflin:
The no-wait job shop with regular objective: a method based on optimal job insertion. J. Comb. Optim. 33(3): 977-1010 (2017) - Qingqiong Cai, Xueliang Li, Di Wu:
Erdős-Gallai-type results for colorful monochromatic connectivity of a graph. J. Comb. Optim. 33(1): 123-131 (2017) - Zhigang Cao, Xujin Chen, Xiaodong Hu, Changjun Wang:
Approximation algorithms for pricing with negative network externalities. J. Comb. Optim. 33(2): 681-712 (2017) - Luis Evaristo Caraballo, Carlos Ochoa, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Matching colored points with rectangles. J. Comb. Optim. 33(2): 403-421 (2017) - Filipa D. Carvalho, Maria Teresa Almeida:
The triangle k-club problem. J. Comb. Optim. 33(3): 814-846 (2017) - Maja Cevnik, Janez Zerovnik:
Broadcasting on cactus graphs. J. Comb. Optim. 33(1): 292-316 (2017) - Yu-Huei Chang, Jinn-Shyong Yang, Sun-Yuan Hsieh, Jou-Ming Chang, Yue-Li Wang:
Construction independent spanning trees on locally twisted cubes in parallel. J. Comb. Optim. 33(3): 956-967 (2017) - Clément Charpentier, Sylvain Gravier, Thomas Lecorre:
Trinque problem: covering complete graphs by plane degree-bounded hypergraphs. J. Comb. Optim. 33(2): 543-550 (2017) - Lily Chen, Xueliang Li, Mengmeng Liu, Yaping Mao:
A solution to a conjecture on the generalized connectivity of graphs. J. Comb. Optim. 33(1): 275-282 (2017) - Cong Chen, Yinfeng Xu, Yuqing Zhu, Chengyu Sun:
Online MapReduce scheduling problem of minimizing the makespan. J. Comb. Optim. 33(2): 590-608 (2017) - Jian Cheng, Cun-Quan Zhang, Bao-Xuan Zhu:
Even factors of graphs. J. Comb. Optim. 33(4): 1343-1353 (2017) - Markus Chimani, Petr Hlinený:
A tighter insertion-based approximation of the crossing number. J. Comb. Optim. 33(4): 1183-1225 (2017) - Reuven Cohen, Mira Gonen, Asaf Levin, Shmuel Onn:
On nonlinear multi-covering problems. J. Comb. Optim. 33(2): 645-659 (2017) - Amir Daneshgar, Meysam Madani:
On the odd girth and the circular chromatic number of generalized Petersen graphs. J. Comb. Optim. 33(3): 897-923 (2017) - Kai Deng, Heping Zhang:
Anti-forcing spectra of perfect matchings of graphs. J. Comb. Optim. 33(2): 660-680 (2017) - Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza:
Complexity properties of complementary prisms. J. Comb. Optim. 33(2): 365-372 (2017) - Xiaofeng Gu:
Packing spanning trees and spanning 2-connected k-edge-connected essentially (2k-1)-edge-connected subgraphs. J. Comb. Optim. 33(3): 924-933 (2017) - Manzhan Gu, Xiwen Lu, Jinwei Gu:
An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan. J. Comb. Optim. 33(2): 473-495 (2017) - Salim Haddadi:
Benders decomposition for set covering problems - Almost satisfying the consecutive ones property. J. Comb. Optim. 33(1): 60-80 (2017) - Dan He, Wensong Lin:
On (s, t)-relaxed strong edge-coloring of graphs. J. Comb. Optim. 33(2): 609-625 (2017) - Hongyu He, Mengqi Liu, Ji-Bo Wang:
Resource constrained scheduling with general truncated job-dependent learning effect. J. Comb. Optim. 33(2): 626-644 (2017) - Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
Maximum flows in generalized processing networks. J. Comb. Optim. 33(4): 1226-1256 (2017) - Jueliang Hu, Yiwei Jiang, Ping Zhou, An Zhang, Qinghui Zhang:
Total completion time minimization in online hierarchical scheduling of unit-size jobs. J. Comb. Optim. 33(3): 866-881 (2017) - Zemin Jin, Yuping Zang:
Anti-Ramsey coloring for matchings in complete bipartite graphs. J. Comb. Optim. 33(1): 1-12 (2017) - Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki:
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis. J. Comb. Optim. 33(2): 496-529 (2017) - Bumtle Kang, Suh-Ryung Kim, Ji Yeon Park:
On consecutive edge magic total labelings of connected bipartite graphs. J. Comb. Optim. 33(1): 13-27 (2017)
skipping 58 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-06 15:15 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