Остановите войну!
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 27 matches
- 2019
- Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The query complexity of a permutation-based variant of Mastermind. Discret. Appl. Math. 260: 28-50 (2019) - Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The expanding search ratio of a graph. Discret. Appl. Math. 260: 51-65 (2019) - Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev:
Dense subgraphs in random graphs. Discret. Appl. Math. 260: 66-74 (2019) - Robert A. Beeler, Teresa W. Haynes, Rodney Keaton:
Domination cover rubbling. Discret. Appl. Math. 260: 75-85 (2019) - Kimmo Berg, Mitri Kitti:
Equilibrium paths in discounted supergames. Discret. Appl. Math. 260: 1-27 (2019) - Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Dynamic monopolies for interval graphs with bounded thresholds. Discret. Appl. Math. 260: 256-261 (2019) - Wenqin Cao, Emma Yu Jin, Zhicong Lin:
Enumeration of inversion sequences avoiding triples of relations. Discret. Appl. Math. 260: 86-97 (2019) - Jin Chen, Zhi-Xiong Wen, Wen Wu:
On the additive complexity of a Thue-Morse-like sequence. Discret. Appl. Math. 260: 98-108 (2019) - Yongxi Cheng, Yunyue Yang, Ding-Zhu Du:
A class of asymptotically optimal group testing strategies to identify good items. Discret. Appl. Math. 260: 109-116 (2019) - Jihoon Choi, Soogang Eoh, Suh-Ryung Kim:
A graph with the partial order competition dimension greater than five. Discret. Appl. Math. 260: 262-266 (2019) - Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp:
Optimal pebbling number of graphs with given minimum degree. Discret. Appl. Math. 260: 117-130 (2019) - Janosch Döcker, Leo van Iersel, Steven Kelk, Simone Linz:
Deciding the existence of a cherry-picking sequence is hard on two trees. Discret. Appl. Math. 260: 131-143 (2019) - Guillaume Ducoffe:
Easy computation of eccentricity approximating trees. Discret. Appl. Math. 260: 267-271 (2019) - Michel Grabisch, Tomás Kroupa:
The cone of supermodular games on finite distributive lattices. Discret. Appl. Math. 260: 144-154 (2019) - Ran Gu, Hong-Jian Lai, Yanting Liang, Zhengke Miao, Meng Zhang:
Collapsible subgraphs of a 4-edge-connected graph. Discret. Appl. Math. 260: 272-277 (2019) - Miaomiao Han, Hong-Jian Lai, Jianping Liu:
Modulo 5-orientations and degree sequences. Discret. Appl. Math. 260: 155-163 (2019) - Teresa W. Haynes, Michael A. Henning:
Perfect Italian domination in trees. Discret. Appl. Math. 260: 164-177 (2019) - Marko Jakovac:
Relating the annihilation number and the 2-domination number of block graphs. Discret. Appl. Math. 260: 178-187 (2019) - Iman Keshtkar, Mehdi Ghiyasvand:
Inverse quickest center location problem on a tree. Discret. Appl. Math. 260: 188-202 (2019) - Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
On shortening u-cycles and u-words for permutations. Discret. Appl. Math. 260: 203-213 (2019) - Hui Lei, Suil O, Yongtang Shi, Douglas B. West, Xuding Zhu:
Extremal problems on saturation for the family of k-edge-connected graphs. Discret. Appl. Math. 260: 278-283 (2019) - Farshad Safaei, F. Kashkooei Jahromi, S. Fathi:
A method for computing local contributions to graph energy based on Estrada-Benzi approach. Discret. Appl. Math. 260: 214-226 (2019) - Chin-Lin Shiue:
Capacity restricted optimal pebbling in graphs. Discret. Appl. Math. 260: 284-288 (2019) - Warut Suksompong:
Fairly allocating contiguous blocks of indivisible items. Discret. Appl. Math. 260: 227-236 (2019) - Payam Valadkhan:
List matrix partitions of graphs representing geometric configurations. Discret. Appl. Math. 260: 237-243 (2019) - Dijian Wang, Yaoping Hou:
Bicyclic signed graphs with at most one odd cycle and maximal energy. Discret. Appl. Math. 260: 244-255 (2019) - Yun-Hao Zou, Jia Jie Liu, Chiun-Chieh Hsu, Yue-Li Wang:
A simple algorithm for secure domination in proper interval graphs. Discret. Appl. Math. 260: 289-293 (2019)
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-04-25 03:09 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