Search results

  • 2017

    The Structure of Goal Systems Predicts Human Performance.

    Bourgin, D., Lieder, F., Reichman, D., Talmon, N. & Griffiths, T., 2017, CogSci- The Annual meeting of the Cognitive Science Society. 6 p.

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

  • What do multiwinner voting rules do? an experiment over the two-dimensional euclidean domain

    Elkind, E., Faliszewski, P., Laslier, J. F., Skowron, P., Slinko, A. & Talmon, N., 1 Jan 2017, p. 494-501. 8 p.

    Research output: Contribution to conferencePaperpeer-review

    47 Scopus citations
  • When can graph hyperbolicity be computed in linear time?

    Fluschnik, T., Komusiewicz, C., Mertzios, G. B., Nichterlein, A., Niedermeier, R. & Talmon, N., 1 Jan 2017, Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. Ellen, F., Kolokolova, A. & Sack, J-R. (eds.). Springer Verlag, p. 397-408 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10389 LNCS).

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

    Open Access
    11 Scopus citations
  • 2016

    Achieving fully proportional representation by clustering voters

    Faliszewski, P., Slinko, A., Stahl, K. & Talmon, N., 1 Jan 2016, AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), p. 296-304 9 p. (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS).

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

    8 Scopus citations
  • Committee scoring rules: Axiomatic classification and hierarchy

    Faliszewski, P., Skowron, P., Slinko, A. & Talmon, N., 1 Jan 2016, In: IJCAI International Joint Conference on Artificial Intelligence. 2016-January, p. 250-256 7 p.

    Research output: Contribution to journalConference articlepeer-review

    30 Scopus citations
  • Complexity of shift bribery in committee elections

    Bredereck, R., Faliszewski, P., Niedermeier, R. & Talmon, N., 1 Jan 2016, 30th AAAI Conference on Artificial Intelligence, AAAI 2016. AAAI press, p. 2452-2458 7 p. (30th AAAI Conference on Artificial Intelligence, AAAI 2016).

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

    38 Scopus citations
  • Large-scale election campaigns: Combinatorial Shift Bribery

    Bredereck, R., Faliszewski, P., Niedermeier, R. & Talmon, N., 1 Mar 2016, In: Journal Of Artificial Intelligence Research. 55, p. 603-652 50 p.

    Research output: Contribution to journalReview articlepeer-review

    Open Access
    28 Scopus citations
  • Multi-Player Diffusion Games on Graph Classes

    Bulteau, L., Froese, V. & Talmon, N., 1 Nov 2016, In: Internet Mathematics. 12, 6, p. 363-380 18 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    5 Scopus citations
  • Multiwinner analogues of the plurality rule: Axiomatic and algorithmic perspectives

    Faliszewski, P., Skowron, P., Slinko, A. & Talmon, N., 1 Jan 2016, 30th AAAI Conference on Artificial Intelligence, AAAI 2016. AAAI press, p. 482-488 7 p. (30th AAAI Conference on Artificial Intelligence, AAAI 2016).

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

    19 Scopus citations
  • NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting

    Bredereck, R. & Talmon, N., 1 Feb 2016, In: Information Processing Letters. 116, 2, p. 147-152 6 p.

    Research output: Contribution to journalArticlepeer-review

    5 Scopus citations
  • Precedence-constrained scheduling problems parameterized by partial order width

    van Bevern, R., Bredereck, R., Bulteau, L., Komusiewicz, C., Talmon, N. & Woeginger, G. J., 1 Jan 2016, Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings. Khachay, M., Pardalos, P., Kochetov, Y., Beresnev, V. & Nurminski, E. (eds.). Springer Verlag, p. 105-120 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9869 LNCS).

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

    Open Access
    25 Scopus citations
  • Voting-based group formation

    Faliszewski, P., Slinko, A. & Talmon, N., 1 Jan 2016, In: IJCAI International Joint Conference on Artificial Intelligence. 2016-January, p. 243-249 7 p.

    Research output: Contribution to journalConference articlepeer-review

    1 Scopus citations
  • 2015

    Combinatorial voter control in elections

    Bulteau, L., Chen, J., Faliszewski, P., Niedermeier, R. & Talmon, N., 19 Jul 2015, In: Theoretical Computer Science. 589, p. 99-120 22 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    18 Scopus citations
  • Elections with few candidates: Prices, weights, and covering problems

    Bredereck, R., Faliszewski, P., Niedermeier, R., Skowron, P. & Talmon, N., 1 Jan 2015, Algorithmic Decision Theory - 4th International Conference, ADT 2015, Proceedings. Walsh, T. (ed.). Springer Verlag, p. 414-431 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9346).

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

    Open Access
    27 Scopus citations
  • Elections with few voters: Candidate control can be easy

    Chen, J., Faliszewski, P., Niedermeier, R. & Talmon, N., 1 Jun 2015, Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015. AI Access Foundation, p. 2045-2051 7 p. (Proceedings of the National Conference on Artificial Intelligence; vol. 3).

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

    33 Scopus citations
  • Large-scale election campaigns: Combinatorial shift bribery

    Bredereck, R., Faliszewski, P., Niedermeier, R. & Talmon, N., 1 Jan 2015, AAMAS 2015 - Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems. Elkind, E., Bordini, R. H., Weiss, G. & Yolum, P. (eds.). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), p. 67-75 9 p. (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS; vol. 1).

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

    12 Scopus citations
  • Multi-player diffusion games on graph classes

    Bulteau, L., Froese, V. & Talmon, N., 1 Jan 2015, Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Proceedings. Jain, R., Jain, S. & Stephan, F. (eds.). Springer Verlag, p. 200-211 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9076).

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

    Open Access
    2 Scopus citations
  • Privacy in elections: K-anonymizing preference orders

    Talmon, N., 1 Jan 2015, Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Proceedings. Walukiewicz, I. & Kosowski, A. (eds.). Springer Verlag, p. 299-310 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9210).

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

    1 Scopus citations
  • Scheduling two competing agents when one agent has significantly fewer jobs

    Hermelin, D., Kubitza, J. M., Shabtay, D., Talmon, N. & Woeginger, G., 1 Nov 2015, In: Leibniz International Proceedings in Informatics, LIPIcs. p. 55-65 11 p.

    Research output: Contribution to journalConference articlepeer-review

    9 Scopus citations
  • The complexity of degree anonymization by graph contractions

    Hartung, S. & Talmon, N., 1 Jan 2015, Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Proceedings. Jain, R., Jain, S. & Stephan, F. (eds.). Springer Verlag, p. 260-271 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9076).

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

    7 Scopus citations
  • The complexity of degree anonymization by vertex addition

    Bredereck, R., Froese, V., Hartung, S., Nichterlein, A., Niedermeier, R. & Talmon, N., 23 Nov 2015, In: Theoretical Computer Science. 607, p. 16-34 19 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    13 Scopus citations
  • The complexity of finding effectors

    Bulteau, L., Fafianie, S., Froese, V., Niedermeier, R. & Talmon, N., 1 Jan 2015, Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Proceedings. Jain, R., Jain, S. & Stephan, F. (eds.). Springer Verlag, p. 224-235 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9076).

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

    Open Access
  • 2014

    Approximability and parameterized complexity of multicover by c-intervals

    Van Bevern, R., Chen, J., Hüffner, F., Kratsch, S., Talmon, N. & Woeginger, G. J., 29 Jul 2014, In: Information Processing Letters. 115, 10, p. 744-749 6 p.

    Research output: Contribution to journalArticlepeer-review

    4 Scopus citations
  • Combinatorial voter control in elections

    Chen, J., Faliszewski, P., Niedermeier, R. & Talmon, N., 1 Jan 2014, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2 ed. Springer Verlag, p. 153-164 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8635 LNCS, no. PART 2).

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

    Open Access
    7 Scopus citations
  • The complexity of degree anonymization by vertex addition

    Bredereck, R., Froese, V., Hartung, S., Nichterlein, A., Niedermeier, R. & Talmon, N., 1 Jan 2014, Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Proceedings. Springer Verlag, p. 44-55 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8546 LNCS).

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

    12 Scopus citations
  • 2012

    Selection in the presence of memory faults, with applications to in-place resilient sorting

    Kopelowitz, T. & Talmon, N., 1 Jan 2012, Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings. Springer Verlag, p. 558-567 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7676 LNCS).

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

    Open Access
    2 Scopus citations