| Publication | Date of Publication | Type |
|---|
| Balancing graph Voronoi diagrams with one more vertex | 2024-03-15 | Paper |
| Maximum Matching in almost linear time on graphs of bounded clique-width | 2024-02-12 | Paper |
| Optimal centrality computations within bounded clique-width graphs | 2024-02-12 | Paper |
| Subquadratic-time algorithm for the diameter and all eccentricities on median graphs | 2024-02-09 | Paper |
| A story of diameter, radius, and (almost) Helly property | 2023-12-11 | Paper |
| Treelength of series-parallel graphs | 2023-11-13 | Paper |
| The diameter of AT‐free graphs | 2023-10-05 | Paper |
| Isometric embeddings in trees and their use in distance problems | 2023-08-08 | Paper |
| On computing the average distance for some chordal-like graphs | 2023-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6160890 | 2023-06-02 | Paper |
| Distance problems within Helly graphs and \(k\)-Helly graphs | 2023-02-01 | Paper |
| Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension | 2022-11-15 | Paper |
| Optimal centrality computations within bounded clique-width graphs | 2022-10-27 | Paper |
| Maximum matching in almost linear time on graphs of bounded clique-width | 2022-10-27 | Paper |
| Eccentricity queries and beyond using hub labels | 2022-08-25 | Paper |
| Non-existence of stable social groups in information-driven networks | 2022-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090996 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091021 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091203 | 2022-07-21 | Paper |
| Beyond Helly graphs: the diameter problem on absolute retracts | 2022-06-08 | Paper |
| Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs | 2022-03-25 | Paper |
| Fast Diameter Computation within Split Graphs | 2022-01-27 | Paper |
| The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond | 2021-10-21 | Paper |
| Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs | 2021-05-28 | Paper |
| Fast approximation and exact computation of negative curvature parameters of graphs | 2021-04-20 | Paper |
| The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes | 2021-03-25 | Paper |
| Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension | 2021-02-02 | Paper |
| Beyond Helly graphs: the diameter problem on absolute retracts | 2021-01-10 | Paper |
| Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3305724 | 2020-08-11 | Paper |
| On the (di)graphs with (directed) proper connection number two | 2020-05-29 | Paper |
| Fast diameter computation within split graphs | 2020-05-13 | Paper |
| On the complexity of computing treebreadth | 2020-04-14 | Paper |
| The 4-Steiner Root problem | 2020-02-24 | Paper |
| Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs | 2019-11-25 | Paper |
| How long does it take for all users in a social network to choose their communities? | 2019-11-06 | Paper |
| Equivalence between pathbreadth and strong pathbreadth | 2019-05-23 | Paper |
| Easy computation of eccentricity approximating trees | 2019-05-03 | Paper |
| Low time complexity algorithms for path computation in Cayley graphs | 2019-03-28 | Paper |
| Finding cut-vertices in the square roots of a graph | 2019-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560236 | 2018-12-10 | Paper |
| On distance-preserving elimination orderings in graphs: complexity and algorithms | 2018-05-24 | Paper |
| On the (di)graphs with (directed) proper connection number two | 2018-04-09 | Paper |
| Revisiting Decomposition by Clique Separators | 2018-04-06 | Paper |
| A short note on the complexity of computing strong pathbreadth | 2018-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608071 | 2018-03-15 | Paper |
| A simple approach for lower-bounding the distortion in any hyperbolic embedding | 2018-01-18 | Paper |
| Finding cut-vertices in the square roots of a graph | 2018-01-04 | Paper |
| Applying clique-decomposition for computing Gromov hyperbolicity | 2017-08-24 | Paper |
| On the hyperbolicity of bipartite graphs and intersection graphs | 2016-09-30 | Paper |
| The Parallel Complexity of Coloring Games | 2016-09-29 | Paper |
| On the Complexity of Computing Treebreadth | 2016-09-29 | Paper |
| To Approximate Treewidth, Use Treelength! | 2016-07-22 | Paper |
| Data center interconnection networks are not hyperbolic | 2016-06-30 | Paper |
| Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs | 2014-12-22 | Paper |
| EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS | 2014-04-25 | Paper |
| Hamiltonicity of large generalized de Bruijn cycles | 2014-04-22 | Paper |
