A Fixed-Parameter Approach for Privacy-Protection with Global Recoding. - Katrin Casel (FAW, 2014)

Algorithmic Aspects of Upper Domination. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (CoRR, 2015)

Algorithmic Aspects of Upper Domination: A Parameterised Perspective. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (AAIM, 2016)

On the Complexity Landscape of the Domination Chain. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau (CALDAM, 2016)

On the Complexity of Grammar-Based Compression over Fixed Alphabets. - Katrin Casel; Henning Fernau; Serge Gaspers; Benjamin Gras 002; Markus L. Schmid (ICALP, 2016)

Building Clusters with Lower-Bounded Sizes. - Faisal N. Abu-Khzam; Cristina Bazgan; Katrin Casel; Henning Fernau (ISAAC, 2016)

Upper Domination: Complexity and Approximation. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (IWOCA, 2016)

Weak total resolvability in graphs. - Katrin Casel; Alejandro Estrada-Moreno; Henning Fernau; Juan Alberto Rodríguez-Velázquez (Discuss. Math. Graph Theory, 2016)

Combinatorial Properties and Recognition of Unit Square Visibility Graphs. - Katrin Casel; Henning Fernau; Alexander Grigoriev; Markus L. Schmid; Sue Whitesides (MFCS, 2017)

Resolving Conflicts for Lower-Bounded Clustering. - Katrin Casel (IPEC, 2018)

Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. - Faisal N. Abu-Khzam; Cristina Bazgan; Katrin Casel; Henning Fernau (Algorithmica, 2018)

Extension of vertex cover and independent set in some classes of graphs and generalizations. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CoRR, 2018)

The many facets of upper domination. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau; Klaus Jansen; Kim-Manuel Klein; Michael Lampis; Mathieu Liedloff; Jérôme Monnot; Vangelis Th. Paschos (Theor. Comput. Sci., 2018)

Extension of Vertex Cover and Independent Set in Some Classes of Graphs. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CIAC, 2019)

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (FCT, 2019)

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. - Katrin Casel; Joel D. Day; Pamela Fleischmann; Tomasz Kociumaka; Florin Manea; Markus L. Schmid (ICALP, 2019)

The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics. - Jakob Bossek; Katrin Casel; Pascal Kerschke; Frank Neumann 001 (GECCO, 2020)

On Counting (Quantum-)Graph Homomorphisms in Finite Fields. - J. A. Gregor Lagodzinski; Andreas Göbel 001; Katrin Casel; Tobias Friedrich 001 (CoRR, 2020)

Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. - Cristina Bazgan; Ljiljana Brankovic; Katrin Casel; Henning Fernau (Discret. Appl. Math., 2020)

Complexity of independency and cliquy trees. - Katrin Casel; Jan Dreier; Henning Fernau; Moritz Gobbert; Philipp Kuinke; Fernando Sánchez Villaamil; Markus L. Schmid; Erik Jan van Leeuwen (Discret. Appl. Math., 2020)

Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs. - Ralf Borndörfer; Katrin Casel; Davis Issac; Aikaterini Niklanovits; Stephan Schwartz; Ziena Zeif (APPROX-RANDOM, 2021)

Abundant Extensions. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (CIAC, 2021)

Balanced Crown Decomposition for Connectivity Constraints. - Katrin Casel; Tobias Friedrich 001; Davis Issac; Aikaterini Niklanovits; Ziena Zeif (ESA, 2021)

From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. - Lukas Behrendt; Katrin Casel; Tobias Friedrich 001; J. A. Gregor Lagodzinski; Alexander Löser; Marcus Wilhelm (FCT, 2021)

On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. - J. A. Gregor Lagodzinski; Andreas Göbel 001; Katrin Casel; Tobias Friedrich 001 (ICALP, 2021)

Fine-Grained Complexity of Regular Path Queries. - Katrin Casel; Markus L. Schmid (ICDT, 2021)

A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics. - Nicolas Klodt; Lars Seifert; Arthur Zahn; Katrin Casel; Davis Issac; Tobias Friedrich 001 (KDD, 2021)

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. - Katrin Casel; Henning Fernau; Serge Gaspers; Benjamin Gras 002; Markus L. Schmid (Theory Comput. Syst., 2021)

Fixed-Parameter Sensitivity Oracles. - Davide Bilò; Katrin Casel; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; J. A. Gregor Lagodzinski; Martin Schirneck; Simon Wietheger (ITCS, 2022)

PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set. - Sebastian Angrick; Ben Bals; Katrin Casel; Sarel Cohen; Tobias Friedrich 001; Niko Hastrich; Theresa Hradilak; Davis Issac; Otto Kißig; Jonas Schmidt 002; Leo Wendt (IPEC, 2022)

Dense Graph Partitioning on Sparse and Dense Graphs. - Cristina Bazgan; Katrin Casel; Pierre Cazals (SWAT, 2022)

Zeros and approximations of Holant polynomials on the complex plane. - Katrin Casel; Philipp Fischbeck; Tobias Friedrich 001; Andreas Göbel 001; J. A. Gregor Lagodzinski (Comput. Complex., 2022)

On the complexity of solution extension of optimization problems. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (Theor. Comput. Sci., 2022)

Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. - Ivan Khomutovskiy; Rebekka Dunker; Jessica Dierking; Julian Egbert; Christian Helms; Finn Schöllkopf; Katrin Casel; Philipp Fischbeck; Tobias Friedrich 001; Davis Issac; Simon Krogmann; Pascal Lenzner (ALENEX, 2023)

Fair Correlation Clustering in Forests. - Katrin Casel; Tobias Friedrich 001; Martin Schirneck; Simon Wietheger (FORC, 2023)

Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover. - Sebastian Angrick; Ben Bals; Katrin Casel; Sarel Cohen; Tobias Friedrich 001; Niko Hastrich; Theresa Hradilak; Davis Issac; Otto Kißig; Jonas Schmidt 002; Leo Wendt (SEA, 2023)

Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. - Katrin Casel; Tobias Friedrich 001; Davis Issac; Aikaterini Niklanovits; Ziena Zeif (WG, 2023)

Open Problems in (Hyper)Graph Decomposition. - Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; Tobias Heuer; George Karypis; Kamer Kaya; et al. (CoRR, 2023)

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). - George Karypis; Christian Schulz 003; Darren Strash; Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; et al. (Dagstuhl Reports, 2023)

Extension of some edge graph problems: Standard, parameterized and approximation complexity. - Katrin Casel; Henning Fernau; Mehdi Khosravian Ghadikolaei; Jérôme Monnot; Florian Sikora (Discret. Appl. Math., 2023)

Incremental Ordering for Scheduling Problems. - Stefan Neubert; Katrin Casel (ICAPS, 2024)

Combining Crown Structures for Vulnerability Measures. - Katrin Casel; Tobias Friedrich 001; Aikaterini Niklanovits; Kirill Simonov; Ziena Zeif (IPEC, 2024)

Shortest distances as enumeration problem. - Katrin Casel; Tobias Friedrich 001; Stefan Neubert; Markus L. Schmid (Discret. Appl. Math., 2024)

Emit As You Go: Enumerating Edges of a Spanning Tree. - Katrin Casel; Stefan Neubert (AAMAS, 2025)