| Publication | Date of Publication | Type |
|---|
Partition of graphs with maximum degree ratio
Annals of Operations Research | 2025-08-09 | Paper |
The complexity of the perfect matching-cut problem
Journal of Graph Theory | 2025-01-20 | Paper |
| The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs | 2023-05-23 | Paper |
| On the complexity of Dominating Set for graphs with fixed diameter | 2023-04-19 | Paper |
New sufficient conditions on the degree sequences of uniform hypergraphs
Theoretical Computer Science | 2021-05-10 | Paper |
| The complexity of the Perfect Matching-Cut problem | 2020-11-06 | Paper |
On the vertices belonging to all, some, none minimum dominating set
Discrete Applied Mathematics | 2020-11-02 | Paper |
Complexity and algorithms for constant diameter augmentation problems
(available as arXiv preprint) | 2020-10-01 | Paper |
| Partition of graphs with maximum degree ratio | 2020-07-24 | Paper |
Minimal graphs for 2-factor extension
Discrete Applied Mathematics | 2020-06-05 | Paper |
| On Minimum Dominating Sets in cubic and (claw,H)-free graphs | 2020-02-27 | Paper |
| The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs | 2020-01-21 | Paper |
| Minimal graphs for hamiltonian extension | 2019-12-10 | Paper |
On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
Discrete Geometry for Computer Imagery | 2019-10-16 | Paper |
| On graceful difference labelings of disjoint unions of circuits | 2019-08-29 | Paper |
Critical vertices and edges in \(H\)-free graphs
Discrete Applied Mathematics | 2019-03-11 | Paper |
Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
Theoretical Computer Science | 2018-09-27 | Paper |
| Reducing the chromatic number by vertex or edge deletions | 2018-04-09 | Paper |
Minimal graphs for matching extensions
Discrete Applied Mathematics | 2017-12-20 | Paper |
| Adaptive Network Flow with $k$-Arc Destruction | 2017-11-02 | Paper |
Blocking independent sets for \(H\)-free graphs via edge contractions and vertex deletions
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Contraction Blockers for Graphs with Forbidden Induced Paths
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Blockers for the stability number and the chromatic number
Graphs and Combinatorics | 2015-01-20 | Paper |
| Minimum \(d\)-transversals of maximum-weight stable sets in trees | 2013-11-01 | Paper |
| Characterization of the degree sequences of (quasi) regular uniform hypergraphs | 2013-09-30 | Paper |
\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
Journal of Discrete Algorithms | 2013-06-24 | Paper |
On the degree sequences of uniform hypergraphs
Discrete Geometry for Computer Imagery | 2013-05-31 | Paper |
How to decompose a binary matrix into three \(hv\)-convex polyominoes
Discrete Geometry for Computer Imagery | 2013-05-31 | Paper |
Minimum decomposition into convex binary matrices
Discrete Applied Mathematics | 2012-05-30 | Paper |
On the NP-completeness of the perfect matching free subgraph problem
Theoretical Computer Science | 2012-05-14 | Paper |
Minimum \(d\)-blockers and \(d\)-transversals in graphs
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
| scientific article; zbMATH DE number 6000604 (Why is no real title available?) | 2012-01-26 | Paper |
| scientific article; zbMATH DE number 5823930 (Why is no real title available?) | 2010-12-08 | Paper |
A note on a conjecture on maximum matching in almost regular graphs
Discrete Mathematics | 2010-11-19 | Paper |
Complexity results for the horizontal bar packing problem
Information Processing Letters | 2010-06-09 | Paper |
On the use of graphs in discrete tomography
Annals of Operations Research | 2010-05-10 | Paper |
Finding induced trees
Discrete Applied Mathematics | 2010-04-28 | Paper |
The four-in-a-tree problem in triangle-free graphs
Graphs and Combinatorics | 2010-01-18 | 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 |
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 |
Locally bounded<i>k</i>-colorings of trees
RAIRO - Operations Research | 2009-04-23 | Paper |
Locally bounded<i>k</i>-colorings of trees
RAIRO - Operations Research | 2009-04-23 | Paper |
Reconstruction of binary matrices under fixed size neighborhood constraints
Theoretical Computer Science | 2008-11-12 | 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 |
Approximating hv-Convex Binary Matrices and Images from Discrete Projections
Discrete Geometry for Computer Imagery | 2008-04-24 | Paper |
Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem
Discrete Geometry for Computer Imagery | 2008-04-24 | Paper |
| Reconstruction of binary matrices under adjacency constraints | 2008-01-04 | Paper |
Reconstruction of binary matrices under adjacency constraints
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Bicolored matchings in some classes of graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Reconstructing a binary matrix under timetabling constraints
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Bicolored matchings in some classes of graphs
Graphs and Combinatorics | 2007-04-26 | Paper |
An acyclic days-off scheduling problem
4OR | 2007-01-24 | Paper |
The shortest multipaths problem in a capacitated dense channel
European Journal of Operational Research | 2007-01-16 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Using graphs for some discrete tomography problems
Discrete Applied Mathematics | 2006-01-10 | Paper |
Reconstruction of convex polyominoes from orthogonal projections of their contours
Theoretical Computer Science | 2006-01-10 | Paper |
A solvable case of image reconstruction in discrete tomography
Discrete Applied Mathematics | 2005-08-05 | Paper |
Reconstruction of domino tiling from its two orthogonal projections
Theoretical Computer Science | 2001-08-20 | Paper |
Worst-case analysis of fast heuristics for packing squares into a square
Theoretical Computer Science | 1997-09-10 | Paper |
New complexity results on scheduling with small communication delays
Discrete Applied Mathematics | 1996-04-16 | Paper |
Complexity of the hamiltonian cycle in regular graph problem
Theoretical Computer Science | 1995-03-20 | Paper |
