Simone Dantas

RAIRO Oper. Res., September, 2023

A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals.

[BibT_eX]

[DOI]

Wilder P. Mendes

Discret. Appl. Math., July, 2023

On the degree of trees with game chromatic number 4.

[BibT_eX]

[DOI]

Miguel A. D. R. Palma

RAIRO Oper. Res., 2023

New results on Type 2 snarks.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

Spherical fullerene graphs that do not satisfy Andova and Škrekovski's conjecture.

[BibT_eX]

[DOI]

Thiago M. D. Silva

Diego S. Nicodemos

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Kochol superposition of Goldberg with Semi-blowup snarks is Type 1.

[BibT_eX]

[DOI]

Miguel A. D. R. Palma

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Biclique coloring game (Brief Announcement).

[BibT_eX]

[DOI]

Paola T. P. Huaynoca

Daniel F. D. Posner

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2021

Determining equitable total chromatic number for infinite classes of complete r-partite graphs.

[BibT_eX]

[DOI]

Anderson G. da Silva

Discret. Appl. Math., 2021

The (a, b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cycles.

[BibT_eX]

[DOI]

Wilder P. Mendes

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

On equitable total coloring of snarks.

[BibT_eX]

[DOI]

Isabel F. A. Gonçalves

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Neighbour-distinguishing labellings of powers of paths and powers of cycles.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

The Solitaire Clobber game and correducibility of graphs.

[BibT_eX]

[DOI]

Rodrigo Marinho

Slobodan Tanushevski

Discret. Appl. Math., 2020

On the Graceful Game.

[BibT_eX]

[DOI]

Luisa Frickes

Atílio G. Luiz

CoRR, 2020

2019

Equitable Total Chromatic Number of Kr×p for p Even.

[BibT_eX]

[DOI]

Anderson G. da Silva

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Caterpillars of Game Chromatic Number 4.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness.

[BibT_eX]

[DOI]

Priscila Petito

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Rodrigo Marinho

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.

[BibT_eX]

[DOI]

Clément Charpentier

Discret. Math., 2019

On the maximum number of minimum dominating sets in forests.

[BibT_eX]

[DOI]

Discret. Math., 2019

Equitable total coloring of complete r-partite p-balanced graphs.

[BibT_eX]

[DOI]

Anderson G. da Silva

Discret. Appl. Math., 2019

Timber game as a counting problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Sandwiches missing two ingredients of order four.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2019

2018

Dominating sets inducing large components in maximal outerplanar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Computational and structural analysis of the contour of graphs.

[BibT_eX]

[DOI]

Alonso L. S. Oliveira

Thiago M. D. Silva

Int. Trans. Oper. Res., 2018

The partitioned probe problem: NP-complete versus polynomial dichotomy.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Identifying simultaneous rearrangements in cancer genomes.

[BibT_eX]

[DOI]

Layla Oesper

Benjamin J. Raphael

Bioinform., 2018

2017

Genomic Distance with High Indel Costs.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2017

New Genome Similarity Measures based on Conserved Gene Adjacencies.

[BibT_eX]

[DOI]

Daniel Doerr

J. Comput. Biol., 2017

On star and biclique edge-colorings.

[BibT_eX]

[DOI]

Marina Groshaus

André Luiz Pires Guedes

Raphael C. S. Machado

Bernard Ries

Int. Trans. Oper. Res., 2017

The Solitaire Clobber game and correducibility.

[BibT_eX]

[DOI]

Rodrigo Marinho

Slobodan Tanushevski

Electron. Notes Discret. Math., 2017

On Type 2 Snarks and Dot Products.

[BibT_eX]

[DOI]

Luana Cordeiro

Electron. Notes Discret. Math., 2017

Relating 2-rainbow domination to Roman domination.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Fast and Simple Jumbled Indexing for Binary RLE Strings.

[BibT_eX]

[DOI]

Jens Stoye

CoRR, 2017

Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings.

[BibT_eX]

[DOI]

Jens Stoye

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

On the total coloring of generalized Petersen graphs.

[BibT_eX]

[DOI]

Giuseppe Mazzuoccolo

Vinícius Fernandes dos Santos

Discret. Math., 2016

Dominating sets inducing large components.

[BibT_eX]

[DOI]

Discret. Math., 2016

On the equitable total chromatic number of cubic graphs.

[BibT_eX]

[DOI]

Giuseppe Mazzuoccolo

Vinícius Fernandes dos Santos

Discret. Appl. Math., 2016

Slash and burn on graphs - Firefighting with general weights.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Strong equality of Roman and weak Roman domination in trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Averaging 2-rainbow domination and Roman domination.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

New Genome Similarity Measures Based on Conserved Gene Adjacencies.

[BibT_eX]

[DOI]

Daniel Doerr

Jens Stoye

Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

2015

The 1, 2-Conjecture for powers of cycles.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

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

[BibT_eX]

[DOI]

Discret. Math., 2015

Biclique-colouring verification complexity and biclique-colouring power graphs.

[BibT_eX]

[DOI]

Hélio B. Macêdo Filho

Raphael C. S. Machado

Discret. Appl. Math., 2015

Solitaire Clobber played on Cartesian product of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Asymptotic surviving rate of trees with multiple fire sources.

[BibT_eX]

[DOI]

Vítor Costa

Discret. Appl. Math., 2015

Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Graph-Theoretic Modelling of the Domain Chaining Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

Timber Game with Caterpillars.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Solitaire clobber on circulant graphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

The hunting of a snark with total chromatic number 5.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Domination and total domination in cubic graphs of large girth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

The generalized split probe problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Matchings in Graphs of Odd Regularity and Girth.

[BibT_eX]

[DOI]

Vítor Costa

Electron. Notes Discret. Math., 2013

More fires and more fighters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

On the contour of graphs.

[BibT_eX]

[DOI]

Mitre Costa Dourado

Sei-ichi Yamaguchi

Discret. Appl. Math., 2013

DCJ-indel and DCJ-substitution distances with distinct operation costs.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2013

On total coloring and equitable total coloring of cubic graphs with large girth.

[BibT_eX]

Giuseppe Mazzuoccolo

Vinícius Fernandes dos Santos

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

Geodetic sets and periphery.

[BibT_eX]

Mitre Costa Dourado

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

2012

Gene clusters as intersections of powers of paths.

[BibT_eX]

[DOI]

J. Braz. Comput. Soc., 2012

2k2-partition of some classes of graphs.

[BibT_eX]

[DOI]

Ana Silva

Discret. Appl. Math., 2012

Restricted DCJ-indel model: sorting linear genomes with DCJ and indels.

[BibT_eX]

[DOI]

BMC Bioinform., 2012

DCJ-indel Distance with Distinct Operation Costs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

Biclique-colouring - Powers of Paths and Powers of Cycles.

[BibT_eX]

Hélio B. Macêdo Filho

Raphael C. S. Machado

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Snarks with Total Chromatic Number 5.

[BibT_eX]

Gunnar Brinkmann

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

On Coloring Problems of Snark Families.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

The total-chromatic number of some families of snarks.

[BibT_eX]

[DOI]

C. N. Campos

Discret. Math., 2011

Partitioning a graph into convex sets.

[BibT_eX]

[DOI]

Mitre Costa Dourado

Discret. Math., 2011

The external constraint 4 nonempty part sandwich problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

On the forbidden induced subgraph sandwich problem.

[BibT_eX]

[DOI]

Murilo Vicente Gonçalves da Silva

Discret. Appl. Math., 2011

The chain graph sandwich problem.

[BibT_eX]

[DOI]

Martin Charles Golumbic

Ann. Oper. Res., 2011

2010

Convex Partitions of Graphs induced by Paths of Order Three.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2010

2K2 vertex-set partition into nonempty parts.

[BibT_eX]

[DOI]

Discret. Math., 2010

Advances on the List Stubborn Problem.

[BibT_eX]

[DOI]

Loana Tito Nogueira

Fábio Protti

Proceedings of the Theory of Computing 2010, 2010

2009

Skew partition sandwich problem is NP-complete.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Impartial Solitaire Clobber played on Powers of Paths.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

The Graph Sandwich Problem for P4-sparse graphs.

[BibT_eX]

[DOI]

Aurora Morgana

Discret. Math., 2009

2008

The polynomial dichotomy for three nonempty part sandwich problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

2K2 vertex-set partition into nonempty parts.

[BibT_eX]

[DOI]

Elaine M. Eschen

Electron. Notes Discret. Math., 2008

Colouring clique-hypergraphs of circulant graphs.

[BibT_eX]

[DOI]

C. N. Campos

Electron. Notes Discret. Math., 2008

2006

Extended skew partition problem.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

Finding H-partitions efficiently.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

The P4-sparse Graph Sandwich Problem.

[BibT_eX]

[DOI]

Aurora Morgana

Electron. Notes Discret. Math., 2005

2K2-Partition Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2004

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Stable skew partition problem.

[BibT_eX]

[DOI]

Bruce A. Reed

Discret. Appl. Math., 2004

On decision and optimization (k, l)-graph sandwich problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2002

On the Complexity of (k, l)-Graph Sandwich Problems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

2000

A Note on a Penalty Function Approach for Solving Bilevel Linear Programs.

[BibT_eX]

[DOI]

Manoel B. Campêlo