Esther Galby - RankMe

51 papers A* 3A 4B 5Journal 39

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs. ESA Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi
2025	J	`jnl`	Maximum list CoRR Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi
2025	A	`conf`	Metric Dimension and Geodetic Set Parameterized by Vertex Cover. STACS Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2025	J	`jnl`	Perfect phylogenies via the Minimum Uncovering Branching Problem: Efficiently Solvable Cases. IEEE Trans. Comput. Biol. Bioinform. Narmina Baghirova, Esther Galby, Martin Milanic
2025	J	`jnl`	Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases. CoRR Narmina Baghirova, Esther Galby, Martin Milanic
2024	J	`jnl`	Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2024	J	`jnl`	Metric Dimension and Geodetic Set Parameterized by Vertex Cover. CoRR Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2024	J	`jnl`	Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs. CoRR Esther Galby, Andrea Munaro, Shizhou Yang
2024	A*	`conf`	Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. ICALP Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2024	A*	`conf`	Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. ICALP Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
2023	J	`jnl`	Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. SIAM J. Discret. Math. Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2023	J	`jnl`	Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2023	A*	`conf`	Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. SoCG Esther Galby, Andrea Munaro, Shizhou Yang
2023	J	`jnl`	Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. CoRR Esther Galby, Andrea Munaro, Shizhou Yang
2023	J	`jnl`	The complexity of blocking (semi)total dominating sets with edge contractions. Theor. Comput. Sci. Esther Galby
2023	J	`jnl`	Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. CoRR Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2023	J	`jnl`	Using edge contractions to reduce the semitotal domination number. Theor. Comput. Sci. Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries
2022	B	`conf`	Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	J	`jnl`	Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	B	`conf`	Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. MFCS Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2022	J	`jnl`	Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. CoRR Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2022	B	`conf`	Parameterized Complexity of Weighted Multicut in Trees. WG Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	J	`jnl`	Parameterized Complexity of Weighted Multicut in Trees. CoRR Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
2022	J	`jnl`	Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification. CoRR Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
2022	J	`jnl`	The complexity of blocking (semi)total dominating sets with edge contractions. CoRR Esther Galby
2021	J	`jnl`	Blocking total dominating sets via edge contractions. Theor. Comput. Sci. Esther Galby, Felix Mann, Bernard Ries
2021	J	`jnl`	CPG graphs: Some structural and hardness results. Discret. Appl. Math. Nicolas Champseix, Esther Galby, Andrea Munaro, Bernard Ries
2021	J	`jnl`	Reducing the domination number of (P3+kP2)-free graphs via one edge contraction. Discret. Appl. Math. Esther Galby, Felix Mann, Bernard Ries
2021	J	`jnl`	Reducing the domination number of graphs via edge contractions and vertex deletions. Discret. Math. Esther Galby, Paloma T. Lima, Bernard Ries
2021	J	`jnl`	Using edge contractions to reduce the semitotal domination number. CoRR Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries
2020	J	`jnl`	Approximating Independent Set and Dominating Set on VPG graphs. CoRR Esther Galby, Andrea Munaro
2020	J	`jnl`	Blocking total dominating sets via edge contractions. CoRR Esther Galby, Felix Mann, Bernard Ries
2020	J	`jnl`	Characterising circular-arc contact B0-VPG graphs. Discret. Appl. Math. Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez
2020	J	`jnl`	Reducing the domination number of P CoRR Esther Galby, Felix Mann, Bernard Ries
2020	J	`jnl`	Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. Theor. Comput. Sci. Esther Galby, Andrea Munaro, Bernard Ries
2019	B	`conf`	Blocking Dominating Sets for H-Free Graphs via Edge Contractions. ISAAC Esther Galby, Paloma T. Lima, Bernard Ries
2019	J	`jnl`	Blocking dominating sets for $H$-free graphs via edge contractions. CoRR Esther Galby, Paloma T. Lima, Bernard Ries
2019	J	`jnl`	CPG graphs: Some structural and hardness results. CoRR Esther Galby, Andrea Munaro, Bernard Ries
2019	J	`jnl`	Characterising circular-arc contact B CoRR Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez
2019	J	`jnl`	Classifying Inf. Process. Lett. Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
2019	J	`jnl`	On the Parameterized Complexity of k-Edge Colouring. CoRR Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
2019	J	`jnl`	Proper circular arc graphs as intersection graphs of pathson a grid. Discret. Appl. Math. Esther Galby, María Pía Mazzoleni, Bernard Ries
2019	B	`conf`	Reducing the Domination Number of Graphs via Edge Contractions. MFCS Esther Galby, Paloma T. Lima, Bernard Ries
2019	J	`jnl`	Reducing the domination number of graphs via edge contractions. CoRR Esther Galby, Paloma T. Lima, Bernard Ries
2018	J	`jnl`	Classifying k-Edge Colouring for H-free Graphs. CoRR Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
2018	A	`conf`	On Contact Graphs of Paths on a Grid. GD Zakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries
2018	J	`jnl`	On contact graphs of paths on a grid. CoRR Zakir Deniz, Esther Galby, Bernard Ries
2018	J	`jnl`	Planar CPG graphs. CoRR Nicolas Champseix, Esther Galby, Bernard Ries
2018	J	`jnl`	Proper circular arc graphs as intersection graphs of paths on a grid. CoRR Esther Galby, María Pía Mazzoleni, Bernard Ries
2018	J	`jnl`	Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. CoRR Esther Galby, Andrea Munaro, Bernard Ries
2015	A	`conf`	On Matrix Powering in Low Dimensions. STACS Esther Galby, Joël Ouaknine, James Worrell