Katrin Casel

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