| Publication | Date of Publication | Type |
|---|
On partitioning minimum spanning trees
Discrete Applied Mathematics | 2024-11-06 | Paper |
Decomposing the feasibility of clustered spanning tree by paths
Discrete Applied Mathematics | 2024-06-20 | Paper |
Achieving feasibility for clustered traveling salesman problems using PQ‐trees
Networks | 2023-12-18 | Paper |
Erratum to: ``Two dimensional maximum weight matching using Manhattan topology''
Operations Research Letters | 2022-10-17 | Paper |
Two dimensional maximum weight matching using Manhattan topology
Operations Research Letters | 2022-07-22 | Paper |
Vertices removal for feasibility of clustered spanning trees
Discrete Applied Mathematics | 2021-04-20 | Paper |
| Clustered spanning tree -- conditions for feasibility | 2020-01-13 | Paper |
Approximation algorithms for not necessarily disjoint clustered TSP
Journal of Graph Algorithms and Applications | 2018-11-12 | Paper |
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
Discrete Mathematics | 2016-12-14 | Paper |
Single bend paths on a grid have strong Helly number 4: errata atque emendationes ad ``Edge intersection graphs of single bend paths on a grid''
Networks | 2016-06-10 | Paper |
String graphs of \(k\)-bend paths on a grid
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Vertex Intersection Graphs of Paths on a Grid
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
Edge intersection graphs of single bend paths on a grid
Networks | 2010-11-24 | Paper |
On the bi-enhancement of chordal-bipartite probe graphs
Information Processing Letters | 2010-09-07 | Paper |
| scientific article; zbMATH DE number 5763164 (Why is no real title available?) | 2010-07-30 | Paper |
| On edge-intersection graphs of \(k\)-bend paths in grids | 2010-07-27 | Paper |
Smallest odd holes in claw-free graphs (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Edge-Intersection Graphs of k-Bend Paths in Grids
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Intersection models of weakly chordal graphs
Discrete Applied Mathematics | 2009-06-24 | Paper |
Equivalences and the complete hierarchy of intersection graphs of paths in a tree
Discrete Applied Mathematics | 2009-03-04 | Paper |
What Is between Chordal and Weakly Chordal Graphs?
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Finding Intersection Models of Weakly Chordal Graphs
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Representing edge intersection graphs of paths on degree 4 trees
Discrete Mathematics | 2008-03-18 | Paper |
The \(k\)-edge intersection graphs of paths in a tree
Discrete Applied Mathematics | 2008-02-26 | Paper |
The complete optimal stars-clustering-tree problem
Discrete Applied Mathematics | 2008-02-26 | Paper |
On the Optimal Stars Clustering Tree Problem
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
