Brahim Chaourar

According to our database, Brahim Chaourar authored at least 15 papers between 2002 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

The facets of the spanning trees polytope.

Brahim Chaourar

Math. Methods Oper. Res., 2022

2020

Connected max cut is polynomial for graphs without the excluded minor $K_5\backslash e$.

Brahim Chaourar

J. Comb. Optim., 2020

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 $K_5\backslash e$ as a minor.

Brahim Chaourar

CoRR, 2019

2018

The Kth TSP is pseudopolynomial when TSP is polynomial.

Brahim Chaourar

Discret. Math. Algorithms Appl., 2018

On the Broadcast Routing Problem in Computer Networks.

Brahim Chaourar

CoRR, 2018

2017

Recognizing Matroids.

Brahim Chaourar

CoRR, 2017

The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial.

Brahim Chaourar

CoRR, 2017

The Facets of the Bases Polytope of a Matroid and Two Consequences.

Brahim Chaourar

CoRR, 2017

A Linear Time Algorithm for a Variant of the MAX CUT Problem in Series Parallel Graphs.

Brahim Chaourar

Adv. Oper. Res., 2017

2009

Performance Evaluation of Max Flow Multipath Protocol with Congestion Awareness.

Ahmed Redha Mahlous, Brahim Chaourar, Mahmoud Mansour

Proceedings of the 23rd International Conference on Advanced Information Networking and Applications, 2009

2008

On the Kth best base of a matroid.

Brahim Chaourar

Oper. Res. Lett., 2008

MFMP: Max Flow Multipath Routing Algorithm.

Ahmed Redha Mahlous, Rod J. Fretwell, Brahim Chaourar

Proceedings of the EMS 2008, 2008

2003

On series-parallel extensions of uniform matroids.

Brahim Chaourar, James G. Oxley

Eur. J. Comb., 2003

2002

On Greedy Bases Packing in Matroids.

Brahim Chaourar

Eur. J. Comb., 2002