default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatrin Casel
Person information
- affiliation: Humboldt-University Berlin, Germany
- affiliation (former): Hasso-Plattner-Institut, Potsdam, Germany
- affiliation (former): University of Trier, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Katrin Casel, Tobias Friedrich, Stefan Neubert
, Markus L. Schmid:
Shortest distances as enumeration problem. Discret. Appl. Math. 342: 89-103 (2024)- [c28]Stefan Neubert, Katrin Casel:
Incremental Ordering for Scheduling Problems. ICAPS 2024: 405-413 - [c27]Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif:
Combining Crown Structures for Vulnerability Measures. IPEC 2024: 1:1-1:15 - [i20]Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif:
Combining Crown Structures for Vulnerability Measures. CoRR abs/2405.02378 (2024) - 2023
- [j12]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: 183-201 (2023) - [j11]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): 937-980 (2023) - [j10]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: 157-170 (2023) - [j9]Katrin Casel, Markus L. Schmid:
Fine-Grained Complexity of Regular Path Queries. Log. Methods Comput. Sci. 19(4) (2023) - [c26]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: 110-122 - [c25]Katrin Casel, Tobias Friedrich, Martin Schirneck, Simon Wietheger:
Fair Correlation Clustering in Forests. FORC 2023: 9:1-9:12 - [c24]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: 10:1-10:14 - [c23]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: 143-156 - [i19]Katrin Casel, Tobias Friedrich, Martin Schirneck, Simon Wietheger:
Fair Correlation Clustering in Forests. CoRR abs/2302.11295 (2023) - [i18]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 abs/2310.11812 (2023) - [i17]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): 1-45 (2023) - 2022
- [j8]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): 11 (2022) - [j7]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: 48-65 (2022) - [c22]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. ITCS 2022: 23:1-23:18 - [c21]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: 28:1-28:4 - [c20]Cristina Bazgan, Katrin Casel, Pierre Cazals:
Dense Graph Partitioning on Sparse and Dense Graphs. SWAT 2022: 13:1-13:15 - [i16]Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. CoRR abs/2207.09262 (2022) - 2021
- [j6]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): 344-409 (2021) - [c19]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: 27:1-27:14 - [c18]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Abundant Extensions. CIAC 2021: 3-17 - [c17]Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Balanced Crown Decomposition for Connectivity Constraints. ESA 2021: 26:1-26:15 - [c16]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: 53-66 - [c15]J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich:
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. ICALP 2021: 91:1-91:15 - [c14]Katrin Casel, Markus L. Schmid:
Fine-Grained Complexity of Regular Path Queries. ICDT 2021: 19:1-19:20 - [c13]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: 882-891 - [i15]Katrin Casel, Markus L. Schmid:
Fine-Grained Complexity of Regular Path Queries. CoRR abs/2101.01945 (2021) - [i14]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 abs/2107.04837 (2021) - [i13]Cristina Bazgan, Katrin Casel, Pierre Cazals:
Dense Graph Partitioning on sparse and dense graphs. CoRR abs/2107.13282 (2021) - [i12]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. CoRR abs/2112.03059 (2021) - 2020
- [j5]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: 2-15 (2020) - [j4]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau:
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. Discret. Appl. Math. 280: 23-42 (2020) - [c12]Jakob Bossek, Katrin Casel, Pascal Kerschke, Frank Neumann:
The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics. GECCO 2020: 1286-1294 - [i11]Jakob Bossek, Katrin Casel, Pascal Kerschke, Frank Neumann:
The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. CoRR abs/2002.01070 (2020) - [i10]Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid:
Shortest Distances as Enumeration Problem. CoRR abs/2005.06827 (2020) - [i9]Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Balanced Crown Decomposition for Connectivity Constraints. CoRR abs/2011.04528 (2020) - [i8]J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich:
On Counting (Quantum-)Graph Homomorphisms in Finite Fields. CoRR abs/2011.04827 (2020)
2010 – 2019
- 2019
- [c11]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: 124-136 - [c10]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: 185-200 - [c9]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: 109:1-109:16 - [i7]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 abs/1902.10983 (2019) - [i6]Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski:
Zeros and approximations of Holant polynomials on the complex plane. CoRR abs/1905.03194 (2019) - [i5]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 abs/1911.02453 (2019) - 2018
- [j3]Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau:
Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. Algorithmica 80(9): 2517-2550 (2018) - [j2]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: 2-25 (2018) - [c8]Katrin Casel:
Resolving Conflicts for Lower-Bounded Clustering. IPEC 2018: 23:1-23:14 - [i4]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
On the Complexity of Solution Extension of Optimization Problems. CoRR abs/1810.04553 (2018) - [i3]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 abs/1810.04629 (2018) - 2017
- [c7]Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides:
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. MFCS 2017: 30:1-30:15 - [i2]Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides:
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. CoRR abs/1706.05906 (2017) - 2016
- [j1]Katrin Casel, Alejandro Estrada-Moreno, Henning Fernau, Juan Alberto Rodríguez-Velázquez:
Weak total resolvability in graphs. Discuss. Math. Graph Theory 36(1): 185-210 (2016) - [c6]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: 113-124 - [c5]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau:
On the Complexity Landscape of the Domination Chain. CALDAM 2016: 61-72 - [c4]Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid:
On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP 2016: 122:1-122:14 - [c3]Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau:
Building Clusters with Lower-Bounded Sizes. ISAAC 2016: 4:1-4:13 - [c2]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: 241-252 - 2015
- [i1]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 abs/1506.07260 (2015) - 2014
- [c1]Katrin Casel:
A Fixed-Parameter Approach for Privacy-Protection with Global Recoding. FAW 2014: 25-35
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 02:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
