![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
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 23 matches
- 2021
- Micheal Arockiaraj, Jia-Bao Liu
, J. Nancy Delaila
, Arul Jeya Shalini:
On the optimal layout of balanced complete multipartite graphs into grids and tree related structures. Discret. Appl. Math. 288: 50-65 (2021) - Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano
, Tsuyoshi Yagita:
How to pack directed acyclic graphs into small blocks. Discret. Appl. Math. 288: 91-113 (2021) - Theresa Baren, Michael Cory
, Mia Friedberg, Peter Gardner
, James M. Hammer
, Joshua Harrington
, Daniel McGinnis, Riley Waechter, Tony W. H. Wong
:
On the domination number of permutation graphs and an application to strong fixed points. Discret. Appl. Math. 288: 20-34 (2021) - Nicola Bianchessi
, Stefan Irnich
, Christian Tilk
:
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discret. Appl. Math. 288: 152-170 (2021) - Valentin Bouquet
, François Delbot, Christophe Picouleau:
On the vertices belonging to all, some, none minimum dominating set. Discret. Appl. Math. 288: 9-19 (2021) - André Casajus
:
Extension operators for TU games and the Lovász extension. Discret. Appl. Math. 288: 66-73 (2021) - Xuenan Chang, Jicheng Ma, Da-Wei Yang:
Symmetric property and reliability of locally twisted cubes. Discret. Appl. Math. 288: 257-269 (2021) - Sylwia Cichacz
, Tomasz Hinc:
A magic rectangle set on Abelian groups and its application. Discret. Appl. Math. 288: 201-210 (2021) - Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry:
Faster and enhanced inclusion-minimal cograph completion. Discret. Appl. Math. 288: 138-151 (2021) - Gábor Damásdi
, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288: 235-245 (2021) - Kinkar Chandra Das
, Suresh Elumalai
, Arpita Ghosh, Toufik Mansour
:
On conjecture of Merrifield-Simmons index. Discret. Appl. Math. 288: 211-217 (2021) - Yibo Gao
, Rupert Li
:
Compatible recurrent identities of the sandpile group and maximal stable configurations. Discret. Appl. Math. 288: 123-137 (2021) - Ruijuan Gu, Seog-Jin Kim, Yulai Ma
, Yongtang Shi
:
On list 3-dynamic coloring of near-triangulations. Discret. Appl. Math. 288: 87-90 (2021) - Joshua Harrington
, Kedar Karhadkar
, Madeline Kohutka, Tessa Stevens
, Tony W. H. Wong
:
Two dependent probabilistic chip-collecting games. Discret. Appl. Math. 288: 74-86 (2021) - Katrin Heßler
, Stefan Irnich
:
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem. Discret. Appl. Math. 288: 218-234 (2021) - Ping Li
, Xueliang Li:
Monochromatic disconnection of graphs. Discret. Appl. Math. 288: 171-179 (2021) - Pengyu Liu
:
A tree distinguishing polynomial. Discret. Appl. Math. 288: 1-8 (2021) - Pengda Liu
:
On card guessing game with one time riffle shuffle and complete feedback. Discret. Appl. Math. 288: 270-278 (2021) - Muhuo Liu
, Ioan Tomescu, Jianping Liu:
Unified extremal results for k-apex unicyclic graphs (trees). Discret. Appl. Math. 288: 35-49 (2021) - Ivan Martino:
Cooperative games on simplicial complexes. Discret. Appl. Math. 288: 246-256 (2021) - Dávid Mezofi, Gábor Péter Nagy
:
New Steiner 2-designs from old ones by paramodifications. Discret. Appl. Math. 288: 114-122 (2021) - Qiqi Xiao, Mingyao Zeng, Zikai Tang, Hongbo Hua, Hanyuan Deng:
The hexagonal chains with the first three maximal Mostar indices. Discret. Appl. Math. 288: 180-191 (2021) - Xiaojing Yang, Junfeng Du, Liming Xiong:
Forbidden subgraphs for supereulerian and hamiltonian graphs. Discret. Appl. Math. 288: 192-200 (2021)
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-26 15:21 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