![](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 26 matches
- 2001
- Matthew Johnson, David Bedford:
Weak critical sets in cyclic Latin squares. Australas. J Comb. 23: 301- (2001) - Peter Adams, Darryn E. Bryant:
The μ-way intersection problem for cubes. Australas. J Comb. 23: 87-100 (2001) - Saieed Akbari, Hamid Reza Maimani, Ch. Maysoori:
Minimal defining sets for full 2-(v, 3, v-2) designs. Australas. J Comb. 23: 5-8 (2001) - Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified edges in a bipartite graph. Australas. J Comb. 23: 37-48 (2001) - Ernest J. Cockayne, Christina M. Mynhardt:
Properties of Queens graphs and the irredundance number of Q7. Australas. J Comb. 23: 285-300 (2001) - Charles J. Colbourn, Alan C. H. Ling:
(M, S)-optimal designs with block size three. Australas. J Comb. 23: 171-180 (2001) - Diana Combe, Donald E. Taylor:
Two results concerning distance-regular directed graphs. Australas. J Comb. 23: 27-36 (2001) - Selma Djelloul, Mekkia Kouider:
On weighted mean distance. Australas. J Comb. 23: 181-196 (2001) - Beiliang Du:
The existence of bimatching designs. Australas. J Comb. 23: 71-74 (2001) - Roderick J. Fletcher, Marc Gysin, Jennifer Seberry:
Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices. Australas. J Comb. 23: 75-86 (2001) - Roderick J. Fletcher, Jennifer Seberry:
New D-optimal designs of order 110. Australas. J Comb. 23: 49-52 (2001) - Frantisek Franek, Dalibor Froncek, Alexander Rosa:
Imbalance in tournament designs. Australas. J Comb. 23: 237-252 (2001) - Mike J. Grannell, Terry S. Griggs, Ray Hill:
The triangle chromatic index of Steiner triple systems. Australas. J Comb. 23: 217-230 (2001) - Gregory Z. Gutin, Anders Yeo:
Remarks on hamiltonian digraphs. Australas. J Comb. 23: 115-118 (2001) - Marc Gysin, Jennifer Seberry:
On ternary complementary pairs. Australas. J Comb. 23: 153-170 (2001) - Marc Gysin, Jennifer Seberry:
On infinite families of sequences with one and two valued autocorrelation and two valued crosscorrelation function. Australas. J Comb. 23: 197-210 (2001) - Michael A. Henning, Ortrud R. Oellermann:
The average connectivity of regular multipartite tournaments. Australas. J Comb. 23: 101-114 (2001) - Jing Huang, Kathryn L. B. Wood:
Nearly-acyclically pushable tournaments. Australas. J Comb. 23: 145-152 (2001) - Matthew D. Kearse, Peter B. Gibbons:
Computational methods and new results for chessboard problems. Australas. J Comb. 23: 253-284 (2001) - Ebadollah S. Mahmoodian, Nasrin Soltankhah:
A linear algebraic approach to directed designs. Australas. J Comb. 23: 119-134 (2001) - Nicholas C. K. Phillips, W. D. Wallis, Rolf S. Rees:
Packings and coverings of v=3m+1 points with near-triangle factors. Australas. J Comb. 23: 53-70 (2001) - R. Bruce Richter, Gelasio Salazar:
The crossing number of C6 × Cn. Australas. J Comb. 23: 135-144 (2001) - Yanling Shao, Yubin Gao:
The kth upper generalized exponent set for primitive matrices. Australas. J Comb. 23: 19-26 (2001) - Ian M. Wanless:
Path achievement games. Australas. J Comb. 23: 9-18 (2001) - Lihua You, Gexin Yu, Bolian Liu:
On maximal (k, b)-linear-free sets of integers and its spectrum. Australas. J Comb. 23: 211-216 (2001) - Manouchehr Zaker:
Greedy defining sets of graphs. Australas. J Comb. 23: 231-236 (2001)
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-06 19:32 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