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 29 matches
- 2023
- Aida Abiad, Leonardo Silva de Lima, Sina Kalantarzadeh, Mona Mohammadi, Carla Silva Oliveira:
Bounding the sum of the largest signless Laplacian eigenvalues of a graph. Discret. Appl. Math. 340: 315-326 (2023) - Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo K. K. Rosado:
On the complexity of the Cable-Trench Problem. Discret. Appl. Math. 340: 272-285 (2023) - Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Extension of some edge graph problems: Standard, parameterized and approximation complexity. Discret. Appl. Math. 340: 183-201 (2023) - Pavel Chebotarev, David Peleg:
The power of small coalitions under two-tier majority on regular graphs. Discret. Appl. Math. 340: 239-258 (2023) - Qian-Qian Chen, Ji-Ming Guo:
Nordhaus-Gaddum type inequality for the integer k-matching number of a graph. Discret. Appl. Math. 340: 21-31 (2023) - Weizhen Chen, Meng Ji, Yaping Mao, Meiqin Wei:
Complete bipartite graphs without small rainbow stars. Discret. Appl. Math. 340: 14-20 (2023) - Yinsong Chen, Vladislav Kargin:
The number of ribbon tilings for strips. Discret. Appl. Math. 340: 85-103 (2023) - Hongzhang Chen, Jianxi Li, Peng Huang:
On the Aα-spectral radius of graphs with given size. Discret. Appl. Math. 340: 350-362 (2023) - Xiaodong Chen, Qinghai Liu, Xiwu Yang:
Two completely independent spanning trees of split graphs. Discret. Appl. Math. 340: 76-78 (2023) - Jie Chen, Shou-Jun Xu:
P5-isolation in graphs. Discret. Appl. Math. 340: 331-349 (2023) - Fabrizio Colombo, Rolf Sören Kraußhar, Irene Sabadini, Y. Simsek:
On the generating functions and special functions associated with superoscillations. Discret. Appl. Math. 340: 215-227 (2023) - Archak Das, Kaustav Bose, Buddhadeb Sau:
Memory optimal dispersion by anonymous mobile robots. Discret. Appl. Math. 340: 171-182 (2023) - Luérbio Faria, Mauro Nigro, Myriam Preissmann, Diana Sasaki:
Results about the total chromatic number and the conformability of some families of circulant graphs. Discret. Appl. Math. 340: 123-133 (2023) - Luis Gustavo da Soledade Gonzaga, Jadder Bismarck de Sousa Cruz, Sheila Morais de Almeida, Cândida Nunes da Silva:
The Overfull Conjecture on split-comparability and split-interval graphs. Discret. Appl. Math. 340: 228-238 (2023) - Vladimir Gurvich, Mariya Naumova:
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles. Discret. Appl. Math. 340: 53-68 (2023) - Gregory Z. Gutin, Anders Yeo:
(1,1)-Cluster Editing is polynomial-time solvable. Discret. Appl. Math. 340: 259-271 (2023) - John Haslegrave:
Monitoring edge-geodetic sets: Hardness and graph products. Discret. Appl. Math. 340: 79-84 (2023) - Hung P. Hoang, Stefan Lendl, Lasse Wulf:
Assistance and interdiction problems on interval graphs. Discret. Appl. Math. 340: 153-170 (2023) - Ji-Hwan Jung, Suh-Ryung Kim, Hyesun Yoon:
On the limit of the sequence {Cm(D)}m=1∞ for a multipartite tournament D. Discret. Appl. Math. 340: 1-13 (2023) - Sonja Kraiczy, Ágnes Cseh, David F. Manlove:
On weakly and strongly popular rankings. Discret. Appl. Math. 340: 134-152 (2023) - Edmond W. H. Lee:
Embedding finite involution semigroups in matrices with transposition. Discret. Appl. Math. 340: 327-330 (2023) - Zuwen Luo, Kexiang Xu:
Extremal problems for connected set enumeration. Discret. Appl. Math. 340: 41-52 (2023) - Ryoga Mahara:
Existence of EFX for two additive valuations. Discret. Appl. Math. 340: 115-122 (2023) - Lu Miao, Ruifang Liu, Jie Xue:
Maxima of the Q-index of non-bipartite graphs: Forbidden short odd cycles. Discret. Appl. Math. 340: 104-114 (2023) - Dominique Perrin, Christophe Reutenauer:
The palindromization map. Discret. Appl. Math. 340: 202-214 (2023) - Zoran Stanic:
Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph. Discret. Appl. Math. 340: 32-40 (2023) - C. A. Weffort-Santos, C. N. Campos, Rafael C. S. Schouery:
On gap-labellings of some families of graphs. Discret. Appl. Math. 340: 296-314 (2023) - Kexiang Xu, Jing Tian, Sandi Klavzar:
New transmission irregular chemical graphs. Discret. Appl. Math. 340: 286-295 (2023) - Leilei Zhang:
The minimum Kirchhoff index of phenylene chains. Discret. Appl. Math. 340: 69-75 (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-11-07 13:28 CET 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