Остановите войну!
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 40 matches
- 1992
- Radek Adamec, Martin Klazar, Pavel Valtr:
Generalized Davenport-Schinzel sequences with linear upper bound. Discret. Math. 108(1-3): 219-229 (1992) - Jirí Adámek, Jirí Rosický:
On orthogonal subcategories of locally presentable categories. Discret. Math. 108(1-3): 133-137 (1992) - Lars Døvling Andersen:
The strong chromatic index of a cubic graph is at most 10. Discret. Math. 108(1-3): 231-252 (1992) - Bohuslav Balcar, Petr Simon:
Reaping number and pi-character of Boolean algebras. Discret. Math. 108(1-3): 5-12 (1992) - Anders Björner, Johan Karlander:
Invertibility of the base Radon transform of a matroid. Discret. Math. 108(1-3): 139-147 (1992) - Peter Bugata:
Trahtenbrot-Zykov problem and NP-completeness. Discret. Math. 108(1-3): 253-259 (1992) - Richard A. Duke, Paul Erdös, Vojtech Rödl:
Cycle-connected graphs. Discret. Math. 108(1-3): 261-278 (1992) - Paul Erdös, Tibor Gallai, Zsolt Tuza:
Covering the cliques of a graph with vertices. Discret. Math. 108(1-3): 279-289 (1992) - A. Fedeli, Jan Reiterman, Anna Tozzi:
Onwalpha-compactness. Discret. Math. 108(1-3): 13-23 (1992) - Antonio Fernández, Vladimír Müller:
Embedding of a separable locally pseudoconvex algebra into a locally pseudoconvex algebra with two generators. Discret. Math. 108(1-3): 25-30 (1992) - Miroslav Fiedler:
An extremal problem for the spectral radius of a graph. Discret. Math. 108(1-3): 149-158 (1992) - Peter Frankl:
On cross-intersecting families. Discret. Math. 108(1-3): 291-295 (1992) - János Gerlits, András Hajnal, Zoltán Szentmiklóssy:
On the cardinality of certain Hausdorff spaces. Discret. Math. 108(1-3): 31-35 (1992) - Joseph Gil, William L. Steiger, Avi Wigderson:
Geometric medians. Discret. Math. 108(1-3): 37-51 (1992) - Pavol Hell, Donald J. Miller:
Achromatic numbers and graph operations. Discret. Math. 108(1-3): 297-305 (1992) - Wilfried Imrich, Jaroslav Nesetril:
Simple tournaments and sharply transitive groups. Discret. Math. 108(1-3): 159-165 (1992) - Svante Janson, Jan Kratochvíl:
Thresholds for classes of intersection graphs. Discret. Math. 108(1-3): 307-326 (1992) - Thomas Jech:
The logarithmic distribution of leading digits and finitely additive measures. Discret. Math. 108(1-3): 53-57 (1992) - Jozef Jirásek:
Some remarks on Ádám's conjecture for simple directed graphs. Discret. Math. 108(1-3): 327-332 (1992) - Igor Kríz:
All trapezoids are Ramsey. Discret. Math. 108(1-3): 59-62 (1992) - Martin Loebl:
Unprovable combinatorial statements. Discret. Math. 108(1-3): 333-342 (1992) - Hiroshi Maehara:
Extending a flexible unit-bar framework to a rigid one. Discret. Math. 108(1-3): 167-174 (1992) - Jirí Matousek, Robin Thomas:
On the complexity of finding iso- and other morphisms for partial k-trees. Discret. Math. 108(1-3): 343-364 (1992) - Matthias Middendorf, Frank Pfeiffer:
The max clique problem in classes of string-graphs. Discret. Math. 108(1-3): 365-372 (1992) - Jaroslav Nesetril:
Z. Frolík and his winter schools. Discret. Math. 108(1-3): 1-2 (1992) - Václav Nýdl:
Finite undirected graphs which are not reconstructible from their large cardinality subgraphs. Discret. Math. 108(1-3): 373-377 (1992) - Jan Paseka:
Products in the category of locales: which properties are preserved? Discret. Math. 108(1-3): 63-73 (1992) - Jan Pelant, Vojtech Rödl:
On coverings of infinite- dimentional metric spaces. Discret. Math. 108(1-3): 75-81 (1992) - Svatopluk Poljak, Daniel Turzík:
Max-cut in circulant graphs. Discret. Math. 108(1-3): 379-392 (1992) - Hans Jürgen Prömel, Bernd Voigt:
From wqo to bqo, via Ellentuck's theorem. Discret. Math. 108(1-3): 83-106 (1992)
skipping 10 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-25 18:50 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