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 125 matches
- 2011
- Takuro Abe, Hiroaki Terao:
The freeness of Shi-Catalan arrangements. Eur. J. Comb. 32(8): 1191-1198 (2011) - Alexander Araluze, Klavdija Kutnar, Luis Martínez, Dragan Marusic:
Edge connectivity in difference graphs and some new constructions of partial sum families. Eur. J. Comb. 32(3): 352-360 (2011) - Gabriela Araujo-Pardo, Camino Balbuena, Luis Montejano, Juan Carlos Valenzuela:
Partial linear spaces and identifying codes. Eur. J. Comb. 32(3): 344-351 (2011) - João Araújo, Michael K. Kinyon, Janusz Konieczny:
Minimal paths in the commuting graphs of semigroups. Eur. J. Comb. 32(2): 178-197 (2011) - Gábor Bacsó, Zsolt Tuza:
Optimal guard sets and the Helly property. Eur. J. Comb. 32(1): 28-32 (2011) - Paul N. Balister, Ervin Györi, Richard H. Schelp:
Coloring vertices and edges of a graph by nonempty subsets of a set. Eur. J. Comb. 32(4): 533-537 (2011) - János Barát, Péter Hajnal, Eszter K. Horváth:
Elementary proof techniques for the maximum number of islands. Eur. J. Comb. 32(2): 276-281 (2011) - Itai Benjamini, Nicolas Curien:
On limits of graphs sphere packed in Euclidean space and applications. Eur. J. Comb. 32(7): 975-984 (2011) - Riccardo Biagioli, Jiang Zeng:
Enumerating wreath products via Garsia-Gessel bijections. Eur. J. Comb. 32(4): 538-553 (2011) - Thomas Bier, Imed Zaguia:
Commutativity conditions for groups arising from acyclic directed graphs and posets. Eur. J. Comb. 32(2): 301-307 (2011) - Béla Bollobás, Vladimir Nikiforov:
Large joints in graphs. Eur. J. Comb. 32(1): 33-44 (2011) - Joseph E. Bonin, William R. Schmitt:
Splicing matroids. Eur. J. Comb. 32(6): 722-744 (2011) - Peter Borg:
On Chvátal's conjecture and a conjecture on families of signed sets. Eur. J. Comb. 32(1): 140-145 (2011) - Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Katalin Vesztergombi:
Limits of randomly grown graph sequences. Eur. J. Comb. 32(7): 985-999 (2011) - Bostjan Bresar, Tanja Gologranc:
On a local 3-Steiner convexity. Eur. J. Comb. 32(8): 1222-1235 (2011) - Robert Brijder, Hendrik Jan Hoogeboom:
The group structure of pivot and loop complementation on graphs and set systems. Eur. J. Comb. 32(8): 1353-1367 (2011) - Jonathan Browder, Steven Klee:
Lower bounds for Buchsbaum* complexes. Eur. J. Comb. 32(1): 146-153 (2011) - Bart De Bruyn:
The hyperplanes of finite symplectic dual polar spaces which arise from projective embeddings. Eur. J. Comb. 32(8): 1384-1393 (2011) - Jean-Paul Bultel:
A one-parameter deformation of the Farahat-Higman algebra. Eur. J. Comb. 32(2): 308-323 (2011) - Rui Pedro Carpentier:
On signed diagonal flip sequences. Eur. J. Comb. 32(3): 472-477 (2011) - Fabrizio Caselli, Roberta Fulci:
Refined Gelfand models for wreath products. Eur. J. Comb. 32(2): 198-216 (2011) - Julien Cassaigne, Sébastien Ferenczi, Luca Q. Zamboni:
Combinatorial trees arising in the study of interval exchange transformations. Eur. J. Comb. 32(8): 1428-1444 (2011) - Tsz Ho Chan:
On sets of integers, none of which divides the product of k others. Eur. J. Comb. 32(3): 443-447 (2011) - Sourav Chatterjee, S. R. S. Varadhan:
The large deviation principle for the Erdős-Rényi random graph. Eur. J. Comb. 32(7): 1000-1017 (2011) - Laura Chávez-Lomelí, Criel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez:
Some inequalities for the Tutte polynomial. Eur. J. Comb. 32(3): 422-433 (2011) - Feng-Juan Chen, Yong-Gao Chen:
On minimal asymptotic bases. Eur. J. Comb. 32(8): 1329-1335 (2011) - William Y. C. Chen, Neil J. Y. Fan, Teresa X. S. Li:
Han's bijection via permutation codes. Eur. J. Comb. 32(2): 217-225 (2011) - Gi-Sang Cheon, Hana Kim, Louis W. Shapiro:
The hitting time subgroup, Lukasiewicz paths and Faber polynomials. Eur. J. Comb. 32(1): 82-91 (2011) - Carolyn Chun, James G. Oxley:
Unavoidable parallel minors of regular matroids. Eur. J. Comb. 32(6): 762-774 (2011) - Zubeyir Cinkir:
The tau constant and the discrete Laplacian matrix of a metrized graph. Eur. J. Comb. 32(4): 639-655 (2011)
skipping 95 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-25 10:16 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