default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 166
Volume 166, March 2014
Special Section: Game Theory
- David Avis, Kazuo Iwama, Daichi Paku:
Reputation games for undirected graphs. 1-13 - Lindsey Brown, Hoang Ha, Jonathan K. Hodge
:
Single-peaked preferences over multidimensional binary alternatives. 14-25 - Takuya Iimura, Takahiro Watanabe:
Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave. 26-33 - Anna B. Khmelnitskaya:
Values for games with two-level communication structures. 34-50
- Yves Aubry, Jean-Christophe Godin, Olivier Togni:
Every triangle-free induced subgraph of the triangular lattice is (5m, 2m)-choosable. 51-58 - Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei:
Some advances on the set covering polyhedron of circulant matrices. 59-70 - Wai-Fong Chuan, Fang-Yi Liao:
The D-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words. 71-83 - Aijun Dong, Guanghui Wang, Jianghua Zhang:
Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree. 84-90 - Tomás Feder, Pavol Hell, Oren Shklarsky:
Matrix partitions of split graphs. 91-96 - Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse:
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics. 97-114 - Shinya Fujita, Michitaka Furuya:
Rainbow domination numbers on graphs with given radius. 115-122 - Petr A. Golovach, Daniël Paulusma:
List coloring in the absence of two subgraphs. 123-130 - Robert Janczewski, Anna Malafiejska, Michal Malafiejski:
Interval incidence coloring of bipartite graphs. 131-140 - Pranava K. Jha:
Dense bipartite circulants and their routing via rectangular twisted torus. 141-158 - Bo-Jr Li, Gerard Jennhwa Chang:
Dot product dimensions of graphs. 159-163 - Kenji Mikawa, Ken Tanaka:
Lexicographic ranking and unranking of derangements in cycle notation. 164-169 - Chihoko Ojima, Akira Saito, Kazuki Sano:
Precoloring extension involving pairs of vertices of small distance. 170-177 - Jeffrey Pattillo, Yiming Wang, Sergiy Butenko:
Approximating 2-cliques in unit disk graphs. 178-187 - Justo Puerto, Federica Ricca, Andrea Scozzari:
Unreliable point facility location problems on networks. 188-203 - Juan Alberto Rodríguez-Velázquez, Ismael González Yero, Magdalena Lemanska:
On the partition dimension of trees. 204-209 - Vladimir R. Rosenfeld, Douglas J. Klein:
An infinite family of graphs with a facile count of perfect matchings. 210-214 - Zoran Stanic:
Further results on controllable graphs. 215-221 - Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao:
Some results on Lagrangians of hypergraphs. 222-238 - Heping Zhang, Dewu Yang, Haiyuan Yao:
Decomposition theorem on matchable distributive lattices. 239-248
- Kazuyuki Amano:
Some improved bounds on communication complexity via new decomposition of cliques. 249-254 - Wayne Goddard, Honghai Xu:
A note on S-packing colorings of lattices. 255-262 - Csaba Király:
Algorithms for finding a rooted (k, 1)-edge-connected orientation. 263-268 - Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Computing distance moments on graphs with transitive Djoković-Winkler relation. 269-272 - Gholam Hassan Shirdel, B. Vaez-Zadeh:
A note on "Tenacity of a graph with maximum connectivity". 273-275 - Long Wang, Dein Wong:
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank. 276-281 - Qiang Zhu, Wenliang Tang, Cun-Quan Zhang:
Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture. 282-286
- Saad Alrawaf, Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Diagnosis of constant faults in iteration-free circuits over monotone basis. 287-291
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-08-18 00:01 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.
