\documentclass[11pt]{article}
\usepackage[russian,greek,english]{babel}
\usepackage{amsmath,ifthen,color,eurosym}
\usepackage{wrapfig,hyperref,cite}
\usepackage{latexsym,amsthm,amsmath,amssymb,url,cite}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{stmaryrd,wasysym}
\usepackage{colortbl}
\usepackage[lined,boxed,commentsnumbered]{algorithm2e}
\usepackage[english]{babel}
\usepackage[utf8x]{inputenc}

\def\baselinestretch{1}


\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{corollary}{Corollary}
\newtheorem{claim}{Claim}
\newtheorem{observation}{Observation}
\newtheorem{proposition}{Proposition}

\setlength{\textheight}{22cm}
\setlength{\topmargin}{-1cm}
\setlength{\textwidth}{165mm}
\setlength{\oddsidemargin}{-3mm}
\setlength{\unitlength}{1mm}


%\renewcommand{\refname}{\small References}
\addto{\captionsenglish}{\renewcommand{\refname}{\normalsize
    References}}



%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%
%Put here the package you need, new commands, ...



%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%

\begin{document}
%1 page max !! 

%Write your title here: 
\noindent{\bf\Large Fixed Parameter Algorithms for  Completion\\ Problems on Planar Graphs\footnote{The first and the fifth authors were supported by the E.U. (European Social Fund - ESF) and Greek national funds through the Operational Program ``Education and Lifelong Learning'' of the National Strategic Reference Framework (NSRF) - Research Funding Program: ``Thales. Investing in knowledge society through the European Social Fund''. The second author was supported by the Warsaw Center of Mathematics and Computer Science. The fourth author was supported by the FP7-PEOPLE-2013-CIG project CountGraph (ref. 630749), and the Berlin Mathematical School.}}

%List the authors as follows (you may underline the speaker, or just
%name the speaker, and mention your co-authors at the end, up to you):  
\noindent Dimitris Chatzidimitriou -- {\small Department of Mathematics, National and Kapodistrian University of Athens, Athens, Greece.}

\noindent \underline{Archontia C. Giannopoulou} -- {\small Institute of Informatics, University of Warsaw, Warsaw, Poland.}

\noindent Spyridon Maniatis -- {\small Department of Mathematics, National and Kapodistrian University of Athens, Athens, Greece.}

\noindent Cl\'ement Requil\'e -- {\small Freie Universit\"at Berlin, Institut f\"ur Mathematik und Informatik, Berlin, Germany.}

\noindent Dimitrios M. Thilikos -- {\small AlGCo project team, CNRS, LIRMM, Montpellier, France  and Department of Mathematics, National and Kapodistrian
 University of Athens, Athens, Greece.}

\noindent Dimitris Zoros -- {\small Department of Mathematics, National and Kapodistrian University of Athens, Athens, Greece.}
\vspace{2ex}

\noindent{\bf Abstract:} %Here write your abstract

Given a partial relation $\leq$ on graphs we 
consider the {\sc Plane $\leq$-Completion ($\leq\mbox{-}$PC)} problem which, given 
a (possibly disconnected) plane graph $G$ and a connected plane graph $H$,  asks whether it is possible to add edges in $G$ 
such that the resulting graph $G^{+}$ 
remains plane and $H\leq G^{+}$.
We consider instantiations of   this general problem 
when $\leq$ is the (embedded) 
subgraph relation, the (embedded) induced  
subgraph relation,  the (embedded) topological minor relation, and the (embedded) minor relation
and we prove that all of them admit  fixed parameter algorithms when parameterized by the size of $H$.

%If you need a ref section, do it more or less like that : 


\end{document}