default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 214
Volume 214, December 2016
- Jorge Rodríguez Veiga
, Guido I. Novoa Flores, Balbina V. Casas Méndez:
Implementing generating functions to obtain power indices with coalition configuration. 1-15 - Xiao Zhao, Wen An Liu:
One pile misère bounded Nim with two alliances. 16-33
- Beate Bollig, Marc Bury:
On the OBDD representation of some graph classes. 34-53 - Domingos M. Cardoso, Vadim V. Lozin, Carlos J. Luz, Maria F. Pacheco:
Efficient domination through eigenvalues. 54-62 - Wai-Fong Chuan, Fang-Yi Liao, Fei Yu:
Markov word patterns and a relation on α-words. 63-87 - Kyungmi Chung, Hyang-Sook Lee, Seongan Lim:
An efficient lattice reduction using reuse technique blockwisely on NTRU. 88-98 - François Dross, Mickaël Montassier, Alexandre Pinlou:
A lower bound on the order of the largest induced forest in planar graphs with high girth. 99-107 - Aaron Dutle, Bill Kay:
Graph odometry. 108-115 - Minh Hai Nguyen, Tran Dang Phuc, Anh Vinh Le:
Existentially closed graphs via permutation polynomials over finite fields. 116-125 - Brijnesh J. Jain:
On the geometry of graph spaces. 126-144 - Minghui Jiang, Yong Zhang:
Kernelization of edge perfect code and its variants. 145-152 - László Mérai:
The cross-correlation measure of families of finite binary sequences: Limiting distributions and minimal values. 153-168 - Shin-ichi Tanigawa, Yutaro Yamaguchi:
Packing non-zero A-paths via matroid matching. 169-178 - Lutz Volkmann:
On the signed total Roman domination and domatic numbers of graphs. 179-186
- David Coudert, Guillaume Ducoffe:
On the hyperbolicity of bipartite graphs and intersection graphs. 187-195 - Michael Gentner, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza:
Extremal values and bounds for the zero forcing number. 196-200 - Tibor Illés, Richárd Molnár-Szipai:
Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems. 201-210 - Matthew P. Yancey:
Coloring the square of a sparse graph G with almost Δ(G) colors. 211-215 - Rujie Zhu, Xiaodong Xu, Stanislaw P. Radziszowski:
A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers R(3, k). 216-221
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 2026-07-02 01:04 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:
