Остановите войну!
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 24 matches
- 2021
- Jesmmer Alves, Diane Castonguay, Thomas Brüstle:
Unit form recognition by mutations: Application of mutations in the search of positive roots. Discret. Appl. Math. 291: 223-236 (2021) - Guillaume Bagan, Alice Joffard, Hamamache Kheddouci:
Eternal dominating sets on digraphs and orientations of graphs. Discret. Appl. Math. 291: 99-115 (2021) - Michele Barbato, Dario Bezzi:
Monopolar graphs: Complexity of computing classical graph parameters. Discret. Appl. Math. 291: 277-285 (2021) - Fei-Huang Chang, Ma-Lian Chia, Shih-Ang Jiang, David Kuo, Sheng-Chyang Liaw:
L(p, q)-labelings of subdivisions of graphs. Discret. Appl. Math. 291: 264-270 (2021) - Ho-Won Choi, Hyoungjun Kim, Sungjong No:
The minor minimal intrinsically chiral graphs. Discret. Appl. Math. 291: 237-245 (2021) - Antoine Dailly, Adriana Hansberg, Denae Ventura:
On the balanceability of some graph classes. Discret. Appl. Math. 291: 51-63 (2021) - Guillaume Ducoffe, Alexandru Popa:
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes. Discret. Appl. Math. 291: 201-222 (2021) - Igor Fabrici, Mirko Hornák, Simona Rindosová:
Facial unique-maximum edge and total coloring of plane graphs. Discret. Appl. Math. 291: 171-179 (2021) - Jinping Fan, Hung-Lin Fu, Yujie Gu, Ying Miao, Maiko Shigeno:
Strongly separable matrices for nonadaptive combinatorial group testing. Discret. Appl. Math. 291: 180-187 (2021) - Chunqiu Fang, Ervin Györi, Mei Lu, Jimeng Xiao:
On the anti-Ramsey number of forests. Discret. Appl. Math. 291: 129-142 (2021) - Longfei Fang, Mingqing Zhai, Bing Wang:
Complete subgraphs in connected graphs and its application to spectral moment. Discret. Appl. Math. 291: 36-42 (2021) - Pu Gao, Catherine S. Greenhill:
Mixing time of the switch Markov chain and stable degree sequences. Discret. Appl. Math. 291: 143-162 (2021) - Daniela Gaul, Daniel R. Schmidt:
Chvátal-Gomory cuts for the Steiner tree problem. Discret. Appl. Math. 291: 188-200 (2021) - Reaz Huq, Bogumil Kaminski, Atefeh Mashatan, Pawel Pralat, Przemyslaw Szufel:
On broadcasting time in the model of travelling agents. Discret. Appl. Math. 291: 246-263 (2021) - R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and exact algorithms for class domination coloring. Discret. Appl. Math. 291: 286-299 (2021) - Zequn Lv, Mei Lu:
The terminal-pairability problem in complete bipartite graphs. Discret. Appl. Math. 291: 64-67 (2021) - B. S. Panda, Priyamvada:
Injective coloring of some subclasses of bipartite graphs and chordal graphs. Discret. Appl. Math. 291: 68-87 (2021) - Primoz Potocnik, Gabriel Verret, Stephen E. Wilson:
Base graph-connection graph: Dissection and construction. Discret. Appl. Math. 291: 116-128 (2021) - Noah A. Rosenberg:
On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees. Discret. Appl. Math. 291: 88-98 (2021) - Erel Segal-Halevi:
Fair multi-cake cutting. Discret. Appl. Math. 291: 15-35 (2021) - Zi-Xia Song, Donglei Yang, Fangfang Zhang:
Antimagic orientations of graphs with given independence number. Discret. Appl. Math. 291: 163-170 (2021) - Lang Tang, Shenglin Zhou, Jing Chen, Zhilin Zhang:
Metric dimension and metric independence number of incidence graphs of symmetric designs. Discret. Appl. Math. 291: 43-50 (2021) - Dekel Tsur:
An O∗(2.619k) algorithm for 4-Path Vertex Cover. Discret. Appl. Math. 291: 1-14 (2021) - Han Xiao, Yuanxi Wang, Qizhi Fang:
On the convexity of independent set games. Discret. Appl. Math. 291: 271-276 (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-06-07 06: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