 |
Discrete Mathematics & Theoretical Computer Science |
Accepted articles to be published
- On the Advice Complexity of Online Matching on the Line. Béla Csaba ; Judit Nagy-György (Accepted on: 2024-11-18)
- The Widths of Strict Outerconfluent Graphs. David Eppstein (Accepted on: 2024-11-13)
- 2-distance 4-coloring of planar subcubic graphs with girth at least 21. Hoang La ; Mickael Montassier (Accepted on: 2024-11-01)
- Uniquely hamiltonian graphs for many sets of degrees. Gunnar Brinkmann ; Matthias De Pauw (Accepted on: 2024-09-07)
- On the parameterized complexity of computing tree-partitions. Hans L. Bodlaender ; Carla Groenland ; Hugo Jacob (Accepted on: 2024-07-29)
- Colourings of $(m, n)$-coloured mixed graphs. Gary MacGillivray ; Shahla Nasserasr ; Feiran Yang (Accepted on: 2023-05-22)
- The strong chromatic index of 1-planar graphs. Yiqiao Wang ; Ning Song ; Jianfeng Wang ; Weifan Wang (Accepted on: 2023-03-08)