Finding a maximum induced matching in weakly chordal graphs
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Combinatorial optimization - Eureka, you shrink!
Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
On the chromatic number of some geometric type Kneser graphs
Computational Geometry: Theory and Applications
On the structure of certain intersection graphs
Information Processing Letters
On the chromatic number of some geometric type Kneser graphs
Computational Geometry: Theory and Applications
Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Applied Mathematics
Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Finding common structured patterns in linear graphs
Theoretical Computer Science
Algorithms for induced biclique optimization problems
Information Processing Letters
Classes of graphs with small rank decompositions are Χ-bounded
European Journal of Combinatorics
On the page number of upward planar directed acyclic graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
Common structured patterns in linear graphs: approximation and combinatorics
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Geometric intersection graph: do short cycles help?
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
Journal of Combinatorial Theory Series B
| Hi-index | 0.05 |