Остановите войну!
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 295 matches
- 2011
- Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Morten Hegner Nielsen:
Cycles in k-traceable oriented graphs. Discret. Math. 311(18-19): 2085-2094 (2011) - Susan A. van Aardt, Marietjie Frick, Peter Katrenic, Morten Hegner Nielsen:
The order of hypotraceable oriented graphs. Discret. Math. 311(14): 1273-1280 (2011) - Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk:
On minimal triangle-free graphs with prescribed k-defective chromatic number. Discret. Math. 311(13): 1119-1127 (2011) - Michal Adamaszek, Jonathan Ariel Barmak:
On a lower bound for the connectivity of the independence complex of a graph. Discret. Math. 311(21): 2566-2569 (2011) - Ron Aharoni, Eli Berger:
Strongly maximal antichains in posets. Discret. Math. 311(15): 1518-1522 (2011) - Saieed Akbari, Ebrahim Ghorbani, Akram Mahmoodi:
On edge star sets in trees. Discret. Math. 311(13): 1172-1178 (2011) - Arseniy V. Akopyan, Alexey A. Glazyrin, Oleg R. Musin, Alexey S. Tarasov:
The extremal spheres theorem. Discret. Math. 311(2-3): 171-177 (2011) - Michael H. Albert, Steve Linton, Nikola Ruskuc, Vincent Vatter, Steve Waton:
On convex permutations. Discret. Math. 311(8-9): 715-722 (2011) - T. L. Alderson, Keith E. Mellinger:
Spreads, arcs, and multiple wavelength codes. Discret. Math. 311(13): 1187-1196 (2011) - Kiyoshi Ando, Takashi Iwase:
The number of vertices of degree 5 in a contraction-critically 5-connected graph. Discret. Math. 311(17): 1925-1939 (2011) - Kiyoshi Ando, Chengfu Qin:
Some structural properties of minimally contraction-critically 5-connected graphs. Discret. Math. 311(13): 1084-1097 (2011) - George E. Andrews, Wolfgang Gawronski, Lance L. Littlejohn:
The Legendre-Stirling numbers. Discret. Math. 311(14): 1255-1272 (2011) - Richard P. Anstee, C. G. W. Meehan:
Forbidden configurations and repeated induction. Discret. Math. 311(20): 2187-2197 (2011) - N. R. Aravind, T. Karthick, C. R. Subramanian:
Bounding χ in terms of ω and Δ for some classes of graphs. Discret. Math. 311(12): 911-920 (2011) - Margaret Archibald, Arnold Knopfmacher:
The largest missing value in a composition of an integer. Discret. Math. 311(8-9): 723-731 (2011) - Addie Armstrong, Dan McQuillan:
Vertex-magic total labelings of even complete graphs. Discret. Math. 311(8-9): 676-683 (2011) - Danilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
Partitioning a graph into convex sets. Discret. Math. 311(17): 1968-1977 (2011) - S. Arumugam, Teresa W. Haynes, Michael A. Henning, Yared Nigussie:
Maximal independent sets in minimum colorings. Discret. Math. 311(13): 1158-1163 (2011) - John Asplund, Melissa S. Keranen:
Mutually orthogonal equitable Latin rectangles. Discret. Math. 311(12): 1015-1033 (2011) - Firat Ates, Eylem Güzel Karpuz, Canan Kocapinar, A. Sinan Çevik:
Gröbner-Shirshov bases of some monoids. Discret. Math. 311(12): 1064-1071 (2011) - Maria Axenovich, JiHyeok Choi:
A note on the monotonicity of mixed Ramsey numbers. Discret. Math. 311(17): 2020-2023 (2011) - Maria Axenovich, Joan P. Hutchinson, Michelle A. Lastrina:
List precoloring extension in planar graphs. Discret. Math. 311(12): 1046-1056 (2011) - Bhaskar Bagchi, Basudeb Datta:
On Walkup's class K(d) and a minimal triangulation of (S3 X S1)#3. Discret. Math. 311(12): 989-995 (2011) - Deepak Bal, Andrzej Dudek, Zelealem B. Yilma:
On the maximum number of edges in a hypergraph with a unique perfect matching. Discret. Math. 311(21): 2577-2580 (2011) - Jan Baldeaux, Josef Dick, Friedrich Pillichshammer:
Duality theory and propagation rules for higher order nets. Discret. Math. 311(5): 362-386 (2011) - József Balogh, Alexandr V. Kostochka:
Large minors in graphs with given independence number. Discret. Math. 311(20): 2203-2215 (2011) - Murad Banaji, Carrie G. Rutherford:
P-matrices and signed digraphs. Discret. Math. 311(4): 295-301 (2011) - Jean-Luc Baril:
Cyclic and lift closures for k...21-avoiding permutations. Discret. Math. 311(1): 51-57 (2011) - Nayandeep Deka Baruah, Bipul Kumar Sarmah:
Congruences for generalized Frobenius partitions with 4 colors. Discret. Math. 311(17): 1892-1902 (2011) - Douglas Bauer, Michael Yatauro, Nathan Kahl, Edward F. Schmeichel:
Best monotone degree conditions for binding number. Discret. Math. 311(18-19): 2037-2043 (2011)
skipping 265 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-05-06 04:21 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