\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 Well-Structured Modulators: FPT Algorithms and Kernels}

%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 \underline{Robert Ganian}, Eduard Eiben, Stefan Szeider -- {\small TU Wien, Vienna, Austria}

\vspace{2ex}

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

A modulator of a graph $G$ to a specified graph class $\mathcal{H}$ is a set of vertices whose deletion puts $G$ into $\mathcal{H}$. The cardinality of a modulator to various tractable graph classes has long been used as a structural parameter which can be exploited to obtain both FPT algorithms and polynomial kernels for a range of hard problems.
  Here we investigate what happens when a graph contains a modulator which is large but ``well-structured'' (in the sense of having bounded rank-width). Can such modulators still be exploited to obtain efficient algorithms? And is it even possible to find such modulators efficiently?
  
We first show that the parameters derived from such well-structured modulators are more general (and hence applicable on broader graph classes) than modulators as well as other established parameters used for kernelization and fixed parameter tractability. Then, we develop algorithms for finding such well-structured modulators to a range of graph classes. Finally, we use the concept of well-structured modulators to develop algorithmic meta-theorems for deciding problems expressible in Monadic Second Order (MSO) logic, and prove that this result is tight in the sense that it cannot be generalized to LinEMSO problems.

This talk is based on the results obtained in~\cite{ERS1,ERS2}.



%If you need a ref section, do it more or less like that : 
\small
\begin{thebibliography}{1}

\bibitem{ERS1}
E. Eiben, R. Ganian, S. Szeider.
\newblock Solving Problems on Graphs of High Rank-Width.
\newblock In {\em Algorithms and Data Structures -- 14th International Symposium (WADS)}, pp. 314-326, LNCS 9214, 2015.

\bibitem{ERS2}
E. Eiben, R. Ganian, S. Szeider.
\newblock Meta-Kernelization using Well-Structured Modulators.
\newblock In {\em Parameterized and Exact Computation -- 9th International Symposium
               (IPEC)}, 2015, \em{to appear}.
\end{thebibliography}


\end{document}