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 15 matches
- 2023
- Antoine Dailly, Elzbieta Sidorowicz:
Neighbour sum distinguishing edge-weightings with local constraints. Discret. Appl. Math. 336: 109-124 (2023) - Peter Dankelmann:
On the Wiener index of orientations of graphs. Discret. Appl. Math. 336: 125-131 (2023) - Akbar Davoodi, Leila Maherani:
On the total versions of 1-2-3-Conjecture for graphs and hypergraphs. Discret. Appl. Math. 336: 1-10 (2023) - Darko Dimitrov, Zhibin Du:
Complete characterization of the minimal-ABC trees. Discret. Appl. Math. 336: 148-194 (2023) - Barun Gorain, Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal, Supantha Pandit:
Burning and w-burning of geometric graphs. Discret. Appl. Math. 336: 83-98 (2023) - Aaron D. Gray, Michael A. Henning:
Paired-domination game played on cycles. Discret. Appl. Math. 336: 132-140 (2023) - Hovhannes A. Harutyunyan, Zhiyuan Li:
Broadcast graphs using new dimensional broadcast schemes for Knödel graphs. Discret. Appl. Math. 336: 56-67 (2023) - Jaeseong Jeong, Namhun Koo, Soonhak Kwon:
Low c-differential uniformity of the swapped inverse function in odd characteristic. Discret. Appl. Math. 336: 195-209 (2023) - Jianping Li, Leshi Qiu, Jianbin Zhang:
On the least eccentricity eigenvalue of graphs. Discret. Appl. Math. 336: 47-55 (2023) - Signe Lundqvist, Klara Stokes, Lars-Daniel Öhman:
Exploring the rigidity of planar configurations of points and rods. Discret. Appl. Math. 336: 68-82 (2023) - Athmakoori Prashant, S. Francis Raj, M. Gokulnath:
Bounds for the chromatic number of some pK2-free graphs. Discret. Appl. Math. 336: 99-108 (2023) - John Alasdair Warwicker, Steffen Rebennack:
A unified framework for bivariate clustering and regression problems via mixed-integer linear programming. Discret. Appl. Math. 336: 15-36 (2023) - Peichao Wei, Muhuo Liu, Ivan Gutman:
On (exponential) bond incident degree indices of graphs. Discret. Appl. Math. 336: 141-147 (2023) - Gexin Yu, Rachel Yu:
Strong edge-coloring of 2-degenerate graphs. Discret. Appl. Math. 336: 11-14 (2023) - Xiaohui Zhang, Shumin Zhang, Chengfu Ye, Bing Yao:
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding. Discret. Appl. Math. 336: 37-46 (2023)
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-29 07:25 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