781 Episodes

  1. Ep 550 - Con Air (novelization), by Richard Woodley

    Published: 9/12/2022
  2. Ep 549 - The Lost Dreamer, by Lizz Huerta

    Published: 9/5/2022
  3. Ep 548 - The Firm, by John Grisham

    Published: 8/29/2022
  4. Ep 547 - My Brilliant Friend, by Elena Ferrante

    Published: 8/22/2022
  5. Ep 546 - Wittgenstein's Mistress, by David Markson

    Published: 8/15/2022
  6. Ep 545 - The Cat Who Saved Books, by Sosuke Natsukawa

    Published: 8/8/2022
  7. Ep 544 - Our Man in Havana, by Graham Greene (w/ Anne Bogel from What Should I Read Next?)

    Published: 8/1/2022
  8. GOOSEBUMS, an R.L. Stine's Goosebumps miniseries - Episodes 3 & 4

    Published: 7/29/2022
  9. Ep 543 - Wolf Hall, by Hilary Mantel

    Published: 7/25/2022
  10. Ep 542 - Red Rising, by Pierce Brown (Red Rising series #1)

    Published: 7/18/2022
  11. Ep 541 - Star Trek: Killing Time (1st Edition), by Della Van Hise (Bonus Episode)

    Published: 7/15/2022
  12. Ep 540 - The Expectant Father: The Ultimate Guide for Dads-To-Be, by Armin A. Brott and Jennifer Ash Rudick

    Published: 7/11/2022
  13. Ep 539 - The Maltese Falcon, by Dashiell Hammett

    Published: 7/4/2022
  14. Ep 538 - Angels in America, by Tony Kushner

    Published: 6/27/2022
  15. Ep 537 - Every Heart a Doorway (Wayward Children #1), by Seanan McGuire

    Published: 6/20/2022
  16. Ep 536 - Confessions of a Mask, by Yukio Mishima

    Published: 6/13/2022
  17. Ep 535 - The Scarlet Letter, by Nathaniel Hawthorne

    Published: 6/6/2022
  18. Ep 534 - A Gentleman in Moscow, by Amor Towles

    Published: 5/30/2022
  19. GOOSEBUMS, an R.L. Stine's Goosebumps miniseries - Episodes 1 & 2

    Published: 5/27/2022
  20. Ep 533 - The Duke & I (Bridgerton #1), by Julia Quinn

    Published: 5/23/2022

11 / 40

Overdue is a podcast about the books you've been meaning to read. Join Andrew and Craig each week as they tackle a new title from their backlog. Classic literature, obscure plays, goofy childen’s books: they'll read it all, one overdue book at a time.