Esther Galby

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 45

Top Topics

Parameterized Complexity

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. ICALP (2024)
Esther Galby, Andrea Munaro, Shizhou Yang
Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs. CoRR (2024)
Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. ICALP (2024)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica 86 (5) (2024)
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension and Geodetic Set Parameterized by Vertex Cover. CoRR (2024)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. 978 (2023)
Esther Galby, Andrea Munaro, Shizhou Yang
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. SoCG (2023)
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. SIAM J. Discret. Math. 37 (4) (2023)
Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries
Using edge contractions to reduce the semitotal domination number. Theor. Comput. Sci. 939 (2023)
Esther Galby
The complexity of blocking (semi)total dominating sets with edge contractions. Theor. Comput. Sci. 950 (2023)
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. CoRR (2023)
Esther Galby, Andrea Munaro, Shizhou Yang
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. CoRR (2023)
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. MFCS (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Weighted Multicut in Trees. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR (2022)
Esther Galby
The complexity of blocking (semi)total dominating sets with edge contractions. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Weighted Multicut in Trees. WG (2022)
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. CoRR (2022)
Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC (2022)
Esther Galby, Felix Mann, Bernard Ries
Blocking total dominating sets via edge contractions. Theor. Comput. Sci. 877 (2021)
Esther Galby, Felix Mann, Bernard Ries
Reducing the domination number of (P3+kP2)-free graphs via one edge contraction. Discret. Appl. Math. 305 (2021)
Esther Galby, Paloma T. Lima, Bernard Ries
Reducing the domination number of graphs via edge contractions and vertex deletions. Discret. Math. 344 (1) (2021)
Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries
Using edge contractions to reduce the semitotal domination number. CoRR (2021)
Nicolas Champseix, Esther Galby, Andrea Munaro, Bernard Ries
CPG graphs: Some structural and hardness results. Discret. Appl. Math. 290 (2021)
Esther Galby, Felix Mann, Bernard Ries
-free graphs via one edge contraction. CoRR (2020)
Esther Galby, Andrea Munaro
Approximating Independent Set and Dominating Set on VPG graphs. CoRR (2020)
Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez
Characterising circular-arc contact B0-VPG graphs. Discret. Appl. Math. 283 (2020)
Esther Galby, Andrea Munaro, Bernard Ries
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. Theor. Comput. Sci. 814 (2020)
Esther Galby, Felix Mann, Bernard Ries
Blocking total dominating sets via edge contractions. CoRR (2020)
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
On the Parameterized Complexity of k-Edge Colouring. CoRR (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Reducing the domination number of graphs via edge contractions. CoRR (2019)
Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez
-VPG graphs. CoRR (2019)
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
-free graphs. Inf. Process. Lett. 146 (2019)
Esther Galby, María Pía Mazzoleni, Bernard Ries
Proper circular arc graphs as intersection graphs of pathson a grid. Discret. Appl. Math. 262 (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Blocking Dominating Sets for H-Free Graphs via Edge Contractions. ISAAC (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Reducing the Domination Number of Graphs via Edge Contractions. MFCS (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Blocking dominating sets for $H$-free graphs via edge contractions. CoRR (2019)
Esther Galby, Andrea Munaro, Bernard Ries
CPG graphs: Some structural and hardness results. CoRR (2019)
Esther Galby, María Pía Mazzoleni, Bernard Ries
Proper circular arc graphs as intersection graphs of paths on a grid. CoRR (2018)
Zakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries
On Contact Graphs of Paths on a Grid. Graph Drawing (2018)
Esther Galby, Andrea Munaro, Bernard Ries
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. CoRR (2018)
Nicolas Champseix, Esther Galby, Bernard Ries
Planar CPG graphs. CoRR (2018)
Zakir Deniz, Esther Galby, Bernard Ries
On contact graphs of paths on a grid. CoRR (2018)
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
Classifying k-Edge Colouring for H-free Graphs. CoRR (2018)
Esther Galby, Joël Ouaknine, James Worrell
On Matrix Powering in Low Dimensions. STACS (2015)