| Publication | Date of Publication | Type |
|---|
| Thinness and its variations on some graph families and coloring graphs of bounded thinness | 2024-06-05 | Paper |
| On PVPG graphs: a subclass of vertex intersection graphs of paths on a grid | 2024-05-06 | Paper |
| Solving problems on generalized convex graphs via mim-width | 2024-01-04 | Paper |
| Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs | 2023-12-11 | Paper |
| Linear‐time algorithms for eliminating claws in graphs | 2023-11-29 | Paper |
| Minimum weighted clique cover on claw‐free perfect graphs | 2023-09-29 | Paper |
| On the thinness of trees | 2023-08-03 | Paper |
| Forbidden induced subgraph characterization of circle graphs within split graphs | 2022-11-02 | Paper |
| Precedence thinness in graphs | 2022-11-02 | Paper |
| A new approach on locally checkable problems | 2022-04-20 | Paper |
| Solving problems on generalized convex graphs via mim-width | 2022-03-25 | Paper |
| Thinness of product graphs | 2022-03-24 | Paper |
| On some special classes of contact \(B_0\)-VPG graphs | 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 | 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 | 2020-06-29 | Paper |
| On some graph classes related to perfect graphs: a survey | 2020-05-29 | Paper |
| A note on homomorphisms of Kneser hypergraphs | 2020-01-15 | Paper |
| On the thinness and proper thinness of a graph | 2019-05-17 | Paper |
| Perfectness of clustered graphs | 2018-10-18 | Paper |
| Three-coloring and list three-coloring of graphs without induced paths on seven vertices | 2018-09-24 | Paper |
| Characterising chordal contact \(B_0\)-VPG graphs | 2018-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4568175 | 2018-06-15 | Paper |
| \(k\)-tuple colorings of the Cartesian product of graphs | 2018-05-24 | Paper |
| On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid | 2017-12-20 | Paper |
| An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools | 2017-12-15 | Paper |
| Domination parameters with number 2: interrelations and algorithmic consequences | 2017-12-06 | Paper |
| Vertex intersection graphs of paths on a grid: characterization within block graphs | 2017-10-11 | Paper |
| Clique coloring \(B_1\)-EPG graphs | 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 | 2016-10-17 | Paper |
| Graph classes with and without powers of bounded clique-width | 2015-12-10 | Paper |
| \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs | 2015-10-19 | Paper |
| \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs | 2015-10-16 | Paper |
| Complexity of the cluster deletion problem on subclasses of chordal graphs | 2015-09-16 | Paper |
| Clique-perfectness of complements of line graphs | 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 | 2015-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5249236 | 2015-04-30 | Paper |
| Clique-perfectness and balancedness of some graph classes | 2014-11-28 | Paper |
| On the minimum sum coloring of \(P_4\)-sparse graphs | 2014-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5167720 | 2014-07-01 | Paper |
| Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game | 2014-06-20 | Paper |
| Characterization of classical graph classes by weighted clique graphs | 2014-05-05 | Paper |
| On minimal forbidden subgraph characterizations of balanced graphs | 2014-04-22 | Paper |
| A note on the Cornaz-Jost transformation to solve the graph coloring problem | 2014-04-11 | Paper |
| Forbidden subgraphs and the König-Egerváry property | 2014-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747396 | 2014-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861542 | 2013-11-08 | Paper |
| Clique-perfectness of complements of line graphs | 2013-07-23 | Paper |
| Minimum Sum Coloring of P4-sparse graphs | 2013-07-19 | Paper |
| On minimal forbidden subgraph characterizations of balanced graphs | 2013-07-19 | Paper |
| A polyhedral study of the maximum edge subgraph problem | 2013-07-19 | Paper |
| On coloring problems with local constraints | 2013-07-19 | Paper |
| Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property | 2013-03-19 | Paper |
| A polyhedral study of the maximum edge subgraph problem | 2012-11-22 | Paper |
| Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs | 2012-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2918637 | 2012-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2918469 | 2012-10-06 | Paper |
| On coloring problems with local constraints | 2012-06-18 | Paper |
| Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem | 2012-01-09 | Paper |
| Partial characterizations of circle graphs | 2011-10-27 | Paper |
| On theL(2, 1)-labelling of block graphs | 2011-04-06 | Paper |
| Minimum sum set coloring of trees and line graphs of trees | 2011-03-10 | Paper |
| On the \(b\)-coloring of \(P_{4}\)-tidy graphs | 2011-01-14 | Paper |
| Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs | 2010-04-28 | Paper |
| Partial characterizations of circular-arc graphs | 2009-12-18 | Paper |
| On the b-coloring of cographs and \(P_{4}\)-sparse graphs | 2009-12-09 | Paper |
| Exploring the complexity boundary between coloring and list-coloring | 2009-09-03 | Paper |
| Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs | 2009-06-19 | Paper |
| Partial characterizations of coordinated graphs: Line graphs and complements of forests | 2009-04-27 | Paper |
| Partial Characterizations of Circular-Arc Graphs | 2008-06-05 | Paper |
| Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs | 2008-06-05 | Paper |
| Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs | 2008-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3595114 | 2007-08-10 | Paper |
| Characterization and recognition of Helly circular-arc clique-perfect graphs | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439668 | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439672 | 2007-05-29 | Paper |
| Exploring the complexity boundary between coloring and list-coloring | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3428669 | 2007-03-29 | Paper |
| NP-completeness results for edge modification problems | 2006-08-17 | Paper |
| Self-clique Helly circular-arc graphs | 2006-05-16 | Paper |
| On balanced graphs | 2006-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708487 | 2005-11-18 | Paper |
| Thinness and its variations on some graph families and coloring graphs of bounded thinness | N/A | Paper |
