Остановите войну!
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 34 matches
- 1990
- J. M. van den Akker, Jacobus H. Koolen, Rob J. M. Vaessens:
Perfect modes with distinct protective radii. Discret. Math. 81(1): 103-109 (1990) - Yasukazu Aoki:
The star-arboricity of the complete regular multipartite graphs. Discret. Math. 81(2): 115-122 (1990) - Tom Blyth, Jules Varlet:
Principal congruences on some lattice- ordered algebras. Discret. Math. 81(3): 323-329 (1990) - Katarína Cechlárová, Peter Szabó:
On the monge property of matrices. Discret. Math. 81(2): 123-128 (1990) - Fan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter:
The maximum number of edges in 2K2-free graphs of bounded degree. Discret. Math. 81(2): 129-135 (1990) - Moon-Jung Chung, Bala Ravikumar:
Bounds on the size of test sets for sorting and related networks. Discret. Math. 81(1): 1-9 (1990) - C. R. J. Clapham:
Graphs self-complementary in Kn - e. Discret. Math. 81(3): 229-235 (1990) - Lane H. Clark, Roger C. Entringer:
The number of cutvertices in graphs with given minimum degree. Discret. Math. 81(2): 137-145 (1990) - Robert J. Clarke:
Covering a set by subsets. Discret. Math. 81(2): 147-152 (1990) - Herbert Edelsbrunner, Arch Douglas Robison, Xiaojun Shen:
Covering convex sets with non-overlapping polygons. Discret. Math. 81(2): 153-164 (1990) - Konrad Engel, Péter L. Erdös:
Polytopes determined by complementfree Sperner families. Discret. Math. 81(2): 165-169 (1990) - Alan M. Frieze:
On the independence number of random graphs. Discret. Math. 81(2): 171-175 (1990) - Sumanta Guha, Sriram Padmanabhan:
A new derivation of the generating function for the major index. Discret. Math. 81(2): 211-215 (1990) - David R. Guichard:
Two theorems on the addition of residue classes. Discret. Math. 81(1): 11-18 (1990) - Nora Hartsfield, Gerhard Ringel:
Quadrangular embeddings of the complete even k-partite graph. Discret. Math. 81(1): 19-23 (1990) - Alain Hertz:
Bipolarizable graphs. Discret. Math. 81(1): 25-32 (1990) - Wilfried Imrich, Gert Sabidussi:
Focality and graph isomorphism. Discret. Math. 81(3): 237-245 (1990) - R. Kemp:
On the number of deepest nodes in ordered trees. Discret. Math. 81(3): 247-258 (1990) - Louis Worthy Kolitsch:
A simple proof of some congruences for colored generalized frobenius partitions. Discret. Math. 81(3): 259-261 (1990) - Earl S. Kramer:
An S3(3, 5, 21) using graphs. Discret. Math. 81(2): 223-224 (1990) - Igor Kríz, Robin Thomas:
Clique-sums, tree-decompositions and compactness. Discret. Math. 81(2): 177-185 (1990) - Gilles Lachaud:
The parameters of projective Reed-Müller codes. Discret. Math. 81(2): 217-221 (1990) - Tatsuya Maruta:
On Singleton arrays and Cauchy matrices. Discret. Math. 81(1): 33-36 (1990) - Cyriel Van Nuffelen, M. van Wouwe:
A bound for the Dilworth number. Discret. Math. 81(2): 203-210 (1990) - Udo Pachner:
Shellings of simplicial balls and P.L. manifolds with boundary. Discret. Math. 81(1): 37-47 (1990) - Martin Quest, Gerd Wegner:
Characterization of the graphs with boxicity <=2. Discret. Math. 81(2): 187-192 (1990) - Rolf S. Rees:
The existence of restricted resolvable designs I: (1, 2)-factorizations of K2n. Discret. Math. 81(1): 49-80 (1990) - Rolf S. Rees:
The existence of restricted resolvable designs II: (1, 2)-factorizations of K2n+1. Discret. Math. 81(3): 263-301 (1990) - Jean-Pierre Roudneff:
Partitions of points into intersecting tetrahedra. Discret. Math. 81(1): 81-86 (1990) - Eric Schmutz:
Partitions whose parts are pairwise relatively prime. Discret. Math. 81(1): 87-89 (1990)
skipping 4 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-04-27 22:46 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