Discrete Applied Mathematics, Volume 341

Volume 341, December 2023

Note

• 
  Maria Axenovich:
  Extremal numbers for cycles in a hypercube. 1-3
• 
  Vikas Kumar, Bimal Mandal, Aditi Kar Gangopadhyay:
  On the Gowers U2 and U3 norms of Boolean functions and their restriction to hyperplanes. 4-8

Contribution

• 
  Shenwei Huang, Zeyu Li:
  Vertex-critical (P5,chair)-free graphs. 9-15

Special Issue Paper: LAGOS'21 - Latin and American Algorithms, Graphs, and Optimization Symposium

• 
  Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle:
  Treelength of series-parallel graphs. 16-30

Note

• 
  Qifan Zhang, Shuming Zhou, Hong Zhang:
  Reliability analysis of 3-ary n-cube in terms of average degree edge-connectivity. 31-39

Contribution

• 
  Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos:
  Edge-treewidth: Algorithmic and combinatorial properties. 40-54

Note

• 
  Andrzej Zak:
  A note on the integrity of grids. 55-59

Game Theory

• 
  Dylan Laplace Mermoud, Michel Grabisch, Peter Sudhölter:
  Minimal balanced collections and their application to core stability and other topics of game theory. 60-81

Contribution

• 
  Jialu Zhu, Xuding Zhu:
  The circular chromatic number of signed series-parallel graphs of given girth. 82-92
• 
  Hirotaka Ono, Hisato Yamanaka:
  An 8-approximation algorithm for L(2,1)-labeling of unit disk graphs. 93-101
• 
  Stefan Kratsch, Florian Nelles:
  Efficient parameterized algorithms for computing all-pairs shortest paths. 102-119
• 
  Hong Zhou, Lizhu Sun, Changjiang Bu:
  Estrada index and subgraph centrality of hypergraphs via tensors. 120-129
• 
  Xia Liu, Hong-Jian Lai:
  Hamilton-connected claw-free graphs with Ore-degree conditions. 130-139

Special Issue Paper: Open Problems and Solutions: Rigidity and Distance Geometry

• 
  William Sims, Meera Sitharam:
  Flip paths between lattice triangulations. 140-163

Note

• 
  Erika Hanaoka, Taizo Sadahiro:
  The 5-puzzle doubly covers the soccer ball. 164-168

Contribution

• 
  Ke Li, Zhao Zhang:
  Approximation algorithm for (connected) Italian dominating function. 169-179

Special Issue Paper: Combinatorial Optimization ISCO 2022

• 
  Javier Marenco:
  An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers. 180-195

Contribution

• 
  Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
  On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. 196-203
• 
  Shu-Guang Guo, Rong Zhang:
  Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size. 204-211
• 
  Na Yang, Jian-Hua Yin:
  Group connectivity of graphs satisfying the Chvátal-condition. 212-217
• 
  April Chen, Nathan Kaplan, Liam Lawson, Christopher O'Neill, Deepesh Singhal:
  Enumerating numerical sets associated to a numerical semigroup. 218-231
• 
  Ez-Zobair Bidine, Taoufiq Gadi, Mustapha Kchikech:
  The exponential growth of the packing chromatic number of iterated Mycielskians. 232-241
• 
  Erin Meger, Abigail Raz:
  The iterative independent model. 242-256
• 
  Mirko Wilde, Mareike Fischer:
  Defining binary phylogenetic trees using parsimony: New bounds. 257-269
• 
  Lama Tarsissi, Yukiko Kenmochi, Pascal Romon, David Coeurjolly, Jean-Pierre Borel:
  Convexity preserving deformations of digital sets: Characterization of removable and insertable pixels. 270-289
• 
  Farah Ben-Naoum, Christophe Godin, Romain Azaïs:
  Characterization of random walks on space of unordered trees using efficient metric simulation. 290-307
• 
  John Engbers, Aysel Erey:
  Extremal graphs for average sizes of maximal matchings. 308-321

Special Issue Paper: Algorithms and Discrete Applied Mathematics (CALDAM 2021)

• 
  Xin Liu, Yu Pan, Yu Ding, Zhisong Pan:
  Distributed One-Pass Online AUC Maximization. 322-336
• 
  B. S. Panda, Pooja Goyal:
  Hardness results of global roman domination in graphs. 337-348
• 
  Maithilee Patawar, Kalpesh Kapoor:
  The square density of words having a sequence of FS-double squares. 349-358

Contribution

• 
  Lina Zhao, Shiying Wang:
  Structure connectivity and substructure connectivity of split-star networks. 359-371

Special Issue Paper: Special Issue for WEPA 2020: Enumeration Problems and Applications

• 
  Liat Peterfreund:
  Enumerating grammar-based extractions. 372-392

Special Issue Paper: LAGOS'21 - Latin and American Algorithms, Graphs, and Optimization Symposium

• 
  Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Orlando Lee:
  Preface: LAGOS'21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil. 393

Special Issue Paper: Combinatorial Optimization ISCO 2022

• 
  Evripidis Bampis, Bruno Escoffier, Paul Youssef:
  Online 2-stage stable matching. 394-405