| Publication | Date of Publication | Type |
|---|
| Exact algorithms for biclique coloring | 2024-05-06 | Paper |
| Equitable partition of graphs into independent sets and cliques | 2024-05-06 | Paper |
| Computational complexity and linear formulations for optimizing the location of shared mobility stations | 2024-04-30 | Paper |
| Integer programming formulations for the \(k\)-in-a-tree problem in graphs | 2024-04-30 | Paper |
| Total coloring of snarks is NP-complete | 2024-04-22 | Paper |
| The \(k\)-in-a-tree problem for chordal graphs | 2024-04-22 | Paper |
| Short block-move-CPP is \textsf{NP}-complete | 2024-04-22 | Paper |
| Polynomial time algorithms for the token swapping problem on cographs | 2024-04-14 | Paper |
| Edge deletion to tree-like graph classes | 2024-03-27 | Paper |
| A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty | 2023-09-29 | Paper |
| Weighted connected matchings | 2023-07-26 | Paper |
| Minimum Separator Reconfiguration | 2023-07-15 | Paper |
| Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization | 2023-06-28 | Paper |
| Reducing the vertex cover number via edge contractions | 2023-06-12 | Paper |
| Disconnected matchings | 2023-04-26 | Paper |
| Disconnected matchings | 2023-03-30 | Paper |
| FPT and kernelization algorithms for the induced tree problem | 2023-03-22 | Paper |
| Structural parameterizations for equitable coloring | 2022-10-13 | Paper |
| On the arboreal jump number of a poset | 2022-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089236 | 2022-07-18 | Paper |
| Reducing graph transversals via edge contractions | 2021-06-30 | Paper |
| On the proper orientation number of chordal graphs | 2020-11-30 | Paper |
| Intersection graph of maximal stars | 2020-08-31 | Paper |
| Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs | 2020-05-29 | Paper |
| Covering graphs with convex sets and partitioning graphs into convex sets | 2020-04-03 | Paper |
| On the computational complexity of closest genome problems | 2020-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5377224 | 2019-05-23 | Paper |
| One-sided weak dominance drawing | 2019-01-18 | Paper |
| The convexity of induced paths of order three and applications: complexity aspects | 2018-02-22 | Paper |
| On the geodetic rank of a graph | 2017-07-25 | Paper |
| On recognition of threshold tolerance graphs and their complements | 2016-11-24 | 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 |
| On the equitable total chromatic number of cubic graphs | 2016-06-21 | Paper |
| On the total coloring of generalized Petersen graphs | 2016-04-07 | Paper |
| Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time | 2015-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982366 | 2015-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2928582 | 2014-11-10 | Paper |
| Irreversible conversion processes with deadlines | 2014-04-28 | Paper |
| On the Carathéodory number of interval and graph convexities | 2014-01-13 | Paper |
| Algorithmic and structural aspects of the \(P_3\)-Radon number | 2013-09-03 | Paper |
| Characterization and recognition of Radon-independent sets in split graphs | 2013-03-21 | Paper |
| An upper bound on the \(P_3\)-Radon number | 2012-08-10 | Paper |
| On the Radon Number for P 3-Convexity | 2012-06-29 | Paper |
| On subbetweennesses of trees: hardness, algorithms, and characterizations | 2012-04-22 | Paper |
| Characterization and representation problems for intersection betweennesses | 2011-03-10 | Paper |
