Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 211
Volume 211, October 2016
- Zacharie Alès, Arnaud Knippel, Alexandre Pauchet:
Polyhedral combinatorics of the K-partitioning problem with representative variables. 1-14 - Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos:
Clustering on k-edge-colored graphs. 15-22 - Robert A. Beeler, Teresa W. Haynes, Stephen T. Hedetniemi:
Double Roman domination. 23-29 - Andreas Brandstädt, Konrad K. Dabrowski
, Shenwei Huang, Daniël Paulusma:
Bounding the clique-width of H-free split graphs. 30-39 - Dirk Briskorn, Simon Emde, Nils Boysen:
Cooperative twin-crane scheduling. 40-57 - Alexander Farrugia:
On strongly asymmetric and controllable primitive graphs. 58-67 - Zhen-Bin Gao, Guang-Yi Sun, Sin-Min Lee:
On full friendly index sets of 1-level and 2-levels N-grids. 68-78 - Michael A. Henning, William F. Klostermeyer:
Trees with large m-eternal domination number. 79-85 - Naoise Holohan, Douglas J. Leith, Oliver Mason:
Differentially private response mechanisms on categorical data. 86-98 - Ruo-Wei Hung:
Hamiltonian cycles in linear-convex supergrid graphs. 99-112 - Tiago Januario, Sebastián Urrutia, Dominique de Werra:
Sports scheduling search space connectivity: A riffle shuffle driven approach. 113-120 - Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Orientations of graphs with maximum Wiener index. 121-129 - Shuchao Li, Wei Wei:
Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications. 130-142 - Apurva Mudgal, Supantha Pandit:
Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions. 143-162 - Andrea Munaro:
The VC-dimension of graphs with respect to k-connected subgraphs. 163-174 - Michael D. Plummer, Dong Ye, Xiaoya Zha:
Dominating plane triangulations. 175-182 - Christian Weiß, Sigrid Knust, Natalia V. Shakhlevich, Stefan Waldherr:
The assignment problem with nearly Monge arrays and incompatible partner indices. 183-203
- Abdollah Alimadadi, Mustapha Chellali, Doost Ali Mojdeh:
Liar's dominating sets in graphs. 204-210 - Oren Becker:
Symmetric unique neighbor expanders and good LDPC codes. 211-216 - Qichun Wang, Chik How Tan:
Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences. 217-221
a service of 
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.
last updated on 2024-04-25 04:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
