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
- 2019
- Meysam Alishahi, Ali Taherkhani:
On the random version of the Erdős matching conjecture. Discret. Appl. Math. 254: 1-9 (2019) - Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal:
Locating battery charging stations to facilitate almost shortest paths. Discret. Appl. Math. 254: 10-16 (2019) - Ganbileg Bat-Ochir:
On the number of points with pairwise integral distances on a circle. Discret. Appl. Math. 254: 17-32 (2019) - Joshua Carlson, Leslie Hogben, Jürgen Kritschgau, Kate J. Lorenzen, Michael Segal, Seth Selken, Vicente Valle Martinez:
Throttling positive semidefinite zero forcing propagation time on graphs. Discret. Appl. Math. 254: 33-46 (2019) - Yin Chen, Baoyindureng Wu:
On the geometric-arithmetic index of a graph. Discret. Appl. Math. 254: 268-273 (2019) - Jihoon Choi, Soogang Eoh, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
The partial order competition dimensions of bipartite graphs. Discret. Appl. Math. 254: 47-55 (2019) - Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley:
The flip Markov chain for connected regular graphs. Discret. Appl. Math. 254: 56-79 (2019) - Christophe Crespelle, Anthony Perez, Ioan Todinca:
An O(n2) time algorithm for the minimal permutation completion problem. Discret. Appl. Math. 254: 80-95 (2019) - François Dross, Mickaël Montassier, Alexandre Pinlou:
Large induced forests in planar graphs with girth 4. Discret. Appl. Math. 254: 96-106 (2019) - Andrzej Dudek, Alan M. Frieze, Wesley Pegden:
A note on the localization number of random graphs: Diameter two case. Discret. Appl. Math. 254: 107-112 (2019) - Michitaka Furuya, Takamasa Yashima:
The existence of f-forests and f-trees in graphs. Discret. Appl. Math. 254: 113-123 (2019) - Ashwin Ganesan:
Fault tolerant supergraphs with automorphisms. Discret. Appl. Math. 254: 274-279 (2019) - Dániel Gerbner, Máté Vizer:
Majority problems of large query size. Discret. Appl. Math. 254: 124-134 (2019) - Majid Hajian, Nader Jafari Rad:
A new lower bound on the double domination number of a graph. Discret. Appl. Math. 254: 280-282 (2019) - Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge:
Computational complexity aspects of point visibility graphs. Discret. Appl. Math. 254: 283-290 (2019) - Jong Yoon Hyun, Hyun Kwang Kim, Minwon Na:
Optimal non-projective linear codes constructed from down-sets. Discret. Appl. Math. 254: 135-145 (2019) - Daniel Jones:
On two-sided Max-Linear equations. Discret. Appl. Math. 254: 146-160 (2019) - Brian G. Kronenthal, Felix Lazebnik, Jason Williford:
On the uniqueness of some girth eight algebraically defined graphs, Part II. Discret. Appl. Math. 254: 161-170 (2019) - Meng Liu, Yusheng Li:
Bipartite Ramsey numbers of paths for random graphs. Discret. Appl. Math. 254: 171-174 (2019) - Mei Lu, Jiale Xu, Yi Zhang:
Identifying codes in the direct product of a complete graph and some special graphs. Discret. Appl. Math. 254: 175-182 (2019) - Ana Silva:
Graphs with small fall-spectrum. Discret. Appl. Math. 254: 183-188 (2019) - Kun Wang, Xiangfeng Pan, Wenjie Ning:
On the signless Laplacian Estrada index of cacti. Discret. Appl. Math. 254: 189-195 (2019) - Jian Wang, Weihua Yang:
The Turán number for spanning linear forests. Discret. Appl. Math. 254: 291-294 (2019) - Haibo Wu, Colton Magnant, Pouria Salehi Nowbandegani, Suman Xia:
All partitions have small parts - Gallai-Ramsey numbers of bipartite graphs. Discret. Appl. Math. 254: 196-203 (2019) - Xiaoling Zhang:
Inertia and distance energy of line graphs of unicyclic graphs. Discret. Appl. Math. 254: 222-233 (2019) - Huihui Zhang, Shuchao Li, Baogen Xu:
Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index. Discret. Appl. Math. 254: 204-221 (2019) - Xiao-Xin Zhao, Tian Tian, Wen-Feng Qi:
An interleaved method for constructing de Bruijn sequences. Discret. Appl. Math. 254: 234-245 (2019) - Zhongxun Zhu, Jia-Bao Liu:
The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes. Discret. Appl. Math. 254: 256-267 (2019) - Enqiang Zhu, Chanjuan Liu:
On the semitotal domination number of line graphs. Discret. Appl. Math. 254: 295-298 (2019) - Jianming Zhu, Ju Yang:
On the minimal matching energies of unicyclic graphs. Discret. Appl. Math. 254: 246-255 (2019)
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-10-07 16:33 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