Counting Substrate Cycles in Topologically Restricted Metabolic Networks. - Robert D. Barish; Akira Suyama (CiE, 2017)

Barnette's Conjecture Through the Lens of the ModkP Complexity Classes. - Robert D. Barish; Akira Suyama (JCDCGGG, 2018)

Counting Hamiltonian Cycles on Quartic 4-Vertex-Connected Planar Graphs. - Robert D. Barish; Akira Suyama (Graphs Comb., 2020)

Randomized Reductions and the Topology of Conjectured Classes of Uniquely Hamiltonian Graphs. - Robert D. Barish; Akira Suyama (J. Inf. Process., 2020)

Counting on a Rainbow Connection (text not included). - Robert D. Barish; Tetsuo Shibuya (ICTCS, 2022)

Counting 2-Factors of 4-Regular Bipartite Graphs is #P-Complete. - Robert D. Barish; Tetsuo Shibuya (JCDCGGG, 2022)

The Fine-Grained Complexity of Approximately Counting Proper Connected Colorings (Extended Abstract). - Robert D. Barish; Tetsuo Shibuya (COCOA (2), 2023)

Hardness of Bounding Influence via Graph Modification. - Robert D. Barish; Tetsuo Shibuya (SOFSEM, 2023)

Polyhedral roll-connected colorings of partial tilings. - Robert D. Barish; Tetsuo Shibuya (CCCG, 2024)

Fair Selection of Clearing Schemes for Kidney Exchange Markets. - Robert D. Barish; Tetsuo Shibuya (COCOA (2), 2024)

Recognition and Proper Coloring of Unit Segment Intersection Graphs. - Robert D. Barish; Tetsuo Shibuya (SWAT, 2024)

Counting on Rainbow k-Connections. - Robert D. Barish; Tetsuo Shibuya (TAMC, 2024)

String editing under pattern constraints. - Robert D. Barish; Tetsuo Shibuya (Theor. Comput. Sci., 2024)

Proper colorability of segment intersection graphs. - Robert D. Barish; Tetsuo Shibuya (J. Comb. Optim., 2024)

Packing Dimers to Maximum Occupancy Under Soft-Core Constraints. - Robert D. Barish; Tetsuo Shibuya (CIAC (2), 2025)

Affine optimal k-proper connected edge colorings. - Robert D. Barish; Tetsuo Shibuya (Optim. Lett., 2025)