Ivo Hedtke

Orcid: 0000-0003-0335-7825

According to our database1, Ivo Hedtke authored at least 12 papers between 2010 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments.
ACM J. Exp. Algorithmics, 2019

2018
Optimal Block-Based Trimming for Next Generation Sequencing.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

2017
Minimum Genus and Maximum Planar Subgraph: Exact Algorithms and General Limits of Approximation Algorithms
PhD thesis, 2017

2016
A Practical Method for the Minimum Genus of a Graph: Models and Experiments.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015
Upgrading Subgroup Triple-Product-Property Triples.
ACM J. Exp. Algorithmics, 2015

A fast search algorithm for 〈m, m, m〉 Triple Product Property triples and an application for 5×5 matrix multiplication.
Groups Complex. Cryptol., 2015

2014
On Optimal Read Trimming in Next Generation Sequencing and Its Complexity.
Proceedings of the Algorithms for Computational Biology - First International Conference, 2014

2012
Search and test algorithms for triple product property triples.
Groups Complex. Cryptol., 2012

2011
Methods of Matrix Multiplication: An Overview of Several Methods and their Implementation
CoRR, 2011

A Note on the Group-theoretic Approach to Fast Matrix Multiplication
CoRR, 2011

2010
Strassen's Matrix Multiplication Algorithm for Matrices of Arbitrary Order
CoRR, 2010


  Loading...