| Publication | Date of Publication | Type |
|---|
New results on edge-coloring and total-coloring of split graphs
Discrete Applied Mathematics | 2024-12-04 | Paper |
Canonical cuts of path powers
Contributions to Discrete Mathematics | 2024-11-20 | Paper |
Complexity of the oriented coloring in planar, cubic oriented graphs
Matemática Contemporânea | 2024-04-22 | Paper |
Bipartite edge frustration and maximum independent set problems on fulleroids-\((3,4,6)\)
Matemática Contemporânea | 2024-04-22 | Paper |
On the oriented coloring of the disjoint union of graphs
RAIRO - Operations Research | 2024-04-14 | Paper |
| New Results on Edge-coloring and Total-coloring of Split Graphs | 2023-03-10 | Paper |
Partitions and well-coveredness: the graph sandwich problem
Discrete Mathematics | 2023-01-17 | Paper |
| Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques | 2022-10-13 | Paper |
| On the oriented coloring of the disjoint union of graphs | 2022-03-22 | Paper |
Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs
Discrete Applied Mathematics | 2020-05-29 | Paper |
Maximum cuts in edge-colored graphs
Discrete Applied Mathematics | 2020-05-29 | Paper |
FPT algorithms to recognize well covered graphs
(available as arXiv preprint) | 2019-05-23 | Paper |
| FPT algorithms to recognize well covered graphs | 2019-05-23 | Paper |
scientific article; zbMATH DE number 6987353 (Why is no real title available?)
(available as arXiv preprint) | 2018-11-30 | Paper |
| scientific article; zbMATH DE number 6987353 (Why is no real title available?) | 2018-11-30 | Paper |
On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
Theoretical Computer Science | 2018-09-27 | Paper |
Maximum cuts in edge-colored graphs
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
On the forbidden induced subgraph probe and sandwich problems
Discrete Applied Mathematics | 2017-12-20 | Paper |
Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
Theory of Computing Systems | 2017-10-12 | Paper |
On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the complexity of probe and sandwich problems for generalized threshold graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
| Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs | 2016-10-17 | Paper |
Complexity of graph partition problems
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
| The graph sandwich problem for 1-join composition is NP-complete | 2016-07-01 | Paper |
The homogeneous set sandwich problem
Information Processing Letters | 2016-06-09 | Paper |
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
Discrete Applied Mathematics | 2015-12-07 | Paper |
| scientific article; zbMATH DE number 6423755 (Why is no real title available?) | 2015-04-09 | Paper |
On \((k,\ell )\)-graph sandwich problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
| Cycle transversals in bounded degree graphs | 2014-03-25 | Paper |
| Clique cycle transversals in graphs with few \(P_{4}\)'s | 2014-02-14 | Paper |
Corrigendum to ``Cycle transversals in perfect graphs and cographs
Theoretical Computer Science | 2013-12-11 | Paper |
Cycle transversals in bounded degree graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Recognizing well covered graphs of families with special \(P _{4}\)-components
Graphs and Combinatorics | 2013-06-26 | Paper |
The arboreal jump number of an order
Order | 2013-03-20 | Paper |
Cycle transversals in perfect graphs and cographs
Theoretical Computer Science | 2013-02-19 | Paper |
Odd Cycle Transversals and Independent Sets in Fullerene Graphs
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
Information Processing Letters | 2012-10-23 | Paper |
The chain graph sandwich problem
Annals of Operations Research | 2011-11-17 | Paper |
Partitioning chordal graphs into independent sets and cliques
TEMA - Tendências em Matemática Aplicada e Computacional | 2011-04-04 | Paper |
Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
Discrete Applied Mathematics | 2011-03-09 | Paper |
\(2K_{2}\) vertex-set partition into nonempty parts
Discrete Mathematics | 2010-04-27 | Paper |
The graph sandwich problem for \(P_4\)-sparse graphs
Discrete Mathematics | 2009-06-19 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
2K2 vertex-set partition into nonempty parts
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science | 2007-09-03 | Paper |
Characterizing –partitionable Cographs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Bull-Reducible Berge Graphs are Perfect
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
The P4-sparse Graph Sandwich Problem
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A representation for the modular-pairs of a P4-reducible graph by modular decomposition
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Extended skew partition problem
Discrete Mathematics | 2006-10-30 | Paper |
List matrix partitions of chordal graphs
Theoretical Computer Science | 2006-03-20 | Paper |
Packing \(r\)-cliques in weighted chordal graphs
Annals of Operations Research | 2006-03-07 | Paper |
| scientific article; zbMATH DE number 2230220 (Why is no real title available?) | 2005-11-18 | Paper |
FindingH-partitions efficiently
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
FindingH-partitions efficiently
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
The perfection and recognition of bull-reducible Berge graphs
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
The perfection and recognition of bull-reducible Berge graphs
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
The perfection and recognition of bull-reducible Berge graphs
RAIRO - Theoretical Informatics and Applications | 2005-06-07 | Paper |
Optimal grid representations
Networks | 2005-02-23 | Paper |
How is a chordal graph like a supersolvable binary matroid?
Discrete Mathematics | 2005-01-13 | Paper |
Stable skew partition problem
Discrete Applied Mathematics | 2004-11-23 | Paper |
Partitioning chordal graphs into independent sets and cliques
Discrete Applied Mathematics | 2004-08-06 | Paper |
Graph covers using \(t\)-colourable vertex sets.
Discrete Mathematics | 2004-03-14 | Paper |
List Partitions
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
The graph sandwich problem for 1-join composition is NP-complete
Discrete Applied Mathematics | 2002-08-29 | Paper |
| scientific article; zbMATH DE number 1512686 (Why is no real title available?) | 2002-05-14 | Paper |
| On generalized split graphs | 2001-10-24 | Paper |
| scientific article; zbMATH DE number 1472140 (Why is no real title available?) | 2001-01-14 | Paper |
| scientific article; zbMATH DE number 1545651 (Why is no real title available?) | 2000-12-19 | Paper |
| scientific article; zbMATH DE number 1161313 (Why is no real title available?) | 1998-10-05 | Paper |
Maximum vertex-weighted matching in strongly chordal graphs
Discrete Applied Mathematics | 1998-07-28 | Paper |
An algorithm for finding homogeneous pairs
Discrete Applied Mathematics | 1997-11-09 | Paper |
