| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Alternative formulations for the obnoxious p-median problem
|
Lin, Chang-Chun
|
|
|
289 |
C |
p. 366-373
|
article
|
| 2 |
A note on k -metric dimensional graphs
|
Corregidor, Samuel G.
|
|
|
289 |
C |
p. 523-533
|
article
|
| 3 |
A note on M-convex functions on jump systems
|
Murota, Kazuo
|
|
|
289 |
C |
p. 492-502
|
article
|
| 4 |
A note on 1-planar graphs with minimum degree 7
|
Biedl, Therese
|
|
|
289 |
C |
p. 230-232
|
article
|
| 5 |
A note on the diameter of convex polytope
|
Yang, Yaguang
|
|
|
289 |
C |
p. 534-538
|
article
|
| 6 |
Approximability of the dispersed p → -neighbor k -supplier problem
|
van Ee, Martijn
|
|
|
289 |
C |
p. 219-229
|
article
|
| 7 |
Approximation algorithms for some position-dependent scheduling problems
|
Yang, Liya
|
|
|
289 |
C |
p. 22-31
|
article
|
| 8 |
A single shuffle is enough for secure card-based computation of any Boolean circuit
|
Shinagawa, Kazumasa
|
|
|
289 |
C |
p. 248-261
|
article
|
| 9 |
Automatic complexity of Fibonacci and Tribonacci words
|
Kjos-Hanssen, Bjørn
|
|
|
289 |
C |
p. 446-454
|
article
|
| 10 |
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
|
Casablanca, Rocío M.
|
|
|
289 |
C |
p. 233-247
|
article
|
| 11 |
Constructing new families of transmission irregular graphs
|
Xu, Kexiang
|
|
|
289 |
C |
p. 383-391
|
article
|
| 12 |
Edge disjoint caterpillar realizations
|
Miklós, István
|
|
|
289 |
C |
p. 327-344
|
article
|
| 13 |
Editorial Board
|
|
|
|
289 |
C |
p. ii
|
article
|
| 14 |
Eulerian orientations and vertex-connectivity
|
Hörsch, Florian
|
|
|
289 |
C |
p. 115-124
|
article
|
| 15 |
Extensions of the combinatorial game ( K , t ) -Wythoff
|
Li, Haiyan
|
|
|
289 |
C |
p. 52-63
|
article
|
| 16 |
Extremal problems on distance spectra of graphs
|
Lin, Huiqiu
|
|
|
289 |
C |
p. 139-147
|
article
|
| 17 |
Greedy balanced pairs in N -free ordered sets
|
Zaguia, Imed
|
|
|
289 |
C |
p. 539-544
|
article
|
| 18 |
Indicated coloring game on Cartesian products of graphs
|
Brešar, Boštjan
|
|
|
289 |
C |
p. 320-326
|
article
|
| 19 |
Inequalities between the K k -isolation number and the independent K k -isolation number of a graph
|
Favaron, Odile
|
|
|
289 |
C |
p. 93-97
|
article
|
| 20 |
Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem
|
Puerto, Justo
|
|
|
289 |
C |
p. 78-92
|
article
|
| 21 |
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
|
Javadi, Ramin
|
|
|
289 |
C |
p. 281-291
|
article
|
| 22 |
New bounds for perfect k -hashing
|
Costa, Simone
|
|
|
289 |
C |
p. 374-382
|
article
|
| 23 |
On flips in planar matchings
|
Milich, Marcel
|
|
|
289 |
C |
p. 427-445
|
article
|
| 24 |
On minimizing the maximum color for the 1–2–3 Conjecture
|
Bensmail, Julien
|
|
|
289 |
C |
p. 32-51
|
article
|
| 25 |
On rectangle intersection graphs with stab number at most two
|
Chakraborty, Dibyayan
|
|
|
289 |
C |
p. 354-365
|
article
|
| 26 |
On the independent domination polynomial of a graph
|
Jahari, Somayeh
|
|
|
289 |
C |
p. 416-426
|
article
|
| 27 |
On the packing chromatic number of Moore graphs
|
Fresán-Figueroa, J.
|
|
|
289 |
C |
p. 185-193
|
article
|
| 28 |
On the star decomposition of a graph: Hardness results and approximation for the max–min optimization problem
|
Cicalese, Ferdinando
|
|
|
289 |
C |
p. 503-515
|
article
|
| 29 |
Optimal strategies for selecting coordinators
|
Zeiner, Martin
|
|
|
289 |
C |
p. 392-415
|
article
|
| 30 |
Packing a number of copies of a ( p , q ) -graph
|
Wang, Yun
|
|
|
289 |
C |
p. 302-312
|
article
|
| 31 |
Packing of maximal independent mixed arborescences
|
Gao, Hui
|
|
|
289 |
C |
p. 313-319
|
article
|
| 32 |
Perfect state transfer in NEPS of complete graphs
|
Li, Yipeng
|
|
|
289 |
C |
p. 98-114
|
article
|
| 33 |
Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
|
Pei, Lidan
|
|
|
289 |
C |
p. 292-301
|
article
|
| 34 |
Proving the conjecture of O’Donnell in certain cases and disproving its general validity
|
Kudin, S.
|
|
|
289 |
C |
p. 345-353
|
article
|
| 35 |
Reliability measure of multiprocessor system based on enhanced hypercubes
|
Xu, Liqiong
|
|
|
289 |
C |
p. 125-138
|
article
|
| 36 |
Some sum–product type estimates for two-variables over prime fields
|
Tran, Phuc D.
|
|
|
289 |
C |
p. 1-11
|
article
|
| 37 |
Spiders everywhere
|
Wiener, Gábor
|
|
|
289 |
C |
p. 516-522
|
article
|
| 38 |
The generalized 4-connectivity of hierarchical cubic networks
|
Zhao, Shu-Li
|
|
|
289 |
C |
p. 194-206
|
article
|
| 39 |
The max-flow min-cut property and ± 1 -resistant sets
|
Abdi, Ahmad
|
|
|
289 |
C |
p. 455-476
|
article
|
| 40 |
The Multi-Spreader Crane Scheduling Problem: Partitions and supersequences
|
Cheng, Christine T.
|
|
|
289 |
C |
p. 207-218
|
article
|
| 41 |
The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions
|
Chen, Xi
|
|
|
289 |
C |
p. 477-491
|
article
|
| 42 |
The ( t , r ) broadcast domination number of some regular graphs
|
Herrman, Rebekah
|
|
|
289 |
C |
p. 270-280
|
article
|
| 43 |
Torus-like graphs and their paired many-to-many disjoint path covers
|
Park, Jung-Heum
|
|
|
289 |
C |
p. 64-77
|
article
|
| 44 |
Tropical Kirchhoff’s formula and postoptimality in matroid optimization
|
Jukna, Stasys
|
|
|
289 |
C |
p. 12-21
|
article
|
| 45 |
Tutte’s dichromate for signed graphs
|
Goodall, Andrew
|
|
|
289 |
C |
p. 153-184
|
article
|
| 46 |
Upper bounds on the global offensive alliances in graphs
|
Rad, Nader Jafari
|
|
|
289 |
C |
p. 148-152
|
article
|
| 47 |
Wiener index of quadrangulation graphs
|
Győri, Ervin
|
|
|
289 |
C |
p. 262-269
|
article
|
| 48 |
Zombie number of the Cartesian product of graphs
|
Keramatipour, Ali
|
|
|
289 |
C |
p. 545-549
|
article
|
Journal description