Influence maximization with deactivation in social networks. - Kübra Taninmis; Necati Aras; I. Kuban Altinel (Eur. J. Oper. Res., 2019)

Minimizing the misinformation spread in social networks. - Kübra Taninmis; Necati Aras; I. Kuban Altinel; Evren Güney (IISE Trans., 2020)

An Exact Method for Fortification Games. - Markus Leitner; Ivana Ljubic; Michele Monaci; Markus Sinnl; Kübra Taninmis (CoRR, 2021)

SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. - Elisabeth Gaar; Jon Lee 001; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (IPCO, 2022)

Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks. - Kübra Taninmis; Necati Aras; I. Kuban Altinel (Eur. J. Oper. Res., 2022)

A Branch-and-Cut Algorithm for Submodular Interdiction Games. - Kübra Taninmis; Markus Sinnl (INFORMS J. Comput., 2022)

An exact method for binary fortification games. - Markus Leitner; Ivana Ljubic; Michele Monaci; Markus Sinnl; Kübra Taninmis (Eur. J. Oper. Res., 2023)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks. - Kübra Taninmis; Necati Aras; Evren Güney; Markus Sinnl (Comput. Oper. Res., 2024)

Competing for the most profitable tour: The orienteering interdiction game. - Eduardo Álvarez-Miranda; Markus Sinnl; Kübra Taninmis (CoRR, 2024)

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. - Elisabeth Gaar; Jon Lee 001; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (Math. Program., 2024)