| Publication | Date of Publication | Type |
|---|
| On balanceable and simply balanceable regular graphs | 2024-12-27 | Paper |
| On constrained intersection representations of graphs and digraphs | 2024-09-11 | Paper |
| Graphs with at most two moplexes | 2024-08-30 | Paper |
| Bisimplicial separators | 2024-07-02 | Paper |
| Upper Clique Transversals in Graphs | 2024-05-03 | Paper |
| Treewidth versus clique number. II: Tree-independence number | 2024-01-29 | Paper |
| Functionality of box intersection graphs | 2024-01-19 | Paper |
| Computing well-covered vector spaces of graphs using modular decomposition | 2024-01-05 | Paper |
| Bisimplicial separators | 2023-12-17 | Paper |
| Shifting paths to avoidable ones | 2023-10-05 | Paper |
| Fair allocation algorithms for indivisible items under structured conflict constraints | 2023-10-02 | Paper |
| Allocation of indivisible items with individual preference graphs | 2023-05-11 | Paper |
| Fair allocation of indivisible items with conflict graphs | 2023-04-28 | Paper |
| Allocating indivisible items with minimum dissatisfaction on preference graphs | 2023-03-31 | Paper |
| Treewidth is NP-Complete on Cubic Graphs (and related results) | 2023-01-24 | Paper |
| Strong cliques in diamond-free graphs | 2022-12-21 | Paper |
| Treewidth versus clique number in graph classes with a forbidden structure | 2022-12-21 | Paper |
| Edge elimination and weighted graph classes | 2022-12-21 | Paper |
| Strong cliques and stable sets | 2022-12-21 | Paper |
| Fair Packing of Independent Sets | 2022-10-13 | Paper |
| On minimally tough chordal graphs | 2022-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5104255 | 2022-09-09 | Paper |
| Avoidability beyond paths | 2022-08-26 | Paper |
| Computing Tree Decompositions with Small Independence Number | 2022-07-20 | Paper |
| Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure | 2022-06-30 | Paper |
| A characterization of claw-free CIS graphs and new results on the order of CIS graphs | 2022-04-27 | Paper |
| Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs | 2022-03-31 | Paper |
| Vertex cover at distance on \(H\)-free graphs | 2022-03-22 | Paper |
| Avoidable vertices and edges in graphs: existence, characterization, and applications | 2022-01-13 | Paper |
| Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure | 2021-12-01 | Paper |
| Graphs with at most two moplexes | 2021-06-18 | Paper |
| Searching for square-complementary graphs: complexity of recognition and further nonexistence results | 2021-04-28 | Paper |
| Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem | 2021-03-17 | Paper |
| Strong cliques in diamond-free graphs | 2021-02-03 | Paper |
| Complexity and algorithms for constant diameter augmentation problems | 2020-10-01 | Paper |
| On the degree sequences of dual graphs on surfaces | 2020-08-02 | Paper |
| Mind the independence gap | 2020-07-08 | Paper |
| Induced Embeddings into Hamming Graphs. | 2020-05-26 | Paper |
| Fair allocation of indivisible items with conflict graphs | 2020-03-25 | Paper |
| A polynomial-time algorithm for the Independent Set problem in \(\{{P_{10}},C_4,C_6\}\)-free graphs | 2020-02-24 | Paper |
| Minimal separators in graph classes defined by small forbidden induced subgraphs | 2020-02-24 | Paper |
| Bipartite graphs of small readability | 2020-01-16 | Paper |
| Avoidable vertices and edges in graphs | 2020-01-16 | Paper |
| New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs | 2019-10-18 | Paper |
| Decomposing 1-Sperner hypergraphs | 2019-08-05 | Paper |
| Avoidable Vertices and Edges in Graphs | 2019-07-28 | Paper |
| Linear separation of connected dominating sets in graphs | 2019-07-25 | Paper |
| Detecting strong cliques | 2019-07-18 | Paper |
| Minimal separators in graph classes defined by small forbidden induced subgraphs | 2019-03-11 | Paper |
| A characterization of claw-free CIS graphs and new results on the order of CIS graphs | 2018-12-13 | Paper |
| On Almost Well-Covered Graphs of Girth at Least 6 | 2018-12-10 | Paper |
| A dichotomy for weighted efficient dominating sets with bounded degree vertices | 2018-12-05 | Paper |
| Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs | 2018-11-30 | Paper |
| Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem | 2018-11-13 | Paper |
| Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs | 2018-10-26 | Paper |
| Bipartite graphs of small readability | 2018-10-04 | Paper |
| 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs | 2018-09-17 | Paper |
| Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs | 2018-08-17 | Paper |
| On total domination in the Cartesian product of graphs | 2018-08-10 | Paper |
| On two extensions of equimatchable graphs | 2018-05-24 | Paper |
| A three-person deterministic graphical game without Nash equilibria | 2018-05-24 | Paper |
| Vector connectivity in graphs | 2018-05-23 | Paper |
| Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs | 2018-05-09 | Paper |
| Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs | 2018-04-06 | Paper |
| Graphs vertex-partitionable into strong cliques | 2018-04-05 | Paper |
| The minimum conflict-free row split problem revisited | 2018-01-04 | Paper |
| Domination parameters with number 2: interrelations and algorithmic consequences | 2017-12-06 | Paper |
| Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity | 2017-11-16 | Paper |
| Finding a Perfect Phylogeny from Mixed Tumor Samples | 2017-07-25 | Paper |
| Partial Characterizations of 1‐Perfectly Orientable Graphs | 2017-07-05 | Paper |
| On the complexity of the identifiable subgraph problem, revisited | 2017-06-14 | Paper |
| \(1\)-perfectly orientable graphs and graph products | 2017-05-10 | Paper |
| Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs | 2017-04-21 | Paper |
| On three extensions of equimatchable graphs | 2017-02-14 | Paper |
| 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs | 2017-02-13 | Paper |
| On equistable, split, CIS, and related classes of graphs | 2016-11-24 | Paper |
| The price of connectivity for cycle transversals | 2016-08-16 | Paper |
| Equistarable bipartite graphs | 2016-04-27 | Paper |
| On the readability of overlap digraphs | 2016-04-07 | Paper |
| A decomposition theorem for {ISK4,wheel}-free trigraphs | 2016-02-07 | Paper |
| Graph classes with and without powers of bounded clique-width | 2015-12-10 | Paper |
| On a class of graphs between threshold and total domishold graphs | 2015-09-21 | Paper |
| The Price of Connectivity for Cycle Transversals | 2015-09-16 | Paper |
| On the Readability of Overlap Digraphs | 2015-08-20 | Paper |
| On the complexity of the vector connectivity problem | 2015-07-13 | Paper |
| Group irregularity strength of connected graphs | 2015-07-01 | Paper |
| Spread of influence in weighted networks under time and budget constraints | 2015-05-26 | Paper |
| On the complexity of the identifiable subgraph problem | 2015-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934676 | 2014-12-18 | Paper |
| Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs | 2014-12-09 | Paper |
| Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs | 2014-12-03 | Paper |
| Vertex-transitive CIS graphs | 2014-11-19 | Paper |
| A note on domination and independence-domination numbers of graphs | 2014-10-22 | Paper |
| Graphs without large apples and the maximum weight independent set problem | 2014-09-19 | Paper |
| Dominating sequences in graphs | 2014-09-04 | Paper |
| A characterization of line graphs that are squares of graphs | 2014-08-22 | Paper |
| Set graphs. IV. Further connections with claw-freeness | 2014-08-22 | Paper |
| Set graphs. II. Complexity of set graph recognition and similar problems | 2014-07-25 | Paper |
| Graphs whose complement and square are isomorphic | 2014-05-06 | Paper |
| Equistable simplicial, very well-covered, and line graphs | 2014-05-05 | Paper |
| Latency-bounded target set selection in social networks | 2014-04-29 | Paper |
| Computing square roots of trivially perfect and threshold graphs | 2014-04-16 | Paper |
| On CIS circulants | 2014-01-27 | Paper |
| Induced Subtrees in Interval Graphs | 2014-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867366 | 2013-12-11 | Paper |
| Linear Separation of Total Dominating Sets in Graphs | 2013-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2856714 | 2013-10-30 | Paper |
| On the Plane-Width of Graphs | 2013-10-10 | Paper |
| New Polynomial Cases of the Weighted Efficient Domination Problem | 2013-09-20 | Paper |
| Latency-Bounded Target Set Selection in Social Networks | 2013-08-05 | Paper |
| Hereditary Efficiently Dominatable Graphs | 2013-07-31 | Paper |
| The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes | 2013-07-19 | Paper |
| Vector Connectivity in Graphs | 2013-05-28 | Paper |
| Dilation coefficient, plane-width, and resolution coefficient of graphs | 2013-05-13 | Paper |
| On the approximability and exact algorithms for vector domination and related problems in graphs | 2013-04-18 | Paper |
| Critical properties of graphs of bounded clique-width | 2013-04-11 | Paper |
| Resilience and optimization of identifiable bipartite graphs | 2013-03-12 | Paper |
| Set graphs. I. Hereditarily finite sets and extensional acyclic orientations | 2013-03-12 | Paper |
| On the Recognition of k-Equistable Graphs | 2012-11-06 | Paper |
| Complexity of independent set reconfigurability problems | 2012-08-08 | Paper |
| Graphs of separability at most 2 | 2012-05-11 | Paper |
| Competitive evaluation of threshold functions in the priced information model | 2011-11-17 | Paper |
| Complexity results for equistable graphs and related classes | 2011-11-17 | Paper |
| The plane-width of graphs | 2011-11-15 | Paper |
| Shortest paths between shortest paths | 2011-10-10 | Paper |
| Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs | 2011-08-19 | Paper |
| Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case | 2011-08-10 | Paper |
| Equistable graphs, general partition graphs, triangle graphs, and graph products | 2011-08-10 | Paper |
| Shortest Paths between Shortest Paths and Independent Sets | 2011-05-19 | Paper |
| Graphs of Separability at Most Two: Structural Characterizations and Their Consequences | 2011-05-19 | Paper |
| On the Maximum Independent Set Problem in Subclasses of Planar Graphs | 2011-02-16 | Paper |
| A polynomial algorithm to find an independent set of maximum weight in a fork-free graph | 2010-08-16 | Paper |
| Recent developments on graphs of bounded clique-width | 2010-04-28 | Paper |
| Structural identifiability in low-rank matrix factorization | 2010-02-23 | Paper |
| A polynomial algorithm to find an independent set of maximum weight in a fork-free graph | 2009-02-23 | Paper |
| The Maximum Independent Set Problem in Planar Graphs | 2009-02-03 | Paper |
| Computing with Priced Information: When the Value Makes the Price | 2009-01-29 | Paper |
| On finding augmenting graphs | 2008-11-19 | Paper |
| Tree-Width and Optimization in Bounded Degree Graphs | 2008-07-01 | Paper |
| Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem | N/A | Paper |
| Detecting $K_{2,3}$ as an induced minor | N/A | Paper |
| Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star | N/A | Paper |
| Tree decompositions meet induced matchings: beyond Max Weight Independent Set | N/A | Paper |
| On balanceable and simply balanceable regular graphs | N/A | Paper |
| The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs | N/A | Paper |
| Excluding a clique or a biclique in graphs of bounded induced matching treewidth | N/A | Paper |
