Остановите войну!
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
- 2024
- Dhanyamol Antony, Anita Das, Shirish Gosavi, Dalu Jacob, Shashanka Kulamarva:
Spanning caterpillar in biconvex bipartite graphs. Discret. Appl. Math. 356: 32-36 (2024) - Michela Ascolese, Paolo Dulio, Silvia M. C. Pagani:
Uniqueness and reconstruction of finite lattice sets from their line sums. Discret. Appl. Math. 356: 293-306 (2024) - Pallabi Bora, Kukil Kalpa Rajkhowa:
Laplacian and Wiener index of extension of zero divisor graph. Discret. Appl. Math. 356: 229-237 (2024) - Geoffrey Boyer, Wayne Goddard:
Disjoint isolating sets and graphs with maximum isolation number. Discret. Appl. Math. 356: 110-116 (2024) - Cristina Dalfó, Grahame Erskine, Geoffrey Exoo, Miguel Angel Fiol, Nacho López, Arnau Messegué, James Tuite:
On large regular (1,1,k)-mixed graphs. Discret. Appl. Math. 356: 209-228 (2024) - Tomislav Doslic, Mate Puljiz, Stjepan Sebek, Josip Zubrinic:
On a variant of Flory model. Discret. Appl. Math. 356: 269-292 (2024) - Audace A. V. Dossou-Olory:
The level matrix of a tree and its spectrum. Discret. Appl. Math. 356: 1-12 (2024) - Gabriel Fortin-Leblanc, Gena Hahn, Frank Ramamonjisoa:
On cop-win dynamic graphs. Discret. Appl. Math. 356: 322-328 (2024) - Elisabeth Gaar:
On different versions of the exact subgraph hierarchy for the stable set problem. Discret. Appl. Math. 356: 52-70 (2024) - Jing Gao, Ning Yang:
Some bounds on the largest eigenvalue of degree-based weighted adjacency matrix of a graph. Discret. Appl. Math. 356: 21-31 (2024) - Shi-Cai Gong, Lu Lin:
On the construction of locally most reliable two-terminal graphs. Discret. Appl. Math. 356: 393-402 (2024) - José Luis Figueroa González, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret Wagler:
A project and lift approach for a 2-commodity flow relocation model in a time expanded network. Discret. Appl. Math. 356: 350-368 (2024) - Xiaoqin Hong, Xiwang Cao:
New constant dimension subspace codes from improved parallel subcode construction. Discret. Appl. Math. 356: 142-148 (2024) - Jorik Jooken:
Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs. Discret. Appl. Math. 356: 133-141 (2024) - Meenakshi Kansal, Animesh Roy, Dibyendu Roy, Srinivasu Bodapati, Anupam Chattopadhyay:
Priority Arbiter PUF: Analysis. Discret. Appl. Math. 356: 71-95 (2024) - Kaiyang Lan, Xinheng Lin:
Borodin-Kostochka conjecture holds for K1,3¯-free graphs. Discret. Appl. Math. 356: 263-268 (2024) - Yunping Li, Hanyuan Deng, Zikai Tang:
Sombor index of maximal outerplanar graphs. Discret. Appl. Math. 356: 96-103 (2024) - Yibo Li, Ruiting Zhang, Qiong Fan:
On the maximal augmented Zagreb index of unicyclic graphs with given girth. Discret. Appl. Math. 356: 238-246 (2024) - Felicia Lucke, Bernard Ries:
On blockers and transversals of maximum independent sets in co-comparability graphs. Discret. Appl. Math. 356: 307-321 (2024) - Kittikorn Nakprasit, Pongpat Sittitrai, Wannapol Pimpasalee:
Planar graphs without 4- and 6-cycles are (3,4)-colorable. Discret. Appl. Math. 356: 44-51 (2024) - Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau:
Redicolouring digraphs: Directed treewidth and cycle-degeneracy. Discret. Appl. Math. 356: 191-208 (2024) - Debasish Pattanayak, Andrzej Pelc:
Graph exploration by a deterministic memoryless automaton with pebbles. Discret. Appl. Math. 356: 149-160 (2024) - Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
New classes of Facets for complementarity knapsack problems. Discret. Appl. Math. 356: 247-262 (2024) - Hongwei Qiao, Jixiang Meng, Eminjan Sabir:
The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree. Discret. Appl. Math. 356: 174-181 (2024) - Josiah Reiswig:
A note on the Steiner k-radius and Steiner k-diameter. Discret. Appl. Math. 356: 13-20 (2024) - Lei Ren, Yongxin Lan, Changqing Xu:
The rainbow numbers of cycles in maximal bipartite planar graph. Discret. Appl. Math. 356: 37-43 (2024) - Jenny Segschneider, Arie M. C. A. Koster:
Robust two-dose vaccination schemes and the directed b-matching problem. Discret. Appl. Math. 356: 369-392 (2024) - Cheng-Hsiao Tsou, Ching-Chi Lin, Chan-Hung Hsu:
Finding broadcast 2-centers of a tree under the postal model. Discret. Appl. Math. 356: 182-190 (2024) - Shujing Wang:
Maxima of the Q-index of leaf-free graphs with given size. Discret. Appl. Math. 356: 161-173 (2024) - Na Wang, Jixiang Meng, Yingzhi Tian:
Reliability analyses of regular graphs based on edge-structure connectivity. Discret. Appl. Math. 356: 329-342 (2024)
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-09-09 13:42 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