| Publication | Date of Publication | Type |
|---|
Correction to: ``Certificates in P and subquadratic-time computation of radius, diameter, and all eccentricities in graphs''
Algorithmica | 2026-05-08 | Paper |
Certificates in P and subquadratic-time computation of radius, diameter, and all eccentricities in graphs
Algorithmica | 2025-12-16 | Paper |
Diameter in linear time for constant-dimension median graphs
Procedia Computer Science | 2025-12-02 | Paper |
Forbidden patterns in temporal graphs resulting from encounters in a corridor
Journal of Computer and System Sciences | 2025-03-26 | Paper |
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
Order | 2024-04-29 | Paper |
| Subquadratic-time algorithm for the diameter and all eccentricities on median graphs | 2024-04-23 | Paper |
Chordal graphs and their clique graphs
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
Theory of Computing Systems | 2024-02-09 | Paper |
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
SIAM Journal on Discrete Mathematics | 2024-02-07 | Paper |
A new graph parameter to measure linearity
Journal of Graph Theory | 2023-10-12 | Paper |
| Classifying grounded intersection graphs via ordered forbidden patterns | 2021-12-01 | Paper |
| Diameter, radius and all eccentricities in linear time for constant-dimension median graphs | 2021-05-25 | Paper |
A new graph parameter to measure linearity
Lecture Notes in Computer Science | 2018-03-26 | Paper |
A new LBFS-based algorithm for cocomparability graph recognition
Discrete Applied Mathematics | 2016-11-24 | Paper |
On the power of graph searching for cocomparability graphs
SIAM Journal on Discrete Mathematics | 2016-04-07 | Paper |
Influence of the tie-break rule on the end-vertex problem
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2014-11-10 | Paper |
A survey of the algorithmic aspects of modular decomposition
Computer Science Review | 2014-10-07 | Paper |
On computing the diameter of real-world undirected graphs
Theoretical Computer Science | 2013-12-11 | Paper |
Unifying the representation of symmetric crossing families and weakly partitive families
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
A decomposition theorem for chordal graphs and its applications
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
SIAM Journal on Computing | 2013-09-25 | Paper |
Linear algorithms for chordal graphs of bounded directed vertex leafage
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
On some simplicial elimination schemes for chordal graphs
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Algorithms for some H-join decompositions
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Polynomial-time recognition of clique-width 3 graphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
Tree-representation of set families and applications to combinatorial decompositions
European Journal of Combinatorics | 2012-05-04 | Paper |
Reduced clique graphs of chordal graphs
European Journal of Combinatorics | 2012-05-04 | Paper |
Diameter determination on restricted graph families
Discrete Applied Mathematics | 2002-08-14 | Paper |
Efficient algorithms on distributive lattices
Discrete Applied Mathematics | 2002-01-30 | Paper |
A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
Theoretical Computer Science | 2001-08-20 | Paper |
