<?xml version="1.0" ?>
<!-- This file was exported from BibSonomy, http://www.bibsonomy.org -->

<bibliography>

<biblioentry xreflabel="journals/tcs/BozapalidisK08" id="journals/tcs/BozapalidisK08">
   <authorgroup>
       <author><firstname>Symeon</firstname><surname>Bozapalidis</surname></author>
       <author><firstname>Antonios</firstname><surname>Kalampakas</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Graph automata.</citetitle>
   <citetitle pubwork="journal">Theor. Comput. Sci.</citetitle>

   <volumenum>393</volumenum> 

   <artpagenums>147-165</artpagenums> 
   <pubdate>2008</pubdate>  

</biblioentry>
<biblioentry xreflabel="journals/acta/BozapalidisK06" id="journals/acta/BozapalidisK06">
   <authorgroup>
       <author><firstname>Symeon</firstname><surname>Bozapalidis</surname></author>
       <author><firstname>Antonios</firstname><surname>Kalampakas</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Recognizability of graph and pattern languages.</citetitle>
   <citetitle pubwork="journal">Acta Inf.</citetitle>

   <volumenum>42</volumenum> 

   <artpagenums>553-581</artpagenums> 
   <pubdate>2006</pubdate>  

</biblioentry>
<biblioentry xreflabel="journals/acta/BozapalidisK04" id="journals/acta/BozapalidisK04">
   <authorgroup>
       <author><firstname>Symeon</firstname><surname>Bozapalidis</surname></author>
       <author><firstname>Antonios</firstname><surname>Kalampakas</surname></author> 
   </authorgroup>
<citetitle pubwork="article">An axiomatization of graphs.</citetitle>
   <citetitle pubwork="journal">Acta Inf.</citetitle>

   <volumenum>41</volumenum> 

   <artpagenums>19-61</artpagenums> 
   <pubdate>2004</pubdate>  

</biblioentry>
<biblioentry xreflabel="conf/dmtcs/BozapalidisK03" id="conf/dmtcs/BozapalidisK03">
   <authorgroup>
       <author><firstname>Symeon</firstname><surname>Bozapalidis</surname></author>
       <author><firstname>Antonios</firstname><surname>Kalampakas</surname></author> 
   </authorgroup>
<citetitle pubwork="article">A Finite Complete Set of Equations Generating Graphs.</citetitle>

   <publisher>
      <publishername>DMTCS</publishername>
   </publisher>
   <volumenum>2731</volumenum> 

   <artpagenums>118-128</artpagenums> 
   <pubdate>2003</pubdate>  

</biblioentry>
<biblioentry xreflabel="journals/eswa/DimoulasKPPK08" id="journals/eswa/DimoulasKPPK08">
   <authorgroup>
       <author><firstname>C.</firstname><surname>Dimoulas</surname></author>
       <author><firstname>G.</firstname><surname>Kalliris</surname></author>
       <author><firstname>G.</firstname><surname>Papanikolaou</surname></author>
       <author><firstname>V.</firstname><surname>Petridis</surname></author>
       <author><firstname>A.</firstname><surname>Kalampakas</surname></author> 
   </authorgroup>
<citetitle pubwork="article">Bowel&#45;sound pattern analysis using wavelets and neural networks with application to long&#45;term&#44; unsupervised&#44; gastrointestinal motility monitoring.</citetitle>
   <citetitle pubwork="journal">Expert Syst. Appl.</citetitle>

   <volumenum>34</volumenum> 

   <artpagenums>26-41</artpagenums> 
   <pubdate>2008</pubdate>  

</biblioentry>
<biblioentry xreflabel="conf/cai/Kalampakas07" id="conf/cai/Kalampakas07">
   <authorgroup>
       <author><firstname>Antonios</firstname><surname>Kalampakas</surname></author> 
   </authorgroup>
<citetitle pubwork="article">The Syntactic Complexity of Eulerian Graphs.</citetitle>

   <publisher>
      <publishername>Springer</publishername>
   </publisher>
   <volumenum>4728</volumenum> 

   <artpagenums>208-217</artpagenums> 
   <pubdate>2007</pubdate>  

</biblioentry>
</bibliography>
