Satgraphs and independent domination: part 1
Theoretical Computer Science
Discrete Applied Mathematics
Discrete Applied Mathematics
A forbidden subgraph characterization of line-polar bipartite graphs
Discrete Applied Mathematics
Recognizing line-polar bipartite graphs in time O(n)
Discrete Applied Mathematics
Recognizing polar planar graphs using new results for monopolarity
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Polar permutation graphs are polynomial-time recognisable
European Journal of Combinatorics
Graph partitions with prescribed patterns
European Journal of Combinatorics
Algorithms for unipolar and generalized split graphs
Discrete Applied Mathematics
| Hi-index | 0.05 |