Остановите войну!
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 17 matches
- 2019
- Saúl A. Blanco, Charles Buehrle, Akshay Patidar:
Cycles in the burnt pancake graph. Discret. Appl. Math. 271: 1-14 (2019) - Cafer Çaliskan, Stefko Miklavic, Sibel Özkan:
Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups. Discret. Appl. Math. 271: 15-24 (2019) - Martin E. Dyer, Haiko Müller:
Quasimonotone graphs. Discret. Appl. Math. 271: 25-48 (2019) - Xiaocong He, Shuchao Li, Qin Zhao:
Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices. Discret. Appl. Math. 271: 49-63 (2019) - Hervé Hocquard, Seog-Jin Kim, Théo Pierron:
Coloring squares of graphs with mad constraints. Discret. Appl. Math. 271: 64-73 (2019) - Abidin Kaya, Bahattin Yildiz:
New extremal binary self-dual codes from a Baumert-Hall array. Discret. Appl. Math. 271: 74-83 (2019) - Hamid Reza Maimani, Leila Parsaei Majd:
Nowhere-zero flow on some products of signed graphs. Discret. Appl. Math. 271: 84-92 (2019) - Isabel Méndez-Díaz, Gustavo J. Vulcano, Paula Zabala:
Analysis of a generalized Linear Ordering Problem via integer programming. Discret. Appl. Math. 271: 93-107 (2019) - Usha Mohan, Sivaramakrishnan Ramani, Sounaka Mishra:
A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality. Discret. Appl. Math. 271: 108-118 (2019) - Ishwar Murthy, Sam Ransbotham:
A new extended formulation of the Generalized Assignment Problem and some associated valid inequalities. Discret. Appl. Math. 271: 119-143 (2019) - David Offner, Kerry Ojakian:
Comparing the power of cops to zombies in pursuit-evasion games. Discret. Appl. Math. 271: 144-151 (2019) - Silvia M. C. Pagani, Robert Tijdeman:
Algorithms for linear time reconstruction by discrete tomography. Discret. Appl. Math. 271: 152-170 (2019) - B. S. Panda, Shaily Verma:
On partial Grundy coloring of bipartite graphs and chordal graphs. Discret. Appl. Math. 271: 171-183 (2019) - Zoran Stanic:
On strongly regular signed graphs. Discret. Appl. Math. 271: 184-190 (2019) - Fatih Sulak, Ali Doganaksoy, Muhiddin Uguz, Onur Koçak:
Periodic template tests: A family of statistical randomness tests for a collection of binary sequences. Discret. Appl. Math. 271: 191-204 (2019) - Wei Wei, Shuchao Li:
Extremal phenylene chains with respect to the coefficients sum of the permanental polynomial, the spectral radius, the Hosoya index and the Merrifield-Simmons index. Discret. Appl. Math. 271: 205-217 (2019) - Yuedan Yao, Muhuo Liu, Francesco Belardo, Chao Yang:
Unified extremal results of topological indices and spectral invariants of graphs. Discret. Appl. Math. 271: 218-232 (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-06-08 05: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