Остановите войну!
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 39 matches
- 2024
- Sergio De Agostino:
Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing. Discret. Appl. Math. 342: 200-206 (2024) - Akbar Ali, Stefan Stankov, Emina I. Milovanovic, Marjan M. Matejic, Igor Z. Milovanovic:
Bounds on the modified second Zagreb index. Discret. Appl. Math. 342: 385-390 (2024) - Imran Allie, Edita Mácajová, Martin Skoviera:
Flow resistance to resistance ratios in cubic graphs. Discret. Appl. Math. 342: 362-367 (2024) - Devsi Bantva, Daphne Der-Fen Liu:
Radio number for the Cartesian product of two trees. Discret. Appl. Math. 342: 304-316 (2024) - Milan Basic:
Minimal spread of integral circulant graphs. Discret. Appl. Math. 342: 317-333 (2024) - Patrice Bertrand, Jean Diatta:
An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering. Discret. Appl. Math. 342: 38-63 (2024) - Gruia Calinescu, Hemanshu Kaul, Bahareh Kudarzi:
An improved algorithm for finding maximum outerplanar subgraphs. Discret. Appl. Math. 342: 207-217 (2024) - Mengyu Cao, Ke Liu, Mei Lu, Zequn Lv:
Treewidth of the q-Kneser graphs. Discret. Appl. Math. 342: 174-180 (2024) - Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid:
Shortest distances as enumeration problem. Discret. Appl. Math. 342: 89-103 (2024) - Rong Chen, Kaiyang Lan, Yidong Zhou:
Coloring {P2∪P3,house}-free graphs with Δ-1 colors. Discret. Appl. Math. 342: 12-18 (2024) - Gek Ling Chia, Kai An Sim:
On the skewness of products of graphs. Discret. Appl. Math. 342: 295-303 (2024) - Daniel W. Cranston:
Odd-sum colorings of planar graphs. Discret. Appl. Math. 342: 82-88 (2024) - Ashok Kumar Das, Rajkamal Sahu:
A characterization of unit interval bigraphs of open and closed intervals. Discret. Appl. Math. 342: 231-243 (2024) - Guixin Deng, Jin Geng, Xiangneng Zeng:
Group distance magic labeling of tetravalent circulant graphs. Discret. Appl. Math. 342: 19-26 (2024) - Magda Dettlaff, Michael A. Henning, Jerzy Topp:
Common domination perfect graphs. Discret. Appl. Math. 342: 253-259 (2024) - Peter Frankl, Erica L. L. Liu, Jian Wang, Zhe Yang:
Non-trivial t-intersecting separated families. Discret. Appl. Math. 342: 124-137 (2024) - Zhiyong Gan, Yanping Xu:
On defect restricted matching extension graphs. Discret. Appl. Math. 342: 76-81 (2024) - Uttam K. Gupta, Dinabandhu Pradhan:
Strengthening Brooks' chromatic bound on P6-free graphs. Discret. Appl. Math. 342: 334-346 (2024) - David Hartman, Aneta Pokorná, Pavel Valtr:
On the connectivity and the diameter of betweenness-uniform graphs. Discret. Appl. Math. 342: 27-37 (2024) - Jing Huang, Xianya Geng, Shuchao Li, Zihan Zhou:
On spectral extrema of graphs with given order and dissociation number. Discret. Appl. Math. 342: 368-380 (2024) - Jing Huang, Huihui Zhang:
Extremal vertex-degree function index with given order and dissociation number. Discret. Appl. Math. 342: 142-152 (2024) - Zhen Ji, Ralf Klasing, Wen Li, Yaping Mao, Xiaoyan Zhang:
Erdös-Gallai-type problems for distance-edge-monitoring numbers. Discret. Appl. Math. 342: 275-285 (2024) - Mouhamad El Joubbeh, Salman Ghazal:
Existence of paths with t blocks in k(t)-chromatic digraph. Discret. Appl. Math. 342: 381-384 (2024) - Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro:
Disjointness graphs of segments in R2 are almost all hamiltonian. Discret. Appl. Math. 342: 168-173 (2024) - Ping Li:
Planar Turán number of the disjoint union of cycles. Discret. Appl. Math. 342: 260-274 (2024) - Yayang Liu, Xiaolin Chen:
The change of Seidel energy of 5-partite Turán graph due to edge deletion. Discret. Appl. Math. 342: 104-123 (2024) - Qi Ma:
Extremal polygonal chains with respect to the Kirchhoff index. Discret. Appl. Math. 342: 218-226 (2024) - Meijie Ma, Xiang-Jun Li, Guijuan Wang, Yongli Zan:
Generalized fault-tolerance for enhanced hypercubes. Discret. Appl. Math. 342: 244-252 (2024) - Shi-Mei Ma, Hao Qi, Jean Yeh, Yeong-Nan Yeh:
Commuting Eulerian operators. Discret. Appl. Math. 342: 355-361 (2024) - I. Vinod Reddy:
On structural parameterizations of load coloring. Discret. Appl. Math. 342: 181-189 (2024)
skipping 9 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-06-04 00:15 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