Остановите войну!
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 141 matches
- 2017
- Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Fair representation in dimatroids. Electron. Notes Discret. Math. 61: 5-11 (2017) - Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht:
Quasirandomness in hypergraphs. Electron. Notes Discret. Math. 61: 13-19 (2017) - Elad Aigner-Horev, Hiêp Hàn:
Linear quasi-randomness of subsets of abelian groups and hypergraphs. Electron. Notes Discret. Math. 61: 21-27 (2017) - Margarita Akhmejanova, Dmitry A. Shabanov:
Colorings of b-simple hypergraphs. Electron. Notes Discret. Math. 61: 29-35 (2017) - Immanuel Albrecht:
On Finding Some New Excluded Minors for Gammoids. Electron. Notes Discret. Math. 61: 37-43 (2017) - Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet:
Packing degenerate graphs greedily. Electron. Notes Discret. Math. 61: 45-51 (2017) - Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk:
Completing graphs to metric spaces. Electron. Notes Discret. Math. 61: 53-60 (2017) - Andrei Asinowski, Gill Barequet, Yufei Zheng:
Enumerating Polyominoes with Fixed Perimeter Defect. Electron. Notes Discret. Math. 61: 61-67 (2017) - Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis:
On Induced Colourful Paths in Triangle-free Graphs. Electron. Notes Discret. Math. 61: 69-75 (2017) - Martin Balko, Jan Kyncl, Stefan Langerman, Alexander Pilz:
Induced Ramsey-type results and binary predicates for point sets. Electron. Notes Discret. Math. 61: 77-83 (2017) - Igor Balla, Felix Dräxler, Peter Keevash, Benny Sudakov:
Equiangular lines and subspaces in Euclidean spaces. Electron. Notes Discret. Math. 61: 85-91 (2017) - Afonso S. Bandeira, Asaf Ferber, Matthew Kwan:
Resilience for the Littlewood-Offord Problem. Electron. Notes Discret. Math. 61: 93-99 (2017) - Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg:
Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version. Electron. Notes Discret. Math. 61: 101-106 (2017) - Wouter Cames van Batenburg, Ross J. Kang:
Packing two graphs of even girth 10. Electron. Notes Discret. Math. 61: 191-197 (2017) - Amir-Hossein Bateni, Thibault Manneville, Vincent Pilaud:
On quadrangulations and Stokes complexes. Electron. Notes Discret. Math. 61: 107-113 (2017) - Stéphane Bessy, Jocelyn Thiebaut:
Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture. Electron. Notes Discret. Math. 61: 115-121 (2017) - David I. Bevan, Robert Brignall, Andrew Elvey Price, Jay Pantone:
Staircases, dominoes, and the growth rate of 1324-avoiders. Electron. Notes Discret. Math. 61: 123-129 (2017) - Marthe Bonamy, Kitty Meeks:
The Interactive Sum Choice Number of Graphs. Electron. Notes Discret. Math. 61: 139-145 (2017) - Vladimir A. Bondarenko, Andrei V. Nikolaev:
Some properties of the skeleton of the pyramidal tours polytope. Electron. Notes Discret. Math. 61: 131-137 (2017) - Fábio Botler, Alexandre Talon:
Decomposition of 8-regular graphs into paths of length 4. Electron. Notes Discret. Math. 61: 147-153 (2017) - Julia Böttcher, Richard Montgomery, Olaf Parczyk, Yury Person:
Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Electron. Notes Discret. Math. 61: 155-161 (2017) - Henning Bruhn, Matthias Heinlein:
K4-expansions have the edge-Erdős-Pósa property. Electron. Notes Discret. Math. 61: 163-168 (2017) - Matija Bucic, Shoham Letzter, Benny Sudakov:
Directed Ramsey number for trees. Electron. Notes Discret. Math. 61: 169-175 (2017) - Matija Bucic, Shoham Letzter, Benny Sudakov:
Monochromatic paths in random tournaments. Electron. Notes Discret. Math. 61: 177-183 (2017) - Sebastián Bustamante, Hiêp Hàn, Maya Stein:
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles. Electron. Notes Discret. Math. 61: 185-190 (2017) - Pilar Cano, Guillem Perarnau, Oriol Serra:
Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree. Electron. Notes Discret. Math. 61: 199-205 (2017) - Jose Capco, Matteo Gallet, Georg Grasegger, Christoph Koutschan, Niels Lubbes, Josef Schicho:
Computing the number of realizations of a Laman graph. Electron. Notes Discret. Math. 61: 207-213 (2017) - Cesar Ceballos, Arnau Padrol, Camilo Sarmiento:
ν-Tamari lattices via subword complexes. Electron. Notes Discret. Math. 61: 215-221 (2017) - Steven Chaplick, Peter Zeman:
Combinatorial Problems on H-graphs. Electron. Notes Discret. Math. 61: 223-229 (2017) - Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Y. Sun:
On universal partial words. Electron. Notes Discret. Math. 61: 231-237 (2017)
skipping 111 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-24 07:28 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