Judith Keijsper

Research interests:

Papers:

• An efficient algorithm for minimum weight bibranching
  Keijsper, J.; Pendavingh, R. An efficient algorithm for minimum-weight bibranching. J. Combin. Theory Ser. B 73 (1998), no. 2, 130--145.

• On packing connectors
  Keijsper, J.; Schrijver, A. On packing connectors. J. Combin. Theory Ser. B 73 (1998), no. 2, 184--188.

• An algorithm for packing connectors
  Keijsper, J. An algorithm for packing connectors. J. Combin. Theory Ser. B 74 (1998), no. 2, 397--404.

• New techniques in network optimization
  Keijsper, J. New techniques in network optimization. Ph.D. thesis, Universiteit van Amsterdam, Amsterdam, 1998.

• Adjacency, inseparability, and base orderability in matroids
  Keijsper, J.; Pendavingh, R.; Schrijver, A. Adjacency, inseparability, and base orderability in matroids. European J. Combin. 21 (2000), no. 4, 487--502.

• Conditions for beta-perfectness
  Keijsper, Judith; Tewes, Meike Conditions for $\beta$-perfectness. (English. English summary) Conference on Graph Theory (Elgersburg, 2000). Discuss. Math. Graph Theory 22 (2002), no. 1, 123--148.
• A Vizing-type theorem for matching forests
  Keijsper, Judith. A Vizing-type theorem for matching forests. Discrete Math. 260 (2003), no. 1-3, 211--216.
• A linear programming formulation of Mader's edge-disjoint paths problem
  Keijsper, J.C.M.; Pendavingh, R.A.; Stougie, L. A linear programming formulation of Mader's edge-disjoint paths problem, SPOR-Report 2003-15, Technische Universiteit Eindhoven, 2003. A revised version was published in Journal of Combinatorial Theory, Series B 96 (2006), 159-163.
• Virtual private network design: a proof of the tree routing conjecture for ring networks
  Hurkens, C.A.J.; Keijsper, J.C.M.; Stougie, L. Virtual private network design: a proof of the tree routing conjecture for ring networks, SPOR-Report 2004-15, Technische Universiteit Eindhoven, 2004. Presented at IPCO 2005. Journal version: SIAM J. Discrete Math. 21 (2007), no. 2, 482--503.
• Beaches of Islands of tractability: Algorithms for parsimony and minimum perfect phylogeny haplotyping problems
  Van Iersel, L; Keijsper, J.C.M; Kelk, S.; Stougie, L. SPOR-Report 2006-09, Technische Universiteit Eindhoven, 2006.
  Presented at WABI 2006. A revised and extended version called "Shorelines of islands of tractability: Algorithms for parsimony and minimum perfect phylogeny haplotyping problems" appeared in IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5(2) (2008), 301-312.
• Prefix reversals on binary and ternary strings
  Hurkens, C.A.J.; Van Iersel, L; Keijsper, J.C.M.; Kelk, S; Stougie, L; Tromp, J. SPOR-Report 2006-10, Technische Universiteit Eindhoven, 2006. A revised version was published in SIAM Journal on Discrete Mathematics, Vol.21, No.3, July 2007.
• Constructing level-2 phylogenetic networks from triplets
  Iersel, L.J.J. van, Keijsper, J.C.M., Kelk, S.M., Stougie, L., Hagen, F., Boekhout, T. (2008) In M. Vingron, L. Wong (Eds.), Research in Computational Molecular Biology (Proceedings 12th Annual International Conference, RECOMB 2008, Singapore, March 30-April 2, 2008). (Lecture Notes in Computer Science, Vol. 4955, pp. 450-462). Berlin: Springer. An extended (journal) version of this paper will appear in IEEE/ACM Transactions on Computational Biology and Bioinformatics (2009).

• Constructing Level-2 Phylogenetic Networks from Triplets
  Leo van Iersel , Judith Keijsper , Steven Kelk , Leen Stougie , Ferry Hagen , Teun Boekhout. IEEE/ACM Transactions on Computational Biology and Bioinformatics. Issue Date:October 2009. pp. 667-681.

• Convex minization over Z^2
  Keijsper, J. C. M.; Pendavingh, R. A., Oper. Res. Lett. 39 (2011), no. 1, 53-56.

• Reconstructing a phylogenetic level-1 network from quartets
  Keijsper, J. C. M.; Pendavingh, R. A., Bull. Math. Biol. 76 (2014), no. 10, 2517–2541.

• Tractable cases of (*,2)-bounded parsimony
  Keijsper, J. C. M.; T.A. Oosterwijk, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 12 (2015), no. 1, 234- 247.