BibTeX records: Kirill Simonov

download as .bib file

@article{DBLP:journals/corr/abs-2002-07607,
  author    = {Eduard Eiben and
               Fedor V. Fomin and
               Fahad Panolan and
               Kirill Simonov},
  title     = {Manipulating Districts to Win Elections: Fine-Grained Complexity},
  journal   = {CoRR},
  volume    = {abs/2002.07607},
  year      = {2020},
  url       = {https://arxiv.org/abs/2002.07607},
  archivePrefix = {arXiv},
  eprint    = {2002.07607},
  timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2002-07607.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-07612,
  author    = {Fedor V. Fomin and
               Danil Sagunov and
               Kirill Simonov},
  title     = {Building large k-cores from sparse graphs},
  journal   = {CoRR},
  volume    = {abs/2002.07612},
  year      = {2020},
  url       = {https://arxiv.org/abs/2002.07612},
  archivePrefix = {arXiv},
  eprint    = {2002.07612},
  timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2002-07612.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FominGS19,
  author    = {Fedor V. Fomin and
               Petr A. Golovach and
               Kirill Simonov},
  editor    = {Arkadev Chattopadhyay and
               Paul Gastin},
  title     = {Parameterized k-Clustering: Tractability Island},
  booktitle = {39th {IARCS} Annual Conference on Foundations of Software Technology
               and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019,
               Bombay, India},
  series    = {LIPIcs},
  volume    = {150},
  pages     = {14:1--14:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.14},
  doi       = {10.4230/LIPIcs.FSTTCS.2019.14},
  timestamp = {Thu, 05 Dec 2019 15:12:21 +0100},
  biburl    = {https://dblp.org/rec/conf/fsttcs/FominGS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/SimonovFGP19,
  author    = {Kirill Simonov and
               Fedor V. Fomin and
               Petr A. Golovach and
               Fahad Panolan},
  editor    = {Kamalika Chaudhuri and
               Ruslan Salakhutdinov},
  title     = {Refined Complexity of {PCA} with Outliers},
  booktitle = {Proceedings of the 36th International Conference on Machine Learning,
               {ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},
  series    = {Proceedings of Machine Learning Research},
  volume    = {97},
  pages     = {5818--5826},
  publisher = {{PMLR}},
  year      = {2019},
  url       = {http://proceedings.mlr.press/v97/simonov19a.html},
  timestamp = {Tue, 11 Jun 2019 15:37:38 +0200},
  biburl    = {https://dblp.org/rec/conf/icml/SimonovFGP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-08559,
  author    = {Fedor V. Fomin and
               Petr A. Golovach and
               Kirill Simonov},
  title     = {Parameterized k-Clustering: The distance matters!},
  journal   = {CoRR},
  volume    = {abs/1902.08559},
  year      = {2019},
  url       = {http://arxiv.org/abs/1902.08559},
  archivePrefix = {arXiv},
  eprint    = {1902.08559},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1902-08559.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-06141,
  author    = {Fedor V. Fomin and
               Petr A. Golovach and
               Fahad Panolan and
               Kirill Simonov},
  title     = {Low-rank binary matrix approximation in column-sum norm},
  journal   = {CoRR},
  volume    = {abs/1904.06141},
  year      = {2019},
  url       = {http://arxiv.org/abs/1904.06141},
  archivePrefix = {arXiv},
  eprint    = {1904.06141},
  timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1904-06141.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-04124,
  author    = {Fedor V. Fomin and
               Petr A. Golovach and
               Fahad Panolan and
               Kirill Simonov},
  title     = {Refined Complexity of {PCA} with Outliers},
  journal   = {CoRR},
  volume    = {abs/1905.04124},
  year      = {2019},
  url       = {http://arxiv.org/abs/1905.04124},
  archivePrefix = {arXiv},
  eprint    = {1905.04124},
  timestamp = {Mon, 27 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1905-04124.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics