| Publication | Date of Publication | Type |
|---|
Certificates in P and subquadratic-time computation of radius, diameter, and all eccentricities in graphs
Algorithmica | 2025-12-16 | Paper |
Treelength of series-parallel graphs
Procedia Computer Science | 2025-12-02 | Paper |
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
Journal of Computer and System Sciences | 2025-01-27 | Paper |
Corrigendum to: ``The diameter of AT-free graphs
Journal of Graph Theory | 2025-01-06 | Paper |
Leanness computation: small values and special graph classes
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-17 | Paper |
| A new application of orthogonal range searching for computing giant graph diameters | 2024-08-26 | Paper |
\( \alpha_i\)-metric graphs: radius, diameter and all eccentricities
Algorithmica | 2024-08-02 | Paper |
| $$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities | 2024-05-03 | Paper |
| Subquadratic-time algorithm for the diameter and all eccentricities on median graphs | 2024-04-23 | Paper |
Balancing graph Voronoi diagrams with one more vertex
Networks | 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
Theory of Computing Systems | 2024-02-09 | Paper |
A story of diameter, radius, and (almost) Helly property
Networks | 2023-12-11 | Paper |
Treelength of series-parallel graphs
Discrete Applied Mathematics | 2023-11-13 | Paper |
The diameter of AT‐free graphs
Journal of Graph Theory | 2023-10-05 | Paper |
| On computing the average distance for some chordal-like graphs | 2023-08-08 | Paper |
| Isometric embeddings in trees and their use in distance problems | 2023-08-08 | Paper |
| scientific article; zbMATH DE number 7691481 (Why is no real title available?) | 2023-06-02 | Paper |
Distance problems within Helly graphs and \(k\)-Helly graphs
Theoretical Computer Science | 2023-02-01 | Paper |
Diameter, eccentricities and distance oracle computations on \(H\)-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
SIAM Journal on Computing | 2022-11-15 | Paper |
Maximum matching in almost linear time on graphs of bounded clique-width
Algorithmica | 2022-10-27 | Paper |
Optimal centrality computations within bounded clique-width graphs
Algorithmica | 2022-10-27 | Paper |
Eccentricity queries and beyond using hub labels
Theoretical Computer Science | 2022-08-25 | Paper |
Non-existence of stable social groups in information-driven networks
Theory of Computing Systems | 2022-07-26 | Paper |
| scientific article; zbMATH DE number 7561542 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561360 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561384 (Why is no real title available?) | 2022-07-21 | Paper |
Beyond Helly graphs: the diameter problem on absolute retracts
(available as arXiv preprint) | 2022-06-08 | Paper |
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
(available as arXiv preprint) | 2022-03-25 | Paper |
Fast diameter computation within split graphs
Discrete Mathematics & Theoretical Computer Science | 2022-01-27 | Paper |
The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
Discrete Applied Mathematics | 2021-10-21 | Paper |
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
SIAM Journal on Discrete Mathematics | 2021-05-28 | Paper |
Fast approximation and exact computation of negative curvature parameters of graphs
Discrete & Computational Geometry | 2021-04-20 | Paper |
Fast approximation and exact computation of negative curvature parameters of graphs
Discrete & Computational Geometry | 2021-04-20 | Paper |
The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
Discrete Applied Mathematics | 2021-03-25 | Paper |
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Beyond Helly graphs: the diameter problem on absolute retracts
(available as arXiv preprint) | 2021-01-10 | Paper |
| Fast approximation and exact computation of negative curvature parameters of graphs | 2020-08-18 | Paper |
| How long does it take for all users in a social network to choose their communities? | 2020-08-11 | Paper |
On the (di)graphs with (directed) proper connection number two
Discrete Applied Mathematics | 2020-05-29 | Paper |
Fast diameter computation within split graphs
(available as arXiv preprint) | 2020-05-13 | Paper |
| Fast diameter computation within split graphs | 2020-05-13 | Paper |
On the complexity of computing treebreadth
Algorithmica | 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
ACM Transactions on Algorithms | 2019-11-25 | Paper |
How long does it take for all users in a social network to choose their communities?
Discrete Applied Mathematics | 2019-11-06 | Paper |
Equivalence between pathbreadth and strong pathbreadth
Discrete Applied Mathematics | 2019-05-23 | Paper |
Easy computation of eccentricity approximating trees
Discrete Applied Mathematics | 2019-05-03 | Paper |
Low time complexity algorithms for path computation in Cayley graphs
Discrete Applied Mathematics | 2019-03-28 | Paper |
Finding cut-vertices in the square roots of a graph
Discrete Applied Mathematics | 2019-03-11 | Paper |
| On interval number in cycle convexity | 2018-12-10 | Paper |
On distance-preserving elimination orderings in graphs: complexity and algorithms
Discrete Applied Mathematics | 2018-05-24 | Paper |
On the (di)graphs with (directed) proper connection number two
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
Revisiting decomposition by clique separators
SIAM Journal on Discrete Mathematics | 2018-04-06 | Paper |
A short note on the complexity of computing strong pathbreadth
Information Processing Letters | 2018-03-16 | Paper |
| scientific article; zbMATH DE number 6850484 (Why is no real title available?) | 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
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Applying clique-decomposition for computing Gromov hyperbolicity
Theoretical Computer Science | 2017-08-24 | Paper |
On the hyperbolicity of bipartite graphs and intersection graphs
Discrete Applied Mathematics | 2016-09-30 | Paper |
On the complexity of computing treebreadth
Lecture Notes in Computer Science | 2016-09-29 | Paper |
The Parallel Complexity of Coloring Games
Algorithmic Game Theory | 2016-09-29 | Paper |
To approximate treewidth, use treelength!
SIAM Journal on Discrete Mathematics | 2016-07-22 | Paper |
Data center interconnection networks are not hyperbolic
Theoretical Computer Science | 2016-06-30 | Paper |
Recognition of \(C_4\)-free and \(1/2\)-hyperbolic graphs
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
Eulerian and Hamiltonian dicycles in directed hypergraphs
Discrete Mathematics, Algorithms and Applications | 2014-04-25 | Paper |
Hamiltonicity of large generalized de Bruijn cycles
Discrete Applied Mathematics | 2014-04-22 | Paper |
$\alpha_i$-Metric Graphs: Hyperbolicity
(available as arXiv preprint) | N/A | Paper |
