default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 63 matches
- 2019
- Ahmad Abdi
, Bertrand Guenin:
The Minimally Non-Ideal Binary Clutters with a Triangle. Comb. 39(4): 719-752 (2019) - Ahmad Abdi, Bertrand Guenin:
The Two-Point Fano and Ideal Binary Clutters. Comb. 39(4): 753-777 (2019) - Ron Aharoni, Ron Holzman, Zilin Jiang:
Rainbow Fractional Matchings. Comb. 39(6): 1191-1202 (2019) - Daniela A. Amato:
Highly-Arc-Transitive and Descendant-Homogeneous Digraphs with Finite Out-Valency. Comb. 39(6): 1203-1223 (2019) - Hyungryul Baik, Bram Petri, Jean Raimbault:
Subgroup Growth of Virtually Cyclic Right-Angled Coxeter Groups and Their Free Products. Comb. 39(4): 779-811 (2019) - Louis Bellmann, Christian Reiher:
Turán's Theorem for the Fano Plane. Comb. 39(5): 961-982 (2019) - Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé:
Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture. Comb. 39(2): 239-263 (2019) - Pavle V. M. Blagojevic, Albert Haase, Günter M. Ziegler:
Tverberg-Type Theorems for Matroids: A Counterexample and a Proof. Comb. 39(3): 477-500 (2019) - Maarten De Boeck, Geertrui Van de Voorde:
Elation KM-Arcs. Comb. 39(3): 501-544 (2019) - Nathan J. Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher:
The Colouring Number of Infinite Graphs. Comb. 39(6): 1225-1235 (2019) - Henning Bruhn, Matthias Heinlein, Felix Joos:
Long Cycles have the Edge-Erdős-Pósa Property. Comb. 39(1): 1-36 (2019) - Johannes Carmesin:
All Graphs Have Tree-Decompositions Displaying Their Topological Ends. Comb. 39(3): 545-596 (2019) - Yong-Gao Chen, Jin-Hui Fang:
Additive Complements with Narkiewicz's Condition. Comb. 39(4): 813-823 (2019) - Maria Chudnovsky, Jacob Fox, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Towards Erdős-Hajnal for Graphs with No 5-Hole. Comb. 39(5): 983-991 (2019) - Carolyn Chun, James G. Oxley:
Internally 4-Connected Binary Matroids with Every Element in Three Triangles. Comb. 39(4): 825-845 (2019) - Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran:
Twenty (Short) Questions. Comb. 39(3): 597-626 (2019) - Louis DeBiasio, Paul McKenney:
Density of Monochromatic Infinite Subgraphs. Comb. 39(4): 847-878 (2019) - Reinhard Diestel, Fabian Hundertmark, Sahar Lemanczyk:
Profiles of Separations: in Graphs, Matroids, and Beyond. Comb. 39(1): 37-75 (2019) - Reinhard Diestel, Sang-il Oum:
Tangle-Tree Duality: In Graphs, Matroids and Beyond. Comb. 39(4): 879-910 (2019) - Sally Dong, Jim Geelen:
Improved Bounds for Rota's Basis Conjecture. Comb. 39(2): 265-272 (2019) - Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows. Comb. 39(6): 1237-1253 (2019) - Sean Eberhard, Stefan-Christoph Virchow:
The Probability of Generating the Symmetric Group. Comb. 39(2): 273-288 (2019) - Jirí Fink:
Matchings Extend into 2-Factors in Hypercubes. Comb. 39(1): 77-84 (2019) - Peter Frankl, Andrey Kupavskii:
Incompatible Intersection Properties. Comb. 39(6): 1255-1266 (2019) - Florian Frick, Shira Zerbib:
Colorful Coverings of Polytopes and Piercing Numbers of Colorful d-Intervals. Comb. 39(3): 627-637 (2019) - Radoslav Fulek, Jan Kyncl:
Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4. Comb. 39(6): 1267-1279 (2019) - Alexander L. Gavrilyuk, Jack H. Koolen:
A Characterization of the Graphs of Bilinear (d×d)-Forms over F2. Comb. 39(2): 289-32 (2019) - Agelos Georgakopoulos, Matthias Hamann:
The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs. Comb. 39(5): 993-1019 (2019) - Lior Gishboliner, Asaf Shapira:
Efficient Removal Without Efficient Regularity. Comb. 39(3): 639-658 (2019) - Ashish Goel, Michael Kapralov, Sanjeev Khanna:
Perfect Matchings in Õ (n 1.5) Time in Regular Bipartite Graphs. Comb. 39(2): 323-354 (2019)
skipping 33 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-03 22:21 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
