BibTeX records: Esther Galby

download as .bib file

@article{DBLP:journals/tcs/GalbyMR20,
  author    = {Esther Galby and
               Andrea Munaro and
               Bernard Ries},
  title     = {Semitotal Domination: New hardness results and a polynomial-time algorithm
               for graphs of bounded mim-width},
  journal   = {Theor. Comput. Sci.},
  volume    = {814},
  pages     = {28--48},
  year      = {2020},
  url       = {https://doi.org/10.1016/j.tcs.2020.01.007},
  doi       = {10.1016/j.tcs.2020.01.007},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/GalbyMR20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GalbyMR19,
  author    = {Esther Galby and
               Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and
               Bernard Ries},
  title     = {Proper circular arc graphs as intersection graphs of pathson a grid},
  journal   = {Discret. Appl. Math.},
  volume    = {262},
  pages     = {195--202},
  year      = {2019},
  url       = {https://doi.org/10.1016/j.dam.2019.02.010},
  doi       = {10.1016/j.dam.2019.02.010},
  timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/dam/GalbyMR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalbyLPR19,
  author    = {Esther Galby and
               Paloma T. Lima and
               Dani{\"{e}}l Paulusma and
               Bernard Ries},
  title     = {Classifying \emph{k}-edge colouring for \emph{H}-free graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {146},
  pages     = {39--43},
  year      = {2019},
  url       = {https://doi.org/10.1016/j.ipl.2019.02.006},
  doi       = {10.1016/j.ipl.2019.02.006},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ipl/GalbyLPR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GalbyLR19,
  author    = {Esther Galby and
               Paloma T. Lima and
               Bernard Ries},
  editor    = {Pinyan Lu and
               Guochuan Zhang},
  title     = {Blocking Dominating Sets for H-Free Graphs via Edge Contractions},
  booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
               2019, December 8-11, 2019, Shanghai University of Finance and Economics,
               Shanghai, China},
  series    = {LIPIcs},
  volume    = {149},
  pages     = {21:1--21:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.21},
  doi       = {10.4230/LIPIcs.ISAAC.2019.21},
  timestamp = {Thu, 28 Nov 2019 15:51:42 +0100},
  biburl    = {https://dblp.org/rec/conf/isaac/GalbyLR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GalbyLR19,
  author    = {Esther Galby and
               Paloma T. Lima and
               Bernard Ries},
  editor    = {Peter Rossmanith and
               Pinar Heggernes and
               Joost{-}Pieter Katoen},
  title     = {Reducing the Domination Number of Graphs via Edge Contractions},
  booktitle = {44th International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
  series    = {LIPIcs},
  volume    = {138},
  pages     = {41:1--41:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2019.41},
  doi       = {10.4230/LIPIcs.MFCS.2019.41},
  timestamp = {Fri, 30 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/mfcs/GalbyLR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-01861,
  author    = {Esther Galby and
               Paloma T. Lima and
               Dani{\"{e}}l Paulusma and
               Bernard Ries},
  title     = {On the Parameterized Complexity of k-Edge Colouring},
  journal   = {CoRR},
  volume    = {abs/1901.01861},
  year      = {2019},
  url       = {http://arxiv.org/abs/1901.01861},
  archivePrefix = {arXiv},
  eprint    = {1901.01861},
  timestamp = {Thu, 31 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1901-01861.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-01800,
  author    = {Esther Galby and
               Paloma T. Lima and
               Bernard Ries},
  title     = {Reducing the domination number of graphs via edge contractions},
  journal   = {CoRR},
  volume    = {abs/1903.01800},
  year      = {2019},
  url       = {http://arxiv.org/abs/1903.01800},
  archivePrefix = {arXiv},
  eprint    = {1903.01800},
  timestamp = {Sat, 30 Mar 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1903-01800.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-01805,
  author    = {Esther Galby and
               Andrea Munaro and
               Bernard Ries},
  title     = {{CPG} graphs: Some structural and hardness results},
  journal   = {CoRR},
  volume    = {abs/1903.01805},
  year      = {2019},
  url       = {http://arxiv.org/abs/1903.01805},
  archivePrefix = {arXiv},
  eprint    = {1903.01805},
  timestamp = {Sat, 30 Mar 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1903-01805.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-12297,
  author    = {Esther Galby and
               Paloma T. Lima and
               Bernard Ries},
  title     = {Blocking dominating sets for {\textdollar}H{\textdollar}-free graphs
               via edge contractions},
  journal   = {CoRR},
  volume    = {abs/1906.12297},
  year      = {2019},
  url       = {http://arxiv.org/abs/1906.12297},
  archivePrefix = {arXiv},
  eprint    = {1906.12297},
  timestamp = {Mon, 01 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1906-12297.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-06231,
  author    = {Flavia Bonomo{-}Braberman and
               Esther Galby and
               Carolina Luc{\'{\i}}a Gonzalez},
  title     = {Characterising circular-arc contact B\({}_{\mbox{0}}\)-VPG graphs},
  journal   = {CoRR},
  volume    = {abs/1909.06231},
  year      = {2019},
  url       = {http://arxiv.org/abs/1909.06231},
  archivePrefix = {arXiv},
  eprint    = {1909.06231},
  timestamp = {Wed, 18 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1909-06231.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DenizGMR18,
  author    = {Zakir Deniz and
               Esther Galby and
               Andrea Munaro and
               Bernard Ries},
  editor    = {Therese C. Biedl and
               Andreas Kerren},
  title     = {On Contact Graphs of Paths on a Grid},
  booktitle = {Graph Drawing and Network Visualization - 26th International Symposium,
               {GD} 2018, Barcelona, Spain, September 26-28, 2018, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {11282},
  pages     = {317--330},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-030-04414-5\_22},
  doi       = {10.1007/978-3-030-04414-5\_22},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/gd/DenizGMR18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-03468,
  author    = {Zakir Deniz and
               Esther Galby and
               Bernard Ries},
  title     = {On contact graphs of paths on a grid},
  journal   = {CoRR},
  volume    = {abs/1803.03468},
  year      = {2018},
  url       = {http://arxiv.org/abs/1803.03468},
  archivePrefix = {arXiv},
  eprint    = {1803.03468},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1803-03468.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-09344,
  author    = {Esther Galby and
               Mar{\'{\i}}a P{\'{\i}}a Mazzoleni and
               Bernard Ries},
  title     = {Proper circular arc graphs as intersection graphs of paths on a grid},
  journal   = {CoRR},
  volume    = {abs/1808.09344},
  year      = {2018},
  url       = {http://arxiv.org/abs/1808.09344},
  archivePrefix = {arXiv},
  eprint    = {1808.09344},
  timestamp = {Tue, 04 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1808-09344.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-04379,
  author    = {Esther Galby and
               Paloma T. Lima and
               Dani{\"{e}}l Paulusma and
               Bernard Ries},
  title     = {Classifying k-Edge Colouring for H-free Graphs},
  journal   = {CoRR},
  volume    = {abs/1810.04379},
  year      = {2018},
  url       = {http://arxiv.org/abs/1810.04379},
  archivePrefix = {arXiv},
  eprint    = {1810.04379},
  timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1810-04379.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-06872,
  author    = {Esther Galby and
               Andrea Munaro and
               Bernard Ries},
  title     = {Semitotal Domination: New hardness results and a polynomial-time algorithm
               for graphs of bounded mim-width},
  journal   = {CoRR},
  volume    = {abs/1810.06872},
  year      = {2018},
  url       = {http://arxiv.org/abs/1810.06872},
  archivePrefix = {arXiv},
  eprint    = {1810.06872},
  timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1810-06872.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-08008,
  author    = {Nicolas Champseix and
               Esther Galby and
               Bernard Ries},
  title     = {Planar {CPG} graphs},
  journal   = {CoRR},
  volume    = {abs/1810.08008},
  year      = {2018},
  url       = {http://arxiv.org/abs/1810.08008},
  archivePrefix = {arXiv},
  eprint    = {1810.08008},
  timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1810-08008.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GalbyOW15,
  author    = {Esther Galby and
               Jo{\"{e}}l Ouaknine and
               James Worrell},
  editor    = {Ernst W. Mayr and
               Nicolas Ollinger},
  title     = {On Matrix Powering in Low Dimensions},
  booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
               {STACS} 2015, March 4-7, 2015, Garching, Germany},
  series    = {LIPIcs},
  volume    = {30},
  pages     = {329--340},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2015},
  url       = {https://doi.org/10.4230/LIPIcs.STACS.2015.329},
  doi       = {10.4230/LIPIcs.STACS.2015.329},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/stacs/GalbyOW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics