| Publication | Date of Publication | Type |
|---|
| On the oriented coloring of the disjoint union of graphs | 2024-04-14 | Paper |
| On the conformability of regular line graphs | 2024-01-22 | Paper |
| Optimizing concurrency under Scheduling by Edge Reversal | 2023-12-11 | Paper |
| Results about the total chromatic number and the conformability of some families of circulant graphs | 2023-09-14 | Paper |
| On the probe problem for \((r,\ell )\)-well-coveredness | 2023-03-30 | 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 probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity | 2022-09-16 | 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/Q4558957 | 2018-11-30 | Paper |
| On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph | 2018-09-27 | Paper |
| On complexities of minus domination | 2018-05-24 | Paper |
| Maximum cuts in edge-colored graphs | 2018-04-09 | Paper |
| On the forbidden induced subgraph probe and sandwich problems | 2017-12-20 | Paper |
| The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy | 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 |
| The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of then-Cube | 2016-10-13 | Paper |
| A note on the middle levels problem | 2016-06-22 | Paper |
| The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy | 2016-01-05 | Paper |
| Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs | 2015-12-07 | Paper |
| The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles | 2015-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982361 | 2015-04-09 | Paper |
| Forbidden subgraphs and the König-Egerváry property | 2014-04-10 | Paper |
| On (k,ℓ)-Graph Sandwich Problems | 2014-04-03 | Paper |
| The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs | 2014-04-03 | Paper |
| On defensive alliances and strong global offensive alliances | 2014-02-07 | Paper |
| Split clique graph complexity | 2014-01-16 | Paper |
| On Complexities of Minus Domination | 2013-12-10 | Paper |
| The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube | 2013-12-06 | Paper |
| Hamiltonian Cycles in Kneser Graphs for | 2013-07-23 | Paper |
| Forbidden subgraphs and the Kőnig property | 2013-07-23 | Paper |
| Odd Cycle Transversals and Independent Sets in Fullerene Graphs | 2013-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2918468 | 2012-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2918477 | 2012-10-06 | Paper |
| Split Clique Graph Complexity | 2011-12-16 | Paper |
| A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation | 2011-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3011750 | 2011-06-29 | Paper |
| Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions | 2011-06-17 | Paper |
| On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs | 2010-08-13 | Paper |
| \(2K_{2}\) vertex-set partition into nonempty parts | 2010-04-27 | Paper |
| Hamiltonian paths in odd graphs | 2010-01-12 | Paper |
| The complexity of clique graph recognition | 2009-05-28 | Paper |
| An improved upper bound on the crossing number of the hypercube | 2009-02-20 | Paper |
| Partition into cliques for cubic graphs: Planar case, complexity and approximation | 2008-09-29 | Paper |
| Clique Graph Recognition Is NP-Complete | 2008-09-04 | Paper |
| 2K2 vertex-set partition into nonempty parts | 2008-06-05 | Paper |
| On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs | 2008-06-05 | Paper |
| On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs | 2007-09-03 | Paper |
| 2K2-Partition Problem | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5492568 | 2006-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708492 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461522 | 2005-07-26 | Paper |
| On decision and optimization (\(k\),\(l\))-graph sandwich problems | 2004-11-23 | Paper |
| On the complexity of the approximation of nonplanarity parameters for cubic graphs | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414488 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2777504 | 2002-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741456 | 2001-10-24 | Paper |
| SPLITTING NUMBER is NP-complete | 2001-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232795 | 1999-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252393 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839003 | 1999-03-08 | Paper |
