default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 213
Volume 213, November 2016
- Shannon L. Fitzpatrick, Jared Howell, Margaret-Ellen Messinger, David A. Pike:
A deterministic version of the game of zombies and survivors on graphs. 1-12 - Nina Galanter
, Dennis Silva Jr., Jonathan T. Rowell, Jan Rychtár:
The Territorial Raider game and graph derangements. 13-16
- Mustapha Aouchiche, Pierre Hansen:
Proximity, remoteness and distance eigenvalues of a graph. 17-25 - József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár:
On the path separation number of graphs. 26-33 - Andreas Bley, Mohsen Rezapour:
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems. 34-46 - Magnus Bordewich, Nihan Tokac:
An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances. 47-59 - Herman Z. Q. Chen, Sergey Kitaev, Brian Yi Sun:
Word-representability of triangulations of grid-covered cylinder graphs. 60-70 - Július Czap, Stanislav Jendrol':
Facial packing edge-coloring of plane graphs. 71-75 - Martin E. Dyer, Leslie Ann Goldberg, David Richerby:
Counting 4×4 matrix partitions of graphs. 76-92 - Petr Gregor, Borut Luzar, Roman Soták:
On incidence coloring conjecture in Cartesian products of graphs. 93-100 - Tony Grubman, Y. Ahmet Sekercioglu, David R. Wood:
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking. 101-113 - Leslie Hogben, Kevin F. Palmowski, David E. Roberson, Michael Young:
Fractional zero forcing via three-color forcing games. 114-129 - Taisuke Izumi:
Improving the lower bound on opaque sets for equilateral triangle. 130-138 - Stasys Jukna:
Lower bounds for monotone counting circuits. 139-152 - Cong X. Kang:
On the fractional strong metric dimension of graphs. 153-161 - Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Deterministic parameterized algorithms for the Graph Motif problem. 162-178 - Bio Mikaila Toko Worou, Jérôme Galtier:
Fast approximation for computing the fractional arboricity and extraction of communities of a graph. 179-195 - An Zhang, Hongjun Wang, Yong Chen, Guangting Chen:
Scheduling jobs with equal processing times and a single server on parallel identical machines. 196-206 - Minjie Zhang, Shuchao Li:
Extremal Halin graphs with respect to the signless Laplacian spectra. 207-218
- Yanmei Hong, Xiaofeng Gu, Hong-Jian Lai, Qinghai Liu:
Fractional spanning tree packing, forest covering and eigenvalues. 219-223 - Nathan Kahl:
On constructing rational spanning tree edge densities. 224-232 - Leihao Lu, Baoyindureng Wu, Zixing Tang:
Proof of a conjecture on the zero forcing number of a graph. 233-237 - Xiuwen Wang, Qizhong Lin:
Multicolor bipartite Ramsey numbers of Kt, s and large Kn, n. 238-242
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-11-26 20:46 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:
