Brahim Chaourar

Available identifiers

Publication	Date of Publication	Type
The facets of the spanning trees polytope	2022-08-31	Paper
Connected max cut is polynomial for graphs without the excluded minor $K_5\backslash e$	2021-05-10	Paper
A short proof of a min–max relation for the bases packing of a matroid	2020-01-02	Paper
Connected max cut is polynomial for graphs without $K_5\backslash e$ as a minor	2019-03-29	Paper
The Facets of the Subtours Elimination Polytope	2018-12-31	Paper
The Kth TSP is pseudopolynomial when TSP is polynomial	2018-11-14	Paper
A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs	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	2012-05-09	Paper
https://portal.mardi4nfdi.de/entity/Q3005918	2011-06-10	Paper
On the $K$th best base of a matroid	2008-08-06	Paper
On series-parallel extensions of uniform matroids	2003-11-16	Paper
On greedy bases packing in matroids	2003-03-18	Paper
A new axiom system for matroids: 1. Uniform matroid recognition	N/A	Paper

This page was built for person: Brahim Chaourar