| Publication | Date of Publication | Type |
|---|
Thinness and its variations on some graph families and coloring graphs of bounded thinness
RAIRO. Operations Research | 2024-06-05 | Paper |
On PVPG graphs: a subclass of vertex intersection graphs of paths on a grid
Matemática Contemporânea | 2024-05-06 | Paper |
Solving problems on generalized convex graphs via mim-width
Journal of Computer and System Sciences | 2024-01-04 | Paper |
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
Discrete Applied Mathematics | 2023-12-11 | Paper |
Linear‐time algorithms for eliminating claws in graphs
International Transactions in Operational Research | 2023-11-29 | Paper |
Minimum weighted clique cover on claw‐free perfect graphs
Journal of Graph Theory | 2023-09-29 | Paper |
On the thinness of trees
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Forbidden induced subgraph characterization of circle graphs within split graphs
Discrete Applied Mathematics | 2022-11-02 | Paper |
Precedence thinness in graphs
Discrete Applied Mathematics | 2022-11-02 | Paper |
A new approach on locally checkable problems
Discrete Applied Mathematics | 2022-04-20 | Paper |
Solving problems on generalized convex graphs via mim-width
| 2022-03-25 | Paper |
Thinness of product graphs
Discrete Applied Mathematics | 2022-03-24 | Paper |
On some special classes of contact \(B_0\)-VPG graphs
Discrete Applied Mathematics | 2022-01-05 | Paper |
Linear-time algorithms for eliminating claws in graphs
| 2021-04-21 | Paper |
Better 3-coloring algorithms: excluding a triangle and a seven vertex path
Theoretical Computer Science | 2020-12-16 | Paper |
Fractional hypergraph isomorphism and fractional invariants
| 2020-08-19 | Paper |
Thinness of product graphs
| 2020-06-30 | Paper |
Precedence thinness in graphs
| 2020-06-30 | Paper |
Characterising circular-arc contact \(B_0\)-VPG graphs
Discrete Applied Mathematics | 2020-06-29 | Paper |
On some graph classes related to perfect graphs: a survey
Discrete Applied Mathematics | 2020-05-29 | Paper |
A note on homomorphisms of Kneser hypergraphs
Applied Mathematics and Computation | 2020-01-15 | Paper |
On the thinness and proper thinness of a graph
Discrete Applied Mathematics | 2019-05-17 | Paper |
Perfectness of clustered graphs
Discrete Optimization | 2018-10-18 | Paper |
Three-coloring and list three-coloring of graphs without induced paths on seven vertices
Combinatorica | 2018-09-24 | Paper |
Characterising chordal contact \(B_0\)-VPG graphs
| 2018-08-17 | Paper |
On the \((k,i)\)-coloring of cacti and complete graphs.
| 2018-06-15 | Paper |
\(k\)-tuple colorings of the Cartesian product of graphs
Discrete Applied Mathematics | 2018-05-24 | Paper |
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Discrete Applied Mathematics | 2017-12-20 | Paper |
An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
Annals of Operations Research | 2017-12-15 | Paper |
Domination parameters with number 2: interrelations and algorithmic consequences
Discrete Applied Mathematics | 2017-12-06 | Paper |
Vertex intersection graphs of paths on a grid: characterization within block graphs
Graphs and Combinatorics | 2017-10-11 | Paper |
Clique coloring \(B_1\)-EPG graphs
Discrete Mathematics | 2017-02-27 | Paper |
\(k\)-tuple chromatic number of the Cartesian product of graphs
| 2016-10-17 | Paper |
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Electronic Notes in Discrete Mathematics | 2016-10-17 | Paper |
Graph classes with and without powers of bounded clique-width
Discrete Applied Mathematics | 2015-12-10 | Paper |
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
Algorithmica | 2015-10-19 | Paper |
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Complexity of the cluster deletion problem on subclasses of chordal graphs
Theoretical Computer Science | 2015-09-16 | Paper |
Clique-perfectness of complements of line graphs
Discrete Applied Mathematics | 2015-05-22 | Paper |
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs
Information Processing Letters | 2015-05-21 | Paper |
scientific article; zbMATH DE number 6432456 (Why is no real title available?)
| 2015-04-30 | Paper |
Clique-perfectness and balancedness of some graph classes
International Journal of Computer Mathematics | 2014-11-28 | Paper |
On the minimum sum coloring of \(P_4\)-sparse graphs
Graphs and Combinatorics | 2014-09-19 | Paper |
Balancedness of subclasses of circular-arc graphs
| 2014-07-01 | Paper |
Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game
International Transactions in Operational Research | 2014-06-20 | Paper |
Characterization of classical graph classes by weighted clique graphs
Discrete Applied Mathematics | 2014-05-05 | Paper |
On minimal forbidden subgraph characterizations of balanced graphs
Discrete Applied Mathematics | 2014-04-22 | Paper |
A note on the Cornaz-Jost transformation to solve the graph coloring problem
Information Processing Letters | 2014-04-11 | Paper |
Forbidden subgraphs and the König-Egerváry property
Discrete Applied Mathematics | 2014-04-10 | Paper |
Probe interval graphs and probe unit interval graphs on superclasses of cographs
| 2014-02-14 | Paper |
Balancedness of some subclasses of circular-arc graphs
| 2013-11-08 | Paper |
Clique-perfectness of complements of line graphs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A polyhedral study of the maximum edge subgraph problem
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Minimum sum coloring of \(P_{4}\)-sparse graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
On coloring problems with local constraints
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
On minimal forbidden subgraph characterizations of balanced graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
A polyhedral study of the maximum edge subgraph problem
Discrete Applied Mathematics | 2012-11-22 | Paper |
Minimum weighted clique cover on strip-composed perfect graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Between coloring and list-coloring: \(\mu \)-coloring.
Ars Combinatoria | 2012-10-08 | Paper |
On weighted clique graphs
Matemática Contemporânea | 2012-10-06 | Paper |
On coloring problems with local constraints
Discrete Mathematics | 2012-06-18 | Paper |
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Theoretical Computer Science | 2012-01-09 | Paper |
Partial characterizations of circle graphs
Discrete Applied Mathematics | 2011-10-27 | Paper |
On the \(L(2, 1)\)-labelling of block graphs
International Journal of Computer Mathematics | 2011-04-06 | Paper |
Minimum sum set coloring of trees and line graphs of trees
Discrete Applied Mathematics | 2011-03-10 | Paper |
On the \(b\)-coloring of \(P_{4}\)-tidy graphs
Discrete Applied Mathematics | 2011-01-14 | Paper |
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
Partial characterizations of circular-arc graphs
Journal of Graph Theory | 2009-12-18 | Paper |
On the b-coloring of cographs and \(P_{4}\)-sparse graphs
Graphs and Combinatorics | 2009-12-09 | Paper |
Exploring the complexity boundary between coloring and list-coloring
Annals of Operations Research | 2009-09-03 | Paper |
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
Discrete Mathematics | 2009-06-19 | Paper |
Partial characterizations of coordinated graphs: Line graphs and complements of forests
Mathematical Methods of Operations Research | 2009-04-27 | Paper |
Partial Characterizations of Circular-Arc Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
Discrete Applied Mathematics | 2008-04-16 | Paper |
Coordinated graphs and clique graphs of clique-Helly perfect graphs
| 2007-08-10 | Paper |
Characterization and recognition of Helly circular-arc clique-perfect graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
scientific article; zbMATH DE number 5158490 (Why is no real title available?)
| 2007-05-29 | Paper |
Exploring the complexity boundary between coloring and list-coloring
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
scientific article; zbMATH DE number 5158493 (Why is no real title available?)
| 2007-05-29 | Paper |
On clique-perfect and K-perfect graphs
| 2007-03-29 | Paper |
NP-completeness results for edge modification problems
Discrete Applied Mathematics | 2006-08-17 | Paper |
Self-clique Helly circular-arc graphs
Discrete Mathematics | 2006-05-16 | Paper |
On balanced graphs
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
scientific article; zbMATH DE number 2230201 (Why is no real title available?)
| 2005-11-18 | Paper |
Thinness and its variations on some graph families and coloring graphs of bounded thinness
| N/A | Paper |
