Simone Dantas

According to our database1, Simone Dantas authored at least 81 papers between 2000 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Equitable Total Chromatic Number of Kr×p for p Even.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Caterpillars of Game Chromatic Number 4.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the Computational Complexity of the Helly Number in the P3 and Related Convexities.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Adjacent-vertex-distinguishing Total Colourings of Powers of Cycles, Hypercubes and Lattice Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers.
Discret. Math., 2019

On the maximum number of minimum dominating sets in forests.
Discret. Math., 2019

Equitable total coloring of complete r-partite p-balanced graphs.
Discret. Appl. Math., 2019

Timber game as a counting problem.
Discret. Appl. Math., 2019

Sandwiches missing two ingredients of order four.
Annals OR, 2019

2018
Dominating sets inducing large components in maximal outerplanar graphs.
Journal of Graph Theory, 2018

Computational and structural analysis of the contour of graphs.
ITOR, 2018

The partitioned probe problem: NP-complete versus polynomial dichotomy.
Discret. Appl. Math., 2018

Identifying simultaneous rearrangements in cancer genomes.
Bioinformatics, 2018

2017
Genomic Distance with High Indel Costs.
IEEE/ACM Trans. Comput. Biology Bioinform., 2017

New Genome Similarity Measures based on Conserved Gene Adjacencies.
Journal of Computational Biology, 2017

On star and biclique edge-colorings.
ITOR, 2017

The Solitaire Clobber game and correducibility.
Electron. Notes Discret. Math., 2017

On Type 2 Snarks and Dot Products.
Electron. Notes Discret. Math., 2017

Relating 2-rainbow domination to Roman domination.
Discussiones Mathematicae Graph Theory, 2017

Fast and Simple Jumbled Indexing for Binary RLE Strings.
CoRR, 2017

Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy.
Inf. Process. Lett., 2016

On the total coloring of generalized Petersen graphs.
Discret. Math., 2016

Dominating sets inducing large components.
Discret. Math., 2016

On the equitable total chromatic number of cubic graphs.
Discret. Appl. Math., 2016

Slash and burn on graphs - Firefighting with general weights.
Discret. Appl. Math., 2016

Strong equality of Roman and weak Roman domination in trees.
Discret. Appl. Math., 2016

Averaging 2-rainbow domination and Roman domination.
Discret. Appl. Math., 2016

New Genome Similarity Measures Based on Conserved Gene Adjacencies.
Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

2015
The 1, 2-Conjecture for powers of cycles.
Electron. Notes Discret. Math., 2015

Perfectly relating the domination, total domination, and paired domination numbers of a graph.
Discret. Math., 2015

Biclique-colouring verification complexity and biclique-colouring power graphs.
Discret. Appl. Math., 2015

Solitaire Clobber played on Cartesian product of graphs.
Discret. Appl. Math., 2015

The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem.
Discret. Appl. Math., 2015

Asymptotic surviving rate of trees with multiple fire sources.
Discret. Appl. Math., 2015

Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs.
Discret. Appl. Math., 2015

Graph-Theoretic Modelling of the Domain Chaining Problem.
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

Timber Game with Caterpillars.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Solitaire clobber on circulant graphs.
Discret. Math., 2014

The hunting of a snark with total chromatic number 5.
Discret. Appl. Math., 2014

Domination and total domination in cubic graphs of large girth.
Discret. Appl. Math., 2014

2013
The generalized split probe problem.
Electron. Notes Discret. Math., 2013

Matchings in Graphs of Odd Regularity and Girth.
Electron. Notes Discret. Math., 2013

More fires and more fighters.
Discret. Appl. Math., 2013

On the contour of graphs.
Discret. Appl. Math., 2013

DCJ-indel and DCJ-substitution distances with distinct operation costs.
Algorithms for Molecular Biology, 2013

On total coloring and equitable total coloring of cubic graphs with large girth.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Geodetic sets and periphery.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
Gene clusters as intersections of powers of paths.
J. Braz. Comp. Soc., 2012

2k2-partition of some classes of graphs.
Discret. Appl. Math., 2012

Restricted DCJ-indel model: sorting linear genomes with DCJ and indels.
BMC Bioinformatics, 2012

DCJ-indel Distance with Distinct Operation Costs.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

Biclique-colouring - Powers of Paths and Powers of Cycles.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Snarks with Total Chromatic Number 5.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
On Coloring Problems of Snark Families.
Electron. Notes Discret. Math., 2011

Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber.
Electron. Notes Discret. Math., 2011

The total-chromatic number of some families of snarks.
Discret. Math., 2011

Partitioning a graph into convex sets.
Discret. Math., 2011

The external constraint 4 nonempty part sandwich problem.
Discret. Appl. Math., 2011

On the forbidden induced subgraph sandwich problem.
Discret. Appl. Math., 2011

The chain graph sandwich problem.
Annals OR, 2011

2010
Convex Partitions of Graphs induced by Paths of Order Three.
Discrete Mathematics & Theoretical Computer Science, 2010

2K2 vertex-set partition into nonempty parts.
Discret. Math., 2010

Advances on the List Stubborn Problem.
Proceedings of the Theory of Computing 2010, 2010

2009
Skew partition sandwich problem is NP-complete.
Electron. Notes Discret. Math., 2009

Impartial Solitaire Clobber played on Powers of Paths.
Electron. Notes Discret. Math., 2009

The Graph Sandwich Problem for P4-sparse graphs.
Discret. Math., 2009

2008
The polynomial dichotomy for three nonempty part sandwich problems.
Electron. Notes Discret. Math., 2008

2K2 vertex-set partition into nonempty parts.
Electron. Notes Discret. Math., 2008

Colouring clique-hypergraphs of circulant graphs.
Electron. Notes Discret. Math., 2008

2006
Extended skew partition problem.
Discret. Math., 2006

2005
Finding H-partitions efficiently.
ITA, 2005

The P4-sparse Graph Sandwich Problem.
Electron. Notes Discret. Math., 2005

2K2-Partition Problem.
Electron. Notes Discret. Math., 2005

2004
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
Discret. Appl. Math., 2004

Stable skew partition problem.
Discret. Appl. Math., 2004

On decision and optimization (k, l)-graph sandwich problems.
Discret. Appl. Math., 2004

2002
On the Complexity of (k, l)-Graph Sandwich Problems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
Electron. Notes Discret. Math., 2001

2000
A Note on a Penalty Function Approach for Solving Bilevel Linear Programs.
J. Global Optimization, 2000


  Loading...