default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 250
Volume 250, December 2018
- Vladimir Gurvich, Gleb A. Koshevoy
:
Monotone bargaining is Nash-solvable. 1-15 - Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
Linear read-once and related Boolean functions. 16-27
- Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Game total domination critical graphs. 28-37 - Hoang-Thach Nguyen, Thi Thu Huong Tran:
A maximizing characteristic for critical configurations of chip-firing games on digraphs. 38-46 - Kexiang Xu, Xia Li:
On domination game stable graphs and domination game edge-critical graphs. 47-56
- Hosam Abdo, Darko Dimitrov, Ivan Gutman:
Graphs with maximal σ irregularity. 57-64 - Georgios Amanatidis, Bradley Green, Milena Mihail:
Connected realizations of joint-degree matrices. 65-74 - Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Selecting and covering colored points. 75-86 - Davaatseren Baatar, Matthias Ehrgott, Horst W. Hamacher, Ines M. Raschendorfer:
Minimizing the number of apertures in multileaf collimator sequencing with field splitting. 87-103 - Camino Balbuena, Julián Fresán-Figueroa, Diego González-Moreno, Mika Olsen:
Rainbow connectivity of Moore cages of girth 6. 104-109 - Julien Bensmail, Valentin Garnero, Nicolas Nisse:
On improving matchings in trees, via bounded-length augmentations. 110-129 - Andreas Brandstädt, Vassilis Giakoumakis, Martin Milanic:
Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs. 130-144 - Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios:
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations. 145-164 - Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent-set reconfiguration thresholds of hereditary graph classes. 165-182 - Olivier Durand de Gevigney, Zoltán Szigeti:
On minimally 2-T-connected directed graphs. 183-185 - Pavlos Eirinakis, Dimitrios Magos, Ioannis Mourtos:
The stable b-matching polytope revisited. 186-201 - Grahame Erskine, James Tuite:
Large Cayley graphs of small diameter. 202-214 - Caleb C. Fast, Illya V. Hicks:
Effects of vertex degrees on the zero-forcing number and propagation time of a graph. 215-226 - Ziling Heng:
Nearly optimal codebooks based on generalized Jacobi sums. 227-240 - Michael A. Henning, Gary MacGillivray, Frank Yang:
k-broadcast domination and k-multipacking. 241-251 - Dorit S. Hochbaum:
Complexity and approximations for submodular minimization problems on two variables per inequality constraints. 252-261 - Hongbo Hua, Hongzhuan Wang, Xiaolan Hu:
On eccentric distance sum and degree distance of graphs. 262-275 - Eugen J. Ionascu:
A variation on bisecting the binomial coefficients. 276-284 - Amela Muratovic-Ribic, Enes Pasalic:
On derivatives of planar mappings and their connections to complete mappings. 285-290 - Vida Ravanmehr, Gregory J. Puleo, Sadegh Bolouki, Olgica Milenkovic:
Paired threshold graphs. 291-308 - Dror Rawitz, Ariella Voloshin:
Flexible allocation on related machines with assignment restrictions. 309-321 - Tianfeng Sun, Bin Hu, Junzhi Li, Yang Yang:
Extended framework for constructing (complete) permutations by specifying their coordinate functions. 322-330 - Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters:
A priori TSP in the scenario model. 331-341 - Shuang Zhao, Heping Zhang:
Anti-forcing polynomials for benzenoid systems with forcing edges. 342-356
- Magnus Bordewich, Charles Semple:
A universal tree-based network with the minimum number of reticulations. 357-362 - Randy Davila, Thomas Kalinowski, Sudeep Stephen:
A lower bound on the zero forcing number. 363-367 - Pablo Henrique Perondi, Emerson L. Monte Carmelo:
Set and size multipartite Ramsey numbers for stars. 368-372 - Nader Jafari Rad:
A note on the global offensive alliances in graphs. 373-376
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-12-19 22:14 CET 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:
