Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 167
Volume 167, April 2014
- Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer, Andreas Wotzlaw:
XSAT and NAE-SAT of linear CNF classes. 1-14 - Tamon Stephen, Timothy Yusun
:
Counting inequivalent monotone Boolean functions. 15-24 - Qichun Wang, Chik How Tan:
Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity. 25-32
- Carlos A. Alfaro, Carlos E. Valencia:
Graphs with two trivial critical ideals. 33-44 - Yuehua Bu, Stephen Finbow, Daphne Der-Fen Liu, Xuding Zhu:
List backbone colouring of graphs. 45-51 - Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio, Ana Silva:
Fixed-parameter algorithms for the cocoloring problem. 52-60 - Ting-Pang Chang, Li-Da Tong:
Choice identification of a graph. 61-71 - Peter Dankelmann, Simon Mukwembi:
Upper bounds on the average eccentricity. 72-79 - Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar:
Book drawings of complete bipartite graphs. 80-93 - Magda Dettlaff, Magdalena Lemanska, Ismael González Yero:
Bondage number of grid graphs. 94-99 - Jan Ekstein, Premysl Holub, Olivier Togni:
The packing coloring of distance graphs D(k, t). 100-106 - Petr A. Golovach, Daniël Paulusma, Jian Song:
Coloring graphs without short cycles and long induced paths. 107-120 - Flavio Guiñez:
A formulation of the wide partition conjecture using the atom problem in discrete tomography. 121-130 - Vladimir Gurvich, Vladimir Oudalov:
On Nash-solvability in pure stationary strategies of the deterministic n-person games with perfect information and mean or total effective cost. 131-143 - Daniel Heldt, Kolja B. Knauer, Torsten Ueckerdt:
Edge-intersection graphs of grid paths: The bend-number. 144-162 - Lih-Hsing Hsu, Tung-Yang Ho, Yen-Hsun Ho, Chey-Woei Tsay:
Cycles in cube-connected cycles graphs. 163-171 - Hark-Chin Hwang, Kyungkuk Lim:
Exact performance of MULTIFIT for nonsimultaneous machines. 172-187 - Suat Karadeniz, Steven T. Dougherty, Bahattin Yildiz:
Constructing formally self-dual codes over Rk. 188-196 - Martin Knor, Primoz Potocnik, Riste Skrekovski:
Relationship between the edge-Wiener index and the Gutman index of a graph. 197-201 - Tae-Eog Lee, Seong-Ho Park, Chihyun Jung:
Steady state analysis of timed event graphs with time window constraints. 202-216 - Muhuo Liu, Bolian Liu:
The second Zagreb indices of unicyclic graphs with given degree sequences. 217-221 - Jana Maxová, Miroslava Dubcová, Pavla Pavlíková, Daniel Turzík:
Which k-trees are cover-incomparability graphs? 222-227 - Yahav Nussbaum:
Recognition of probe proper interval graphs. 228-238 - Nabil Shalaby, Daniela Silvesan:
The intersection spectrum of hooked Skolem sequences and applications. 239-260 - Guifu Su, Liming Xiong, Xiaofeng Su:
Maximally edge-connected graphs and Zeroth-order general Randić index for 0<α<1. 261-268 - Tibor Szkaliczki, Michael Eberhard, Hermann Hellwagner, László Szobonya:
Piece selection algorithms for layered video streaming in P2P networks. 269-279 - Olivier Togni:
On packing colorings of distance graphs. 280-289 - Tao Wang, Yaqiong Zhang:
Acyclic edge coloring of graphs. 290-303 - Weihua Yang, Yingzhi Tian, Hengzhe Li, Hao Li, Xiaofeng Guo:
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree. 304-309
- Kathy J. Horadam, M. A. Nyblom:
Distances between sets based on set commonality. 310-314
- Rafael Ördög, Dániel Bánky, Balázs Szerencsi, Péter Juhász, Vince Grolmusz:
The Erdős webgraph server. 315-317
a service of 
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-04-17 21:31 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:
