\documentclass[10pt]{article}
\usepackage[utf8]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{amssymb,amsmath}
\usepackage{epsfig}
\usepackage{a4}
\usepackage{vmargin}
\setmarginsrb{3.5cm}{2cm}{3.5cm}{2cm}{1cm}{1cm}{1cm}{1cm}

\newcounter{cptRef}
\setcounter{cptRef}{0}
\newcommand\affiliation[2]{\refstepcounter{cptRef}\label{refAffiliation:#1}$^{\mbox{\scriptsize\ref{refAffiliation:#1}}}$
  #2}
\newcommand\myAffiliation[1]{\ref{refAffiliation:#1}}
\renewcommand\author[3]{{\em #1 #2}\ $^{\mbox{\scriptsize\myAffiliation{#3}}}$}
\newcommand\affiliationWithoutReferenceToAuthor[1]{#1}
\newcommand\authorWithoutReferenceToAffiliation[2]{{\em #1 #2}}
\renewcommand\title[1]{{\Large #1}}

\newenvironment{titleArea}{\begin{center}}{\end{center}}
\newenvironment{extendedAbstract}{\begin{center}{\bf {\sc Extended Abstract}}\end{center}}{}
\newcounter{cptTh}
\setcounter{cptTh}{0}
\newtheorem{theorem}[cptTh]{Theorem}
\newtheorem{proposition}[cptTh]{Proposition}
\newtheorem{lemma}[cptTh]{Lemma}
\newtheorem{property}[cptTh]{Property}
\newtheorem{corollary}[cptTh]{Corollary}
\newtheorem{conjecture}[cptTh]{Conjecture}
\newtheorem{example}[cptTh]{Example}
\newtheorem{problem}[cptTh]{Problem}


\begin{document}

\begin{titleArea}

\title{Power domination of graphs}

\medskip

%% Authors
\authorWithoutReferenceToAffiliation{Paul}{Dorbec},
\authorWithoutReferenceToAffiliation{Mickael}{Montassier}, and 
\authorWithoutReferenceToAffiliation{André}{Raspaud}

\medskip

%% One or more affiliations
\affiliationWithoutReferenceToAuthor{LaBRI, University of Bordeaux,
  France}

\affiliationWithoutReferenceToAuthor{CNRS, Paris, France}

\end{titleArea}


\begin{extendedAbstract}
{\bf Instructions to authors.} Authors have just to complete this
\LaTeX \ file. First enter title, names of authors, and affiliations in
\verb+titleArea+ environment. You can use different macros:
\begin{itemize}
\item \verb+\author{firstname}{lastname}{referenceToAffiliation}+
\item \verb+\authorWithoutReferenceToAffiliation{firstname}{lastname}+
\item
  \verb+\affiliation{labelOfTheAffiliation}{name of the affiliation, address, country}+
\item
  \verb+\affiliationWithoutReferenceToAuthor{name of the affiliation, address, country}+
\end{itemize}

See the different example files. Then add your extended abstract in
the \verb+extendedAbstract+ environment. The bibliography has to be
written in this file in the \verb+thebibliography+ environment. You
can use as usual environments \verb+theorem+, \verb+proposition+,
\verb+lemma+, \verb+property+, \verb+corollary+, \verb+conjecture+,
\verb+example+, \verb+problem+. For examples:

\begin{theorem}[Authors 'Year \cite{gajo-79}]
Statement.
\end{theorem}

\begin{conjecture}
Statement.
\end{conjecture}

If you want to insert figures, then insert figures as follows (see Figure \ref{fig-01}): 

\begin{figure}[h]
\begin{center}
\includegraphics[width=5cm]{petersen.png}
\caption{Petersen}
\label{fig-01}
\end{center}
\end{figure}

Finally, the extended abstract must not exceed two pages and must be
submitted in \verb+.pdf+ format to:
\begin{center}
\verb+https://www.easychair.org/conferences/?conf=bgw2014+
\end{center}
\end{extendedAbstract}

\begin{thebibliography}{2}

\bibitem{aaz-08} 
A. Aazami.
\newblock Domination in graphs with bounded propagation:
algorithms, formulations and hardness results.
\newblock  To appear in {\bf J. Combin. Optim.}.

\bibitem{aast-09}
A. Aazami, M. D. Stilp
\newblock  Approximation algorithms and hardness
for domination with propagation.
\newblock In {\bf SIAM J. Discrete Math.} 23:1382--1399, 2009.

\bibitem{bamiboad-93} 
T. L. Baldwin, L. Mili, M. B. Boisen Jr, R. Adapa.
\newblock Power system observability with minimal phasor measurement
placement.
\newblock In {\bf IEEE Trans. Power Systems} 8:707--715, 1993.


\bibitem{c-98}
G. J. Chang.
\newblock  Algorithmic aspects of domination in graphs.
\newblock  In {\bf Handbook of Combinatorial Optimization} (D.-Z. Du and P. M.
Pardalos eds.), 3:339--405, 1998.

\bibitem{domoklsp-08} 
P. Dorbec, M. Mollard, S. Klav\v zar, S. \v Spacapan.
\newblock Power domination in product graphs.
\newblock In {\bf SIAM J. Discrete Math. }, 22:554--56, 2008.

\bibitem{gajo-79}
M. R. Garey, D. S. Johnson.
\newblock  Computers and intractability: a
guide to the theory of NP-completeness. 
\newblock  Freeman, New York, (1979).


\end{thebibliography}


\end{document}
