( en | de | ru )

 

Disambiguation of "Dilkina, Bistra"

Author of the publication

copydeleteadd this publication to your clipboard
Backdoors to Combinatorial Optimization: Feasibility and Optimality.

, , , , and . CPAIOR, volume 5547 of Lecture Notes in Computer Science, page 56-70. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Bistra Andersen

Bistra Dontschewa

Bistra Andreeva

Bistra Alexandra Scheying

 

Other publications of authors with the same name

Backdoors to Combinatorial Optimization: Feasibility and Optimality., , , , and . CPAIOR, volume 5547 of Lecture Notes in Computer Science, page 56-70. Springer, (2009)Improving GP-UCB Algorithm by Harnessing Decomposed Feedback., , , , and . PKDD/ECML Workshops (1), volume 1167 of Communications in Computer and Information Science, page 555-569. Springer, (2019)Achieving full connectivity of sites in the multiperiod reserve network design problem., , , , and . Comput. Oper. Res., (2017)Tradeoffs in Backdoors: Inconsistency Detection, Dynamic Simplification, and Preprocessing., , and . ISAIM, (2008)Migration patterns under different scenarios of sea level rise., , and . CoRR, (2019)Stay Ahead of Poachers: Illegal Wildlife Poaching Prediction and Patrol Planning Under Uncertainty with Field Test Evaluations., , , , , , , , , and 4 other author(s). CoRR, (2019)Reports from the 2015 AAAI Workshop Program., , , , , , , , , and 14 other author(s). AI Mag., 36 (2): 90-101 (2015)Optimal Patrol Planning for Green Security Games with Black-Box Attackers., , , , , , , , , and 1 other author(s). GameSec, volume 10575 of Lecture Notes in Computer Science, page 458-477. Springer, (2017)Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems., , , and . Eur. J. Oper. Res., 301 (3): 828-840 (2022)Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search., , , and . CoRR, (2023)