On Greedy Bases Packing in Matroids. - Brahim Chaourar (Eur. J. Comb., 2002)

On series-parallel extensions of uniform matroids. - Brahim Chaourar; James G. Oxley (Eur. J. Comb., 2003)

MFMP: Max Flow Multipath Routing Algorithm. - Ahmed Redha Mahlous; Rod J. Fretwell; Brahim Chaourar (EMS, 2008)

On the Kth best base of a matroid. - Brahim Chaourar (Oper. Res. Lett., 2008)

Performance Evaluation of Max Flow Multipath Protocol with Congestion Awareness. - Ahmed Redha Mahlous; Brahim Chaourar; Mahmoud Mansour (AINA Workshops, 2009)

A Linear Time Algorithm for a Variant of the MAX CUT Problem in Series Parallel Graphs. - Brahim Chaourar (Adv. Oper. Res., 2017)

The Facets of the Bases Polytope of a Matroid and Two Consequences. - Brahim Chaourar (CoRR, 2017)

The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial. - Brahim Chaourar (CoRR, 2017)

Recognizing Matroids. - Brahim Chaourar (CoRR, 2017)

On the Broadcast Routing Problem in Computer Networks. - Brahim Chaourar (CoRR, 2018)

The Kth TSP is pseudopolynomial when TSP is polynomial. - Brahim Chaourar (Discret. Math. Algorithms Appl., 2018)

Connected max cut is polynomial for graphs without $K_5 backslash e$ as a minor. - Brahim Chaourar (CoRR, 2019)

A short proof of a min-max relation for the bases packing of a matroid. - Brahim Chaourar (Discret. Math. Algorithms Appl., 2019)

Connected max cut is polynomial for graphs without the excluded minor $K_5 backslash e$. - Brahim Chaourar (J. Comb. Optim., 2020)

The facets of the spanning trees polytope. - Brahim Chaourar (Math. Methods Oper. Res., 2022)