| Publication | Date of Publication | Type |
|---|
On the absolute and relative oriented clique problems' time complexity
Procedia Computer Science | 2025-12-11 | Paper |
On feedback vertex set in reducible flow hypergraphs
Procedia Computer Science | 2025-12-02 | Paper |
A polynomial-time algorithm for conformable coloring on regular bipartite and subcubic graphs
Discrete Optimization | 2025-07-08 | Paper |
The time complexity of oriented chromatic number for acyclic oriented connected subcubic subgraphs of grids
Discrete Applied Mathematics | 2025-04-17 | Paper |
On the absolute and relative oriented clique problems' time complexity
Discrete Applied Mathematics | 2025-04-17 | Paper |
Canonical cuts of path powers
Contributions to Discrete Mathematics | 2024-11-20 | Paper |
On the minimum neighborhood of independent sets in the \(n\)-cube
Matemática Contemporânea | 2024-04-22 | 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 |
On the conformability of regular line graphs
RAIRO - Operations Research | 2024-01-22 | Paper |
Optimizing concurrency under Scheduling by Edge Reversal
Networks | 2023-12-11 | Paper |
Results about the total chromatic number and the conformability of some families of circulant graphs
Discrete Applied Mathematics | 2023-09-14 | Paper |
| On the probe problem for (r, )-well-coveredness | 2023-03-30 | 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 probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
Theoretical Computer Science | 2022-09-16 | 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 |
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 |
On complexities of minus domination
Discrete Optimization | 2018-05-24 | 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 |
The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy
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,)-graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the (parameterized) complexity of recognizing well-covered (r,)-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 |
The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
Journal of Graph Theory | 2016-10-13 | Paper |
A note on the middle levels problem
Discrete Applied Mathematics | 2016-06-22 | Paper |
The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy
Information Processing Letters | 2016-01-05 | Paper |
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
Discrete Applied Mathematics | 2015-12-07 | Paper |
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
Theoretical Computer Science | 2015-09-25 | Paper |
| scientific article; zbMATH DE number 6423755 (Why is no real title available?) | 2015-04-09 | Paper |
Forbidden subgraphs and the König-Egerváry property
Discrete Applied Mathematics | 2014-04-10 | Paper |
The edge-recoloring cost of paths and cycles in edge-colored graphs and digraphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
On \((k,\ell )\)-graph sandwich problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
On defensive alliances and strong global offensive alliances
Discrete Applied Mathematics | 2014-02-07 | Paper |
Split clique graph complexity
Theoretical Computer Science | 2014-01-16 | Paper |
On complexities of minus domination
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Hamiltonian cycles in Kneser graphs for \(n=2k+2\)
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Forbidden subgraphs and the Kőnig property
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Odd Cycle Transversals and Independent Sets in Fullerene Graphs
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
On split clique graphs
Matemática Contemporânea | 2012-10-06 | Paper |
LAWCliques'2010 problem session
Matemática Contemporânea | 2012-10-06 | Paper |
Split clique graph complexity
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
RAIRO - Theoretical Informatics and Applications | 2011-10-28 | Paper |
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
RAIRO - Theoretical Informatics and Applications | 2011-10-28 | Paper |
| Skewness, splitting number and vertex deletion of some toroidal meshes | 2011-06-29 | Paper |
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Discrete Applied Mathematics | 2010-08-13 | Paper |
\(2K_{2}\) vertex-set partition into nonempty parts
Discrete Mathematics | 2010-04-27 | Paper |
Hamiltonian paths in odd graphs
Applicable Analysis and Discrete Mathematics | 2010-01-12 | Paper |
The complexity of clique graph recognition
Theoretical Computer Science | 2009-05-28 | Paper |
An improved upper bound on the crossing number of the hypercube
Journal of Graph Theory | 2009-02-20 | Paper |
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Discrete Applied Mathematics | 2008-09-29 | Paper |
Clique Graph Recognition Is NP-Complete
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | 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 |
2K2-Partition Problem
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| The non planar vertex deletion of \(C_n\times C_m\). | 2006-10-16 | Paper |
| scientific article; zbMATH DE number 2230206 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2188420 (Why is no real title available?) | 2005-07-26 | Paper |
On decision and optimization (\(k\),\(l\))-graph sandwich problems
Discrete Applied Mathematics | 2004-11-23 | Paper |
On the complexity of the approximation of nonplanarity parameters for cubic graphs
Discrete Applied Mathematics | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1953085 (Why is no real title available?) | 2003-07-25 | Paper |
On Eggleton and Guy's conjectured upper bound for the crossing number of the \(n\)-cube
Mathematica Slovaca | 2002-03-07 | Paper |
| On the complexity of the approximation of nonplanarity parameters for cubic graphs | 2001-10-24 | Paper |
SPLITTING NUMBER is NP-complete
Discrete Applied Mathematics | 2001-10-07 | Paper |
| scientific article; zbMATH DE number 1262805 (Why is no real title available?) | 1999-08-23 | Paper |
| scientific article; zbMATH DE number 1305502 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1189238 (Why is no real title available?) | 1999-03-08 | Paper |
