Brahim Chaourar

Publication Activity (10 Years)

Years Active: 2002-2022
Publications (10 Years): 12

Top Topics

Hamiltonian Cycle

Traveling Salesman Problem

Top Venues

Discret. Math. Algorithms Appl.

J. Comb. Optim.

Adv. Oper. Res.

Publications

Brahim Chaourar
The facets of the spanning trees polytope. Math. Methods Oper. Res. 96 (1) (2022)
Brahim Chaourar
Connected max cut is polynomial for graphs without the excluded minor $K_5\backslash e$. J. Comb. Optim. 40 (4) (2020)
Brahim Chaourar
A short proof of a min-max relation for the bases packing of a matroid. Discret. Math. Algorithms Appl. 11 (6) (2019)
Brahim Chaourar
The facets of the spanning trees polytope. CoRR (2019)
Brahim Chaourar
Connected max cut is polynomial for graphs without $K_5\backslash e$ as a minor. CoRR (2019)
Brahim Chaourar
On the Broadcast Routing Problem in Computer Networks. CoRR (2018)
Brahim Chaourar
The Kth TSP is pseudopolynomial when TSP is polynomial. Discret. Math. Algorithms Appl. 10 (5) (2018)
Brahim Chaourar
The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial. CoRR (2017)
Brahim Chaourar
Recognizing Matroids. CoRR (2017)
Brahim Chaourar
The Facets of the Bases Polytope of a Matroid and Two Consequences. CoRR (2017)
Brahim Chaourar
A Linear Time Algorithm for a Variant of the MAX CUT Problem in Series Parallel Graphs. Adv. Oper. Res. 2017 (2017)
Brahim Chaourar
A linear time algorithm for a variant of the max cut problem in series parallel graphs. CoRR (2016)
Ahmed Redha Mahlous, Brahim Chaourar, Mahmoud Mansour
Performance Evaluation of Max Flow Multipath Protocol with Congestion Awareness. AINA Workshops (2009)
Brahim Chaourar
On the Kth best base of a matroid. Oper. Res. Lett. 36 (2) (2008)
Ahmed Redha Mahlous, Rod J. Fretwell, Brahim Chaourar
MFMP: Max Flow Multipath Routing Algorithm. EMS (2008)
Brahim Chaourar, James G. Oxley
On series-parallel extensions of uniform matroids. Eur. J. Comb. 24 (7) (2003)
Brahim Chaourar
On Greedy Bases Packing in Matroids. Eur. J. Comb. 23 (7) (2002)