Остановите войну!
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 30 matches
- 2024
- Daniel Owusu Adu, Daniel Keliher:
Optimal transport for some symmetric, multidimensional integer partitions. Discret. Appl. Math. 343: 159-165 (2024) - Amir Barghi, Daryl R. DeFord:
Ranking trees based on global centrality measures. Discret. Appl. Math. 343: 231-257 (2024) - Simon Brezovnik, Zhongyuan Che, Niko Tratnik, Petra Zigert Pletersek:
Outerplane bipartite graphs with isomorphic resonance graphs. Discret. Appl. Math. 343: 340-349 (2024) - Lkhagva Buyantogtokh, Batmend Horoldagva:
(n,m)-graphs with maximum exponential second Zagreb index. Discret. Appl. Math. 343: 350-354 (2024) - José E. Calderón-Gómez, Luis A. Medina, Carlos A. Molina-Salazar:
Short k-rotation symmetric Boolean functions. Discret. Appl. Math. 343: 49-64 (2024) - Alexandru Chirvasitu, Thomas W. Cusick:
Quadratic rotation symmetric Boolean functions. Discret. Appl. Math. 343: 91-105 (2024) - Hojin Chu, Suh-Ryung Kim:
Competition graphs of degree bounded digraphs. Discret. Appl. Math. 343: 106-114 (2024) - Tianjiao Dai, Hao Li, Qiancheng Ouyang, Zeng-Xian Tian:
On (2,k)-Hamilton-connected graphs. Discret. Appl. Math. 343: 288-299 (2024) - Tomislav Doslic, László Németh, Luka Podrug:
Hosoya index of thorny polymers. Discret. Appl. Math. 343: 277-287 (2024) - Yong-De Feng, Yan-Ting Xie, Shou-Jun Xu:
The extendability of Cayley graphs generated by transpositions. Discret. Appl. Math. 343: 134-139 (2024) - Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev:
Graphs with minimum fractional domatic number. Discret. Appl. Math. 343: 140-148 (2024) - Kirpa Garg, Sartaj Ul Hasan, Pantelimon Stanica:
Boomerang uniformity of some classes of functions over finite fields. Discret. Appl. Math. 343: 166-179 (2024) - Wayne Goddard, Julia VanLandingham:
The fully weighted toughness of a graph. Discret. Appl. Math. 343: 82-90 (2024) - Marc Goerigk, Stefan Lendl, Lasse Wulf:
On the complexity of robust multi-stage problems with discrete recourse. Discret. Appl. Math. 343: 355-370 (2024) - Marc Hellmuth, Guillaume E. Scholz:
Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs. Discret. Appl. Math. 343: 25-43 (2024) - Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena:
Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches. Discret. Appl. Math. 343: 191-207 (2024) - Neethu P. K., S. V. Ullas Chandran, Julliano R. Nascimento:
On the monophonic convexity in complementary prisms. Discret. Appl. Math. 343: 224-230 (2024) - Egor Lappo, Noah A. Rosenberg:
A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees. Discret. Appl. Math. 343: 65-81 (2024) - Yanfang Liang, Baoyindureng Wu:
On some conjectures on biclique graphs. Discret. Appl. Math. 343: 184-190 (2024) - Ioannis Mantas, Marko Savic, Hendrik Schrezenmaier:
New variants of perfect non-crossing matchings. Discret. Appl. Math. 343: 1-14 (2024) - Abel Cabrera Martínez:
An improved upper bound on the domination number of a tree. Discret. Appl. Math. 343: 44-48 (2024) - Enide Andrade Martins, Eber Lenes, Pamela Pizarro, María Robbiano, Jonnathan Rodríguez:
On spectral invariants of the α-mixed adjacency matrix. Discret. Appl. Math. 343: 300-327 (2024) - Pierre Miasnikof, Mohammad Bagherbeik, Ali Sheikholeslami:
Graph clustering with Boltzmann machines. Discret. Appl. Math. 343: 208-223 (2024) - Young-Soo Myung:
A polynomial time algorithm for the triangle packing problem on interval graphs. Discret. Appl. Math. 343: 180-183 (2024) - Jelena Sedlar, Riste Skrekovski:
Local Irregularity Conjecture vs. cacti. Discret. Appl. Math. 343: 115-133 (2024) - Eshwar Srinivasan, Ramesh Hariharasubramanian:
Minimum length word-representants of word-representable graphs. Discret. Appl. Math. 343: 149-158 (2024) - Tai-Yu Su:
Minimum spanning tree cycle intersection problem on outerplanar graphs. Discret. Appl. Math. 343: 328-339 (2024) - Yuuho Tanaka:
On the average hitting times of Cay(ZN,{+1,+2}). Discret. Appl. Math. 343: 269-276 (2024) - Jianliang Wu, Xingqin Qi, Zhulou Cao:
H-sequences and 2-step coreness in graphs. Discret. Appl. Math. 343: 258-268 (2024) - Liwen Zhang, Yuke Zhang:
Maximizing the degree powers of graphs with fixed size. Discret. Appl. Math. 343: 15-24 (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-06-01 05:53 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