Остановите войну!
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 22 matches
- 2024
- Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat:
Cops and Robber on butterflies, grids, and AT-free graphs. Discret. Appl. Math. 345: 231-245 (2024) - Fawad Ali, Bilal A. Rather, Muhammad Naeem, Wei Wang:
Degree and distance based topological descriptors of power graphs of finite non-abelian groups. Discret. Appl. Math. 345: 62-76 (2024) - Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
Weighted microscopic image reconstruction. Discret. Appl. Math. 345: 17-33 (2024) - Sergio Bermudo, Roslan Hasni, Fateme Movahedi, Juan E. Nápoles Valdés:
The Geometric-Arithmetic index of trees with a given total domination number. Discret. Appl. Math. 345: 99-113 (2024) - Peter Borg, Carl Feghali, Rémi Pellerin:
Solution to a problem of Katona on counting cliques of weighted graphs. Discret. Appl. Math. 345: 147-155 (2024) - Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor:
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes. Discret. Appl. Math. 345: 34-51 (2024) - Yuehua Bu, Peng Wang, Hongguo Zhu, Junlei Zhu:
Injective chromatic index of sparse graphs. Discret. Appl. Math. 345: 9-16 (2024) - Cintia Izabel Cararo, Sheila Morais de Almeida, Cândida Nunes da Silva:
Further split graphs known to be Class 1 and a characterization of subgraph-overfull split graphs. Discret. Appl. Math. 345: 114-124 (2024) - Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai:
s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. Discret. Appl. Math. 345: 170-189 (2024) - Nasrin Dehgardi, Tomislav Doslic:
Lower bounds on the general first Zagreb index of graphs with low cyclomatic number. Discret. Appl. Math. 345: 52-61 (2024) - Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos:
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set. Discret. Appl. Math. 345: 4-8 (2024) - Xiaxia Guan, Xian'an Jin, Tianlong Ma:
The interior and exterior polynomials are well-defined. Discret. Appl. Math. 345: 246-253 (2024) - Shanshan Guo, Fei Huang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs. Discret. Appl. Math. 345: 141-146 (2024) - Norbert Hegyvári:
On arithmetic sums of Cantor-type sequences of integers. Discret. Appl. Math. 345: 1-3 (2024) - Zemin Jin, Rui Yu, Yuefang Sun:
Anti-Ramsey number of matchings in outerplanar graphs. Discret. Appl. Math. 345: 125-135 (2024) - Joan M. Morris:
Slow coloring of 3k-connected graphs. Discret. Appl. Math. 345: 226-230 (2024) - S. N. Popova:
Bounded quantifier depth spectrum for random uniform hypergraphs. Discret. Appl. Math. 345: 215-225 (2024) - M. A. Shalu, Cyriac Antony:
Hardness transitions and uniqueness of acyclic colouring. Discret. Appl. Math. 345: 77-98 (2024) - Tao Wang, Xiaojing Yang:
On odd colorings of sparse graphs. Discret. Appl. Math. 345: 156-169 (2024) - Yuan Zhang, Haiying Wang, Guifu Su, Kinkar Chandra Das:
Extremal problems on the Atom-bond sum-connectivity indices of trees with given matching number or domination number. Discret. Appl. Math. 345: 190-206 (2024) - Xiaojun Zhao, Qingying Deng, Zhiyi Wang:
Restricted arc-connectivity of unidirectional star graphs. Discret. Appl. Math. 345: 207-214 (2024) - Zitao Zou, Lingping Zhong:
A lower bound on the modified Randić index of line graphs. Discret. Appl. Math. 345: 136-140 (2024)
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-12 07:39 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