On Matrix Powering in Low Dimensions. - Esther Galby; Joël Ouaknine; James Worrell 001 (STACS, 2015)

On Contact Graphs of Paths on a Grid. - Zakir Deniz; Esther Galby; Andrea Munaro; Bernard Ries (GD, 2018)

On contact graphs of paths on a grid. - Zakir Deniz; Esther Galby; Bernard Ries (CoRR, 2018)

Proper circular arc graphs as intersection graphs of paths on a grid. - Esther Galby; María Pía Mazzoleni; Bernard Ries (CoRR, 2018)

Classifying k-Edge Colouring for H-free Graphs. - Esther Galby; Paloma T. Lima; Daniël Paulusma; Bernard Ries (CoRR, 2018)

Planar CPG graphs. - Nicolas Champseix; Esther Galby; Bernard Ries (CoRR, 2018)

Blocking Dominating Sets for H-Free Graphs via Edge Contractions. - Esther Galby; Paloma T. Lima; Bernard Ries (ISAAC, 2019)

Reducing the Domination Number of Graphs via Edge Contractions. - Esther Galby; Paloma T. Lima; Bernard Ries (MFCS, 2019)

On the Parameterized Complexity of k-Edge Colouring. - Esther Galby; Paloma T. Lima; Daniël Paulusma; Bernard Ries (CoRR, 2019)

CPG graphs: Some structural and hardness results. - Esther Galby; Andrea Munaro; Bernard Ries (CoRR, 2019)

Characterising circular-arc contact B0-VPG graphs. - Flavia Bonomo-Braberman; Esther Galby; Carolina Lucía Gonzalez (CoRR, 2019)

Proper circular arc graphs as intersection graphs of pathson a grid. - Esther Galby; María Pía Mazzoleni; Bernard Ries (Discret. Appl. Math., 2019)

Classifying k-edge colouring for H-free graphs. - Esther Galby; Paloma T. Lima; Daniël Paulusma; Bernard Ries (Inf. Process. Lett., 2019)

Approximating Independent Set and Dominating Set on VPG graphs. - Esther Galby; Andrea Munaro (CoRR, 2020)

Reducing the domination number of P3+kP2-free graphs via one edge contraction. - Esther Galby; Felix Mann; Bernard Ries (CoRR, 2020)

Characterising circular-arc contact B0-VPG graphs. - Flavia Bonomo-Braberman; Esther Galby; Carolina Lucía Gonzalez (Discret. Appl. Math., 2020)

Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. - Esther Galby; Andrea Munaro; Bernard Ries (Theor. Comput. Sci., 2020)

CPG graphs: Some structural and hardness results. - Nicolas Champseix; Esther Galby; Andrea Munaro; Bernard Ries (Discret. Appl. Math., 2021)

Reducing the domination number of (P3+kP2)-free graphs via one edge contraction. - Esther Galby; Felix Mann; Bernard Ries (Discret. Appl. Math., 2021)

Reducing the domination number of graphs via edge contractions and vertex deletions. - Esther Galby; Paloma T. Lima; Bernard Ries (Discret. Math., 2021)

Blocking total dominating sets via edge contractions. - Esther Galby; Felix Mann; Bernard Ries (Theor. Comput. Sci., 2021)

Domination and Cut Problems on Chordal Graphs with Bounded Leafage. - Esther Galby; Dániel Marx; Philipp Schepper; Roohani Sharma; Prafullkumar Tale (IPEC, 2022)

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. - Esther Galby; Liana Khazaliya; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (MFCS, 2022)

Parameterized Complexity of Weighted Multicut in Trees. - Esther Galby; Dániel Marx; Philipp Schepper; Roohani Sharma; Prafullkumar Tale (WG, 2022)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. - Esther Galby; Andrea Munaro; Shizhou Yang (SoCG, 2023)

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (CoRR, 2023)

Using edge contractions to reduce the semitotal domination number. - Esther Galby; Paloma T. Lima; Felix Mann; Bernard Ries (Theor. Comput. Sci., 2023)

The complexity of blocking (semi)total dominating sets with edge contractions. - Esther Galby (Theor. Comput. Sci., 2023)

Parameterized complexity of multicut in weighted trees. - Esther Galby; Dániel Marx; Philipp Schepper; Roohani Sharma; Prafullkumar Tale (Theor. Comput. Sci., 2023)

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (ICALP, 2024)

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. - Esther Galby; Sándor Kisfaludi-Bak; Dániel Marx; Roohani Sharma (ICALP, 2024)

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs. - Esther Galby; Andrea Munaro; Shizhou Yang (CoRR, 2024)

Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs. - Esther Galby; Paloma T. Lima; Andrea Munaro; Amir Nikabadi (ESA, 2025)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (STACS, 2025)

Maximum list r-colorable induced subgraphs in kP3-free graphs. - Esther Galby; Paloma T. Lima; Andrea Munaro; Amir Nikabadi (CoRR, 2025)

Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases. - Narmina Baghirova; Esther Galby; Martin Milanic (CoRR, 2025)