Folgen
Katrin Casel
Katrin Casel
Hasso-Plattner-Institute, University Potsdam
Bestätigte E-Mail-Adresse bei hpi.de
Titel
Zitiert von
Zitiert von
Jahr
The many facets of upper domination
C Bazgan, L Brankovic, K Casel, H Fernau, K Jansen, KM Klein, ...
Theoretical Computer Science 717, 2-25, 2018
382018
On the complexity of grammar-based compression over fixed alphabets
K Casel, H Fernau, S Gaspers, B Gras, ML Schmid
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
192016
On the complexity of solution extension of optimization problems
K Casel, H Fernau, MK Ghadikolaei, J Monnot, F Sikora
Theoretical Computer Science 904, 48-65, 2022
162022
Extension of vertex cover and independent set in some classes of graphs
K Casel, H Fernau, MK Ghadikoalei, J Monnot, F Sikora
International Conference on Algorithms and Complexity, 124-136, 2019
142019
Upper domination: Complexity and approximation
C Bazgan, L Brankovic, K Casel, H Fernau, K Jansen, KM Klein, ...
International Workshop on Combinatorial Algorithms, 241-252, 2016
142016
On the complexity landscape of the domination chain
C Bazgan, L Brankovic, K Casel, H Fernau
Conference on Algorithms and Discrete Applied Mathematics, 61-72, 2016
122016
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability
C Bazgan, L Brankovic, K Casel, H Fernau
Discrete Applied Mathematics 280, 23-42, 2020
102020
Complexity of independency and cliquy trees
K Casel, J Dreier, H Fernau, M Gobbert, P Kuinke, FS Villaamil, ...
Discrete Applied Mathematics 272, 2-15, 2020
92020
Algorithmic aspects of upper domination: a parameterised perspective
C Bazgan, L Brankovic, K Casel, H Fernau, K Jansen, KM Klein, ...
International Conference on Algorithmic Applications in Management, 113-124, 2016
92016
Fine-grained complexity of regular path queries
K Casel, ML Schmid
arXiv preprint arXiv:2101.01945, 2021
82021
Zeros and approximations of Holant polynomials on the complex plane
K Casel, P Fischbeck, T Friedrich, A Göbel, JA Lagodzinski
computational complexity 31 (2), 1-52, 2022
72022
Extension of some edge graph problems: Standard and parameterized complexity
K Casel, H Fernau, M Khosravian Ghadikolaei, J Monnot, F Sikora
International Symposium on Fundamentals of Computation Theory, 185-200, 2019
72019
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets
K Casel, H Fernau, S Gaspers, B Gras, ML Schmid
Theory of Computing Systems 65 (2), 344-409, 2021
62021
Graph and string parameters: connections between pathwidth, cutwidth and the locality number
K Casel, JD Day, P Fleischmann, T Kociumaka, F Manea, ML Schmid
arXiv preprint arXiv:1902.10983, 2019
62019
Balanced crown decomposition for connectivity constraints
K Casel, T Friedrich, D Issac, A Niklanovits, Z Zeif
arXiv preprint arXiv:2011.04528, 2020
42020
The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics
J Bossek, K Casel, P Kerschke, F Neumann
Proceedings of the 2020 Genetic and Evolutionary Computation Conference …, 2020
42020
Clustering with lower-bounded sizes
FN Abu-Khzam, C Bazgan, K Casel, H Fernau
Algorithmica 80 (9), 2517-2550, 2018
42018
Building clusters with lower-bounded sizes
F Abu-Khzam, C Bazgan, K Casel, H Fernau
27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016
42016
A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics
N Klodt, L Seifert, A Zahn, K Casel, D Issac, T Friedrich
Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data …, 2021
32021
Dense Graph Partitioning on sparse and dense graphs
C Bazgan, K Casel, P Cazals
arXiv preprint arXiv:2107.13282, 2021
22021
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20