pith. sign in

Mart\'in D. Safe

Identifiers

  • name variant Mart\'in D. Safe 0.60 · backfill

Papers (8)

  1. Covering graphs with convex sets and partitioning graphs into convex sets math.CO · 2019 · author #3
  2. Circularly compatible ones, $D$-circularity, and proper circular-arc bigraphs math.CO · 2019 · author #1
  3. Partial characterization of graphs having a single large Laplacian eigenvalue math.CO · 2017 · author #5
  4. A $\{-1,0,1\}$- and sparsest basis for the null space of a forest in optimal time math.CO · 2017 · author #4
  5. Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property math.CO · 2016 · author #1
  6. Neighborhood covering and independence on two superclasses of cographs cs.DM · 2016 · author #2
  7. Forbidden Induced Subgraphs of Normal Helly Circular-Arc Graphs: Characterization and Detection cs.DM · 2014 · author #3
  8. On circular-arc graphs having a model with no three arcs covering the circle cs.DM · 2014 · author #2

Mentions

  • 1405.0329 #3 · backfill · confidence 0.70 Mart\'in D. Safe
  • 1402.2641 #2 · backfill · confidence 0.70 Mart\'in D. Safe

Frequent Coauthors