![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 38 matches
- 2007
- Domingos Moreira Cardoso
, Marcin Kaminski, Vadim V. Lozin
:
Maximum k -regular induced subgraphs. J. Comb. Optim. 14(4): 455-463 (2007) - Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang
, Yong Zhang:
Online bin packing of fragile objects with application in cellular networks. J. Comb. Optim. 14(4): 427-435 (2007) - Chia-Fen Chang, Hung-Lin Fu:
Near automorphisms of trees with small total relative displacements. J. Comb. Optim. 14(2-3): 191-195 (2007) - Gerard J. Chang
, Hung-Lin Fu, Xuding Zhu:
Editorial note. J. Comb. Optim. 14(2-3): 111-112 (2007) - Chung-Haw Chang, Chao-Ming Sun, Hua-Min Huang, Lih-Hsing Hsu:
On the equitable k *-laceability of hypercubes. J. Comb. Optim. 14(2-3): 349-364 (2007) - Hsun-Wen Chang, Pei-Fang Tsai:
Characterizing the reconstruction and enumerating the patterns of DNA sequences with repeats. J. Comb. Optim. 14(2-3): 331-347 (2007) - Jer-Jeong Chen, Gerard J. Chang:
Distance graphs on R n with 1-norm. J. Comb. Optim. 14(2-3): 267-274 (2007) - H. B. Chen, Ding-Zhu Du, Frank K. Hwang:
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. J. Comb. Optim. 14(2-3): 121-129 (2007) - Ying-Da Chen, Jing-Ho Yan:
A study on cyclic bandwidth sum. J. Comb. Optim. 14(2-3): 295-308 (2007) - Chao-Chih Chou, Chin-Mei Fu:
Decomposition of K m , n into 4-cycles and 2 t -cycles. J. Comb. Optim. 14(2-3): 205-218 (2007) - Chao-Chih Chou, Chin-Mei Fu:
Decomposition of K m , n into 4-cycles and 2 t -cycles. J. Comb. Optim. 14(2-3): 383 (2007) - Clayton W. Commander
, Panos M. Pardalos, Valeriy Ryabchenko, Stan Uryasev
, Grigoriy Zrazhevsky:
The wireless network jamming problem. J. Comb. Optim. 14(4): 481-498 (2007) - Yaodong Cui, Qiang Wang:
Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors. J. Comb. Optim. 14(1): 35-44 (2007) - Vincenzo Cutello
, Giuseppe Nicosia
, Mario Pavone
:
An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem. J. Comb. Optim. 14(1): 9-33 (2007) - Paul Dorbec
, Sylvain Gravier, Michael A. Henning:
Paired-domination in generalized claw-free graphs. J. Comb. Optim. 14(1): 1-7 (2007) - Jack Douthett, Richard Krantz:
Maximally even sets and configurations: common threads in mathematics, physics, and music. J. Comb. Optim. 14(4): 385-410 (2007) - Leah Epstein, Deshi Ye:
Semi-online scheduling with "end of sequence" information. J. Comb. Optim. 14(1): 45-61 (2007) - Jerrold R. Griggs, Xiaohua Teresa Jin:
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions. J. Comb. Optim. 14(2-3): 249-257 (2007) - Refael Hassin, Jérôme Monnot, Danny Segev:
Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. 14(4): 437-453 (2007) - Tung-Yang Ho, Chun-Nan Hung, Lih-Hsing Hsu:
On cubic 2-independent Hamiltonian connected graphs. J. Comb. Optim. 14(2-3): 275-294 (2007) - Lih-Hsing Hsu, Shu-Chung Liu, Yeong-Nan Yeh:
Hamiltonicity of hypercubes with a constraint of required and faulty edges. J. Comb. Optim. 14(2-3): 197-204 (2007) - Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu:
Packing 5-cycles into balanced complete m -partite graphs for odd m. J. Comb. Optim. 14(2-3): 323-329 (2007) - Justie Su-tzu Juan
, Gerard J. Chang
:
Group testing in graphs. J. Comb. Optim. 14(2-3): 113-119 (2007) - Adrian Kosowski, Michal Malafiejski
, Pawel Zylinski:
Packing [1, Delta] -factors in graphs of small degree. J. Comb. Optim. 14(1): 63-86 (2007) - Jyhmin Kuo, Hung-Lin Fu:
Wide diameters of de Bruijn graphs. J. Comb. Optim. 14(2-3): 143-152 (2007) - Peter Che Bor Lam, Wensong Lin, Jianzhuan Wu:
L ( j , k )- and circular L ( j , k )-labellings for the products of complete graphs. J. Comb. Optim. 14(2-3): 219-227 (2007) - Wenhua Li, Jinjiang Yuan, Yixun Lin:
A note on special optimal batching structures to minimize total weighted completion time. J. Comb. Optim. 14(4): 475-480 (2007) - Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos:
The densest k-subgraph problem on clique graphs. J. Comb. Optim. 14(4): 465-474 (2007) - Victor W. Liu, Chiuyuan Chen, Richard B. Chen:
Optimal all-to-all personalized exchange in d -nary banyan multistage interconnection networks. J. Comb. Optim. 14(2-3): 131-142 (2007) - Shmuel Onn
, Uriel G. Rothblum:
The use of edge-directions and linear programming to enumerate vertices. J. Comb. Optim. 14(2-3): 153-164 (2007)
skipping 8 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-12 05: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