An Algorithm for Packing Connectors. - Judith Keijsper (J. Comb. Theory B, 1998)

An Efficient Algorithm for Minimum-Weight Bibranching. - Judith Keijsper; Rudi Pendavingh (J. Comb. Theory B, 1998)

On Packing Connectors. - Judith Keijsper; Alexander Schrijver (J. Comb. Theory B, 1998)

Adjacency, Inseparability, and Base Orderability in Matroids. - Judith Keijsper; Rudi Pendavingh; Alexander Schrijver (Eur. J. Comb., 2000)

Conditions for β-perfectness. - Judith Keijsper; Meike Tewes (Discuss. Math. Graph Theory, 2002)

A Vizing-type theorem for matching forests. - Judith Keijsper (Discret. Math., 2003)

Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. - Leo van Iersel; Judith Keijsper; Steven Kelk; Leen Stougie (WABI, 2006)

A linear programming formulation of Mader's edge-disjoint paths problem. - Judith Keijsper; Rudi Pendavingh; Leen Stougie (J. Comb. Theory B, 2006)

Prefix Reversals on Binary and Ternary Strings. - Cor A. J. Hurkens; Leo van Iersel; Judith Keijsper; Steven Kelk; Leen Stougie; John Tromp (SIAM J. Discret. Math., 2007)

Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. - Cor A. J. Hurkens; J. C. M. Keijsper; Leen Stougie (SIAM J. Discret. Math., 2007)

Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. - Leo van Iersel; Judith Keijsper; Steven Kelk; Leen Stougie (IEEE ACM Trans. Comput. Biol. Bioinform., 2008)

Constructing Level-2 Phylogenetic Networks from Triplets. - Leo van Iersel; Judith Keijsper; Steven Kelk; Leen Stougie; Ferry Hagen; Teun Boekhout (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

Convex minization over Z2. - J. C. M. Keijsper; Rudi Pendavingh (Oper. Res. Lett., 2011)

Tractable Cases of (*, 2)-Bounded Parsimony Haplotyping. - Judith Keijsper; Tim Oosterwijk (IEEE ACM Trans. Comput. Biol. Bioinform., 2015)