Investigating Simple Drawings of K_n Using SAT

Counterexample to Winkler's Conjecture on Venn Diagrams

Verified Certificates via SAT and Computer Algebra Systems for the Ramsey R(3, 8) and R(3, 9) Problems

Smart Cubing for Graph Search: A Comparative Study

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation

Myrvold's Results on Orthogonal Triples of 10 x 10 Latin Squares: A SAT Investigation

Lower Bounds for Book Ramsey Numbers

SAT and Lattice Reduction for Integer Factorization

Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals

A Formal Proof of R(4,5)

Happy Ending: An Empty Hexagon in Every Set of 30 Points

Finding Hardness Reductions Automatically Using SAT Solvers

A SAT Solver + Computer Algebra Attack on the Minimum Kochen-Specker Problem

PackIt! Gamified Rectangle Packing

Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries

SAT Modulo Symmetries for Graph Generation and Enumeration

Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane

Structure and Computability of Preimages in the Game of Life

On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs

Co-Certificate Learning with SAT modulo Symmetries

Using SAT to Study Plane Hamiltonian Substructures in Simple Drawings

The Packing Chromatic Number of the Infinite Square Grid is 15

A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture

A SAT Attack on Erdős-Szekeres Numbers in R^d and the Empty Hexagon Theorem

Toward Optimal Radio Colorings of Hypercubes via SAT-solving

Using a SAT Solver to Find Interesting Sets of Nonstandard Dice

Searching for Smallest Universal Graphs and Tournaments with SAT

Rado Numbers and SAT Computations

New Lower Bounds for Cap Sets

Impossibility Theorems Involving Weakenings of Expansion Consistency and Resoluteness in Voting

On Using SAT Solvers for Graph Computations

The Packing Chromatic Number of the Infinite Square Grid Is at Least 14

When Satisfiability Solving Meets Symbolic Computation

A SAT Attack on Rota's Basis Conjecture

An Automated Approach to the Collatz Conjecture

A Counterexample to the Unit Conjecture for Group Rings

Avoiding Monochromatic Rectangles Using Shift Patterns

A SAT-based Resolution of Lam's Problem

Tighter Bounds on Directed Ramsey Number R(7)

Coloring Unit-Distance Strips Using SAT

A nonexistence certificate for projective planes of order ten with weight 15 codewords

The Resolution of Keller's Conjecture

Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT

Effective Problem Solving Using SAT Solvers

The SAT+CAS method for combinatorial search with applications to best matrices

SAT solvers and computer algebra systems: a powerful combination for mathematics

On Orthogonal Symmetric Chain Decompositions

On L-shaped Point Set Embeddings of Trees: First Non-Embeddable Examples

Two Disjoint 5-Holes in Point Sets

Computing Small Unit-Distance Graphs with Chromatic Number 5

The Chromatic Number of the Plane Is at Least 5

Applying Computer Algebra Systems with SAT Solvers to the Williamson Conjecture

Improving Circuit Size Upper Bounds Using SAT-solvers

A SAT+CAS Method for Enumerating Williamson Matrices of Even Order

Schur Number Five

A SAT Attack on the Erdős-Szekeres Conjecture

Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures

The Science of Brute Force

Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer

MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures

Non Existence of Some Mixed Moore Graphs of Diameter 2 Using SAT

Computing the Ramsey Number R(4,3,3) Using Abstraction and Symmetry Breaking

Optimal-Depth Sorting Networks

MathCheck: A Math Assistant via a Combination of Computer Algebra

A SAT Attack on the Erdős Discrepancy Conjecture

Symmetry in Gardens of Eden

Breaking Symmetries in Graph Representation

Upward Planarity Testing via SAT

Solving Rubik's Cube Using SAT Solvers

Green-Tao Numbers and SAT

Finding Reductions Automatically

Two New Van Der Waerden Numbers: W(2; 3, 17) and w(2; 3, 18)

Combinatorial Designs by SAT Solvers

The van Der Waerden Number W(2,6) Is 1132

Applying SAT Solving in Classification of Finite Algebras

Satisfiability and Computing van Der Waerden Numbers