Provably Secure Steganography and the Complexity of Sampling. - Christian Hundt 001; Maciej Liskiewicz; Ulrich Wölfel (ISAAC, 2006)

On the Complexity of Affine Image Matching. - Christian Hundt 001; Maciej Liskiewicz (STACS, 2007)

A Combinatorial Geometric Approach to Linear Image Matching. - Christian Hundt 001; Maciej Liskiewicz (Electron. Colloquium Comput. Complex., 2007)

Algorithms and Implementation for Interconnection Graph Problem. - Hongbing Fan; Christian Hundt 001; Yu-Liang Wu; Jason Ernst (COCOA, 2008)

Damaged BZip Files Are Difficult to Repair. - Christian Hundt 001; Ulf Ochsenfahrt (COCOON, 2008)

Two-Dimensional Pattern Matching with Combined Scaling and Rotation. - Christian Hundt 001; Maciej Liskiewicz (CPM, 2008)

Ptolemaic Graphs and Interval Graphs Are Leaf Powers. - Andreas Brandstädt; Christian Hundt 001 (LATIN, 2008)

Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations. - Christian Hundt 001; Maciej Liskiewicz (MFCS, 2008)

A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation. - Christian Hundt 001; Maciej Liskiewicz; Ragnar Nevries (Theor. Comput. Sci., 2009)

Affine Image Matching Is Uniform TC0-Complete. - Christian Hundt 001 (CPM, 2010)

Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. - Andreas Brandstädt; Christian Hundt 001; Ragnar Nevries (LATIN, 2010)

Rooted directed path graphs are leaf powers. - Andreas Brandstädt; Christian Hundt 001; Federico Mancini 001; Peter Wagner 002 (Discret. Math., 2010)

New complexity bounds for image matching under rotation and scaling. - Christian Hundt 001; Maciej Liskiewicz (J. Discrete Algorithms, 2011)

Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation. - Christian Hundt 001; Florian Wendland (CPM, 2012)

On the computational complexity of projective image matching. - Christian Hundt 001 (2012)

How Can Semantic Annotations Support the Identification of Network Similarities? - Christian Rosenke; Dagmar Waltemath (SWAT4LS, 2014)

Characterizing and computing the structure of clique intersections in strongly chordal graphs. - Ragnar Nevries; Christian Rosenke (Discret. Appl. Math., 2015)

Towards a Characterization of Leaf Powers by Clique Arrangements. - Ragnar Nevries; Christian Rosenke (Graphs Comb., 2016)

The exact complexity of projective image matching. - Christian Rosenke (J. Comput. Syst. Sci., 2016)

Finding patterns in biochemical reaction networks. - Ron Henkel; Fabienne Lambusch; Olaf Wolkenhauer; Kurt Sandkuhl; Christian Rosenke; Dagmar Waltemath (PeerJ Prepr., 2016)

The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs. - Christian Rosenke; Ronny Tredup (CoRR, 2017)

Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple Inputs. - Ronny Tredup; Christian Rosenke; Karsten Wolf (Petri Nets, 2018)

Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems. - Ronny Tredup; Christian Rosenke (CONCUR, 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)

Towards Completely Characterizing the Complexity of Boolean Nets Synthesis. - Ronny Tredup; Christian Rosenke (CoRR, 2018)

On the Hardness of Synthesizing Boolean Nets. - Ronny Tredup; Christian Rosenke (ATAED@Petri Nets/ACSD, 2019)

The Complexity of Synthesis for 43 Boolean Petri Net Types. - Ronny Tredup; Christian Rosenke (TAMC, 2019)

Faster Enabledness-Updates for the Reachability Graph Computation. - Torsten Liebke; Christian Rosenke (PNSE@Petri Nets, 2020)

The generic combinatorial algorithm for image matching with classes of projective transformations. - Christian Rosenke; Maciej Liskiewicz (Inf. Comput., 2020)

The complexity of synthesizing elementary net systems relative to natural parameters. - Christian Rosenke; Ronny Tredup (J. Comput. Syst. Sci., 2020)

Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. - Van Bang Le; Christian Rosenke (J. Graph Algorithms Appl., 2024)