• How short can a proof of impossibility be?

  An overview of the branch-and-bound approach to resolution proof length minimization from my JAIR paper.

  19 min read   ·   August 27, 2026

  2026   ·   sat   proofs   ·   paper-announcement

• Inferring hidden constraints for scheduling solvers

  An overview of the lifting-based constraint inference technique from my CP 2026 paper.

  9 min read   ·   June 14, 2026

  2026   ·   cp   scheduling   ·   paper-announcement

• How to implicit hitting set

  A tour of implicit hitting set workflow and applications

  19 min read   ·   August 08, 2025

  2025   ·   ihs   optimization   ·   techniques

• A new approach to solving hard scheduling problems via disjointness

  An overview of the scheduling technique explored by us in our CP 2025 conference submission.

  7 min read   ·   June 15, 2025

  2025   ·   cp   scheduling   ·   paper-announcement

• CP 2024 impressions

  My take on the key trends from the CP 2024 conference.

  9 min read   ·   September 06, 2024

  2024   ·   conference   cp   ·   conference-review