Robert D. Barish

Optim. Lett., January, 2025

2024

Proper colorability of segment intersection graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., May, 2024

String editing under pattern constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Counting on Rainbow k-Connections.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2024

Recognition and Proper Coloring of Unit Segment Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023

Hardness of Bounding Influence via Graph Modification.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

The Fine-Grained Complexity of Approximately Counting Proper Connected Colorings (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Counting on a Rainbow Connection (text not included).

[BibT_eX]

Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2020

Randomized Reductions and the Topology of Conjectured Classes of Uniquely Hamiltonian Graphs.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Counting Hamiltonian Cycles on Quartic 4-Vertex-Connected Planar Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2020

2018

Barnette's Conjecture Through the Lens of the Mod<sub>k</sub>P Complexity Classes.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

2017

Counting Substrate Cycles in Topologically Restricted Metabolic Networks.

[BibT_eX]

[DOI]