default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 179
Volume 179, December 2014
- Nina Chiarelli, Martin Milanic
:
Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs. 1-12 - Jean-Luc Marichal, Pierre Mathonet:
Influence and interaction indexes for pseudo-Boolean functions: A unified least squares approach. 13-27
- Wen An Liu, Xiao Zhao:
Adjoining to (s, t)-Wythoff's game its P-positions as moves. 28-43 - Steven Minsker:
The Cyclic Towers of Antwerpen problem - A challenging Hanoi variant. 44-53 - Trung Thanh Nguyen, Jörg Rothe:
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods. 54-68
- Paul Dorbec, Ingo Schiermeyer, Elzbieta Sidorowicz, Éric Sopena:
Rainbow connection in oriented graphs. 69-78 - Amine El Sahili, Hamamache Kheddouci, Mekkia Kouider, Maidoun Mortada:
The b-chromatic number and f-chromatic vertex number of regular graphs. 79-85 - Genghua Fan, Jianfeng Hou, Qinghou Zeng:
A bound for judicious k-partitions of graphs. 86-99 - Daniel Granot, Frieda Granot, Harshavardhan Ravichandran:
The k-centrum Chinese Postman delivery problem and a related cost allocation game. 100-108 - Daniel Heldt, Kolja B. Knauer, Torsten Ueckerdt:
On the bend-number of planar and outerplanar graphs. 109-119 - Michael A. Henning, Christian Löwenstein:
An improved lower bound on the independence number of a graph. 120-128 - Sven Herrmann, Vincent Moulton:
Computing the blocks of a quasi-median graph. 129-138 - Premysl Holub, Mirka Miller, Hebert Pérez-Rosés, Joe Ryan:
Degree diameter problem on honeycomb networks. 139-151 - Evangelos Kranakis:
On the event distance of Poisson processes with applications to sensors. 152-162 - Hongliang Lu, David G. L. Wang:
Surface embedding of (n, k)-extendable graphs. 163-173 - Florin Manea, Robert Mercas, Catalin Tiseanu:
An algorithmic toolbox for periodic partial words. 174-192 - Patric R. J. Östergård, Ville H. Pettersson:
On the maximum length of coil-in-the-box codes in dimension 8. 193-200 - Kannan Pattabiraman, M. Vijayaragavan:
Reciprocal degree distance of product graphs. 201-213 - Adriana Roux, Jan H. van Vuuren:
Upper bounds on the balanced 〈r, s〉-domination number of a graph. 214-221
- Patrick Ali, Simon Mukwembi, Peter Dankelmann:
Steiner diameter of 3, 4 and 5-connected maximal planar graphs. 222-228 - Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov:
Strong edge-colouring of sparse planar graphs. 229-234 - John William Hatfield, Fuhito Kojima, Yusuke Narita:
Many-to-many matching with max-min preferences. 235-240 - Michal Lason:
Indicated coloring of matroids. 241-243
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-08 20:20 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:
