Остановите войну!
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 99 matches
- 2009
- Kanat S. Abdukhalikov, Eiichi Bannai, Sho Suda:
Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets. J. Comb. Theory, Ser. A 116(2): 434-448 (2009) - Drew Armstrong:
The sorting order on a Coxeter group. J. Comb. Theory, Ser. A 116(8): 1285-1305 (2009) - Ogul Arslan:
The dimensions of LU(3, q) codes. J. Comb. Theory, Ser. A 116(5): 1073-1079 (2009) - Christine Bachoc, Frank Vallentin:
Optimality and uniqueness of the (4, 10, 1/6) spherical code. J. Comb. Theory, Ser. A 116(1): 195-204 (2009) - Itay Ben-Dan, Rom Pinchasi, Ran Ziv:
Points with large alpha-depth. J. Comb. Theory, Ser. A 116(3): 747-755 (2009) - Chris Berg, Brant Jones, Monica Vazirani:
A bijection on core partitions and a parabolic quotient of the affine symmetric group. J. Comb. Theory, Ser. A 116(8): 1344-1360 (2009) - Olivier Bernardi, Nicolas Bonichon:
Intervals in Catalan lattices and realizers of triangulations. J. Comb. Theory, Ser. A 116(1): 55-75 (2009) - Michael Björklund, Alexander Engström:
The g-theorem matrices are totally nonnegative. J. Comb. Theory, Ser. A 116(3): 730-732 (2009) - Jonathan Bloom, Dan Saracino:
On bijections for pattern-avoiding permutations. J. Comb. Theory, Ser. A 116(8): 1271-1284 (2009) - Daniel Bravo, Luc Lapointe:
A recursion formula for k-Schur functions. J. Comb. Theory, Ser. A 116(4): 918-935 (2009) - Andries E. Brouwer, Naoyuki Horiguchi, Masaaki Kitazume, Hiroyuki Nakasora:
A construction of the sporadic Suzuki graph from U3(4). J. Comb. Theory, Ser. A 116(5): 1056-1062 (2009) - David K. Butler:
The maximum size of the intersection of two ovoids. J. Comb. Theory, Ser. A 116(1): 242-245 (2009) - G. Campero-Arena, John Kenneth Truss:
1-transitive cyclic orderings. J. Comb. Theory, Ser. A 116(3): 581-594 (2009) - Teena Carroll, David J. Galvin, Prasad Tetali:
Matchings and independent sets of a fixed size in regular graphs. J. Comb. Theory, Ser. A 116(7): 1219-1227 (2009) - Robin J. Chapman, Timothy Y. Chow, Amit Khetan, David Petrie Moulton, Robert J. Waters:
Simple formulas for lattice paths avoiding certain periodic staircase boundaries. J. Comb. Theory, Ser. A 116(1): 205-214 (2009) - Denis Chebikin, Richard Ehrenborg, Pavlo Pylyavskyy, Margaret A. Readdy:
Cyclotomic factors of the descent set polynomial. J. Comb. Theory, Ser. A 116(2): 247-264 (2009) - William Y. C. Chen, Jiuqiang Liu:
Set systems with I-intersections modulo a prime number. J. Comb. Theory, Ser. A 116(1): 120-131 (2009) - Dohoon Choi, Soon-Yi Kang, Jeremy Lovejoy:
Partitions weighted by the parity of the crank. J. Comb. Theory, Ser. A 116(5): 1034-1046 (2009) - Chak-On Chow:
On derangement polynomials of type B. II. J. Comb. Theory, Ser. A 116(4): 816-830 (2009) - Fan R. K. Chung, Ronald L. Graham:
Packing equal squares into a large square. J. Comb. Theory, Ser. A 116(6): 1167-1175 (2009) - Josef Cibulka:
On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture. J. Comb. Theory, Ser. A 116(2): 290-302 (2009) - Sebastian M. Cioaba, André Kündgen, Jacques Verstraëte:
On decompositions of complete hypergraphs. J. Comb. Theory, Ser. A 116(7): 1232-1234 (2009) - Robert Cori:
Indecomposable permutations, hypermaps and labeled Dyck paths. J. Comb. Theory, Ser. A 116(8): 1326-1343 (2009) - Sarah Crown:
The homology of the cyclic coloring complex of simple graphs. J. Comb. Theory, Ser. A 116(3): 595-612 (2009) - Gábor Czédli:
On averaging Frankl's conjecture for large union-closed-sets. J. Comb. Theory, Ser. A 116(3): 724-729 (2009) - Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy:
B2-crystals: Axioms, structure, models. J. Comb. Theory, Ser. A 116(2): 265-289 (2009) - Hansheng Diao:
A poset structure on quasifibonacci partitions. J. Comb. Theory, Ser. A 116(8): 1361-1373 (2009) - Cunsheng Ding:
Optimal and perfect difference systems of sets. J. Comb. Theory, Ser. A 116(1): 109-119 (2009) - Anton Dochtermann:
Homotopy groups of Hom complexes of graphs. J. Comb. Theory, Ser. A 116(1): 180-194 (2009) - Peter Dukes, Alan C. H. Ling:
Linear spaces with small generated subspaces. J. Comb. Theory, Ser. A 116(2): 485-493 (2009)
skipping 69 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:37 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