Newest first
92 papers
- Investigating Simple Drawings of K_n Using SATBergold, ScheucherarXiv '25graph drawing
- Counterexample to Winkler's Conjecture on Venn DiagramsBrenner, Kleist, Mütze, Rieck, VercianiarXiv '25counterexamples
- Verified Certificates via SAT and Computer Algebra Systems for the Ramsey R(3, 8) and R(3, 9) ProblemsLi, Duggan, Bright, GanesharXiv '25IJCAI '25computer algebraRamsey theory
- Smart Cubing for Graph Search: A Comparative StudyKirchweger, Xia, Peitl, SzeiderarXiv '25graph theory
- Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter EquationVan Caudenberg, Bogaerts, VendraminarXiv '25TACAS '25algebra
- The Borsuk Problem for Subsets of the Vertices of the 10-Dimensional Boolean CubeBatmanov, VoronovarXiv '25
- Myrvold's Results on Orthogonal Triples of 10 x 10 Latin Squares: A SAT InvestigationBright, Keita, StevensarXiv '25combinatorial design
- Algebraic and SAT Models for SCA GenerationKoelbing, Garn, Iurlano, Kotsireas, SimosAppl. Algebra Eng. Commun. Comput. '25sequence covering arrays
- Optimal Partitions of the Flat Torus into Parts of Smaller DiameterProtasov, Tolmachev, VoronovDiscrete Optimization '25
- Lower Bounds for Book Ramsey NumbersWesleyarXiv '24Ramsey theory
- Proving Norine's Conjecture Holds for $n = 7$ via SAT SolversFrankston, ScheinermanarXiv '24graph coloring
- SAT and Lattice Reduction for Integer FactorizationAjani, BrightarXiv '24ISSAC '24integer factorization
- Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic IrrationalsBarnoff, Bright, ShallitarXiv '24CIAA '24automata theoryirrational numbers
- A Formal Proof of R(4,5)Gauthier, BrownarXiv '24Ramsey theory
- Happy Ending: An Empty Hexagon in Every Set of 30 PointsHeule, ScheucherarXiv '24TACAS '24discrete geometryRamsey theory
- Finding Hardness Reductions Automatically Using SAT SolversBergold, Scheucher, SchröderarXiv '24gadget design
- A SAT Solver + Computer Algebra Attack on the Minimum Kochen-Specker ProblemLi, Bright, GaneshIJCAI '24vector systems
- SAT-Based Search for Minwise Independent FamiliesIurlano, RaidlarXiv '24
- PackIt! Gamified Rectangle PackingGarrison, Heule, SubercaseauxarXiv '24FUN '24combinatorial games
- Computing Small Rainbow Cycle Numbers with SAT Modulo SymmetriesKirchweger, SzeiderCP '24graph theorysocial choice theory
- SAT Modulo Symmetries for Graph Generation and EnumerationKirchweger, SzeiderACM Trans. Comput. Log. '24graph theory
- Automated Mathematical Discovery and Verification: Minimizing Pentagons in the PlaneSubercaseaux, Mackey, Heule, MartinsarXiv '23CICM '24discrete geometryRamsey theory
- Structure and Computability of Preimages in the Game of LifeSalo, TörmäarXiv '23Theoretical Computer Science '25cellular automatagadget designrecreational mathematics
- On the Deque and Rique Numbers of Complete and Complete Bipartite GraphsBekos, Kaufmann, Pavlidi, RiegerarXiv '23CCCG '23graph drawinggraph theory
- Co-Certificate Learning with SAT modulo SymmetriesKirchweger, Peitl, SzeiderarXiv '23IJCAI '23vector systems
- Using SAT to Study Plane Hamiltonian Substructures in Simple DrawingsBergold, Felsner, Reddy, ScheucherarXiv '23graph drawing
- An Extension Theorem for SignotopesBergold, Felsner, ScheucherarXiv '23SoCG '23
- The Packing Chromatic Number of the Infinite Square Grid is 15Subercaseaux, HeulearXiv '23TACAS '23graph coloring
- A SAT Solver's Opinion on the Erdős-Faber-Lovász ConjectureKirchweger, Peitl, SzeiderSAT '23famous conjecturesgraph coloring
- A SAT Attack on Erdős-Szekeres Numbers in R^d and the Empty Hexagon TheoremScheucherComput. Geom. Topol. '23discrete geometryRamsey theory
- On a Pair of Orthogonal Golf DesignsLu, Chen, CaoDiscrete Mathematics '23
- Investigating the~Existence of~Holey Latin Squares via~Satisfiability TestingLiu, Han, Jia, Huang, Ma, Zhang, ZhangPRICAI '23combinatorial design
- Toward Optimal Radio Colorings of Hypercubes via SAT-solvingSubercaseaux, HeuleLPAR '23graph coloring
- Using a SAT Solver to Find Interesting Sets of Nonstandard DicePurcellAm. Math. Mon. '23recreational mathematics
- Searching for Smallest Universal Graphs and Tournaments with SATZhang, SzeiderCP '23graph theory
- Rado Numbers and SAT ComputationsChang, Loera, WesleyarXiv '22ISSAC '22Ramsey theory
- New Lower Bounds for Cap SetsTyrrellarXiv '22Ramsey theory
- Impossibility Theorems Involving Weakenings of Expansion Consistency and Resoluteness in VotingHolliday, Norman, Pacuit, ZahedianarXiv '22social choice theory
- Improved Lower Bounds for Multicolour Ramsey Numbers using SAT-SolversRowleyarXiv '22Ramsey theory
- New lower bounds for Schur and weak Schur numbersAgeron, Casteras, Pellerin, Portella, Rimmel, TomasikarXiv '21Ramsey theory
- On Using SAT Solvers for Graph ComputationsCourcelle, Durandpreprint '22graph theory
- The Packing Chromatic Number of the Infinite Square Grid Is at Least 14Subercaseaux, HeuleSAT '22graph coloring
- When Satisfiability Solving Meets Symbolic ComputationBright, Kotsireas, GaneshCommun. ACM '22survey
- A SAT Attack on Rota's Basis ConjectureKirchweger, Scheucher, SzeiderSAT '22famous conjecturesmatroids
- An Automated Approach to the Collatz ConjectureYolcu, Aaronson, HeulearXiv '21J. Autom. Reason. '23famous conjectures
- A Counterexample to the Unit Conjecture for Group RingsGardamAnnals of Mathematics '21arXiv '21algebrafamous conjectures
- Avoiding Monochromatic Rectangles Using Shift PatternsLiu, Chew, HeulearXiv '20SOCS '21Ramsey theory
- A SAT-based Resolution of Lam's ProblemBright, Cheung, Stevens, Kotsireas, GaneshAAAI '21arXiv '20combinatorial design
- Farad\v zev Read-type Enumeration of Non-Isomorphic CC SystemsBankovi{\'c}, Mari{\'c}Computational Geometry '21
- Tighter Bounds on Directed Ramsey Number R(7)Neiman, Mackey, HeulearXiv '20Graphs Comb. '22Ramsey theory
- Coloring Unit-Distance Strips Using SATOostema, Martins, HeuleLPAR '20graph coloring
- A nonexistence certificate for projective planes of order ten with weight 15 codewordsBright, Cheung, Stevens, Roy, Kotsireas, GaneshAAECC '20combinatorial design
- The Resolution of Keller's ConjectureBrakensiek, Heule, Mackey, NarváezarXiv '19J. Autom. Reason. '22famous conjectures
- Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SATBright, Kotsireas, Heinle, GanesharXiv '19J. Symb. Comput. '21computer algebra
- Effective Problem Solving Using SAT SolversBright, Gerhard, Kotsireas, GanesharXiv '19MC '19computer algebrasurvey
- The SAT+CAS method for combinatorial search with applications to best matricesBright, Dokovic, Kotsireas, GaneshAnn. Math. Artif. Intell. '19computer algebralinear algebra
- SAT solvers and computer algebra systems: a powerful combination for mathematicsBright, Kotsireas, GaneshCASCON '19computer algebra
- Fast Formal Proof of the Erd\H os--Szekeres Conjecture for Convex Polygons with at Most 6 PointsMari{\'c}Journal of Automated Reasoning '19
- On Orthogonal Symmetric Chain DecompositionsDäubel, Jäger, Mütze, ScheucherarXiv '18Electron. J. Comb. '19poset theory
- On L-shaped Point Set Embeddings of Trees: First Non-Embeddable ExamplesMütze, ScheucherarXiv '18J. Graph Algorithms Appl. '20discrete geometrygraph drawing
- Two Disjoint 5-Holes in Point SetsScheucherarXiv '18Comput. Geom. '20discrete geometry
- Computing Small Unit-Distance Graphs with Chromatic Number 5HeulearXiv '18graph coloring
- The Chromatic Number of the Plane Is at Least 5de GreyarXiv '18graph coloring
- Applying Computer Algebra Systems with SAT Solvers to the Williamson ConjectureBright, Kotsireas, GanesharXiv '18J. Symb. Comput. '20linear algebra
- Improving Circuit Size Upper Bounds Using SAT-solversKulikovDATE '18circuit complexity
- Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability TestingHuang, Ma, Ge, Zhang, ZhangAutomated {{Reasoning}} '18
- A SAT+CAS Method for Enumerating Williamson Matrices of Even OrderBright, Kotsireas, GaneshAAAI '18linear algebra
- Schur Number FiveHeuleAAAI '18arXiv '17Ramsey theory
- A SAT Attack on the Erdős-Szekeres ConjectureBalko, ValtrEur. J. Comb. '17discrete geometryRamsey theory
- Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial ConjecturesZulkoski, Bright, Heinle, Kotsireas, Czarnecki, GaneshJ. Autom. Reason. '17computer algebragraph theory
- The Science of Brute ForceHeule, KullmannCommun. ACM '17survey
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-ConquerHeule, Kullmann, MarekarXiv '16SAT '16famous conjecturesRamsey theory
- MathCheck2: A SAT+CAS Verifier for Combinatorial ConjecturesBright, Ganesh, Heinle, Kotsireas, Nejati, CzarneckiCASC '16computer algebra
- Non Existence of Some Mixed Moore Graphs of Diameter 2 Using SATLópez, Miret, FernándezDiscret. Math. '16graph theory
- Computing the Ramsey Number R(4,3,3) Using Abstraction and Symmetry BreakingCodish, Frank, Itzhakov, MillerarXiv '15Constraints An Int. J. '16Ramsey theory
- Optimal-Depth Sorting NetworksBundala, Codish, Cruz-Filipe, Schneider-Kamp, ZávodnýarXiv '14J. Comput. Syst. Sci. '17sorting networks
- The Book Embedding Problem from a SAT-Solving PerspectiveBekos, Kaufmann, ZielkeGD '15graph drawing
- MathCheck: A Math Assistant via a Combination of Computer AlgebraZulkoski, Ganesh, CzarneckiCADE '15computer algebra
- A SAT Attack on the Erdős Discrepancy ConjectureKonev, LisitsaarXiv '14SAT '14famous conjectures
- Symmetry in Gardens of EdenHartman, Heule, Kwekkeboom, NoelsElectron. J. Comb. '13cellular automatarecreational mathematics
- Breaking Symmetries in Graph RepresentationCodish, Miller, Prosser, StuckeyIJCAI '13graph theory
- Upward Planarity Testing via SATChimani, ZeranskiGD '12graph theory
- Solving Rubik's Cube Using SAT SolversChenarXiv '11combinatorial games
- Generating and Searching Families of FFT AlgorithmsHaynal, HaynalarXiv '11
- Green-Tao Numbers and SATKullmannarXiv '10SAT '10Ramsey theory
- A SAT-based Method for Solving the Two-dimensional Strip Packing ProblemSoh, Inoue, Tamura, Banbara, NabeshimaFundamenta Informaticae '10
- Finding Reductions AutomaticallyCrouch, Immerman, MossFields of Logic and Computation '10gadget design
- Two New Van Der Waerden Numbers: W(2; 3, 17) and w(2; 3, 18)AhmedINTEGERS '10Ramsey theory
- Combinatorial Designs by SAT SolversZhangHandbook of Satisfiability '09combinatorial designsurvey
- The van Der Waerden Number W(2,6) Is 1132Kouril, PaulExp. Math. '08Ramsey theory
- Applying SAT Solving in Classification of Finite AlgebrasMeier, SorgeJ. Autom. Reason. '05SAT '05algebra
- Satisfiability and Computing van Der Waerden NumbersDransfield, Marek, TruszczyńskiarXiv '03SAT '04Ramsey theory
algebra
automata theory
cellular automata
circuit complexity
combinatorial design
combinatorial games
computer algebra
counterexamples
discrete geometry
famous conjectures
gadget design
graph coloring
graph drawing
graph theory
integer factorization
irrational numbers
linear algebra
matroids
poset theory
Ramsey theory
recreational mathematics
sequence covering arrays
social choice theory
sorting networks
survey
vector systems