Katrin Casel

From MaRDI portal
Revision as of 12:32, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:722538

Available identifiers

zbMath Open casel.katrinMaRDI QIDQ722538

List of research outcomes





PublicationDate of PublicationType
Dense graph partitioning on sparse and dense graphs2024-05-27Paper
Applying skeletons to speed up the Arc-Flags routing algorithm2024-05-24Paper
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs2024-05-03Paper
https://portal.mardi4nfdi.de/entity/Q61262492024-04-09Paper
Shortest distances as enumeration problem2024-01-24Paper
Fine-Grained Complexity of Regular Path Queries2024-01-16Paper
https://portal.mardi4nfdi.de/entity/Q60909022023-11-20Paper
https://portal.mardi4nfdi.de/entity/Q60759142023-09-20Paper
Extension of some edge graph problems: standard, parameterized and approximation complexity2023-09-14Paper
From symmetry to asymmetry: generalizing TSP approximations by parametrization2023-06-12Paper
Combinatorial properties and recognition of unit square visibility graphs2023-05-12Paper
Zeros and approximations of holant polynomials on the complex plane2022-09-02Paper
https://portal.mardi4nfdi.de/entity/Q50912712022-07-21Paper
From symmetry to asymmetry: generalizing TSP approximations by parametrization2022-05-20Paper
On the complexity of solution extension of optimization problems2022-02-01Paper
https://portal.mardi4nfdi.de/entity/Q50094862021-08-04Paper
On the complexity of the smallest grammar problem over fixed alphabets2021-06-24Paper
https://portal.mardi4nfdi.de/entity/Q51112442020-05-26Paper
Domination chain: characterisation, classical complexity, parameterised complexity and approximability2020-05-18Paper
Extension of Vertex Cover and Independent Set in some classes of graphs2020-02-06Paper
Extension of some edge graph problems: standard and parameterized complexity2020-01-30Paper
Complexity of independency and cliquy trees2019-12-30Paper
Clustering with lower-bounded sizes. A general graph-theoretic framework2018-07-26Paper
https://portal.mardi4nfdi.de/entity/Q46364852018-04-19Paper
The many facets of upper domination2018-03-13Paper
On the Complexity of Grammar-Based Compression over Fixed Alphabets2017-12-19Paper
Algorithmic Aspects of Upper Domination: A Parameterised Perspective2016-11-09Paper
Upper Domination: Complexity and Approximation2016-09-29Paper
On the Complexity Landscape of the Domination Chain2016-03-23Paper
Weak total resolvability in graphs2016-01-26Paper
A Fixed-Parameter Approach for Privacy-Protection with Global Recoding2014-09-02Paper

Research outcomes over time

This page was built for person: Katrin Casel