| Publication | Date of Publication | Type |
|---|
| Giant components in random temporal graphs | 2025-01-14 | Paper |
| Small but unwieldy: a lower bound on adjacency labels for small classes | 2024-11-28 | Paper |
| Randomized communication and implicit representations for matrices and graphs of small sign-rank | 2024-11-28 | Paper |
| Optimal adjacency labels for subgraphs of Cartesian products | 2024-11-14 | Paper |
| Small but unwieldy: a lower bound on adjacency labels for small classes | 2024-11-01 | Paper |
| Independent transversals versus transversals | 2024-10-18 | Paper |
| Approximate and randomized algorithms for computing a second Hamiltonian cycle | 2024-10-07 | Paper |
| Optimal adjacency labels for subgraphs of Cartesian products | 2024-07-31 | Paper |
| Sharp Thresholds in Random Simple Temporal Graphs | 2024-04-04 | Paper |
| Union-closed sets and Horn Boolean functions | 2024-01-29 | Paper |
| The Treewidth and Pathwidth of Graph Unions | 2024-01-23 | Paper |
| On the price of independence for vertex cover, feedback vertex set and odd cycle transversal | 2024-01-23 | Paper |
| Functionality of box intersection graphs | 2024-01-19 | Paper |
| Graphs with minimum fractional domatic number | 2024-01-02 | Paper |
| Randomized communication and implicit graph representations | 2023-12-08 | Paper |
| Graph parameters, implicit representations and factorial properties | 2023-07-19 | Paper |
| Computing maximum matchings in temporal graphs | 2023-07-10 | Paper |
| Succinct permutation graphs | 2023-02-16 | Paper |
| Computing maximum matchings in temporal graphs. | 2023-02-07 | Paper |
| On Boolean threshold functions with minimum specification number | 2022-12-08 | Paper |
| Letter Graphs and Geometric Grid Classes of Permutations | 2022-11-15 | Paper |
| Graph parameters, implicit representations and factorial properties | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092419 | 2022-07-21 | Paper |
| How fast can we reach a target vertex in stochastic temporal graphs | 2022-07-21 | Paper |
| Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089192 | 2022-07-18 | Paper |
| Distributed minimum vertex coloring and maximum independent set in chordal graphs | 2022-06-13 | Paper |
| Optimal Adjacency Labels for Subgraphs of Cartesian Products | 2022-06-06 | Paper |
| Giant Components in Random Temporal Graphs | 2022-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005166 | 2021-08-04 | Paper |
| Temporal Vertex Cover with a Sliding Time Window | 2021-07-28 | Paper |
| Sliding window temporal graph coloring | 2021-06-30 | Paper |
| Deleting edges to restrict the size of an epidemic in temporal networks | 2021-04-14 | Paper |
| Graph classes with linear Ramsey numbers | 2021-03-25 | Paper |
| How fast can we reach a target vertex in stochastic temporal graphs? | 2020-09-07 | Paper |
| Letter graphs and geometric grid classes of permutations: characterization and recognition | 2020-06-29 | Paper |
| Clique-Width for Graph Classes Closed under Complementation | 2020-06-09 | Paper |
| Between clique-width and linear clique-width of bipartite graphs | 2020-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111290 | 2020-05-26 | Paper |
| Independent domination versus weighted independent domination | 2020-02-11 | Paper |
| Temporal vertex cover with a sliding time window | 2019-11-29 | Paper |
| On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal | 2019-10-11 | Paper |
| Brief Announcement | 2019-09-19 | Paper |
| Specifying a positive threshold function via extremal points | 2019-01-10 | Paper |
| Network Structures Uncertainty for Different Markets | 2018-12-20 | Paper |
| Linear read-once and related Boolean functions | 2018-10-26 | Paper |
| Measures of uncertainty in market network analysis | 2018-09-20 | Paper |
| Infinitely many minimal classes of graphs of unbounded clique-width | 2018-09-17 | Paper |
| Linear Ramsey numbers | 2018-09-06 | Paper |
| Linear clique-width of bi-complement reducible graphs | 2018-09-06 | Paper |
| Upper domination: towards a dichotomy through boundary properties | 2018-07-26 | Paper |
| On forbidden induced subgraphs for unit disk graphs | 2018-07-26 | Paper |
| Dominating induced matchings in graphs containing no long claw | 2018-07-13 | Paper |
| Letter graphs and geometric grid classes of permutations: characterization and recognition | 2018-06-15 | Paper |
| Well-quasi-ordering versus clique-width | 2018-04-18 | Paper |
| The structure and the number of \(P_7\)-free bipartite graphs | 2018-01-18 | Paper |
| New results on weighted independent domination | 2018-01-04 | Paper |
| More results on weighted independent domination | 2017-10-17 | Paper |
| The structure and the number of \(P_7\)-free bipartite graphs | 2017-08-31 | Paper |
| Well-quasi-ordering Does Not Imply Bounded Clique-width | 2016-10-21 | Paper |
| A Boundary Property for Upper Domination | 2016-09-29 | Paper |
| Combinatorics and algorithms for augmenting graphs | 2016-07-28 | Paper |
| Market Graph and Markowitz Model | 2015-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5263838 | 2015-07-17 | Paper |
| Boundary Properties of Factorial Classes of Graphs | 2015-03-24 | Paper |
| A tolerance-based heuristic approach for the weighted independent set problem | 2015-02-16 | Paper |
| Implicit representations and factorial properties of graphs | 2014-11-20 | Paper |
| Corrigendum to ``Locally bounded coverings and factorial properties of graphs | 2014-08-28 | Paper |
| Almost all factorial subclasses of quasi-line graphs with respect to one forbidden subgraph | 2012-09-05 | Paper |
| On factorial properties of chordal bipartite graphs | 2012-08-10 | Paper |
| Locally bounded coverings and factorial properties of graphs | 2012-05-04 | Paper |
| On estimation of the number of graphs in some hereditary classes | 2012-03-23 | Paper |
| A note on the speed of hereditary graph properties | 2011-10-18 | Paper |
| Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes | N/A | Paper |
| Tight bounds on adjacency labels for monotone graph classes | N/A | Paper |
| Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions | N/A | Paper |
