Martín Darío Safe

Orcid: 0000-0002-5405-7331

According to our database1, Martín Darío Safe authored at least 43 papers between 2004 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On the generalized Helly property of hypergraphs, cliques, and bicliques.
Discret. Appl. Math., May, 2023

Least corank for the nonexistence of uniformly most reliable graphs.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Characterization of balanced graphs within claw-free graphs.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022
2-Nested Matrices: Towards Understanding the Structure of Circle Graphs.
Graphs Comb., 2022

Essential obstacles to Helly circular-arc graphs.
Discret. Appl. Math., 2022

Forbidden induced subgraph characterization of circle graphs within split graphs.
Discret. Appl. Math., 2022

2021
Circularly Compatible Ones, D-Circularity, and Proper Circular-Arc Bigraphs.
SIAM J. Discret. Math., 2021

A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems.
Eur. J. Oper. Res., 2021

Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs.
Australas. J Comb., 2021

2020
Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property.
J. Graph Theory, 2020

Labelled packing functions in graphs.
Inf. Process. Lett., 2020

Covering graphs with convex sets and partitioning graphs into convex sets.
Inf. Process. Lett., 2020

On some graph classes related to perfect graphs: A survey.
Discret. Appl. Math., 2020

Neighborhood covering and independence on P<sub>4</sub>-tidy graphs and tree-cographs.
Ann. Oper. Res., 2020

Two Arithmetical Sources and Their Associated Tries.
Proceedings of the 31st International Conference on Probabilistic, 2020

2019
Computing the Determinant of the Distance Matrix of a Bicyclic Graph.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs.
CoRR, 2019

2018
The Dominance Flow Shop Scheduling Problem.
Electron. Notes Discret. Math., 2018

Domination parameters with number : Interrelations and algorithmic consequences.
Discret. Appl. Math., 2018

Partial Characterization of Graphs Having a Single Large Laplacian Eigenvalue.
Electron. J. Comb., 2018

2017
On graphs with a single large Laplacian eigenvalue.
Electron. Notes Discret. Math., 2017

Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection.
Discret. Appl. Math., 2017

A {-1, 0, 1}- and sparsest basis for the null space of a forest in optimal time.
CoRR, 2017

2016
Convex p-partitions of bipartite graphs.
Theor. Comput. Sci., 2016

Graph classes with and without powers of bounded clique-width.
Discret. Appl. Math., 2016

Neighborhood covering and independence on two superclasses of cographs.
CoRR, 2016

2015
On the hereditary (p, q)-Helly property of hypergraphs, cliques, and bicliques.
Electron. Notes Discret. Math., 2015

On probe co-bipartite and probe diamond-free graphs.
Discret. Math. Theor. Comput. Sci., 2015

2014
Clique-perfectness and balancedness of some graph classes.
Int. J. Comput. Math., 2014

Balancedness of subclasses of circular-arc graphs.
Discret. Math. Theor. Comput. Sci., 2014

Structural results on circular-arc graphs and circle graphs: A survey and the main open problems.
Discret. Appl. Math., 2014

On circular-arc graphs having a model with no three arcs covering the circle.
CoRR, 2014

Graphs of Power-Bounded Clique-Width.
CoRR, 2014

2013
Probe interval graphs and probe unit interval graphs on superclasses of cographs.
Discret. Math. Theor. Comput. Sci., 2013

Forbidden subgraphs and the König-Egerváry property.
Discret. Appl. Math., 2013

2011
Probe interval and probe unit interval graphs on superclasses of cographs.
Electron. Notes Discret. Math., 2011

Forbidden subgraphs and the Kőnig property.
Electron. Notes Discret. Math., 2011

Clique-perfectness of complements of line graphs.
Electron. Notes Discret. Math., 2011

Partial characterizations of circle graphs.
Discret. Appl. Math., 2011

2010
Balancedness of some subclasses of circular-arc graphs.
Electron. Notes Discret. Math., 2010

2009
On minimal forbidden subgraph characterizations of balanced graphs.
Electron. Notes Discret. Math., 2009

2008
Partial Characterizations of Circular-Arc Graphs.
Electron. Notes Discret. Math., 2008

2004
On Stopping Criteria for Genetic Algorithms.
Proceedings of the Advances in Artificial Intelligence - SBIA 2004, 17th Brazilian Symposium on Artificial Intelligence, São Luis, Maranhão, Brazil, September 29, 2004


  Loading...