Heinz Breu

According to our database, Heinz Breu authored at least 8 papers between 1989 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

RNA-Seq Mapping and Detection of Gene Fusions with a Suffix Array Algorithm.

Onur Sakarya, Heinz Breu, Milan Radovich, Yongzhi Chen, Yulei N. Wang, Catalin C. Barbacioru, Sowmi Utiramerur, Penn P. Whitley, Joel P. Brockman, Paolo Vatta, Zheng Zhang, Liviu Popescu, Matthew W. Muller, Vidya Kudlingar, Nriti Garg, Chieh-Yuan Li, Benjamin S. Kong, John P. Bodeau, Robert C. Nutter, Jian Gu, Kelli S. Bramlett, Jeffrey K. Ichikawa, Fiona C. Hyland, Asim S. Siddiqui

PLoS Comput. Biol., 2012

Workshop: Gene fusion detection with short and medium length next generation sequencing.

Onur Sakarya, Heinz Breu

Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

1998

Unit disk graph recognition is NP-hard.

Heinz Breu, David G. Kirkpatrick

Comput. Geom., 1998

1995

Linear Time Euclidean Distance Algorithms.

Heinz Breu, Joseph Gil, David G. Kirkpatrick, Michael Werman

IEEE Trans. Pattern Anal. Mach. Intell., 1995

Simple heuristics for unit disk graphs.

Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz

Networks, 1995

On the Complexity of Recognizing Intersection and Touching Graphs of Disks.

Heinz Breu, David G. Kirkpatrick

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994

Geometry based heuristics for unit disk graphs.

Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz

CoRR, 1994

1989

An Efficient Algorithm for Finding all Maximal Square Blocks in a Matrix.

Heinz Breu

Proceedings of the Algorithms and Data Structures, 1989