default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 169
Volume 169, May 2014
- Mehmet Akbulak, Akin Kale, Ahmet Öteles
:
On the connectivity properties and energy of Fibonomial graphs. 1-8 - Micheal Arockiaraj, Jasintha Quadras, Indra Rajasingh, Arul Jeya Shalini:
Embedding of hypercubes into sibling trees. 9-14 - Marie-Pierre Béal, Dominique Perrin:
A quadratic algorithm for road coloring. 15-29 - Daniel Berend, Dolev Pomeranz, Ronen Rabani, Ben Raziel:
Nonograms: Combinatorial questions and algorithms. 30-42 - Alberto Ceselli, Fabio Colombo, Roberto Cordone:
Balanced compact clustering for efficient range queries in metric spaces. 43-67 - Huilan Chang, Yi-Lin Tsai:
Threshold group testing with consecutive positives. 68-72 - Balázs Csanád Csáji, Raphaël M. Jungers, Vincent D. Blondel:
PageRank optimization by edge selection. 73-87 - Min Feng, Kaishun Wang:
Identifying codes of corona product graphs. 88-96 - Elena Fernández, Miguel A. Pozo, Justo Puerto:
Ordered weighted average combinatorial optimization: Formulations and their properties. 97-118 - Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca:
(Circular) backbone colouring: Forest backbones in planar graphs. 119-134 - Teresa W. Haynes, Michael A. Henning:
A characterization of P5-free, diameter-2-critical graphs. 135-139 - Sheng-Long Hu, Liqun Qi:
The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph. 140-151 - Xiaolan Hu, Huiqing Liu, Xiang-Feng Pan:
Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults. 152-161 - K. V. Lakshmy, Madathil Sethumadhavan, Thomas W. Cusick:
Counting rotation symmetric functions using Polya's theorem. 162-167 - Ruijuan Li, Xinhong Zhang, Shengjia Li, Qiaoping Guo, Yubao Guo:
The H-force set of a hypertournament. 168-175 - Shuchao Li, Yibing Song:
On the sum of all distances in bipartite graphs. 176-185 - Takaaki Mizuki, Daizo Mikami, Hideaki Sone:
Minimizing ESCT forms for two-variable multiple-valued input binary output functions. 186-194 - Shariefuddin Pirzada, Mushtaq A. Bhat:
Energy of signed digraphs. 195-205 - Zhongzhi Zhang, Bin Wu, Francesc Comellas:
The number of spanning trees in Apollonian networks. 206-213
- Ashwin Arulselvan:
A note on the set union knapsack problem. 214-218 - Imre Leader, Eoin Long:
Forbidding a set difference of size 1. 219-224 - Kevin Tierney, Dario Pacino, Rune Møller Jensen:
On the complexity of container stowage planning problems. 225-230
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-20 01:07 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
