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 180 matches
- 2010
- Anna Adamaszek, Michal Adamaszek:
Combinatorics of the change-making problem. Eur. J. Comb. 31(1): 47-63 (2010) - Kira V. Adaricheva, Marcel Wild:
Realization of abstract convex geometries by point configurations. Eur. J. Comb. 31(1): 379-400 (2010) - Saieed Akbari, Saeid Alikhani, Yee-Hock Peng:
Characterization of graphs using domination polynomials. Eur. J. Comb. 31(7): 1714-1724 (2010) - Victor Alexandrov, Hiroshi Maehara, Anatoliy D. Milka, Idzhad Kh. Sabitov, Jean-Marc Schlenker, Brigitte Servatius, Herman Servatius:
Problem section. Eur. J. Comb. 31(4): 1196-1204 (2010) - Victor Alexandrov, Idzhad Kh. Sabitov, Hellmuth Stachel:
Preface. Eur. J. Comb. 31(4): 1035-1036 (2010) - Javier Alonso, Horst Martini, Margarita Spirova:
Visibility in crowds of translates of a centrally symmetric convex body. Eur. J. Comb. 31(3): 710-719 (2010) - Thomas Anderson, T. Bruce McLean, Homeira Pajoohesh, Chasen Smith:
The combinatorics of all regular flexagons. Eur. J. Comb. 31(1): 72-80 (2010) - Mustapha Aouchiche, Pierre Hansen:
On a conjecture about the Szeged index. Eur. J. Comb. 31(7): 1662-1666 (2010) - Gabriela Araujo-Pardo, María del Río Francos, Mariana López-Dudet, Deborah Oliveros, Egon Schulte:
The graphicahedron. Eur. J. Comb. 31(7): 1868-1879 (2010) - Maria Artale, David A. Buchsbaum:
Resolutions of three-rowed skew- and almost skew-shapes in characteristic zero. Eur. J. Comb. 31(1): 325-335 (2010) - David Auger:
Minimal identifying codes in trees and planar graphs with large girth. Eur. J. Comb. 31(5): 1372-1384 (2010) - Ilya Averbouch, Benny Godlin, Johann A. Makowsky:
An extension of the bivariate chromatic polynomial. Eur. J. Comb. 31(1): 1-17 (2010) - Arvind Ayyer:
A natural bijection between permutations and a family of descending plane partitions. Eur. J. Comb. 31(7): 1785-1791 (2010) - Richard N. Ball, Jaroslav Nesetril, Ales Pultr:
Dualities in full homomorphisms. Eur. J. Comb. 31(1): 106-119 (2010) - Eiichi Bannai, Etsuko Bannai, Masatake Hirao, Masanori Sawa:
Cubature formulas in numerical analysis and Euclidean tight designs. Eur. J. Comb. 31(2): 423-441 (2010) - Marilena Barnabei, Flavio Bonetti, Matteo Silimbani:
The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2. Eur. J. Comb. 31(5): 1360-1371 (2010) - Bruce Bates, Martin W. Bunder, Keith P. Tognetti:
Locating terms in the Stern-Brocot tree. Eur. J. Comb. 31(3): 1020-1033 (2010) - Bruce Bates, Martin W. Bunder, Keith P. Tognetti:
Linking the Calkin-Wilf and Stern-Brocot trees. Eur. J. Comb. 31(7): 1637-1661 (2010) - J. M. Becu, M. Dah, Yannis Manoussakis, Gervais Mendy:
Links in edge-colored graphs. Eur. J. Comb. 31(2): 442-460 (2010) - Andrew Berget:
Products of linear forms and Tutte polynomials. Eur. J. Comb. 31(7): 1924-1935 (2010) - Babiga Birregah, Prosper K. Doh, Kondo H. Adjallah:
A systematic approach to matrix forms of the Pascal triangle: The twelve triangular matrix forms and relations. Eur. J. Comb. 31(5): 1205-1216 (2010) - Anders Björner, Kathrin Vorwerk:
Connectivity of chamber graphs of buildings and related complexes. Eur. J. Comb. 31(8): 2149-2160 (2010) - Béla Bollobás, Vladimir Nikiforov:
The number of graphs with large forbidden subgraphs. Eur. J. Comb. 31(8): 1964-1968 (2010) - Simona Bonvicini, Giuseppe Mazzuoccolo:
Abelian 1-factorizations in infinite graphs. Eur. J. Comb. 31(7): 1847-1852 (2010) - Julia Böttcher, Klaas Paul Pruessmann, Anusch Taraz, Andreas Würfl:
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. Eur. J. Comb. 31(5): 1217-1227 (2010) - Youssef Boudabbous, Maurice Pouzet:
The morphology of infinite tournaments; application to the growth of their profile. Eur. J. Comb. 31(2): 461-481 (2010) - Romain Boulet, Etienne Fieux, Bertrand Jouve:
Simplicial simple-homotopy of flag complexes in terms of graphs. Eur. J. Comb. 31(1): 161-176 (2010) - Luis Boza, Martín Cera, Pedro García-Vázquez, M. P. Revuelta:
On the Ramsey numbers for stars versus complete graphs. Eur. J. Comb. 31(7): 1680-1688 (2010) - Stephan Brandt, Janina Müttel, Dieter Rautenbach, Friedrich Regen:
Minimum degree and density of binary sequences. Eur. J. Comb. 31(7): 1936-1945 (2010) - Fiona Brunk, Sophie Huczynska:
Some Erdos-Ko-Rado theorems for injections. Eur. J. Comb. 31(3): 839-860 (2010)
skipping 150 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-11-28 01:10 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