DMA 2026 Workshop 2026

Program (Tentative)

March 16–18, 2026 · Kunibiki Messe, Matsue, Japan

This is a tentative schedule. Sessions and times are subject to change.

Back to Home

Mar 16 (Mon)

Opening

Time: 3/16 AM 9:00–9:10

  • Somebody . Something

Session 1: Tiling — 3 talks

Time: 3/16 AM 9:10–10:25

  • Ka Ki LI. some results on combinatorial disk tiling by pentagons
  • Haofang Sun. Existence theorem for tiling of the surface by most curvilinear quadrilateral.
  • Min Yan. Tilings of Hyperbolic Surface

Session 2: Graph and other algorithms — 4 talks

Time: 3/16 AM 10:45–12:25

  • Suguru Yamada . Set function maximization with locality over graphs
  • Yutaka Nagai. Arrow-Type Impossibility in Aggregating an Agenda by a Minimal Modal Logic
  • Kevin Mann . Generalized Word-Representable Graphs
  • Akitoshi Kawamura . A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering

Session 3: Graph — 5 talks

Time: 3/16 PM 1:30–3:35

  • Boram Park. On Alon-Tarsi orientations of sparse graphs
  • Kuniharu Yokomura. On degree conditions of semi-balanced 3-partite pancyclic graphs
  • Xiaoteng ZHOU. The Minimum Number of Edges in $(p+1)K_2$-Saturated Graphs
  • Yoshiaki Oda. Some generalized Traveling Salesman Problem on grid clusters
  • Hironori Kiya. The Complexity of Finding a HIST in Chordal Graphs of Diameter 3

Session 4: Colored/Coloring Graph — 4 talks

Time: 3/16 PM 3:00–4:20

  • Shuchao Li. Some Extremal Problems on Color-Critical Graphs
  • Shunsuke Hamada . Minimum Clique Bicoloring
  • Shenggui Zhang. Anti-Ramsey numbers for rainbow triangles and quadrilaterals in arc-colored digraphs
  • Masaki Kashima. Degree-choosability of proper conflict-free coloring

Back to top

Mar 17 (Tue)

Session 5: Algorithms — 4 talks

Time: 3/17 AM 9:00–10:40

  • Robert D. Barish. Arranging pairwise disjoint shapes to partition point sets
  • Moe Moe Oo. Outcome Structure of a Fast-Terminating Variant of Amazons
  • Kan Shota. A Linear Delay Algorithm of Enumerating Strongly-Connected Induced Subgraphs Based on SSD Set System
  • Kenta Komoto. On the Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees

Session 6: Combinatorial Algorithms — 3 talks

Time: 3/17 AM 11:00–12:15

  • Masahiro Hachimori. Computation of the uniform expected value of a rooted graph
  • Petr Lisonek. Uniform mixing in graphs and Hadamard matrices
  • Ferenc Szollosi . Towards new constructions of Butson-Hadamard matrices

Session 7: Combinatorics — 4 talks

Time: 3/17 PM 1:15–2:30

  • Minho Cho. Colorful circuits and colorful topes in oriented matroids
  • Ping Zhan. An egalitarian equivalence in equilibrium distributions under Leontief preferences
  • Yuto Mizunuma . Asymptotic Bounds and Constructions for Inclusively Disjunct Matrices

Excursion — Bus Trip to Izumo Taisha

Time: 3:00–6:00 PM (approx.)

  • Chartered bus to Izumo Taisha (Grand Shrine)
  • Meeting point: Kunibiki Messe (details to be announced)
  • We will return to Matsue in time for the banquet.

Banquet — Yuushien Garden

Time: 6:30–8:30 PM

  • Venue: Yuushien (Daikonshima)
  • Transportation: Group transfer will be arranged (details to be announced)
  • Fees are included in the registration fee. Dietary requests will be accommodated as much as possible.

Back to top

Mar 18 (Wed)

Session 8: Graphs — 4 talks

Time: 3/18 AM 9:00–10:15

  • Javaria Fatima . A study on distance dominating set and pyramid structure in graphs (tentative)
  • Yoshio SANO. On fashion games on graphs on surfaces
  • Hojin Chu. On 2-connected graphs avoiding cycles of length 0 modulo 4

Session 9: Combinatorics — 3 talks

Time: 3/18 AM 10:35–11:50

  • Masato Kobayashi . Schur-positivity and bigraded RSK correspondence
  • LONGRIO C. PLATIL. Partitioning k-fuzzy Gamma Semimodules over Gamma Semirings
  • Mengmeng Liu. The weighted Mostar index

Back to top

Back to Home