Christian Rosenke

According to our database, Christian Rosenke authored at least 31 papers between 2006 and 2023.

Collaborative distances:

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

2023

Computing Optimal Leaf Roots of Chordal Cographs in Linear Time.

Van Bang Le, Christian Rosenke

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2020

The complexity of synthesizing elementary net systems relative to natural parameters.

Christian Rosenke, Ronny Tredup

J. Comput. Syst. Sci., 2020

The generic combinatorial algorithm for image matching with classes of projective transformations.

Christian Rosenke, Maciej Liskiewicz

Inf. Comput., 2020

Faster Enabledness-Updates for the Reachability Graph Computation.

Torsten Liebke, Christian Rosenke

Proceedings of the International Workshop on Petri Nets and Software Engineering co-located with 41st International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2020), 2020

2019

The Complexity of Synthesis for 43 Boolean Petri Net Types.

Ronny Tredup, Christian Rosenke

Proceedings of the Theory and Applications of Models of Computation, 2019

On the Hardness of Synthesizing Boolean Nets.

Ronny Tredup, Christian Rosenke

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2019 Satellite event of the conferences: 40th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2019 and 19th International Conference on Application of Concurrency to System Design ACSD 2019, 2019

2018

Towards Completely Characterizing the Complexity of Boolean Nets Synthesis.

Ronny Tredup, Christian Rosenke

CoRR, 2018

Identifying frequent patterns in biochemical reaction networks: a workflow.

Fabienne Lambusch, Dagmar Waltemath, Olaf Wolkenhauer, Kurt Sandkuhl, Christian Rosenke, Ron Henkel

Database J. Biol. Databases Curation, 2018

Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems.

Ronny Tredup, Christian Rosenke

Proceedings of the 29th International Conference on Concurrency Theory, 2018

Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple Inputs.

Ronny Tredup, Christian Rosenke, Karsten Wolf

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

2017

The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs.

Christian Rosenke, Ronny Tredup

CoRR, 2017

2016

Finding patterns in biochemical reaction networks.

Ron Henkel, Fabienne Lambusch, Olaf Wolkenhauer, Kurt Sandkuhl, Christian Rosenke, Dagmar Waltemath

PeerJ Prepr., 2016

The exact complexity of projective image matching.

Christian Rosenke

J. Comput. Syst. Sci., 2016

Towards a Characterization of Leaf Powers by Clique Arrangements.

Ragnar Nevries, Christian Rosenke

Graphs Comb., 2016

2015

Characterizing and computing the structure of clique intersections in strongly chordal graphs.

Ragnar Nevries, Christian Rosenke

Discret. Appl. Math., 2015

2014

How Can Semantic Annotations Support the Identification of Network Similarities?

Christian Rosenke, Dagmar Waltemath

Proceedings of the 7th International Workshop on Semantic Web Applications and Tools for Life Sciences, 2014

2012

On the computational complexity of projective image matching.

Christian Hundt

PhD thesis, 2012

Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation.

Christian Hundt, Florian Wendland

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

New complexity bounds for image matching under rotation and scaling.

Christian Hundt, Maciej Liskiewicz

J. Discrete Algorithms, 2011

2010

Rooted directed path graphs are leaf powers.

Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter Wagner

Discret. Math., 2010

Efficient Edge Domination on Hole-Free Graphs in Polynomial Time.

Andreas Brandstädt, Christian Hundt, Ragnar Nevries

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Affine Image Matching Is Uniform TC⁰-Complete.

Christian Hundt

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation.

Christian Hundt, Maciej Liskiewicz, Ragnar Nevries

Theor. Comput. Sci., 2009

2008

Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations.

Christian Hundt, Maciej Liskiewicz

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Ptolemaic Graphs and Interval Graphs Are Leaf Powers.

Andreas Brandstädt, Christian Hundt

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Two-Dimensional Pattern Matching with Combined Scaling and Rotation.

Christian Hundt, Maciej Liskiewicz

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

Damaged BZip Files Are Difficult to Repair.

Christian Hundt, Ulf Ochsenfahrt

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Algorithms and Implementation for Interconnection Graph Problem.

Hongbing Fan, Christian Hundt, Yu-Liang Wu, Jason Ernst

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

A Combinatorial Geometric Approach to Linear Image Matching.

Christian Hundt, Maciej Liskiewicz

Electron. Colloquium Comput. Complex., 2007

On the Complexity of Affine Image Matching.

Christian Hundt, Maciej Liskiewicz

Proceedings of the STACS 2007, 2007

2006

Provably Secure Steganography and the Complexity of Sampling.

Christian Hundt, Maciej Liskiewicz, Ulrich Wölfel

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006