![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Ivo Hedtke
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j5]Markus Chimani, Ivo Hedtke
, Tilo Wiedera
:
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. ACM J. Exp. Algorithmics 24(1): 2.1:1-2.1:21 (2019) - 2018
- [j4]Ivo Hedtke
, Ioana M. Lemnian, Ivo Grosse, Matthias Müller-Hannemann
:
Optimal Block-Based Trimming for Next Generation Sequencing. IEEE ACM Trans. Comput. Biol. Bioinform. 15(2): 364-376 (2018) - [c4]Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. SEA 2018: 22:1-22:15 - [i6]Markus Chimani, Ivo Hedtke, Tilo Wiedera:
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. CoRR abs/1804.07143 (2018) - 2017
- [b1]Ivo Hedtke:
Minimum Genus and Maximum Planar Subgraph: Exact Algorithms and General Limits of Approximation Algorithms. University of Osnabrück, Germany, 2017 - 2016
- [c3]Markus Chimani, Ivo Hedtke
, Tilo Wiedera:
Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem. IWOCA 2016: 334-346 - [c2]Stephan Beyer
, Markus Chimani, Ivo Hedtke
, Michal Kotrbcík:
A Practical Method for the Minimum Genus of a Graph: Models and Experiments. SEA 2016: 75-88 - 2015
- [j3]Sarah Hart, Ivo Hedtke
, Matthias Müller-Hannemann
, Sandeep Murthy:
A fast search algorithm for 〈m, m, m〉 Triple Product Property triples and an application for 5×5 matrix multiplication. Groups Complex. Cryptol. 7(1): 31-46 (2015) - [j2]Ivo Hedtke
:
Upgrading Subgroup Triple-Product-Property Triples. ACM J. Exp. Algorithmics 20: 1.1:1.1-1.1:1.17 (2015) - 2014
- [c1]Ivo Hedtke
, Ioana M. Lemnian, Matthias Müller-Hannemann
, Ivo Grosse:
On Optimal Read Trimming in Next Generation Sequencing and Its Complexity. AlCoB 2014: 83-94 - 2012
- [j1]Ivo Hedtke
, Sandeep Murthy:
Search and test algorithms for triple product property triples. Groups Complex. Cryptol. 4(1): 111-133 (2012) - 2011
- [i5]Ivo Hedtke:
A Note on the Group-theoretic Approach to Fast Matrix Multiplication. CoRR abs/1101.5598 (2011) - [i4]Ivo Hedtke, Sandeep Murthy:
Search and test algorithms for Triple Product Property triples. CoRR abs/1104.5097 (2011) - [i3]Ivo Hedtke:
Methods of Matrix Multiplication: An Overview of Several Methods and their Implementation. CoRR abs/1106.1347 (2011) - [i2]Ivo Hedtke:
Upgrading Subgroup Triple Product Property Triples. CoRR abs/1107.5973 (2011) - 2010
- [i1]Ivo Hedtke:
Strassen's Matrix Multiplication Algorithm for Matrices of Arbitrary Order. CoRR abs/1007.2117 (2010)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint