G. Manoussakis

activity

20142023

most citedThe clique problem on inductive

k

-independent graphs

1 citations · 1 across the 8 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2015

New algorithms for $k$ -degenerate graphs

George Manoussakis

A graph is $k$ -degenerate if any induced subgraph has a vertex of degree at most $k$ . In this paper we prove new algorithms for cliques and similar structures for these graphs. We…

cs.DM2014★ 1 cited

The clique problem on inductive $k$ -independent graphs

George Manoussakis

A graph is inductive $k$ -independent if there exists and ordering of its vertices $v_{1}, ..., v_{n}$ such that $α (G [N (v_{i}) \cap V_{i}]) \leq k$ where $N (v_{i})$ is the neighborhood…

New algorithms for k-degenerate graphs

The clique problem on inductive k-independent graphs

New algorithms for $k$ -degenerate graphs

The clique problem on inductive $k$ -independent graphs