Остановите войну!
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 83 matches
- 2005
- R. Julian R. Abel, Gennian Ge:
Some difference matrix constructions and an almost completion for the existence of triplewhist tournaments TWh(upsilon). Eur. J. Comb. 26(7): 1094-1104 (2005) - Ron M. Adin, Amitai Regev, Yuval Roichman:
Preface. Eur. J. Comb. 26(6): 783-784 (2005) - Jean-Christophe Aval, Nantel Bergeron:
Schur partial derivative operators. Eur. J. Comb. 26(6): 785-794 (2005) - Sejeong Bang, Mitsugu Hirasaka:
Construction of association schemes from difference sets. Eur. J. Comb. 26(1): 59-74 (2005) - Eiichi Bannai, Etsuko Bannai:
A note on the spherical embeddings of strongly regular graphs. Eur. J. Comb. 26(8): 1177-1179 (2005) - Malgorzata Bednarska, Oleg Pikhurko:
Biased positional games on matroids. Eur. J. Comb. 26(2): 271-285 (2005) - Koichi Betsumiya, YoungJu Choie:
Codes over F4, Jacobi forms and Hilbert-Siegel modular forms over Q(sqrt(5)). Eur. J. Comb. 26(5): 629-650 (2005) - Dieter Betten, Rainer Löwen:
Proof of the oval conjecture for proper planar partition surfaces. Eur. J. Comb. 26(5): 683-692 (2005) - Thomas Böhme, Alexandr V. Kostochka:
Disjoint Kr-minors in large graphs with given average degree. Eur. J. Comb. 26(3-4): 289-292 (2005) - Béla Bollobás, Vladimir Nikiforov:
Books in graphs. Eur. J. Comb. 26(2): 259-270 (2005) - Béla Bollobás, Oleg Pikhurko:
Integer sets with prescribed pairwise differences being distinct. Eur. J. Comb. 26(5): 607-616 (2005) - Richard F. Booth, Alexandre V. Borovik, Neil White:
Lagrangian pairs and Lagrangian orthogonal matroids. Eur. J. Comb. 26(7): 1023-1032 (2005) - Alexei Borodin, Grigori Olshanski:
Z-measures on partitions and their scaling limits. Eur. J. Comb. 26(6): 795-834 (2005) - Matthew R. Brown, Michel Lavrauw:
Eggs in PG(4n-1, q), q even, containing a pseudo-pointed conic. Eur. J. Comb. 26(1): 117-128 (2005) - William Y. C. Chen, Eva Yu-Ping Deng, Rosena R. X. Du:
Reduction of m-regular noncrossing partitions. Eur. J. Comb. 26(2): 237-243 (2005) - YoungJu Choie, Steven T. Dougherty:
Codes over rings, complex lattices and Hermitian modular forms. Eur. J. Comb. 26(2): 145-165 (2005) - Kris Coolsaet:
A distance regular graph with intersection array (21, 16, 8;1, 4, 14) does not exist. Eur. J. Comb. 26(5): 709-716 (2005) - Henry Crapo, William Schmitt:
The free product of matroids. Eur. J. Comb. 26(7): 1060-1065 (2005) - Henry Crapo, William Schmitt:
A free subalgebra of the algebra of matroids. Eur. J. Comb. 26(7): 1066-1085 (2005) - Ottavio M. D'Antona, Emanuele Munarini:
A combinatorial interpretation of the connection constants for persistent sequences of polynomials. Eur. J. Comb. 26(7): 1105-1118 (2005) - Selçuk Demir:
Isospectral graphs and the representation-theoretical spectrum. Eur. J. Comb. 26(2): 167-172 (2005) - Aiping Deng, Yaokun Wu:
De Bruijn digraphs and affine transformations. Eur. J. Comb. 26(8): 1191-1206 (2005) - Shao-Fei Du, Jin Ho Kwak, Roman Nedela:
Regular embeddings of complete multipartite graphs. Eur. J. Comb. 26(3-4): 505-519 (2005) - Mathieu Dutour:
Infinite serie of extreme Delaunay polytopes. Eur. J. Comb. 26(1): 129-132 (2005) - Zdenek Dvorák, Daniel Král, Riste Skrekovski:
Coloring face hypergraphs on surfaces. Eur. J. Comb. 26(1): 95-110 (2005) - Mark N. Ellingham, Chris Stephens, Xiaoya Zha:
Counterexamples to the nonorientable genus conjecture for complete tripartite graphs. Eur. J. Comb. 26(3-4): 387-399 (2005) - David Eppstein:
The lattice dimension of a graph. Eur. J. Comb. 26(5): 585-592 (2005) - Yan-Quan Feng, Jin Ho Kwak, Kaishun Wang:
Classifying cubic symmetric graphs of order 8p or 8p2. Eur. J. Comb. 26(7): 1033-1052 (2005) - Alberto Del Fra, Satoshi Yoshiara:
Dimensional dual hyperovals associated with Steiner systems. Eur. J. Comb. 26(2): 173-194 (2005) - Josep L. Garcia-Domingo, Javier Soria:
A decreasing rearrangement for functions on homogeneous trees. Eur. J. Comb. 26(2): 201-225 (2005)
skipping 53 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-03-29 12:37 CET 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