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
- 2021
- Nastja Cepak:
Infinite classes of generalised complete permutations. Discret. Appl. Math. 302: 24-33 (2021) - Sylwia Cichacz, Karol Suchan:
Minimum k-critical bipartite graphs. Discret. Appl. Math. 302: 54-66 (2021) - Ali Dehghan:
On the in-out-proper orientations of graphs. Discret. Appl. Math. 302: 129-138 (2021) - Sabyasachi Dey, Santanu Sarkar:
A theoretical investigation on the distinguishers of Salsa and ChaCha. Discret. Appl. Math. 302: 147-162 (2021) - Soogang Eoh, Suh-Ryung Kim:
On chordal phylogeny graphs. Discret. Appl. Math. 302: 80-91 (2021) - Xing Feng, Jun Ge:
A conjecture on the lower bound of the signed edge domination number of 2-connected graphs. Discret. Appl. Math. 302: 42-45 (2021) - Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi, Pouyeh Sharifani:
Characterizing extremal graphs for open neighbourhood location-domination. Discret. Appl. Math. 302: 76-79 (2021) - Alan M. Frieze, Tomasz Tkocz:
Shortest paths with a cost constraint: A probabilistic analysis. Discret. Appl. Math. 302: 46-53 (2021) - Dániel Garamvölgyi:
On the global rigidity of tensegrity graphs. Discret. Appl. Math. 302: 114-122 (2021) - Bing-Hau He, Henryk A. Witek:
Enumeration of Clar covers of parallelogram chains. Discret. Appl. Math. 302: 221-233 (2021) - Michael A. Henning, Anders Yeo:
A new upper bound on the total domination number in graphs with minimum degree six. Discret. Appl. Math. 302: 1-7 (2021) - Katharina T. Huber, Vincent Moulton, Andreas Spillner:
Optimal realizations and the block decomposition of a finite metric space. Discret. Appl. Math. 302: 103-113 (2021) - Aleksandar Ilic, Modjtaba Ghorbani, Seyran Azizi, Matthias Dehmer:
On conjectures of network distance measures by using graph spectra. Discret. Appl. Math. 302: 248-255 (2021) - Yisheng Jiang, Mei Lu:
A note on the minimum inverse sum indeg index of cacti. Discret. Appl. Math. 302: 123-128 (2021) - Suyun Jiang, Hao Li, Jin Yan:
Vertex-disjoint stars in K1, r-free graphs. Discret. Appl. Math. 302: 189-197 (2021) - Chol-Un Kim, Kwang-Il Sol:
Degenerate drawing of outerplanar graphs with two edge lengths. Discret. Appl. Math. 302: 178-188 (2021) - Tomohiro Koana, André Nichterlein:
Detecting and enumerating small induced subgraphs in c-closed graphs. Discret. Appl. Math. 302: 198-207 (2021) - Alexandr V. Kostochka, Xujun Liu:
Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs. Discret. Appl. Math. 302: 8-15 (2021) - Wei Li:
On the matching and permanental polynomials of graphs. Discret. Appl. Math. 302: 16-23 (2021) - Jian-Bo Lv, Jianxi Li, Nian Hong Zhou:
List injective edge-coloring of subcubic graphs. Discret. Appl. Math. 302: 163-170 (2021) - Toufik Mansour, Reza Rastegar:
Fixed points of a random restricted growth sequence. Discret. Appl. Math. 302: 171-177 (2021) - Naoki Matsumoto, Yumiko Ohno:
Achromatic number and facial achromatic number of connected locally-connected graphs. Discret. Appl. Math. 302: 34-41 (2021) - Mikhail Moshkov:
Decision trees based on 1-consequences. Discret. Appl. Math. 302: 208-214 (2021) - José Luis Palacios, Greg Markowsky:
Kemeny's constant and Kirchhoffian indices for conjoined highly symmetric graphs. Discret. Appl. Math. 302: 215-220 (2021) - Jan Pavlík:
Representation of graphs by means of generalized metrics. Discret. Appl. Math. 302: 234-247 (2021) - Jothi Rangasamy:
On "Practical and secure outsourcing algorithms for solving quadratic congruences in IoTs" from IEEE IoT journal. Discret. Appl. Math. 302: 139-146 (2021) - Francisco J. Soulignac:
Total 2-domination of proper interval graphs. Discret. Appl. Math. 302: 256-262 (2021) - Zana Kovijanic Vukicevic, Sasa Vujosevic, Goran Popivoda:
Unicyclic graphs with extremal values of arithmetic-geometric index. Discret. Appl. Math. 302: 67-75 (2021) - Wei Yang, Baoyindureng Wu:
Proof of a conjecture on the strong chromatic index of Halin graphs. Discret. Appl. Math. 302: 92-102 (2021)
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-15 18:30 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