default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 255
Volume 255, February 2019
- Kimmo Berg
:
Set-valued games and mixed-strategy equilibria in discounted supergames. 1-14 - Bartlomiej Bosek, Jaroslaw Grytczuk, Gabriel Jakóbczak:
Majority coloring game. 15-20 - Josep Freixas, Bertrand Tchantcho, Bill Proces Tsague:
A parameterization for a class of complete games with abstention. 21-39 - Ekaterina V. Gromova, Taisiia M. Plekhanova:
On the regularization of a cooperative solution in a multistage game with random time horizon. 40-55 - Wen An Liu, Jing Wang, Jia Wei Duan:
One-Pile Nim games with arbitrarily many random players. 56-74 - Trine Tornøe Platz:
On the submodularity of multi-depot traveling salesman games. 75-85
- Gabriela Araujo-Pardo, Fernando Esteban Contreras-Mendoza, Sara J. Murillo-García, Andrea B. Ramos-Tort, Christian Rubio-Montiel:
Complete colorings of planar graphs. 86-97 - Markus Ausserhofer, Susanna Dann, Zsolt Lángi, Géza Tóth:
An algorithm to find maximum area polygons circumscribed about a convex polygon. 98-108 - Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis:
On induced colourful paths in triangle-free graphs. 109-116 - Manish Bansal:
Facets for single module and multi-module capacitated lot-sizing problems without backlogging. 117-141 - Monica Bianchi, José Luis Palacios, Anna Torriero, Ariel Luis Wirkierman:
Kirchhoffian indices for weighted digraphs. 142-154 - Manuela Blaum, Javier Marenco:
Computing the P3-hull number of a graph, a polyhedral approach. 155-166 - Hong Chang, Zhong Huang, Xueliang Li, Yaping Mao, Haixing Zhao:
On conflict-free connection of graphs. 167-182 - Benjamin F. Drews, Pamela E. Harris, Timothy W. Randolph:
Optimal (t, r) broadcasts on the infinite grid. 183-197 - Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen:
Zero forcing in iterated line digraphs. 198-208 - Nicolas Gastineau, Premysl Holub, Olivier Togni:
On the packing chromatic number of subcubic outerplanar graphs. 209-221 - Eszter Gyimesi, Gábor Nyul:
New combinatorial interpretations of r-Whitney and r-Whitney-Lah numbers. 222-233 - Seok-Hee Hong, Hiroshi Nagamochi:
A linear-time algorithm for testing full outer-2-planarity. 234-257 - Benny George Kenkireth, Mrityunjay Singh:
On the minimal alphabet size in multidimensional unrepetitive configurations. 258-266 - Muhuo Liu, Kexiang Xu, Xiao-Dong Zhang:
Extremal graphs for vertex-degree-based invariants with given degree sequences. 267-277 - Phillip Mafuta, Simon Mukwembi, Sheunesu Munyira:
Spanning paths in graphs. 278-282 - Satoko Moriguchi, Kazuo Murota:
Projection and convolution operations for integrally convex functions. 283-298 - Andrzej Zak:
Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs. 299-306 - Martin Zeiner, Manfred Schwarz, Ulrich Schmid:
On linear-time data dissemination in dynamic rooted trees. 307-319 - Lei Zhang, Shiying Wang:
Sufficient conditions for graphs with girth g to be maximally k-restricted edge connected. 320-325 - Petra Zigert Pletersek:
The edge-Wiener index and the edge-hyper-Wiener index of phenylenes. 326-333
- Yumi Kaneda, Joshua D. Laison, Jeffrey Schreiner-McGraw, Colin L. Starr:
Prime power and prime product distance graphs. 334-338 - Hailiang Zhang, Guangting Chen, Guanglong Yu:
On the largest matching roots of graphs with a given number of pendent vertices. 339-344
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 2025-11-28 23:56 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:
