| Publication | Date of Publication | Type |
|---|
| Exact and parameterized algorithms for the independent cutset problem | 2024-12-27 | Paper |
| Taming graphs with no large creatures and skinny ladders | 2024-12-18 | Paper |
| Canonical cuts of path powers | 2024-11-20 | Paper |
| Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets | 2024-09-16 | Paper |
| Twin-treewidth: a single-exponential logic-based approach | 2024-09-16 | Paper |
| On conflict-free cuts: algorithms and complexity | 2024-09-11 | Paper |
| Reducing the vertex cover number via edge contractions | 2024-08-06 | Paper |
| Decoding tree decompositions from permutations | 2024-05-31 | Paper |
| Induced tree covering and the generalized Yutsis property | 2024-05-31 | Paper |
| Simple and tight complexity lower bounds for solving Rabin games | 2024-05-29 | Paper |
| Conditional lower bounds for sparse parameterized 2-CSP: a streamlined proof | 2024-05-29 | Paper |
| A tight quasi-polynomial bound for \textsc{Global Label Min-Cut} | 2024-05-14 | Paper |
| Aspects of the complexity of \((\gamma,\mu)\)-coloring | 2024-04-25 | Paper |
| Generation of minimal obstructions of graphs-\((2,1)\) | 2024-04-22 | Paper |
| Connecting terminals using at most one router | 2024-04-22 | Paper |
| A general framework for path convexities | 2024-02-23 | Paper |
| Locality sensitive algotrithms for data mule routing problem | 2024-02-23 | Paper |
| Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) | 2024-02-23 | Paper |
| Linear‐time algorithms for eliminating claws in graphs | 2023-11-29 | Paper |
| On the Complexity of the Median and Closest Permutation Problems | 2023-11-28 | Paper |
| On the complexity of coloring ‐graphs | 2023-11-23 | Paper |
| On Conflict-Free Cuts: Algorithms and Complexity | 2023-11-02 | Paper |
| Recognizing well-dominated graphs is coNP-complete | 2023-10-12 | Paper |
| Connecting constructive notions of ordinals in homotopy type theory | 2023-08-08 | Paper |
| Partitioning \(P_4\)-tidy graphs into a stable set and a forest | 2023-08-02 | Paper |
| Exact and Parameterized Algorithms for the Independent Cutset Problem | 2023-07-05 | Paper |
| A Survey on the Complexity of Flood-Filling Games | 2023-06-30 | Paper |
| Reducing the vertex cover number via edge contractions | 2023-06-12 | Paper |
| On the computational difficulty of the terminal connection problem | 2023-05-25 | Paper |
| On conflict-free spanning tree: algorithms and complexity | 2023-05-08 | Paper |
| On the minimum cycle cover problem on graphs with bounded co-degeneracy | 2023-05-05 | Paper |
| Sparse vertex cutsets and the maximum degree | 2023-04-20 | Paper |
| On the probe problem for \((r,\ell )\)-well-coveredness | 2023-03-30 | Paper |
| Computing the largest bond of a graph | 2023-02-03 | Paper |
| Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. | 2023-02-03 | Paper |
| Partitions and well-coveredness: the graph sandwich problem | 2023-01-17 | Paper |
| Compositions, decompositions, and conformability for total coloring on power of cycle graphs | 2022-11-02 | Paper |
| Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques | 2022-10-13 | Paper |
| Perfect matching cuts partitioning a graph into complementary subgraphs | 2022-10-13 | Paper |
| On the computational complexity of the bipartizing matching problem | 2022-09-26 | Paper |
| On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity | 2022-09-16 | Paper |
| \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers | 2022-09-15 | Paper |
| Computing the best-case energy complexity of satisfying assignments in monotone circuits | 2022-09-14 | Paper |
| Perfect matching cuts partitioning a graph into complementary subgraphs | 2022-08-30 | Paper |
| A general framework for path convexities | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089236 | 2022-07-18 | Paper |
| Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case | 2022-07-01 | Paper |
| Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes | 2022-06-29 | Paper |
| Taming graphs with no large creatures and skinny ladders | 2022-05-02 | Paper |
| \(P_3\)-hull number of graphs with diameter two | 2022-04-27 | Paper |
| Even-power of cycles with many vertices are type 1 total colorable | 2022-04-27 | Paper |
| On the terminal connection problem | 2022-03-24 | Paper |
| Computing the zig-zag number of directed graphs | 2022-03-24 | Paper |
| Finding the maximum multi improvement on neighborhood exploration | 2022-01-21 | Paper |
| Partitioning a graph into complementary subgraphs | 2021-07-28 | Paper |
| Reducing graph transversals via edge contractions | 2021-06-30 | Paper |
| Linear-time algorithms for eliminating claws in graphs | 2021-04-21 | Paper |
| Computing the largest bond and the maximum connected cut of a graph | 2021-04-19 | Paper |
| Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms | 2021-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3386616 | 2021-01-05 | Paper |
| An efficient algorithm for combining verification and validation methods | 2020-10-22 | Paper |
| Partitioning a graph into complementary subgraphs | 2020-07-22 | Paper |
| Maximum cuts in edge-colored graphs | 2020-05-29 | Paper |
| A multivariate analysis of the strict terminal connection problem | 2020-03-26 | Paper |
| Bipartizing with a matching | 2019-10-11 | Paper |
| Deadlock resolution in wait-for graphs by vertex/arc deletion | 2019-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5377222 | 2019-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560268 | 2018-12-10 | Paper |
| Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem | 2018-10-04 | Paper |
| On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph | 2018-09-27 | Paper |
| And/or-convexity: a graph convexity based on processes and deadlock models | 2018-06-12 | Paper |
| Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number | 2018-05-24 | Paper |
| Maximum cuts in edge-colored graphs | 2018-04-09 | Paper |
| Simple undirected two-commodity integral flow with a unitary demand | 2018-04-09 | Paper |
| On the hardness of finding the geodetic number of a subcubic graph | 2018-04-05 | Paper |
| Deletion graph problems based on deadlock resolution | 2017-10-23 | Paper |
| Generalized threshold processes on graphs | 2017-09-07 | Paper |
| Decycling with a matching | 2017-06-13 | Paper |
| Extremal values and bounds for the zero forcing number | 2016-09-30 | Paper |
| Maximum induced matchings close to maximum matchings | 2015-06-11 | Paper |
| On P 3-Convexity of Graphs with Bounded Degree | 2015-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982363 | 2015-04-09 | Paper |
