default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 243
Volume 243, July 2018
- Adrien Richard:
Fixed points and connections between positive and negative cycles in Boolean networks. 1-10
- Gustavo Bergantiños
, Alfredo Valencia-Toledo, Juan J. Vidal-Puga:
Hart and Mas-Colell consistency in PERT problems. 11-20 - Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic:
A three-person deterministic graphical game without Nash equilibria. 21-38 - Alda Carvalho, João Pedro Neto, Carlos Pereira dos Santos:
Ordinal sums of impartial games. 39-45 - Hossein Esfandiari, Guy Kortsarz:
A bounded-risk mechanism for the kidney exchange game. 46-53 - Vladimir Gurvich, Nhan Bao Ho:
On tame, pet, domestic, and miserable impartial games. 54-72
- Martin Anthony, Joel Ratsaby:
Large-width bounds for learning half-spaces on distance spaces. 73-89 - Susil Kumar Bishoi, Vashek Matyas:
Investigating results and performance of search and construction algorithms for word-based LFSRs, σ-LFSRs. 90-98 - Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy coloring and its variants. 99-114 - Xiaodan Chen, Guoliang Hao:
Extremal graphs with respect to generalized ABC index. 115-124 - Danila D. Cherkashin, Anatoly Kulikov, Andrei M. Raigorodskii:
On the chromatic numbers of small-dimensional Euclidean spaces. 125-131 - Philippe Chrétienne, Alain Quilliot:
A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines. 132-139 - David Coudert, Guillaume Ducoffe, Nicolas Nisse, Mauricio Soto:
On distance-preserving elimination orderings in graphs: Complexity and algorithms. 140-153 - Robson da Silva, Kelvin Souza de Oliveira, Almir Cunha da Graça Neto:
On a four-parameter generalization of some special sequences. 154-171 - Kinkar Chandra Das, Mustapha Aouchiche, Pierre Hansen:
On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs. 172-185 - Wyatt J. Desormeaux, Teresa W. Haynes, Stephen T. Hedetniemi, Christian Moore:
Distribution centers in graphs. 186-193 - Qi Ding, Heping Zhang, Hui Zhou:
Matching preclusion for n-grid graphs. 194-206 - Pranava K. Jha:
Efficient eight-regular circulants based on the Kronecker product. 207-218 - Kitty Meeks, Andrew Treglown:
On the complexity of finding and counting solution-free sets of integers. 219-238 - Robert Scheidweiler, Sebastian Wiederrecht:
On chordal graph and line graph squares. 239-247 - Elzbieta Sidorowicz, Éric Sopena:
Rainbow connections in digraphs. 248-261 - Huimin Song, Hong-Jian Lai:
Upper bounds of r-hued colorings of planar graphs. 262-269 - Gábor Wiener, Carol T. Zamfirescu:
Gallai's question and constructions of almost hypotraceable graphs. 270-278 - Jun Yue, Hui Lei, Yongtang Shi:
On the generalized Wiener polarity index of trees with a given diameter. 279-285
- Marianna Bolla, Ahmed Elbanna:
Discrepancy minimizing spectral clustering. 286-289 - Kübra Kar, Fatih Yilmaz:
On linear algebra of balance-binomial graphs. 290-296 - Johanna Langner, Henryk A. Witek:
Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of 2×n rectangles. 297-303 - Min Chih Lin, Julián Mestre, Saveliy Vasiliev:
Approximating weighted induced matchings. 304-310
- Néstor E. Aguilera, Ricardo D. Katz, Paola B. Tolomei:
Addendum to "Vertex adjacencies in the set covering polyhedron" [Discrete Appl. Math. 218(2017) 40-56]. 311-315
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-02-28 21:53 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:
