default search action
BibTeX records: Alexandr Polyanskii
@article{DBLP:journals/combinatorics/PolyanskiiS24, author = {Alexandr Polyanskii and Rynat Sadykov}, title = {Alon-Boppana-Type Bounds for Weighted Graphs}, journal = {Electron. J. Comb.}, volume = {31}, number = {1}, year = {2024}, url = {https://doi.org/10.37236/12212}, doi = {10.37236/12212}, timestamp = {Fri, 01 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/combinatorics/PolyanskiiS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/PirahmadPV24, author = {Olimjoni Pirahmad and Alexandr Polyanskii and Alexey Vasilevskii}, title = {Intersecting Diametral Balls Induced by a Geometric Graph}, journal = {Discret. Comput. Geom.}, volume = {71}, number = {2}, pages = {480--497}, year = {2024}, url = {https://doi.org/10.1007/s00454-022-00457-x}, doi = {10.1007/S00454-022-00457-X}, timestamp = {Thu, 29 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/PirahmadPV24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BarabanshchikovaP24, author = {Polina Barabanshchikova and Alexandr Polyanskii}, title = {Intersecting diametral balls induced by a geometric graph {II}}, journal = {Discret. Math.}, volume = {347}, number = {1}, pages = {113694}, year = {2024}, url = {https://doi.org/10.1016/j.disc.2023.113694}, doi = {10.1016/J.DISC.2023.113694}, timestamp = {Thu, 09 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BarabanshchikovaP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgo/BarabanshchikovaP24, author = {Polina Barabanshchikova and Alexandr Polyanskii}, title = {Intersecting ellipses induced by a max-sum matching}, journal = {J. Glob. Optim.}, volume = {88}, number = {2}, pages = {395--407}, year = {2024}, url = {https://doi.org/10.1007/s10898-023-01312-w}, doi = {10.1007/S10898-023-01312-W}, timestamp = {Thu, 29 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgo/BarabanshchikovaP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2303-10706, author = {Polina Barabanshchikova and Alexandr Polyanskii}, title = {Intersecting balls induced by a geometric graph {II}}, journal = {CoRR}, volume = {abs/2303.10706}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2303.10706}, doi = {10.48550/ARXIV.2303.10706}, eprinttype = {arXiv}, eprint = {2303.10706}, timestamp = {Wed, 22 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2303-10706.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/ChernegaPS22, author = {Nikita Chernega and Alexandr Polyanskii and Rinat Sadykov}, title = {Disjoint Edges in Geometric Graphs}, journal = {Graphs Comb.}, volume = {38}, number = {5}, pages = {162}, year = {2022}, url = {https://doi.org/10.1007/s00373-022-02563-2}, doi = {10.1007/S00373-022-02563-2}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/ChernegaPS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2212-14200, author = {Polina Barabanshchikova and Alexandr Polyanskii}, title = {Intersecting ellipses induced by a max-sum matching}, journal = {CoRR}, volume = {abs/2212.14200}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2212.14200}, doi = {10.48550/ARXIV.2212.14200}, eprinttype = {arXiv}, eprint = {2212.14200}, timestamp = {Sun, 08 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2212-14200.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/Polyanskii21, author = {Alexandr Polyanskii}, title = {A Cap Covering Theorem}, journal = {Comb.}, volume = {41}, number = {5}, pages = {695--702}, year = {2021}, url = {https://doi.org/10.1007/s00493-021-4554-1}, doi = {10.1007/S00493-021-4554-1}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/Polyanskii21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/NaszodiP21, author = {M{\'{a}}rton Nasz{\'{o}}di and Alexandr Polyanskii}, title = {Perron and Frobenius Meet Carath{\'{e}}odory}, journal = {Electron. J. Comb.}, volume = {28}, number = {3}, pages = {3}, year = {2021}, url = {https://doi.org/10.37236/9996}, doi = {10.37236/9996}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/NaszodiP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2108-09795, author = {Olimjoni Pirahmad and Alexandr Polyanskii and Alexey Vasilevskii}, title = {On a Tverberg graph}, journal = {CoRR}, volume = {abs/2108.09795}, year = {2021}, url = {https://arxiv.org/abs/2108.09795}, eprinttype = {arXiv}, eprint = {2108.09795}, timestamp = {Fri, 27 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2108-09795.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-05425, author = {Nikita Chernega and Alexandr Polyanskii and Rinat Sadykov}, title = {Disjoint edges in geometric graphs}, journal = {CoRR}, volume = {abs/2111.05425}, year = {2021}, url = {https://arxiv.org/abs/2111.05425}, eprinttype = {arXiv}, eprint = {2111.05425}, timestamp = {Tue, 16 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-05425.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/PinchasiP20, author = {Rom Pinchasi and Alexandr Polyanskii}, title = {A One-Page Solution of a Problem of Erd{\H{o}}s and Purdy}, journal = {Discret. Comput. Geom.}, volume = {64}, number = {2}, pages = {382--385}, year = {2020}, url = {https://doi.org/10.1007/s00454-019-00139-1}, doi = {10.1007/S00454-019-00139-1}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcg/PinchasiP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/Polyanskii19, author = {Alexandr Polyanskii}, title = {On Almost-Equidistant Sets - {II}}, journal = {Electron. J. Comb.}, volume = {26}, number = {2}, pages = {2}, year = {2019}, url = {https://doi.org/10.37236/8044}, doi = {10.37236/8044}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/Polyanskii19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/MerinoJPW18, author = {Bernardo Gonz{\'{a}}lez Merino and Thomas Jahn and Alexandr Polyanskii and Gerd Wachsmuth}, title = {Hunting for Reduced Polytopes}, journal = {Discret. Comput. Geom.}, volume = {60}, number = {3}, pages = {801--808}, year = {2018}, url = {https://doi.org/10.1007/s00454-018-9982-3}, doi = {10.1007/S00454-018-9982-3}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/MerinoJPW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/NaszodiP18, author = {M{\'{a}}rton Nasz{\'{o}}di and Alexandr Polyanskii}, title = {Approximating set multi-covers}, journal = {Eur. J. Comb.}, volume = {67}, pages = {174--180}, year = {2018}, url = {https://doi.org/10.1016/j.ejc.2017.08.001}, doi = {10.1016/J.EJC.2017.08.001}, timestamp = {Thu, 28 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/NaszodiP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KupavskiiP17, author = {Andrey B. Kupavskii and Alexandr Polyanskii}, title = {Proof of Schur's Conjecture in {\(\mathbb{R}\)} {D}}, journal = {Comb.}, volume = {37}, number = {6}, pages = {1181--1205}, year = {2017}, url = {https://doi.org/10.1007/s00493-016-3340-y}, doi = {10.1007/S00493-016-3340-Y}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/KupavskiiP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Polyanskii17, author = {Alexandr Polyanskii}, title = {Pairwise intersecting homothets of a convex body}, journal = {Discret. Math.}, volume = {340}, number = {8}, pages = {1950--1956}, year = {2017}, url = {https://doi.org/10.1016/j.disc.2017.04.002}, doi = {10.1016/J.DISC.2017.04.002}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Polyanskii17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Polyanskii17, author = {Alexandr Polyanskii}, title = {Pairwise intersecting homothets of a convex body}, journal = {Electron. Notes Discret. Math.}, volume = {61}, pages = {1003--1009}, year = {2017}, url = {https://doi.org/10.1016/j.endm.2017.07.065}, doi = {10.1016/J.ENDM.2017.07.065}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Polyanskii17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/NaszodiP16, author = {M{\'{a}}rton Nasz{\'{o}}di and Alexandr Polyanskii}, title = {Multiple Transversals Greedily}, journal = {CoRR}, volume = {abs/1608.01292}, year = {2016}, url = {http://arxiv.org/abs/1608.01292}, eprinttype = {arXiv}, eprint = {1608.01292}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/NaszodiP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1402-3694, author = {Andrey B. Kupavskii and Alexandr Polyanskii}, title = {Proof of Schur's conjecture in {\(\mathbb{R}\)}\({}^{\mbox{d}}\)}, journal = {CoRR}, volume = {abs/1402.3694}, year = {2014}, url = {http://arxiv.org/abs/1402.3694}, eprinttype = {arXiv}, eprint = {1402.3694}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1402-3694.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.