Остановите войну!
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 33 matches
- 2018
- Júlio Araújo, Fabrício Benevides, Alexandre A. Cezar, Ana Silva:
Circular backbone colorings: On matching and tree backbones of planar graphs. Discret. Appl. Math. 251: 69-82 (2018) - Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena:
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture. Discret. Appl. Math. 251: 83-92 (2018) - Katherine F. Benson, Daniela Ferrero, Mary Flagg, Veronika Furst, Leslie Hogben, Violeta Vasilevska:
Nordhaus-Gaddum problems for power domination. Discret. Appl. Math. 251: 103-113 (2018) - Kristóf Bérczi, Alpár Jüttner, Marco Laumanns, Jácint Szabó:
Arrival time dependent routing policies in public transport. Discret. Appl. Math. 251: 93-102 (2018) - Bernhard Bliem, Stefan Woltran:
Defensive alliances in graphs of bounded treewidth. Discret. Appl. Math. 251: 334-339 (2018) - Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak:
Localization game on geometric and planar graphs. Discret. Appl. Math. 251: 30-39 (2018) - Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, Somnath Sikdar:
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem. Discret. Appl. Math. 251: 114-125 (2018) - Xiaodan Chen, Kinkar Chandra Das:
Solution to a conjecture on the maximum ABC index of graphs with given chromatic number. Discret. Appl. Math. 251: 126-134 (2018) - Ya-Hong Chen, Hua Wang, Xiao-Dong Zhang:
Peripheral Wiener index of trees and related questions. Discret. Appl. Math. 251: 135-145 (2018) - Emeric Deutsch, Sergi Elizalde:
A bijection between bargraphs and Dyck paths. Discret. Appl. Math. 251: 340-344 (2018) - Yanxia Dong, Erfang Shan, Liying Kang, Shan Li:
Domination in intersecting hypergraphs. Discret. Appl. Math. 251: 155-159 (2018) - Wei Fang, Yi Wang, Jia-Bao Liu, Guangming Jing:
Maximum Resistance-Harary index of cacti. Discret. Appl. Math. 251: 160-170 (2018) - Celina M. H. de Figueiredo, Sophie Spirkl:
Sandwich and probe problems for excluding paths. Discret. Appl. Math. 251: 146-154 (2018) - János Flesch, Arkadi Predtetchinski, William D. Sudderth:
Simplifying optimal strategies in limsup and liminf stochastic games. Discret. Appl. Math. 251: 40-56 (2018) - Yiyuan Hao, Qizhong Lin:
Ramsey number of K3 versus F3, n. Discret. Appl. Math. 251: 345-348 (2018) - Takuya Iimura, Pierre von Mouche, Takahiro Watanabe:
Binary action games: Deviation properties, semi-strict equilibria and potentials. Discret. Appl. Math. 251: 57-68 (2018) - Ümit Islak, Alperen Y. Özdemir:
Asymptotic results on weakly increasing subsequences in random words. Discret. Appl. Math. 251: 171-189 (2018) - Cong X. Kang, Ismael González Yero, Eunjeong Yi:
The fractional strong metric dimension in three graph products. Discret. Appl. Math. 251: 190-203 (2018) - Aleksander Kelenc, Niko Tratnik, Ismael González Yero:
Uniquely identifying the edges of a graph: The edge metric dimension. Discret. Appl. Math. 251: 204-220 (2018) - Shengjia Li, Xiaohui Wu, Eberhard Triesch:
A ternary search problem on two disjoint sets. Discret. Appl. Math. 251: 221-235 (2018) - Min-Sheng Lin:
Counting independent sets and maximal independent sets in some subclasses of bipartite graphs. Discret. Appl. Math. 251: 236-244 (2018) - Thiago Braga Marcilon, Rudini M. Sampaio:
The maximum infection time of the P3 convexity in graphs with bounded maximum degree. Discret. Appl. Math. 251: 245-257 (2018) - Marjan M. Matejic, Igor Z. Milovanovic, Emina I. Milovanovic:
Upper bounds for the inverse sum indeg index of graphs. Discret. Appl. Math. 251: 258-267 (2018) - Angelo Monti, Blerina Sinaimeri:
On variants of Vertex Geography on undirected graphs. Discret. Appl. Math. 251: 268-275 (2018) - Ghajendran Poovanandran, Wen Chean Teh:
Elementary matrix equivalence and core transformation graphs for Parikh matrices. Discret. Appl. Math. 251: 276-289 (2018) - Bernd R. Schuh:
Exact satisfiability of linear CNF formulas. Discret. Appl. Math. 251: 1-4 (2018) - Richard Edwin Stearns, Daniel J. Rosenkrantz, S. S. Ravi, Madhav V. Marathe:
A characterization of nested canalyzing functions with maximum average sensitivity. Discret. Appl. Math. 251: 5-14 (2018) - Damir Vukicevic, Jelena Sedlar:
On indices of Wiener and anti-Wiener type. Discret. Appl. Math. 251: 290-298 (2018) - Jianfeng Wang, Mei Lu, Francesco Belardo, Milan Randic:
The anti-adjacency matrix of a graph: Eccentricity matrix. Discret. Appl. Math. 251: 299-309 (2018) - Changqing Xu, Shan Ge, Jianguo Li:
Neighbor sum distinguishing total chromatic number of 2-degenerate graphs. Discret. Appl. Math. 251: 349-352 (2018)
skipping 3 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-04-18 17:33 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