 |
Discrete Mathematics & Theoretical Computer Science |
Accepted articles to be published
- An Erdős--Szekeres type result for words with repeats. Kyle Celano ; Abigail Ollson ; Niraj Velankar ; Jun Yan (Accepted on: 2026-05-14)
- Instance complexity of Boolean functions. Alison Hsiang-Hsuan Liu ; Nikhil S. Mande (Accepted on: 2026-05-06)
- Pattern avoidance in compositions and powers of permutations. Kassie Archer ; Noel Bourne (Accepted on: 2026-05-04)
- On the expansion of Hanoi graphs. David Eppstein ; Daniel Frishberg ; William Maxwell (Accepted on: 2026-05-02)
- On Supports for graphs of bounded genus. Rajiv Raman ; Karamjeet Singh (Accepted on: 2026-05-02)
- A Maximum Linear Arrangement Problem on Directed Graphs. Matt DeVos ; Kathryn Nurse (Accepted on: 2026-05-02)
- Inversion Diameter and Treewidth. Yichen Wang ; Haozhe Wang ; Yuxuan Yang ; Mei Lu (Accepted on: 2026-05-01)
- Penney's game for permutations. Sergi Elizalde ; Yixin Lin (Accepted on: 2026-04-30)
- Exact solutions to the Weighted Region Problem. Sarita de Berg ; Guillermo Esteban ; Rodrigo I. Silveira ; Frank Staals (Accepted on: 2026-03-31)
- Finding forest-orderings of tournaments is NP-complete. Pierre Aboulker ; Guillaume Aubian ; Raul Lopes (Accepted on: 2026-03-21)
- Constructing edge-disjoint Steiner trees in Cartesian product networks. Rui Li ; Gregory Gutin ; He Zhang ; Zhao Wang ; Xiaoyan Zhang ; Yaping Mao (Accepted on: 2026-02-12)
- Unfolding Solid Polycubes. Bastien Harismendy ; Tom da Silva ; Gaëlle Largeteau-Skapin ; Éric Andrès (Accepted on: 2026-02-04)