Esther Galby

From MaRDI portal
Revision as of 21:32, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:827594

Available identifiers

zbMath Open galby.estherMaRDI QIDQ827594

List of research outcomes

PublicationDate of PublicationType
Domination and Cut Problems on Chordal Graphs with Bounded Leafage2024-04-24Paper
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters2023-10-13Paper
Parameterized complexity of multicut in weighted trees2023-10-12Paper
Parameterized complexity of weighted multicut in trees2023-05-05Paper
The complexity of blocking (semi)total dominating sets with edge contractions2023-03-17Paper
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs2023-03-13Paper
https://portal.mardi4nfdi.de/entity/Q58755822023-02-03Paper
Using edge contractions to reduce the semitotal domination number2022-11-17Paper
https://portal.mardi4nfdi.de/entity/Q50924032022-07-21Paper
Reducing the domination number of \(( P_3 + k P_2 )\)-free graphs via one edge contraction2021-10-21Paper
Blocking total dominating sets via edge contractions2021-06-23Paper
Reducing the domination number of graphs via edge contractions and vertex deletions2021-01-21Paper
CPG graphs: some structural and hardness results2021-01-13Paper
Characterising circular-arc contact \(B_0\)-VPG graphs2020-06-29Paper
Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width2020-03-12Paper
Blocking dominating sets for $H$-free graphs via edge contractions2019-06-28Paper
Proper circular arc graphs as intersection graphs of paths on a grid2019-05-23Paper
Classifying \(k\)-edge colouring for \(H\)-free graphs2019-04-26Paper
Reducing the domination number of graphs via edge contractions2019-03-05Paper
On contact graphs of paths on a grid2019-02-15Paper
On the Parameterized Complexity of $k$-Edge Colouring2019-01-07Paper
https://portal.mardi4nfdi.de/entity/Q29550062017-01-24Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Esther Galby