Benjamin Przybocki

Orcid: 0009-0007-5489-1733

According to our database1, Benjamin Przybocki authored at least 14 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery.
CoRR, April, 2026

Near-Optimal Encodings of Cardinality Constraints.
CoRR, March, 2026

Automated Reencoding Meets Graph Theory.
CoRR, March, 2026

Accelerating Scientific Research with Gemini: Case Studies and Common Techniques.
CoRR, February, 2026

Characterizing Sets of Theories That Can Be Disjointly Combined.
Proc. ACM Program. Lang., 2026

2025
Optimal and Efficient Partite Decompositions of Hypergraphs.
CoRR, November, 2025

The termination of Nielsen transformations applied to word equations with length constraints.
CoRR, January, 2025

Shininess, Strong Politeness, and Unicorns.
Proceedings of the Frontiers of Combining Systems - 15th International Symposium, 2025

Being Polite Is Not Enough (and Other Limits of Theory Combination).
Proceedings of the Automated Deduction - CADE 30, 2025

2024
Bender-Knuth involutions on linear extensions of posets.
Discret. Math., 2024

The Nonexistence of Unicorns and Many-Sorted Löwenheim-Skolem Theorems.
Proceedings of the Formal Methods - 26th International Symposium, 2024

2023
The Maximum Hook Length of $d$-Distinct Simultaneous Core Partitions.
Electron. J. Comb., 2023

2022
Lengths of Irreducible and Delicate Words.
Electron. J. Comb., 2022

Hat Guessing on Books and Windmills.
Electron. J. Comb., 2022


  Loading...