Brahim Chaourar

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The facets of the spanning trees polytope Mathematical Methods of Operations Research	2022-08-31	Paper
Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) Journal of Combinatorial Optimization	2021-05-10	Paper
A short proof of a min-max relation for the bases packing of a matroid Discrete Mathematics, Algorithms and Applications	2020-01-02	Paper
Connected max cut is polynomial for graphs without K₅\backslash e as a minor (available as arXiv preprint)	2019-03-29	Paper
The Facets of the Subtours Elimination Polytope	2018-12-31	Paper
The Kth TSP is pseudopolynomial when TSP is polynomial Discrete Mathematics, Algorithms and Applications	2018-11-14	Paper
A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs Advances in Operations Research	2018-05-11	Paper
An improved algorithm for recognizing matroids	2017-09-29	Paper
The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial	2017-04-10	Paper
On the Maximum-Weight Basis Problem	2016-06-15	Paper
A characterization of uniform matroids ISRN Algebra	2012-05-09	Paper
An O(Kn (Kn)) algorithm for the Kth best spanning tree in series parallel graphs	2011-06-10	Paper
On the \(K\)th best base of a matroid Operations Research Letters	2008-08-06	Paper
On series-parallel extensions of uniform matroids European Journal of Combinatorics	2003-11-16	Paper
On greedy bases packing in matroids European Journal of Combinatorics	2003-03-18	Paper
A new axiom system for matroids: 1. Uniform matroid recognition (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Brahim Chaourar