1. 2016
  2. Preface

    Kulikov, A. S. & Woeginger, G. J., 1 Jan 2016, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9691, p. V

    Research output: Contribution to journalEditorialpeer-review

  3. Preface

    Goldberg, A. V. & Kulikov, A. S., 1 Jan 2016, 15th International Symposium on Experimental Algorithms, SEA 2016. p. v (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9685).

    Research output: Chapter in Book/Report/Conference proceedingForeword/postscriptResearchpeer-review

  4. Tight bounds for graph homomorphism and subgraph isomorphism

    Cygan, M., Fomin, F. V., Golovnev, A., Kulikov, A. S., Mihajlin, I., Pachocki, J. & Socala, A., 1 Jan 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 1643-1649 7 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 3).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  5. 2015
  6. Parameterized complexity of secluded connectivity problems

    Fomin, F. V., Golovach, P. A., Karpov, N. & Kulikov, A. S., 1 Dec 2015, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2015. Harsha, P. & Ramalingam, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 408-419 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 45).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  7. New Lower Bounds on Circuit Size of Multi-output Functions

    Demenkov, E., Kulikov, A. S., Melanich, O. & Mihajlin, I., 1 May 2015, In: Theory of Computing Systems. 56, 4, p. 630-642 13 p.

    Research output: Contribution to journalArticlepeer-review

  8. Greedy conjecture for strings of length 4

    Kulikov, A. S., Savinov, S. & Sluzhaev, E., 1 Jan 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (eds.). Springer Nature, p. 307-315 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9133).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  9. Lower bounds for the graph homomorphism problem

    Fomin, F. V., Golovnev, A., Kulikov, A. S. & Mihajlin, I., 1 Jan 2015, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Halldorsson, M. M., Kobayashi, N., Speckmann, B. & Iwama, K. (eds.). Springer Nature, p. 481-493 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9134).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  10. Parameterized complexity of superstring problems

    Bliznets, I., Fomin, F. V., Golovach, P. A., Karpov, N., Kulikov, A. S. & Saurabh, S., 1 Jan 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (eds.). Springer Nature, p. 89-99 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9133).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  11. Preface

    Kulikov, A. S. & Raskhodnikova, S., 2015, Proto-Indo-European Syntax and its Development. John Benjamins Publishing Company, p. v 5 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13296).

    Research output: Chapter in Book/Report/Conference proceedingForeword/postscriptResearchpeer-review

  12. 2014
  13. Solving SCS for bounded length strings in fewer than 2 n steps

    Golovnev, A., Kulikov, A. S. & Mihajlin, I., Aug 2014, In: Information Processing Letters. 114, 8, p. 421-425 5 p.

    Research output: Contribution to journalArticlepeer-review

ID: 9512817