All Colors Shortest Path Problem. - Yunus Can Bilge; Dogukan Çagatay; Begüm Genç; Mecit Sari; Hüseyin Akcan; Cem Evrendilek (CoRR, 2015)

Improving Navigation in Critique Graphs. - Begum Genc; Barry O'Sullivan (ICTAI, 2016)

An algorithm for automated layout of process description maps drawn in SBGN. - Begüm Genç; Ugur Dogrusoz (Bioinform., 2016)

Robust Stable Marriage. - Begum Genc; Mohamed Siala 002; Barry O'Sullivan; Gilles Simonin (AAAI, 2017)

On the Complexity of Robust Stable Marriage. - Begum Genc; Mohamed Siala 002; Gilles Simonin; Barry O'Sullivan (COCOA (2), 2017)

Finding Robust Solutions to Stable Marriage. - Begum Genc; Mohamed Siala 002; Barry O'Sullivan; Gilles Simonin (IJCAI, 2017)

An Approach to Robustness in the Stable Roommates Problem and Its Comparison with the Stable Marriage Problem. - Begum Genc; Mohamed Siala 002; Gilles Simonin; Barry O'Sullivan (CPAIOR, 2019)

Complexity Study for the Robust Stable Marriage Problem. - Begum Genc; Mohamed Siala 002; Gilles Simonin; Barry O'Sullivan (Theor. Comput. Sci., 2019)

An approach to robustness in stable marriage and stable roommates problems. - Begum Genc (2019)

A Two-Phase Constraint Programming Model for Examination Timetabling at University College Cork. - Begum Genc; Barry O'Sullivan (CP, 2020)

Explanation in Constraint Satisfaction: A Survey. - Sharmi Dev Gupta; Begum Genc; Barry O'Sullivan (IJCAI, 2021)

A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. - Ágnes Cseh; Guillaume Escamocher; Begüm Genç; Luis Quesada 001 (Constraints An Int. J., 2022)

Finding Counterfactual Explanations through Constraint Relaxations. - Sharmi Dev Gupta; Begum Genc; Barry O'Sullivan (CoRR, 2022)