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 37 matches
- 2024
- Toby Aldape, Jingyi Liu, Gregory Pylypovych, Adam Sheffer, Minh-Quan Vo:
Distinct distances in R3 between quadratic and orthogonal curves. Eur. J. Comb. 120: 103993 (2024) - Brian Alspach, Primoz Sparl:
Cubic factor-invariant graphs of cycle quotient type - The alternating case. Eur. J. Comb. 120: 103964 (2024) - Maria Axenovich, António Girão, Lawrence Hollom, Julien Portier, Emil Powierski, Michael Savery, Youri Tamitegama, Leo Versteegen:
A note on interval colourings of graphs. Eur. J. Comb. 120: 103956 (2024) - Deepak Bal, Louis DeBiasio, Allan Lo:
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs. Eur. J. Comb. 120: 103969 (2024) - Jørgen Bang-Jensen, Y. Wang:
Arc-disjoint out- and in-branchings in compositions of digraphs. Eur. J. Comb. 120: 103981 (2024) - Csongor Beke, Gergely Kál Csáji, Péter Csikvári, Sára Pituk:
Permutation Tutte polynomial. Eur. J. Comb. 120: 104003 (2024) - Aaron Berger, Nitya Mani:
On sum-intersecting families of positive integers. Eur. J. Comb. 120: 103963 (2024) - Amanda Burcroff:
Near classification of compact hyperbolic Coxeter d-polytopes with d+4 facets and related dimension bounds. Eur. J. Comb. 120: 103957 (2024) - Mengyu Cao, Mei Lu, Benjian Lv, Kaishun Wang:
Nearly extremal non-trivial cross t-intersecting families and r-wise t-intersecting families. Eur. J. Comb. 120: 103958 (2024) - Debsoumya Chakraborti, Da Qi Chen:
Exact results on generalized Erdős-Gallai problems. Eur. J. Comb. 120: 103955 (2024) - Seung-Il Choi, Young-Hun Kim, Young-Tak Oh:
Poset modules of the 0-Hecke algebras and related quasisymmetric power sum expansions. Eur. J. Comb. 120: 103965 (2024) - Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility problems on graphs of diameter two. Eur. J. Comb. 120: 103995 (2024) - Manuel Concha, Luc Lapointe:
Symmetry and Pieri rules for the bisymmetric Macdonald polynomials. Eur. J. Comb. 120: 103973 (2024) - Daniel W. Cranston:
Bounding clique size in squares of planar graphs. Eur. J. Comb. 120: 103960 (2024) - Ming-Jian Ding, Bao-Xuan Zhu:
Real stable polynomials and the alternatingly increasing property. Eur. J. Comb. 120: 103944 (2024) - L'ubomíra Dvoráková, Edita Pelantová:
The repetition threshold of episturmian sequences. Eur. J. Comb. 120: 104001 (2024) - Ilse Fischer, Florian Schreier-Aigner:
(-1)-enumerations of arrowed Gelfand-Tsetlin patterns. Eur. J. Comb. 120: 103979 (2024) - Loïc Foissy, Pierre-Louis Giscard, Cécile Mammez:
A co-preLie structure from chronological loop erasure in graph walks. Eur. J. Comb. 120: 103967 (2024) - António Girão, Robert Hancock:
Two Ramsey problems in blowups of graphs. Eur. J. Comb. 120: 103984 (2024) - Jie Han, Lin Sun, Guanghui Wang:
Large Y3,2-tilings in 3-uniform hypergraphs. Eur. J. Comb. 120: 103976 (2024) - Bing He:
Hecke-type series involving infinite products. Eur. J. Comb. 120: 103959 (2024) - Gábor Hegedüs, Peter Frankl:
Variations on the Bollobás set-pair theorem. Eur. J. Comb. 120: 103983 (2024) - Kathy Q. Ji, Zhicong Lin:
The binomial-Stirling-Eulerian polynomials. Eur. J. Comb. 120: 103962 (2024) - Xin Li, Mingqing Zhai, Jinlong Shu:
A Brualdi-Hoffman-Turán problem on cycles. Eur. J. Comb. 120: 103966 (2024) - Bernard L. S. Lin, Xiaowei Lin, Lei Zhang:
An identity of Ramanujan and its combinatorics. Eur. J. Comb. 120: 103985 (2024) - Colin McDiarmid:
Pendant appearances and components in random graphs from structured classes. Eur. J. Comb. 120: 103994 (2024) - Philip P. Mummert:
Cycles in Austrian Solitaire. Eur. J. Comb. 120: 103978 (2024) - Alexander Natalchenko, Arsenii Sagdeev:
Monochromatic triangles in the max-norm plane. Eur. J. Comb. 120: 103977 (2024) - Kristina Oganesyan:
Bounds for the number of multidimensional partitions. Eur. J. Comb. 120: 103982 (2024) - Jakub Przybylo:
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment. Eur. J. Comb. 120: 103961 (2024)
skipping 7 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-09-17 19:13 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