Остановите войну!
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 26 matches
- 1999
- Dragan M. Acketa, Vojislav Mudrinski:
A family of 4-designs on 38 points. Ars Comb. 53 (1999) - Jorge L. Ramírez Alfonsín:
Gracefulness of Replicated Paths and Cycles. Ars Comb. 53 (1999) - Brian Alspach, Joy Morris, V. Vilfred:
Self-complementary circulant graphs. Ars Comb. 53 (1999) - Toru Araki, Yukio Shibata:
Isomorphic factorization of complete bipartite graph into forest. Ars Comb. 53 (1999) - John A. Bate, G. H. John van Rees:
The Size of the Smallest Strong Critical Set in a Latin Square. Ars Comb. 53 (1999) - Beiliang Du, W. D. Wallis:
The Existence of Self-Conjugate Self-Orthogonal Idempotent Diagonal Latin Squares. Ars Comb. 53 (1999) - Hung-Lin Fu, Christopher A. Rodger:
Almost Resolvable Directed m-cycle systems: m = 3 (mod 6). Ars Comb. 53 (1999) - Kong Gaohua, Zhang Xuebin:
On the existence of (v, n, 4, l)-IPMD for even l. Ars Comb. 53 (1999) - Dawit Haile:
Bounds on the Size of Critical Edge-Chromatic Graphs. Ars Comb. 53 (1999) - David G. C. Horrocks:
On the Number of Dependent Sets in a Connected Graph. Ars Comb. 53 (1999) - Clark Kimberling, Harris S. Shultz:
Card Sorting by Dispersions and Fractal Sequences. Ars Comb. 53 (1999) - Arnold Knopfmacher, Michael E. Mays:
Compositions With m Distinct Parts. Ars Comb. 53 (1999) - William L. Kocay, Ryan Szypowski:
The Application of Determining Sets to Projective Configurations. Ars Comb. 53 (1999) - Jeh Gwon Lee:
The Edge Covering Number of Ordered Sets. Ars Comb. 53 (1999) - Chiang Lin, Jenq-Jong Lin, Tay-Woei Shyu:
Isomorphic Star Decompositions of Multicrowns and the Power of Cycles. Ars Comb. 53 (1999) - Eric Mendelsohn, Nabil Shalaby:
On Skolem Labelling of Windmills. Ars Comb. 53 (1999) - Mats Näslund:
On Steiner Triple Systems and Perfect Codes. Ars Comb. 53 (1999) - Kevin T. Phelps, Carol Yin:
Generalized Steiner Systems With Block Size Three and Group Size Four. Ars Comb. 53 (1999) - Thomas Dale Porter:
Minimal Partitions of a Graph. Ars Comb. 53 (1999) - Michael Edwin Raines, Christopher A. Rodger:
Embedding Partial Extended Triple Systems when l >= 2. Ars Comb. 53 (1999) - Rolf S. Rees, Douglas R. Stinson, Ruizhong Wei, G. H. John van Rees:
An application of covering designs: determining the maximum consistent set of shares in a threshold scheme. Ars Comb. 53 (1999) - Michael S. Roddy:
A note on orders with level diagrams. Ars Comb. 53 (1999) - Chester J. Salwach:
Codes of C(n, n, 1) Designs. Ars Comb. 53 (1999) - Deborah J. Street, Anne Penfold Street:
But where are designs used? Ars Comb. 53 (1999) - Bridget S. Webb:
Infinite designs with more point orbits than block orbits. Ars Comb. 53 (1999) - Heping Zhang, Fuji Zhang:
Block Graphs of Z-transformation Graphs of Perfect Matchings of Plane Elementary Bipartite Graphs. Ars Comb. 53 (1999)
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-27 04:10 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