| Publication | Date of Publication | Type |
|---|
| Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius | 2024-12-03 | Paper |
Finding \(k\)-community structures in special graph classes
Discrete Applied Mathematics | 2024-11-06 | Paper |
Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
Theoretical Computer Science | 2024-10-07 | Paper |
| Finding matching cuts in \(H\)-free graphs | 2024-09-11 | Paper |
| Locally checkable problems parameterized by clique-width | 2024-09-11 | Paper |
On blockers and transversals of maximum independent sets in co-comparability graphs
Discrete Applied Mathematics | 2024-08-09 | Paper |
| Maximizing Matching Cuts | 2023-12-20 | Paper |
| On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs | 2023-11-13 | Paper |
Finding matching cuts in \(H\)-free graphs
Algorithmica | 2023-10-06 | Paper |
scientific article; zbMATH DE number 7650254 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Matching Cuts in Graphs of High Girth and H-Free Graphs | 2022-12-23 | Paper |
| Graph colouring variations | 2022-12-21 | Paper |
Using edge contractions to reduce the semitotal domination number
Theoretical Computer Science | 2022-11-17 | Paper |
On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs
Theoretical Computer Science | 2022-10-21 | Paper |
| On some subclasses of split \(B_1\)-EPG graphs | 2022-10-13 | Paper |
scientific article; zbMATH DE number 7561685 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Finding $k$-community structures in special graph classes | 2022-06-29 | Paper |
On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs
(available as arXiv preprint) | 2022-04-14 | Paper |
| Locally checkable problems parameterized by clique-width | 2022-03-06 | Paper |
On some special classes of contact \(B_0\)-VPG graphs
Discrete Applied Mathematics | 2022-01-05 | Paper |
Reducing the domination number of \(( P_3 + k P_2 )\)-free graphs via one edge contraction
Discrete Applied Mathematics | 2021-10-21 | Paper |
Blocking total dominating sets via edge contractions
Theoretical Computer Science | 2021-06-23 | Paper |
Reducing the domination number of graphs via edge contractions and vertex deletions
Discrete Mathematics | 2021-01-21 | Paper |
CPG graphs: some structural and hardness results
Discrete Applied Mathematics | 2021-01-13 | Paper |
Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
Theoretical Computer Science | 2020-03-12 | Paper |
Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
Theoretical Computer Science | 2020-03-12 | Paper |
| On split \(B_1\)-EPG graphs | 2020-02-12 | Paper |
Maximum eccentric connectivity index for graphs with given diameter
Discrete Applied Mathematics | 2019-09-19 | Paper |
Detecting strong cliques
Discrete Mathematics | 2019-07-18 | Paper |
Blocking dominating sets for $H$-free graphs via edge contractions
(available as arXiv preprint) | 2019-06-28 | Paper |
Proper circular arc graphs as intersection graphs of paths on a grid
Discrete Applied Mathematics | 2019-05-23 | Paper |
Classifying \(k\)-edge colouring for \(H\)-free graphs
Information Processing Letters | 2019-04-26 | Paper |
Critical vertices and edges in \(H\)-free graphs
Discrete Applied Mathematics | 2019-03-11 | Paper |
Reducing the domination number of graphs via edge contractions
(available as arXiv preprint) | 2019-03-05 | Paper |
On contact graphs of paths on a grid
(available as arXiv preprint) | 2019-02-15 | Paper |
| On contact graphs of paths on a grid | 2019-02-15 | Paper |
| On the Parameterized Complexity of $k$-Edge Colouring | 2019-01-07 | Paper |
Perfectness of clustered graphs
Discrete Optimization | 2018-10-18 | Paper |
Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
Theoretical Computer Science | 2018-09-27 | Paper |
| Characterising chordal contact \(B_0\)-VPG graphs | 2018-08-17 | Paper |
Upper domination: towards a dichotomy through boundary properties
Algorithmica | 2018-07-26 | Paper |
Dominating induced matchings in graphs containing no long claw
Journal of Graph Theory | 2018-07-13 | Paper |
Dominating induced matchings in graphs containing no long claw
Journal of Graph Theory | 2018-07-13 | Paper |
| Reducing the chromatic number by vertex or edge deletions | 2018-04-09 | Paper |
Graphs vertex-partitionable into strong cliques
Discrete Mathematics | 2018-04-05 | 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 |
Finding a perfect phylogeny from mixed tumor samples
Lecture Notes in Computer Science | 2017-07-25 | Paper |
Blocking independent sets for \(H\)-free graphs via edge contractions and vertex deletions
Lecture Notes in Computer Science | 2017-05-19 | Paper |
A note on \(r\)-equitable \(k\)-colorings of trees
Yugoslav Journal of Operations Research | 2017-04-11 | Paper |
On star and biclique edge-colorings
International Transactions in Operational Research | 2017-03-16 | Paper |
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
Lecture Notes in Computer Science | 2016-11-30 | 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 |
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 |
A boundary property for upper domination
Lecture Notes in Computer Science | 2016-09-29 | Paper |
On some applications of the selective graph coloring problem
European Journal of Operational Research | 2016-07-06 | Paper |
Optimal edge-coloring with edge rate constraints
Networks | 2016-06-10 | Paper |
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
Discrete Applied Mathematics | 2016-06-01 | Paper |
On the minimum and maximum selective graph coloring problems in some graph classes
Discrete Applied Mathematics | 2016-04-07 | Paper |
Contraction Blockers for Graphs with Forbidden Induced Paths
Lecture Notes in Computer Science | 2015-09-21 | Paper |
A dichotomy for upper domination in monogenic classes
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
On the maximum independent set problem in subclasses of subcubic graphs
Journal of Discrete Algorithms | 2015-03-24 | Paper |
Blockers for the stability number and the chromatic number
Graphs and Combinatorics | 2015-01-20 | Paper |
Coloring graphs characterized by a forbidden subgraph
Discrete Applied Mathematics | 2014-11-28 | Paper |
Characterizations of cographs as intersection graphs of paths on a grid
Discrete Applied Mathematics | 2014-09-12 | Paper |
Packing and covering with linear programming: a survey
European Journal of Operational Research | 2014-07-27 | Paper |
On the complexity of the selective graph coloring problem in some special classes of graphs
Theoretical Computer Science | 2014-06-06 | Paper |
| Split-critical and uniquely split-colorable graphs | 2014-02-03 | Paper |
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Possible winners in approval voting
Algorithmic Decision Theory | 2013-12-17 | Paper |
Solution methods for a scheduling problem with incompatibility and precedence constraints
Algorithmic Operations Research | 2013-12-11 | Paper |
| Minimum \(d\)-transversals of maximum-weight stable sets in trees | 2013-11-01 | Paper |
Some properties of edge intersection graphs of single bend paths on a grid
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs
Graphs and Combinatorics | 2013-06-26 | Paper |
\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
Journal of Discrete Algorithms | 2013-06-24 | Paper |
The firefighter problem with more than one firefighter on trees
Discrete Applied Mathematics | 2013-04-25 | Paper |
Selective graph coloring in some special classes of graphs
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Coloring graphs characterized by a forbidden subgraph
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
A note on chromatic properties of threshold graphs
Discrete Mathematics | 2012-05-30 | Paper |
Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs
Discrete Applied Mathematics | 2012-04-30 | Paper |
Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures
Discrete Applied Mathematics | 2012-04-30 | Paper |
Colouring vertices of triangle-free graphs without forests
Discrete Mathematics | 2012-03-16 | Paper |
| scientific article; zbMATH DE number 6000604 (Why is no real title available?) | 2012-01-26 | Paper |
A 2-approximation for the maximum satisfying bisection problem
European Journal of Operational Research | 2011-04-29 | Paper |
Colouring vertices of triangle-free graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
On the use of graphs in discrete tomography
Annals of Operations Research | 2010-05-10 | Paper |
Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
Discrete Mathematics | 2009-12-15 | Paper |
Blockers and transversals
Discrete Mathematics | 2009-12-10 | Paper |
Mixed graph edge coloring
Discrete Mathematics | 2009-12-09 | Paper |
Graph coloring with cardinality constraints on the neighborhoods
Discrete Optimization | 2009-11-23 | Paper |
Degree-constrained edge partitioning in graphs arising from discrete tomography
Journal of Graph Algorithms and Applications | 2009-05-19 | Paper |
On the use of graphs in discrete tomography
4OR | 2008-09-04 | Paper |
Addendum to ``Bicolored matchings in some classes of graphs
Graphs and Combinatorics | 2008-08-20 | Paper |
On a graph coloring problem arising from discrete tomography
Networks | 2008-07-29 | Paper |
On two coloring problems in mixed graphs
European Journal of Combinatorics | 2008-04-22 | Paper |
Bicolored matchings in some classes of graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Bicolored matchings in some classes of graphs
Graphs and Combinatorics | 2007-04-26 | Paper |
Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
(available as arXiv preprint) | N/A | Paper |
