default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJudith Keijsper
Person information
- affiliation: Eindhoven University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j13]Judith Keijsper, Tim Oosterwijk
:
Tractable Cases of (*, 2)-Bounded Parsimony Haplotyping. IEEE ACM Trans. Comput. Biol. Bioinform. 12(1): 234-247 (2015)- 2011
- [j12]J. C. M. Keijsper, Rudi Pendavingh:
Convex minization over Z2. Oper. Res. Lett. 39(1): 53-56 (2011)
2000 – 2009
- 2009
- [j11]Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, Ferry Hagen, Teun Boekhout:
Constructing Level-2 Phylogenetic Networks from Triplets. IEEE ACM Trans. Comput. Biol. Bioinform. 6(4): 667-681 (2009) - 2008
- [j10]Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie:
Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 5(2): 301-312 (2008) - [c4]Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, Ferry Hagen, Teun Boekhout:
Constructing Level-2 Phylogenetic Networks from Triplets. RECOMB 2008: 450-462 - 2007
- [j9]Cor A. J. Hurkens, J. C. M. Keijsper, Leen Stougie:
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. SIAM J. Discret. Math. 21(2): 482-503 (2007) - [j8]Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp:
Prefix Reversals on Binary and Ternary Strings. SIAM J. Discret. Math. 21(3): 592-611 (2007) - [c3]Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp:
Prefix Reversals on Binary and Ternary Strings. AB 2007: 292-306 - 2006
- [j7]Judith Keijsper, Rudi Pendavingh, Leen Stougie:
A linear programming formulation of Mader's edge-disjoint paths problem. J. Comb. Theory B 96(1): 159-163 (2006) - [c2]Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie:
Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. WABI 2006: 80-91 - 2005
- [c1]Cor A. J. Hurkens, Judith Keijsper, Leen Stougie:
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. IPCO 2005: 407-421 - 2003
- [j6]Judith Keijsper:
A Vizing-type theorem for matching forests. Discret. Math. 260(1-3): 211-216 (2003) - 2002
- [j5]Judith Keijsper, Meike Tewes:
Conditions for β-perfectness. Discuss. Math. Graph Theory 22(1): 123-148 (2002) - 2000
- [j4]Judith Keijsper, Rudi Pendavingh, Alexander Schrijver:
Adjacency, Inseparability, and Base Orderability in Matroids. Eur. J. Comb. 21(4): 487-502 (2000)
1990 – 1999
- 1998
- [j3]Judith Keijsper, Rudi Pendavingh:
An Efficient Algorithm for Minimum-Weight Bibranching. J. Comb. Theory B 73(2): 130-145 (1998) - [j2]Judith Keijsper, Alexander Schrijver:
On Packing Connectors. J. Comb. Theory B 73(2): 184-188 (1998) - [j1]Judith Keijsper:
An Algorithm for Packing Connectors. J. Comb. Theory B 74(2): 397-404 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
