Paschos V.Th.

V.Th. Paschos

Information about the author V.Th. Paschos will soon be added to the site.
Found 3 papers in total
Reductions, completeness and the hardness of approximability
Reductions, completeness and the hardness of approximability
2006
In computability and in complexity theory reductions are widely used for mapping sets...
An exact algorithm for MAX-CUT in sparse graphs
An exact algorithm for MAX-CUT in sparse graphs
2007
We study exact algorithms for the MAX-CUT problem. Introducing a new technique, we...
Time slot scheduling of compatible jobs
Time slot scheduling of compatible jobs
2007
A version of weighted coloring of a graph is introduced which is motivated by some...
Papers per page: