@misc{https://doi.org/10.48550/arxiv.1906.10012,<br/><span class="tab"></span>
  doi = {10.48550/ARXIV.1906.10012},<br/><span class="tab"></span>
  url = {https://arxiv.org/abs/1906.10012},<br/><span class="tab"></span>
  author = {Tsur,<br/><span class="tab"></span> Dekel},<br/><span class="tab"></span>
  keywords = {Data Structures and Algorithms (cs.DS),<br/><span class="tab"></span> FOS: Computer and information sciences,<br/><span class="tab"></span> FOS: Computer and information sciences},<br/><span class="tab"></span>
  title = {Algorithms for deletion problems on split graphs},<br/><span class="tab"></span>
  publisher = {arXiv},<br/><span class="tab"></span>
  year = {2019},<br/><span class="tab"></span>
  copyright = {arXiv.org perpetual,<br/><span class="tab"></span> non-exclusive license}
}