Christian Rosenke

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Computing optimal leaf roots of chordal cographs in linear time Journal of Graph Algorithms and Applications	2024-10-08	Paper
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time	2023-08-21	Paper
Leaf powers	2022-12-21	Paper
Narrowing down the hardness barrier of synthesizing elementary net systems	2021-08-04	Paper
The generic combinatorial algorithm for image matching with classes of projective transformations Information and Computation	2020-12-15	Paper
The complexity of synthesizing elementary net systems relative to natural parameters Journal of Computer and System Sciences	2020-03-13	Paper
Elementary net synthesis remains NP-complete even for extremely simple inputs	2019-12-18	Paper
The complexity of synthesis for 43 Boolean Petri net types	2019-10-15	Paper
Towards a characterization of leaf powers by clique arrangements Graphs and Combinatorics	2016-11-29	Paper
The exact complexity of projective image matching Journal of Computer and System Sciences	2016-08-04	Paper
Towards a characterization of leaf powers by clique arrangements Lecture Notes in Computer Science	2015-02-20	Paper
Characterizing and computing the structure of clique intersections in strongly chordal graphs Discrete Applied Mathematics	2014-12-05	Paper
Characterizing and computing the structure of clique intersections in strongly chordal graphs Graph-Theoretic Concepts in Computer Science	2013-12-06	Paper

Research outcomes over time

This page was built for person: Christian Rosenke