Остановите войну!
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 38 matches
- 2010
- Peter Adams, Elizabeth J. Billington, Dean G. Hoffman, Charles Curtis Lindner:
The generalized almost resolvable cycle system problem. Comb. 30(6): 617-625 (2010) - Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang:
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs. Comb. 30(5): 485-520 (2010) - George Androulakis, Stephen J. Dilworth, Nigel J. Kalton:
A new approach to the Ramsey-type games and the Gowers dichotomy in F-spaces. Comb. 30(4): 359-385 (2010) - Ronnie Barequet, Gill Barequet, Günter Rote:
Formulae and growth rates of high-dimensional polycubes. Comb. 30(3): 257-275 (2010) - Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
On properties of random dissections and triangulations. Comb. 30(6): 627-654 (2010) - Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko:
Hypergraphs with independent neighborhoods. Comb. 30(3): 277-293 (2010) - Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel:
Every rayless graph has an unfriendly partition. Comb. 30(5): 521-532 (2010) - E. Rodney Canfield, Brendan D. McKay:
Asymptotic enumeration of integer matrices with large equal row and column sums. Comb. 30(6): 655-680 (2010) - Ada Chan, Chris D. Godsil:
Type-II matrices and combinatorial structures. Comb. 30(1): 1-24 (2010) - Maria Chudnovsky, Paul D. Seymour:
The three-in-a-tree problem. Comb. 30(4): 387-417 (2010) - Péter Csikvári:
On a poset of trees. Comb. 30(2): 125-137 (2010) - Cécile Dartyge, András Sárközy, Mihály Szalay:
On the pseudo-randomness of subsets related to primitive roots. Comb. 30(2): 139-162 (2010) - Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar:
Approximation algorithms via contraction decomposition. Comb. 30(5): 533-552 (2010) - Reinhard Diestel, Philipp Sprüssel:
The homology of a locally finite graph with ends. Comb. 30(6): 681-714 (2010) - Gábor Elek:
On the limit of large girth graph sequences. Comb. 30(5): 553-563 (2010) - Satoru Fujishige:
A note on disjoint arborescences. Comb. 30(2): 247-252 (2010) - Shinya Fujita, Ken-ichi Kawarabayashi:
Non-separating even cycles in highly connected graphs. Comb. 30(5): 565-580 (2010) - Venkatesan Guruswami, James R. Lee, Alexander A. Razborov:
Almost Euclidean subspaces of l 1N VIA expander codes. Comb. 30(1): 47-68 (2010) - Katalin Gyarmati, Máté Matolcsi, Imre Z. Ruzsa:
A superadditivity and submultiplicativity property for cardinalities of sumsets. Comb. 30(2): 163-174 (2010) - Guo-Niu Han:
New hook length formulas for binary trees. Comb. 30(2): 253-256 (2010) - Shawn Hedman, Wai Yan Pong:
Locally finite homogeneous graphs. Comb. 30(4): 419-434 (2010) - Hiroshi Hirai:
Metric packing for K3+K3. Comb. 30(3): 295-326 (2010) - Bill Jackson:
An inequality for Tutte polynomials. Comb. 30(1): 69-81 (2010) - Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Algorithms for finding an induced cycle in planar graphs. Comb. 30(6): 715-734 (2010) - Peter Keevash, Dhruv Mubayi:
Set systems without a simplex or a cluster. Comb. 30(2): 175-200 (2010) - Henry A. Kierstead, Alexandr V. Kostochka:
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture. Comb. 30(2): 201-216 (2010) - Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi:
A fast algorithm for equitable coloring. Comb. 30(2): 217-224 (2010) - Torsten Korneffel, Eberhard Triesch:
An asymptotic bound for the complexity of monotone graph properties. Comb. 30(6): 735-743 (2010) - Claude Laflamme, Lionel Nguyen Van Thé, Norbert W. Sauer:
Partition properties of the dense local order and a colored version of Milliken's theorem. Comb. 30(1): 83-104 (2010) - Martin Marciniszyn, Reto Spöhel:
Online vertex-coloring games in random graphs. Comb. 30(1): 105-123 (2010)
skipping 8 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-05-01 11:43 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