| Semitotal domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width E Galby, A Munaro, B Ries Theoretical Computer Science 814, 28-48, 2020 | 22 | 2020 |
| On matrix powering in low dimensions E Galby, J Ouaknine, J Worrell 32nd International Symposium on Theoretical Aspects of Computer Science …, 2015 | 21 | 2015 |
| Reducing the domination number of graphs via edge contractions and vertex deletions E Galby, PT Lima, B Ries Discrete Mathematics 344 (1), 112169, 2021 | 13 | 2021 |
| Blocking total dominating sets via edge contractions E Galby, F Mann, B Ries Theoretical Computer Science 877, 18-35, 2021 | 10 | 2021 |
| Classifying k-edge colouring for H-free graphs E Galby, PT Lima, D Paulusma, B Ries Information Processing Letters 146, 39-43, 2019 | 10 | 2019 |
| On contact graphs of paths on a grid Z Deniz, E Galby, A Munaro, B Ries Graph Drawing and Network Visualization: 26th International Symposium, GD …, 2018 | 9 | 2018 |
| Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters E Galby, L Khazaliya, FM Inerney, R Sharma, P Tale arXiv preprint arXiv:2206.15424, 2022 | 7 | 2022 |
| Reducing the domination number of graphs via edge contractions E Galby, PT Lima, B Ries arXiv preprint arXiv:1903.01800, 2019 | 7 | 2019 |
| Reducing the domination number of (p3+ kp2)-free graphs via one edge contraction E Galby, F Mann, B Ries Discrete Applied Mathematics 305, 205-210, 2021 | 6 | 2021 |
| Proper circular arc graphs as intersection graphs of pathson a grid E Galby, MP Mazzoleni, B Ries Discrete Applied Mathematics 262, 195-202, 2019 | 5 | 2019 |
| Parameterized complexity of weighted multicut in trees E Galby, D Marx, P Schepper, R Sharma, P Tale Graph-Theoretic Concepts in Computer Science: 48th International Workshop …, 2022 | 4 | 2022 |
| Blocking dominating sets for -free graphs via edge contractions E Galby, PT Lima, B Ries arXiv preprint arXiv:1906.12297, 2019 | 4 | 2019 |
| On the Parameterized Complexity of -Edge Colouring E Galby, PT Lima, D Paulusma, B Ries arXiv preprint arXiv:1901.01861, 2019 | 4 | 2019 |
| Using edge contractions to reduce the semitotal domination number E Galby, PT Lima, F Mann, B Ries Theoretical Computer Science 939, 140-160, 2023 | 3 | 2023 |
| Domination and Cut Problems on Chordal Graphs with Bounded Leafage E Galby, D Marx, P Schepper, R Sharma, P Tale arXiv preprint arXiv:2208.02850, 2022 | 3 | 2022 |
| Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs E Galby, A Munaro, S Yang arXiv preprint arXiv:2303.07444, 2023 | 2 | 2023 |
| Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification E Galby, S Kisfaludi-Bak, D Marx, R Sharma arXiv preprint arXiv:2208.06015, 2022 | 2 | 2022 |
| CPG graphs: Some structural and hardness results N Champseix, E Galby, A Munaro, B Ries Discrete Applied Mathematics 290, 17-35, 2021 | 2 | 2021 |
| Approximating independent set and dominating set on VPG graphs E Galby, A Munaro arXiv preprint arXiv:2004.07566, 2020 | 2 | 2020 |
| CPG graphs: Some structural and hardness results E Galby, A Munaro, B Ries arXiv preprint arXiv:1903.01805, 2019 | 2 | 2019 |
