About me

Currently I am a PhD student at London School of Economics working under supervision of László Végh. You can find out more about me in CV (February 2018). Partially supported by ERC grant ScaleOpt.

News

1.12.2019 In the next three weeks I am visiting University of Helsinki and Alexandru I. Tomescu.
20.06.2019 The paper A polynomial-time algorithm for the independent set problem in {P10,C4,C6}-free graphs received the best student paper award at WG2019.
07.02.2019 A news article about our work on tumor evolution: An algorithm shedding light on the evolution of tumours helps individualise cancer therapies.
1.10.2018 I am attending FOCS 2018 (October 5-9, Paris).
29.06.2018 I am attending:
- Building Bridges II (July 2 - 6, Budapest),
- Midsummer Combinatorial Workshop XXIII (July 30 - August 3, Prague),
- Hausdorff School on Combinatorial Optimization (August 20 - 24, Bonn).
19.03.2018 I am attending Google's Algorithms and Optimization PhD Workshop in Zurich from 10.04 until 12.04.
17.02.2018 Started making personal website.

Manuscripts

Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands
Jugal Garg, Edin Husić and László A. Végh.
[arXiv]

Publications

The independent set problem is FPT for even-hole-free graphs
E. Husić, Stéphan Thomassé and Nicolas Trotignon
[IPEC 2019] [arXiv]
A polynomial-time algorithm for the independent set problem in {P10,C4,C6}-free graphs
Best Student Paper Award at WG 2019
E. Husić and M. Milanič
[WG 2019]
MIPUP : Minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP
E. Husić, X. Li, A. Hujdurović, M. Mehine, R. Rizzi, V. Mäkinen, M. Milanič and A. I. Tomescu,
[Bioinformatics (open access)]
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
A. Hujdurović, E. Husić, M. Milanič, R. Rizzi, and A. I. Tomescu,
[ACM Transactions on Algorithms] [WG 2017] [arXiv]

Talks

The independent set problem is FPT for even-hole-free graphs
september 2019
IPEC, Munich, Germany
Reconstructing Perfect Phylogenies via Branchings in Digraphs
july 2019
MatBio 2019 - King's College London, UK
A polynomial-time algorithm for the independent set problem
in {P10,C4,C6}-free graphs
june 2019
WG 2019 - Vall de Núria, Spain
Independent set is FPT for even hole-free graphs
october 2017
PhD Seminar on Combinatorics, Games and Optimisation - LSE, London, UK

Education

M2 in Fundamental Computer Science

2016 - 2017
École normale supérieure de Lyon

MSc in Mathematical Sciences

2015 - 2017
University of Primorska

BSc in Mathematics

2012 - 2015
University of Primorska

Selected uora answers