Informatikwissenschaften
FB IV - Wirtschafts- und Sozialwissenschaften, Mathematik, Informatikwissenschaften / Universität Trier
- 0651/
- 0651/
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.
On the Complexity Landscape of the Domination Chain.CALDAM. 2016 S. 61 - 72
Casel, Katrin; Fernau, Henning; Gaspers, Serge et al.
On the Complexity of Grammar-Based Compression over Fixed Alphabets.ICALP. 2016 S. 122:1 - 122:14
Fernau, Henning; L. Schmid, Markus; Villanger, Yngve
On the Parameterised Complexity of String Morphism Problems.Theory Comput. Syst. Bd. 59. H. 1. 2016 S. 24 - 51
Eppstein, David; Kindermann, Philipp; G. Kobourov, Stephen et al.
On the Planar Split Thickness of Graphs.LATIN. 2016 S. 403 - 415
Minor, Mirjam; Bergmann, Ralph; Müller, Jan-Martin et al.
On the Transferability of Process-Oriented Cases.ICCBR. 2016 S. 281 - 294
Fernau, Henning
Parameterized Algorithms for Drawing Graphs.Encyclopedia of Algorithms. 2016 S. 1520 - 1525
Fernau, Henning; Paramasivan, Meenakshi; Gnanaraj Thomas, D.
Picture Scanning Automata.CompIMAGE. 2016 S. 132 - 147
Björklund, Johanna; Fernau, Henning; Kasprzik, Anna
Polynomial inference of universal automata from membership and equivalence queries.Inf. Comput. Bd. 246. 2016 S. 3 - 19
Fernau, Henning; Krebs, Andreas
Problems on Finite Automata and the Exponential Time Hypothesis.CIAA. 2016 S. 89 - 100
J. Brandenburg, Franz; Didimo, Walter; S. Evans, William et al.
Recognizing and drawing IC-planar graphs.Theor. Comput. Sci. Bd. 636. 2016 S. 1 - 16