default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEsther Galby
Person information
- affiliation: CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica 86(5): 1428-1474 (2024)- [c10]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: 66:1-66:19 - [c9]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: 67:1-67:19 - [i23]Esther Galby, Andrea Munaro, Shizhou Yang:
Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs. CoRR abs/2402.18352 (2024) - [i22]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 abs/2405.01344 (2024) - 2023
- [j12]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): 2241-2264 (2023) - [j11]Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries:
Using edge contractions to reduce the semitotal domination number. Theor. Comput. Sci. 939: 140-160 (2023) - [j10]Esther Galby:
The complexity of blocking (semi)total dominating sets with edge contractions. Theor. Comput. Sci. 950: 113678 (2023) - [j9]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. 978: 114174 (2023) - [c8]Esther Galby, Andrea Munaro, Shizhou Yang:
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. SoCG 2023: 34:1-34:15 - [i21]Esther Galby, Andrea Munaro, Shizhou Yang:
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs. CoRR abs/2303.07444 (2023) - [i20]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 abs/2307.08149 (2023) - 2022
- [c7]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC 2022: 14:1-14:24 - [c6]Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. MFCS 2022: 51:1-51:15 - [c5]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Weighted Multicut in Trees. WG 2022: 257-270 - [i19]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Weighted Multicut in Trees. CoRR abs/2205.10105 (2022) - [i18]Esther Galby:
The complexity of blocking (semi)total dominating sets with edge contractions. CoRR abs/2205.12821 (2022) - [i17]Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale:
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. CoRR abs/2206.15424 (2022) - [i16]Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR abs/2208.02850 (2022) - [i15]Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma:
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification. CoRR abs/2208.06015 (2022) - 2021
- [j8]Nicolas Champseix, Esther Galby, Andrea Munaro, Bernard Ries:
CPG graphs: Some structural and hardness results. Discret. Appl. Math. 290: 17-35 (2021) - [j7]Esther Galby, Felix Mann, Bernard Ries:
Reducing the domination number of (P3+kP2)-free graphs via one edge contraction. Discret. Appl. Math. 305: 205-210 (2021) - [j6]Esther Galby, Paloma T. Lima, Bernard Ries:
Reducing the domination number of graphs via edge contractions and vertex deletions. Discret. Math. 344(1): 112169 (2021) - [j5]Esther Galby, Felix Mann, Bernard Ries:
Blocking total dominating sets via edge contractions. Theor. Comput. Sci. 877: 18-35 (2021) - [i14]Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries:
Using edge contractions to reduce the semitotal domination number. CoRR abs/2107.03755 (2021) - 2020
- [j4]Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez:
Characterising circular-arc contact B0-VPG graphs. Discret. Appl. Math. 283: 435-443 (2020) - [j3]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: 28-48 (2020) - [i13]Esther Galby, Andrea Munaro:
Approximating Independent Set and Dominating Set on VPG graphs. CoRR abs/2004.07566 (2020) - [i12]Esther Galby, Felix Mann, Bernard Ries:
Blocking total dominating sets via edge contractions. CoRR abs/2009.08806 (2020) - [i11]Esther Galby, Felix Mann, Bernard Ries:
Reducing the domination number of P3+kP2-free graphs via one edge contraction. CoRR abs/2010.14155 (2020)
2010 – 2019
- 2019
- [j2]Esther Galby, María Pía Mazzoleni, Bernard Ries:
Proper circular arc graphs as intersection graphs of pathson a grid. Discret. Appl. Math. 262: 195-202 (2019) - [j1]Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries:
Classifying k-edge colouring for H-free graphs. Inf. Process. Lett. 146: 39-43 (2019) - [c4]Esther Galby, Paloma T. Lima, Bernard Ries:
Blocking Dominating Sets for H-Free Graphs via Edge Contractions. ISAAC 2019: 21:1-21:14 - [c3]Esther Galby, Paloma T. Lima, Bernard Ries:
Reducing the Domination Number of Graphs via Edge Contractions. MFCS 2019: 41:1-41:13 - [i10]Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries:
On the Parameterized Complexity of k-Edge Colouring. CoRR abs/1901.01861 (2019) - [i9]Esther Galby, Paloma T. Lima, Bernard Ries:
Reducing the domination number of graphs via edge contractions. CoRR abs/1903.01800 (2019) - [i8]Esther Galby, Andrea Munaro, Bernard Ries:
CPG graphs: Some structural and hardness results. CoRR abs/1903.01805 (2019) - [i7]Esther Galby, Paloma T. Lima, Bernard Ries:
Blocking dominating sets for $H$-free graphs via edge contractions. CoRR abs/1906.12297 (2019) - [i6]Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez:
Characterising circular-arc contact B0-VPG graphs. CoRR abs/1909.06231 (2019) - 2018
- [c2]Zakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries:
On Contact Graphs of Paths on a Grid. GD 2018: 317-330 - [i5]Zakir Deniz, Esther Galby, Bernard Ries:
On contact graphs of paths on a grid. CoRR abs/1803.03468 (2018) - [i4]Esther Galby, María Pía Mazzoleni, Bernard Ries:
Proper circular arc graphs as intersection graphs of paths on a grid. CoRR abs/1808.09344 (2018) - [i3]Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries:
Classifying k-Edge Colouring for H-free Graphs. CoRR abs/1810.04379 (2018) - [i2]Esther Galby, Andrea Munaro, Bernard Ries:
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. CoRR abs/1810.06872 (2018) - [i1]Nicolas Champseix, Esther Galby, Bernard Ries:
Planar CPG graphs. CoRR abs/1810.08008 (2018) - 2015
- [c1]Esther Galby, Joël Ouaknine, James Worrell:
On Matrix Powering in Low Dimensions. STACS 2015: 329-340
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
