Остановите войну!
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 32 matches
- 2014
- Saad Alrawaf, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Diagnosis of constant faults in iteration-free circuits over monotone basis. Discret. Appl. Math. 166: 287-291 (2014) - Kazuyuki Amano:
Some improved bounds on communication complexity via new decomposition of cliques. Discret. Appl. Math. 166: 249-254 (2014) - Yves Aubry, Jean-Christophe Godin, Olivier Togni:
Every triangle-free induced subgraph of the triangular lattice is (5m, 2m)-choosable. Discret. Appl. Math. 166: 51-58 (2014) - David Avis, Kazuo Iwama, Daichi Paku:
Reputation games for undirected graphs. Discret. Appl. Math. 166: 1-13 (2014) - Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei:
Some advances on the set covering polyhedron of circulant matrices. Discret. Appl. Math. 166: 59-70 (2014) - Lindsey Brown, Hoang Ha, Jonathan K. Hodge:
Single-peaked preferences over multidimensional binary alternatives. Discret. Appl. Math. 166: 14-25 (2014) - Wai-Fong Chuan, Fang-Yi Liao:
The D-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words. Discret. Appl. Math. 166: 71-83 (2014) - Aijun Dong, Guanghui Wang, Jianghua Zhang:
Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree. Discret. Appl. Math. 166: 84-90 (2014) - Tomás Feder, Pavol Hell, Oren Shklarsky:
Matrix partitions of split graphs. Discret. Appl. Math. 166: 91-96 (2014) - Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse:
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics. Discret. Appl. Math. 166: 97-114 (2014) - Shinya Fujita, Michitaka Furuya:
Rainbow domination numbers on graphs with given radius. Discret. Appl. Math. 166: 115-122 (2014) - Wayne Goddard, Honghai Xu:
A note on S-packing colorings of lattices. Discret. Appl. Math. 166: 255-262 (2014) - Petr A. Golovach, Daniël Paulusma:
List coloring in the absence of two subgraphs. Discret. Appl. Math. 166: 123-130 (2014) - Takuya Iimura, Takahiro Watanabe:
Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave. Discret. Appl. Math. 166: 26-33 (2014) - Robert Janczewski, Anna Malafiejska, Michal Malafiejski:
Interval incidence coloring of bipartite graphs. Discret. Appl. Math. 166: 131-140 (2014) - Pranava K. Jha:
Dense bipartite circulants and their routing via rectangular twisted torus. Discret. Appl. Math. 166: 141-158 (2014) - Anna B. Khmelnitskaya:
Values for games with two-level communication structures. Discret. Appl. Math. 166: 34-50 (2014) - Csaba Király:
Algorithms for finding a rooted (k, 1)-edge-connected orientation. Discret. Appl. Math. 166: 263-268 (2014) - Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Computing distance moments on graphs with transitive Djoković-Winkler relation. Discret. Appl. Math. 166: 269-272 (2014) - Bo-Jr Li, Gerard Jennhwa Chang:
Dot product dimensions of graphs. Discret. Appl. Math. 166: 159-163 (2014) - Kenji Mikawa, Ken Tanaka:
Lexicographic ranking and unranking of derangements in cycle notation. Discret. Appl. Math. 166: 164-169 (2014) - Chihoko Ojima, Akira Saito, Kazuki Sano:
Precoloring extension involving pairs of vertices of small distance. Discret. Appl. Math. 166: 170-177 (2014) - Jeffrey Pattillo, Yiming Wang, Sergiy Butenko:
Approximating 2-cliques in unit disk graphs. Discret. Appl. Math. 166: 178-187 (2014) - Justo Puerto, Federica Ricca, Andrea Scozzari:
Unreliable point facility location problems on networks. Discret. Appl. Math. 166: 188-203 (2014) - Juan Alberto Rodríguez-Velázquez, Ismael González Yero, Magdalena Lemanska:
On the partition dimension of trees. Discret. Appl. Math. 166: 204-209 (2014) - Vladimir R. Rosenfeld, Douglas J. Klein:
An infinite family of graphs with a facile count of perfect matchings. Discret. Appl. Math. 166: 210-214 (2014) - Gholam Hassan Shirdel, B. Vaez-Zadeh:
A note on "Tenacity of a graph with maximum connectivity". Discret. Appl. Math. 166: 273-275 (2014) - Zoran Stanic:
Further results on controllable graphs. Discret. Appl. Math. 166: 215-221 (2014) - Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao:
Some results on Lagrangians of hypergraphs. Discret. Appl. Math. 166: 222-238 (2014) - Long Wang, Dein Wong:
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank. Discret. Appl. Math. 166: 276-281 (2014)
skipping 2 more matches
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-05-28 04: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