| Publication | Date of Publication | Type |
|---|
Graphs whose vertices of degree at least 2 lie in a triangle
RAIRO. Operations Research | 2025-01-20 | Paper |
Restricted Hamming–Huffman trees
RAIRO - Operations Research | 2022-07-22 | Paper |
Modelling and solving the perfect edge domination problem
Optimization Letters | 2020-04-27 | Paper |
Perfect edge domination: hard and solvable cases
Annals of Operations Research | 2018-06-12 | Paper |
Approximating weighted induced matchings
Discrete Applied Mathematics | 2018-05-24 | Paper |
Approximating weighted neighborhood independent sets
Information Processing Letters | 2017-11-22 | Paper |
Exact algorithms for minimum weighted dominating induced matching
Algorithmica | 2017-04-12 | Paper |
On neighborhood-Helly graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Efficient and perfect domination on circular-arc graphs
| 2016-10-17 | Paper |
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
Discrete Applied Mathematics | 2015-09-30 | Paper |
A faster algorithm for the cluster editing problem on proper interval graphs
Information Processing Letters | 2015-09-15 | Paper |
Approximation algorithms for clique transversals on some graph classes
Information Processing Letters | 2015-06-02 | Paper |
Domination problems on \(P_{5}\)-free graphs
RAIRO - Theoretical Informatics and Applications | 2015-04-28 | Paper |
The Maximum Number of Dominating Induced Matchings
Journal of Graph Theory | 2015-03-24 | Paper |
Fast algorithms for some dominating induced matching problems
Information Processing Letters | 2014-06-23 | Paper |
\(O(n)\) time algorithms for dominating induced matching problems
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Isomorphism of graph classes related to the circular-ones property
| 2014-02-14 | Paper |
An \(O ^{*}(1.1939^{n })\) time algorithm for minimum weighted dominating induced matching
Algorithms and Computation | 2014-01-14 | Paper |
Short models for unit interval graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Normal Helly circular-arc graphs and its subclasses
Discrete Applied Mathematics | 2013-04-25 | Paper |
Exact algorithms for dominating induced matchings
| 2013-01-31 | Paper |
Arboricity, \(h\)-index, and dynamic algorithms
Theoretical Computer Science | 2012-05-30 | Paper |
Powers of cycles, powers of paths, and distance graphs
Discrete Applied Mathematics | 2011-04-19 | Paper |
Linear-time recognition of Helly circular-arc models and graphs
Algorithmica | 2011-03-02 | Paper |
Efficient construction of unit circular-arc models
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
The clique operator on circular-arc graphs
Discrete Applied Mathematics | 2010-08-13 | Paper |
Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs
Information Processing Letters | 2010-06-09 | Paper |
Faster recognition of clique-Helly and hereditary clique-Helly graphs
Information Processing Letters | 2010-03-24 | Paper |
Characterizations and recognition of circular-arc graphs and subclasses: a survey
Discrete Mathematics | 2009-12-15 | Paper |
Unit Circular-Arc Graph Representations and Feasible Circulations
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
Algorithms for finding clique-transversals of graphs
Annals of Operations Research | 2008-09-03 | Paper |
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Proper Helly Circular-Arc Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
On cliques of Helly Circular-arc Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Algorithms for clique-independent sets on subclasses of circular-arc graphs
Discrete Applied Mathematics | 2006-08-17 | Paper |
On balanced graphs
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
scientific article; zbMATH DE number 2230210 (Why is no real title available?)
| 2005-11-18 | Paper |
scientific article; zbMATH DE number 2188345 (Why is no real title available?)
| 2005-07-26 | Paper |
Self‐clique graphs and matrix permutations
Journal of Graph Theory | 2004-02-03 | Paper |
On clique-transversals and clique-independent sets
Annals of Operations Research | 2003-01-27 | Paper |
On some subclasses of circular-arc graphs
Congressus Numerantium | 2002-01-02 | Paper |
A sufficient condition for self-clique graphs
| 2001-10-24 | Paper |
Graphs whose vertices of degree at least 2 lie in a triangle
| N/A | Paper |
