Остановите войну!
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 42 matches
- 2021
- Karim A. Adiprasito, Geva Yashfe:
The partition complex: an invitation to combinatorial commutative algebra. BCC 2021: 1-42 - Daniele Bartoli:
Hasse-Weil type theorems and relevant classes of polynomial functions. BCC 2021: 43-102 - Marthe Bonamy:
Decomposing the edges of a graph into simpler structures. BCC 2021: 103-132 - Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Preface. BCC 2021: vii-viii - Stefan Glock, Daniela Kühn, Deryk Osthus:
Extremal aspects of graph and hypergraph decomposition problems. BCC 2021: 235-266 - Catherine S. Greenhill:
Generating graphs randomly. BCC 2021: 133-186 - Martin Grohe, Daniel Neuen:
Recent advances on the graph isomorphism problem. BCC 2021: 187-234 - Oleg Pikhurko:
Borel combinatorics of locally finite graphs. BCC 2021: 267-320 - Cheryl E. Praeger:
Codes and designs in Johnson graphs with high symmetry. BCC 2021: 321-342 - Colva M. Roney-Dougal:
Maximal subgroups of finite simple groups: classifications and applications. BCC 2021: 343-370 - Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial Conference, Durham, UK, July 5-9, 2021. Cambridge University Press 2021, ISBN 978-1-009-01888-3 [contents] - 2019
- Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Clique-width for hereditary graph classes. BCC 2019: 1-56 - Andrzej Grzesik, Daniel Král:
Analytic representations of large graphs. BCC 2019: 57-88 - Penny Haxell:
Topological connectedness and independent sets in graphs. BCC 2019: 89-114 - Michael Krivelevich:
Expanders - how to find them, and what to find in them. BCC 2019: 115-142 - Kristin E. Lauter, Christophe Petit:
Supersingular isogeny graphs in cryptography. BCC 2019: 143-166 - Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown:
Preface. BCC 2019: vii-viii - Hendrik Van Maldeghem, Magali Victoor:
Some combinatorial and geometric constructions of spherical buildings. BCC 2019: 237-265 - Iain Moffatt:
Delta-matroids for graph theorists. BCC 2019: 167-220 - Gábor Tardos:
Extremal theory of vertex or edge ordered graphs. BCC 2019: 221-236 - Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown:
Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29 - August 2, 2019. Cambridge University Press 2019, ISBN 978-1-108-74072-2 [contents] - 2017
- Rosemary A. Bailey:
Relations among partitions. BCC 2017: 1-96 - Julia Böttcher:
Large-scale structures in random graphs. BCC 2017: 87-140 - William Y. C. Chen:
The spt-function of Andrews. BCC 2017: 141-203 - Anders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks:
Preface. BCC 2017: vii-viii - Antonio Cossidente:
Combinatorial structures in finite classical polar spaces. BCC 2017: 204-237 - Daniel Horsley:
Switching techniques for edge decompositions of graphs. BCC 2017: 238-271 - Vít Jelínek:
Ramsey-type and amalgamation-type properties of permutations. BCC 2017: 272-311 - Robert Morris:
Monotone cellular automata. BCC 2017: 312-371 - Benny Sudakov:
Robustness of graph properties. BCC 2017: 372-408
skipping 12 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-07-15 10:20 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