| Publication | Date of Publication | Type |
|---|
| On the oriented coloring of the disjoint union of graphs | 2024-04-14 | Paper |
| Partitions and well-coveredness: the graph sandwich problem | 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 oriented coloring of the disjoint union of graphs | 2022-03-22 | Paper |
| Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs | 2020-05-29 | Paper |
| Maximum cuts in edge-colored graphs | 2020-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5377222 | 2019-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4558957 | 2018-11-30 | Paper |
| On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph | 2018-09-27 | Paper |
| Maximum cuts in edge-colored graphs | 2018-04-09 | Paper |
| On the forbidden induced subgraph probe and sandwich problems | 2017-12-20 | Paper |
| Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} | 2017-10-12 | Paper |
| On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs | 2017-02-01 | Paper |
| On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs | 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 |
| Complexity of graph partition problems | 2016-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816076 | 2016-07-01 | Paper |
| The homogeneous set sandwich problem | 2016-06-09 | Paper |
| Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs | 2015-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982361 | 2015-04-09 | Paper |
| On (k,ℓ)-Graph Sandwich Problems | 2014-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403054 | 2014-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747404 | 2014-02-14 | Paper |
| Corrigendum to ``Cycle transversals in perfect graphs and cographs | 2013-12-11 | Paper |
| Cycle transversals in bounded degree graphs | 2013-07-19 | Paper |
| Recognizing well covered graphs of families with special \(P _{4}\)-components | 2013-06-26 | Paper |
| The arboreal jump number of an order | 2013-03-20 | Paper |
| Cycle transversals in perfect graphs and cographs | 2013-02-19 | Paper |
| Odd Cycle Transversals and Independent Sets in Fullerene Graphs | 2013-01-04 | Paper |
| Partitioning extended \(P_4\)-laden graphs into cliques and stable sets | 2012-10-23 | Paper |
| The chain graph sandwich problem | 2011-11-17 | Paper |
| Particionamento de Grafos Cordais em Conjuntos Independentes e Cliques | 2011-04-04 | Paper |
| Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques | 2011-03-09 | Paper |
| \(2K_{2}\) vertex-set partition into nonempty parts | 2010-04-27 | Paper |
| The graph sandwich problem for \(P_4\)-sparse graphs | 2009-06-19 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| 2K2 vertex-set partition into nonempty parts | 2008-06-05 | Paper |
| On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs | 2007-09-03 | Paper |
| Bull-Reducible Berge Graphs are Perfect | 2007-05-29 | Paper |
| The P4-sparse Graph Sandwich Problem | 2007-05-29 | Paper |
| A representation for the modular-pairs of a P4-reducible graph by modular decomposition | 2007-05-29 | Paper |
| Characterizing –partitionable Cographs | 2007-05-29 | Paper |
| Extended skew partition problem | 2006-10-30 | Paper |
| List matrix partitions of chordal graphs | 2006-03-20 | Paper |
| Packing \(r\)-cliques in weighted chordal graphs | 2006-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708507 | 2005-11-18 | Paper |
| FindingH-partitions efficiently | 2005-06-07 | Paper |
| The perfection and recognition of bull-reducible Berge graphs | 2005-06-07 | Paper |
| Optimal grid representations | 2005-02-23 | Paper |
| How is a chordal graph like a supersolvable binary matroid? | 2005-01-13 | Paper |
| Stable skew partition problem | 2004-11-23 | Paper |
| Partitioning chordal graphs into independent sets and cliques | 2004-08-06 | Paper |
| Graph covers using \(t\)-colourable vertex sets. | 2004-03-14 | Paper |
| List Partitions | 2004-01-08 | Paper |
| The graph sandwich problem for 1-join composition is NP-complete | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508373 | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741477 | 2001-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489192 | 2001-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4521527 | 2000-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393307 | 1998-10-05 | Paper |
| Maximum vertex-weighted matching in strongly chordal graphs | 1998-07-28 | Paper |
| An algorithm for finding homogeneous pairs | 1997-11-09 | Paper |
