| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
An 8-approximation algorithm for L ( 2 , 1 ) -labeling of unit disk graphs
|
Ono, Hirotaka
|
|
|
341 |
C |
p. 93-101
|
article
|
| 2 |
An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers
|
Marenco, Javier
|
|
|
341 |
C |
p. 180-195
|
article
|
| 3 |
A note on the integrity of grids
|
Żak, Andrzej
|
|
|
341 |
C |
p. 55-59
|
article
|
| 4 |
Approximation algorithm for (connected) Italian dominating function
|
Li, Ke
|
|
|
341 |
C |
p. 169-179
|
article
|
| 5 |
Characterization of random walks on space of unordered trees using efficient metric simulation
|
Ben Naoum, Farah
|
|
|
341 |
C |
p. 290-307
|
article
|
| 6 |
Convexity preserving deformations of digital sets: Characterization of removable and insertable pixels
|
Tarsissi, Lama
|
|
|
341 |
C |
p. 270-289
|
article
|
| 7 |
Defining binary phylogenetic trees using parsimony: New bounds
|
Wilde, Mirko
|
|
|
341 |
C |
p. 257-269
|
article
|
| 8 |
Distributed One-Pass Online AUC Maximization
|
Liu, Xin
|
|
|
341 |
C |
p. 322-336
|
article
|
| 9 |
Edge-treewidth: Algorithmic and combinatorial properties
|
Magne, Loïc
|
|
|
341 |
C |
p. 40-54
|
article
|
| 10 |
Editorial Board
|
|
|
|
341 |
C |
p. ii
|
article
|
| 11 |
Efficient parameterized algorithms for computing all-pairs shortest paths
|
Kratsch, Stefan
|
|
|
341 |
C |
p. 102-119
|
article
|
| 12 |
Enumerating grammar-based extractions
|
Peterfreund, Liat
|
|
|
341 |
C |
p. 372-392
|
article
|
| 13 |
Enumerating numerical sets associated to a numerical semigroup
|
Chen, April
|
|
|
341 |
C |
p. 218-231
|
article
|
| 14 |
Estrada index and subgraph centrality of hypergraphs via tensors
|
Zhou, Hong
|
|
|
341 |
C |
p. 120-129
|
article
|
| 15 |
Extremal graphs for average sizes of maximal matchings
|
Engbers, John
|
|
|
341 |
C |
p. 308-321
|
article
|
| 16 |
Extremal numbers for cycles in a hypercube
|
Axenovich, Maria
|
|
|
341 |
C |
p. 1-3
|
article
|
| 17 |
Flip paths between lattice triangulations
|
Sims, William
|
|
|
341 |
C |
p. 140-163
|
article
|
| 18 |
Group connectivity of graphs satisfying the Chvátal-condition
|
Yang, Na
|
|
|
341 |
C |
p. 212-217
|
article
|
| 19 |
Hamilton-connected claw-free graphs with Ore-degree conditions
|
Liu, Xia
|
|
|
341 |
C |
p. 130-139
|
article
|
| 20 |
Hardness results of global roman domination in graphs
|
Panda, B.S.
|
|
|
341 |
C |
p. 337-348
|
article
|
| 21 |
Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size
|
Guo, Shu-Guang
|
|
|
341 |
C |
p. 204-211
|
article
|
| 22 |
Minimal balanced collections and their application to core stability and other topics of game theory
|
Laplace Mermoud, Dylan
|
|
|
341 |
C |
p. 60-81
|
article
|
| 23 |
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory
|
Gerbner, Dániel
|
|
|
341 |
C |
p. 196-203
|
article
|
| 24 |
Online 2-stage stable matching
|
Bampis, Evripidis
|
|
|
341 |
C |
p. 394-405
|
article
|
| 25 |
On the Gowers U 2 and U 3 norms of Boolean functions and their restriction to hyperplanes
|
Kumar, Vikas
|
|
|
341 |
C |
p. 4-8
|
article
|
| 26 |
Preface: LAGOS’21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil
|
Ferreira, Carlos Eduardo
|
|
|
341 |
C |
p. 393
|
article
|
| 27 |
Reliability analysis of 3-ary n -cube in terms of average degree edge-connectivity
|
Zhang, Qifan
|
|
|
341 |
C |
p. 31-39
|
article
|
| 28 |
Structure connectivity and substructure connectivity of split-star networks
|
Zhao, Lina
|
|
|
341 |
C |
p. 359-371
|
article
|
| 29 |
The circular chromatic number of signed series–parallel graphs of given girth
|
Zhu, Jialu
|
|
|
341 |
C |
p. 82-92
|
article
|
| 30 |
The exponential growth of the packing chromatic number of iterated Mycielskians
|
Bidine, Ez-Zobair
|
|
|
341 |
C |
p. 232-241
|
article
|
| 31 |
The iterative independent model
|
Meger, Erin
|
|
|
341 |
C |
p. 242-256
|
article
|
| 32 |
The 5-puzzle doubly covers the soccer ball
|
Hanaoka, Erika
|
|
|
341 |
C |
p. 164-168
|
article
|
| 33 |
The square density of words having a sequence of FS-double squares
|
Patawar, Maithilee
|
|
|
341 |
C |
p. 349-358
|
article
|
| 34 |
Treelength of series–parallel graphs
|
Dissaux, Thomas
|
|
|
341 |
C |
p. 16-30
|
article
|
| 35 |
Vertex-critical ( P 5 , c h a i r ) -free graphs
|
Huang, Shenwei
|
|
|
341 |
C |
p. 9-15
|
article
|
Journal description