Hvis du har foretaget ændringer i Pure, vil de snart blive vist her.
Filtrer
Konferencebidrag i proceedings

Søgeresultater

  • 2021

    Perfect Forests in Graphs and Their Extensions

    Gutin, G. & Yeo, A., 1. aug. 2021, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021. Bonchi, F. & Puglisi, S. J. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13 s. 54. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 202).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
  • 2020

    Component order connectivity in directed graphs

    Bang-Jensen, J., Eiben, E., Gutin, G., Wahlström, M. & Yeo, A., dec. 2020, 15th International Symposium on Parameterized and Exact Computation, IPEC 2020. Cao, Y. & Pilipczuk, M. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16 s. 2. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 180).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
    1 Downloads (Pure)
  • Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games

    Gutin, G., Neary, P. R. & Yeo, A., 2020, Computing and Combinatorics: Proceedings of the 26th International Conference, COCOON 2020, . Kim, D., Uma, R. N., Cai, Z. & Lee, D. H. (red.). Springer Science+Business Media, s. 360-371 (Lecture Notes in Computer Science, Bind 12273).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2012

    On the parameterized complexity of the workflow satisfiability problem

    Crampton, J., Gutin, G. & Yeo, A., 2012, CCS'12 - Proceedings of the 2012 ACM Conference on Computer and Communications Security. s. 857-868

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • Parameterized study of the test cover problem

    Crowston, R., Gutin, G., Jones, M., Saurabh, S. & Yeo, A., 2012, Mathematical Foundations of Computer Science 2012 : 37th International Symposium, MFCS 2012, Proceedings. Bind 7464 LNCS. s. 283-295 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 7464 LNCS).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2010

    All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables

    Gutin, G., Van Iersel, L., Mnich, M. & Yeo, A., 2010, Algorithms, ESA 2010 - 18th Annual European Symposium, Proceedings. PART 1 udg. Bind 6346 LNCS. s. 326-337 12 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Nr. PART 1, Bind 6346 LNCS).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review