A Group Testing Problem. - Gerard J. Chang; Frank K. Hwang (SIAM J. Algebraic Discret. Methods, 1980)

Group testing with two defectives. - Gerard J. Chang; Frank K. Hwang; Shen Lin 005 (Discret. Appl. Math., 1982)

R-domination on block graphs. - Gerard J. Chang; George L. Nemhauser (Oper. Res. Lett., 1982)

Diagonal and Pandiagonal Tournament Latin Squares. - Gerard J. Chang; Frank K. Hwang (Eur. J. Comb., 1985)

Labeling algorithms for domination problems in sun-free chordal graphs. - Gerard J. Chang (Discret. Appl. Math., 1988)

On the Number of SDR of a (t, n)-family. - Gerard J. Chang (Eur. J. Comb., 1989)

An upper bound for the transversal numbers of 4-uniform hypergraphs. - Feng-Chu Lai; Gerard J. Chang (J. Comb. Theory B, 1990)

The Domatic Number Problem in Interval Graphs. - Tung-Lin Lu; Pei-Hsin Ho; Gerard J. Chang (SIAM J. Discret. Math., 1990)

Centers of chordal graphs. - Gerard J. Chang (Graphs Comb., 1991)

Set to Set Broadcasting in Communication Networks. - Hsun-Ming Lee; Gerard J. Chang (Discret. Appl. Math., 1992)

Algorithmic Aspects of Neighborhood Numbers. - Gerard J. Chang; Martin Farber; Zsolt Tuza (SIAM J. Discret. Math., 1993)

The domatic number problem. - Gerard J. Chang (Discret. Math., 1994)

Edge domatic numbers of complete n- partite graphs. - Shiow-Fen Hwang; Gerard J. Chang (Graphs Comb., 1994)

The Path-Partition Problem in Block Graphs. - Jing-Ho Yan; Gerard J. Chang (Inf. Process. Lett., 1994)

The w-median of a connected strongly chordal graph. - Hai-Yen Lee; Gerard J. Chang (J. Graph Theory, 1994)

The Profile Minimization Problem in Trees. - David Kuo; Gerard J. Chang (SIAM J. Comput., 1994)

Weighted Independent Perfect Domination on Cocomparability Graphs. - Gerard J. Chang; C. Pandu Rangan; Satyan R. Coorg (Discret. Appl. Math., 1995)

The edge domination problem. - Gerard J. Chang; Shiow-Fen Hwang (Discuss. Math. Graph Theory, 1995)

Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs. - Maw-Shang Chang; Yi-Hua Chen; Gerard J. Chang; Jing-Ho Yan (Discret. Appl. Math., 1996)

Quasi-threshold Graphs. - Jing-Ho Yan; Jer-Jeong Chen; Gerard J. Chang (Discret. Appl. Math., 1996)

The partial gossiping problem. - Gerard J. Chang; Yuh-Jiuan Tsay (Discret. Math., 1996)

A finiteness theorem for maximal independent sets. - Min-Jen Jou; Gerard J. Chang; Chiang Lin; Tze-Heng Ma (Graphs Comb., 1996)

The L(2, 1)-Labeling Problem on Graphs. - Gerard J. Chang; David Kuo (SIAM J. Discret. Math., 1996)

The ß-assignment problem in general graphs. - Gerard J. Chang; Pei-Hsin Ho (Comput. Oper. Res., 1997)

Maximal Independent Sets in Graphs with at Most One Cycle. - Min-Jen Jou; Gerard J. Chang (Discret. Appl. Math., 1997)

k-Path Partitions in Trees. - Jing-Ho Yan; Gerard J. Chang; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi (Discret. Appl. Math., 1997)

Proper interval graphs and the guard problem. - Chiuyuan Chen; Chin-Chen Chang 001; Gerard J. Chang (Discret. Math., 1997)

Cordial labeling of mKn. - David Kuo; Gerard J. Chang; Y. H. Harris Kwong (Discret. Math., 1997)

The exact gossiping problem. - Yuh-Jiuan Tsay; Gerard J. Chang (Discret. Math., 1997)

Signed degree sequences of signed graphs. - Jing-Ho Yan; Ko-Wei Lih; David Kuo; Gerard J. Chang (J. Graph Theory, 1997)

Optimality of consecutive and nested tree partitions. - Gerard J. Chang; Frank K. Hwang (Networks, 1997)

The Vertex-Disjoint Triangles Problem. - Venkatesan Guruswami; C. Pandu Rangan; Maw-Shang Chang; Gerard J. Chang; C. K. Wong (WG, 1998)

Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs. - Hong-Gwa Yeh; Gerard J. Chang (Discret. Appl. Math., 1998)

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs. - Gerard J. Chang; Lingling Huang; Xuding Zhu (Eur. J. Comb., 1998)

Enumerating Consecutive and Nested Partitions for Graphs. - Frank K. Hwang; Gerard J. Chang (Eur. J. Comb., 1998)

Sortabilities of Partition Properties. - Gerard J. Chang; Fu-Loong Chen; Lingling Huang; Frank K. Hwang; Su-Tzu Nuan; Uriel G. Rothblum; I-Fan Sun; Jan-Wen Wang; Hong-Gwa Yeh (J. Comb. Optim., 1998)

Localizing Combinatorial Properties for Partitions on Block Graphs. - Gerard J. Chang; Frank K. Hwang; Yi-Ching Yao (J. Comb. Optim., 1998)

Generalized Diameters and Rabin Numbers of Networks. - Sheng-Chyang Liaw; Gerard J. Chang (J. Comb. Optim., 1998)

k-Neighborhood-Covering and -Independence Problems for Chordal Graphs. - Shiow-Fen Hwang; Gerard J. Chang (SIAM J. Discret. Math., 1998)

Integral Sum Numbers of Graphs. - Sheng-Chyang Liaw; David Kuo; Gerard J. Chang (Ars Comb., 1999)

Characterizations of bipartite Steinhaus graphs. - Gerard J. Chang; Bhaskar DasGupta; Wayne M. Dymàcek; Martin Fürer; Matthew Koerlin; Yueh-Shin Lee; Tom P. Whaley (Discret. Math., 1999)

Circular chromatic numbers of Mycielski's graphs. - Gerard J. Chang; Lingling Huang; Xuding Zhu (Discret. Math., 1999)

The number of maximal independent sets in connected triangle-free graphs. - Gerard J. Chang; Min-Jen Jou (Discret. Math., 1999)

Rabin numbers of Butterfly networks. - Sheng-Chyang Liaw; Gerard J. Chang (Discret. Math., 1999)

T-Colorings and T-Edge Spans of Graphs. - Shin-Jie Hu; Justie Su-tzu Juan; Gerard J. Chang (Graphs Comb., 1999)

Distance Graphs and T-Coloring. - Gerard J. Chang; Daphne Der-Fen Liu; Xuding Zhu (J. Comb. Theory B, 1999)

The consecutive-4 digraphs are Hamiltonian. - Gerard J. Chang; Frank K. Hwang; Li-Da Tong (J. Graph Theory, 1999)

The circular chromatic number of the Mycielskian of G. - Lingling Huang; Gerard J. Chang (J. Graph Theory, 1999)

On k-ary spanning trees of tournaments. - Xiaoyun Lu; Da-Wei Wang; Gerard J. Chang; In-Jen Lin; C. K. Wong (J. Graph Theory, 1999)

Characterizing bit permutation networks. - Gerard J. Chang; Frank K. Hwang; Li-Da Tong (Networks, 1999)

Linear k-arboricities on trees. - Gerard J. Chang; Bor-Liang Chen; Hung-Lin Fu; Kuo-Ching Huang (Discret. Appl. Math., 2000)

Pseudo-Hamiltonian-connected graphs. - Gerard J. Chang; Xuding Zhu (Discret. Appl. Math., 2000)

On L(d, 1)-labelings of graphs. - Gerard J. Chang; Wen-Tsai Ke; David Kuo; Daphne Der-Fen Liu; Roger K. Yeh (Discret. Math., 2000)

Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples. - Lingling Huang; Gerard J. Chang (Eur. J. Comb., 2000)

No-hole 2-distant colorings for unit interval graphs. - Gerard J. Chang; Justie Su-tzu Juan; Daphne Der-Fen Liu (Ars Comb., 2001)

The Kr-Packing Problem. - Venkatesan Guruswami; C. Pandu Rangan; Maw-Shang Chang; Gerard J. Chang; C. K. Wong (Computing, 2001)

Families of Graphs Closed Under Taking Powers. - Mingjang Chen; Gerard J. Chang (Graphs Comb., 2001)

Minimum Span of No-Hole (r+1)-Distant Colorings. - Gerard J. Chang; Justie Su-tzu Juan; Daphne Der-Fen Liu (SIAM J. Discret. Math., 2001)

Preface. - Gerard J. Chang; Michel Deza; Yannis Manoussakis; Jean-Marc Steyaert (Theor. Comput. Sci., 2001)

Channel graphs of bit permutation networks. - Li-Da Tong; Frank K. Hwang; Gerard J. Chang (Theor. Comput. Sci., 2001)

Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs. - Hong-Gwa Yeh; Gerard J. Chang (Theor. Comput. Sci., 2001)

Algorithmic aspects of counting independent sets. - Min-Jen Jou; Gerard J. Chang (Ars Comb., 2002)

k-Subdomination in graphs. - Gerard J. Chang; Sheng-Chyang Liaw; Hong-Gwa Yeh (Discret. Appl. Math., 2002)

Domination in distance-hereditary graphs. - Maw-Shang Chang; Shaur-Ching Wu; Gerard J. Chang; Hong-Gwa Yeh (Discret. Appl. Math., 2002)

Total interval numbers of complete r-partite graphs. - Mingjang Chen; Gerard J. Chang (Discret. Appl. Math., 2002)

A note on the Gallai-Roy-Vitaver Theorem. - Gerard J. Chang; Li-Da Tong; Jing-Ho Yan; Hong-Gwa Yeh (Discret. Math., 2002)

Corrigendum to "The path-partition problem in block graphs". - Gerard J. Chang (Inf. Process. Lett., 2002)

The L(2, 1)-labeling problem on ditrees. - Gerard J. Chang; Sheng-Chyang Liaw (Ars Comb., 2003)

Centers and medians of distance-hereditary graphs. - Hong-Gwa Yeh; Gerard J. Chang (Discret. Math., 2003)

Distance-two labelings of graphs. - Gerard J. Chang; Changhong Lu (Eur. J. Comb., 2003)

k-tuple domination in graphs. - Chung-Shou Liao; Gerard J. Chang (Inf. Process. Lett., 2003)

Locally connected spanning trees on graphs - Ching-Chi Lin; Gerard J. Chang; Gen-Huey Chen (CoRR, 2004)

The weighted independent domination problem is NP-complete for chordal graphs. - Gerard J. Chang (Discret. Appl. Math., 2004)

Interval numbers of powers of block graph. - Mingjang Chen; Gerard J. Chang; Douglas B. West (Discret. Math., 2004)

Geodetic spectra of graphs. - Gerard J. Chang; Li-Da Tong; Hong-Tsu Wang (Eur. J. Comb., 2004)

On the profile of the corona of two graphs. - Yung-Ling Lai; Gerard J. Chang (Inf. Process. Lett., 2004)

Vertex and Tree Arboricities of Graphs. - Gerard J. Chang; Chiuyuan Chen; Yaping Chen (J. Comb. Optim., 2004)

The PIGs Full Monty - A Floor Show of Minimal Separators. - Gerard Jennhwa Chang; Ton Kloks; Jiping Liu; Sheng-Lung Peng (STACS, 2005)

Path partition for graphs with special blocks. - Jun-Jie Pan; Gerard J. Chang (Discret. Appl. Math., 2005)

Probe interval bigraphs. - Gerard Jennhwa Chang; Ton Kloks; Sheng-Lung Peng (Electron. Notes Discret. Math., 2005)

Isometric-path numbers of block graphs. - Jun-Jie Pan; Gerard J. Chang (Inf. Process. Lett., 2005)

Diagnosabilities of Regular Networks. - Guey-Yun Chang; Gerard J. Chang; Gen-Huey Chen (IEEE Trans. Parallel Distributed Syst., 2005)

Node-disjoint paths in hierarchical hypercube networks. - Ruei-Yu Wu; Gerard J. Chang; Gen-Huey Chen (IPDPS, 2006)

Isometric path numbers of graphs. - Jun-Jie Pan; Gerard J. Chang (Discret. Math., 2006)

Profile minimization on products of graphs. - Yu-Ping Tsao; Gerard J. Chang (Discret. Math., 2006)

Power domination in graphs. - Min Zhao; Liying Kang; Gerard J. Chang (Discret. Math., 2006)

(t, k)-Diagnosis for Matching Composition Networks. - Guey-Yun Chang; Gen-Huey Chen; Gerard J. Chang (IEEE Trans. Computers, 2006)

Bipancyclicity of Hierarchical Hypercube Networks. - Ruei-Yu Wu; Gen-Huey Chen; Jung-Sheng Fu; Gerard J. Chang (PDPTA, 2007)

Distance-two labelings of digraphs. - Gerard J. Chang; Jer-Jeong Chen; David Kuo; Sheng-Chyang Liaw (Discret. Appl. Math., 2007)

No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups. - Gerard J. Chang; Changhong Lu; Sanming Zhou (Discret. Math., 2007)

Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs. - Ching-Chi Lin; Gerard J. Chang; Gen-Huey Chen (Discret. Math., 2007)

Node-disjoint paths in hierarchical hypercube networks. - Ruei-Yu Wu; Gen-Huey Chen; Yu-Liang Kuo; Gerard J. Chang (Inf. Sci., 2007)

Editorial note. - Gerard J. Chang; Hung-Lin Fu; Xuding Zhu (J. Comb. Optim., 2007)

Distance graphs on R n with 1-norm. - Jer-Jeong Chen; Gerard J. Chang (J. Comb. Optim., 2007)

Group testing in graphs. - Justie Su-tzu Juan; Gerard J. Chang (J. Comb. Optim., 2007)

Profile minimization on compositions of graphs. - Yu-Ping Tsao; Gerard J. Chang (J. Comb. Optim., 2007)

(t, k) - Diagnosis for Matching Composition Networks under the MM* Model. - Guey-Yun Chang; Gen-Huey Chen; Gerard J. Chang (IEEE Trans. Computers, 2007)

On the (n, t)-antipodal Gray codes. - Gerard J. Chang; Sen-Peng Eu; Chung-Heng Yeh (Theor. Comput. Sci., 2007)

Induced-path partition on graphs with special blocks. - Jun-Jie Pan; Gerard J. Chang (Theor. Comput. Sci., 2007)

Adaptive group testing for consecutive positives. - Justie Su-tzu Juan; Gerard J. Chang (Discret. Math., 2008)

Clique coverings and partitions of line graphs. - Bo-Jr Li; Gerard J. Chang (Discret. Math., 2008)

The upper bound on k-tuple domination numbers of graphs. - Gerard J. Chang (Eur. J. Comb., 2008)

On fully orientability of 2-degenerate graphs. - Hsin-Hao Lai; Gerard J. Chang; Ko-Wei Lih (Inf. Process. Lett., 2008)

Finding cycles in hierarchical hypercube networks. - Ruei-Yu Wu; Gen-Huey Chen; Jung-Sheng Fu; Gerard J. Chang (Inf. Process. Lett., 2008)

Distance-two labellings of Hamming graphs. - Gerard J. Chang; Changhong Lu; Sanming Zhou (Discret. Appl. Math., 2009)

The competition number of a graph with exactly h holes, all of which are independent. - Bo-Jr Li; Gerard J. Chang (Discret. Appl. Math., 2009)

Note on the m-step competition numbers of paths and cycles. - Yongqiang Zhao; Gerard J. Chang (Discret. Appl. Math., 2009)

Independent arcs of acyclic orientations of complete r-partite graphs. - Gerard J. Chang; Chen-Ying Lin; Li-Da Tong (Discret. Math., 2009)

L(h, k)-labelings of Hamming graphs. - Lian-Hwao Huang; Gerard J. Chang (Discret. Math., 2009)

A note on equitable colorings of forests. - Gerard J. Chang (Eur. J. Comb., 2009)

Consecutive Edge-Colorings of Generalized θ-Graphs. - Yongqiang Zhao; Gerard J. Chang (CGGA, 2010)

On competition polysemy and m-competition polysemy. - Yongqiang Zhao; Gerard J. Chang (Ars Comb., 2010)

Multicompetition numbers of some multigraphs. - Yongqiang Zhao; Gerard J. Chang (Ars Comb., 2010)

Rainbow domination on trees. - Gerard J. Chang; Jiaojiao Wu; Xuding Zhu (Discret. Appl. Math., 2010)

Equitable colorings of Kronecker products of graphs. - Wu-Hsiung Lin; Gerard J. Chang (Discret. Appl. Math., 2010)

On the total choosability of planar graphs and of sparse graphs. - Gerard Jennhwa Chang; Jianfeng Hou; Nicolas Roussel (Inf. Process. Lett., 2010)

The degree-preserving spanning tree problem in strongly chordal and directed path graphs. - Ching-Chi Lin; Gerard J. Chang; Gen-Huey Chen (Networks, 2010)

On the Number of Subsequences with a Given Sum in a Finite Abelian Group. - Gerard Jennhwa Chang; Sheng-Hua Chen; Yongke Qu; Guoqing Wang; Haiyan Zhang (Electron. J. Comb., 2011)

Local condition for planar graphs of maximum degree 7 to be 8-totally colorable. - Gerard Jennhwa Chang; Jianfeng Hou; Nicolas Roussel (Discret. Appl. Math., 2011)

Resource-sharing systems and hypergraph colorings. - Wu-Hsiung Lin; Gerard J. Chang (J. Comb. Optim., 2011)

Near-automorphisms of paths. - Gerard J. Chang (J. Graph Theory, 2011)

Generalized power domination of graphs. - Gerard Jennhwa Chang; Paul Dorbec; Mickaël Montassier; André Raspaud (Discret. Appl. Math., 2012)

Balanced k-decompositions of graphs. - Hsiang-Chun Hsu; Gerard Jennhwa Chang (Discret. Appl. Math., 2012)

Competition numbers of complete r-partite graphs. - Bo-Jr Li; Gerard J. Chang (Discret. Appl. Math., 2012)

Equitable colorings of Cartesian products of graphs. - Wu-Hsiung Lin; Gerard J. Chang (Discret. Appl. Math., 2012)

First-fit chromatic numbers of d-degenerate graphs. - Gerard Jennhwa Chang; Hsiang-Chun Hsu (Discret. Math., 2012)

Strong edge-coloring for cubic Halin graphs. - Gerard Jennhwa Chang; Daphne Der-Fen Liu (Discret. Math., 2012)

(Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles. - Gerard J. Chang; Nicolas Roussel (Discret. Math., 2012)

Upper bounds on Roman domination numbers of graphs. - Chun-Hung Liu; Gerard Jennhwa Chang (Discret. Math., 2012)

Upper k-tuple domination in graphs. - Gerard Jennhwa Chang; Paul Dorbec; Hye Kyung Kim; André Raspaud; Haichao Wang 004; Weiliang Zhao (Discret. Math. Theor. Comput. Sci., 2012)

Hamiltonian numbers of Möbius double loop networks. - Gerard J. Chang; Ting-Pang Chang; Li-Da Tong (J. Comb. Optim., 2012)

Parity and strong parity edge-colorings of graphs. - Hsiang-Chun Hsu; Gerard J. Chang (J. Comb. Optim., 2012)

The competition number of a graph with exactly two holes. - Bo-Jr Li; Gerard J. Chang (J. Comb. Optim., 2012)

Roman Domination on 2-Connected Graphs. - Chun-Hung Liu; Gerard J. Chang (SIAM J. Discret. Math., 2012)

Complexity of distance paired-domination problem in graphs. - Gerard J. Chang; B. S. Panda 001; Dinabandhu Pradhan (Theor. Comput. Sci., 2012)

A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs. - Ching-Chi Lin; Gen-Huey Chen; Gerard J. Chang (Algorithmica, 2013)

Rainbow domination and related problems on strongly chordal graphs. - Gerard J. Chang; Bo-Jr Li; Jiaojiao Wu (Discret. Appl. Math., 2013)

Algorithmic aspects of the kk-domination problem in graphs. - James K. Lan; Gerard Jennhwa Chang (Discret. Appl. Math., 2013)

b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture. - Wu-Hsiung Lin; Gerard J. Chang (Discret. Appl. Math., 2013)

bb-chromatic numbers of powers of paths and cycles. - Wu-Hsiung Lin; Gerard J. Chang (Discret. Appl. Math., 2013)

On a conjecture on the balanced decomposition number. - Gerard Jennhwa Chang; N. Narayanan 001 (Discret. Math., 2013)

Algorithmic aspect of stratified domination in graphs. - Gerard Jennhwa Chang; Chan-Wei Chang; David Kuo; Sheung-Hung Poon (Inf. Process. Lett., 2013)

Roman domination on strongly chordal graphs. - Chun-Hung Liu; Gerard J. Chang (J. Comb. Optim., 2013)

A short proof for Chen's Alternative Kneser Coloring Lemma. - Gerard Jennhwa Chang; Daphne Der-Fen Liu; Xuding Zhu (J. Comb. Theory A, 2013)

Strong Chromatic Index of 2-Degenerate Graphs. - Gerard Jennhwa Chang; N. Narayanan 001 (J. Graph Theory, 2013)

On the mixed domination problem in graphs. - James K. Lan; Gerard Jennhwa Chang (Theor. Comput. Sci., 2013)

On the algorithmic complexity of k-tuple total domination. - James K. Lan; Gerard Jennhwa Chang (Discret. Appl. Math., 2014)

Dot product dimensions of graphs. - Bo-Jr Li; Gerard Jennhwa Chang (Discret. Appl. Math., 2014)

Strong chromatic index of planar graphs with large girth. - Gerard Jennhwa Chang; Mickaël Montassier; Arnaud Pêcher; André Raspaud (Discuss. Math. Graph Theory, 2014)

Bandwidth sums of block graphs and cacti. - Gerard Jennhwa Chang; Ma-Lian Chia; David Kuo; Ji-Yin Lin; Jing-Ho Yan (J. Comb. Optim., 2014)

Graphs with small balanced decomposition numbers. - Hsiang-Chun Hsu; Gerard Jennhwa Chang (J. Comb. Optim., 2014)

From Edge-Coloring to Strong Edge-Coloring. - Valentin Borozan; Gerard Jennhwa Chang; Nathann Cohen; Shinya Fujita 001; Narayanan Narayanan; Reza Naserasr; Petru Valicov (Electron. J. Comb., 2015)

The number of steps and the final configuration of relaxation procedures on graphs. - Sheng-Hua Chen; Gerard Jennhwa Chang (Discret. Appl. Math., 2015)

Strong edge-coloring for jellyfish graphs. - Gerard J. Chang; Sheng-Hua Chen; Chi-Yun Hsu; Chia-Man Hung; Huei-Ling Lai (Discret. Math., 2015)

On the k-power domination of hypergraphs. - Gerard Jennhwa Chang; Nicolas Roussel (J. Comb. Optim., 2015)

Edge Roman Domination on Graphs. - Gerard J. Chang; Sheng-Hua Chen; Chun-Hung Liu (Graphs Comb., 2016)

Max-Coloring of Vertex-Weighted Graphs. - Hsiang-Chun Hsu; Gerard Jennhwa Chang (Graphs Comb., 2016)

Total Weight Choosability of Trees. - Gerard Jennhwa Chang; Guan-Huei Duh; Tsai-Lien Wong; Xuding Zhu (SIAM J. Discret. Math., 2017)

On the precise value of the strong chromatic index of a planar graph with a large girth. - Gerard Jennhwa Chang; Guan-Huei Duh (Discret. Appl. Math., 2018)

The 4-choosability of planar graphs and cycle adjacency. - Juei-Yin Lin; Chung-Ying Yang; Gerard Jennhwa Chang (Discret. Math., 2021)

Edge-removing games on graphs. - Alianna Singyue Yu; Gerard Jennhwa Chang (Discret. Appl. Math., 2024)