Alejandro A. Schäffer

Available identifiers

zbMath Open schaffer.alejandro-aMaRDI QIDQ672747

List of research outcomes

Publication	Date of Publication	Type
Approximation algorithms for a genetic diagnostics problem	2022-08-19	Paper
Tumor classification using phylogenetic methods on expression data	2020-06-03	Paper
Tumor copy number deconvolution integrating bulk and single-cell sequencing data	2019-05-21	Paper
Multiple matching of rectangular patterns	2015-05-07	Paper
A comprehensive continuous-time model for the appearance of CGH signal due to chromosomal missegregations during mitosis	2005-11-22	Paper
Inverse inbreeding coefficient problems with an application to linkage analysis of recessive diseases in inbred populations	2002-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4252367	1999-09-15	Paper
Multiple matching of parameterized patterns	1997-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q4893461	1996-10-30	Paper
Dynamic dictionary matching with failure functions	1996-02-26	Paper
Improved dynamic dictionary matching	1995-08-02	Paper
Optimal edge ranking of trees in polynomial time	1995-06-19	Paper
Multiple matching of rectangular patterns	1995-05-28	Paper
https://portal.mardi4nfdi.de/entity/Q3140414	1994-11-29	Paper
Triangulating Three-Colored Graphs in Linear Time and Linear Space	1994-10-31	Paper
Markov analysis of multiple-disk prefetching strategies for external merging	1994-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q3140443	1994-01-02	Paper
Finding the prime factors of strong direct product graphs in polynomial time	1993-10-14	Paper
A faster algorithm to recognize undirected path graphs	1993-08-10	Paper
An implicit data structure for searching a multikey table in logarithmic time	1992-06-28	Paper
A Note on Finding a Strict Saddlepoint	1992-06-27	Paper
Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam	1992-06-25	Paper
Simple Local Search Problems that are Hard to Solve	1991-01-01	Paper
Time bounds on fault‐tolerant broadcasting	1989-01-01	Paper
Graph spanners	1989-01-01	Paper
Optimal node ranking of tree in linear time	1989-01-01	Paper
Fast Parallel Algorithms for Chordal Graphs	1989-01-01	Paper
Computing the bump number with techniques from two-processor scheduling	1988-01-01	Paper
A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm	1988-01-01	Paper
A note on the chromatic number of the alternative negation of two graphs	1988-01-01	Paper
Recognizing Bellman–Ford-Orderable Graphs	1988-01-01	Paper
Convex hulls of piecewise-smooth Jordan curves	1987-01-01	Paper
Shortest prefix strings containing all subset permutations	1987-01-01	Paper
On Gossiping with Faulty Telephone Lines	1987-01-01	Paper
Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism	1986-01-01	Paper
A polynomial time algorithm for finding the prime factors of Cartesian- product graphs	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3844985	1960-01-01	Paper

Research outcomes over time

This page was built for person: Alejandro A. Schäffer