Kyriakos Kilakos

According to our database, Kyriakos Kilakos authored at least 12 papers between 1993 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2004

Graph covers using t-colourable vertex sets.

Sylvain Gravier, Jeannette C. M. Janssen, Kyriakos Kilakos, Sulamita Klein

Discret. Math., 2004

2000

Planar segment visibility graphs.

Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy

Comput. Geom., 2000

Adaptive Multicolouring.

Jeannette C. M. Janssen, Kyriakos Kilakos

Comb., 2000

1999

Bounded Stable Sets: Polytopes and Colorings.

Jeannette C. M. Janssen, Kyriakos Kilakos

SIAM J. Discret. Math., 1999

1998

Face extensions in planar cubic graphs.

Kyriakos Kilakos, F. Bruce Shepherd

Discret. Math., 1998

1997

An Analysis of Channel Assignment Problems Based on Tours.

Jeannette C. M. Janssen, Kyriakos Kilakos

Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

1996

Fractional and integral colourings.

Kyriakos Kilakos, Odile Marotte

Math. Program., 1996

Subdivisions and the chromatic index of <i>r</i>-graphs.

Kyriakos Kilakos, F. Bruce Shepherd

J. Graph Theory, 1996

A Class of Matchings and a Related Lattice.

Kyriakos Kilakos

J. Comb. Theory, Ser. B, 1996

Excluding Minors in Cubic Graphs.

Kyriakos Kilakos, F. Bruce Shepherd

Comb. Probab. Comput., 1996

1993

Minimum Edge Dominating Sets.

Joseph Douglas Horton, Kyriakos Kilakos

SIAM J. Discret. Math., 1993

Fractionally colouring total graphs.

Kyriakos Kilakos, Bruce A. Reed

Comb., 1993