Skip to content

Jean Mailfert

    • 3h-indexImpact measure calculated using publication and citation counts. Updated daily.
    • 37CitationsNumber of citations received by Jean's publications. Updated daily.

    Other IDs

    Co-authors (12)

    Publications (5)

    • A branch-and-cut algorithm for the k-edge connected subgraph problem

      • Bendali F
      • Diarrassouba I
      • Mahjoub A
      • et al.
      N/AReaders
      9Citations
      Get full text
    • Heuristics for designing energy-efficient wireless sensor network topologies

      • Santos A
      • Bendali F
      • Mailfert J
      • et al.
      N/AReaders
      10Citations
    • An optimization approach for designing wireless sensor networks

      • Bendali F
      • Duhamel C
      • Hou K
      • et al.
      N/AReaders
      2Citations
      Get full text
    • The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut

      • Bendali F
      • Diarrassouba I
      • Biha M
      • et al.
      N/AReaders
      1Citations
      Get full text
    • Composition of graphs and the triangle-free subgraph polytope

      • Bendali F
      • Mahjoub A
      • Mailfert J
      N/AReaders
      1Citations
      Get full text