Katrin Casel

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 59

Top Topics

Correlation Clustering

Independent Set

Travelling Salesman

Top Venues

Discret. Appl. Math.

Publications

Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid
Shortest distances as enumeration problem. Discret. Appl. Math. 342 (2024)
Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif
Combining Crown Structures for Vulnerability Measures. CoRR (2024)
Stefan Neubert, Katrin Casel
Incremental Ordering for Scheduling Problems. ICAPS (2024)
Katrin Casel, Markus L. Schmid
Fine-Grained Complexity of Regular Path Queries. Log. Methods Comput. Sci. 19 (4) (2023)
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, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman
Open Problems in (Hyper)Graph Decomposition. CoRR (2023)
Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm
From symmetry to asymmetry: Generalizing TSP approximations by parametrization. J. Comput. Syst. Sci. 136 (2023)
Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. Discret. Comput. Geom. 69 (4) (2023)
Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt
Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover. SEA (2023)
Katrin Casel, Tobias Friedrich, Martin Schirneck, Simon Wietheger
Fair Correlation Clustering in Forests. FORC (2023)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of some edge graph problems: Standard, parameterized and approximation complexity. Discret. Appl. Math. 340 (2023)
Ivan Khomutovskiy, Rebekka Dunker, Jessica Dierking, Julian Egbert, Christian Helms, Finn Schöllkopf, Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Davis Issac, Simon Krogmann, Pascal Lenzner
Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. ALENEX (2023)
Katrin Casel, Tobias Friedrich, Martin Schirneck, Simon Wietheger
Fair Correlation Clustering in Forests. CoRR (2023)
Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. WG (2023)
George Karypis, Christian Schulz, 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, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13 (8) (2023)
Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. CoRR (2022)
Cristina Bazgan, Katrin Casel, Pierre Cazals
Dense Graph Partitioning on Sparse and Dense Graphs. SWAT (2022)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
On the complexity of solution extension of optimization problems. Theor. Comput. Sci. 904 (2022)
Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger
Fixed-Parameter Sensitivity Oracles. ITCS (2022)
Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt
PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set. IPEC (2022)
Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski
Zeros and approximations of Holant polynomials on the complex plane. Comput. Complex. 31 (2) (2022)
Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, Ziena Zeif
Connected $k$-partition of $k$-connected graphs and $c$-claw-free graphs. CoRR (2021)
Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
Balanced Crown Decomposition for Connectivity Constraints. ESA (2021)
Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, Ziena Zeif
Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs. APPROX-RANDOM (2021)
Cristina Bazgan, Katrin Casel, Pierre Cazals
Dense Graph Partitioning on sparse and dense graphs. CoRR (2021)
Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger
Fixed-Parameter Sensitivity Oracles. CoRR (2021)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Abundant Extensions. CIAC (2021)
Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. FCT (2021)
Katrin Casel, Markus L. Schmid
Fine-Grained Complexity of Regular Path Queries. CoRR (2021)
Nicolas Klodt, Lars Seifert, Arthur Zahn, Katrin Casel, Davis Issac, Tobias Friedrich
A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics. KDD (2021)
Katrin Casel, Markus L. Schmid
Fine-Grained Complexity of Regular Path Queries. ICDT (2021)
Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory Comput. Syst. 65 (2) (2021)
J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. ICALP (2021)
Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen
Complexity of independency and cliquy trees. Discret. Appl. Math. 272 (2020)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. Discret. Appl. Math. 280 (2020)
Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid
Shortest Distances as Enumeration Problem. CoRR (2020)
J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich
On Counting (Quantum-)Graph Homomorphisms in Finite Fields. CoRR (2020)
Jakob Bossek, Katrin Casel, Pascal Kerschke, Frank Neumann
The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. CoRR (2020)
Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
Balanced Crown Decomposition for Connectivity Constraints. CoRR (2020)
Jakob Bossek, Katrin Casel, Pascal Kerschke, Frank Neumann
The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics. GECCO (2020)
Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. CoRR (2019)
Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. ICALP (2019)
Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. CoRR (2019)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. FCT (2019)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of Vertex Cover and Independent Set in Some Classes of Graphs. CIAC (2019)
Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski
Zeros and approximations of Holant polynomials on the complex plane. CoRR (2019)
Katrin Casel
Resolving Conflicts for Lower-Bounded Clustering. IPEC (2018)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
On the Complexity of Solution Extension of Optimization Problems. CoRR (2018)
Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau
Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. Algorithmica 80 (9) (2018)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
The many facets of upper domination. Theor. Comput. Sci. 717 (2018)
Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
Extension of vertex cover and independent set in some classes of graphs and generalizations. CoRR (2018)
Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. CoRR (2017)
Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. MFCS (2017)
Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau
Building Clusters with Lower-Bounded Sizes. ISAAC (2016)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
Upper Domination: Complexity and Approximation. IWOCA (2016)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM (2016)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau
On the Complexity Landscape of the Domination Chain. CALDAM (2016)
Katrin Casel, Alejandro Estrada-Moreno, Henning Fernau, Juan Alberto Rodríguez-Velázquez
Weak total resolvability in graphs. Discuss. Math. Graph Theory 36 (1) (2016)
Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid
On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP (2016)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
Algorithmic Aspects of Upper Domination. CoRR (2015)
Katrin Casel
A Fixed-Parameter Approach for Privacy-Protection with Global Recoding. FAW (2014)