AAA

@inproceedings{AazSti07,
  author    = {A. Aazami and
               M. D. Stilp},
  title     = {Approximation Algorithms and Hardness for Domination with
               Propagation},
 booktitle     = {Approximation, Randomization, and Combinatorial 
Optimization.
               Algorithms and Techniques, 10th International Workshop,
               APPROX 2007, and 11th International Workshop, RANDOM 2007},
 publisher = {Springer},
  series    = {LNCS},
  volume    = {4627},
  year      = {2007},
  pages     = {1--15},
  
}
@INPROCEEDINGS{AbdAbb97,
	AUTHOR = "K. A. S. Abdel-Ghaffar and A. El Abbadi",
	TITLE = "Optimal allocation of two-dimensional data",
	BOOKTITLE = "ICDT'97",
	YEAR = 1997,
	month = "",
	volume = "1186",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "409--418",
	address = "",
	organization = "",
	copy = ""
}

@InProceedings{Abe88,
  author =       "N. Abe",
  title =        "Polynomial Learnability and Locality of Formal
                 Grammars",
  year =         "1988",
  booktitle =    "Proceedings of the 26$^{~th}$ ACL",
  pages =        "225--232",
}

@InProceedings{Abe88a,
  author =       "N. Abe",
  title =        "Feasible Learnability for Formal Grammars and the
                 Theory of Natural Language Acquisition",
  year =         "1988",
  booktitle =    "Proceedings of the 12$^{~th}$ COLING",
  address =      "Budapest, Hungary",
  pages =        "1--6",
}


@Article{AbiCluMil95,
  author =       "S. Abiteboul and S. Cluet and T. Milo",
  title =        "A database interface for file update",
  journal =      "SIGMOD Record (ACM Special Interest Group on
                 Management of Data)",
  volume =       "24",
  number =       "2",
  pages =        "386--397",
  month =        jun,
  year =         "1995",
  coden =        "SRECD8",
  ISSN =         "0163-5808",
}

@InProceedings{AbiCluMil97a,
  title =        "Correspondence and Translation for Heterogeneous
                 Data",
  author =       "S. Abiteboul and S. Cluet and T. Milo",
  booktitle =    "Database Theory---{ICDT}'97, 6th International
                 Conference",
  editor =       "F. N. Afrati and Ph. Kolaitis",
  address =      "Delphi, Greece",
  month =        "8--10~" # jan,
  year =         "1997",
  series =       "Lecture Notes in Computer Science",
  volume =       "1186",
  publisher =    "Springer",
  pages =        "351--363",
}

@ARTICLE{Abretal87,
	AUTHOR = "J. A. Abraham and others",
	TITLE = "Fault tolerance techniques for systolic arrays",
	JOURNAL = ieeecomp,
	YEAR = 1987,
	month = jul,
	volume = "",
	number = "",
	pages = "65--75",
	copy = ""
}

@ARTICLE{Abr65,
	AUTHOR= "S. \'Abrah\'am",
	TITLE= "Some questions of phrase-structure grammars {I.}",
	JOURNAL= "Comput. Linguistics",
	YEAR= 1965,
	month= "",
	volume= 4,
	number= "",
	pages= "61--70",
}

 @ARTICLE{Abr72,
	   AUTHOR = "S. Abraham",
	   TITLE = "Compound and serial grammars",
	   JOURNAL = icalt,
	   YEAR = 1972,
	   VOLUME = 20,
	   NUMBER = "",
	   PAGES = "432--438",
	   copy = ""
 }

@InProceedings{AbrDowFel93, 
 author ="K. A. Abrahamson and R. G. Downey and M. R. Fellows", 
 title = "Fixed-Parameter Intractability {II}", 
 booktitle="STACS: Annual Symposium on Theoretical Aspects of Computer Science", 
 year="1993", 
		  series ="LNCS",
pages="374--385"
} 
		  
@Article{AbrDowFel95, 
 author ="K. A. Abrahamson and R. G. Downey and M. R. Fellows", 
 title = "Fixed-Parameter Tractability and Completeness {IV}: On Completeness for {W}[{P}] and
         {PSPACE} Analogues", 
 journal= apal,
 volume= "73", 
 year = "1995", 
} 

@INCOLLECTION{AbrCaiGor97,
        AUTHOR = "K. Abrahamson and L. Cai and S. Gordon",
        TITLE = "A grammar characterization of logarithmic-space computation",
	BOOKTITLE = "New Trends in Formal Languages",
	PUBLISHER = "Berlin: Springer",
	YEAR = 1997,
	month = "",
	volume = "1218",
	editor = "Gh. P\u aun and A. Salomaa",
	series = "LNCS",
	chapter = "",
	pages = "247--255",
	address = "",
	type = "",
	copy = ""
}

@inproceedings{Abuetal2004,
  author    = {F. N. Abu-Khzam and
               R. L. Collins and
               M. R. Fellows and
               M. A. Langston and
               W. H. Sutters and
               C. T. Symons},
  title     = {Kernelization Algorithms for the Vertex Cover Problem: Theory
               and Experiments},
  year      = {2004},
  pages     = {62--69},
  editor    = {L. Arge and
               G. F. Italiano and
               R. Sedgewick},
  booktitle     = {Proceedings of the Sixth Workshop on Algorithm Engineering
               and Experiments and the First Workshop on Analytic Algorithmics
               and Combinatorics, New Orleans, LA, USA, January 10, 2004},
  publisher = {SIAM},


}

@INPROCEEDINGS{AbuLan2004,
	AUTHOR = "F. Abu-Khzam and M. Langston",
	TITLE = "A direct algorithm for the parameterized face cover problem",
	BOOKTITLE = "International Workshop on Parameterized and Exact
Computation IWPEC 2004",
	YEAR = 2004,
	month = "",
	volume = "3162",
	editor = "R. Downey and M. Fellows and F. Dehne",
	series = "LNCS",
	chapter = "",
	pages = "213--222",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{AbuFerLan2005,
	AUTHOR = "F. Abu-Khzam and H. Fernau and M. A. Langston",
	TITLE = "Asymptotically faster algorithms for parameterized face cover",
	BOOKTITLE = "Algorithms and Complexity in Durham ACiD 2005",
	YEAR = 2005,
	month = "",
	volume = "4",
	editor = "H. Broersma and M. Johnson and S. Szeider",
	series = "Texts in Algorithmics",
	chapter = "",
	pages = "43--58",
	address = "",
	organization = "",
        publisher = "King's College Publications",
	copy = ""
}

@INPROCEEDINGS{AbuFer2006,
	AUTHOR = "F. Abu-Khzam and H. Fernau",
	TITLE = "Kernels: annotated, proper and induced",
	BOOKTITLE = "International Workshop on Parameterized and Exact Computation IWPEC",
	YEAR = 2006,
	month = "",
	volume = "4169",
	editor = "H. L. Bodlaender and M. Langston",
	series = "LNCS",
	chapter = "",
	pages = "264--275",
	address = "",
	organization = "",
        publisher = "Springer", 
	copy = ""
}

@ARTICLE{AbuFer2006a,
	AUTHOR = "F. Abu-Khzam and H. Fernau",
	TITLE = "Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs",
	JOURNAL = {Electronic Notes in Discrete Mathematics},
	YEAR = 2006,
	month = "",
	volume = 25,
	number = "",
	pages = "1--6",
	copy = ""
}

@INPROCEEDINGS{AbuLan2005,
	AUTHOR = "F. Abu-Khzam and M. A. Langston",
	TITLE = "Linear-Time Algorithms for 
Planar Graphs of Fixed Disk Dimension",
	BOOKTITLE = "Algorithms and Complexity in Durham ACiD 2005",
	YEAR = 2005,
	month = "",
	volume = "4",
	editor = "H. Broersma and M. Johnson and S. Szeider",
	series = "Texts in Algorithmics",
	chapter = "",
	pages = "59--67",
	address = "",
	organization = "",
        publisher = "King's College Publications",
	copy = ""
}
@inproceedings{Abu2007,
  author    = {F.~N. Abu-Khzam},
  title     = {Kernelization Algorithms for $d$-Hitting Set Problems},
  booktitle = {Workshop on Algorithms and Data Structures WADS},
  year      = {2007},
  pages     = {434--445},
  editor    = {F. K. H. A. Dehne and
               J.-R. Sack and
               N. Zeh},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4619},
  year      = {2007},
}

@INPROCEEDINGS{AccAnc99,
	AUTHOR = "A. Accornero and M. Ancona",
	TITLE = "All separating triangles in a plane graph can be optimally ``broken'' in polynomial time",
	BOOKTITLE = "Preproceedings WG'99",
	YEAR = 1999,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "289--296",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@Article{AchBad92,
author          ="A. Acharya and B. R. Badrinath",
title           ="Recording distributed snapshots based on causal order of
                 message delivery",
journal         = ipl,
volume          ="44",
number          ="6",
pages           ="317--21",
month           ="28 " # dec,
year            ="1992",
}


@INPROCEEDINGS{Adaetal02,
	AUTHOR = "U. Adamy and C. Ambuehl and R. S. Anand and T. Erlebach",
	TITLE = "Call Control in Rings",
	BOOKTITLE = "Proceedings of 29th International Colloquium on Automata, Languages and Programming ICALP 2002",
	YEAR = 2002,
	month = "",
	volume = "2380",
	editor = "P. Widmayer and others",
	series = "LNCS",
	chapter = "",
	pages = "788--799",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

		  
@ARTICLE{Adletal83,
	AUTHOR = "R. Adler and others",
	TITLE = "Algorithms for sliding block codes",
	JOURNAL = ieeetoit,
	YEAR = 1983,
	month = "",
	volume = 29,
	number = "",
	pages = "5--22",
	copy = ""
}

@ARTICLE{AdoHu73,
	AUTHOR = "D. Adolphson and T. C. Hu",
	TITLE = "Optimal linear orderings",
	JOURNAL = siamam,
	YEAR = 1973,
	month = "",
	volume = 25,
	number = "",
	pages = "403--423",
	copy = ""
}

@Article{Ado77,
title={Single Machine Job Sequencing with Precedence Constraints},
author={D. L. Adolphson},
pages={40--54},
journal=siam,
year=1977,
volume=6,
}

@ARTICLE{AdrZaa2004,
	AUTHOR = "P. Adriaans and M. van Zaanen",
	TITLE = "Computational Grammar Induction for Linguists",
	JOURNAL = {GRAMMARS},
	YEAR = 2004,
	month = "",
	volume = 7,
	number = "",
	pages = "57--68",
	copy = ""
}


 @INBOOK{AfrPap84,
	   AUTHOR = "F. Afrati and H. Papadimitriou and G. Papageorgiou",
	   TITLE = "The complexity of cubical graphs",
	   PAGES = "51--57",
	   PUBLISHER = "Berlin: Springer",
	   YEAR = "1984",
	   VOLUME = 172,
	   SERIES = "LNCS",
	   copy = "auch erschienen in IC 66 (1985), 53--60; Corrigendum IC 82 (1989),3, 350--353"
 }



 @ARTICLE{Aho68,
	   AUTHOR = "A. V. Aho",
	   TITLE = "Indexed grammars - an extension of context-free grammars",
	   JOURNAL = jacm,
	   YEAR = 1968,
	   VOLUME = 15,
	   NUMBER = 4,
	   PAGES = "647--671",
	   copy = ""
 }

@ARTICLE{AhoUll68,
	AUTHOR = "A. V. Aho and J. D. Ullman",
	TITLE = "The theory of languages",
	JOURNAL = mst,
	YEAR = 1968,
	month = "",
	volume = 2,
	number = "",
	pages = "97--125",
	copy = ""
}

 @ARTICLE{AhoUll70,
	   AUTHOR = "A. V. Aho and J. D. Ullman",
	   TITLE = "A characterization of two-way deterministic classes of languages",
	   JOURNAL = jcss,
	   YEAR = 1970,
	   VOLUME = 4,
	   NUMBER = "",
	   PAGES = "523--538",
	   copy = ""
 }


 @ARTICLE{AhoUllHop70,
	   AUTHOR = "A. V. Aho and J. D. Ullman and J. E. Hopcroft",
	   TITLE = "On the computational power of pushdown automata",
	   JOURNAL = jcss,
	   YEAR = 1970,
	   VOLUME = 4,
	   NUMBER = "",
	   PAGES = "129--136",
	   copy = ""
 }


@Inproceedings{AhoUllYan79,
	AUTHOR = "A. V. Aho and J. D. Ullman and M. Yannakakis",
	TITLE = "Modeling communication protocols by automata",
	BOOKTITLE = "Proc. 20th Symp. Foundations Comput. Sci.",
	YEAR = 1979,
	month = oct,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "267--273",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{AhoJohUll75,
	AUTHOR = "A. V. Aho and S. C. Ullman",
	TITLE = "Deterministic parsing of ambiguous grammars",
	JOURNAL = cacm,
	YEAR = 1975,
	month = "",
	volume = 18,
	number = "8",
	pages = "441--452",
	copy = ""
}


@Article{Ahoetal82,
  author =       "A. V. Aho and J. D. Ullman and A. D. Wyner and M.
                 Yannakakis",
  title =        "Bounds on the size and transmission rate of
                 communication protocols",
  journal =      "Computers and Mathematics with Applications",
  volume =       "8",
  number =       "3",
  year =         "1982",
  pages =        "205--214",
}


@TECHREPORT{Ahoetal97,
	AUTHOR = "I. Aho and H. Kemppainen and K. Koskimies and E. M{\"a}kinen and T. Niemi",
	TITLE = "Searching neural network structures with {L} systems and genetic algorithms",
	INSTITUTION = "Department of Computer Science, University of Tampere, Finland",
	YEAR = 1997,
	month = "",
	number = "A-1997-15",
	address = "",
	copy = ""
}

  
@ARTICLE{Aho2000,
	AUTHOR = "I. Aho",
	TITLE = "Interactive knapsacks",
	JOURNAL = fundinform,
	YEAR = 2000,
	month = "",
	volume = 44,
	number = "",
	pages = "1--23",
	copy = ""
}


@INPROCEEDINGS{Aho2001,
  AUTHOR = "I. Aho",
        TITLE = "On the approximability of interactive knapsack problems",
	BOOKTITLE = "SOFSEM'01; Theory and Practice of Informatics",
	YEAR = 2001,
	month = "",
	volume = "",
	editor = "L. Pacholski and P. Ru{\v z}i{\v c}ka",
	series = "LNCS",
	chapter = "",
	pages = "152--159",
	address = "",
	organization = "",
        publisher = "Springer", 
	copy = ""
}

@Article{Ahoetal99,
  AUTHOR = "I. Aho and H. Kemppainen and K. Koskimies
and E. M{\"a}kinen and T. Niemi",
  TITLE = "Searching neural network
structures with {L} systems and genetic algorithms",
  journal = ijcm,
  volume =       "73",

number =       "1",
  year =         "1999",
  pages =        "55--75",
}


@INPROCEEDINGS{Aho96a,
	AUTHOR = "H. Ahonen",
	TITLE = "Automatic generation of {SGML} content models",
	BOOKTITLE = "Electronic Publishing '96 (Palo Alto, California, USA)",
	YEAR = 1996,
	month = sep,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{Aho96,
	AUTHOR = "H. Ahonen",
	TITLE = "Disambiguation of {SGML} content models",
	BOOKTITLE = "Principles of Document Processing PODP'96",
	YEAR = 1997,
	month = "",
	volume = "1293",
	editor = "C. Nicholas and D. Wood",
	series = "LNCS",
	chapter = "",
	pages = "27--37",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{AhoHeiHeiKle97,
	AUTHOR = "H. Ahonen  and B. Heikkinen and O. Heinonen and M. Klemettinen",
	TITLE = "Improving the
      accessibility of {SGML} documents - A content-analytical approach",
	BOOKTITLE = "SGML Europe'97 (Barcelona, Spain)",
	YEAR = 1997,
	month = may,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = ""
}

@TECHREPORT{AhoHeiKleVer97,
	AUTHOR = "H. Ahonen  and O. Heinonen and M. Klemettinen and I.  Verkamo",
	TITLE = "Applying Data
      Mining Techniques in Text Analysis",
	INSTITUTION = "University of Helsinki, Department of Computer Science",
	YEAR = 1997,
	month = mar,
	number = "C-1997-23",
	address = "",
	copy = "", note = {Appeared IN:
A. Hameurlain, A. Min Tjoa: Database and Expert Systems Applications, 8th International Conference, DEXA '97,
Toulouse, France, September 1-5, 1997, Proceedings. LNCS, Vol. 1308, pages 419--429}
}

@INPROCEEDINGS{AhoHeiKleVer97a,
	AUTHOR = "H. Ahonen  and O. Heinonen and M. Klemettinen and I.  Verkamo",
	TITLE = "Mining in the Phrasal Frontier",
	BOOKTITLE = "1st European Symposium on Principles of Data Mining and Knowledge Discovery
      (PKDD'97)",
	YEAR = 1997,
	month = jun,
	volume = "1263",
	editor = "H. J. Komorowski and J. M. Zytkow",
	series = "LNCS",
	chapter = "",
	pages = "343--350",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{AhoManNik97,
	AUTHOR = "H. Ahonen and H. Mannila and E. Nikunen",
	TITLE = "Generating grammars for {SGML} tagged text lacking {DTD}",
	JOURNAL = {Mathematical and Computer Modelling},
	YEAR = 1997,
	month = "",
	volume = 26,
	number = "",
	pages = "1--13",
	copy = ""
}

@INPROCEEDINGS{AhoHeiHeiKle2000,
	AUTHOR = "H. Ahonen-Myka and B. Heikkinen and O. Heinonen and M. Klemettinen",
	TITLE = "Printing Structured Text without Stylesheets",
	BOOKTITLE = "XML Scandinavia (Gothenburg, Sweden)",
	YEAR = 2000,
	month = may,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{Ahuetal2002,
	AUTHOR = "R. Ahuja and {\"O}. Ergun and J. Orlin and A. Punnen",
	TITLE = "A survey of very large-scale neighborhood search techniques",
	JOURNAL = dam,
	YEAR = 2002,
	month = "",
	volume = 123,
	number = "",
	pages = "75--102",
	copy = ""
}


@inproceedings{AikMur91,
    author = "A. Aiken and B.~R. Murphy",
    title = "Static Type Inference in a Dynamically Typed Language",
    booktitle = "Conference Record of the Eighteenth Annual {ACM} Symposium on Principles of Programming Languages",
    address = "Orlando, Florida",
    pages = "279--290",
    year = "1991",
    url = "citeseer.nj.nec.com/aiken91static.html" }

@inproceedings{AilChaNew2005,
 author = {N. Ailon and M. Charikar and A. Newman},
 title = {Aggregating inconsistent information: ranking and clustering},
 booktitle = {STOC '05: Proceedings of the thirty-seventh annual ACM Symposium on Theory of Computing},
 year = {2005},
 pages = {684--693},
 publisher = {ACM},
 }

@ARTICLE{AizNak86,
	AUTHOR = "K. Aizawa and A. Nakamura",
	TITLE = "Direction-independent application of productions on
		  two-dimensional arrays",
	JOURNAL = ipl,
	YEAR = 1986,
	month = "",
	volume = 22,
	number = "",
	pages = "295--301",
	copy = ""
}


@TECHREPORT{Aksetal2000,
	AUTHOR = "V. A. Aksionov and  O. V. Borodin and L. S. Mel'nikov and G.  Sabidussi and M. Stiebitz and B. Toft",
	TITLE = "Deeply asymmetric planar graphs",
	INSTITUTION = "University of Southern Denmark, IMADA",
	YEAR = 2000,
	month = sep,
	number = "PP--2000--14",
	address = "Odense, Denmark",
	copy = ""
}



@INPROCEEDINGS{AkuHal94,
	AUTHOR = "T. Akutsu and M. M. Halldorson",
	TITLE = "On the approximation of largest common subtrees and largest common point sets",
	BOOKTITLE = "Proc. 5th International Symposium on Algorithms and Computation (ISAAC'94)",
	YEAR = 1994,
	month = "",
	volume = "834",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "405--413",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

 @ARTICLE{Ala74,
	 AUTHOR = "V. Aladyev",
	 TITLE = "{\mbox{$\tau_n$}}-{\cyr grammatiki i porozhdaemye imi yazyki}",
	 JOURNAL = transasestbio,
	 YEAR = 1974,
	 VOLUME = 23,
	 NUMBER = "1",
	 PAGES = "67--87",
	 copy = ""
 }


@ARTICLE{Ala74a,
	AUTHOR = "V. Aladyev",
	TITLE = "{{\cyr Operatsii nad yazykami, generiruemym }
$\tau_n$-{\cyr grammatikam}}, Operations on languages generated by
{$\tau_n$}-grammars (in Russian)",
	JOURNAL = "Commentationes Mathematicae Universitatis Carolinae",
	YEAR = 1974,
	month = "",
	volume = 15,
	number = "",
	pages = "211--220",
	copy = ""
}


@ARTICLE{Ala74b,
	AUTHOR = "V. Aladyev",
	TITLE = "{{\cyr Ob ekvivalentnosti } $\tau_m$-{\cyr grammatik
i} Sb$(n)$-{\cyr grammatik}}, On equivalence of
{$\tau_m$}-grammars and Sb(n)-grammars (in Russian)",
	JOURNAL = "Commentationes Mathematicae Universitatis Carolinae",
	YEAR = 1974,
	month = "",
	volume = 15,
	number = "",
	pages = "717--726",
	copy = ""
}

@Article{AlaVen94,
author          ="S. Alagar and S. Venkatesan",
title           ="An optimal algorithm for distributed snapshots with causal
                 message ordering",
journal         = ipl,
volume          ="50",
number          ="6",
pages           ="311--316",
month           ="27 " # jun,
year            ="1994",
}

@inproceedings{Alaetal2008,
  author    = {Md. J. Alam and
               Md. A. Samee and
               Md. M. Rabbi and
               Md. S. Rahman},
  title     = {Upward Drawings of Trees on the Minimum Number of Layers},
  booktitle = {Workshop on Algorithms and Computation: WALCOM},
  pages     = {88--99},
  editor    = {S.-I. Nakano and
               Md. S. Rahman},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4921},
  year      = {2008},
}


@ARTICLE{Alb01,
	AUTHOR = "J. Alber",
	TITLE = "On implemented semigroups",
	JOURNAL = {Semigroup Forum},
	YEAR = 2001,
	month = "",
	volume = 63,
	number = "",
	pages = "371--386",
	copy = ""
}

@PHDTHESIS{Alb02,
	AUTHOR = "J. Alber",
	TITLE = "Exact Algorithms for {NP}-hard Problems on Networks: Design,
Analysis, and Implementation",
	SCHOOL = "Universit{\"a}t T{\"u}bingen",
	YEAR = 2002,
 	month = "",
	address = "",
	type = "Dissertation",
	copy = ""
}

@INPROCEEDINGS{Albetal2000,
	AUTHOR = "J. Alber and H. L. Bodlaender and H. Fernau and R. Niedermeier",
	TITLE = "Fixed parameter algorithms for planar dominating set and related problems",
	BOOKTITLE = "7th Scandinavian Workshop on Algorithm Theory SWAT 2000",
	YEAR = 2000,
	month = "",
	volume = "1851",
	editor = "M.~M. Halld\'orsson",
	series = "LNCS",
	chapter = "",
	pages = "97--110",
	address = "",
	organization = "",
	copy = ""
}

@techreport{Albetal2000a,
author = {J. Alber and H. L. Bodlaender and H. Fernau and R. Niedermeier},
title = {Fixed parameter algorithms for {\sc Planar Dominating Set} and
related problems},
institution = {Institute for Information and Computing Sciences, Utrecht
University},
address = {Utrecht, the Netherlands},
type = {Technical Report},
number = {UU-CS-2000-28},
year = 2000
}


@ARTICLE{AlbDorNie03,
	AUTHOR = "J. Alber and F. Dorn and R. Niedermeier",
	TITLE = "Experimental evaluation of a tree decomposition algorithm for vertex cover on planar graphs",
	JOURNAL = dam,
	YEAR = 2003,
	month = "",
	volume = {To appear},
	number = "",
	pages = "--",
	copy = ""
}


@ARTICLE{AlbDorNie2005,
	AUTHOR = "J. Alber and F. Dorn and R. Niedermeier",
	TITLE = "Experimental evaluation of a tree decomposition based algorithm for vertex cover on planar graphs",
	JOURNAL = dam,
	YEAR = 2005,
	month = "",
	volume = 145,
	number = "",
	pages = "219--231",
	copy = ""
}

@INPROCEEDINGS{AlbFelNie02,
	AUTHOR = "J. Alber and M.~R. Fellows and R. Niedermeier",
	TITLE = "Efficient data reduction for {\sc dominating set}: a linear problem kernel for the planar case",
	BOOKTITLE = "SWAT 2002",
	YEAR = 2002,
	month = "",
	volume = "2368",
	editor = "M. Penttonen and E. Meineche Schmidt",
	series = "LNCS",
	chapter = "",
	pages = "150--159",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}
@article{AlbFelNie2004,
 author = {J. Alber and M. R. Fellows and R. Niedermeier},
 title = {Polynomial-time data reduction for dominating set},
 journal = jacm,
 volume = {51},
 number = {3},
 year = {2004},
 pages = {363--384},
 }


@techreport{AlbFerNie01,
  author = 	 {J. Alber and H. Fernau and R. Niedermeier},
  title = 	 {Graph separators: a parameterized view},
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
	number = "WSI--2001--8",
month = "March",
  year = 	 {2001},
}


@TechReport{AlbFerNie01a,
  author = 	 {J. Alber and H. Fernau and R. Niedermeier},
  title = 	 {Parameterized complexity: exponential speedup for planar graph problems},
  institution =  {ECCC Reports, Trier}, number = {TR01--023},
  month =        {March},
  year = 	 {2001},
}


@INPROCEEDINGS{AlbFerNie01b,
	AUTHOR = "J. Alber and H. Fernau and R. Niedermeier",
	TITLE = "Parameterized complexity: exponential speedup for planar graph problems",
	BOOKTITLE = "International Colloquium on Automata, Languages
and Programming ICALP'01",
	YEAR = 2001,
	month = "",
	volume = "2076",
	editor = "F. Orejas and P.~G. Spirakis and J.~v. Leeuwen",
	series = "LNCS",
	chapter = "",
	pages = "261--272",
	address = "",
	organization = "",
        publisher = "Springer"
}


@INPROCEEDINGS{AlbFerNie01c,
	AUTHOR = "J. Alber and H. Fernau and R. Niedermeier",
	TITLE = "Graph separators: a parameterized view",
	BOOKTITLE = "Computing and Combinatorics, Proceedings COCOON 2001",
	YEAR = 2001,
	month = "",
	volume = "2108",
	editor = "J. Wang",
	series = "LNCS",
	chapter = "",
	pages = "318--327",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@ARTICLE{AlbFerNie03,
	AUTHOR = "J. Alber and H. Fernau and R. Niedermeier",
	TITLE = "Graph separators: a parameterized view",
	JOURNAL = jcss,
	YEAR = 2003,
	month = "",
	volume = 67,
	number = "",
	pages = "808--832",
	copy = ""
}


@INPROCEEDINGS{Albetal01,
	AUTHOR = "J. Alber and H. Fan and M.~R. Fellows and H. Fernau and R. Niedermeier and F. Rosamond and U. Stege",
	TITLE = "Refined search tree techniques for the {\sc planar dominating set} problem",
	BOOKTITLE = "Mathematical
Foundations of Computer Science (MFCS 2001)",
	YEAR = 2001,
	month = "",
	volume = "2136",
	editor = "J. Sgall and A. Pultr and P. Kolman",
	series = "LNCS",
	chapter = "",
	pages = "111--122",
	address = "", note = {Long version to appear in }#jcss,
	organization = "",
        publisher = "Springer",
	copy = ""
}


@ARTICLE{Albetal02,
	AUTHOR = "J. Alber and H. L. Bodlaender and H. Fernau and T. Kloks and R. Niedermeier",
	TITLE = "Fixed parameter algorithms for {\sc dominating set} and related problems on  planar graphs",
	JOURNAL = alg,
	YEAR = 2002,
	month = "",
	volume = 33,
	number = "",
	pages = "461--493",
	copy = ""
}


@ARTICLE{AlbGraNie2001,
	AUTHOR = "J. Alber and J. Gramm and R. Niedermeier",
	TITLE = "Faster exact algorithms for hard problems: a parameterized point of view",
	JOURNAL = dm,
	YEAR = 2001,
	month = "",
	volume = 229,
	number = "1",
	pages = "3--27",
	copy = ""
}


@ARTICLE{AlbNie2000,
	AUTHOR = "J. Alber and R. Niedermeier",
	TITLE = "On multidimensional curves with {H}ilbert property",
	JOURNAL = tocs,
	YEAR = 2000,
	month = "",
	volume = 33,
	number = "",
	pages = "295--312",
	copy = ""
}

@ARTICLE{AlbFerNie2004,
	AUTHOR = "J. Alber and H. Fernau and R. Niedermeier",
	TITLE = "Parameterized complexity: exponential speedup for planar graph problems",
	JOURNAL = jalg,
	YEAR = 2004,
	month = "",
	volume = 52,
	number = "",
	pages = "26--56",
	copy = ""
}

@ARTICLE{AlbFia2004,
	AUTHOR = "J. Alber and J. Fiala",
	TITLE = "Geometric separation and exact solutions for the parameterized independent set problem on disk graphs",
	JOURNAL = jalg,
	YEAR = 2004,
	month = "",
	volume = 52,
	number = "",
	pages = "134--151",
	copy = ""
}

@ARTICLE{Albetal05,
	AUTHOR = "J. Alber and H. Fan and M.~R. Fellows and H. Fernau and R. Niedermeier and F. Rosamond and U. Stege",
	TITLE = "A refined search tree techniques for {\sc dominating set} on  planar graphs",
	JOURNAL = jcss,
	YEAR = 2005,
	month = "",
	volume = 71,
	number = "",
	pages = "385--405",
	copy = ""
}

@ARTICLE{AlbBetNie2006,
	AUTHOR = "J. Alber and N. Betzler and R. Niedermeier",
	TITLE = "Experiments on data reduction for optimal domination in networks",
	JOURNAL = {Annals of Operations Research},
	YEAR = 2006,
	month = "",
	volume = 146,
	number = "",
	pages = "105--117",
	copy = ""
}


@INPROCEEDINGS{AlbDorNie2006,
	AUTHOR = "J. Alber and B. Dorn and R. Niedermeier",
	TITLE = "A general data reduction scheme for domination in graphs",
	BOOKTITLE = "Software
Seminar SOFSEM",
	YEAR = 2006,
	month = "",
	volume = "3831",
	editor = "J. {\v S}tuller and J. Wiedermann and G. Tel and J. Pokorn\'y  and M. Bielikov\'a",
	series = "LNCS",
	chapter = "",
	pages = "137--147",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{AlbOKe81,
	AUTHOR = "M.~O. Albertson and C.~J. O'Kefe",
	TITLE = "Covering regions with squares",
	JOURNAL = {SIAM J. Algebraic Discrete Methods},
	YEAR = 1981,
	month = "",
	volume = 2,
	number = "",
	pages = "240--243",
	copy = ""
}



@ARTICLE{AleDji96,
	AUTHOR = "L. G. Aleksandrov and H. N. Djidjev",
	TITLE = "Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus",
	JOURNAL = siamdm,
	YEAR = 1996,
	month = "",
	volume = 9,
	number = "",
	pages = "129--150",
	copy = ""
}

@INPROCEEDINGS{AleDji2000,
	AUTHOR = "L. G. Aleksandrov and H. N. Djidjev",
	TITLE = "A Dynamic algorithm for maintaining graph partitions",
	BOOKTITLE = "Scandinavian Workshop on Algorithm Theory (SWAT'00)",
	YEAR = 2000,
	month = "",
	volume = "1851",
	editor = "M. M. Halld\'orsson",
	series = "LNCS",
	chapter = "",
	pages = "71--82",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}



@TECHREPORT{AleKorZve02,
	AUTHOR = "V. E. Alekseev and D. V. Korobitsyn and I. E. Zverovich",
	TITLE = "Boundary classes of graphs for the dominating set problem",
	INSTITUTION = "Rutgers University",
	YEAR = 2001,
	month = sep,
	number = "RRR 25-2002",
	address = "",
	note = {appeared in} # dm #{vol. 285, 1--6, 2004}
}



@INPROCEEDINGS{Aleetal95,
	AUTHOR = "A. Alexandrov and others",
	TITLE = "{LogGP}: incorporating long messages into the {LoGP} model",
	BOOKTITLE = "SPAA'95",
	YEAR = 1995,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "??",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{AllLan98,
	AUTHOR = "E. Allender and K.-J. Lange",
	TITLE = "{$Ruspace(\log n)\subseteq DSPACE(\log^2n/\log\log n)$}",
	JOURNAL = tocs,
	YEAR = 1998,
	month = "",
	volume = 31,
	number = "",
	pages = "539--550",
	copy = ""
}



@TECHREPORT{Alletal2004,
	AUTHOR = "E. Allender and M. Bauland and N. Immerman and H. Schnoor and H. Vollmer",
	TITLE = "The Complexity of Satisfiability Problems: Refining Schaefer's Theorem",
	INSTITUTION = "Electronic Colloqium on Computational Complexity ECCC",
	YEAR =  2004,
	month = "",
	number = "TR04-100",
	address = "",
	copy = ""
}


@InProceedings{AllCheCre88,
  title =        "Breadth-First Phrase Structure Grammars and Queue
                 Automata",
  author =       "E. Allevi and A. Cherubini and S.
                 Crespi-Reghizzi",
  booktitle =    "Mathematical Foundations of Computer Science MFCS 1988",
  editor =       "M. P. Chytil and L. Janiga and V.
                 Koubek",
  year =         "1988",
  series =       "LNCS",
  volume =       "324",
  publisher =    "Springer",
  pages =        "162--170",
}


@ARTICLE{All89,
	AUTHOR = "J.-P. Allouche",
	TITLE = "On a sequence of rational functions",
	JOURNAL = tcs,
	YEAR = 1989,
	month = "",
	volume = 65,
	number = "",
	pages = "123--130",
	copy = ""
}



@ARTICLE{AloNao96,
	AUTHOR = "N. Alon and M. Naor",
	TITLE = "Derandomization, witnesses for {B}oolean matrix multiplication and construction of perfect hash functions",
	JOURNAL = alg,
	YEAR = 1996,
	month = "",
	volume = 16,
	number = "",
	pages = "434--449",
	copy = ""
}



@InProceedings{AloSeyTho90,
  title =        "{A separator theorem for graphs with an excluded minor
                 and its applications}",
  author =       "N. Alon and P. D. Seymour and R. Thomas",
  booktitle =    "Proc. 22nd Symp. Theory of Computing",
  publisher =    "Assoc. Comput. Mach.",
  pages =        "293--299",
  year =         "1990",
  abstract =     "Let $G$ be an $n$-vertex graph with nonnegative
                 weights whose sum is $1$ assigned to its vertices, and
                 with no minor isomorphic to a given $h$-vertex graph
                 $H$. The authors prove that there is a set $X$ of no
                 more than $h^{3/2}n^{1/2}$ vertices of $G$ whose
                 deletion creates a graph in which the total weight of
                 every connected component is at most $1/2$. They
                 exhibit an algorithm which finds, given an $n$-vertex
                 graph $G$ with weights as above and an $h$-vertex graph
                 $H$, either such a set $X$ or a minor of $G$ isomorphic
                 to $H$. The algorithm runs in time
                 $O(h^{1/2}n^{1/2}m)$, where $m$ is the number of edges
                 of $G$ plus the number of its vertices. The authors'
                 results supply extensions of the many known
                 applications of the Lipton-Tarjan separator theorem
                 (1979,1980) from the class of planar graphs (or that of
                 graphs with bounded genus) to any class of graphs with
                 an excluded minor. For example, it follows that for any
                 fixed graph $H$, given a graph $G$ with $n$ vertices
                 and with no $H$-minor one can approximate the size of
                 the maximum independent set of $G$ up to a relative
                 error of $1/\sqrt{\log{n}}$ in polynomial time, find
                 that size exactly and find the chromatic number of $G$
                 in time $2^{O(\sqrt{n})}$ and solve any sparse system
                 of $n$ linear equations in $n$ unknowns whose sparsity
                 structure corresponds to $G$ in time $O(n^{3/2})$. They
                 also describe a combinatorial application of the result
                 which relates the tree-width of a graph to the maximum
                 size of a $K_h$-minor in it.",
}


@ARTICLE{AloSeyTho90a,
	AUTHOR = "N.~Alon and P.~D. Seymour and R.~Thomas.",
	TITLE = "A separator theorem for nonplanar graphs",
	JOURNAL =  {Journal of the AMS},
	YEAR = 1990,
	month = "",
	volume = {3},
	number = "",
	pages = "801--808",
	copy = ""
}

@ARTICLE{Aloetal92,
	AUTHOR = "N. Alon and O. Goldreich and J. Hastad and R. Peralta",
	TITLE = "Simple constructions of almost $k$-wise independent random variables",
	JOURNAL = {Random Structures and Algorithms},
	YEAR = 1992,
	month = "",
	volume = 3,
	number = "",
	pages = "289--304",
	copy = ""
}



@ARTICLE{AloYusZwi95,
	AUTHOR = "N. Alon and R. Yuster and U. Zwick",
	TITLE = "Color-coding",
	JOURNAL = jacm,
	YEAR = 1995,
	month = "",
	volume = 42,
	number = "4",
	pages = "844--856",
	copy = ""
}

@ARTICLE{Alo2003,
	AUTHOR = "N. Alon",
	TITLE = "Problems and results in extremal combinatorics---{I}",
	JOURNAL = dm,
	YEAR = 2003,
	month = "",
	volume = 273,
	number = "",
	pages = "31--53",
	copy = ""
}

@inproceedings{Alpetal97,
  author    = {C. J. Alpert and
               T. F. Chan and
               D. J.-H. Huang and
               A. B. Kahng and
               I. L. Markov and
               P. Mulet and
               K. Yan},
  title     = {Faster minimization of linear wirelength for global placement},
  booktitle = {International Symposium on Physical Design ISPD},
  year      = {1997},
  pages     = {4--11}, 
organization = "ACM/IEEE"
}
 
@ARTICLE{Als92,
	AUTHOR = "B. Alspach",
	TITLE = "Cayley graphs with optimal fault tolerance",
	JOURNAL = ieeetoc,
	YEAR = 1992,
	month = "",
	volume = 41,
	number = "10",
	pages = "1337--1339",
	copy = ""
}

@ARTICLE{AlsLauTho00,
	AUTHOR = "S. Alstrup and P.~W. Lauridsen and M. Thorup",
	TITLE = "Generalized dominators for structured programs",
	JOURNAL = alg,
	YEAR = 2000,
	month = "",
	volume = 27,
	number = "",
	pages = "244--253",
	copy = ""
}
@inproceedings{Altetal2006,
 author = {H. Alt and E. M. Arkin and H. Br\"{o}nnimann and J. Erickson and S. P. Fekete and C. Knauer and J. Lenchner and J. S. B. Mitchell and K. Whittlesey},
 title = {Minimum-cost coverage of point sets by disks},
 booktitle = {SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry},
 year = {2006},
 pages = {449--458},
 publisher = {ACM},
 address = {New York, NY, USA},
 }


@ARTICLE{AltBan65,
	AUTHOR = "E. Altman and R. Banerji",
	TITLE = "Some problems of finite representability",
	JOURNAL = icalt,
	YEAR = 1965,
	month = "",
	volume = 8,
	number = "",
	pages = "251--263",
	copy = ""
}



@INPROCEEDINGS{AluKanYan99,
	AUTHOR = "R. Alur and S. Kannan and M. Yannakakis",
	TITLE = "Communicating hierarchical state machines",
	BOOKTITLE = "Automata, Languages and Programming 26th ICALP'99",
	YEAR = 1999,
	month = "",
	volume = "1644",
	editor = "J. Wiedermann and P. van Emde Boas and M. Nielsen",
	series = "LNCS",
	chapter = "",
	pages = "169--178",
	address = "",
	organization = "",
	copy = ""

}


@TECHREPORT{AlvGre96,
	AUTHOR = "C. \`Alvarez and R. Greenlaw",
	TITLE = "A Compendium of Problems Complete for Symmetric Logarithmic Space",
	INSTITUTION = "ECCC Trier",
	YEAR = 1996,
	month = "",
	number = "TR96-039",
	address = "{\tt http://www.eccc.uni-trier.de:/pub/eccc/}",
	copy = ""
}


 @ARTICLE{AmaPut64,
   AUTHOR = 	"V. Amar and G. Putzolu",
   TITLE = 	"On a Family of Linear Grammars",
   JOURNAL = 	icalt,
   YEAR = 	"1964",
   VOLUME = 	"7",
   NUMBER = 	"",
   PAGES = 	"283--291",
   MONTH = 	"",
   note = 	""
 }


 @ARTICLE{AmaPut65,
	   AUTHOR = "V. Amar and G. Putzolu",
	   TITLE = "Generalizations of regular events",
	   JOURNAL = icalt,
	   YEAR = 1965,
	   VOLUME = 8,
	   NUMBER = "",
	   PAGES = "56--63",
	   copy = ""
 }

@ARTICLE{Amb2001,
	AUTHOR = "A. Ambainis",
	TITLE = "Probabilistic inductive inference: a survey",
	JOURNAL = tcs,
	YEAR = 2001,
	month = "",
	volume = 264,
	number = "",
	pages = "155--167",
	copy = ""
}


@Article{AmbBar2006,
author = {G. Ambrus and J. Barat},
title = {A contribution to queens graphs: A substitution method},
journal = dm,
year = {2006},
OPTkey = {},
volume = {306},
OPTnumber = {},
pages = {1105--1114},
}

@INBOOK{Amb78,
	AUTHOR = "R. V. Ambartzumian",
	TITLE = "Needles and wedges as tool for integration",
	PAGES = "271--278",
	CHAPTER = "",
	PUBLISHER = "Springer",
	YEAR = 1978,
	month = "",
	address = "",
	volume = 23,
	series = "LNBM",
	type = "",
	copy = ""
}



 @INBOOK{AmbSpi85,
	   AUTHOR = "K. Ambos-Spies",
	   TITLE = "On the relative complexity of subproblems of intractable problems",
	   PAGES = "1--12",
	   PUBLISHER = "Berlin: Springer",
	   YEAR = "1985",
	   VOLUME = 182,
	   SERIES = "LNCS",
	   copy = ""
 }


@UNPUBLISHED{Ami,
        AUTHOR = "J. Amilhastre",
        TITLE = "Complexity of minimum biclique decomposition of bipartite graphs",
        NOTE = "University of Montpellier",
        year = 2002,
	month = "",
	copy = ""
}



@ARTICLE{Anaetal03,
	AUTHOR = "R. S. Anand and T. Erlebach and A. Hall and S. Stefanakos",
	TITLE = "Call control with $k$ rejections",
	JOURNAL = jcss,
	YEAR = 2003,
	month = "",
	volume = 67,
	number = "",
	pages = "707--722",
	copy = ""
}

@ARTICLE{And76,
	AUTHOR = "P. G. Anderson",
	TITLE = "Another proof of the theorem on pattern reproduction
in tesselation structures",
	JOURNAL = jcss,
	YEAR = 1976,
	month = "",
	volume = 12,
	number = "",
	pages = "394--398",
	copy = ""
}


@ARTICLE{Andetal2006,
	AUTHOR = "M. Anderson and C. Barrientos and R.~C. Brigham and J.~R. Carrington and R.~P. Vitray and J. Yellen",
	TITLE = "Maximum-demand graphs for eternal security",
	JOURNAL = {J. Combin. Math. \& Combin. Comput.},
	YEAR = 2006,
	month = "",
	volume = 61,
	number = "",
	pages = "111--128",
	copy = ""
}


@PHDTHESIS{And92,
	AUTHOR = "L. M. Andersson",
	TITLE = "Recursive Construction of Fractals",
	SCHOOL = "Helsinki: Suomalainen Tiedeakatemia",
	YEAR = 1992,
 	month = aug,
	address = "",
	type = "",
	NOTE = "Annales Academiae Scientiarum Fennicae Series A, I.
Mathematica, Dissertationes, 86",
	copy = ""
}

@INPROCEEDINGS{Andetal2004,
	AUTHOR = "K. Andreev and C. Garrod and B. M. Maggs and A. Meyerson",
	TITLE = "Simultaneous Source Location",
	BOOKTITLE = {Approximation, Randomization, and Combinatorial Optimization,    Algorithms and Techniques, 7th International Workshop on
               Approximation Algorithms for Combinatorial Optimization
               Problems, APPROX 2004, and 8th International Workshop on
               Randomization and Computation, RANDOM 2004, Proceedings},
	YEAR = 2004,
	month = "",
	volume = "3122",
	editor = "K. Jansen and S. Khanna and J. D. P. Rolim and D. Ron",
	series = "LNCS",
	chapter = "",
	pages = "13--26",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{AngBor2004,
	AUTHOR = "S. Angelopoulos  and A. Borodin",
	TITLE = "The Power of Priority Algorithms for Facility Location and Set Cover",
	JOURNAL = alg,
	YEAR = 2004,
	month = "",
	volume = 40,
	number = "",
	pages = "271--291",
	copy = ""
}
@ARTICLE{Ang78,
	AUTHOR = "D. Angluin",
	TITLE = "On the complexity of minimum inference of regular sets",
	JOURNAL = icalt,
	YEAR = 1978,
	month = "",
	volume = 39,
	number = "",
	pages = "337--350",
	copy = ""
}


@ARTICLE{Ang80a,
	AUTHOR = "D. Angluin",
	TITLE = "Inductive inference of formal languages from positive data",
	JOURNAL = icalt,
	YEAR = 1980,
	month = "",
	volume = 45,
	number = "",
	pages = "117--135",
	copy = ""
}


@ARTICLE{Ang80,
	AUTHOR = "D. Angluin",
	TITLE = "Finding patterns common to a set of strings",
	JOURNAL = jcss,
	YEAR = 1980,
	month = "",
	volume = 21,
	number = "",
	pages = "46--62",
	copy = ""
}


@ARTICLE{Ang81,
	AUTHOR = "D. Angluin",
	TITLE = "A note on the number of queries needed to identify regular languages",
	JOURNAL = icalt,
	YEAR = 1981,
	month = "",
	volume = 51,
	number = "",
	pages = "76--87",
	copy = ""
}


@ARTICLE{Ang82,
	AUTHOR = "D. Angluin",
	TITLE = "Inference of reversible languages",
	JOURNAL = jacm,
	YEAR = 1982,
	month = "",
	volume = 29,
	number = "3",
	pages = "741--765",
	copy = ""
}



@ARTICLE{AngSmi83,
	AUTHOR = "D. Angluin and C.H. Smith",
	TITLE = "Inductive inference: theory and methods",
	JOURNAL = {ACM Computing Surveys},
	YEAR = 1983,
	month = "",
	volume = 15,
	number = "3",
	pages = "237--269",
	copy = ""
}

@ARTICLE{Ang87,
	AUTHOR = "D. Angluin",
	TITLE = "Learning regular sets from queries and counterexamples",
	JOURNAL = icneu,
	YEAR = 1987,
	month = "",
	volume = 75,
	number = "",
	pages = "87--106",
	copy = ""
}


@INPROCEEDINGS{Ang89, 
        AUTHOR = "D. Angluin", 
        TITLE = "Equivalence queries and approximate fingerprints", 
        BOOKTITLE = "Proc. 2nd Workshop of Computational Learning Theory COLT", 
        YEAR = 1989, 
        month = "", 
        volume = "", 
        editor = "", 
        series = "", 
        chapter = "", 
        pages = "134--145", 
        address = "", 
        organization = "", 
        copy = "" 
} 


@INPROCEEDINGS{Ang92,
	AUTHOR = "D. Angluin",
	TITLE = "Computational learning theory: survey and selected bibliography",
	BOOKTITLE = "Proc. 24th STOC'92",
	YEAR = 1992,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "351--369",
	address = "",
	organization = "ACM",
	copy = ""
}



@ARTICLE{Ang2004,
	AUTHOR = "D. Angluin",
	TITLE = "Queries revisited",
	JOURNAL = tcs,
	YEAR = 2004,
	month = "",
	volume = 313,
	number = "",
	pages = "175--194",
	copy = ""
}


@ARTICLE{AngHoo84,
	AUTHOR = "D. Angluin and D. N. Hoover",
	TITLE = "Regular prefix relations",
	JOURNAL = mst,
	YEAR = 1984,
	month = "",
	volume = 17,
	number = "",
	pages = "167--191",
	copy = ""
}



@INPROCEEDINGS{AngKha91,
	AUTHOR = "D. Angluin and M. Kharitonov",
	TITLE = "When won't membership queries help?",
	BOOKTITLE = "Proc. 23rd ACM Symp. Theory of Computing STOC",
	YEAR = 1991,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "444--454",
	address = "",
	organization = "",
	copy = ""
}

@article{AnrKoh03,
  Abstract = {Technical systems are in general not guaranteed to work correctly. They are
    more or less reliable.  One main problem for technical systems is the
    computation of the reliability of a system as studied in reliability theory. A second main problem for technical systems is the problem of diagnostic, i.e. explanations why something does not work. In fact, these problems are --- in some sense --- dual to each other.
    In this paper, we will use the concept of probabilistic argumentation systems PAS for modeling the system description as well as observation and specifications of behaviour in one common framework. We show that PAS provide a
    framework which allows to formulate and solve  reliability and diagnostic problems, and all
    concepts for these two problems can clearly be
    defined therein.  Using PAS, reliability and diagnostic can be considered as dual problems. PAS offer one common strategy for computing answers to the
    questions in these different situations.},
  Author = {B. Anrig and J. Kohlas},
  Journal = {Int. J. of Intell. Systems},
  Number = {10},
  Pages = {1001--1033},
  Title = {Model-Based Reliability and Diagnostic: A Common Framework for Reliability and Diagnostics},
  Url = {http://diuf.unifr.ch/tcs/publications/ps/AK03.pdf},
  Volume = {18},
  Year = {2003}}
    


@TECHREPORT{Ant03,
	AUTHOR = "M. Anthony",
	TITLE = "Links Between Learning and Optimization: A Brief Tutorial ",
	INSTITUTION = "Centre for Discrete and Applicable Mathematics; 
London School of Economics",
	YEAR = 2003,
	month = jan,
	number = "LSE-CDAM-2003-02",
	address = "",
	copy = ""
}



@ARTICLE{Aon84,
	AUTHOR = "M. Aono and T. Kunii",
	TITLE = "Botanical tree image generation",
	JOURNAL = compgraphappl,
	YEAR = 1984,
	month = may,
	volume = "4",
	number = "5",
	pages = "10--34",
	copy = ""
}


@InProceedings{App87,
  author =       "D. E. Appelt",
  title =        "Bidirectional grammars and the design of natural
                 language generation systems",
  pages =        "185--191",
  crossref =     "tinlap-3",
}

@inproceedings{Appetal2007,
  author    = {D. Applegate and
               G. Calinescu and
               D. S. Johnson and
               H. J. Karloff and
               K. Ligett and
               J. Wang},
  title     = {Compressing rectilinear pictures and minimizing access control
               lists},
  booktitle = {Proceedings of the Eighteenth Annual ACM-SIAM Symposium
               on Discrete Algorithms SODA},
  year      = {2007},
  pages     = {1066--1075},
  editor    = {N. Bansal and
               K. Pruhs and
               C. Stein},
  publisher = {SIAM},
}




@INPROCEEDINGS{Ardetal91,
	AUTHOR = "F. Arduini and others",
	TITLE = "A multifractal-based approach to natural scene analysis",
	BOOKTITLE = "Proceedings of the International Conference on
Acoustics, Speech, and Signal Processing",
	YEAR = 1991,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "2681--2684",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{Arietal01,
	AUTHOR = "S.R. Arikati and A. Dessmark and A. Lingas and M.V. Marathe",
	TITLE = "Approximation algorithms for maximal two-dimensional pattern matching",
	JOURNAL = tcs,
	YEAR = 2001,
	month = "",
	volume = 255,
	number = "",
	pages = "51--62",
	copy = ""
}


@ARTICLE{AriIshShi97,
	AUTHOR = "H. Arimura and H. Ishizaka and T. Shinohara",
	TITLE = "Learning unions of tree patterns using queries",
	JOURNAL = tcs,
	YEAR = 1997,
	month = "",
	volume = 185,
	number = "",
	pages = "47--62",
	copy = ""
}


@INPROCEEDINGS{AriSakAri01,
	AUTHOR = "H. Arimura and H. Sakamoto and S. Arikawa",
	TITLE = "Efficient learning of semi-structured data from queries",
	BOOKTITLE = "Algorithmic Learning Theory ALT 2001",
	YEAR = 2001,
	month = "",
	volume = "2225",
	editor = "N. Abe and R. Khardon and T. Zeugmann",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "315--331",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@InProceedings{AriShiOts94,
  author =       "H. Arimura and T. Shinohara and S. Otsuki",
  title =        "Finding Minimal Generalizations for Unions of Pattern
                 Languages and Its Application to Inductive Inference
                 from Positive Data",
  pages =        "649--660",
  editor =       "P. Enjalbert and E. W. Mayr and K. W. Wagner",
  booktitle =    "Proc. Symposium Theoretical
                 Aspects of Computer Science ({STACS}'94)",
  month =        feb,
  series =       "LNCS",
  volume =       "775",
  publisher =    "Springer",
  address =      "",
  year =         "1994",
}


@ARTICLE{ArkHalHas93,
	AUTHOR = "E. M. Arkin and M. M. Halld{\'o}rsson and R. Hassin",
	TITLE = "Approximating the tree and tour covers of a graph",
	JOURNAL = ipl,
	YEAR = 1993,
	month = "",
	volume = 47,
	number = "",
	pages = "275--282",
	copy = ""
}
@article{ArkFekMit2000,
  author    = {E. M. Arkin and
               S. P. Fekete and
               J. S. B. Mitchell},
  title     = {Approximation algorithms for lawn mowing and milling},
  journal   = {Comput. Geom.},
  volume    = {17},
  number    = {1-2},
  year      = {2000},
  pages     = {25--50},
}

@article{ArkHelSmi2000,
  author    = {E. M. Arkin and
               M. Held and
               C. L. Smith},
  title     = {Optimization Problems Related to Zigzag Pocket Machining},
  journal   = {Algorithmica},
  volume    = {26},
  number    = {2},
  year      = {2000},
  pages     = {197--236},
}

@article{Arketal2004,
  author    = {E. M. Arkin and
               R. Hassin and
               S. Rubinstein and
               M. Sviridenko},
  title     = {Approximations for Maximum Transportation with Permutable
               Supply Vector and Other Capacitated Star Packing Problems},
  journal   = {Algorithmica},
  volume    = {39},
  number    = {2},
  year      = {2004},
  pages     = {175--187},
}

@article{Arketal2005,
author = {E. M. Arkin and M. A. Bender and E. D. Demaine and S. P. Fekete and J. S. B. Mitchell and S. Sethia},
collaboration = {},
title = {Optimal Covering Tours with Turn Costs},
publisher = {SIAM},
year = {2005},
journal = {SIAM Journal on Computing},
volume = {35},
number = {3},
pages = {531--566},
}




@ARTICLE{ArnLagSee91,
	AUTHOR = "S. Arnborg and J. Lagergren and D. Seese",
	TITLE = "Easy problems for tree-decomposable graphs",
	JOURNAL =jalg ,
	YEAR = 1991,
	month = "",
	volume = 12,
	number = "",
	pages = "308--340",
	copy = ""
}

@ARTICLE{Arn83,
	AUTHOR = "A. Arnold",
	TITLE = "Rational {$\omega$}-languages are non-ambiguous",
	JOURNAL = tcs,
	YEAR = 1983,
	month = "",
	volume = 26,
	number = "",
	pages = "221--223",
	copy = ""
}

@INPROCEEDINGS{Arn84,
	crossref = "NivPer84",
	AUTHOR = "A. Arnold",
	TITLE = "Deterministic and non ambiguous rational {$\omega$} languages",
	chapter = "Part {I}: {T}he theory of {B\"u}chi and {M}c{N}aughton",
	pages = "18--27",
	copy = ""
}
		  
@ARTICLE{ArnLat79,
	AUTHOR = "A. Arnold and M. Latteux",
	TITLE = "A new proof of two theorems about rational transductions",
	JOURNAL = tcs,
	YEAR = 1979,
	month = "",
	volume = 8,
	number = "",
	pages = "261--263",
	copy = ""
}
@INPROCEEDINGS{Aroetal2004,
	AUTHOR = "B. Aronov and T. Asano and N. Katoh and K. Mehlhorn  and T. Tokuyama",
	TITLE = "Polyline Fitting of Planar Points Under Min-sum Criteria",
	BOOKTITLE = "Algorithms and Computation: 15th International Symposium ISAAC 2004",
	YEAR = 2004,
	month = "",
	volume = "3341",
	editor = "R. Fleischer and G. Trippen",
	series = "LNCS",
	chapter = "",
	pages = "77--88",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{AruVel98,
	AUTHOR = "S. Arumugam and S. Velammal",
	TITLE = "Edge domination in graphs",
	JOURNAL = {Taiwanese Journal of Mathematics},
	YEAR = 1998,
	month = "",
	volume = 2,
	number = "",
	pages = "173--179",
	copy = ""
}


@INPROCEEDINGS{ArvRam2002,
	AUTHOR = "V. Arvind and V. Raman",
	TITLE = "Approximation Algorithms for Some Parameterized Counting Problems",
	BOOKTITLE = "Algorithms and Computation, 13th International Symposium, ISAAC
               2002",
year={2002}, 
	pages = "453--464",
 publisher = {Springer},
  series    = {LNCS},
editor={P. Bose and P. Morin},
  volume    = {2518},
	copy = ""
}



@inproceedings{Aryetal01,
    author = "V. Arya and N. Garg and R. Khandekar and K. Munagala and V. Pandit",
    title = "Local search heuristic for $k$-median and facility location problems",
    booktitle = "{ACM} Symposium on Theory of Computing STOC",
    pages = "21-29",
    year = "2001",
    url = "citeseer.nj.nec.com/arya02local.html" }

@inproceedings{Asaetal2006,
Author = {Asahiro, Y. and Miyano, E. and Ono, H. and Zenmyo, K.},
Title = {Graph Orientation Algorithms to Minimize the Maximum Outdegree},
BookTitle = {Twelfth Computing: The Australasian Theory Symposium (CATS2006)},
Editor = {Gudmundsson, J. and Jay, B.},
Series= {CRPIT},
Address= {Hobart, Australia},
Publisher = {ACS},
Volume = {51},
Pages = {11--20},
Year = {2006} }

@inproceedings{AsaHira82,
 author = {T. Asano and T. Hirata},
 title = {Edge-deletion and edge-contraction problems},
 booktitle = {STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing},
 year = {1982},
 isbn = {0-89791-070-2},
 pages = {245--254},
 location = {San Francisco, California, United States},
 publisher = {ACM Press},
 }

@ARTICLE{Asa87,
	AUTHOR = "T. Asano",
	TITLE = "An application of duality to edge-deletion problems",
	JOURNAL = siam,
	YEAR = 1987,
	month = "",
	volume = 16,
	number = "",
	pages = "312--331",
	copy = ""
}


@ARTICLE{AscKri2000,
	AUTHOR = "G. Ascoli and J. L. Krichmar",
	TITLE = "L-Neuron: a modeling tool for the efficient generation and parsimonious description of dendritic morphology",
	JOURNAL = {Neurocomputing},
	YEAR = 2000,
	month = "",
	volume = {32--33},
	number = "",
	pages = "1003--1011",
	copy = ""
}


@ARTICLE{AspHalMan01,
	AUTHOR = "B. Aspvall and M. Halldorsson and F. Manne",
	TITLE = "Approximations for the Generalized Block Distribution of a Matrix",
	JOURNAL = tcs,
	YEAR = 2001,
	month = "",
	volume = 262,
	number = "",
	pages = "145--160",
	copy = ""
}


 @ARTICLE{Ass83,
	   AUTHOR = "P. Assouad",
	   TITLE = "Binary contractions of graphs",
	   JOURNAL = dm,
	   YEAR = 1983,
	   VOLUME = 47,
	   NUMBER = "",
	   PAGES = "315--319",
	   copy = ""
 }


 @ARTICLE{AssKle83,
	   AUTHOR = "S. F. Assmann and D. Kleitman",
	   TITLE = "The number of rounds needed to exchange information within a graph",
	   JOURNAL = dam,
	   YEAR = 1983,
	   VOLUME = 6,
	   NUMBER = "",
	   PAGES = "117--125",
	   copy = ""
 }



@ARTICLE{Asv80,
	AUTHOR = "P.R.J. Asveld",
	TITLE = "On controlled iterated gsm mappings and related operations",
	JOURNAL = rrmpa,
	YEAR = 1980,
	month = "",
	volume = 25,
	number = "",
	pages = "136--145",
	copy = ""
}


@Article{AsvHog91,
  author =       "P. R. J. Asveld and J. A. Hogendorp",
  title =        "On the Generating Power of Regularly Controlled
                 Bidirectional Grammars",
  journal =      ijcm,
  volume =       "40",
  year =         "1991",
}


@ARTICLE{AtaGenSzp99,
	AUTHOR = "M. Atallah and Y. G\'enin and W. Szpankowski",
	TITLE = "Pattern matching image compression: algorithmic and empirical results",
	JOURNAL = ieeetopami,
	YEAR = 1999,
	month = "",
	volume = 21,
	number = "7",
	pages = "614--627",
	copy = ""
}


@ARTICLE{AtaMit89,
	AUTHOR = "A. Atanasiu and V. Mitrana",
	TITLE = "The modular grammars",
	JOURNAL = ijcm,
	YEAR = 1989,
	month = "",
	volume = 30,
	number = "",
	pages = "101--122",
	copy = ""
}

@ARTICLE{Athetal2007,
	AUTHOR = "K.~B. Athreya and J.~M. Hitchcock and J.~H. Lutz and E. Mayordomo",
	TITLE = "Effective strong dimension in algorithmic information and computational complexity",
	JOURNAL = siam,
	YEAR = 2007,
	month = "",
	volume = 37,
	number = "",
	pages = "671--705",
	copy = ""
}

@PhdThesis{Atk2003,
author = {D.~W. Atkins},
title = {Placing Monitoring Devices in Electric Power Networks},
school = {Dept. Mathematics},
year = {2003},
OPTkey = {},
OPTtype = {},
address = {East Tennessee State University, USA},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@article{AulPer01,
        AUTHOR = "V. Auletta and P. Persiano",
        TITLE = "Optimal pebble motion on a tree",
journal = icneu,
        year = 2001, volume=165, pages={42--68},
	month = "",
	copy = ""
}

@article{Ausetal2005,
  author    = {G. Ausiello and
               C. Bazgan and
               M. Demange and
               V. Th. Paschos},
  title     = {Completeness in differential approximation classes},
  journal   = ijfcs,
  volume    = {16},
  number    = {6},
  year      = {2005},
  pages     = {1267--1295},
}

@ARTICLE{AusPas2006,
	AUTHOR = "G. Ausiello and V. Th. Paschos",
	TITLE = "Reductions, completeness and the hardness of approximability",
	JOURNAL = ejor,
	YEAR = 2006,
	month = "",
	volume = 172,
	number = "",
	pages = "719--739",
	copy = ""
}

@ARTICLE{Ausetal93,
	AUTHOR = "J. Auslander and others",
	TITLE = "Optimal Leapfrogging",
	JOURNAL = mm,
	YEAR = 1993,
	month = "",
	volume = 66,
	number = "1",
	pages = "14--19",
	copy = ""
}


@ARTICLE{Aut99,
	AUTHOR = "J.-M. Autebert",
	TITLE = "Some results about centralized {PC} grammar system",
	JOURNAL = tcs,
	YEAR = 1999,
	month = "",
	volume = 215,
	number = "",
	pages = "383--398",
	copy = ""
}


@UNPUBLISHED{AutBerBoas96,
        AUTHOR = "J.-M. Autebert and J. Berstel and L. Boasson",
        TITLE = "Context-free languages and pushdown automata",
        NOTE = "From: Handbook of FL ??",
        year = 1996,
	month = "",
	copy = ""
}


@Article{AutBoaCou78,
  title =        "A Note on 1-Locally Linear Languages",
  author =       "J. M. Autebert and L. Boasson and G. Cousineau",
  pages =        "1--4",
  journal =      icalt,
  month =        apr,
  year =         "1978",
  volume =       "37",
  number =       "1",
}


@Article{AutBoaGab84,
  author =       "J. M. Autebert and L. Boasson and J. Gabarr\'o",
  title =        "Context-free grammars in {G}reibach normal forms",
  journal =      eatcs,
  volume =       "24",
  pages =        "44--47",
  month =        oct,
  year =         "1984",
  note =         "Technical Contributions",
}


@ARTICLE{AutFlaGab87,
	AUTHOR = "J.-M. Autebert and P. Flajolet and J. Gabarr\'o",
	TITLE = "Prefixes of infinite words and ambiguous context-free languages",
	JOURNAL = ipl,
	YEAR = 1987,
	month = "",
	volume = 25,
	number = "",
	pages = "211--216",
	copy = ""
}



 @ARTICLE{AutGab89,
	   AUTHOR = "J.-M. Autebert and J. Gabarr\'o",
	   TITLE = "Iterated GSM's and {C}o-{CFL}",
	   JOURNAL = actainform,
	   YEAR = 1989,
	   VOLUME = 26,
	   NUMBER = "",
	   PAGES = "749--769",
	   copy = ""
 }

@article{AviZwi2005,
  author    = {A. Avidor and
               U. Zwick},
  title     = {Approximating {MIN 2-SAT} and {MIN 3-SAT}},
  journal   = tocs,
  volume    = {38},
  number    = {3},
  year      = {2005},
  pages     = {329--345},
}

@TECHREPORT{Axl94,
	AUTHOR = "S. Axler",
	TITLE = "Down with Determinants!",
	INSTITUTION = "AMSPPS",
	YEAR = 1994,
	month = "",
	number = "199407-15-001",
	NOTE = "To appear in: " # amm,
	address = "",
	copy = ""
}

@ARTICLE{Aye85,
	AUTHOR = "K. Ayers",
	TITLE = "Deque automata and a subfamily of context-sensitive
		  languages which contains all semilinear bounded languages",
	JOURNAL = tcs,
	YEAR = 1985,
	month = "",
	volume = 40,
	number = "",
	pages = "163--174",
	crossref = {Bra87a}
}




@ARTICLE{Azaetal2004,
	AUTHOR = "Y. Azar and L. Epstein and Y. Richter and G. J. Woeginger",
	TITLE = "All-norm approximation algorithms",
	JOURNAL = jalg,
	YEAR = 2004,
	month = "",
	volume = 52,
	number = "",
	pages = "120--133",
	copy = ""
}

BBBB
@TECHREPORT{Babetal91,
	AUTHOR = "{\"O}. Babao{\u g}lu and others",
	TITLE = "Paralex: {A}n environment for parallel programming in
distributed systems",
	INSTITUTION = "Department of Mathematics at the University of Bologna",
	YEAR = 1991,
	month = feb,
	number = "UB-LCS-91-01",
	address = "I-40127 Bologna",
	copy = ""
}


@INPROCEEDINGS{Bae96,
	AUTHOR = "R. Baeza-Yates",
	TITLE = "A unified view to string matching algorithms",
	BOOKTITLE = "{SOFSEM}'96: Theory and Pratice of Informatics",
	YEAR = 1996,
	month = "",
	volume = "1175",
	editor = "K.G. Jeffery and J. Kr\'al and M. Barto\v sek",
	series = "LNCS",
	chapter = "",
	pages = "1--15",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{BaeChoGon94,
	AUTHOR = "R.A. Baeza-Yates and C. Choffrut and G.H. Gonnet",
	TITLE = "On {B}oyer-{M}oore automata",
	JOURNAL = {Algorithmica},
	YEAR = 1994,
	month = "",
	volume = 12,
	number = "",
	pages = "268--292",
	copy = ""
}


@ARTICLE{BaeGon94,
	AUTHOR = "R. Baeza-Yates and G. Gonnet",
	TITLE = "Fast string matching with mismatches",
	JOURNAL = icneu,
	YEAR = 1994,
	month = "",
	volume = 108,
	number = "2",
	pages = "187--199",
	copy = ""
}



@ARTICLE{BaeGon96,
	AUTHOR = "R. Baeza-Yates and G. Gonnet",
	TITLE = "Fast Text Searching for Regular Expressions or
		  Automaton Simulation over Tries",
	JOURNAL = jacm,
	YEAR = 1996,
	month = "",
	volume = 43,
	number = "6",
	pages = "915--936",
	copy = ""
}


@ARTICLE{BaeReg93,
	AUTHOR = "R. Baeza-Yates and M. R\'egnier",
	TITLE = "Fast two dimensional pattern matching",
	JOURNAL = ipl,
	YEAR = 1993,
	month = "",
	volume = 45,
	number = "",
	pages = "51--57",
	copy = ""
}



@techreport{BafBerFuj96,
	AUTHOR = "V. Bafna and P. Berman and T. Fujito",
	TITLE = "Constant ratio approximations of feedback vertex sets in weighted  undirected graphs",
	INSTITUTION = "DIMACS at Rutgers University",
	YEAR = 1996,
	month = jul,
	number = "96-29",
	address = "",
	copy = ""
}

@ARTICLE{BafBerFuj99,
	AUTHOR = "V. Bafna and P. Berman and T. Fujito",
	TITLE = "A 2-approximation algorithm for the undirected feedback vertex set problem",
	JOURNAL = siamdm,
	YEAR = 1999,
	month = "",
	volume = 12,
	number = "",
	pages = "289--297",
	copy = ""
}
@MastersThesis{Bai2007,
author = {G. Bai},
title = {Ein eingeschr{\"a}nktes {K}noten{\"u}berdeckungsproblem in bipartiten {G}raphen},
school = {FB IV, Informatik, Universit{\"a}t Trier, Germany},
year = {2007},
OPTkey = {},
type = {Diplomarbeit},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@inproceedings{BaiFer2008,
  author    = {G. Bai and
               H. Fernau},
  title     = {Constraint Bipartite Vertex Cover: Simpler Exact Algorithms
               and Implementations},
  booktitle = {Frontiers in Algorithmics FAW},
  year      = {2008},
  pages     = {67--78},
  editor    = {F. P. Preparata and
               X. Wu and
               J. Yin},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {5059},
}

@inproceedings{BaiStu2005,
  author    = {J. Bailey and
               P. J. Stuckey},
  title     = {Discovery of Minimal Unsatisfiable Subsets of Constraints
               Using Hitting Set Dualization},
  year      = {2005},
  pages     = {174--186},
  editor    = {M. V. Hermenegildo and
               D. Cabeza},
  booktitle     = {Practical Aspects of Declarative Languages, 7th International
               Symposium, PADL 2005},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {3350},
}		  

@INPROCEEDINGS{Baietal92,
	crossref = "DeGetal92",
	AUTHOR = "F. Baiardi and others",
	TITLE = "A data driven static model for the execution of logic
programs on distributed memory systems",
	chapter = "",
	pages = "54--69",
	copy = ""
}



@ARTICLE{Bak74,
	AUTHOR = "B. S. Baker",
	TITLE = "Non-context-free grammars generating context-free languages",
	JOURNAL = icalt,
	YEAR = 1974,
	month = "",
	volume = 24,
	number = "",
	pages = "231--246",
	copy = ""
}


@ARTICLE{Bak82,
	AUTHOR = "V. I. Bakhtin",
	TITLE = "Properties of the entropy and {H}ausdorff dimension",
	JOURNAL = mumb,
	YEAR = 1982,
	month = "",
	volume = 37,
	number = "5",
	pages = "30--34",
	copy = ""
}


@ARTICLE{Bak94,
	AUTHOR = "B. Baker",
	TITLE = "Approximation algorithms for {NP}-complete problems on planar graphs",
	JOURNAL = jacm,
	YEAR = 1994,
	month = "",
	volume = 41,
	number = "",
	pages = "153--180",
	copy = ""
}


@Article{BakBoo74,
  title =        "Reversal-Bounded Multipushdown Machines",
  author =       "B. S. Baker and R. V. Book",
  pages =        "315--332",
  journal =      jcss,
  year =         "1974",
  month =        jun,
  volume =       "8",
  number =       "3",
}



@ARTICLE{BakHer72,
   AUTHOR = 	"R. W. Baker and G. T. Herman",
   TITLE = 	"Simulation of organisms using a developmental model:
		    Part {I}: Basic description
		    Part {II}: The heterocyst formation problem in
		    blue-green algae",
   JOURNAL = 	ijbmc,
   YEAR = 	"1972",
   VOLUME = 	"3",
   NUMBER = 	"",
   PAGES = 	"201--215 and 251--267",
   MONTH = 	"",
   note = 	""
 }



@INPROCEEDINGS{BakKok85,
	crossref = "Bra85",
	AUTHOR = "J. W. de Bakker and J. N. Kok",
	TITLE = "Towards a uniform topological treatment of streams
and functions on streams",
	chapter = "",
	pages = "140--148",
	copy = ""
}



@INPROCEEDINGS{BakMeyOld85,
	crossref = "Bra85",
	AUTHOR = "J. W. de Bakker and J.-J. C. Meyer and E.-R. Olderog",
	TITLE = "Infinite streams and finite observations in the
semantics of uniform concurrency",
	chapter = "",
	pages = "149--157",
	copy = ""
}


@ARTICLE{Baketal88,
	AUTHOR = "J. W. de Bakker",
	TITLE = "Transition systems, metric spaces and ready sets in
the semantics of uniform concurrency",
	JOURNAL = jcss,
	YEAR = 1988,
	month = "",
	volume = 36,
	number = "",
	pages = "158--224",
	copy = ""
}


@ARTICLE{BalFelRam98,
	AUTHOR = "R. Balasubramanian and M. R. Fellows and V. Raman",
	TITLE = "An improved fixed parameter algorithm for vertex cover",
	JOURNAL = ipl,
	YEAR = 1998,
	month = "",
	volume = 65,
	number = "3",
	pages = "163--168",
	copy = ""
}

@INPROCEEDINGS{Bal95,
	AUTHOR = "J. L. Balc\'azar",
	TITLE = "The complexity of searching succinctly represented graphs",
	BOOKTITLE = "Automata, Languages and Programming, ICALP'95",
	YEAR = 1995,
	month = "",
	volume = "",
	editor = "Z. F{\"u}l{\"o}p and F. G\'ecseg",
	series = "LNCS",
	chapter = "",
	pages = "208--221",
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{BalBarCav98,
	AUTHOR = "M. Baldoni and C. Baroglio and D. Cavagnino",
	TITLE = "{XFF}: {A} simple method to e{X}tract {F}ractal {F}eatures for 2{D} object recognition",
	BOOKTITLE = "Proceedings of SSPR'98",
	YEAR = 1998,
	month = "",
	volume = "1451",
	editor = "A. Amin and others",
	series = "LNCS",
	chapter = "",
	pages = "382--389",
	address = "",
	organization = "",
	copy = ""
}
@ARTICLE{Baletal2005,
	AUTHOR = "N.~E. Baldwin and E.~J. Chesler and S. Kirov and M.~A. Langston and J.~R. Snoddy and R.~W. Williams and B. Zhang",
	TITLE = "Computational, integrative, and comparative methods for the elucidation of genetic coexpression networks",
	JOURNAL = {Journal of Biomedicine and Biotechnology},
	YEAR = 2005,
	month = "",
	volume = {2005},
	number = "2",
	pages = "172--180",
	copy = ""
}

@ARTICLE{BalCasJai95,
	AUTHOR = "G. Baliga and J. Case and S. Jain",
	TITLE = "Language Learning With Some Negative Information",
	JOURNAL = jcss,
	YEAR = 1995,
	month = "",
	volume = 51,
	number = "",
	pages = "273--285",
	copy = ""
}



@ARTICLE{BalGhePau87,
	AUTHOR = "T. B{\u a}l{\u a}nescu and M. Gheorghe and Gh. P{\u a}un",
	TITLE = "Three variants of apical growth; filamentous systems",
	JOURNAL = ijcm,
	YEAR = 1987,
	volume = 22,
	number = "",
	pages = "227--238",
	copy = ""
}


@ARTICLE{BalLei71,
	AUTHOR = "E. Balslev and K. N. Leibovic",
	TITLE = "Theoretical analysis of binocular perception",
	JOURNAL = jtb ,
	YEAR = 1971,
	volume = 31,
	number = "",
	pages = "77--100",
	copy = ""
}


@InProceedings{Baletal92,
  author =       "J. L. Balc{\'a}zar and J. D{\'\i}az and R. Gavald{\`a}
                 and O. Watanabe",
  title =        "A Note on the Query Complexity of Learning {DFA}",
  pages =        "53--62",
  ISBN =         "3-540-57369-0",
  editor =       "K. P. Jantke {S. Doshita, K. Furukawa} and T.
                 Nishida",
  booktitle =    "Proceedings of the 3rd Workshop on Algorithmic
                 Learning Theory ({ALT} '92)",
  address =      "Tokyo, Japan",
  month =        oct,
  year =         "1992",
  series =       "LNCS/LNAI",
  volume =       "743",
  publisher =    "Springer",
}



@Article{Baletal94,
  author =       "J. L. Balc{\'a}zar and J. D{\'\i}az and R. Gavald{\`a}
                 and O. Watanabe",
  title =        "The Query Complexity of Learning {DFA}",
  journal =      "New Generation Computing",
  volume =       "12",pages={337--358},
  publisher =    "Ohmsha, Ltd./Springer-Verlag",
  year =         "1994" ,
}


@ARTICLE{Ban63,
	AUTHOR = "R. B. Banerji",
	TITLE = "Phrase structure languages, finite machines, and
                  channel capacity",
	JOURNAL = icalt,
	YEAR = 1963,
	month = "",
	volume = 6,
	number = "",
	pages = "153--162",
	copy = ""
}

@ARTICLE{BanDre86,
	AUTHOR = "H.-J. Bandelt and A. Dress",
	TITLE = "Reconstructing the shape of a tree from observed dissimilarity data",
	JOURNAL = {Advances in Applied Mathematics},
	YEAR = 1986,
	month = "",
	volume = 7,
	number = "",
	pages = "309--343",
	copy = ""
}

@PHDTHESIS{Ban82,
	AUTHOR = "C. Bandt",
	TITLE = "Zum Zusammenhang von Ma\ss\ und Metrik",
	SCHOOL = "Ernst-Moritz-Arndt Universit{\"a}t Greifswald",
	YEAR = 1982,
 	month = "",
	address = "",
	type = "Dissertation",
	copy = ""
}


@ARTICLE{Ban83,
	AUTHOR = "C. Bandt",
	TITLE = "Many measures are {H}ausdorff measures",
	JOURNAL = bpasm,
	YEAR = 1983,
	month = "",
	volume = 31,
	number = "3--4",
	pages = "107--114",
	copy = ""
}



@INPROCEEDINGS{Ban88,
	crossref = "Banetal88",
	AUTHOR = "C. Bandt",
	TITLE = "Self-similar sets 4. {T}opology and measure",
	chapter = "Geometric measure theory",
	pages = "8--16",
	copy = ""
}


@ARTICLE{Ban89,
	AUTHOR = "C. Bandt",
	TITLE = "Self-similar sets. {I}. {T}opological {M}arkov chains
and mixed self-similar sets",
	JOURNAL = mn,
	YEAR = 1989,
	month = "",
	volume = 142,
	number = "",
	pages = "107--123",
	copy = ""
}

@ARTICLE{Ban89a,
	AUTHOR = "C. Bandt",
	TITLE = "Self-similar sets 3. {C}onstructions with sofic systems",
	JOURNAL = monmath,
	YEAR = 1989,
	month = "",
	volume = 108,
	number = "",
	pages = "89--102",
	copy = ""
}


@ARTICLE{Ban91,
	AUTHOR = "C. Bandt",
	TITLE = "Self-similar sets 5. {I}nteger matrices and fractal
tilings of {${\BBb R}^n$}",
	JOURNAL = pams,
	YEAR = 1991,
	month = jun,
	volume = 112,
	number = "2",
	pages = "549--562",
	copy = ""
}



@ARTICLE{BanFei81,
	AUTHOR = "C. Bandt and U. Feiste",
	TITLE = "Some questions and examples concerning {H}ausdorff measures",
	JOURNAL = mn,
	YEAR = 1981,
	month = "",
	volume = 104,
	number = "",
	pages = "171--182",
	copy = ""
}



@INPROCEEDINGS{BanFei84,
	crossref = "Flaetal84",
	AUTHOR = "C. Bandt and U. Feiste",
	TITLE = "Which measures are {H}ausdorff measures",
	chapter = "Part 1",
	pages = "32--43",
	copy = ""
}


@ARTICLE{BanGra92,
	AUTHOR = "C. Bandt and S. Graf",
	TITLE = "Self-similar sets 7. {A} characterization of
self-similar fractals with positive {H}ausdorff measure",
	JOURNAL = pams,
	YEAR = 1992,
	month = apr,
	volume = 114,
	number = "4",
	pages = "995--1001",
	copy = ""
}


@TECHREPORT{BanKel90,
	AUTHOR = "C. Bandt and K. Keller",
	TITLE = "Self-similar sets 2. {A} simple approach to the
topological structure of fractals",
	INSTITUTION = "Ernst-Moritz-Arndt-Universit{\"a}t Greifswald (DDR)",
	YEAR = 1990,
	month = "",
	number = "Preprint-Reihe Mathematik 24",
	address = "",
	copy = ""
}



@ARTICLE{BanRet92,
	AUTHOR = "C. Bandt and T. Retta",
	TITLE = "Topological spaces admitting a unique fractal structure",
	JOURNAL = fundmath,
	YEAR = 1992,
	month = "",
	volume = 141,
	number = "",
	pages = "257--268",
	copy = ""
}



@INPROCEEDINGS{BanStu88,
	crossref = "Hyper3",
	AUTHOR = "P. Banerjee and C. B. Stunkel",
	TITLE = "A novel approach to system-level fault tolerance in
hypercube multiprocessors",
	chapter = "6",
	pages = "307--311",
	copy = ""
}


@ARTICLE{Banetal90,
	AUTHOR = "P. Banerjee and others",
	TITLE = "Algorithm-based fault tolerance on a hypercube multiprocessor",
	JOURNAL = ieeetoc,
	YEAR = 1990,
	month = "",
	volume = 39,
	number = "9",
	pages = "1132--1145",
	copy = ""
}



@ARTICLE{BarGifJaa2001,
	AUTHOR = "Z. Bar-Yoseph and D.~K. Gifford and T.~S. Jaakola",
	TITLE = "Fast optimal leaf-ordering for hierarchical clustering",
	JOURNAL = {Bioinformatics},
	YEAR = 2001,
	month = "",
	volume = 17,
	number = "Supplement 1",
	pages = "S22--S29",
	copy = ""
}



@ARTICLE{Baretal2003,
	AUTHOR = "Z. Bar-Yoseph and E.~D. Demaine D.~K. Gifford and A.~M. Hamel and T.~S. Jaakola and N. Srebro",
	TITLE = "$k$-ary clustering with optimal leaf-ordering for gene expression data",
	JOURNAL = {Bioinformatics},
	YEAR = 2003,
	month = "",
	volume = 19,
	number = "",
	pages = "1070--1078",
	copy = ""
}


@ARTICLE{BarBen96,
	AUTHOR = "R. Bar-Yehuda and E. Ben-Hanoch",
	TITLE = "A linear time algorithm for covering simple polygons with similar rectangles",
	JOURNAL = {Intern. J. of Computational Geometry and Applications},
	YEAR = 1996,
	month = "",
	volume = 6,
	number = "1",
	pages = "79--102",
	copy = ""
}



@TECHREPORT{Bar98,
	AUTHOR = "R. Bar-Yehuda",
	TITLE = "A linear time 2-approximation algorithm for the min clique-complement problem",
	INSTITUTION = "Technion",
	YEAR = 1998,
	month = "",
	number = "CS0933",
	address = "",
	copy = ""
}


@article{BarRaw2002,
 author = {R. Bar-Yehuda and D. Rawitz},
 title = {Approximating element-weighted vertex deletion problems for the complete $k$-partite property},
 journal = jalg,
 volume = {42},
 number = {1},
 year = {2002},
 pages = {20--40},
 }



@INPROCEEDINGS{BarGra02,
	AUTHOR = "R. Barbanchon and E. Grandjean",
	TITLE = "Local problems, planar local problems and linear time",
	BOOKTITLE = "Computer Science Logic;
16th International Workshop, CSL 2002",
	YEAR = 2002,
	month = "",
	volume = "2471",
	editor = "J. Bradfield",
	series = "LNCS",
	chapter = "",
	pages = "397--411",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{BarFer02,
	AUTHOR = "V. C. Barbosa and R. G. Ferreira",
  title = "On the Phase Transitions of Graph Coloring and Independent Sets",
	JOURNAL = physa,
	YEAR = 2004,
	month = "",
	volume = 343,
	number = "",
	pages = "401--423",
	  url = "citeseer.ist.psu.edu/barbosa02phase.html" }



@INPROCEEDINGS{BarMak91,
	AUTHOR = "Y. Bargury and J. Makowsky",
	TITLE = "The expressive power of transitive closure and 2-way multihead automata",
	BOOKTITLE = "Computer Science Logic",
	YEAR = 1991,
	month = "",
	volume = "626",
	editor = "E. B{\"o}rger and others",
	series = "LNCS",
	chapter = "",
	pages = "1--14",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{BarHiletal61,
	AUTHOR = "Y. Bar-Hillel and M. Perles and E. Shamir",
	TITLE = "On formal properties of simple phrase structure grammars",
	JOURNAL = {Zeitschrift f{\"u}r Phonetik, Sprachwiss[enschaft(en)?]
		  und Kommunikation},
	YEAR = 1961,
	month = "",
	volume = 14,
	number = "",
	pages = "143--172",
	copy = ""
}


@INPROCEEDINGS{Bark88,
	crossref = "KowBow88",
	AUTHOR = "J. Barklund",
	TITLE = "Condition graphs",
	chapter = "",
	pages = "435--446",
	copy = ""
}

@ARTICLE{Bar51,
	AUTHOR = "B. Barna",
	TITLE = "{\"U}ber das {N}ewtonsche {V}erfahren zur
{A}nn{\"a}herung von {W}urzeln algebraischer {G}leichungen",
	JOURNAL = publmath,
	YEAR = 1951,
	month = "",
	volume = 2,
	number = "",
	pages = "50--63",
	copy = ""
}


@ARTICLE{Bar53,
	AUTHOR = "B. Barna",
	TITLE = "{\"U}ber die {D}ivergenzpunkte des {N}ewtonschen {V}erfahrens zur
{B}estimmung von {W}urzeln algebraischer {G}leichungen {I}",
	JOURNAL = publmath,
	YEAR = 1953,
	month = "",
	volume = 3,
	number = "",
	pages = "109--118",
	copy = ""
}


@ARTICLE{Bar56,
	AUTHOR = "B. Barna",
	TITLE = "{\"U}ber die {D}ivergenzpunkte des {N}ewtonschen {V}erfahrens zur
{B}estimmung von {W}urzeln algebraischer {G}leichungen {II}",
	JOURNAL = publmath,
	YEAR = 1956,
	month = "",
	volume = 4,
	number = "",
	pages = "384--397",
	copy = ""
}


@ARTICLE{Bar61,
	AUTHOR = "B. Barna",
	TITLE = "{\"U}ber die {D}ivergenzpunkte des {N}ewtonschen {V}erfahrens zur
{B}estimmung von {W}urzeln algebraischer {G}leichungen {III}",
	JOURNAL = publmath,
	YEAR = 1961,
	month = "",
	volume = 8,
	number = "",
	pages = "193--207",
	copy = ""
}


@ARTICLE{Bar72,
	   AUTHOR = "B. H. Barnes",
	   TITLE = "On the automorphism group of periodic automata",
	   JOURNAL = icalt,
	   YEAR = 1972,
	   VOLUME = 20,
	   NUMBER = "",
	   PAGES = "125--134",
	   copy = ""
 }


@INPROCEEDINGS{BarKor97,
	AUTHOR = "A. Bar-Noy and G. Kortsarz",
	TITLE = "The mimimum color sum of bipartite graphs",
	BOOKTITLE = "Automata, Languages and Programming, Proc. 24th ICALP",
	YEAR = 1997,
	month = "",
	volume = "1256",
	editor = "P. Degano and R. Gorrieri and A. Marchetti-Spaccamela",
	series = "LNCS",
	chapter = "",
	pages = "738--748",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{Baretal01,
	AUTHOR = "Bar-Noy A. and Bar-Yehuda, R. and Freund A. and Naor S. and B. Schieber",
	TITLE = "A Unified Approach to Approximating Resource Allocation and Scheduling",
	JOURNAL = jacm,
	YEAR = 2001,
	month = "",
	volume = 48,
	number = "",
	pages = "1069--1090",
	copy = ""
}
		  


@ARTICLE{BarDem85,
	AUTHOR = "M. F. Barnsley and S. Demko",
	TITLE = "Iterated function systems and the global construction
of fractals",
	JOURNAL = prsla,
	YEAR = 1985,
	month = "",
	volume = 399,
	number = "",
	pages = "243--275",
	copy = ""
}



@ARTICLE{BarElt88,
	AUTHOR = "M. F. Barnsley and J. H. Elton",
	TITLE = "A new class of {M}arkov processes for image encoding",
	JOURNAL = advapplprob,
	YEAR = 1988,
	month = "",
	volume = 20,
	number = "",
	pages = "14--32",
	copy = ""
}


@ARTICLE{BarEltHar89,
	AUTHOR = "M. F. Barnsley and J. H. Elton and D. P. Hardin",
	TITLE = "Recurrent iterated function systems",
	JOURNAL = constappr,
	YEAR = 1989,
	volume = 5,
	number = "",
	pages = "3--31",
	month = "",
	copy = ""
}


@ARTICLE{BarGerHar84,
	AUTHOR = "M. F. Barnsley and J. S. Geronimo and A. N. Harrington",
	TITLE = "Geometry and combinatorics of {J}ulia sets for real
quadratic maps",
	JOURNAL = jsp,
	YEAR = 1984,
	month = "",
	volume = 37,
	number = "1/2",
	pages = "51--92",
	copy = ""
}


@ARTICLE{BarHar85,
	AUTHOR = "M. Barnsley and A. N. Harrington",
	TITLE = "A {M}andelbrot set for pairs of linear maps",
	JOURNAL = physd,
	YEAR = 1985,
	month = "",
	volume = 15,
	number = "",
	pages = "421--432",
	copy = ""
}


@Article{BarImmStr90,
author  ="D.~A.~M. Barrington and N. Immerman and H. Straubing",
title   ="On uniformity within {NC}$^1$",
journal =jcss,
volume  ="41",
year    ="1990",
pages   ="274--306"
}




@ARTICLE{BarSlo88,
	AUTHOR = "M. F. Barnsley and A. D. Sloan",
	TITLE = "A better way to compress images",
	JOURNAL = "BYTE",
	YEAR = 1988,
	month = jan,
	volume = "??",
	number = "",
	pages = "215--223",
	copy = ""
}



@ARTICLE{Baretal88,
	AUTHOR = "M. F. Barnsley and others",
	TITLE = "Harnessing chaos for image synthesis",
	JOURNAL = compgraph,
	YEAR = 1988,
	month = aug,
	volume = 22,
	number = "4",
	pages = "131--140",
	copy = "",
	note = "Proceedings of the SIGGRAPH'88, Atlanta"
}


@ARTICLE{Baretal88a,
	AUTHOR = "M. F. Barnsley and others",
	TITLE = "Invariant measures for {M}arkov processes arising from
iterated function systems with place-dependent probabilities",
	JOURNAL = annihpps,
	YEAR = 1988,
	month = "",
	volume = 24,
	number = "3",
	pages = "367--394",
	copy = ""
}


@ARTICLE{Baretal89,
	AUTHOR = "M. F. Barnsley and others",
	TITLE = "Erratum: {I}nvariant measures for {M}arkov processes arising from
iterated function systems with place-dependent probabilities",
	JOURNAL = annihpps,
	YEAR = 1989,
	month = "",
	volume = 25,
	number = "4",
	pages = "589--590",
	copy = ""
}


@ARTICLE{Baretal89a,
	AUTHOR = "M. F. Barnsley and others",
	TITLE = "Hidden variable interpolation functions",
	JOURNAL = "SIAM Journal of Math. Analysis",
	YEAR = 1989,
	month = "",
	volume = "20",
	number = "5",
	pages = "1218--1242",
	copy = ""
}



@Article{Baretal92,
author  ="D. A. M. Barrington and K. Compton and H. Straubing and D. Th\'erien",
title   ="Regular Languages in {NC$^1$}",
journal =jcss,
volume  ="44",
year    ="1992",
pages = "478--499"  
}


@Article{Bar89,
author  ="D. A. M. Barrington",
title   ="Bounded-Width Polynomial-Size Branching Programs Recognize Exactly
         Those Languages in {NC$^1$}",
journal = jcss,
volume  ="38",
year    ="1989", pages = "150--164"
}


@Article{BarCor89,
author          ="D. A. M. Barrington and J. Corbett",
title           ="On the relative complexity of some languages in {NC$^1$}",
journal         =ipl,
volume          ="32",
number          ="5",
pages           ="251--256",
month           =sep,
year            ="1989",
}


@Article{BarCor91,
author  ="D. A. M. Barrington and J. Corbett",
title   ="A note on some languages in uniform {ACC$^0$}",
journal =tcs,
volume  ="78",
year    ="1991",
pages   ="357--362"
}


@Article{BarStrThe90,
title   ="Non-Uniform Automata Over Groups",
author  ="D. A. M. Barrington and H. Straubing and D. Th{\'e}rien",
pages   ="109--132",
journal =icneu,
month   =dec,
year    ="1990",
volume  ="89",
number  ="2",
}



@Article{BarThe88,
author    ="D. A. M. Barrington and D. Th\'erien",
title     ="Finite Monoids and the Fine Structure of {NC$^1$}",
journal   =jacm,
volume    ="35",
number    ="4",
pages     ="941--952",
month     =oct,
year      ="1988",
}


@ARTICLE{BarRin01,
	AUTHOR = "E. Barucci and S. Rinaldi",
	TITLE = "Some linear recurrences and their combinatorial interpretation by means of regular languages",
	JOURNAL = tcs,
	YEAR = 2001,
	month = "",
	volume = 255,
	number = "",
	pages = "679--686",
	copy = ""
}


@INPROCEEDINGS{Bar77,
	AUTHOR = "G. Barth",
	TITLE = "Efficient non-contextfree parsing",
	BOOKTITLE = "GI--7.Jahrestagung",
	YEAR = 1977,
	month = "",
	volume = "10",
	editor = "",
	series = "Informatik-Fachberichte",
	chapter = "",
	pages = "1--15",
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{Bar78,
	AUTHOR = "G. Barth",
	TITLE = "Grammars with dynamic control sets",
	BOOKTITLE = "Automata, Languages and Programming",
	YEAR = 1978,
	month = "",
	volume = "62",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "36--51 ",
	address = "",
	organization = "",
	copy = ""
}




@INPROCEEDINGS{Bar78a,
	AUTHOR = "G. Barth",
	TITLE = "Mastering contextsensitivity in programming languages",
	BOOKTITLE = "MFCS'78",
	YEAR = 1978,
	month = "",
	volume = "64",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "124--133",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{BarJunMut2004,
	AUTHOR = "W. Barth and M. J{\"u}nger and P. Mutzel",
	TITLE = "Simple and efficient bilayer cross counting",
	JOURNAL = jgaa,
	YEAR = 2004,
	month = "",
	volume = 8,
	number = "",
	pages = "179--194",
	copy = ""
}

@Article{BarBruOss2007,
author = {Barth\'elemy, J.-P. and Brucker, F.
and Osswald, C.},
title = {Combinatorial optimisation and hierarchical classifications},
journal = {Annals of Operations Research},
year = {2007},
OPTkey = {},
OPTvolume = {153},
OPTnumber = {},
pages = {179--214},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@Article{BarTovTri89,
author = {Bartholdi,  III, J., and C. A. Tovey and M. A. Trick},
title = {Voting schemes for which it can be
difficult to tell who won the election},
journal = {Social Choice and Welfare},
year = {1989},
OPTkey = {},
volume = {6},
OPTnumber = {},
pages = {157--165},
}

@ARTICLE{Baretal2000,
	AUTHOR = "M. Bartholomew-Briggs and S. Brown and B. Christianson and L. Dixon",
	TITLE = "Automatic differentiation of algorithms",
	JOURNAL = {Journal of Computational and Applied Mathematics},
	YEAR = 2000,
	month = "",
	volume = 124,
	number = "",
	pages = "171--190",
	copy = ""
}

@ARTICLE{Bar78b,
	AUTHOR = "A. G. Barto",
	TITLE = "A note on pattern reproduction in tesselation structures",
	JOURNAL = jcss,
	YEAR = 1978,
	month = "",
	volume = 16,
	number = "",
	pages = "445--455",
	copy = ""
}

@ARTICLE{Bar92,
	AUTHOR = "R. Barua",
	TITLE = "The {H}ausdorff-{K}uratowski hierarchy of
{$\omega$}-regular languages and a hierarchy of {M}uller automata",
	JOURNAL = tcs,
	YEAR = 1992,
	month = "",
	volume = 96,
	number = "",
	pages = "345--360",
	copy = ""
}


@ARTICLE{Bar00,
	AUTHOR = "R. Bar-Yehuda",
	TITLE = "One for the price of two: a unified approach for approximating covering problems",
	JOURNAL = alg,
	YEAR = 2000,
	month = "",
	volume = 27,
	number = "",
	pages = "131--144",
	copy = ""
}


@ARTICLE{Bar01,
	AUTHOR = "Bar-Yehuda, R.",
	TITLE = "Using Homogeneous Weights for Approximating the Partial Cover Problem",
	JOURNAL = jalg,
	YEAR = 2001,
	month = "",
	volume = 39,
	number = "",
	pages = "137--144",
	copy = ""
}



@ARTICLE{BarEve81,
	AUTHOR = "R. Bar-Yehuda and S. Even",
	TITLE = "A linear time approximation algorithm for the
		  weighted vertex cover problem",
	JOURNAL = jalg,
	YEAR = 1981,
	month = "",
	volume = 2,
	number = "",
	pages = "198--203",
	copy = ""
}


@INPROCEEDINGS{BarEve82,
	AUTHOR = "R. Bar-Yehuda and S. Even",
	TITLE = "On approximating a vertex cover problem for planar graphs",
	BOOKTITLE = "14th ACM Symposium on the Theory of Computing STOC'82",
	YEAR = 1982,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "303--309",
	address = "",
	organization = "",
	copy = ""
}



@ARTICLE{BarEve85,
	AUTHOR = "R. Bar-Yehuda and S. Even",
	TITLE = "A local-ratio theorem for approximating the
		  weighted vertex cover problem",
	JOURNAL = adm,
	YEAR = 1985,
	month = "",
	volume = 25,
	number = "",
	pages = "27--45",
	copy = ""
}





@UNPUBLISHED{BarKeh02,
        AUTHOR = "R. Bar-Yehuda and Z. Kehat",
        TITLE = "Approximating the dense set-cover problem",
        NOTE = "",
        year = 2002,
	month = "",
	copy = ""
}



@INPROCEEDINGS{BarRaw01,
	AUTHOR = "R. Bar-Yehuda and D. Rawitz",
	TITLE = "On the equivalence between the primal-dual schema and the local-ratio technique",
	BOOKTITLE = "Approximation, Randomization, and Combinatorial Optimization",
	YEAR = 2001,
	month = "",
	volume = "2129",
	editor = "M. Goemans and others",
	series = "LNCS",
	chapter = "",
	pages = "24--35",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}



@ARTICLE{BarRaw01a,
	AUTHOR = "R. Bar-Yehuda and D. Rawitz",
	TITLE = "Efficient Algorithms for Integer Programs with Two Variables per Constraint",
	JOURNAL = alg,
	YEAR = 2001,
	month = "",
	volume = 29,
 	number = "", note = {A preliminary version of this paper appeared in the {\em Proceedings of the 7th Annual European Symposium on Algorithms, ESA'99.}},
	pages = "595--609",
	copy = ""
}


@ARTICLE{Baretal98,
	AUTHOR = "R. Bar-Yehuda and D. Geiger and J. Naor and R.~M. Roth",
	TITLE = "Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and {B}ayesian inference",
	JOURNAL = siam,
	YEAR = 1998,
	month = "",
	volume = 27,
	number = "",
	pages = "942--959",
	copy = ""
}

@INPROCEEDINGS{Baretal2002,
	AUTHOR = "R. Bar-Yehuda and M. H\'alldorsson and J. Naor and H. Shachnai and I. Shapira",
	TITLE = "Scheduling split intervals",
	BOOKTITLE = "Proc. 13th Annual Symposium on Discrete Algorithms SODA",
	YEAR = 2002,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "732--741",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@ARTICLE{Baretal2004,
	AUTHOR = "R. Bar-Yehuda and K. Bendel and A. Freund and D. Rawitz",
	TITLE = "Local ratio: a unified framework for approximation algorithms",
	JOURNAL = {ACM Surveys},
	YEAR = 2004,
	month = "",
	volume = 36,
	number = "4",
	pages = "422--463",
	copy = ""
}

@article{BarRaw2005,
	AUTHOR = "R. Bar-Yehuda and D. Rawitz",
	TITLE = "On the equivalence between the primal-dual schema and the local-ratio technique",
	journal = siamdm,
	YEAR = 2005,
	month = "",
	volume = 19,	pages = "762--797",
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{Bas96,
	AUTHOR = "F. Bassino",
	TITLE = "Star-height of an {$\Bbb N$}-rational series",
	BOOKTITLE = "Proc. of STACS'96",
	YEAR = 1996,
	month = "",
	volume = "1046",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "125--135",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{BasBruRav97,
	AUTHOR = "S. Basagni and D. Bruschi and F. Ravasio",
	TITLE = "On the difficulty of finding walks of length {$k$}",
	JOURNAL = rairoita,
	YEAR = 1997,
	month = "",
	volume = 5,
	number = "",
	pages = "429--435",
	copy = ""
}

@incollection{BasMat2001,
    author = "O. Bastert and C. Matuszewski",
    title = "Layered Drawings of Digraphs",
    booktitle = "Drawing Graphs: Methods and Models",
    number = "2025",
    publisher = "Springer",
    editor = "M. Kaufmann and D. Wagner",
    isbn = "3-540-42062-2",
    pages = "87--120",
    year = "2001",}


@ARTICLE{BatTam96,
	AUTHOR = "G. Di Battista and R. Tamassia",
	TITLE = "On-line maintenance of triconnected components with {SPQR}-trees",
	JOURNAL = alg,
	YEAR = 1996,
	month = "",
	volume = 15,
	number = "",
	pages = "302--318",
	copy = ""
}
@TECHREPORT{BatZav2003,
	AUTHOR = "V. Batagelj and M. Zaver\v snik",
	TITLE = "An $O(m)$ algorithm for cores decomposition of networks",
	INSTITUTION = "Electronic Archive: arXiv:cs.DS",
	YEAR = 2003,
	month = oct,
	number = "0310049",
	address = "",
	copy = ""
}



@INPROCEEDINGS{Bauetal2000,
	AUTHOR = "C. Bauckhage and S. Kronenberg and F. Kummert and G. Sagerer",
	TITLE = "Grammars and discourse theory to describe and recognize mechanical assemblies",
	BOOKTITLE = "Advances in Pattern Recognition, Joint IAPR International Workshops SSPR+SPR'2000",
	YEAR = 2000,
	month = "",
	volume = "1876",
	editor = "F. J. Ferri and others",
	series = "LNCS",
	chapter = "",
	pages = "173--182",
	address = "",
	organization = "",
	copy = ""
}
@INPROCEEDINGS{BauBra2004,
	crossref = "WG2004",
	AUTHOR = "M. Baur and U. Brandes",
	TITLE = "Crossing minimization in circular layouts",
	chapter = "",
	pages = "332--343",
	copy = ""
}

@inproceedings{BazVeg99,
  author    = {C. Bazgan and
               W. F. de la Vega},
  title     = {A Polynomial Time Approximation Scheme for Dense {MIN 2SAT}},
  pages     = {91--99},
  booktitle = {Fundamentals of Computation Theory FCT},
  editor    = {G. Ciobanu and
               G. Paun},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {1684},
  year      = {1999},
}

@INPROCEEDINGS{Bazetal2005,
	AUTHOR = "C. Bazgan and J. Monnot and V. Th. Paschos and F. Serri\'ere",
	TITLE = "Greedy differential approximations for Min Set Cover", 
	BOOKTITLE = "SOFSEM",
	YEAR = 2005,
	month = "",
	volume = "3381",
	editor = "P. Vojt{\'a}{\v s} and M. Bielikov\'a and B. Charron-Bost and O. S\'ykora",
	series = "LNCS",
	chapter = "",
	pages = "62--71",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}
@article{BazHasMon2005,
  author    = {C. Bazgan and
               R. Hassin and
               J. Monnot},
  title     = {Approximation algorithms for some vehicle routing problems},
  journal   = dam,
  volume    = {146},
  number    = {1},
  year      = {2005},
  pages     = {27--42},
}

@ARTICLE{BazTuzVan06,
	AUTHOR = "C. Bazgan and Z. Tuza and D. Vanderpooten",
	TITLE = "The satisfactory partition problem",
	JOURNAL = dam,
	YEAR = 2006,
	month = "",
	volume = 154,
	number = "",
	pages = "1236--1245",
	copy = ""
}

@INPROCEEDINGS{Beaetal96,
	AUTHOR = "M. Beal and others",
	TITLE = "Minimal forbidden words and symbolic dynamics",
	BOOKTITLE = "Proc. of STACS'96",
	YEAR = 1996,
	month = "",
	volume = "1046",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "555--566",
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{Beaetala96a,
	AUTHOR = "M. Beal and others",
	TITLE = "Cyclic languages and strongly cyclic languages",
	BOOKTITLE = "Proc. of STACS'96",
	YEAR = 1996,
	month = "",
	volume = "1046",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "49--59",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{Bea65,
	AUTHOR = "A. F. Beardon",
	TITLE = "On the {H}ausdorff dimension of general {C}antor sets",
	JOURNAL = pcps,
	YEAR = 1965,
	month = "",
	volume = 61,
	number = "",
	pages = "679--694",
	copy = ""
}


@ARTICLE{Bea82,
	AUTHOR = "J. C. Beatty",
	TITLE = "On the relationship between the {LL(1)} and {LR(1)} grammars",
	JOURNAL = jacm,
	YEAR = 1982,
	month = "",
	volume = 29,
	number = "4",
	pages = "1007--1022",
	copy = ""
}


@INPROCEEDINGS{Bea96,
	AUTHOR = "M. Beaudry",
	TITLE = "Languages recognized by finite aperiodic groupoids",
	BOOKTITLE = "Proc. of STACS'96",
	YEAR = 1996,
	month = "",
	volume = "1046",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "113--124",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{Bea79,
	AUTHOR = "J. Beauquier",
	TITLE = "Deux familles de langages incomparables",
	JOURNAL = icalt,
	YEAR = 1979,
	month = "",
	volume = 43,
	number = "",
	pages = "101--122",
	copy = ""
}


@INPROCEEDINGS{Bea84,
	crossref = "NivPer84",
	AUTHOR = "D. Beauquier",
	TITLE = "Ensembles reconnaissables de mots bi-infinis",
	chapter = "Part {I}: {T}he theory of {B\"u}chi and {M}c{N}aughton",
	pages = "28--46",
	copy = ""
}


@ARTICLE{Bea91,
	AUTHOR = "D. Beauquier",
	TITLE = "An undecidable problem about rational sets and
		  contour words of polyominoes",
	JOURNAL = ipl,
	YEAR = 1991,
	month = "",
	volume = 37,
	number = "",
	pages = "257--263",
	copy = ""
}


@INPROCEEDINGS{BeaPin89,
	AUTHOR = "D. Beauquier and J.-E. Pin",
	TITLE = "Factors of words",
	BOOKTITLE = "{LNCS} 372: {ICALP}",
	YEAR = 1989,
	pages = "63--79",
	organization = "{EATCS}",
	copy = ""
}


@InCollection{BeaNiv80,
  author =       "J. Beauquier and M. Nivat",
  editor =       "R. V. Book",
  title =        "Application of formal language theory to problems of
                 security and synchronization",
  booktitle =    "Formal Language Theory--Perspective and Open
                 Problems",
  pages =        "407--454",
  publisher =    "Academic Press",
  address =      "New York",
  year =         "1980",
}




@Article{Beaetal96b,
  author =       "D. Beauquier and M. Nivat and E. Remila and M. Robson",
  title =        "Tiling Figures of the Plane with Two Bars",
  journal =      "CGTA: Computational Geometry: Theory and
                 Applications",
  volume =       "5",
  year =         "1996",
}


@ARTICLE{BecBarGei00,
	AUTHOR = "Becker, A. and Bar-Yehuda, R. and Geiger, D.",
	TITLE = "Randomized Algorithms for the {L}oop {C}utset {P}roblem",
	JOURNAL = {J. Artif. Intell. Res.},
	YEAR = 2000,
	month = "",
	volume = 12,
	number = "",
	pages = "219--234",
	copy = ""
}


@article{BecFor2003,
  author = "D. B\'echet and A. Foret",
  title = "$k$-Valued Non-Associative {L}ambek Grammars are Learnable from Function-Argument
    Structures",
journal = {Electronic Notes in Theoretical Computer Science},
volume = {84}, year = 2003}



@INPROCEEDINGS{BecGei94,
	AUTHOR = "A. Becker and D. Geiger",
	TITLE = "Approximation algorithms for the loop cutset problem",
	BOOKTITLE = "10th Conf. on Uncertainty in Artificial Intelligence",
	YEAR = 1994,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "60--68",
	address = "",
	organization = "",
        publisher = "Morgan Kaufman",
	copy = ""
}


@INPROCEEDINGS{BecHec98,
	AUTHOR = "T. Becker and D. Heckmann",
	TITLE = "Recursive matrix systems ({RMS}) and {TAG}",
	BOOKTITLE = "TAG Workshop, Philadelphia",
	YEAR = 1998,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = "",
        note = {http://www.cis.upenn.edu/~ircs/mol/tag98.html}
}

@inproceedings{BecYoc2004,
  author    = {L. Becerra-Bonache and
               T. Yokomori},
  title     = {Learning Mild Context-Sensitiveness: Toward Understanding
               Children's Language Learning},
  pages     = {53-64},
  editor    = {G. Paliouras and
               Y. Sakakibara},
  booktitle     = {Grammatical Inference: Algorithms and Applications ICGI},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {3264},
  year      = {2004},
}

@INPROCEEDINGS{BecBibDed2005,
	crossref = "Fer05tagi",
	AUTHOR = "L. Becerra Bonache and C. Bibire and A. H. Dediu",
	TITLE = "Learning {DFA} from Corrections",
	pages = "1--11",
	copy = ""
}

@inproceedings{Becetal2007,
  author    = {L. Becerra-Bonache and
               C. de la Higuera and
               J.-C. Janodet and
               F. Tantini},
  title     = {Learning Balls of Strings with Correction Queries},
  pages     = {18--29},
  editor    = {J. N. Kok and
               J. Koronacki and
               R. L{\'o}pez de M{\'a}ntaras and
               S. Matwin and
               D. Mladenic and
               A. Skowron},
  booktitle     = {Machine Learning: ECML 2007},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4701},
  year      = {2007},
}


@Article{BedLemMcK93, 
 author       =         "F. B\'edard and F. L\'emieux and P. McKenzie", 
 title       =         "Extensions to {B}arrington's {M}-Program Model", 
 journal       =         tcs,
 volume       =         "107", 
 year       =         "1993",
pages = {31--61}
} 



@ARTICLE{Bed86,
	AUTHOR = "T. Bedford",
	TITLE = "Dimension and dynamics for fractal recurrent sets",
	JOURNAL = jlms2,
	YEAR = 1986,
	month = "",
	volume = 33,
	number = "",
	pages = "89--100",
	copy = ""
}


@ARTICLE{Bed86a,
	AUTHOR = "T. Bedford",
	TITLE = "Generating special {M}arkov partitions for hyperbolic
toral automorphisms using fractals",
	JOURNAL = etds,
	YEAR = 1986,
	month = "",
	volume = 6,
	number = "",
	pages = "325--333",
	copy = ""
}



@INPROCEEDINGS{Bed88,
	crossref = "Banetal88",
	AUTHOR = "T. Bedford",
	TITLE = "Hausdorff dimension and box dimension in self-similar sets",
	chapter = "Geometric measure theory",
	pages = "17--26",
	copy = ""
}


@ARTICLE{Bed89,
	AUTHOR = "T. Bedford",
	TITLE = "On {W}eierstra\ss-like functions and random recurrent sets",
	JOURNAL = mpcps,
	YEAR = 1989,
	month = "",
	volume = 106,
	number = "",
	pages = "325--342",
	copy = ""
}


@ARTICLE{Bed89a,
	AUTHOR = "T. Bedford",
	TITLE = "H{\"o}lder exponents and and box dimension for
		  self-affine fractal recurrent sets",
	JOURNAL = constappr,
	YEAR = 1989,
	month = "",
	volume = 5,
	number = "",
	pages = "33--48",
	copy = ""
}


@INPROCEEDINGS{Beh2000,
	AUTHOR = "Behrens, R.",
	TITLE = "A Grammar Based Model for {XML} Schema Integration",
	BOOKTITLE = "Advances in Databases, 17th British National Conference on Databases (BNCOD 17)",
	YEAR = 2000,
	month = "",
	volume = "1832",
	editor = "B. Lings and K. Jeffery",
	series = "LNCS",
	chapter = "",
	pages = "172--190",
	address = "", 	publisher = "Springer",
	organization = "",
	copy = ""
}



@INPROCEEDINGS{BehBun99,
	AUTHOR = "Behrens, R. and Buntrock, G.",
	TITLE = "{XML}, eine {V}erwandte der {D}yck-{S}prachen",
	BOOKTITLE = "9.Theorietag der GI-Fachgruppe 0.1.5 Automaten und Formale Sprachen",
	YEAR = 1999,
	month = sep,
	volume = "Preprint 12/99",
	editor = "",
	series = "Mathematische Schriften Kassel",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = ""
}


@TECHREPORT{Behetal99,
	AUTHOR = "Behrens, R. and Buntrock, G. and Lecon, C. and Linnemann, V.",
	TITLE = "Is {XML} really enough?",
	INSTITUTION = "Schriftenreihe der Institute
   f�r Informatik/Mathematik der MU L{\"u}beck",
	YEAR = 1999,
	month = "",
	number = "A-99-11",
	address = "",
	copy = ""
}


@TECHREPORT{BeiEpp95,
	AUTHOR = "R. Beigel and D. Eppstein",
	TITLE = "3-Coloring in time {$O(1.3446^n)$}: a no-{MIS} algorithm",
	INSTITUTION = "ECCC, Trier",
	YEAR = 1995,
	month = "",
	number = "TR95-033",
	address = "",
	copy = ""
}


@INPROCEEDINGS{Beietal96,
	AUTHOR = "A. Beimel and others",
	TITLE = "On the applications of multiplicity automata in learning",
	BOOKTITLE = "Proc. 37th Ann. Symp. Found. Comp. Sci. FOCS'96",
	YEAR = 1996,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "349--358",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{BeiBroHen99,
	AUTHOR = "L. W. Beineke and I. Broere and M. A. Henning",
	TITLE = "Queens graphs",
	JOURNAL = dm,
	YEAR = 1999,
	month = "",
	volume = 206,
	number = "",
	pages = "63--75",
	copy = ""
}


@TECHREPORT{Bel2007,
	AUTHOR = "G.~I. Bell",
	TITLE = "Solving triangular peg solitaire",
	INSTITUTION = "Electronic Archive: arXiv:math",
	YEAR = 2007,
	month = "",
	number = "arXiv:math/07038665v4",
	address = "",
	copy = ""
}

@ARTICLE{BelGro91,
	AUTHOR = "F. Belli and K. E. Grosspietsch",
	TITLE = "Specification of fault-tolerant system issues by predicate/transition nets and regular expressions",
	JOURNAL = ieeetse,
	YEAR = 1991,
	month = "",
	volume = 17,
	number = "6",
	pages = "513--526",
	copy = ""
}


@INPROCEEDINGS{BelFal95,
	AUTHOR = "A. Belussi and C. Faloutsos",
	TITLE = "Estimating the selectivity of spatial queries
 using the `correlation' fractal dimension",
	BOOKTITLE = "21st VLDB'95, Z{\"u}rich",
	YEAR = 1995,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "299--310",
	address = "",
	organization = "",
	copy = ""
}




@InProceedings{BenAmrPet98,
  author =       "Amir M. Ben-Amram and Holger Petersen",
  year =         "1998",
  title =        "Cons-free Programs with Tree Input",
  booktitle =    "Proceedings, 25th Int. Colloquium on Automata,
                 Languages and Programming (ICALP)",
  editor =       "Kim G. Larsen and Sven Skyum and Glynn Winskel",
  publisher =    "Springer",
  series =       "LNCS",
  volume =       "1443",
  pages =        "271--282",
}


@ARTICLE{Benetal95,
	AUTHOR = "Y. Ben-Asher and others",
	TITLE = "The complexity of reconfiguring network models",
	JOURNAL = icneu,
	YEAR = 1995,
	month = "",
	volume = 121,
	number = "1",
	pages = "41--58",
	copy = ""
}

@MASTERSTHESIS{Ben2004,
	AUTHOR = "S. Benecke",
	TITLE = "Higher Order Domination of Graphs",
	SCHOOL = "Department of Applied Mathematics of the University of Stellebosch, South Africa",
	YEAR = 2004,
 	month = "",
	address = "\url{http://dip.sun.ac.za/~vuuren/Theses/Benecke.pdf}",
	type = "Master's Thesis",
	copy = ""
}


@ARTICLE{BenHakSax80,
	AUTHOR = "J. L. Bentley and D. Haken and J. B. Saxe",
	TITLE = "A general method for solving divide-and-conquer
		  recurrences",
	JOURNAL = sigact,
	YEAR = 1980,
	month = "Fall",
	volume = 12,
	number = "",
	pages = "36--44",
	copy = ""
}


@ARTICLE{BenLiMa03,
	AUTHOR = "C.~H. Bennet and M. Li and B. Ma",
	TITLE = "Chain letters and evolutionary histories",
	JOURNAL = {Scientific American},
	YEAR = 2003,
	month = jul,
	volume = 32,
	number = "",
	pages = "32--37",
	copy = ""
}

@inproceedings{Beretal2005,
        author = {T.~Berg and O.~Grinchtein and B.~Jonsson and M.~Leucker and H.~Raffelt and B.~Steffen},
        title = {On the correspondence between conformance testing and regular inference},
        booktitle = {Fundamental Approaches to Software Engineering FASE},
        editor ={M. Cerioli and others},
        publisher = {Springer}, volume = {3442}, 
        series = {LNCS}, pages ={175--189}, 
        year = {2005},
}

@INPROCEEDINGS{BerVar95,
	AUTHOR = "F. Bergadano and S. Varricchio",
	TITLE = "Learning behaviors of automata from shortest counterexamples",
	BOOKTITLE = "Proc. 2nd Europ. Conf. Computational Learning Theory EUROCOLT'95",
	YEAR = 1995,
	month = "",
	volume = "904",
	editor = "P. M. B. Vitanyi",
	series = "LNCS",
	chapter = "",
	pages = "380--391",
	address = "",
	organization = "",
	copy = ""
}



@ARTICLE{Beretal81,
	AUTHOR = "C. Berge and C.~C. Chen and V. Chv\'atal and C.~S. Seow",
	TITLE = "Combinatorial Properties of polyominoes",
	JOURNAL = {Combinatorica},
	YEAR = 1981,
	month = "",
	volume = 1,
	number = "",
	pages = "217--224",
	copy = ""
}

@inproceedings{BerSho90,
  author    = {B. Berger and
               P. W. Shor},
  title     = {Approximation Algorithms for the Maximum Acyclic Subgraph
               Problem},
  booktitle = {ACM-SIAM Symposium on Discrete Algorithms SODA},
  year      = {1990},
  pages     = {236--243},
}

@ARTICLE{BerSho97,
  AUTHOR       = "B. Berger and P. W. Shor",
  TITLE        = "Tight Bounds for the Maximum Acyclic Subgraph Problem",
  JOURNAL      = jalg,
  YEAR         = "1997",
  VOLUME       = "25",
  NUMBER       = "1",
  PAGES        = "1--18",
}


@ARTICLE{Ber88,
	AUTHOR = "M. A. Berger",
	TITLE = "Encoding images through transition probabilities",
	JOURNAL = "Mathematical and Computer Modelling",
	YEAR = 1988,
	month = "",
	volume = 11,
	number = "",
	pages = "575--577",
	copy = ""
}

@TECHREPORT{BerPar2005,
	AUTHOR = "A. Berger and O. Parekh",
	TITLE = "Linear Time Algorithms for Generalized Edge Dominating Set Problems",
	INSTITUTION = "Emory University Math/CS department",
	YEAR = 2005,
	month = "",
	number = "TR-2005-002-A",
	address = "",
	copy = ""
}
@inproceedings{BerChi2004,
  author    = {A. Bergholz and
               B. Chidlovskii},
  title     = {Learning query languages of Web interfaces},
  booktitle = {Proceedings of the 2004 ACM Symposium on Applied Computing SAC},
  year      = {2004},
  pages     = {1114--1121},
  editor    = {H. Haddad and
               A. Omicini and
               R. L. Wainwright and
               L. M. Liebrock},
  publisher = {ACM Press},
  year      = {2004},
}

 @INPROCEEDINGS{Ber83,
   AUTHOR = 	"F. Berman",
   TITLE = 	"Edge Grammars and parallel computation",
   BOOKTITLE = 	"Proceedings of the 1983 Allerton Conference",
   YEAR = 	"1983",
   EDITOR = 	"",
   PAGES = 	"214--223",
   ORGANIZATION = 	"",
   PUBLISHER = 	"",
   ADDRESS = 	"",
   MONTH = 	"",
   note = 	""
 }



@ARTICLE{BerDas97,
	AUTHOR = "P. Berman and B. DasGupta",
	TITLE = "On the complexities of efficient solutions of the rectilinear polygon cover problem",
	JOURNAL = alg,
	YEAR = 1997,
	month = "",
	volume = 17,
	number = "",
	pages = "331--356",
	copy = ""
}


@misc{BerDas98,
  author = "P. Berman and B. DasGupta",
  title = "On Approximating the Corner Cover Problem",
  url = "citeseer.ist.psu.edu/152085.html" ,
year = "1998",
note = {2nd CGC workshop on Computational Geometry, Duke University, October 1997 (abstract only)}
}

@INPROCEEDINGS{BerDasSon2004,
	AUTHOR = "P. Berman and B. DasGupta and E. Sontag",
	TITLE = {Randomized approximation algorithms for set multicover problems
               with applications to reverse engineering of protein and
               gene networks},
	BOOKTITLE = {Approximation, Randomization, and Combinatorial Optimization,    Algorithms and Techniques, 7th International Workshop on
               Approximation Algorithms for Combinatorial Optimization
               Problems, APPROX 2004, and 8th International Workshop on
               Randomization and Computation, RANDOM 2004, Proceedings},
	YEAR = 2004,
	month = "",
	volume = "3122",
	editor = "K. Jansen and S. Khanna and J. D. P. Rolim and D. Ron",
	series = "LNCS",
	chapter = "",
	pages = "39--50",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{BerFuj95,
	AUTHOR = "P. Berman and T. Fujito",
	TITLE = "On approximation properties of the independent set problem for degree 3 graphs",
	BOOKTITLE = "Algorithms and Data Structures WADS",
	YEAR = 1995,
	month = "",
	volume = "955",
	editor = "S. G. Akl and others",
	series = "LNCS",
	chapter = "",
	pages = "449--460",
	address = "",
	organization = "",
	copy = ""
}



@INPROCEEDINGS{BerFur94,
	AUTHOR = {P. Berman and M. F{\"u}rer},
	TITLE = "Approximating maximum independent set in bounded degree graphs",
	BOOKTITLE = "Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms SODA'94",
	YEAR = 1994,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "365--371",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}


@INPROCEEDINGS{BerRoo87,
	AUTHOR = "P. Berman and R. Roos",
	TITLE = "Learning one-counter languages in polynomial time",
	BOOKTITLE = "Proc. 28th Symposium on Foundations of Computer Science FOCS",
	YEAR = 1987,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "61--67",
	address = "",
	organization = "IEEE",
	copy = ""
}


 @INPROCEEDINGS{BerSha84,
   AUTHOR = 	"F. Berman and G. Shannon",
   TITLE = 	"Edge Grammars: Decidability results and formal
		    language issues",
   BOOKTITLE = 	"Proceedings of the 1984 Allerton Conference",
   YEAR = 	"1984",
   EDITOR = 	"",
   PAGES = 	"921--930",
   ORGANIZATION = 	"",
   PUBLISHER = 	"",
   ADDRESS = 	"",
   MONTH = 	"",
   note = 	""
 }


@ARTICLE{BerSha93,
	AUTHOR = "F. Berman and G. E. Shannon",
	TITLE = "Representing graph families with edge grammars",
	JOURNAL = infsci,
	YEAR = 1993,
	month = "",
	volume = 70,
	number = "",
	pages = "241--269",
	copy = ""
}


@inproceedings{BerSim88,
   author = "Berman, Piotr and Simon, Janos",
   title = "Investigations of Fault-Tolerant Networks of Computers",
   booktitle = "Proc. of the 20-th Annual ACM Symp. on the Theory of
Computing",
   year = "1988",
   pages = "66 -- 77"
   }



 @ARTICLE{BerSny87,
	   AUTHOR = "F. Berman and L. Snyder",
	   TITLE = "On mapping parallel algorithms into parallel architectures",
	   JOURNAL = jpdc,
	   YEAR = 1987,
	   VOLUME = 4,
	   NUMBER = "",
	   PAGES = "439--458",
	   copy = ""
 }

@ARTICLE{BerDasMut2003,
	AUTHOR = "P. Berman and B. DasGupta  and S. Muthukrishnan",
	TITLE = "Approximation algorithms for {MAX-MIN} tiling",
	JOURNAL = jalg,
	YEAR = 2003,
	month = "",
	volume = 47,
	number = "",
	pages = "122--134",
	copy = ""
}

@inproceedings{BerDasKao2004,
  author    = {P. Berman and
               B. DasGupta and
               M.-Y. Kao},
  title     = {Tight Approximability Results for Test Set Problems in Bioinformatics},
  booktitle = {Scandinavian Workshop
               on Algorithm Theory SWAT},
  year      = {2004},
  pages     = {39--50},
  editor    = {T. Hagerup and
               J. Katajainen},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {3111},
}

@article{BerDasKao2005,
 author    = {P. Berman and
               B. DasGupta and
               M.-Y. Kao},
  title     = {Tight Approximability Results for Test Set Problems in Bioinformatics},
  journal   = jcss,
  volume    = {71},
  number    = {2},
  year      = {2005},
  pages     = {145--162},
}

@ARTICLE{BerDelQui86,
	   AUTHOR = "J.-C. Bermon and C. Delorme and J.-J. Quisquater",
	   TITLE = "Strategies for interconnection networks:
		    Some methods from graph theory",
	   JOURNAL = jpdc,
	   YEAR = 1986,
	   VOLUME = 3,
	   NUMBER = "",
	   PAGES = "433--449",
	   copy = ""
 }


@ARTICLE{BerLawWon87,
	AUTHOR = "M. Bern and E. Lawler and A. Wong",
	TITLE = "Linear time computation of optimal subgraphs of decomposable graphs",
	JOURNAL = jalg,
	YEAR = 1987,
	month = "",
	volume = 8,
	number = "",
	pages = "216--235",
	copy = ""
}

@INPROCEEDINGS{BerHig99,
	AUTHOR = "M. Bernard and C. de la Higuera",
	TITLE = "{GIFT:} Grammatical Inference for Terms",
	BOOKTITLE = "Conf\'erence d'Apprentissage, Palaiseau",
	YEAR = 1999,
	month = may,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
        publisher = "",
	note = {English version: Late breaking paper of International Conference on Inductive Logic Programming; French journal version: Apprentissage de programmes logiques
 par inf\'erence grammaticale. {\em Revue d'Intelligence Artificielle},
14:375--396, 2001.
}
}

@ARTICLE{Ber97,
	AUTHOR = "L. Bern\'atsky",
	TITLE = "Regular expression star-freeness is {PSPACE}-complete",
	JOURNAL = actacybern,
	YEAR = 1997,
	month = "",
	volume = 13,
	number = "1",
	pages = "1--22",
	copy = ""
}

@ARTICLE{BerKai79,
	AUTHOR = "F. Bernhart and P. Kainen",
	TITLE = "The book thickness of a graph",
	JOURNAL = jcthb,
	YEAR = 1979,
	month = "",
	volume = 27,
	number = "",
	pages = "320--331",
	copy = ""
}

@article{BerBorCog2000,
    author = "A. Berry and J.-P. Bordat and O. Cogis",
    title = "Generating All the Minimal Separators of a Graph",
    journal = ijfcs,
    volume = "11",
    number = "3",
    pages = "397--403",
    year = "2000",
}

@INPROCEEDINGS{BerBou90,
	AUTHOR = "G. Berry and G. Boudol",
	TITLE = "The chemical abstract machine",
	BOOKTITLE = "17th. Annual ACM Symposium on Principles of
Programming Languages",
	YEAR = 1990,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "81--94",
	address = "London",
	organization = "{ACM}",
	copy = ""
}



@ARTICLE{BerSet86,
	AUTHOR = "G. Berry and R. Sethi",
	TITLE = "From regular expressions to deterministic automata",
	JOURNAL = tcs,
	YEAR = 1986,
	month = "",
	volume = 48,
	number = "",
	pages = "117--126",
	copy = ""
}

@article{BerGas2000,
  author    = {V. Berry and
               O. Gascuel},
  title     = {Inferring evolutionary trees with strong combinatorial evidence},
  journal   = tcs,
  volume    = {240},
  number    = {2},
  year      = {2000},
  pages     = {271-298},
}


@ARTICLE{BerCrmJes99,
	AUTHOR = "M.~W. Berry and Z. Drma\v c and E.~R. Jessup",
	TITLE = "Matrices, vector spaces, and information retrieval",
	JOURNAL = {SIAM Review},
	YEAR = 1999,
	month = "",
	volume = 41,
	number = "",
	pages = "335--362",
	copy = ""
}


@INPROCEEDINGS{BerNic2004,
	AUTHOR = "V. Berry and F. Nicolas",
	TITLE = "Maximum Agreement and Compatible Supertrees",
	BOOKTITLE = "15th Ann. Combinatorial Pattern Matching Symposium (CPM)",
	YEAR = 2004,
	month = "",
	volume = "3109",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "205--219",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@ARTICLE{Ber86,
	AUTHOR = "J. Berstel",
	TITLE = "Every iterated morphism yields a co-{CFL}",
	JOURNAL = ipl,
	YEAR = 1986,
	month = "",
	volume = 22,
	number = "",
	pages = "7--9",
	copy = ""
}

@INPROCEEDINGS{Ber90,
	AUTHOR = "J. Berstel",
	TITLE = "Axel {T}hue's Work on Repetitions in Words",
	BOOKTITLE = "S\'eries Formelles et Combinatoire Alg\'ebrique",
	YEAR = 1990,
	month = "",
	volume = "",
	editor = "P. Leroux and C. Reutenauer ",
	series = "Publications du LaCIM",
	chapter = "",
	pages = "65--80",
	address = "",
	organization = "Universit\'e du Qu\'ebec a Montr\'eal",
	copy = ""
}



@ARTICLE{BerSee94,
	AUTHOR = "J. Berstel and P. S\'e\'ebold",
	TITLE = "Morphismes de {S}turm",
	JOURNAL = bullbelgmathsoc,
	YEAR = 1994,
	month = "",
	volume = 1,
	number = "",
	pages = "175--189",
	copy = ""
}



@INPROCEEDINGS{BerBoa2000,
	AUTHOR = "J. Berstel and L. Boasson",
	TITLE = "{XML} grammars",
	BOOKTITLE = "Mathematical Foundations of Computer Science (MFCS'2000)",
	YEAR = 2000,
	month = "",
	volume = "1893",
	editor = "N. Nielsen and B. Rovan",
	series = "LNCS",
	chapter = "",
	pages = "182--191",
	address = "", publisher = {Springer}, 
	organization = "", 
note = "Long Version as Technical Report IGM 2000-06, see {\tt www-igm.univ-mlv.fr/\~{}berstel/Recherche.html}",
	copy = ""
}

@Article{BerBoa2002,
  author =       "J. Berstel and L. Boasson",
  title =        "Formal properties of {XML} grammars and languages",
  journal =      actainform,
  volume =       "38",
  number =       "9",
  pages =        "649--671",
  month =        aug,
  year =         "2002",
}

@INPROCEEDINGS{BerMor89,
	AUTHOR = "J. Berstel and M. Morcrette",
	TITLE = "Compact representation of patterns by finite automata",
	BOOKTITLE = "Pixim'89 --- Computer Graphics in Paris --- 2nd
Annual Conference on Computer Graphics; Selected Papers",
	YEAR = 1989,
	month = "",
	volume = "",
	editor = "",
	PUBLISHER = "???",
	series = "",
	chapter = "",
	pages = "387--401",
	address = "",
	organization = "",
	copy = ""
}


@INBOOK{BerNie76,
	AUTHOR = "J. Berstel and M. Nielsen",
	TITLE = "The growth range equivalence problem for {D0L}
systems is decidable",
	PAGES = "161--178",
	BOOKTITLE = "Automata, Languages, Development",
	PUBLISHER = "North-Holland",
	YEAR = 1976,
	month = "",
	address = "",
	volume = "",
	series = "",
	type = "",
	copy = ""
}
@Article{Beretao2007,
author = {V. Berth\'e and H. Ei and S. Ito and H. Rao},
title = {On substitution invariant {S}turmian words: an application of {R}auzy fractals},
journal = rairoita,
year = {2007},
OPTkey = {},
volume = {41},
OPTnumber = {},
pages = {329--349},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@ARTICLE{Ber88a,
	AUTHOR = "J. Bertoin",
	TITLE = "Sur la mesure d'occupation d'une classe de fonctions self-affines",
	JOURNAL = jjam,
	YEAR = 1988,
	month = "",
	volume = 3,
	number = "",
	pages = "431--439",
	copy = ""
}


@ARTICLE{BerDruGol91,
	AUTHOR = "A. Bertoni and D. Bruschi and M. Goldwurm",
	TITLE = "Ranking and formal power series",
	JOURNAL = tcs,
	YEAR = 1991,
	month = "",
	volume = 79,
	number = "",
	pages = "25--35",
	copy = ""
}



@ARTICLE{BerGol93,
	AUTHOR = "A. Bertoni and M. Goldwurm",
	TITLE = "On ranking 1-way finitely ambiguous {NL} languages
		  and {$\#P_1$}-complete census functions",
	JOURNAL = rairoita,
	YEAR = 1993,
	month = "",
	volume = 27,
	number = "2",
	pages = "135--148",
	copy = ""
}


@ARTICLE{BerGolMas90,
	AUTHOR = "A. Bertoni and M. Goldwurm and P. Massazza",
	TITLE = "Counting problems and algebraic formal power series
		  in noncommuting variables",
	JOURNAL = ipl,
	YEAR = 1990,
	month = "",
	volume = 34,
	number = "",
	pages = "117--121",
	copy = ""
}


@ARTICLE{Beretal92,
	AUTHOR = "A. Bertoni and P. Massazza and N. Sabadini",
	TITLE = "Holonomic generating functions and context free languages",
	JOURNAL = ijfcs,
	YEAR = 1992,
	month = "",
	volume = 3,
	number = "2",
	pages = "181--191",
	copy = ""
}

@INPROCEEDINGS{BerChoPal2006,
	AUTHOR = "A. Bertoni and C.  Choffrut and B. Palano",
	TITLE = "Context-Free Grammars and {XML} Languages ",
	BOOKTITLE = "Developments in Language Theory DLT",
	YEAR = 2006,
	month = "",
	volume = "4036",
	editor = "O. H. Ibarra and Z. Dang",
	series = "LNCS",
	chapter = "",
	pages = "108--119",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}



@ARTICLE{BerGas2005,
	AUTHOR = "D. Bertrand and O. Gascuel",
	TITLE = "Topological rearrangements and local search method for tandem duplication trees",
	JOURNAL = ieeeacmtcbbi,
	YEAR = 2005,
	month = "",
	volume = 2,
	number = "",
	pages = "15--28",
	copy = ""
}

@article{BerTeoVoh99,
  author    = {D. Bertsimas and
               C.-P. Teo and
               R. Vohra},
  title     = {On dependent randomized rounding algorithms},
  journal   = {Oper. Res. Lett.},
  volume    = {24},
  number    = {3},
  year      = {1999},
  pages     = {105--114},
}

@ARTICLE{Bes25,
	AUTHOR = "A. S. Besicovitch (Besikowitsch, Bezicovi\v{c})",
	TITLE = "Diskussion der stetigen {F}unktionen im
		  {Z}usammenhang mit der {F}rage {\"u}ber ihre
		  {D}ifferenzierbarkeit",
	JOURNAL = basr,
	YEAR = 1925,
	month = "",
	volume = 19,
	number = "",
	pages = "527--540",
	copy = ""
}


@ARTICLE{Bes27,
	AUTHOR = "A. S. Besicovitch",
	TITLE = "On the fundamental properties of linearly measurable
plane sets of points",
	JOURNAL = ma,
	YEAR = 1927,
	month = "",
	volume = 98,
	number = "",
	pages = "422--464",
	copy = ""
}


@ARTICLE{Bes38,
	AUTHOR = "A. S. Besicovitch",
	TITLE = "On the fundamental properties of linearly measurable
plane sets of points ({II})",
	JOURNAL = ma,
	YEAR = 1938,
	month = "",
	volume = 115,
	number = "",
	pages = "296--329",
	copy = ""
}


@ARTICLE{Bes39,
	AUTHOR = "A. S. Besicovitch",
	TITLE = "On the fundamental properties of linearly measurable
plane sets of points ({III})",
	JOURNAL = ma,
	YEAR = 1939,
	month = "",
	volume = 116,
	number = "",
	pages = "349--357",
	copy = ""
}



@ARTICLE{BesTay54,
	AUTHOR = "A. S. Besicovitch and S.J. Taylor",
	TITLE = "On the complementary intervals of a linear closed set
of zero {L}ebesgue measure",
	JOURNAL = jlms,
	YEAR = 1954,
	month = "",
	volume = 29,
	number = "",
	pages = "449--459",
	copy = ""
}


@INPROCEEDINGS{BesMar01,
	AUTHOR = "J. Besombes and J.-Y. Marion",
	TITLE = "Identification of reversible dependency tree languages",
	BOOKTITLE = "Proc. 3rd Workshop on Learning Languages in Logic LLL'01",
	YEAR = 2001,
	month = sep,
	volume = "",
	editor = "L. Popel\'{\i}nsk\'y and M. Nepil",
	series = "",
	chapter = "",
	pages = "11--22",
	address = "",
	organization = "Technical report FIMU-RS-2001-08, FI MU Brno, Czech Republic, see \url{http://www.fi.muni.cz/ilpnet2/LLL2001/#proceedings}",
        publisher = "",
	copy = ""
}

@inproceedings{BesMar2004,
  author    = {J. Besombes and
               J.-Y. Marion},
  title     = {Learning Tree Languages from Positive Examples and Membership
               Queries},
  year      = {2004},
  pages     = {440--453},
  editor    = {S. Ben-David and
               J. Case and
               A. Maruoka},
  booktitle     = {Algorithmic Learning Theory, 15th International Conference,
               ALT},
  publisher = {Springer},
  series    = {LNCS/LNAI},
  volume    = {3244},
}


@ARTICLE{Bes42,
	AUTHOR = "E. Best",
	TITLE = "On sets of fractional dimension ({III})",
	JOURNAL = plms2,
	YEAR = 1942,
	month = "",
	volume = 57,
	number = "",
	pages = "436--454",
	copy = ""
}

@ARTICLE{Bet95,
	AUTHOR = "S. Bettayeb",
	TITLE = "On the {$k$}-ary hypercube",
	JOURNAL = tcs,
	YEAR = 1995,
	month = "",
	volume = 140,
	number = "",
	pages = "333--339",
	copy = ""
}

@InProceedings{Betetal2008,
author = {N. Betzler and M. R. Fellows and
               J. Guo and
               R. Niedermeier and
               F. A. Rosamond},
  title     = {Fixed-Parameter Algorithms for {K}emeny Scores},
booktitle = {Algorithmic Aspects in Information and Management AAIM 2008},
OPTcrossref = {},
OPTkey = {},
pages = {60--71},
year = {2008},
editor = {R. Flei\-scher and J. Xu},
volume = {5034},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}

@InProceedings{Betetal2008a,
author = {N. Betzler and
               J. Guo and
               R. Niedermeier},
  title     = {Parameterized Computational Complexity
of {D}odgson and {Y}oung Elections},
booktitle = {Proc. 11th Scandinavian Workshop on Algorithm Theory SWAT},
OPTcrossref = {},
OPTkey = {},
pages = {402--413},
year = {2008},
editor = {J. Gudmundsson},
volume = {5124},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}


@InProceedings{BetUhl2008,
author = {N. Betzler and
               J. Uhlmann},
  title     = {Parameterized  Complexity
of Candidate Control in Elections and Related Digraph Problems},
booktitle = {Proc. 2nd COCOA},
OPTcrossref = {},
OPTkey = {},
pages = {To appear},
year = {2008},
editor = {},
volume = {},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}



@INPROCEEDINGS{Bexetal2006,
	AUTHOR = "G. J. Bex and F. Neven and T. Schwentick and K. Tuyls",
	TITLE = "Inference of concise {DTD}s from {XML} data",
	BOOKTITLE = "32nd International Conference on Very Large Data Bases VLDB",
	YEAR = 2006,
	month = "",
	volume = "",
	series = "",
	chapter = "",
	pages = "115--126",
	address = "", 
editor    = {U. Dayal and
               K.-Y. Whang and
               D. B. Lomet and
               G. Alonso and
               G. M. Lohman and
               M. L. Kersten and
               S. K. Cha and
               Y.-K. Kim},
  publisher = {ACM},
	organization = "",
	copy = ""
}


@ARTICLE{BeyMauSte86,
	AUTHOR = "W. A. Beyer and R. D. Mauldin and P. R. Stein",
	TITLE = "Shift-maximal sequences in function iteration:
{E}xistence, uniqueness, and multiplicity",
	JOURNAL = jmaa,
	YEAR = 1986,
	month = "",
	volume = 115,
	number = "",
	pages = "305--362",
	copy = ""
}


@INPROCEEDINGS{BhaSah86,
	AUTHOR = "J. Bhasker and S. Sahni",
	TITLE = "Via assignment in single row routing",
	BOOKTITLE = "FST \& TCS'86",
	YEAR = 1986,
	month = "",
	volume = "241",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "154--176",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{BhaSah87,
	AUTHOR = "J. Bhasker and S. Sahni",
	TITLE = "Optimal linear arrangement of circuit components",
	JOURNAL = {Journal of VLSI and Comp. Sys.},
	YEAR = 1987,
	month = "",
	volume = 2,
	number = "1-2",
	pages = "87--109",
	copy = ""
}

@InProceedings{BhaRajKat94,
author = {Bhatia, D., and Rajagopalan, R., and Katkoori, S.},
title = {Hierarchical reconfiguration of {VLSI/WSI} arrays},
booktitle = {Proceedings of the Seventh International Conference on VLSI Design},
OPTcrossref = {},
OPTkey = {},
pages = {349--352},
year = {1994},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}

@INPROCEEDINGS{BhaKhuPle98,
   author = "R. Bhatia and S. Khuller and R. Pless and Y.~J. Sussmann",
    title = "The Full Degree Spanning Tree Problem",
    booktitle = "Symposium on Discrete Algorithms SODA",
    pages = "864-865",
    year = "1999",
        publisher = "ACM Press",
	copy = "", note ={Full version: Computer Science Department, Technical Report CS-TR-3931, Univ. of Maryland, (1998)}
}


 @ARTICLE{BhaChuLeiRos86,
	   AUTHOR = "S. Bhatt and F. Chung and T. Leighton and A. Rosenberg",
	   TITLE = "Optimal Simulation of Tree Machines",
	   JOURNAL = ieeetoc,
	   YEAR = 1986,
	   VOLUME = "",
	   NUMBER = "",
	   PAGES = "274--282",
	   copy = "vielleicht doch nicht ieeetoc"
 }

@ARTICLE{BhaMohGup,
	AUTHOR = "U.K. Bhattacharyya and G. Mohan and I.S. Gupta",
	TITLE = "Parallel fault simulation on a multiprocessor",
	JOURNAL = ijss,
	YEAR = 1992,
	month = "",
	volume = 23,
	number = "11",
	pages = "2025--2035",
	copy = ""
}

@ARTICLE{BhaEdm97,
	AUTHOR = "D. K. Bhavsar and J. H. Edmondson",
	TITLE = "Alpha 21164 testability strategy",
	JOURNAL = ieeedat,
	YEAR = 1997,
	month = "",
	volume = 14,
	number = "1",
	pages = "25--33",
	copy = ""
}

@INPROCEEDINGS{Bic84,
	AUTHOR = "L. Bic",
	TITLE = "Execution of logic programs on a dataflow architecture",
	BOOKTITLE = "The 11th Annual International Symposium on
Computer Architecture",
	YEAR = 1984,
	month = jun,
	volume = "",
	editor = "{IEEE} and {ACM}",
	series = "",
	chapter = "",
	pages = "290--296",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{BieKanKau97,
	AUTHOR = "T. Biedl and G. Kant and M. Kaufmann",
	TITLE = "On triangulating planar graphs under the four-connectivity constraint",
	JOURNAL = alg,
	YEAR = 1997,
	month = "",
	volume = 19,
	number = "",
	pages = "427--449",
	copy = ""
}

@INCOLLECTION{Bieetal2002,
	AUTHOR = "T. C. Biedl and E. D. Demaine and M. L. Demaine and R. Fleischer and L. Jacobsen and J. I. Munro",
	TITLE = "The Complexity of Clickomania",
	BOOKTITLE = "More Games of No Chance. Collection of papers from the MSRI Combinatorial Game Theory Research Workshop, Berkeley, California, July 24-28, 2000",
	PUBLISHER = "Cambridge University Press",
	YEAR = 2002,
	month = "",
	volume = "",
	editor = "R. J. Nowakowski",
	series = "",
	chapter = "",
	pages = "389--404",
	address = "",
	type = "",
	copy = ""
}
 
@TECHREPORT{Bieetal01,
	AUTHOR = "T. Biedl and B. Brejov\'a and E.~D. Demaine and A.~M. Hamel and T. Vinar\v r",
	TITLE = "Optimal arrangement of leaves in the tree representing hierarchical clustering of gene expression data",
	INSTITUTION = "Dept. of Computer Science, University of Waterloo",
	YEAR = 2001,
	month = "",
	number = "2001--14",
	address = "",
	copy = ""
}

@inproceedings{BieBra2005,
  author    = {T. C. Biedl and
               F.-J. Brandenburg},
  title     = {Drawing planar bipartite graphs with small area},
  booktitle = {Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG'05},
  year      = {2005},
  pages     = {105--108},
  note        = {\url{http://www.cccg.ca/proceedings/2005/11.pdf}},
}

@inproceedings{BieBraDen2005,
  author    = {T. C. Biedl and
               F.-J. Brandenburg and
               X. Deng},
  title     = {Crossings and Permutations},
  booktitle = {Graph Drawing GD 2005},
  editor    = {P. Healy and
               N. S. Nikolov},
  pages     = {1--12},
  publisher = {Springer},
series = {LNCS},
  volume    = {3843},
  year      = {2006}
}

@INBOOK{Bie,
	   AUTHOR = "H. Bielak",
	   TITLE = "On j-neighbourhoods in digraphs",
	   PAGES = "12--16",
	   PUBLISHER = "Teubner DDR",
	   YEAR = "19??",
	   VOLUME = 59,
	   SERIES = ttzm,
	   copy = ""
 }



@ARTICLE{BieMon90,
	AUTHOR = "D. Bienstock and C.L. Monma",
	TITLE = "On the complexity of embedding planar graphs to minimize certain distance measures",
	JOURNAL = alg,
	YEAR = 1990,
	month = "",
	volume = 5,
	number = "",
	pages = "93--109",
	copy = ""
}



@ARTICLE{BieFel72,
	AUTHOR = "A.W. Biermann and J.A. Feldman",
	TITLE = "On the synthesis of finite-state machines from samples and their behavior",
	JOURNAL = ieeetoc,
	YEAR = 1972,
	month = "",
	volume = 21,
	number = "",
	pages = "592--597",
	copy = ""
}


@ARTICLE{BieKri76,
	AUTHOR = "A. W. Biermann and R. Krishnaswamy",
	TITLE = "Constructing programs from example computations",
	JOURNAL = {IEEE Trans. Softw. Eng.},
	YEAR = 1976,
	month = "",
	volume = 2,
	number = "",
	pages = "141--153",
	copy = ""
}


@TECHREPORT{Bil2003,
	AUTHOR = "P. Bille",
	TITLE = "Tree edit distance, alignment distance and inclusion",
	INSTITUTION = "The IT University of Copenhagen",
	YEAR = 2003,
	month = "",
	number = "TR-2003-23",
	address = "",
	copy = ""
}

@article{Bil2005,
  author    = {P. Bille},
  title     = {A survey on tree edit distance and related problems.},
  journal   = tcs,
  volume    = {337},
  year      = {2005},
  pages     = {217--239},
}

@ARTICLE{Bil60,
	AUTHOR = "P. Billingsley",
	TITLE = "Hausdorff dimension in probability theory",
	JOURNAL = illjm,
	YEAR = 1960,
	month = "",
	volume = 4,
	number = "",
	pages = "187--209",
	copy = ""
}

@ARTICLE{Bil61,
	AUTHOR = "P. Billingsley",
	TITLE = "Hausdorff dimension in probability theory {II}",
	JOURNAL = illjm,
	YEAR = 1961,
	month = "",
	volume = 5,
	number = "",
	pages = "291--298",
	copy = ""
}



 @ARTICLE{BilJin84,
	   AUTHOR = "G. Bilardi and X. Jin",
	   TITLE = "Permutation-exchange graphs that emulate the binary cube",
	   JOURNAL = mst,
	   YEAR = 1984,
	   VOLUME = 17,
	   NUMBER = "",
	   PAGES = "193--198",
	   copy = ""
 }



@Article{Bil93, 
 author = "D. Billington", 
 title = "Using the Context-Free Pumping Lemma", 
 journal = jacm,
 volume = "36",
pages = "21,81",
 year = "1993", 
}



@ARTICLE{Bir77,
	AUTHOR = "R. S. Bird",
	TITLE = "Two dimensional pattern matching",
	JOURNAL = ipl,
	YEAR = 1977,
	month = "",
	volume = 6,
	number = "5",
	pages = "168--170",
	copy = ""
}



@ARTICLE{Bir91,
	AUTHOR = "J.-C. Birget",
	TITLE = "Strict local testability of the finite control of two-way automata and of regular picture discription languages",
	JOURNAL = {International Journal of Algebra and Computation},
	YEAR = 1991,
	month = "",
	volume = 1,
	number = "",
	pages = "161--175",
	copy = ""
}



@article{BirBokSim2000,
	AUTHOR = "A. Birkendorf and A. B{\"o}ker and H.U. Simon",
	TITLE = "Learning deterministic finite automata from smallest counterexamples",
	journal = siamdm,
	YEAR = 2000,
	month = "",
	volume = "13",
	editor = "",
	series = "",
	chapter = "",
	pages = "465--491",
	address = "",
	organization = "",
	copy = ""
}

@TECHREPORT{BjoSanVor2003,
	AUTHOR = "H. Bj{\"o}rklund and S. Sandberg and S. Vorobyov",
	TITLE = "On Fixed-Parameter Complexity of Infinite Games",
	INSTITUTION = "Uppsala University,   Department of Information Technology",
	YEAR = 2003,
	month = aug,
	number = "2003-038",
	address = "",
	copy = ""
}

@TECHREPORT{Bjoetal2006,
	AUTHOR = "A. Bj{\"o}rklund and T. Husfeldt and P. Kaski and M. Koivisto",
	TITLE = "Fourier meets {M}{\"o}bius: fast subset convolution",
	INSTITUTION = "X archive: arXiv:cs/0611101v1 [cs.DS]",
	YEAR = 2006,
	month = "",
	number = "",
	address = "", note = {Also: STOC 2007, pp. 67--74}, 
	copy = ""
}

@INPROCEEDINGS{Bjoetal2007,
	AUTHOR = "A. Bj{\"o}rklund and T. Husfeldt and P. Kaski and M. Koivisto",
	TITLE = "Fourier meets {M}{\"o}bius: fast subset convolution",
	BOOKTITLE = "STOC",
	YEAR = 2007,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "67--74",
	address = "",
	organization = "",
        publisher = "ACM Press",
	copy = ""
}



@INPROCEEDINGS{BjoHus2006,
	AUTHOR = "A. Bj{\"o}rklund and T. Husfeldt",
	TITLE = "Exact algorithms for exact satisfiability and number of perfect matchings",
	BOOKTITLE = "33rd International Colloquium on Automata, Languages, and Computation ICALP",
	YEAR = 2006,
	month = "",
	volume = "4051",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "548--559",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@InProceedings{Bjoetal2008,
author = {A. Bj{\"o}rklund and T. Husfeldt and P. Kaski and M. Koivisto},
title = {Trimmed {M}{\"o}bius inversion and graphs of bounded degree},
booktitle = {Symposium on Theoretical Aspects of Computer Science STACS},
OPTcrossref = {},
OPTkey = {},
pages = {85--96},
year = {2008},
editor = {S. Albers and P. Weil},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {}, publisher ={Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
OPTnote = {},
OPTannote = {}
}
@InProceedings{bjrklund_et_al:DSP:2008:1336,
  author ={Andreas Bj{\"o}rklund and Thore Husfeldt and Petteri Kaski and Mikko Koivisto},
  title ={Trimmed Moebius Inversion and Graphs of Bounded Degree (pp. 85-96)},
  booktitle ={25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008)},
  year ={2008},
  editor ={Susanne Albers and Pascal Weil},
  publisher ={Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address ={Dagstuhl, Germany},
  URL ={http://drops.dagstuhl.de/opus/volltexte/2008/1336},
}
@INCOLLECTION{Bla2001,
	AUTHOR = "Blackwell, A.~F.",
	TITLE = "{SWYN}: A Visual Representation for Regular Expressions",
	BOOKTITLE = "Your wish is my command: Giving users the power to instruct their software",
	PUBLISHER = "Morgan Kaufmann",
	YEAR = 2001,
	month = "",
	volume = "",
	editor = "H. Lieberman",
	series = "",
	chapter = "",
	pages = "245--270",
	address = "",
	type = "",
	copy = ""
}

@ARTICLE{Bla2001a,
	AUTHOR = "Blackwell, A.~F.",
	TITLE = "See What You Need: Helping end users to build abstractions",
	JOURNAL = {Journal of Visual Languages and Computing},
	YEAR = 2001,
	month = "",
	volume = 12,
	number = "",
	pages = "475--499",
	copy = ""
}

@ARTICLE{Bla81,
	AUTHOR = "F. Blanchard",
	TITLE = "Syst\'emes dynamiques topologiques associ\'es \`a des
automates r\'ecurrents",
	JOURNAL = zwvg,
	YEAR = 1981,
	month = "",
	volume = 58,
	number = "",
	pages = "549--564",
	copy = ""
}



@ARTICLE{Bla89,
	AUTHOR = "F. Blanchard",
	TITLE = "Codes engendrant certains syst\`emes sofiques",
	JOURNAL = tcs,
	YEAR = 1989,
	month = "",
	volume = 68,
	number = "",
	pages = "253--265",
	copy = ""
}


@ARTICLE{Bla89a,
	AUTHOR = "F. Blanchard",
	TITLE = "{$\beta$}-expansions and symbolic dynamics",
	JOURNAL = tcs,
	YEAR = 1989,
	month = "",
	volume = 65,
	number = "",
	pages = "131--141",
	copy = ""
}



@ARTICLE{BlaPer80,
	AUTHOR = "F. Blanchard and D. Perrin",
	TITLE = "Rel\`evement d'une mesure ergodique par un codage",
	JOURNAL = zwvg,
	YEAR = 1980,
	month = "",
	volume = 54,
	number = "",
	pages = "303--311",
	copy = ""
}




@INPROCEEDINGS{BlaHan84,
	crossref = "NivPer84",
	AUTHOR = "F. Blanchard and G. Hansel",
	TITLE = "Languages and subshifts",
	chapter = "Topological aspects of automata on infinite words",
	pages = "138--146",
	copy = ""
}


@ARTICLE{BlaHan86,
	AUTHOR = "F. Blanchard and G. Hansel",
	TITLE = "Syst\`emes cod\'es",
	JOURNAL = tcs,
	YEAR = 1986,
	month = "",
	volume = 44,
	number = "",
	pages = "17--49",
	copy = ""
}


@INPROCEEDINGS{Bla98,
	AUTHOR = "J. Blanc-Talon",
	TITLE = "Syntactic interpolation of fractal sequences",
	BOOKTITLE = "Proceedings of SSPR'98",
	YEAR = 1998,
	month = "",
	volume = "1451",
	editor = "A. Amin and others",
	series = "LNCS",
	chapter = "",
	pages = "140--148",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{BlaSie01,
	AUTHOR = "M. Bl{\"a}ser and B. Siebert",
	TITLE = "Computing Cycle Covers without Short Cycles",
	BOOKTITLE = "9th Annual European Symposium on Algorithms ESA",
	YEAR = 2001,
	month = "",
	volume = "2161",
	editor = "F. Meyer auf der Heide",
	series = "LNCS",
	chapter = "",
	pages = "368--379",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}


@ARTICLE{Bla73,
	AUTHOR = "M. Blattner",
	TITLE = "The unsolvability of the equality problem for
sentential forms of context-free grammars",
	JOURNAL = jcss,
	YEAR = 1973,
	month = "",
	volume = 7,
	number = "",
	pages = "463--468",
	copy = ""
}

@ARTICLE{BlaCre76,
	AUTHOR = "M. Blattner and A. Cremers",
	TITLE = "Observations about bounded languages and developmental systems",
	JOURNAL = tocs,
	YEAR = 1976,
	month = "",
	volume = 10,
	number = "",
	pages = "253--258",
	copy = ""
}


@INPROCEEDINGS{Bla79,
	crossref = "Mau79",
	AUTHOR = "M. Blattner",
	TITLE = "Inherent ambiguities in families of grammars",
	chapter = "",
	pages = "38--48",
	copy = ""
}


@TECHREPORT{Blo91a,
	AUTHOR = "A. M. Blokh",
	TITLE = "Periods implying almost all perios, trees with
snowflakes and zero entropy maps",
	INSTITUTION = "State University of New York at Stony Brook",
	YEAR = 1991,
	month = "",
	number = "",
	address = "",
	copy = ""
}

@ARTICLE{Blo83,
	AUTHOR = "S. L. Bloom",
	TITLE = "All solutions of a system of recursion equations in
infinite trees and other contraction theories",
	JOURNAL = jcss,
	YEAR = 1983,
	month = "",
	volume = 27,
	number = "",
	pages = "225--255",
	copy = ""
}




@TECHREPORT{Bloetal99,
	AUTHOR = "V. Blondel and others",
	TITLE = "Deciding stability and mortality of piecewise affine dynamical systems",
	INSTITUTION = "Laboratoire de l'Informatique due Parall\'elisme, \'Ecole Normale Sup\'erieure de Lyon",
	YEAR = 1999,
	month = "",
	number = "1999-05",
	address = "",
	copy = ""
}


@InProceedings{Blo91,
  author =       "D. M. Blough",
  title =        "On the Reconfiguration of Memory Arrays Containing
                 Clustered Faults",
  pages =        "444--451",
  booktitle =    "Fault Tolerant Computing",
  month =        jun,
  publisher =    "IEEE Computer Society Press",
  address =      "Los Alamitos, Ca., USA",
  year =         "1991",
}


@ARTICLE{BloPel92,
	AUTHOR = "D. M. Blough and A. Pelc",
	TITLE = "Complexity of fault diagnosis in comparison models",
	JOURNAL = ieeetoc,
	YEAR = 1992,
	month = "",
	volume = 41,
	number = "3",
	pages = "318--323",
	copy = ""
}


@ARTICLE{BloSulMas92,
	AUTHOR = "D. M. Blough and G. F. Sullivan and G. M. Masson",
	TITLE = "Efficient diagnosis of multiprocessor systems under
probabilistic models",
	JOURNAL = ieeetoc,
	YEAR = 1992,
	month = "",
	volume = 41,
	number = "9",
	pages = "1126--1136",
	copy = ""
}

@article{BloPel93,
  author    = {D. M. Blough and
               A. Pelc},
  title     = {A Clustered Failure Model for the Memory Array Reconfiguration
               Problem},
  journal   = ieeetoc,
  volume    = {42},
  number    = {5},
  year      = {1993},
  pages     = {518--528},
}


@ARTICLE{Blu63,
	AUTHOR = "H. Bluhmke",
	TITLE = "Three-dimensional crossword puzzles in {H}ebrew",
	JOURNAL = icalt,
	YEAR = 1963,
	month = "",
	volume = 6,
	number = "",
	pages = "306--309",
	copy = ""
}


@ARTICLE{BluBlu75,
	AUTHOR = "L. Blum and M. Blum",
	TITLE = "Toward a mathematical theory of inductive inference",
	JOURNAL = icalt,
	YEAR = 1975,
	month = "",
	volume = 28,
	number = "",
	pages = "125--155",
	copy = ""
}


@INPROCEEDINGS{BluHew67, 
        AUTHOR = "M. Blum and C. Hewitt", 
        TITLE = "Automata on a two-dimensional tape", 
        BOOKTITLE = "IEEE Symposium on Switching and Automata Theory", 
        YEAR = 1967, 
        month = "", 
        volume = "", 
        editor = "", 
        series = "", 
        chapter = "", 
        pages = "155--160", 
        address = "", 
        organization = "", 
        copy = "" 
} 


@INPROCEEDINGS{BluKoz78,
	AUTHOR = "M. Blum and D. Kozen",
	TITLE = "On the power of the compass",
	BOOKTITLE = "Proc. 19th Ann. Symp. on Foundations in Computer Science",
	YEAR = 1978,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "132--142",
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{BluSak77,
	AUTHOR = "M. Blum and W. J. Sakoda",
	TITLE = "On the capability of finite automata in 2 and 3 dimensional space",
	BOOKTITLE = "Proc. 18th Ann. Symp. on Foundations in Computer Science",
	YEAR = 1977,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "147--161",
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{BluShuSma88,
	AUTHOR = "L. Blum and M. Shub and S. Smale",
	TITLE = "On a theory of computation over the real numbers;
{NP} completeness, recursive functions and universal machines",
	BOOKTITLE = "{FOCS} proceedings",
	YEAR = 1988,
	pages = "387--397",
	organization = "{FOCS}",
	copy = ""
}


@ARTICLE{BluShuSma89,
	AUTHOR = "L. Blum and M. Shub and S. Smale",
	TITLE =  "On a theory of computation and complexity over the real numbers;
{NP} completeness, recursive functions and universal machines",
	JOURNAL = bamsnew,
	YEAR = 1989,
	volume = 21,
	number = "1",
	pages = "1--46",
	copy = ""
}




@ARTICLE{Bluetal85,
	AUTHOR = "A. Blumer and others",
	TITLE = "The smallest automaton recognizing the subwords of a text",
	JOURNAL = tcs,
	YEAR = 1985,
	month = "",
	volume = 40,
	number = "",
	pages = "31--55",
	copy = ""
}



@INPROCEEDINGS{Boa72,
	crossref = "Niv73",
	AUTHOR = "L. Boasson",
	TITLE = "Un crit\`ere de rationnalit\'e des langages algebriques",
	chapter = "",
	pages = "359--365",
	copy = ""
}


@InProceedings{Boa77, 
 author ="L. Boasson", 
 title = "Classification of the Context-free Languages", 
 booktitle ="MFCS: Symposium on Mathematical Foundations of Computer Science", 
 year = "1977", pages ="34--43" , PUBLISHER = {Springer}, volume = 53, series = {LNCS}
} 



@INPROCEEDINGS{Boa80,
	AUTHOR = "L. Boasson",
	TITLE = "D\'erivation et r\'eductions dans les grammaires alg\'ebriques",
	BOOKTITLE = "Automata, Languages and Programming",
	YEAR = 1980,
	month = jul,
PUBLISHER = {Springer},
	volume = "85",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "109--118",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{BoaHor78,
	AUTHOR = "L. Boasson and S. Horv\'ath",
	TITLE = "On languages satisfying {O}gden's lemma",
	JOURNAL = rairo,
	YEAR = 1978,
	month = "",
	volume = 12,
	number = "3",
	pages = "201--202",
	copy = ""
}



@ARTICLE{BoaNiv80,
	AUTHOR = "L. Boasson and M. Nivat",
	TITLE = "Adherences of languages",
	JOURNAL = jcss,
	YEAR = 1980,
	volume = 20,
	number = "",
	pages = "285--309",
	copy = ""
}


@INPROCEEDINGS{BoaNiv81,
	crossref = "Deu81",
	AUTHOR = "L. Boasson and M. Nivat",
	TITLE = "Centers of languages",
	chapter = "",
	pages = "245--251",
	copy = ""
}
		  

@ARTICLE{BoaPit92,
	AUTHOR = "R. Board and L. Pitt",
	TITLE = "On the Necessity of {O}ccam Algorithms",
	JOURNAL = tcs,
	YEAR = 1992,
	month = "",
	volume = 100,
	number = "",
	pages = "157--184",
	copy = ""
}



@ARTICLE{BoaRes77,
	AUTHOR = "L. Boasson and A. Restivo",
	TITLE = "Une charact\'erisation des langages alg\'ebriques born\'es",
	JOURNAL = rairo,
	YEAR = 1977,
	month = "",
	volume = 11,
	number = "3",
	pages = "203--205",
	copy = ""
}

@ARTICLE{BodHar2003,
	AUTHOR = "J.-P. Bode and H. Harborth",
	TITLE = "Independence for knights on hexagon and triangle boards",
	JOURNAL = dm,
	YEAR = 2003,
	month = "",
	volume = 272,
	number = "",
	pages = "27--35",
	copy = ""
}


@INBOOK{Bod,
	   AUTHOR = "R. Bodendiek",
	   TITLE = "On graphs not being embeddable into the torus",
	   PAGES = "7--14",
	   PUBLISHER = "Teubner DDR",
	   YEAR = "19??",
	   VOLUME = 73,
	   SERIES = ttzm,
	   copy = ""
 }

 @ARTICLE{BodWag85,
	   AUTHOR = "R. Bodendiek and K.Wagner",
	   TITLE = "Zur Einbettbarkeit von Graphen in den Torus",
	   JOURNAL = ejc,
	   YEAR = 1985,
	   VOLUME = 6,
	   NUMBER = "",
	   PAGES = "115--127",
	   copy = ""
 }


@INPROCEEDINGS{Bod88,
	AUTHOR = "H. L. Bodlaender",
	TITLE = "Dynamic programming on graphs with bounded treewidth",
	BOOKTITLE = "Automata, Languages and Programming, Proc. 15th ICALP",
	YEAR = 1988,
	month = "",
	volume = "317",
	editor = "T. Lepist{\"o} and A. Salomaa",
	series = "LNCS",
	chapter = "",
	pages = "105--119",
	address = "",
	organization = "",
	copy = ""
}


@Article{Bod98,
  author = 	 {H. L. Bodlaender},
  title = 	 {A partial $k$-arboretum of graphs with bounded treewidth},
  journal = 	 tcs,
  year = 	 {1998},
  volume = 	 {209},
  pages = 	 {1--45},
}


@ARTICLE{BodMoh93,
	AUTHOR = "H. L. Bodlaender and R. H. M{\"o}hring",
	TITLE = "The pathwidth and treewidth of cographs",
	JOURNAL = siamdm,
	YEAR = 1993,
	month = "",
	volume = 6,
	number = "",
	pages = "181--188",
	copy = ""
}

@InProceedings{Bodetal94, 
 author = "H. L. Bodlaender and R. G. Downey and M. R. Fellows and H. T. Wareham", 
 title ="The Parameterized Complexity of Sequence Alignment and Consensus", 
 booktitle = "CPM: 5th Symposium on Combinatorial Pattern Matching", 
 year = "1994", 
 pages={15--30}
}


@INPROCEEDINGS{Bodetal94a,
   author = {H. L. Bodlaender and M. R. Fellows and Michael T. Hallett},
   title = "Beyond {NP}-Completeness for Problems of Bounded Width: Hardness
            for the {W} Hierarchy (Extended Abstract)",
   booktitle = "Proc. 26th Annual ACM Symposium on Theory of Computation STOC",
   pages = "449--458",
   month = may,
   year = 1994,
   organization = ACM,
   publisher = "Academic Press",
}


@ARTICLE{Bodetal95,
	AUTHOR = "H. Bodlaender and R. G. Downey and M. R. Fellows and H. T. Wareham",
	TITLE = "The Parameterized Complexity of Sequence Alignment and Consensus",
	JOURNAL = tcs,
	YEAR = 1995,
	month = "",
	volume = 147,
	number = "",
	pages = "31--54",
	copy = ""
}


@Article{Bodetal00,
  author =       "H. L. Bodlaender and M. R. Fellows and M.
                 T. Hallett and H. T. Wareham and T. J. Warnow",
  title =        "The hardness of perfect phylogeny, feasible register
                 assignment and other problems on thin colored graphs",
  journal =      tcs,
  volume =       "244",
  number =       "1--2",
  pages =        "167--188",
  day =          "6",
  month =        aug,
  year =         "2000",

}

@INPROCEEDINGS{Bodetal2000,
	AUTHOR = "H. L. Bodlaender and others",
	TITLE = "Faster algorithms for planar dominating set and related problems",
	BOOKTITLE = "40. Workshop Komplexit{\"a}tstheorie, Datenstrukturen und effiziente Algorithmen",
	YEAR = 2000,
	month = mar,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "4",
	address = "",
	organization = "Fakult{\"a}t f{\"u}r Informatik und Automatisierung der TU Ilmenau",
	copy = ""
}


@INPROCEEDINGS{BodFom02,
	AUTHOR = "H.~L. Bodlaender and F.~V. Fomin",
	TITLE = "Tree decompositions with small costs",
	BOOKTITLE = "SWAT 2002",
	YEAR = 2002,
	month = "",
	volume = "2368",
	editor = "M. Penttonen and E. Meineche Schmidt",
	series = "LNCS",
	chapter = "",
	pages = "378--387",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}
 


@INPROCEEDINGS{BodThi97,
	AUTHOR = "H. L. Bodlaender  and D. M. Thilikos",
	TITLE = "Constructive linear time algorithms for branchwidth",
	BOOKTITLE = "Automata, Languages and Programming, Proc. 24th ICALP",
	YEAR = 1997,
	month = "",
	volume = "1256",
	editor = "P. Degano and R. Gorrieri and A. Marchetti-Spaccamela",
	series = "LNCS",
	chapter = "",
	pages = "627--637",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{BodThiYam97,
	AUTHOR = "H. L. Bodlaender and D. M. Thilikos and K. Yamazaki",
	TITLE = "It is hard to know when greedy is good for finding independent sets",
	JOURNAL = ipl,
	YEAR = 1997,
	month = "",
	volume = 61,
	number = "2",
	pages = "101--106",
	copy = ""
}


 @ARTICLE{BodvanLee86,
	   AUTHOR = "H. L. Bodlaender and J. van Leeuwen",
	   TITLE = "Simulation of large networks on smaller networks",
	   JOURNAL = icalt,
	   YEAR = 1986,
	   VOLUME = 71,
	   NUMBER = "",
	   PAGES = "143--180",
	   copy = ""
 }

@Article{BodJan95,
  author =       "H.~L. Bodlaender and K. Jansen",
  title =        "Restrictions of graph partition problems. {Part I}",
  journal =      tcs,
  volume =       "148",
  pages =        "93--109",
  day =          "21",
  year =         "1995",
}

@article{BodGonKlo95,
 author = {H. L. Bodlaender and T. F. Gonzalez and T. Kloks},
 title = {Complexity aspects of two-dimensional data compression},
 journal = {Nordic J. of Computing},
 volume = {2},
 number = {4},
 year = {1995},
 issn = {1236-6064},
 pages = {462--495},
 }

@inproceedings{BodFelThi2003,
  author    = {H. L. Bodlaender and
               M. R. Fellows and
               D. M. Thilikos},
  title     = {Starting with Nondeterminism: The Systematic Derivation
               of Linear-Time Graph Layout Algorithms},
  booktitle = {Mathematical Foundations of Computer Science MFCS 2003},
  year      = {2003},
  pages     = {239--248},
  editor    = {B. Rovan and
               P. Vojt{\'a}s},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {2747},
}

@INPROCEEDINGS{Bod2005,
	AUTHOR = "H. Bodlaender",
	TITLE = "Discovering Treewidth",
	BOOKTITLE = "SOFSEM",
	YEAR = 2005,
	month = "",
	volume = "3381",
	editor = "P. Vojt{\'a}{\v s} and M. Bielikov\'a and B. Charron-Bost and O. S\'ykora",
	series = "LNCS",
	chapter = "",
	pages = "1--16",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@inproceedings{Bod2006,
  author    = {H. L. Bodlaender},
  title     = {Treewidth: characterizations, applications, and computations},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International
               Workshop, WG},
  year      = {2006},
  pages     = {1--14},
  editor    = {F. V. Fomin},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4271},
}

@ARTICLE{Bohetal2003,
	AUTHOR = "E. B{\"o}hler and N. Creignou and S. Reith and H. Vollmer",
	TITLE = "Playing with {B}oolean blocks, part I: {P}ost's lattice with applications to complexity theory",
	JOURNAL =  {ACM SIGACT-Newsletter},
	YEAR = 2003,
	month = "",
	volume = 34,
	number = "4",
	pages = "38--52",
	copy = ""
}

@ARTICLE{Bohetal2004,
	AUTHOR = "E. B{\"o}hler and N. Creignou and S. Reith and H. Vollmer",
	TITLE = "Playing with {B}oolean blocks, part II: constraint satisfaction problems",
	JOURNAL =  {ACM SIGACT-Newsletter},
	YEAR = 2004,
	month = "",
	volume = 35,
	number = "1",
	pages = "22--35",
	copy = ""
}

@ARTICLE{BoiRey75,
	AUTHOR = "P. du Bois-Reymond",
	TITLE = "{V}ersuch einer {C}lassification der
willk{\"u}rlichen {F}unctionen reeller {A}rgumente nach ihren
{A}enderungen in den kleinsten {I}ntervallen",
	JOURNAL = crelle,
	YEAR = 1875,
	month = "",
	volume = 79,
	number = "",
	pages = "21--37",
	copy = ""
}


 @ARTICLE{Bok81,
	   AUTHOR = "S. H. Bokhari",
	   TITLE = "On the mapping problem",
	   JOURNAL = ieeetoc,
	   YEAR = 1981,
	   VOLUME = "c-30",
	   NUMBER = 3,
	   PAGES = "207--214",
	   copy = ""
 }


@ARTICLE{Bol93,
	AUTHOR = "R. C. Bollinger",
	TITLE = "Extended {P}ascal triangles",
	JOURNAL = mm,
	YEAR = 1993,
	month = "",
	volume = 66,
	number = "2",
	pages = "87--94",
	copy = ""
}

 @ARTICLE{BolLoz2003,
	AUTHOR = "R. Boliac  and V. V. Lozin",
	TITLE = "Independent domination in finitely defined classes of graphs",
	JOURNAL = tcs,
	YEAR = 2003,
	month = "",
	volume = 301,
	number = "",
	pages = "271--284",
	copy = ""
}


@incollection{Bometal99,
  author = "I. Bomze and M. Budinich and P. Pardalos and M. Pelillo",
  title = "The maximum clique problem",
  editor = "D.-Z. Du and P. M. Pardalos",
booktitle = "Handbook of Combinatorial Optimization",
volume = "4",
publisher = "Kluwer Academic Publishers, Boston, MA",
  year = "1999",
  url = "citeseer.nj.nec.com/bomze99maximum.html" }

@BOOK{Bon90,
	AUTHOR = "B. A. Bondarenko",
	TITLE = "Generalized Pascal Triangles and Pyramids, Their
Fractals, Graphs and Applications [Russian]",
	PUBLISHER = "Tashkent: Fan",
	YEAR = 1990,
	month = "",
	volume = "",
	edition = "",
	series = "",
	copy = ""
}


@TECHREPORT{BonEsKre90,
	AUTHOR = "T. B{\"o}niger and R. Esser and D. Krekel",
	TITLE = "CRAY Y-MP, NEC SX-3 und SIEMENS VP-S; Vergleichende
Darstellung von H{\"o}chstleistungsrechern",
	INSTITUTION = "Forschungszentrum J{\"u}lich GmbH",
	YEAR = 1990,
	month = mar,
	number = "KFA-ZAM-IB-9007",
	address = "Zentralinstitut f{\"u}r Angewandte Mathematik;
Postfach 1913; D-W5170 J{\"u}lich",
	copy = ""
}

@INPROCEEDINGS{BonBruWoe2003,
	AUTHOR = "P. S. Bonsma and T. Brueggemann and G. J. Woeginger",
	TITLE = "A Faster {FPT} Algorithm for Finding Spanning Trees with Many Leaves",
	BOOKTITLE = "Mathematical Foundations of Computer Science 2003",
	YEAR = 2003,
	month = "",
	volume = "2747",
	editor = "B. Rovan and P. Vojt\'a\'s",
	series = "LNCS",
	chapter = "",
	pages = "259--268",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@inproceedings{Bonetal2002,
  author    = {K. M. J. De Bontridder and
               B. J. Lageweg and
               J. K. Lenstra and
               J. B. Orlin and
               L. Stougie},
  title     = {Branch-and-Bound Algorithms for the {T}est {C}over {P}roblem},
  booktitle = {European Symposium on Algorithms ESA},
  year      = {2002},
  pages     = {223--233},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {2461},
}
@TechReport{Bonetal2002a,
 author    = {K. M. J. De Bontridder and
               B. J. Lageweg and
               J. K. Lenstra and
               J. B. Orlin and
               L. Stougie},
  title     = {Branch-and-Bound Algorithms for the {T}est {S}et {P}roblem},
institution = {Future and Emerging Technologies Program of the EU; Alcom-FT Technical Report Series},
year = {2002},
OPTkey = {},
OPTtype = {},
number = {ALCOMFT-TR-02-79},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@ARTICLE{Bonetal2003,
	AUTHOR = "K. M. J. De Bontridder and
               B. V. Halld\'orsson and M. M. Halld\'orsson and 
               J. K. Lenstra and
               R. Ravi and
               L. Stougie",
	TITLE = "Approximation algorithms for the test cover problem",
	JOURNAL = {Math. Progr., Ser. B},
	YEAR = 2003,
	month = "",
	volume = 98,
	number = "",
	pages = "477--491",
	copy = ""
}


@ARTICLE{Boo78,
	AUTHOR = "R. V. Book",
	TITLE = "Simple representations of certain classes of languages",
	JOURNAL = jacm,
	YEAR = 1978,
	month = jan,
	volume = 25,
	number = "1",
	pages = "23--31",
	copy = ""
}




@INPROCEEDINGS{BooBra79,
	crossref = "Mau79",
	AUTHOR = "R. V. Book and F.-J. Brandenburg",
	TITLE = "Representing complexity classes by equality sets",
	chapter = "",
	pages = "49--57",
	copy = ""
}



@ARTICLE{BooBra80,
	AUTHOR = "R. V. Book and F.-J. Brandenburg",
	TITLE = "Equality sets and complexity classes",
	JOURNAL = siam,
	YEAR = 1980,
	month = "",
	volume = 9,
	number = "4",
	pages = "729--743",
	copy = ""
}


@ARTICLE{Booetal71,
	AUTHOR = "R. Book and others",
	TITLE = "Ambiguity in graphs and expressions",
	JOURNAL = ieeetoc,
	YEAR = 1971,
	month = "",
	volume = 20,
	number = "2",
	pages = "149--153",
	copy = ""
}


@INPROCEEDINGS{BooGreWra78,
	AUTHOR = "R. V. Book and S. A. Greibach and C. Wrathall",
	TITLE = "Comparisons and reset machines",
	BOOKTITLE = "Automata, Languages and Programming",
	YEAR = 1978,
	month = "",
	volume = "62",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "113--124",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{BooNiv78,
	AUTHOR = "R. V. Book and M. Nivat",
	TITLE = "Linear languages and the intersection closure of
		  classes of languages",
	JOURNAL = siam,
	YEAR = 1978,
	month = "",
	volume = 7,
	number = "2",
	pages = "167--177",
	copy = ""
}


@Article{BooNivPat74,
  title =        "Reversal-Bounded Acceptors and Intersections of Linear
                 Languages",
  author =       "R. V.  Book and M. Nivat and M. Paterson",
  pages =        "283--295",
  journal =      siam,
  year =         "1974",
  volume =       "3",
  number =       "4",
}



@INPROCEEDINGS{BooYap77,
	AUTHOR = "R. Book and C. Yap",
	TITLE = "On the computational power of reversal-bounded machines",
	BOOKTITLE = "ICALP'77",
	YEAR = 1977,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "111--119",
	address = "",
	organization = "",
	copy = ""
}




@TECHREPORT{BorKusSte96,
	AUTHOR = "B. Borchert and D. Kuske and F. Stephan",
	TITLE = "On existentially first-order definable languages and
		  their relation to {NP}",
	INSTITUTION = "Technische Universit{\"a}t Dresden (Germany),
		  Institut f{\"u}r Algebra",
	YEAR = 1996,
	month = dec,
	number = "MATH-AL-11-1996",
	address = "",
	copy = ""
}

@INPROCEEDINGS{BorRei2006,
	AUTHOR = "B. Borchert and K. Reinhardt",
	TITLE = "Searching Paths of constant bandwidth",
	BOOKTITLE = "Software
Seminar SOFSEM",
	YEAR = 2006,
	month = "",
	volume = "3831",
	editor = "J. {\v S}tuller and J. Wiedermann and G. Tel and J. Pokorn\'y  and M. Bielikov\'a",
	series = "LNCS",
	chapter = "",
	pages = "187--196",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@ARTICLE{Bor87,
	AUTHOR = "H. Bordihn",
	TITLE = "On deterministic grammars with valuation",
	JOURNAL = {Wissenschaftliche Zeitschrift der Technischen
		  Universit\"at ``Otto von Guericke'' Magdeburg},
	YEAR = 1987,
	month = "",
	volume = 31,
	number = "5",
	pages = "1--3",
	copy = ""
}


 @INPROCEEDINGS{Bor88,
	   AUTHOR = "H. Bordihn",
	   TITLE = "On some deterministic grammars with regulation",
	   BOOKTITLE = IMYCS,
	   YEAR = 1988,
	   PAGES = "87--93",
	   ORGANIZATION = "",
	   copy = ""
 }


@ARTICLE{Bor92,
	AUTHOR = "H. Bordihn",
	TITLE = "Pure languages and the degree of nondeterminism",
	JOURNAL = eikneu,
	YEAR = 1992,
	month = "",
	volume = 28,
	number = "5",
	pages = "231--240",
	copy = ""
}


@INCOLLECTION{Bor97,
        AUTHOR = "H. Bordihn",
        TITLE = "A grammatical approach to the lba problem",
	BOOKTITLE = "New Trends in Formal Languages",
	PUBLISHER = "Berlin: Springer",
	YEAR = 1997,
	month = "",
	volume = "1218",
	editor = "Gh. P\u aun and A. Salomaa",
	series = "LNCS",
	chapter = "",
	pages = "1--9",
	address = "",
	type = "",
	copy = ""
}





@TECHREPORT{BorSte96,
	AUTHOR = "B. Borchert and F. Stephan",
	TITLE = "Looking for an analogue of {R}ice's theorem in
                  complexity theory",
	INSTITUTION = "Universit{\"a}t Heidelberg (Germany), Mathematisches Institut",
	YEAR = 1996,
	month = nov,
	number = "23",
	address = "",
	copy = ""
}


@Article{BorMcCSem2008,
author = {M. Bordewich and C. McCartin and C. Semple},
title = {A 3-approximation algorithm for the subtree distance between phylogenies},
journal = jda,
year = {2008},
OPTkey = {},
volume = {6},
OPTnumber = {},
pages = {458--471},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}


@TECHREPORT{BorDas93,
	AUTHOR = "H. Bordihn and J. Dassow",
	TITLE = "A note on the degree of nondeterminism",
	INSTITUTION = "Technische Universit{\"a}t ``Otto von
Guericke'' Magdeburg",
	YEAR = 1993,
	month = jul,
	number = "Preprint FIN-IRB-7/93",
	address = "",
	copy = ""
}



@TECHREPORT{BorFer94a,
        AUTHOR = "H. Bordihn and H. Fernau",
        TITLE = "Accepting Grammars and Systems",
	INSTITUTION = "Universit{\"a}t Karlsruhe, Fakult{\"a}t f{\"u}r Informatik",
        year = 1994,
	month = "",
	number = "9/94",
	copy = ""
}


@ARTICLE{BorFer94b,
	AUTHOR = "H. Bordihn and H. Fernau",
	TITLE = "Accepting Grammars with Regulation",
	JOURNAL = ijcm,
	YEAR = 1994,
	month = "",
	volume = 53,
	number = "",
	pages = "1--18",
	copy = ""
}


@INPROCEEDINGS{BorFer95,
	AUTHOR = "H. Bordihn and H. Fernau",
	TITLE = "Accepting grammars and systems: an overview",
	BOOKTITLE = "Developments in Language Theory '95",
	YEAR = 1995,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = "",
        note = {To appear}
}


@INPROCEEDINGS{BorFer95a,
	AUTHOR = "H. Bordihn and H. Fernau",
	TITLE = "Accepting programmed grammars without nonterminals",
	BOOKTITLE = "5. GI Theorietag ``Automaten und Formale
		  Sprachen'', Technical Report 9503, Universit{\"a}t Gie\ss{}en, Arbeitsgruppe Informatik",
	YEAR = 1995,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "4--16",
	address = "",
	organization = "",
	copy = ""
}



@ARTICLE{BorCsu96a,
        AUTHOR = "H. Bordihn and E. Csuhaj-Varj\'u",
	TITLE = "On competence and completeness in {CD} grammar systems",
	JOURNAL = actacybern,
	YEAR = 1996,
	month = "",
	volume = 12,
	number = "",
	pages = "347--360",
	copy = ""
}


@INPROCEEDINGS{BorDasVas99,
	AUTHOR = "H. Bordihn and J. Dassow and G. Vaszil",
	TITLE = "Grammar systems as language analyzers and recursively enumerable languages",
	BOOKTITLE = "Fundamentals of Computation Theory: FCT'99",
	YEAR = 1999,
	month = "",
	volume = "1684",
	editor = "G. Ciobanu and Gh. P\u aun",
	series = "LNCS",
	chapter = "",
	pages = "136--147",
	address = "",
	organization = "",
	copy = ""
}


@article{BorFer96,
	AUTHOR = "H. Bordihn and H. Fernau",
	TITLE = "Accepting grammars and systems  via context condition grammars",
	journal = jalc,
	YEAR = 1996,
	month = "",
	volume = "1",
        number = 2,
	pages = "97--112",
	copy = "",
}


@INPROCEEDINGS{BorFer96a,
	AUTHOR = "H. Bordihn and H. Fernau",
	TITLE = "Accepting grammars and systems: an overview",
	BOOKTITLE = "Developments in Language Theory II; at the
                  crossroads of mathematics, computer science and biology",
	YEAR = 1996, publisher = "Singapore: World Scientific",
	month = "",
	volume = "",
	editor = "J. Dassow and G. Rozenberg and A. Salomaa",
	series = "",
	chapter = "Controlled derivations and grammar systems",
	pages = "199--208",
	address = "",
	organization = "",
	copy = ""
}
		  

@TECHREPORT{BorFerHol99,
        AUTHOR = "H. Bordihn and H. Fernau and M. Holzer",
        TITLE = "Accepting Pure Grammars and Systems",
	INSTITUTION = "Otto-von-Guericke-Universit{\"a}t Magdeburg, Fakult{\"a}t f{\"u}r Informatik",
	YEAR = 1999,
	month = jan,
	number = "Preprint Nr. 1",
	address = "",
	copy = ""
}


@ARTICLE{BorFerHol99a,
	AUTHOR = "H. Bordihn and H. Fernau and M. Holzer",
	TITLE = "On Accepting Pure {L}indenmayer Systems",
	JOURNAL = fundinform,
	YEAR = 1999,
	month = "",
	volume = 38,
	number = "4",
	pages = "365--375",
	copy = ""
}


@Article{BorHol99,
  author =       "H. Bordihn and M. Holzer",
  title =        "On a hierarchy of languages generated by cooperating
                 distributed grammar systems",
  journal =      ipl,
  volume =       "69",
  number =       "2",
  pages =        "59--62",
  year =         "1999",
}

@TechReport{BorDasHol2001,
author = {H. Bordihn and J. Dassow and M. Holzer},
title = {Extending regular expressions with homomorphic replacement},
institution = {Technische Universit{\"a}t M{\"u}nchen},
year = {2001},
OPTkey = {},
OPTtype = {},
OPTnumber = {TUM-I0102},
OPTaddress = {},
OPTmonth = aug,
OPTnote = {},
OPTannote = {}
}

@inproceedings{BorDasVas99,
   author    = {H. Bordihn and
               J. Dassow and
               Gy. Vaszil},
  title     = {Grammar Systems as Language Analyzers and Recursively Enumerable
               Languages},
  pages     = {136--147},
  booktitle = {Fundamentals of Computation Theory FCT},
  editor    = {G. Ciobanu and
               G. Paun},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {1684},
  year      = {1999},
}


@ARTICLE{BorFerHol02,
	AUTHOR = "H. Bordihn and H. Fernau and M. Holzer",
	TITLE = "Accepting Pure Grammars",
	JOURNAL = publmath,
	YEAR = 2002,
	month = "",
	volume = {Supplement 60},
	number = "",
	pages = "483--510",
	copy = ""
}



@INCOLLECTION{BorFerHol03,
	AUTHOR = "H. Bordihn and H. Fernau and M. Holzer",
	TITLE = "On iterated sequential transducers",
	BOOKTITLE = "Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology, and Back",
	PUBLISHER = "London: Taylor and Francis",
	YEAR = 2003,
	month = "",
	volume = "",
	editor = "C. Martin-Vide and V. Mitrana ",
	series = "",
	chapter = "",
	pages = "121--130",
	address = "",
	type = "",
	copy = ""
}
@ARTICLE{BorHolKut2005,
	AUTHOR = "H. Bordihn and M. Holzer and M. Kutrib",
	TITLE = "Unsolvability levels of operation problems for subclasses of context-free languages",
	JOURNAL = ijfcs,
	YEAR = 2005,
	month = "",
	volume = 16,
	number = "",
	pages = "423--440",
	copy = ""
}

@ARTICLE{Boretal2006,
	AUTHOR = "H. Bordihn and H. Fernau and M. Holzer and V. Manca and C. Mart{\'i}n-Vide",
	TITLE = "Iterated sequential transducers as language generating devices", 
	JOURNAL = tcs,
	YEAR = 2006,
	month = "",
	volume = 369,
	number = "",
	pages = "67--81",
	copy = ""
}
@article{BorHol2006,
  author    = {H. Bordihn and
               M. Holzer},
  title     = {Programmed grammars and their relation to the LBA problem},
  journal   = actainform,
  volume    = {43},
  number    = {4},
  year      = {2006},
  pages     = {223--242},
}

@article{BorFer07,
  author  = {H. Bordihn and H. Fernau},
  title   = {The Degree of Parallelism},
  journal = jalc,
  year    = 2007,
  volume  = 12,
  number  = {1/2},
  pages   = {25--47}
}

@ARTICLE{BorParTov91,
	AUTHOR = "R. B. Borie and R. G. Parker and C. A. Tovey",
	TITLE = "Deterministic decomposition of recursive graph classes",
	JOURNAL = siamdm,
	YEAR = 1991,
	month = "",
	volume = 4,
	number = "",
	pages = "481--501",
	copy = ""
}

@ARTICLE{BorParTov92,
	AUTHOR = "R. B. Borie and R. G. Parker and C. A. Tovey",
	TITLE = "Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families",
	JOURNAL = alg,
	YEAR = 1992,
	month = "",
	volume = 7,
	number = "",
	pages = "555--581",
	copy = ""
}


@ARTICLE{Bor79,
	AUTHOR = "O. Borodin",
	TITLE = "On acyclic colorings of planar graphs",
	JOURNAL = dm,
	YEAR = 1979,
	month = "",
	volume = 25,
	number = "",
	pages = "211--236",
	copy = ""
}


@MASTERSTHESIS{Bor90,
	AUTHOR = "P. Borst",
	TITLE = "Entwurf und {I}mplementierung eines {I}nterpreters
f{\"u}r die {L}ogikflu\ss-{S}prache {WAVE}",
	SCHOOL = "Universit{\"at} Karlsruhe",
	YEAR = 1990,
 	month = "",
	address = "",
	type = "Diplomarbeit",
	copy = ""
}



@TECHREPORT{Bor92a,
	AUTHOR = "P. Borst",
	TITLE = "The first implementation of the {WAVE} system for {UNIX} and {TCP/IP} computer networks",
	INSTITUTION = "Universit{\"a}t Karlsruhe, Fakult{\"a}t f{\"u}r Informatik",
	YEAR = 1992,
	month = "",
	number = "18/92",
	address = "",
	copy = ""
}

@ARTICLE{Bor54,
	AUTHOR = "K. Borsuk",
	TITLE = "On some metrizations of the hyperspace of compact sets",
	JOURNAL = fundmath,
	YEAR = 1954,
	month = "",
	volume = 41,
	number = "",
	pages = "168--202",
	copy = ""
}


@ARTICLE{Bor76,
	AUTHOR = "K. Borsuk",
	TITLE = "Some quantitive properties of shapes",
	JOURNAL = fundmath,
	YEAR = 1976,
	month = "",
	volume = 93,
	number = "",
	pages = "197--212",
	copy = ""
}


@ARTICLE{Bor77,
	AUTHOR = "K. Borsuk",
	TITLE = "On a metrization of the hyperspace of a metric space",
	JOURNAL = fundmath,
	YEAR = 1977,
	month = "",
	volume = 94,
	number = "",
	pages = "191--207",
	copy = ""
}



@ARTICLE{BosLoe93,
	AUTHOR = "T. Bossomaier and A. Loeff",
	TITLE = "Parallel computation of the {H}ausdorff distance
between images",
	JOURNAL = pc,
	YEAR = 1993,
	month = "",
	volume = 19,
	number = "",
	pages = "1129--1140",
	copy = ""
}


@INPROCEEDINGS{Bos95,
	AUTHOR = "H. Bostr{\"o}m",
	TITLE = "Covering vs. Divide-and-Conquer for Top-Down Induction of Logic Programs",
	BOOKTITLE = "Proc. of the Fourteenth International Joint Conference on Artificial Intelligence",
	YEAR = 1995,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "1194--1200",
	address = "",
	organization = "",
        publisher = "Morgan Kaufmann",
	copy = ""
}

@INPROCEEDINGS{Bos95a,
	AUTHOR = "H. Bostr{\"o}m",
	TITLE = "Specialization of Recursive Predicates",
	BOOKTITLE = "Proc. of the Eighth European Conference on Machine Learning ECML",
	YEAR = 1995,
	month = "",
	volume = "912",
	editor = "N. Lavrac and S. Wrobel",
	series = "LNCS",
	chapter = "",
	pages = "92--106",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@INPROCEEDINGS{Bos96,
	AUTHOR = "H. Bostr{\"o}m",
	TITLE = "Theory-guided induction of logic programs by inference of regular languages",
	BOOKTITLE = "Proc. of the 13th International Conference
on Machine Learning",
	YEAR = 1996,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "46--53",
	address = "",
	organization = "",
	copy = "", publisher = {Morgan Kaufmann},
}


@INPROCEEDINGS{Bos98,
	AUTHOR = "H. Bostr{\"o}m",
	TITLE = "Predicate Invention and Learning from Positive Examples Only",
	BOOKTITLE = "Proc. of the Tenth European Conference on Machine
Learning ECML-98",
	YEAR = 1998,
	month = "",
	volume = "1398",
	editor = "C. N\'edellec and C. Rouveirol",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "226--237",
	address = "",
	organization = "",
	copy = "", publisher = {Springer},
}




@Article{Bot90,
title   ="On {Scott's} Thesis for Domains of Information and
         Well-Quasi-Orderings",
author  ="C. B{\"o}ttinger",
pages   ="151--158",
journal =tcs,
year    ="1990",
month   ="15~" # jan,
volume  ="70",
number  ="1",
}


@Article{Bou87,
title   ="Repeated Snapshots in Distributed Systems with Synchronous
         Communications and their Implementation in {CSP}",
author  ="L. Boug{\'e}",
pages   ="145--169",
journal =tcs,
year    ="1987",
month   =jul,
volume  ="49",
number  ="2--3",
}



@INPROCEEDINGS{Bou98,
	AUTHOR = "P. Boullier",
	TITLE = "A generalization of mildly context-sensitive formalisms",
	BOOKTITLE = "TAG Workshop, Philadelphia",
	YEAR = 1998,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = "",
        note = {http://www.cis.upenn.edu/~ircs/mol/tag98.html}
}


@ARTICLE{BouCos96,
	AUTHOR = "Olivier Bournez and Michel Cosnard",
	TITLE = "On the computational power of dynamical
     systems and hybrid systems",
	JOURNAL = tcs,
	YEAR = 1996,
	month = "",
	volume = 168,
	number = "2",
	pages = "417--459",
	copy = ""
}
@INPROCEEDINGS{BouMazTod01,
	AUTHOR = "V. Bouchitt\'e and  F. Mazoit and I. Todinca",
	TITLE = "Treewidth of planar graphs: connections with duality",
	BOOKTITLE = "EuroConference on Combinatorics, Graph Theory and Applications (COMB'01)",
	YEAR = 2001,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}


@ARTICLE{Bow73,
	AUTHOR = "R. Bowen",
	TITLE = "Topological entropy for noncompact sets",
	JOURNAL = tams,
	YEAR = 1973,
	month = "",
	volume = 184,
	number = "",
	pages = "125--136",
	copy = ""
}

 @ARTICLE{Bra68,
   AUTHOR = 	"B. Brainerd",
   TITLE = 	"An Analog of a theorem about context-free languages",
   JOURNAL = 	icalt,
   YEAR = 	"1968",
   VOLUME = 	"11",
   NUMBER = 	"",
   PAGES = 	"561--567",
   MONTH = 	"",
   note = 	""
 }

 @ARTICLE{Bra68a,
   AUTHOR = 	"W. S. Brainerd",
   TITLE = 	"The minimalization of tree automata",
   JOURNAL = 	icalt,
   YEAR = 	"1968",
   VOLUME = 	"13",
   NUMBER = 	"",
   PAGES = 	"484--491",
   MONTH = 	"",
   note = 	""
 }

 @ARTICLE{Bra69,
   AUTHOR = 	"W. S. Brainerd",
   TITLE = 	"Tree generating regular systems",
   JOURNAL = 	icalt,
   YEAR = 	"1969",
   VOLUME = 	"14",
   NUMBER = 	"",
   PAGES = 	"217--231",
   MONTH = 	"",
   note = 	""
 }

@ARTICLE{BraZaf83,
	AUTHOR = "D. Brand and P. Zafiropulo",
	TITLE = "On communicating finite-state machines",
	JOURNAL = jacm,
	YEAR = 1983,
	month = "",
	volume = 30,
	number = "2",
	pages = "323--342",
	copy = ""
}



@PHDTHESIS{Bra78,
	AUTHOR = "F.-J. Brandenburg",
	TITLE = "Die {Z}usammenhangskomplexit{\"a}t von
nicht-kontextfreien {G}rammatiken",
	SCHOOL = "Universit{\"a}t Bonn, Institut f{\"u}r Informatik,
Informatik-Berichte Nr. 20",
	YEAR = 1978,
 	month = "",
	address = "",
	type = "",
	copy = ""
}



@ARTICLE{Bra80,
	AUTHOR = "F.-J. Brandenburg",
	TITLE = "Multiple equality sets and {P}ost machines",
	JOURNAL = jcss,
	YEAR = 1980,
	month = "",
	volume = 21,
	number = "",
	pages = "292--316",
	copy = ""
}



@InProceedings{Bra81,
  author =       "F. J. Brandenburg",
  title =        "On the height of syntactical graphs",
  pages =        "13--21",
  editor =       "P. Deussen",
  booktitle =    "Proceedings of the 5th {GI}-Conference on Theoretical
                 Computer Science",
  address =      "Karlsruhe, FRG",
  year =         "1981",
  series =       "LNCS",
  volume =       "104",
  publisher =    "Springer",
}


@INPROCEEDINGS{Bra81a,
	AUTHOR = "F. J. Brandenburg",
	TITLE = "Analogies of {PAL} and {COPY}",
	BOOKTITLE = "FCT'81",
	YEAR = 1981,
	month = "",
	volume = "117",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "61--70",
	address = "",
	organization = "",
	copy = ""
}
		  

@INPROCEEDINGS{Bra86,
	AUTHOR = "F.-J. Brandenburg",
	TITLE = "Intersections of some families of languages",
	BOOKTITLE = "Automata, Languages and Programming, Proc. ICALP'86",
	YEAR = 1986,
	month = "",
	volume = "226",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "60--69",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{Bra87,
	AUTHOR = "F.-J. Brandenburg",
	TITLE = "Representations of language families by homomorphic
		  equality operations and generalized equality sets",
	JOURNAL = tcs,
	YEAR = 1987,
	month = "",
	volume = 55,
	number = "",
	pages = "183--263",
	copy = ""
}


@Article{Bra87a,
  title =        "A Note on: `Deque Automata and a Subfamily of
                 Context-Sensitive Languages which Contains All
                 Semilinear Bounded Languages' (by {K. Ayers})",
  author =       "Franz J. Brandenburg",
  pages =        "341--342",
  journal =      tcs,
  year =         "1987",
  volume =       "52",
  number =       "3",
}



@INPROCEEDINGS{BraWag98,
	AUTHOR = "U. Brandes and D. Wagner",
	TITLE = "Using graph layout to visualize train interconnection data",
	BOOKTITLE = "Graph Drawing GD'98",
	YEAR = 1998,
	month = "",
	volume = "1547",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "44--56",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@INPROCEEDINGS{Bra2001,
	AUTHOR = "A. Brandst{\"a}dt",
	TITLE = "On Robust Algorithms for the Maximum Weight Stable Set Problem",
	BOOKTITLE = "Fundamentals of Computation Theory : 13th International Symposium, FCT",
	YEAR = 2001,
	month = "",
	volume = "2138",
	editor = "R. Freivalds",
	series = "LNCS",
	chapter = "",
	pages = "445--458",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{Braetal2000,
	AUTHOR = "A. Brandst{\"a}dt and F.~F. Dragan and V.~Bang Le and T. Szymczak",
	TITLE = "On stable cutsets in graphs",
	JOURNAL = dam,
	YEAR = 2000,
	month = "",
	volume = 105,
	number = "",
	pages = "39--50",
	copy = ""
}


@PHDTHESIS{Bra97a,
	AUTHOR = "L. Brankovi\'c",
	TITLE = "Usability of Secure Statistical Databases",
	SCHOOL = "Department of Computer Science, University of Newcastle, Australia",
	YEAR = 1997,
 	month = "",
	address = "",
	type = "{PhD} thesis",
	copy = ""
}

@inproceedings{BraFer2005,
	AUTHOR = "L. Brankovi\'c and H. Fernau",
	TITLE = "Approximability of a $\{0,1\}$-matrix problem",
	BOOKTITLE = "Proceedings of the Sixteenth Australasian Workshop on Combinatorial
Algorithms AWOCA",
	YEAR = 2005,
	month = "",
	volume = "",
	editor = "J. Ryan and P. Manyem and M. Miller and K.~A. Sugeng",
	series = "",
	chapter = "",
	pages = "39--45",
	address = "",
	organization = "",
        publisher = "University of
Ballarat",
	copy = ""
}


@INPROCEEDINGS{BraCou84,
	crossref = "NivPer84",
	AUTHOR = "J. P. Braquelaire and B. Courcelle",
	TITLE = "The solution of two star-height problems for regular trees",
	chapter = "Logic and automata",
	pages = "108--117",
	copy = ""
}


@INPROCEEDINGS{BraLan85,
	AUTHOR = "W. Brauer and K.-J. Lange",
	TITLE = "Non-deterministic two-tape automata are more powerful than deterministic ones",
	BOOKTITLE = "STACS'85",
	YEAR = 1985,
	month = "",
	volume = "182",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "71--79",
	address = "",
	organization = "",
	copy = ""
}


@article{Braetal2003,
    author = {W. Brauer and M. Holzer and B. K{\"o}nig and S. Schwoon},
    journal = eatcs,
    month = {February},
    pages = {230--237},
    title = {The Theory of Finite-State Adventures},
    volume = {79},
    year = {2003}
}

@TECHREPORT{Bra70,
	AUTHOR = "B. v. Braunm{\"u}uhl",
	TITLE = "Reihendarstellung programmierter Sprachen",
	INSTITUTION = "GMD (Bonn)",
	YEAR = 1970,
	month = "",
	number = "26",
	address = "",
	copy = ""
}


@Article{Braetal94,
author          ="B. {von Braunm{\"u}hl} and R. Gengler and R. Rettinger",
title           ="The Alternation Hierarchy for Machines with Sublogarithmic
                 Space Is Infinite",
journal         ="Lecture Notes in Computer Science",
volume          ="775",
pages           ="85--96",
year            ="1994",
ISSN            ="0302-9743",
bibdate         ="Mon May 13 11:52:14 MDT 1996",
acknowledgement =ack-nhfb,
}


@INPROCEEDINGS{BraVer83,
 author =       "Braunm{\"u}hl, B. von and R. Verbeek",
 title =        "Input-driven languages are recognized in {$\log n$} space",
 booktitle =      "Fundamentals (or Foundations) of Computation Theory",
 volume =       "4",
 year =        "1983",
 pages = {40--51}
}


@Article{Braetal83,
title   ="The Recognition of Deterministic {CFL}'s in Small Time and Space",
author  ="Braunm{\"u}hl, B. von  and S. Cook and K. Mehlhorn and
         R. Verbeek",
pages   ="34--51",
journal =icalt,
month   =jan # "/" # feb,
year    ="1983",
volume  ="56",
number  ="1/2"
}


@InProceedings{BraHot79,
author    ="B. v. Braunm{\"u}hl and E. Hotzel",
title     ="Supercounter machines",
pages     ="58--72",
ISBN      ="3-540-09510-1",
editor    ="Hermann A. Maurer",
booktitle ="Proceedings of the 6th Colloquium on Automata, Languages and
           Programming",
address   ="Graz, Austria",
month     =jul,
year      ="1979",
series    ="LNCS",
volume    ="71",
publisher ="Springer",
}


@Article{BraVer85,
  author =       "Braunm{\"u}hl, B von and R. Verbeek",
  title =        "Input-driven Languages are Recognized in {$\log n$} Space",
  journal =      "Annals of Discrete Mathematics",
  volume =       "24",
   year =         "1985",
  pages = "1--20"
  }


@ARTICLE{BraKin86,
	AUTHOR = "A. Brazma and J. Kinber",
	TITLE = "Generalized regular expressions---a language for synthesis of programs with branching in loops",
	JOURNAL = tcs,
	YEAR = 1986,
	month = "",
	volume = 46,
	number = "",
	pages = "175--195",
	copy = ""
}


@inproceedings{Bra93,
author = {A. Brazma}, 
     title     = {Efficient identification of regular expressions from representative examples},
   booktitle = {Proc. of the Ann. Conf. on Computational Learning Theory COLT},
   year      = {1993}, pages = {236--242}, organization = {ACM}
}

@INPROCEEDINGS{Bra94,
	AUTHOR = "A. Brazma",
	TITLE = "Efficient algorithms for learning simple regular expressions from noisy examples",
	BOOKTITLE = "Algorithmic Learning Theory ALT",
	YEAR = 1994,
	month = "",
	volume = "872",
	editor = "S. Arikawa and K. P. Jantke",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "260--271",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{BraCer94,
	AUTHOR = "A. Brazma and K. Cerans",
	TITLE = "Efficient learning of regular expressions from good examples",
	BOOKTITLE = "Int. Workshop on Analogical and Inductive Inference AII'94(Algorithmic Learning Theory ALT)",
	YEAR = 1994,
	month = "",
	volume = "872",
	editor = "S. Arikawa and K. P. Jantke",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "76--90",
	address = "",
	organization = "",
	copy = ""
}

@inproceedings{Bra95,
author = {A. Brazma}, 
     title     = {Learning of regular expressions by pattern matching}, 
   editor    = {P. M. B. Vit{\'a}nyi},
   booktitle     = {Computational Learning Theory, Second European 
Conference, EuroCOLT},
    publisher = {Springer},
   series    = {LNCS/LNAI},
   volume    = {904},
   year      = {1995},
 pages = {392--403},
}

@INCOLLECTION{Bra97,
	AUTHOR = "A. Brazma",
	TITLE = "Efficient learning of regular expressions from approximate examples",
	BOOKTITLE = "Computational Learning Theory and Natural Learning Systems, Vol. IV: Making Learning Systems Practical",
	PUBLISHER = "Cambridge, MA: MIT Press",
	YEAR = 1997,
	month = "",
	volume = "",
	editor = "R. Greiner and T. Petsche and S. J. Hanson",
	series = "",
	chapter = "19",
	pages = "337--352",
	address = "",
	type = "",
	copy = ""
}

@InProceedings{BreCitCre91,
  author =       "L. Breveglieri and C. Citrini and S. Crespi-Reghizzi",
  title =        "Deterministic Dequeue Automata and {LL(1)} Parsing of
                 Breadth-Depth Grammars",
  pages =        "146--156",
  editor =       "L. Budach",
  booktitle =    "Proceedings of Fundamentals of Computation Theory
                 ({FCT} '91)",
  month =        sep,
  series =       "LNCS",
  volume =       "529",
  publisher =    "Springer",
  year =         "1991",
}
		  

@INPROCEEDINGS{BreCheReg95,
	AUTHOR = "L. Breveglieri and A. Cherubini and S. Crespi-Reghizzi",
	TITLE = "Deterministic parsing for augmented context-free grammars",
	BOOKTITLE = "Mathematical Foundations of Computer Science
		  1995, 20th International Symposium, MFCS'95",
	YEAR = 1995,
	month = "",
	volume = "969",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "326--336",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{Bri2000,
	AUTHOR = "E. Bribiesca",
	TITLE = "A chain code for representing 3{D} curves",
	JOURNAL = patrec,
	YEAR = 2000,
	month = "",
	volume = 33,
	number = "",
	pages = "755--765",
	copy = ""
}


@ARTICLE{Bri63,
	AUTHOR = "J. L. Britton",
	TITLE = "The word problem",
	JOURNAL = annmath,
	YEAR = 1963,
	month = "",
	volume = 77,
	number = "",
	pages = "16--32",
	copy = ""
}


@INPROCEEDINGS{Broetal97,
	AUTHOR = "H. Broersma and others",
	TITLE = "Independent sets in asteroidal triple-free graphs",
	BOOKTITLE = "Automata, Languages and Programming, Proc. 24th ICALP",
	YEAR = 1997,
	month = "",
	volume = "1256",
	editor = "P. Degano and R. Gorrieri and A. Marchetti-Spaccamela",
	series = "LNCS",
	chapter = "",
	pages = "760--770",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{Bro65,
	AUTHOR = "H. Brolin",
	TITLE = "Invariant sets under iteration of rational functions",
	JOURNAL = "Arkiv f{"\o}r Matematik",
	YEAR = 1965,
	month = "",
	volume = 6,
	number = "6",
	pages = "103--144",
	copy = ""
}


@INPROCEEDINGS{Bro89,
	crossref = "Baketal90",
	AUTHOR = "M. Broy",
	TITLE = "Functional specification of time sensitive
communicating systems",
	chapter = "",
	pages = "153--179",
	copy = ""
}


@ARTICLE{BruCypSor92,
	AUTHOR = "J. Bruck and R. Cypher and D. Soroker",
	TITLE = "Tolerating faults in hypercubes using subcube partitioning",
	JOURNAL = ieeetoc,
	YEAR = 1992,
	month = "",
	volume = 41,
	number = "5",
	pages = "599--605",
	copy = ""
}


@INPROCEEDINGS{Bru92,
	AUTHOR = "A. Br{\"u}ggemann-Klein",
	TITLE = "Regular expressions into finite automata",
	BOOKTITLE = "LATIN'92",
	YEAR = 1992,
	month = "",
	volume = "483",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "87--98",
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{Bru93,
	AUTHOR = "A. Br{\"u}ggemann-Klein",
	TITLE = "Unambiguity of extended regular expressions in {SGML}
document grammars",
	BOOKTITLE = "European Symposium on Algorithms ESA",
	YEAR = 1993,
	month = "",
	volume = "726",
	editor = "T. Lengauer",
	series = "LNCS",
	chapter = "",
	pages = "73--84",
	address = "", publisher ={Springer}, 
	organization = "",
	copy = ""
}


@ARTICLE{Bru93a,
	AUTHOR = "A. Br{\"u}ggemann-Klein",
	TITLE = "Regular expressions into finite automata",
	JOURNAL = tcs,
	YEAR = 1993,
	month = "",
	volume = 120,
	number = "",
	pages = "197--213",
	copy = ""
}



@incollection {BruFisOtt94,
    AUTHOR = {A. Br{\"u}ggemann-Klein and P. Fischer and T. Ottmann},
     TITLE = {Learning picture sets from examples},
 BOOKTITLE = {Results and trends in theoretical computer science (Graz,
              1994)},
     PAGES = {34--43},
 PUBLISHER = {Springer}, volume = {812}, 
   ADDRESS = {}, series = {LNCS},
      YEAR = {1994},
}


@INPROCEEDINGS{BruHerWoo98,
	AUTHOR = "A. Br{\"u}ggemann-Klein and S. Herrmann and D. Wood",
	TITLE = "Context and caterpillars and structured documents",
	BOOKTITLE = "Principles of Digital Document Processing; 4th International Workshop (PODDP'98)",
	YEAR = 1998,
	month = "",
	volume = "1481",
        editor =       "E. V. Munson and C. Nicholas and D. Wood",	
	series = "LNCS",
	chapter = "",
	pages = "1--9",
	address = "", publisher = {Springer}, 
	organization = "",
	copy = ""
}


@article {BruWoo98,
    AUTHOR = {A. Br{\"u}ggemann-Klein and D. Wood},
     TITLE = {One-unambiguous regular languages},
   JOURNAL = ic,
    VOLUME = {142},
      YEAR = {1998},
    NUMBER = {2},
     PAGES = {182--206},

}



@INPROCEEDINGS{BruWoo2000,
	AUTHOR = "A. Br{\"u}ggemann-Klein and D. Wood",
	TITLE = "Caterpillars, context, tree automata and tree pattern matching",
	BOOKTITLE = "Developments in Language Theory; Foundations, Applications, and Perspectives (DLT'99)",
	YEAR = 2000,
	month = "",
	volume = "",
	editor = "G. Rozenberg and W. Thomas",
	series = "",
	chapter = "",
	pages = "270--285", publisher = {World Scientific}, 
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{BruWoo2001,
	AUTHOR = "A. Br{\"u}ggemann-Klein and D. Wood",
	TITLE = "Regularly extended two-way nondeterministic tree automata",
	BOOKTITLE = "Implementation and Application of Automata, 5th CIAA 2000",
	YEAR = 2001,
	month = "",
	volume = "2088",
	editor = "S. Yu and A. P{\u{a}}un",
	series = "LNCS",
	chapter = "",
	pages = "57--66",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{BruDix75,
	AUTHOR = "A.~A. Bruen and R.~Dixon",
	TITLE = "The $n$-queen problem",
	JOURNAL = dm,
	YEAR = 1975,
	month = "",
	volume = 12,
	number = "",
	pages = "393--395",
	copy = ""
}


@ARTICLE{BruHea2005,
	AUTHOR = "D. J. Brueni and L. S. Heath",
	TITLE = "The {PMU} placement problem",
	JOURNAL = siamdm,
	YEAR = 2006,
	month = "",
	volume = 19,
	number = "",
	pages = "744--761",
	copy = ""
}


@ARTICLE{Bru81,
	AUTHOR = "N. G. de Brujn",
	TITLE = "Sequences of zeros and ones generated by special production rules",
	JOURNAL = indmath,
	YEAR = 1981,
	month = "",
	volume = 84,
	number = "43??",
	pages = "27--37",
	copy = ""
}


@article{BrySte2001,
    author = "D. Bryant and M. Steel",
    title = "Constructing Optimal Trees from Quartets",
    journal = jalg,
    volume = "38",
    number = "1",
    pages = "237--259",
    year = "2001",
}

@Article{BryLag2006,
author = {Bryant, D. and Lagergren, J.},
title = {Compatibility of unrooted trees is {FPT}},
journal = tcs,
year = {2006},
OPTkey = {},
volume = {351},
OPTnumber = {},
pages = {296--302},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@ARTICLE{BryWanZhan90,
	AUTHOR = "V. Bry\`ere and L. Wang and L. Zhang",
	TITLE = "On completion of codes with finite deciphering delay",
	JOURNAL = ejc,
	YEAR = 1990,
	month = "",
	volume = 11,
	number = "",
	pages = "513--521",
	copy = ""
}


@ARTICLE{Bry91,
	AUTHOR = "V. Bry\`ere",
	TITLE = "Maximal codes with bounded deciphering delay",
	JOURNAL = tcs,
	YEAR = 1991,
	month = "",
	volume = 84,
	number = "",
	pages = "53--76",
	copy = ""
}


@TECHREPORT{Bry92,
	AUTHOR = "V. Bry\`ere",
	TITLE = "Automata and Codes with Bounded Deciphering Delay",
	INSTITUTION = "Institut Blaise Pascal de l'Universit\'es Paris
VI, CNRS et Paris VII",
	YEAR = 1992,
	month = jan,
	number = "Laboratoire Informatique Th\'eorique et
Programmation LITP 92.06",
	address = "Place Jussieu -- 75252 Paris Cedex 05",
	copy = ""
}


@INPROCEEDINGS{Bry92a,
	AUTHOR = "V. Bry\`ere",
	TITLE = "Automata and Codes with Bounded Deciphering Delay",
	BOOKTITLE = "LATIN'92",
	YEAR = 1992,
	month = "",
	volume = "483",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "99--107",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{Bry92b,
	AUTHOR = "V. Bry\'ere",
	TITLE = "Research topics in the theory of codes",
	JOURNAL = eatcs,
	YEAR = 1992,
	month = "",
	volume = 48,
	number = "",
	pages = "412--424",
	copy = ""
}


@INPROCEEDINGS{Brz68, 
        AUTHOR = "J. A. Brzozowski", 
        TITLE = "Regular-like expressions for some irregular languages", 
        BOOKTITLE = "IEEE Conf. Record of 9th Ann. Symp. on Switching and Automata Theory SWAT", 
        YEAR = 1968, 
        month = "", 
        volume = "", 
        editor = "", 
        series = "", 
        chapter = "", 
        pages = "278--280", 
        address = "", 
        organization = "", 
        copy = "" 
} 



@ARTICLE{Brz64,
	AUTHOR = "J. A. Brzozowski",
	TITLE = "Derivatives of regular expressions",
	JOURNAL = jacm,
	YEAR = 1964,
	month = oct,
	volume = 11,
	number = "4",
	pages = "481--494",
	copy = ""
}


@ARTICLE{Brz67,
	AUTHOR = "J. A. Brzozowski",
	TITLE = "Roots of star events",
	JOURNAL = jacm,
	YEAR = 1967,
	month = "",
	volume = 14,
	number = "3",
	pages = "466--477",
	copy = ""
}


@INPROCEEDINGS{Brz80,
	crossref = "Boo80",
	AUTHOR = "J. Brzozowski",
	TITLE = "Open problems about regular languages",
	chapter = "",
	pages = "23--47",
	copy = ""
}



@ARTICLE{BrzLei80,
	AUTHOR = "J. A. Brzozowski and E. Leiss",
	TITLE = "On equations for regular languages, finite automata,
and sequential networks",
	JOURNAL = tcs,
	YEAR = 1980,
	month = "",
	volume = 10,
	number = "",
	pages = "19--35",
	copy = ""
}


@ARTICLE{BrzShi99,
	AUTHOR = "J. A. Brzozowski and Shi",
	TITLE = "A characterization of signed hypergraphs and its applications to {VLSI} via minimization and logic synthesis",
	JOURNAL = dam,
	YEAR = 1999,
	month = "",
	volume = 90,
	number = "",
	pages = "223--243",
	copy = ""
}



@ARTICLE{BucHag83,
	AUTHOR = "W. Bucher and J. Hagauer",
	TITLE = "It is decidable whether a regular language is pure context-free",
	JOURNAL = tcs,
	YEAR = 1983,
	month = "",
	volume = 26,
	number = "",
	pages = "233--241",
	copy = ""
}


@ARTICLE{BucEhrHau85,
	AUTHOR = "W. Bucher and A. Ehrenfeucht and D. Haussler",
	TITLE = "On total regulators generated by derivation relations",
	JOURNAL = tcs,
	YEAR = 1985,
	month = "",
	volume = 40,
	number = "",
	pages = "131--148",
	copy = ""
}


@inproceedings{Bucetal2005,
  author    = {C. Buchheim and
               D. Ebner and
               M. J{\"u}nger and
               G. W. Klau and
               P. Mutzel and
               R. Weiskircher},
  title     = {Exact Crossing Minimization},
  booktitle = {Graph Drawing GD 2005},
  editor    = {P. Healy and
               N. S. Nikolov},
  pages     = {37--48},series = {LNCS},
  volume    = {3843},
  year      = {2005}

}

@inproceedings{BucZhe2006,
  author    = {C. Buchheim and
               L. Zheng},
  title     = {Fixed Linear Crossing Minimization by Reduction to the Maximum
               Cut Problem},
  booktitle = {Computing and Combinatorics COCOON},
  year      = {2006},
  pages     = {507--516},
  editor    = {D. Z. Chen and
               D. T. Lee},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4112},
}

@inproceedings{Bucetal2006,
  author    = {C. Buchheim and
               M. J{\"u}nger and
               A. Menze and
               M. Percan},
  title     = {Bimodal Crossing Minimization},
  booktitle = {Computing and Combinatorics COCOON},
  year      = {2006},
  pages     = {497--506},
 editor    = {D. Z. Chen and
               D. T. Lee},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4112},
}
@MISC{Bucetal2008,
  author = {K. Buchin and M. Buchin and J. Byrka and M. Nollenburg and Y. Okamoto and R. I. Silveira and A. Wolff},
  title = {Drawing (Complete) Binary Tanglegrams: Hardness, Approximation,   Fixed-Parameter Tractability},
  note = {\url{http://www.citebase.org/abstract?id=oai:arXiv.org:0806.0920}},
  year = {2008}
}
@INBOOK{Bud77,
	AUTHOR = "L. Budach",
	TITLE = "Environments, labyrinths and automata",
	PAGES = "54--64",
		  BOOKTITLE = {Fundamentals of Computation Theory FCT},
	CHAPTER = "",
	PUBLISHER = "Springer",
	YEAR = 1977,
	month = "",
	address = "",
	volume = 56,
	series = "LNCS",
	type = "",
	copy = ""
}


@ARTICLE{Bue60,
	AUTHOR = "R. B{\"u}chi",
	TITLE = "Weak second-order arithmetic and finite automata",
	JOURNAL = zmathlog,
	YEAR = 1960,
	month = "",
	volume = 6,
	number = "",
	pages = "66--92",
	copy = ""
}
@ARTICLE{Buc62,
	AUTHOR = "R. B{\"u}chi",
	TITLE = "Turing-machines and the {E}ntscheidungsproblem",
	JOURNAL = ma,
	YEAR = 1962,
	month = "",
	volume = 148,
	number = "",
	pages = "201--213",
	copy = ""
}



@ARTICLE{Bue83,
	AUTHOR = "J. R. B{\"u}chi",
	TITLE = "State-strategies for games in {$F_{\sigma\delta}\cap G_{\delta\sigma}$}",
	JOURNAL = "J. Symb. Logic",
	YEAR = 1983,
	month = "",
	volume = 48,
	number = "",
	pages = "1171--1198",
	copy = ""
}


@ARTICLE{BueLan69,
	AUTHOR = "J. R. B{\"u}chi and L. H. Landweber",
	TITLE = "Solving sequential conditions by finite-state strategies",
	JOURNAL = tams,
	YEAR = 1969,
	month = "",
	volume = 138,
	number = "",
	pages = "295--311",
	copy = ""
}




@ARTICLE{BuhOrp96,
	AUTHOR = "H. Buhrman and P. Orponen",
	TITLE = "Random strings make hard instances",
	JOURNAL = jcss,
	YEAR = 1996,
	month = "",
	volume = 53,
	number = "",
	pages = "261--266",
	copy = ""
}


@ARTICLE{BuiHsuLee92,
	AUTHOR = "T. N. Bui and W. Hsu and S.-L. Lee",
	TITLE = "Approximation algorithm for the multi-via assignment problem",
	JOURNAL = ieeetocad,
	YEAR = 1992,
	month = "",
	volume = 11,
	number = "11",
	pages = "1325--1333",
	copy = ""
}


@ARTICLE{BuiPec92,
	AUTHOR = "T. N. Bui and A. Peck",
	TITLE = "Partitioning planar graphs",
	JOURNAL = siam,
	YEAR = 1992,
	month = "",
	volume = 21,
	number = "2",
	pages = "203--215",
	copy = ""
}


@PhdThesis{Bum2002,
author = {A. Bumb},
title = {Approximation algorithms for facility location problems},
school = {Univ. Twente, The Netherlands},
year = {2002},
OPTkey = {},
type = {{PhD} {T}hesis},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
annote = {Available through~\url{http://doc.utwente.nl/38644/}}
}

@INPROCEEDINGS{BunZum98,
	AUTHOR = "H. Bunke and M. Zumb{\"u}hl",
	TITLE = "Acquisition of 2-{D} shape models from scenes with overlapping objects using string matching",
	BOOKTITLE = "Proceedings of SSPR'98",
	YEAR = 1998,
	month = "",
	volume = "1451",
	editor = "A. Amin and others",
	series = "LNCS",
	chapter = "",
	pages = "200--209",
	address = "",
	organization = "",
	copy = ""
}



@TECHREPORT{BunLor92,
	AUTHOR = "G. Buntrock and K. Lory\'s",
	TITLE = "On growing context-sensitive languages",
	INSTITUTION = "Bayerische Julius-Maximilians-Universit{\"a}t W{\"u}rzburg",
	YEAR = 1992,
	month = jan,
	number = "38",
	address = "",
	copy = ""
}


@TECHREPORT{BunLor93,
	AUTHOR = "G. Buntrock and K. Lory\'s",
	TITLE = "The variable membership problem: succinctness versus complexity",
	INSTITUTION = "Bayerische Julius-Maximilians-Universit{\"a}t W{\"u}rzburg",
	YEAR = 1993,
	month = apr,
	number = "60",
	address = "",
	copy = ""
}


@ARTICLE{BurCocMyn97,
	AUTHOR = "A.~P. Burger and E.~J. Cockayne and C.~M. Mynhardt",
	TITLE = "Domination and
  irredundance in the queen's graph",
	JOURNAL = dm,
	YEAR = 1997,
	month = "",
	volume = 163,
	number = "",
	pages = "47--66",
	copy = ""
}


@ARTICLE{BurMyn02,
	AUTHOR = "A.~P. Burger and C.~M. Mynhardt",
	TITLE = "An upper bound for the minimum number
  of queens covering the $n\times n$ chessboard",
	JOURNAL = dam,
	YEAR = 2002,
	month = "",
	volume = 121,
	number = "",
	pages = "51--60",
	copy = ""
}


@ARTICLE{BurMyn03,
	AUTHOR = "A.~P. Burger and C.~M. Mynhardt",
	TITLE = "An improved upper bound for queens
  domination numbers",
	JOURNAL = dm,
	YEAR = 2003,
	month = "",
	volume = 266,
	number = "",
	pages = "119--131",
	copy = ""
}

@ARTICLE{BurWan57,
   AUTHOR = 	"A. W. Burks and H. Wang",
   TITLE = 	"The logic of automata - part I",
   JOURNAL = 	jacm,
   YEAR = 	"1957",
   VOLUME = 	"4",
   NUMBER = 	"",
   PAGES = 	"193--218",
   MONTH = 	"",
   copy = 	"erste Seite fehlt"
 }


 @ARTICLE{BurWan57a,
   AUTHOR = 	"A. W. Burks and H. Wang",
   TITLE = 	"The logic of automata - part II",
   JOURNAL = 	jacm,
   YEAR = 	"1957",
   VOLUME = 	"4",
   NUMBER = 	"",
   PAGES = 	"279--297",
   MONTH = 	"",
   note = 	""
 }


 @ARTICLE{BurWan61,
   AUTHOR = 	"A. W. Burks and H. Wang",
   TITLE = 	"Computation, behaviour, and structure in fixed and
		    growing automata",
   JOURNAL = 	bsc,
   YEAR = 	"1961",
   VOLUME = 	"6",
   NUMBER = 	"",
   PAGES = 	"5--22",
   MONTH = 	"",
   note = 	""
 }


@ARTICLE{Bur94,
	AUTHOR = "A. Burns",
	TITLE = "Fractal tilings",
	JOURNAL = "The Mathematical Gazette",
	YEAR = 1994,
	month = "",
	volume = "",
	number = "",
	pages = "192--196",
	copy = ""
}


 @INBOOK{BurHavLab,
	   AUTHOR = "G. Burosch and I. Havel and J.-M. Laborde",
	   TITLE = "Some intersection theorems and a characterization of hypercubes",
	   PAGES = "23--26",
	   PUBLISHER = "Teubner DDR",
	   YEAR = "19??",
	   VOLUME = "",
	   SERIES = ttzm,
	   copy = ""
 }


@ARTICLE{BusGol93,
	AUTHOR = "J. F. Buss and J. Goldsmith",
	TITLE = "Nondeterminism within {P}",
	JOURNAL = siam,
	YEAR = 1993,
	month = "",
	volume = 22,
	number = "3",
	pages = "560--572",
	copy = ""
}

@ARTICLE{BusRosKno89,
	AUTHOR = "J. Buss and A. Rosenberg and J. Knott",
	TITLE = "Vertex types in book-embeddings",
	JOURNAL = siamdm,
	YEAR = 1989,
	month = "",
	volume = 2,
	number = "",
	pages = "156--175",
	copy = ""
}


 @ARTICLE{But74,
	 AUTHOR = "J. Butler",
	 TITLE = "A note on cellular automata simulations",
	 JOURNAL = icalt,
	 YEAR = 1974,
	 VOLUME = 26,
	 NUMBER = "",
	 PAGES = "286--295",
	 copy = ""
 }


CCCC

@INPROCEEDINGS{Cadetal95,
	AUTHOR = "M. Cadoli and F. M. Donini and P. Liberatore and M. Schaerf",
	TITLE = "The size of a revised knowledge base",
	BOOKTITLE = "Proceedings of the Fourteenth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems PODS'95",
	YEAR = 1995,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "151--162",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}



@ARTICLE{Cadetal02,
	AUTHOR = "M. Cadoli and F. M. Donini and P. Liberatore and M. Schaerf",
	TITLE = "Preprocessing of intractable problems",
	JOURNAL = ic,
	YEAR = 2002,
	month = "",
	volume = 176,
	number = "",
	pages = "89--120",
	copy = ""
}


@INPROCEEDINGS{Cai96,
	AUTHOR = "L. Cai",
	TITLE = "The computational complexity of {PCGS} with regular components",
	BOOKTITLE = "Developments in Language Theory II; at the
                  crossroads of mathematics, computer science and biology",
	YEAR = 1996, publisher = "Singapore: World Scientific",
	month = "",
	volume = "",
	editor = "J. Dassow and G. Rozenberg and A. Salomaa",
	series = "",
	chapter = "Controlled derivations and grammar systems",
	pages = "209--219",
	address = "",
	organization = "",
	copy = ""
}
		  
@ARTICLE{Cai96a,
	AUTHOR =  "L. Cai",
	TITLE = "The complexity of linear {PCGS}",
	JOURNAL = caai,
	YEAR = 1996,
	month = "",
	volume = 15,
	number = "",
	pages = "199--210",
	copy = ""
}


@INPROCEEDINGS{CaiChe93,
	AUTHOR = "L. Cai and J. Chen",
	TITLE = "On fixed-parameter tractability and approximability of {NP}-hard optimization problems",
	BOOKTITLE = "The 2nd {I}srael Symposium on Theory and Computing Systems",
	YEAR = 1993,
	month = jun,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "118--126",
	address = "",
	organization = "{IEEE} and {EATCS}",
	copy = ""
}


@INPROCEEDINGS{CaiChe93a,
	AUTHOR = "L. Cai and J. Chen",
	TITLE = "On the amount of nondeterminism and the power of verifying",
	BOOKTITLE = "MFCS'93, 18th international symposium",
	YEAR = 1993,
	month = "",
	volume = "711",
	editor = "A. M. Borzyszkowski and S. Soko\l owski",
	series = "LNCS",
	chapter = "",
	pages = "311--320",
	address = "",
	organization = "",
	copy = ""
}



@ARTICLE{CaiChe97,
	AUTHOR = "L. Cai and J. Chen",
	TITLE = "On fixed-parameter tractability and approximability
		  of {NP} optimization problems",
	JOURNAL = jcss,
	YEAR = 1997,
	month = "",
	volume = 54,
	number = "",
	pages = "465--474",
	copy = ""
}


@article{CaiChe97a,
	AUTHOR = "L. Cai and J. Chen",
	TITLE = "On the amount of nondeterminism and the power of verifying",
	YEAR = 1997,
	journal = siam,
	month = "",
	volume = "26",
	pages = "733--750",
	address = "",
	organization = "",
	copy = ""
}



@INPROCEEDINGS{CaiJueKan98,
	AUTHOR = "L. Cai and D. Juedes and I. Kanj",
	TITLE = "The inapproximability of Non {NP}-hard optimization problems",
	BOOKTITLE = "Algorithms and Computation --- 9th International Symposium ISAAC'98",
	YEAR = 1998,
	month = "",
	volume = "1533",
	editor = "K.-Y. Chwa and O. H. Ibarra",
	series = "LNCS",
	chapter = "",
	pages = "437--446",
	address = "",
	organization = "",
	copy = ""
}


 @InProceedings{Caietal94, 
 author = "L. Cai and J. Chen and R. Downey and M. Fellows", 
 title = "On the Structure of Parameterized Problems in {NP} (Extended Abstract)", 
 booktitle="STACS: Annual Symposium on Theoretical Aspects of Computer
                  Science", 
 series = "{LNCS}", volume ="775", pages="509--520",
 year="1994", 
} 


@Article{Caietal95, 
 title = "On the Structure of Parameterized Problems in {NP}", 
 author = "L. Cai and J. Chen and R. Downey and M. Fellows", 
 pages = "38--49", 
 journal  = icneu,
 month  = "15~" # nov, 
 year  =  "1995", 
 volume = "123", 
 number = "1", 

} 


@ARTICLE{CaiChe95,
	AUTHOR = "L. Cai and J. Chen",
	TITLE = "On input read-modes of alternating {T}uring machines",
	JOURNAL = tcs,
	YEAR = 1995,
	month = "",
	volume = 148,
	number = "",
	pages = "33--55",
	copy = ""
}

@ARTICLE{Cai96b,
	AUTHOR = "L. Cai",
	TITLE = "Fixed-parameter tractability of graph modification problems for hereditary properties",
	JOURNAL = ipl,
	YEAR = 1996,
	month = "",
	volume = 58,
	number = "",
	pages = "171--176",
	copy = ""
}



@Article{Caietal97, 
 author ="L. Cai and J. Chen and R. Downey and M. Fellows", 
 title = "Advice classes of parameterized tractability", 
 journal= apal, 
		  pages ={119--138},
 volume= "84", 
 year = "1997", 
} 
@ARTICLE{Cai03,
	AUTHOR = "L. Cai",
	TITLE = "The complexity of the locally connected spanning tree problem",
	JOURNAL = dam,
	YEAR = 2003,
	month = "",
	volume = 131,
	number = "",
	pages = "63--75",
}
		  
@ARTICLE{Cai03a,
	AUTHOR = "L. Cai",
	TITLE = "Parameterized complexity of vertex colouring",
	JOURNAL = dam,
	YEAR = 2003,
	month = "",
	volume = 127,
	number = "",
	pages = "415--429",
}
		  

@ARTICLE{CaiJue03,
	AUTHOR = "L.~Cai and D.~Juedes",
	TITLE = "On the existence of subexponential parameterized algorithms",
	JOURNAL = jcss,
	YEAR = 2003,
	month = "",
	volume = 67,
	number = "",
	pages = "789--807",
	copy = ""
}

@article{Cai2008,
  author    = {L. Cai},
  title     = {Parameterized Complexity of Cardinality Constrained Optimization
               Problems},
  journal   = {The Computer Journal},
  volume    = {51},
  number    = {1},
  year      = {2008},
  pages     = {102--121},
}

@ARTICLE{CajSan85,
	AUTHOR = "H. Cajar and K. Sandau",
	TITLE = "Perfekte {M}engen mit unterschiedlicher {H}ausdorff-
und unterer metrischer {D}imension",
	JOURNAL = archmath,
	YEAR = 1985,
	month = "",
	volume = 45,
	number = "",
	pages = "21--33",
	copy = ""
}


@INPROCEEDINGS{Caletal2002,
	AUTHOR = "G. Calinescu and A. Chakrabarti and H. Karloff and Y. Rabani",
	TITLE = "Improved Approximation Algorithms for Resource Allocation",
	BOOKTITLE = "Integer Programming and Combinatorial Optimization : 9th International IPCO Conference",
	YEAR = 2002,
	month = "",
	volume = "2337",
	editor = "W. J. Cook and A. S. Schulz",
	series = "LNCS",
	chapter = "",
	pages = "401--414",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{CalGia90,
	AUTHOR = "D. Calzetti and M. Giavalisco",
	TITLE = "Fractal structures and the angular correlation
function of galaxies",
	JOURNAL = "Vistas in Astronomy",
	YEAR = 1990,
	month = "",
	volume = 33,
	number = "3/4",
	pages = "295--304",
	copy = ""
}


@ARTICLE{CalMas96,
	AUTHOR = "I. Jim\'enez Calvo and J. Mu\~noz Masqu\'e",
	TITLE = " Fractals related to {P}ascal's triangle",
	JOURNAL = {Acta Applicandae Mathematicae},
	YEAR = 1996,
	month = "",
	volume = 42,
	number = "",
	pages = "139--159",
	copy = ""
}



@ARTICLE{CalZam99,
	AUTHOR = "C. Calude and T. Zamfirescu",
	TITLE = "Most numbers obey no probability laws",
journal = publmath, volume = 54,
	month = "",
	number = "Supplement", pages = {619--623},
	address = "",
}


@ARTICLE{Cametal2006,
	AUTHOR = "A. Cami and H. Balakrishnan and  N. Deo  and R. Dutton",
	TITLE = "On the Complexity of Finding Optimal Global Alliances",
	JOURNAL = {Journal of Combinatorial Mathematics and Combinatorial Computing},
	YEAR = 2006,
	month = "",
	volume = 58,
	number = "",
	pages = "23--32",
	copy = ""
}


@INPROCEEDINGS{Canetal92,
	crossref = "DeGetal92",
	AUTHOR = "M. Cannataro and others",
	TITLE = "Dynamic process scheduling in a parallel logic machine",
	chapter = "",
	pages = "22--31",
	copy = ""
}



@ARTICLE{Can69,
	AUTHOR = "G. Cantor",
	TITLE = "Ueber die einfachen {Z}ahlensysteme",
	JOURNAL = {Zeitschrift {f\"ur} Mathematik und Physik},
	YEAR = 1869,
	month = "",
	volume = 14,
	number = "",
	pages = "121--128",
	copy = ""
}



@ARTICLE{Can83,
	AUTHOR = "G. Cantor",
	TITLE = "Ueber unendliche, lineare {P}unktmannichfaltigkeiten {V}",
	JOURNAL = ma,
	YEAR = 1883,
	month = "",
	volume = 21,
	number = "",
	pages = "545--591",
	copy = ""
}


@INBOOK{Cap80,
	AUTHOR = "R. M. Capocelli",
	TITLE = "On weakly prefix subsemigroups of a free semigroup",
	PAGES = "123--129",
	Booktitle = "Advances in Communication; D.G. Lainiotis and
N.S. Tzannes (eds.)",
	PUBILSHER = "Dordrecht: D. Reidel",
	YEAR = 1980,
	month = "",
	address = "",
	volume = "",
	series = "",
	type = "",
	copy = ""
}


@InProceedings{CaplanNg2000,
  author =       "A. Caprara and G. Lancia and See Kiong Ng",
  title =        "Fast practical solution of sorting by reversals",
  pages =        "12--21",
  booktitle =    "Proceedings of the Eleventh Annual {ACM}-{SIAM}
                 Symposium on Discrete Algorithms",
  month =        jan # "~9--11",
  publisher =    "ACM Press",
  address =      "N.Y.",
  year =         "2000",
}

@Article{CapKelPfe00,
  author =       "A. Caprara and H. Kellerer and U. Pferschy",
  title =        "A {PTAS} for the Multiple Subset Sum Problem with
                 Different Knapsack Capacities",
  journal =      ipl,
  volume =       "73",
  year =         "2000", pages ={111--118}
}



@ARTICLE{CarHarKor2004,
	AUTHOR = "L. Carmel and D. Harel and Y. Koren",
	TITLE = "Combining hierarchy and energy for drawing directed graphs",
	JOURNAL = {IEEE Transactions on Visualization and Computer Graphics},
	YEAR = 2004,
	month = "",
	volume = 10,
	number = "1",
	pages = "46--57",
	copy = ""
}

@ARTICLE{CarPau81,
	AUTHOR = "A. C{\u a}r\u au\c{s}u and Gh. P\u aun",
	TITLE = "String intersection and short concatenation",
	JOURNAL = rrmpa,
	YEAR = 1981,
	month = "",
	volume = "XXVI",
	number = "5",
	pages = "713--726",
	copy = ""
}


@ARTICLE{Car21,
	AUTHOR = "F. Carlson",
	TITLE = "{\"U}ber {P}otenzreihen mit ganzzahligen {K}oeffizienten",
	JOURNAL = mz,
	YEAR = 1921,
	month = "",
	volume = 9,
	number = "",
	pages = "1--13",
	copy = ""
}


 @INPROCEEDINGS{CarGrePaz74,
   AUTHOR = 	"J. W. Carlyle and S. A. Greibach and A. Paz",
   TITLE = 	"A two-dimensional generating system modeling growth by
		    binary cell division (preliminary report)",
   BOOKTITLE = 	"XV. Annual Conference on Switching and Automata Theory",
   YEAR = 	"1974",
   EDITOR = 	"",
   PAGES = 	"1--12",
   ORGANIZATION = 	"",
   PUBLISHER = 	"",
   ADDRESS = 	"",
   MONTH = 	"",
   note = 	""
 }

 @INPROCEEDINGS{CarLemNie2004,
   title  =  {Learning  Node  Selecting  Tree  Transducer  from  Completely  Annotated  Examples},
   year  =  {2004},
   author  =  {J.  Carme  and  A.  Lemay  and  J.  Niehren},
   booktitle  =  {{International  Colloquium  on  Grammatical  Inference ICGI}},
   pages  =  {91--102},
   series  =  {LNCS/LNAI},
   volume  =  {3264},
   publisher  =  {Springer}, 	editor = "G. Paliouras and Y. Sakakibara",

}

@ARTICLE{CarWesYus00,
	AUTHOR = "Y. Caro and  D.~B. West and R. Yuster",
	TITLE = "Connected domination and spanning trees",
	JOURNAL = siamdm,
	YEAR = 2000,
	month = "",
	volume = 13,
	number = "",
	pages = "202--211",
	copy = ""
}

@ARTICLE{CarZia2000,
	AUTHOR = "P. Caron and D. Ziadi",
	TITLE = "Characterization of {G}lushkov automata",
	JOURNAL = tcs,
	YEAR = 2000,
	month = "",
	volume = 233,
	number = "",
	pages = "75--90",
	copy = ""
}


@ARTICLE{Caretal2001,
	AUTHOR = "R. Carr and T. Fujito and G. Konjevod and O. Parekh",
	TITLE = "A $2\ 1/10$ approximation algorithm for a generalization of the weighted edge-dominating set problem",
	JOURNAL = jco,
	YEAR = 2001,
	month = "",
	volume = 5,
	number = "",
	pages = "317--326",
	copy = ""
}


@ARTICLE{CarOnc99,
	AUTHOR = "R. C. Carrasco and J. Oncina",
	TITLE = "Learning deterministic regular grammars from stochastic samples in polynomial time",
	JOURNAL = rairo,
	YEAR = 1999,
	month = "",
	volume = 33,
	number = "",
	pages = "1--19",
	copy = ""
}

@ARTICLE{CarMis96,
	AUTHOR = "J. A. Carruth and J. Misra",
	TITLE = "Proof of a real-time mutual-exclusion algorithm",
	JOURNAL = ppl,
	YEAR = 1996,
	month = "",
	volume = 6,
	number = "2",
	pages = "251--257",
	copy = ""
}


@ARTICLE{CarWea2005,
	AUTHOR = "T.~A. Carter and W.~D. Weakley",
	TITLE = "The $n$-queens problem with diagonal constraints",
	JOURNAL = {J. Combin. Math. \& Combin. Comput.},
	YEAR = 2005,
	month = "",
	volume = 53,
	number = "",
	pages = "165--178",
	copy = ""
}
@ARTICLE{Car96,
	AUTHOR = "O. Carton",
	TITLE = "Chain automata",
	JOURNAL = tcs,
	YEAR = 1996,
	month = "",
	volume = 161,
	number = "",
	pages = "191--203",
	copy = ""
}

@inproceedings{Caretal2007,
  author    = {R. Carvajal and
               M. Matamala and
               I. Rapaport and
               N. Schabanel},
  title     = {Small Alliances in Graphs},
  booktitle = {Mathematical Foundations of Computer Science MFCS},
  year      = {2007},
  pages     = {218--227},
  editor    = {L. Kucera and
               A. Kucera},
  publisher = {Springer},
  series    = {LNCS},
volume    = {4708},
}

@ARTICLE{CasHig2000,
	AUTHOR = "F. Casacuberta and C. de la Higuera",
	TITLE = "Median string is {NP} complete",
	JOURNAL = tcs,
	YEAR = 2000,
	month = "",
	volume = 230,
	number = "",
	pages = "39--48",
	copy = ""
}



@ARTICLE{CasKuh90,
	AUTHOR = "T. L. Casavant and J. G. Kuhl",
	TITLE = "A communicating finite automata approach to modeling
distributed computation and its application to distributed decision-making",
	JOURNAL = ieeetoc,
	YEAR = 1990,
	month = "",
	volume = 39,
	number = "5",
	pages = "628--639",
	copy = ""
}




@ARTICLE{Casetal99,
	AUTHOR = "J. Case and S. Jain and S. Lange and T. Zeugmann",
	TITLE = "Incremental Concept Learning for Bounded Data Mining",
	JOURNAL = ic,
	YEAR = 1999,
	month = "",
	volume = 152,
	number = "",
	pages = "74--110",
	copy = ""
}




@ARTICLE{CasSmi83,
	AUTHOR = "J. Case and C. Smith",
	TITLE = "Comparison of Identification Criteria for Machine Inductive Inference",
	JOURNAL = tcs,
	YEAR = 1983,
	month = "",
	volume = 25,
	number = "",
	pages = "193--220",
	copy = ""
}


@ARTICLE{CasLec96,
	AUTHOR = "R. G. Casey and E. Lecolinet",
	TITLE = "A survey of methods and strategies in character segmentation",
	JOURNAL = ieeetopami,
	YEAR = 1996,
	month = "",
	volume = 18,
	number = "",
	pages = "690--706",
	copy = ""
}


@ARTICLE{deCas02,
	AUTHOR = "Castro, N. de and F. J. Cobos and J. C. Dana and A. M\'arquez and M. Noy",
	TITLE = "Triangle-free planar graphs as segment intersection graphs",
	JOURNAL = {Journal of Graph Algorithms and Applications},
	YEAR = 2002,
	month = "",
	volume = 6,
	number = "",
	pages = "7--26",
	copy = ""
}

@ARTICLE{Catetal97,
	AUTHOR = "G. Cattaneo and others",
	TITLE = "Transformations of the one-dimensional cellular
automata rule space",
	JOURNAL = {Parallel Computing},
	YEAR = 1997,
	month = "",
	volume = 23,
	number = "",
	pages = "1593--1611",
	copy = ""
}


@ARTICLE{CawMau92,
	AUTHOR = "R. Cawley and R. D. Mauldin",
	TITLE = "Multifractal decompositions of {M}oran fractals",
	JOURNAL = am,
	YEAR = 1992,
	month = "",
	volume = 92,
	number = "2",
	pages = "196--236",
	copy = ""
}


@ARTICLE{Cei59,
	AUTHOR = "{\cyr G. S. Ce\u\i tin}",
	TITLE = "{\cyr {A}lgorifmiqeskie operatory v
konstruktivnyh polnyh separabel\cprime nyh metriqeskih prostranstvah}",
	JOURNAL = "{\cyr Doklady Akademii Nauk SSSR}",
	YEAR = 1959,
	month = "",
	volume = 128,
	number = "1",
	pages = "49--52",
	copy = ""
}


@ARTICLE{Cei62,
	AUTHOR = "{\cyr G. S. Ce\u\i tin}",
	TITLE = "{\cyr {A}lgorifmiqeskie operatory v
konstruktivnyh metriqeskih prostranstvah}",
	JOURNAL = "{\cyr Trudy Matematiqeskogo Instituta imeni V.A. Steklova}",
	YEAR = 1962,
	month = "",
	volume = 67,
	number = "",
	pages = "295--361",
	copy = ""
}

@inproceedings{Cer2005,
	author = "M. Ceresna and  G. Gottlob",
	title = "Query based learning of XPath fragments",
	booktitle = "Proceedings of Dagstuhl Seminar on Machine Learning for the Semantic Web (05071)",
	year = "2005",
	address = "Dagstuhl, Germany",
}

@ARTICLE{Ces05,
	AUTHOR = "E. C\'esaro",
	TITLE = "Remarques sur la courbe de von {K}och",
	JOURNAL = "Atti della R. Accad. Sc. Fis. Math. Napoli",
	YEAR = 1905,
	month = "",
	volume = 12,
	number = "",
	pages = "1--12",
	copy = ""
}


@ARTICLE{CesFel96,
	AUTHOR = "M. Cesati and M. Fellows",
	TITLE = "Sparse parameterized problems",
	JOURNAL = apal,
	YEAR = 1996,
	month = "",
	volume = 62,
	number = "",
	pages = "1--15",
	copy = ""
}


@INPROCEEDINGS{CesWar95,
	AUTHOR = "M. Cesati and H. T. Wareham",
	TITLE = "Parameterized complexity analysis of robot motion planning",
	BOOKTITLE = "Proc. 25th IEEE Int. Conf. on Systems, Man and Cybernetics",
	YEAR = 1995,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}



@ARTICLE{CesIan97,
	AUTHOR = "M. Cesati and M. {Di Ianni}",
	TITLE = "Computation models for parameterized complexity",
	JOURNAL = {Mathematical Logic Quarterly},
	YEAR = 1997,
	month = "",
	volume = 43,
	number = "",
	pages = "179--202",
	copy = ""
}

@ARTICLE{CesTre97,
	AUTHOR = "M. Cesati and L. Trevisan",
	TITLE = "On the efficiency of polynomial time approximation schemes",
	JOURNAL = ipl,
	YEAR = 1997,
	month = "",
	volume = 64,
	number = "",
	pages = "165--171",
	copy = ""
}
@TechReport{Ces2000,
author = {M. Cesati},
title = {Perfect Code is $W[1]$-complete},
institution = {Electronic Colloquium on Computational Complexity},
year = {2000},
OPTkey = {},
OPTtype = {},
OPTnumber = {ECCC Report TR00-080},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {Also: Information Processing Letters (81)3 163--168, 2002}
}


@ARTICLE{Ces2003,
	AUTHOR = "M. Cesati",
	TITLE = "The {T}uring way to parameterized complexity",
	JOURNAL = jcss,
	YEAR = 2003,
	month = "",
	volume = 67,
	number = "",
	pages = "654--685",
	copy = ""
}

@ARTICLE{Cha66,
	AUTHOR = "G. J. Chaitin",
	TITLE = "On the length of programs for computing finite binary sequences",
	JOURNAL = jacm,
	YEAR = 1966,
	month = "",
	volume = 13,
	number = "4",
	pages = "547--569",
	copy = ""
}



@ARTICLE{Cha69,
	AUTHOR = "G. J. Chaitin",
	TITLE = "On the simplicity and speed of programs for computing
infinite sets of natural numbers",
	JOURNAL = jacm,
	YEAR = 1969,
	month = "",
	volume = 16,
	number = "3",
	pages = "407--422",
	copy = ""
}



@ARTICLE{Chaetal81,
	AUTHOR = "S. Chaiken and D.~J. Kleitman and M. Saks and J Shearer",
	TITLE = "Covering regions by rectangles",
	JOURNAL = {SIAM J. Algebraic Discrete Methods},
	YEAR = 1981,
	month = "",
	volume = 2,
	number = "",
	pages = "394--410",
	copy = ""
}



@INPROCEEDINGS{Cha2003,
	AUTHOR = "S. K. Chalup",
	TITLE = "Towards Staged Evolution of an Artificial Player for Hex by Enlarging the Boardsize During Training",
	BOOKTITLE = "Congress on Evolutionary Computation CEC",
	YEAR = 2003,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "IEEE",
        publisher = "",
	copy = ""
}




@ARTICLE{ChaYeu2000,
	AUTHOR = "K.-F. Chan and D.-Y. Yeung",
	TITLE = "An efficient syntactic approach to structural analysis of on-line handwritten
   mathematical expressions",
	JOURNAL = patrec,
	YEAR = 2000,
	month = "",
	volume = 33,
	number = "",
	pages = "375--384",
	copy = ""
}


@ARTICLE{Cha86,
	   AUTHOR = "D. K. Chang",
	   TITLE = "On Fibonacci {$k$}-ary trees",
	   JOURNAL = fiq,
	   YEAR = 1986,
	   VOLUME = 24,
	   NUMBER = 3,
	   PAGES = "258--262",
	   copy = ""
 }


@ARTICLE{Cha88,
	AUTHOR = "T.-H. Chan",
	TITLE = "The boundedness problem for three-dimensional vector
		  addition systems with states",
	JOURNAL = ipl,
	YEAR = 1988,
	month = "",
	volume = 26,
	number = "",
	pages = "287--289",
	copy = ""
}

@INPROCEEDINGS{ChaGra2004,
	AUTHOR = "L. Sunil Chandran and F. Grandoni",
	TITLE = "Refined memorization for vertex cover",
	BOOKTITLE = "International Workshop on Parameterized and Exact
Computation IWPEC 2004",
	YEAR = 2004,
	month = "",
	volume = "3162",
	editor = "R. Downey and M. Fellows and F. Dehne",
	series = "LNCS",
	chapter = "",
	pages = "61--70",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}
@ARTICLE{ChaGra2005,
	AUTHOR = "L. Sunil Chandran and F. Grandoni",
	TITLE = "Refined memorization for vertex cover",
	JOURNAL = ipl,
	YEAR = 2005,
	month = "",
	volume = 93,
	number = "",
	pages = "125--131",
	copy = ""
}

@ARTICLE{ChaLam85,
	AUTHOR = "K. M. Chandy and L. Lamport",
	TITLE = "Distributed snapshots: determining global states of
distributed systems",
	JOURNAL = acmtcs,
	YEAR = 1985,
	month = "",
	volume = 3,
	number = "1",
	pages = "63--75",
	copy = ""
}

@ARTICLE{ChaCon99,
	AUTHOR = "C.-C. Chang and J. Cong",
	TITLE = "An efficient approach to multilayer layer assignment with an application to via minimization",
	JOURNAL = {IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems},
	YEAR = 1999,
	month = "",
	volume = 18,
	number = "5",
	pages = "608--620",
	copy = ""
}

@Article{ChaFucPat89,
author = {Chang, M.-F.,  and Fuchs, W.~K., and   Patel, J.~H.},
title = {Diagnosis and repair of memory with coupling faults},
journal = ieeetoc,
year = {1989},
OPTkey = {},
volume = {38},
OPTnumber = {},
pages = {493--500},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{Cha2004,
	AUTHOR = "G. J. Chang",
	TITLE = "The weighted independent domination problem is {NP}-complete for chordal graphs",
	JOURNAL = dam,
	YEAR = 2004,
	month = "",
	volume = 143,
	number = "",
	pages = "351--352",
	copy = ""
}


@Article{Chaetal2007,
author = {W. Chaovalitwongse and T.~Y. Berger-Wolf and B. DasGupta and M. Ashley},
title = {Set Covering Approach for Reconstruction of Sibling Relationships},
journal = {Optimization Methods and Software},
year = {2007},
OPTkey = {},
volume = {22},
OPTnumber = {},
pages = {11--24},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@ARTICLE{ChaThoYeo2007,
AUTHOR={P. Charbit and S. Thomass\'e and A. Yeo},
TITLE={The minimum feedback arc set problem is {NP}-hard for  
tournaments},
YEAR={2007},
JOURNAL={Combinatorics, Probability and Computing},
VOLUME={16},PAGES={1--4}
}

@ARTICLE{Chaetal2007,
	AUTHOR = "P. Chardaire and M. Barake and G. P. McKeown",
	TITLE = "A {PROBE}-based heuristic for graph partitioning",
	JOURNAL = ieeetoc,
	YEAR = 2007,
	month = "",
	volume = 56,
	number = "12",
	pages = "1707--1720",
	copy = ""
}


@ARTICLE{Chaetal2002,
	AUTHOR = "M. Charikar and S. Guha and E. Tardos and D. S. Shmoys",
	TITLE = "A constant-factor approximation algorithm for the $k$-median problem",
	JOURNAL = jcss,
	YEAR = 2002,
	month = "",
	volume = 65,
	number = "",
	pages = "129--149",
	copy = ""
}

@InProceedings{Chaetal2001,
author = {M. Charikar and S. Khuller and D. M. Mount and G. Narasimhan},
title = {Algorithms for Facility Location Problems with Outliers},
booktitle = {ACM-SIAM Symposium on Discrete Algorithms SODA},
OPTcrossref = {},
OPTkey = {},
pages = {642--651},
year = {2001},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}


@Article{ChaHud2007,
author = {I. Charon and O. Hudry},
title = {A survey on the linear ordering problem for weighted or unweighted tournaments},
journal = {4OR: A Quarterly Journal of Operations Research},
year = {2007},
OPTkey = {},
volume = {5},
OPTnumber = {},
pages = {5--60},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}


@ARTICLE{ChaVit2007,
	AUTHOR = "N. Chater and P. Vit\'anyi",
	TITLE = "'{I}deal learning' of natural language: Positive results about learning from positive evidence",
	JOURNAL = {Journal of Mathematical Psychology},
	YEAR = 2007,
	month = "",
	volume = 51,
	number = "",
	pages = "135--163",
	copy = ""
}

@InProceedings{CheKor92,
author = {W. Che and I. Koren},
title = {Fault spectrum analysis for fast spare allocation in reconfigurable arrays},
booktitle = {International Workshop on Defect and Fault Tolerance in VLSI Systems},
OPTcrossref = {},
OPTkey = {},
pages = {60--69},
year = {1992},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
organization = {IEEE},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{CheFor90,
	AUTHOR = "M. Chean and J. A. B. Fortes",
	TITLE = "A taxonomy of reconfiguration techniques for
fault-tolerant processor arrays",
	JOURNAL = ieeecomp,
	YEAR = 1990,
	month = jan,
	volume = "",
	number = "",
	pages = "55--69",
	copy = "",
	note = ""
}



@Article{CheFor90a,
  author =       "M. Chean and J. A. B. Fortes",
  title =        "The Full-Use-of-Suitable-Spares ({FUSS}) Approach to
                 Hardware Reconfiguration for Fault-Tolerant Processor
                 Arrays",
  pages =        "564--570",
  journal =      ieeetoc,
  volume =       "39",
  number =       "4",
  month =        apr,
  year =         "1990",
  publisher =    "IEEE Computer Society",
  address =      "Washington, DC",
}


@ARTICLE{Cheetal2003,
	AUTHOR = "J. Cheetham and F. Dehne and A. Rau-Chaplin and U. Stege and P. J. Taillon",
	TITLE = "Solving large {FPT} problems on coarse-grained parallel machines",
	JOURNAL = jcss,
	YEAR = 2003,
	month = "",
	volume = 67,
	number = "",
	pages = "691--706",
	copy = ""
}
@inproceedings{Cheetal2003a,
	AUTHOR = "J. Cheetham and F. Dehne and A. Rau-Chaplin and U. Stege and P. J. Taillon",
  title     = {A Parallel {FPT} Application For Clusters},
  booktitle = {CCGRID},
  year      = {2003},
  pages     = {70-77},
  crossref  = {ccgrid2003},
}

@proceedings{ccgrid2003,
  title     = {3rd IEEE International Symposium on Cluster Computing and
               the Grid CCGrid 2003},
  booktitle = {CCGRID},
  publisher = {IEEE Computer Society},
  year      = {2003},
}

@INPROCEEDINGS{CheKha03,
	AUTHOR = "C. Chekuri and S. Khanna",
	TITLE = "Edge Disjoint Paths Revisited",
	BOOKTITLE = "SODA 2003",
	YEAR = 2003,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "??",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@InProceedings{Cheetal91a,
  author =       "C. Chen and A. Feng and T. Kikuno and K. Torii",
  title =        "Reconfiguration Algorithm for Fault-Tolerant Arrays
                 with Minimum Number of Dangerous Processors",
  pages =        "452--461",
  booktitle =    "Fault Tolerant Computing",
  month =        jun,
  publisher =    "IEEE Computer Society Press",
  address =      "Los Alamitos, Ca., USA",
  year =         "1991",
}

@INPROCEEDINGS{Cheetal2003b,
	AUTHOR = "J. Chen and I. A. Kanj and L. Perkovic and E. Sedgwick and G. Xia",
	TITLE = "Genus Characterizes the Complexity of Graph Problems: Some Tight Results",
	BOOKTITLE = "ICALP 2003",
	YEAR = 2003,
	month = "",
	volume = "2719",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "845--856",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@INPROCEEDINGS{Cheetal2004a,
	AUTHOR = "J. Chen and B. Chor and M. Fellows and X. Huang and D. W. Juedes and I. Kanj and G. Xia",
	TITLE = "Tight Lower Bounds for Certain Parameterized {NP}-Hard Problems",
	BOOKTITLE = "Proc. 19th Annual IEEE Conference on Computational Complexity CCC",
	YEAR = 2004,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "150--160",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}


@TECHREPORT{Cheetal2002,
	AUTHOR = "J. Chen  and I.~A. Kanj and Ge Xia",
	TITLE = "A note on parameterized exponential time complexity",
	INSTITUTION = "Computer Science Department, de Paul's University",
	YEAR = 2002,
	month = "TR03-2002",
	number = "",
url = {http://facweb.cs.depaul.edu/research/TechReports/TR03-002.pdf},
	address = "",
	copy = ""
}


@INPROCEEDINGS{Cheetal2005,
	AUTHOR = "J. Chen and H. Fernau and I.~A. Kanj and Ge Xia",
	TITLE = "Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size",
	BOOKTITLE = "Symposium on Theoretical Aspects of Computer Science STACS 2005",
	YEAR = 2005,
	month = "",
	volume = "3404",
	editor = "V. Diekert and B. Durand",
	series = "LNCS",
	chapter = "",
	pages = "269--280",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@INPROCEEDINGS{CheKan01,
	AUTHOR = "J. Chen and I.~A. Kanj",
	TITLE = "On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms",
	BOOKTITLE = "Graph-Theoretic Concepts in Computer Science WG'01",
	YEAR = 2001,
	month = "",
	volume = "2204",
	editor = "A. Brandst{\"a}dt and V.~B. Le",
	series = "LNCS",
	chapter = "",
	pages = "55--65",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}
@ARTICLE{CheKanJia01,
	AUTHOR = "J. Chen and I. A. Kanj and W. Jia",
	TITLE = "Vertex cover: further observations and further improvements",
	JOURNAL = jalg,
	YEAR = 2001,
	month = "",
	volume = 41,
	number = "",
	pages = "280--301",
	copy = ""
}
@InProceedings{Cheetal2001,
author = {J. Chen and D.~K. Friesen and W. Jia and I.~A. Kanj},
title = {Using nondeterminism to design efficient deterministic algorithms},
booktitle = {Foundations of Software Technology and Theoretical Computer Science FSTTCS},
OPTcrossref = {},
OPTkey = {},
pages = {120--131},
year = {2001},
editor = {R- Hariharan and M. Mukund and V. Vinay},
volume = {2245},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}

@INPROCEEDINGS{CheKanXia2003,
	AUTHOR = "J. Chen and I.~A. Kanj and Xia, G.",
	TITLE = "Labeled search trees and amortized analysis: improved upper bounds for {NP}-hard problems",
	BOOKTITLE = "Proc. 14th Annual International Symposium on Algorithms and Computation",
	YEAR = 2003,
	month = "",
	volume = "2906",
	editor = "T. Ibaraki and
               N. Katoh and
               H. Ono",
	series = "LNCS",
	chapter = "",
	pages = "148--157",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}


@ARTICLE{CheKan03,
	AUTHOR = "J. Chen and I.~A. Kanj",
	TITLE = "Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithmics",
	JOURNAL = jcss,
	YEAR = 2003,
	month = "",
	volume = 67,
	number = "",
	pages = "833--847",
	copy = ""
}
@ARTICLE{CheKan2004,
	AUTHOR = "J. Chen and I.~A. Kanj",
	TITLE = "Improved Exact Algorithms for {M}ax-{S}at",
	JOURNAL = dam,
	YEAR = 2004,
	month = "",
	volume = 142,
	number = "",
	pages = "17--27",
	copy = ""
}


@INPROCEEDINGS{Cheetal2004b,
	AUTHOR = "J. Chen and X. Huang and I. A. Kanj and G. Xia",
	TITLE = "Polynomial time approximation schemes and parameterized complexity",
	BOOKTITLE = "Mathematical Foundations of Computer Science MFCS 2004",
	YEAR = 2004,
	month = "",
	volume = "3153",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "500--512",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{Cheetal2006,
	AUTHOR = "J. Chen and X. Huang and I.~A. Kanj and G. Xia",
	TITLE = "On the computational hardness based on linear {FPT}-reductions",
	JOURNAL = {J. Comb. Optim.},
	YEAR = 2006,
	month = "",
	volume = 11,
	number = "",
	pages = "231--247",
	copy = ""
}

@inproceedings{CheKanXia2006,
  author    = {J. Chen and
               I. A. Kanj and
               G. Xia},
  title     = {Improved Parameterized Upper Bounds for Vertex Cover},
  booktitle = {Mathematical Foundations of Computer Science MFCS},
  year      = {2006},
  pages     = {238--249},
  editor    = {R. Kralovic and
               P. Urzyczyn},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4162},
}

@ARTICLE{Cheetal2007,
	AUTHOR = "J. Chen and H. Fernau and Y.~A. Kanj and G. Xia",
	TITLE = "Parametric duality and kernelization: lower bounds and upper bounds on kernel size",
	JOURNAL = siam,
	YEAR = 2007,
	month = "",
	volume = 37,
	number = "",
	pages = "1077--1108",
	copy = ""
}

@inproceedings{Cheetal2007a,
  author    = {J. Chen and
               S. Lu and
               S.-H. Sze and
               F. Zhang},
  title     = {Improved algorithms for path, matching, and packing problems},
  booktitle = {Symposium
               on Discrete Algorithms SODA},
  year      = {2007},
  pages     = {298--307},
  editor    = {N. Bansal and
               K. Pruhs and
               C. Stein},
  publisher = {SIAM},
}

@Techreport{Cheetal2008,
  author    = {J. Chen and
               H. Fernau and
               D. Ning and
               D. Raible and
               J. Wang},
  title     = {A Parameterized Perspective on {P$_{\mbox{2}}$}-Packings},
  number    = {0804.0570},
  year      = {2008},
	INSTITUTION = "ArXiv",
  address        = {\url{http://arxiv.org/abs/0804.0570}},
}

@article{CheUpa93,
  author    = {Y.-Y. Chen and
               S. J. Upadhyaya},
  title     = {Reliability, Reconfiguration, and Spare Allocation Issues
               in Binary-Tree Architectures Based on Multiple-Level Redundancy},
  journal   = ieeetoc,
  volume    = {42},
  number    = {6},
  year      = {1993},
  pages     = {713--723},
}
@INPROCEEDINGS{CheShi88,
	crossref = "Hyper3",
	AUTHOR = "M.-J. Chen and K. G. Shin",
	TITLE = "Message routing in an injured hypercube",
	chapter = "6",
	pages = "312--317",
	copy = ""
}



@ARTICLE{CheShi90,
	AUTHOR = "M.-J. Chen and K. G. Shin",
	TITLE = "Adaptive fault-tolerant routing in hypercube multicomputers",
	JOURNAL = ieeetoc,
	YEAR = 1992,
	month = "",
	volume = 39,
	number = "12",
	pages = "1406--1416",
	copy = ""
}

@ARTICLE{CheKelCro93,
	AUTHOR = "S. S. Chen and J. M. Keller and R. M. Crownover",
	TITLE = "On the calculation of fractal features from images",
	JOURNAL = ieeetopami,
	YEAR = 1993,
	month = oct,
	volume = 15,
	number = "10",
	pages = "1087--1090",
	copy = ""
}

@ARTICLE{Cheetal2005a,
	AUTHOR = "X. Chen and J. Zheng and Z. Fu and P. Nan and Y. Zhong and S. Lonardi and T. Jiang",
	TITLE = "Assignment of orthologous genes via genome rearrangement",
	JOURNAL = ieeeacmtcbbi,
	YEAR = 2005,
	month = "",
	volume = 2,
	number = "",
	pages = "302--315",
	copy = ""
}

@INPROCEEDINGS{CheFlu2003,
	AUTHOR = "Y. Chen and J. Flum",
	TITLE = "Machine characterization of the classes of the {W}-hierarchy",
 editor    = {M. Baaz and
               J. A. Makowsky},
	BOOKTITLE   = {Computer Science Logic, 17th International Workshop, CSL 2003},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {2803},
  year      = {2003},
	pages = "114--127",
	copy = ""
}



@Article{CheCheCho94,
  author =       "Y.-Y. Chen and C.-H. Cheng and Y.-C. Chou",
  title =        "An Effective Reconfiguration Process for
                 Fault-Tolerant {VLSI\slash WSI} Array Processors",
  journal =      "Lecture Notes in Computer Science",
  volume =       "852",
  pages =        "421--438",
  year =         "1994",

}


@InProceedings{CheKor95,
author = {Z. Chen and I. Koren},
title = {Layer Assignment for Yield Enhancement
},
booktitle = {
Proceedings of the IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems (DFT '95)
},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {1995},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}

@InProceedings{CheKor96,
author = {Z. Chen and I. Koren},
title = { Layer Reassignment for Antenna Effect Minimization in 3-Layer Channel Routing 
},
booktitle = {
Proceedings of the IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems (DFT '96)
},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {1996},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}
  
@InProceedings{CheKor97,
author = {Z. Chen and I. Koren},
title = {Crosstalk Minimization in Three-Layer {HVH} Channel Routing
},
booktitle = {
Proceedings of the IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems (DFT '97)
},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {1997},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}


@ARTICLE{Che2001,
	AUTHOR = "Z.-Z. Chen",
	TITLE = "Approximation algorithms for independent sets in map graphs",
	JOURNAL = jalg,
	YEAR = 2001,
	month = "",
	volume = 41,
	number = "",
	pages = "20--40",
	copy = ""
}

@ARTICLE{CheGriPap02,
	AUTHOR = "Z.-Z. Chen and M. Grigni and C.~H. Papadimitriou",
	TITLE = "Map graphs",
	JOURNAL = jacm,
	YEAR = 2002,
	month = "",
	volume = 49,
	number = "2",
	pages = "127--138",
	copy = ""
}


@ARTICLE{CheIyeKas88,
	AUTHOR = "Y. Cheng and S. S. Iyengar and R. L. Kashyap",
	TITLE = "A new method of image compression using irreducible covers of maximal rectangles",
	JOURNAL = ieeetse,
	YEAR = 1988,
	month = "",
	volume = 14,
	number = "",
	pages = "651--658",
	copy = ""
}



@ARTICLE{CheJou92,
	AUTHOR = "K.-T. Cheng and J.-Y. Jou",
	TITLE = "A functional fault model for sequential machines",
	JOURNAL = ieeetocad,
	YEAR = 1992,
	month = "",
	volume = 11,
	number = "9",
	pages = "1065--1073",
	copy = ""
}



@INPROCEEDINGS{CheJorRav99,
	AUTHOR = "J. Cheriyan and T. Jord\'an and R. Ravi",
	TITLE = "On 2-coverings and 2-packings of laminar families",
	BOOKTITLE = "Proc. ESA'99",
	YEAR = 1999,
	month = "",
	volume = "1643",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "510--520",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@INCOLLECTION{CheCreSan99,
	AUTHOR = "A. Cherubini and S. Crespi-Reghizzi and P. San Pietro",
	TITLE = "Languages based on structural testability",
	BOOKTITLE = "Combinatorics, Computation \& Logic, Proc. of DMTCS'99 and CATS'99",
	PUBLISHER = "Springer",
	YEAR = 1999,
	month = "",
	volume = "",
	editor = "C. S. Calude and M. J. Dinneen",
	series = "",
	chapter = "",
	pages = "159--174",
	address = "",
	type = "",
	copy = ""
}


@ARTICLE{Cheetal91,
	AUTHOR = "A. Cherubini and C. Citrini and S. Crespi-Reghizzi and D. Madriolini",
	TITLE = "{QRT FIFO} automata, breadth first grammars and their relations",
	JOURNAL = tcs,
	YEAR = 1991,
	month = "",
	volume = 85,
	number = "",
	pages = "171--203",
	copy = ""
}


@ARTICLE{CheSan99,
	AUTHOR = "A. Cherubini and P. San Pietro",
	TITLE = "On the relation between multi-depth grammars and tree-adjoining grammars",
	JOURNAL = publmath,
	YEAR = 1999,
	month = "",
	volume = 54,
	number = "Supplement",
	pages = "625--640",
	copy = ""
}


@INPROCEEDINGS{CheLeu85,
	AUTHOR = "Y.S. Cheung and C. H. Leung",
	TITLE = "Chain-code transform for {C}hinese character recognition",
	BOOKTITLE = "Proc. IEEE Int. Conf. Cyb. Soc., Tucson, AZ",
	YEAR = 1985,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "42--45",
	address = "",
	organization = "",
	copy = ""
}

@inproceedings{Cheetal2007b,
  author    = {Y. Chevaleyre and
               U. Endriss and
               J. Lang and
               N. Maudet},
  title     = {A Short Introduction to Computational Social Choice},
  booktitle = {SOFSEM 2007: Theory and Practice of Computer Science},
  year      = {2007},
  pages     = {51--69}, 
editor    = {J. van Leeuwen and
               G. F. Italiano and
               W. van der Hoek and
               C. Meinel and
               H. Sack and
               F. Plasil},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4362},
  year      = {2007},
}

@inproceedings{CheKed92, 
 author = "L. P. Chew and K. Kedem", 
 title= "Improvements on geometric pattern matching problems",
 series = "Lecture Notes in Computer Science",  
 volume  =   "621", 
 pages  =  "318--325", 
 year   =  "1992", 
 booktitle =  {Algorithm Theory -- SWAT'92}
 }


@ARTICLE{Chietal85,
	AUTHOR = "N. Chiba and T. Nishizeki and S. Abe and T. Ozawa",
	TITLE = "A linear algorithm for embedding planar graphs using PQ-trees",
	JOURNAL = jcss,
	YEAR = 1985,
	month = "",
	volume = 30,
	number = "",
	pages = "54--76",
	copy = ""
}

@inproceedings{Chi2000,
  author    = {B. Chidlovskii},
  title     = {Using Regular Tree Automata as {XML} Schemas},
  booktitle = {IEEE Advances in Digital Libraries Conference ADL},
  year      = {2000},
  pages     = {89--104},

}

@inproceedings{ChiRagRij2000,
  author    = {B. Chidlovskii and
               J. Ragetli and
               M. de Rijke},
  title     = {Wrapper Generation via Grammar Induction},
  booktitle = {11th European Conference on
               Machine Learning ECML},
  year      = {2000},
  pages     = {96--108},
  editor    = {R. L{\'o}pez de M{\'a}ntaras and
               E. Plaza},
  publisher = {Springer},
  series    = {LNCS/LNAI},
  volume    = {1810},
}

@INPROCEEDINGS{Chi2001,
	AUTHOR = "B. Chidlovskii",
	TITLE = "Wrapping Web Information Providers by Transducer Induction",
	BOOKTITLE = "12th European Conference on Machine Learning ECML",
	YEAR = 2001,
	month = "",
	volume = "2167",
	editor = "L. De Raedt and P. A. Flach",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "61--72",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@inproceedings{Chi2001a,
  author    = {B. Chidlovskii},
  title     = {Schema Extraction from {XML}: A Grammatical Inference Approach},
  booktitle = {8th International Workshop on Knowledge
               Representation meets Databases KRDB},
  year      = {2001},
  url        = {http://CEUR-WS.org/Vol-45/04-chidlovskii.pdf},
  editor    = {M. Lenzerini and
               D. Nardi and
               W. Nutt and
               D. Suciu},
  publisher = {CEUR-WS.org},
  series    = {CEUR Workshop Proceedings},
  volume    = {45},
}
@inproceedings{Chi2003,
  author    = {B. Chidlovskii},
  title     = {Information Extraction from Tree Documents by Learning Subtree
               Delimiters},
  booktitle = {Proceedings of IJCAI-03 Workshop on Information Integration
               on the Web IIWeb},
  year      = {2003},
  pages     = {3--8},
  editor    = {S. Kambhampati and
               C. A. Knoblock},
}

@inproceedings{ChiFus2005,
  author    = {B. Chidlovskii and
               J. Fuselier},
  title     = {A Probabilistic Learning Method for {XML} Annotation of Documents},
  booktitle = {Proceedings of the Nineteenth International Joint
               Conference on Artificial Intelligence IJCAI},
  year      = {2005},
  pages     = {1016--1021},
  editor    = {L. Pack Kaelbling and
               A. Saffiotti},
  publisher = {Professional Book Center},
}

@INPROCEEDINGS{ChiGutMut2006,
	AUTHOR = "M. Chimani and C. Gutwenger and P. Mutzel",
	TITLE = "Experiments on exact crossing minimization using column generation",
	BOOKTITLE = "Workshop on Experimental Algorithms WEA",
	YEAR = 2006,
	month = "",
	volume = "4007",
	editor = "C. \`Alvarez and M. Serna",
	series = "LNCS",
	chapter = "",
	pages = "303--315",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@INPROCEEDINGS{ChlChl2003,
	AUTHOR = "M. Chleb\'\i{}k  and J. Chleb\'\i{}kov\'a",
	TITLE = "Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching",
	BOOKTITLE = "Proc. 14th Annual International Symposium on Algorithms and Computation",
	YEAR = 2003,
	month = "",
	volume = "2906",
	editor = "T. Ibaraki and
               N. Katoh and
               H. Ono",
	series = "LNCS",
	chapter = "",
	pages = "415--424",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}


@INPROCEEDINGS{ChlChl2004,
	AUTHOR = "M. Chleb\'\i{}k  and J. Chleb\'\i{}kov\'a",
	TITLE = "Improvement of {N}emhauser-{T}rotter Theorem and Its Applications in Parametrized Complexity",
	BOOKTITLE = "Algorithm Theory---SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory",
	YEAR = 2004,
	month = "",
	volume = "3111",
	editor = "T. Hagerup and J. Katajainen",
	series = "LNCS",
	chapter = "",
	pages = "174--186",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@TECHREPORT{ChlChl2004b,
	AUTHOR = "M. Chleb\'\i{}k  and J. Chleb\'\i{}kov\'a",
	TITLE = "Crown reductions for the Minimum Weighted Vertex Cover problem",
	INSTITUTION = "Electronic Colloquium on Computational Complexity ECCC Trier",
	YEAR = 2004,
	month = "",
	number = "TR04-101",
	address = "",
	copy = ""
}
@INPROCEEDINGS{ChlChl2004c,
	AUTHOR = "M. Chleb\'\i{}k  and J. Chleb\'\i{}kov\'a",
	TITLE = "On approximability of the independent set problem in low degree graphs",
	BOOKTITLE = "SIROCCO",
	YEAR = 2004,
	month = "",
	volume = "3104",
	editor = "R. Kralovi\'c and O. S\'ykora",
	series = "LNCS",
	chapter = "",
	pages = "47--56",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@inproceedings{ChlChl2004d,
  author    = "M. Chleb\'\i{}k  and J. Chleb\'\i{}kov\'a",
  title     = {On Approximation Hardness of the Minimum {2SAT-DELETION} Problem},
  booktitle = {Mathematical Foundations of Computer Science MFCS},
  year      = {2004},
  pages     = {263--273},
  editor    = {J. Fiala and
               V. Koubek and
               J. Kratochv\'{\i}l},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {3153},
}

@INPROCEEDINGS{ChlChl2005,
	AUTHOR = "M. Chleb\'\i{}k  and J. Chleb\'\i{}kov\'a",
	TITLE = "Approximation hardness of optimization problems in intersection graphs of $d$-dimensional boxes",
	BOOKTITLE = "Symposium on Discrete Algorithms SODA",
	YEAR = 2005,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "267--276",
	address = "",
	organization = "ACM / SIAM",
        publisher = "",
	copy = ""
}


@article{ChlChl2008,
  author    = {M. Chleb\'\i{}k  and J. Chleb\'\i{}kov\'a},
  title     = {Crown reductions for the Minimum Weighted Vertex Cover
problem},
  journal   = dam,
  volume    = {156},
  number    = {3},
  year      = {2008},
  pages     = {292--312},
}

@ARTICLE{ChlToa2002,
	AUTHOR = "Chlond, M. J.",
	TITLE = "{IP} Modeling of Chessboard Placements and Related Puzzles",
	JOURNAL = {INFORMS Transactions on Education},
	YEAR = 2002,
	month = "",
	volume = 2,
	number = "2",
	pages = "56--57",
url = {http://ite.informs.org/Vol2No2/ChlondToase/}, 
	copy = ""
}

@ARTICLE{ChoHuy88,
	AUTHOR = "S. Cho and T. Huynh",
	TITLE = "On a complexity hierarchie between {L} and {NL}",
	JOURNAL = ipl,
	YEAR = 1988,
	month = "",
	volume = 29,
	number = "",
	pages = "177--182",
	copy = ""
}


@INPROCEEDINGS{ChoCul84,
	AUTHOR = "C. Choffrut and {\v C}ulik, {II}, K",
	TITLE = "On extendibility of unavoidable sets",
	BOOKTITLE = "{LNCS} 166",
	YEAR = 1984,
	pages = "326--338",
	organization = "{STACS}",
	copy = ""
}


@INBOOK{ChoDow93,
	crossref = "Croetal93",
	AUTHOR = "P. Cholak and R. Downey",
	TITLE = "Undecidability and definability for parameterized
                  polynomial time $m$-reducibilities",
	PAGES = "194--221",
	CHAPTER = "",
	copy = ""
}


@INPROCEEDINGS{ChaCou2003,
	AUTHOR = "J.-M. Champarnaud and F. Coulon",
	TITLE = "{NFA} Reduction Algorithms by Means of Regular Inequalities",
	BOOKTITLE = "Developments in Language Theory 
7th International Conference, DLT 2003",
	YEAR = 2003,
	month = "",
	volume = "2710",
	editor = "Z. \'Esik and Z. {F\"ul\"op}",
	series = "LNCS",
	chapter = "",
	pages = "194--205",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@InProceedings{ChoGol92,
  title =        "Rational Transductions and Complexity of Counting
                 Problems",
  author =       "C. Choffrut and M. Goldwurm",
  editor =       "Ivan M. Havel and V{\'a}clav Koubek",
  booktitle =    "Mathematical Foundations of Computer Science 1992,
                 17th International Symposium",
  address =      "Prague, Czechoslovakia",
  month =        "24--28~" # aug,
  year =         "1992",
  series =       "lncs",
  volume =       "629",
  publisher =    "Springer",
  pages =        "181--190",
}


@INPROCEEDINGS{ChoKup02,
	AUTHOR = "H. Chockler and O. Kupferman",
	TITLE = "$\omega$-regular languages are testable with a constant number of queries",
	BOOKTITLE = "Randomization and Approximation Techniques; 
6th International Workshop, RANDOM 2002",
	YEAR = 2002,
	month = "",
	volume = "2483",
	editor = "J.~D.~P. Rolim and S. Vadhan",
	series = "LNCS",
	chapter = "",
	pages = "26--38",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@ARTICLE{ChoPig02,
	AUTHOR = "C. Choffrut and G. Pighizzini",
	TITLE = "Distances between languages and reflexivity of relations",
	JOURNAL = tcs,
	YEAR = 2002,
	month = "",
	volume = 286,
	number = "",
	pages = "117--138",
	copy = ""
}



@ARTICLE{ChoNakRim89,
	AUTHOR = "H.-A. Choi and K. Nakajima and C. S. Rim",
	TITLE = "Graph bipartization and via minimization",
	JOURNAL = siamdm,
	YEAR = 1989,
	month = "",
	volume = 2,
	number = "1",
	pages = "38--47",
	copy = ""
}


@ARTICLE{Cho92,
	AUTHOR = "Y.-H. Choi",
	TITLE = "An easily-diagnosable fault-tolerant binary tree architecture",
	JOURNAL = pc,
	YEAR = 1992,
	month = "",
	volume = 18,
	number = "",
	pages = "1185--1195",
	copy = ""
}

@ARTICLE{Cho59,
	   AUTHOR = "N. Chomsky",
	   TITLE = "On certain formal properties of grammars",
	   JOURNAL = icalt,
	   YEAR = 1959,
	   VOLUME = 2,
	   NUMBER = "",
	   PAGES = "137--167",
	   copy = ""
 }


@INBOOK{ChoSch70,
	AUTHOR = "N. Chomsky and M. P. Sch{\"u}tzenberger",
	TITLE = "The algebraic theory of context-free languages",
	PAGES = "118--161",
	CHAPTER = "",
        booktitle = "Computer Programming and Formal Systems",
	PUBLISHER = "Amsterdam: North-Holland",
	YEAR = 1970,
	month = "",
	address = "",
	volume = "",
	series = "Studies in Logic and the Foundations of Mathematics",
	type = "",
	copy = ""
}



@ARTICLE{Cho74,
	AUTHOR = "Y. Choueka",
	TITLE = "Theories of automata on {$\omega$}-tapes: {A}
simplified approach",
	JOURNAL = jcss,
	YEAR = 1974,
	month = "",
	volume = 8,
	number = "",
	pages = "117--141",
	copy = ""
}

@ARTICLE{ChoSud98,
	AUTHOR = "B. Chor and M. Sudan",
	TITLE = "A geometric approach to betweenness",
	JOURNAL = siamdm,
	YEAR = 1998,
	month = "",
	volume = 11,
	number = "",
	pages = "511--523",
	copy = ""
}



@Article{ChoSin93,
author          ="M. Choy and A. K. Singh",
title           ="Distributed job scheduling using snapshots",
booktitle ="WDAG: International Workshop on Distributed Algorithms,
           Springer-Verlag",
journal         ="Lecture Notes in Computer Science",
volume          ="725",
pages           ="145--159",
year            ="1993",
}


@INBOOK{Chr74,
	   AUTHOR = "P. A. Christensen",
        booktitle = {L Systems}, editor = {G. Rozenberg and A. Salomaa},
	   TITLE = "Hyper-AFL's and {ET0L}-systems",
	   PAGES = "254--257",
	   PUBLISHER = "Berlin: Springer",
	   YEAR = 1974,
	   VOLUME = 15,
	   SERIES = "LNCS",
	   copy = ""
 }

@Article{Chretal2007,
author = {R. Christian and M. R. Fellows and F. Rosamond and A. Slinko},
title = {On Complexity of Lobbying in Multiple Referenda},
journal = {Review of Economic Design},
year = {2007},
OPTkey = {},
volume = {11},
OPTnumber = {},
pages = {217--224},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}


@ARTICLE{Chu84,
	AUTHOR = "F. R. K. Chung",
	TITLE = "On optimal linear arrangements of trees",
	JOURNAL = {Comp Maths Appl (Comp. \& Maths with Appls.)},
	YEAR = 1984,
	month = "",
	volume = 10,
	number = "",
	pages = "43--60",
	copy = ""
}

@ARTICLE{ChuKimKim03,
	AUTHOR = "Y. D. Chung and J. W. Kim and M. H. Kim",
	TITLE = "Efficient preprocessing of {XML} queries using structured signatures",
	JOURNAL = ipl,
	YEAR = 2003,
	month = "",
	volume = 87,
	number = "",
	pages = "257--264",
	copy = ""
}


@Article{Chytil85,
  author =       "M. P. Chytil and M. Pl\'atek and J. Vogel",
  title =        "A note on the {C}homsky hierarchy",
  journal =      eatcs,
  volume =       "27",
  pages =        "23--30",
  month =        oct,
  year =         "1985",
  note =         "Technical Contributions",
}

@ARTICLE{Chv84,
	AUTHOR = "V. Chv\'atal",
	TITLE = "Recognizing decomposable graphs",
	JOURNAL = jgth,
	YEAR = 1984,
	month = "",
	volume = 8,
	number = "",
	pages = "51--53",
	copy = ""
}



@INPROCEEDINGS{CioPau75,
	AUTHOR = "S. Ciobotaru and Gh. P{\u a}aun",
	TITLE = "On the generative capacity of strict global grammars",
	BOOKTITLE = "Automata Theory and Formal Languages: 2nd {GI}
                 Conference",
	YEAR = 1975,
	month = "",
	volume = "33",
	editor = "H. Brakhage",
	series = "LNCS",
	chapter = "",
	pages = "198--201",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{ClaColJoh90,
	AUTHOR = "B. N. Clark and C. J. Colbourn and D. S. Johnson",
	TITLE = "Unit disk graphs",
	JOURNAL = dm,
	YEAR = 1990,
	month = "",
	volume = 86,
	number = "",
	pages = "165--177",
	copy = ""
}


@ARTICLE{Cla90,
	AUTHOR = "R. J. Clarke",
	TITLE = "Covering a set by subsets",
	JOURNAL = dm,
	YEAR = 1990,
	month = "",
	volume = 81,
	number = "",
	pages = "147--152",
	copy = ""
}


@ARTICLE{Cla83,
	AUTHOR = "K. L. Clarkson",
	TITLE = "A modification of the greedy algorithm for vertex cover",
	JOURNAL = ipl,
	YEAR = 1983,
	month = "",
	volume = 16,
	number = "",
	pages = "23--25",
	copy = ""
}


@INPROCEEDINGS{Cla2004,
	AUTHOR = "A. Clark",
	TITLE = "Grammatical Inference and the Argument from the Poverty of the Stimulus",
	BOOKTITLE = "AAAI Spring Symposium on Interdisciplinary Approaches to Language Learning",
	YEAR = 2004,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "Stanford CA",
	organization = "",
        publisher = "",
	copy = ""
}
@inproceedings{ClaFloWat2006,
  author    = {A. Clark and
               C. C. Flor{\^e}ncio and
               C. Watkins},
  title     = {Languages as Hyperplanes: Grammatical Inference with String
               Kernels},
  booktitle = {17th European Conference on
               Machine Learning ECML},
  year      = {2006},
  pages     = {90--101},
  editor    = {J. F{\"u}rnkranz and
               T. Scheffer and
               M. Spiliopoulou},
  publisher = {Springer},
  series    = {LNCS/LNAI},
  volume    = {4212},
}



@ARTICLE{CleWit84,
	AUTHOR = "Cleary, J. G. and Witten, I. H.",
	TITLE = "Data compression using adaptive
coding and partial string matching",
	JOURNAL = {IEEE Trans. Communications},
	YEAR = 1984,
	month = "",
	volume = {32},
	number = "4",
	pages = "396--402",
	copy = ""
}

@ARTICLE{Coc90,
	AUTHOR = "E. J. Cockayne",
	TITLE = "Chessboard domination problems",
	JOURNAL = dm,
	YEAR = 1990,
	month = "",
	volume = 86,
	number = "",
	pages = "13--20",
	copy = ""
}

@ARTICLE{CocHed86,
	AUTHOR = "E. J. Cockayne and S. T. Hedetniemi",
	TITLE = "On the diagonal queens domination problem",
	JOURNAL = jctha,
	YEAR = 1986,
	month = "",
	volume = 42,
	number = "",
	pages = "137--139",
	copy = ""
}


@ARTICLE{Cocetal2004,
	AUTHOR = "E. J. Cockayne and  {Dreyer Jr.}, {P. A.} and S. M. Hedetniemi and S. T. Hedetniemi",
	TITLE = "Roman domination in graphs",
	JOURNAL = dm,
	YEAR = 2004,
	month = "",
	volume = 278,
	number = "",
	pages = "11--22",
	copy = ""
}
@ARTICLE{Cocetal2005,
	AUTHOR = "E. J. Cockayne and P. J. P. Grobler and W. R.  Gr{\"u}ndlingh and J. Munganga and J. H. van Vuuren",
	TITLE = "Protection of a graph",
	JOURNAL = {Utilitas Mathematica},
	YEAR = 2005,
	month = "",
	volume = 67,
	number = "",
	pages = "19--32",
	copy = ""
}

@ARTICLE{CocSpe88,
	AUTHOR = "E. J. Cockayne and P. H. Spencer",
	TITLE = "On the independent queens covering problem",
	JOURNAL = {Graphs and Combinatorics},
	YEAR = 1988,
	month = "",
	volume = 4,
	number = "",
	pages = "101--110",
	copy = ""
}


@ARTICLE{Coh70,
	   AUTHOR = "R. S. Cohen",
	   TITLE = "Star height of certain families of regular events",
	   JOURNAL = jcss,
	   YEAR = 1970,
	   VOLUME = 4,
	   NUMBER = "",
	   PAGES = "281--297",
	   copy = ""
 }


@ARTICLE{CohBrz70,
	   AUTHOR = "R. S. Cohen and J. A. Brzozowski",
	   TITLE = "General properties of star height of regular events",
	   JOURNAL = jcss,
	   YEAR = 1970,
	   VOLUME = 4,
	   NUMBER = "",
	   PAGES = "260--280",
	   copy = ""
 }


@ARTICLE{CohGol77,
	AUTHOR = "R. S. Cohen and A. Y. Gold",
	TITLE = "Theory of {$\omega$}-languages: {I}: {C}haracterization
of {$\omega$}-context-free languages; {II}: {A} study of various models
of {$\omega$}-type generation and recognition",
	JOURNAL = jcss,
	YEAR = 1977,
	volume = 15,
	number = "",
	pages = "169--184; 185--208",
	copy = ""
}


@ARTICLE{CohGol78,
	AUTHOR = "R. S. Cohen and A. Y. Gold",
	TITLE = "{$\omega$}-computations on deterministic pushdown machines",
	JOURNAL = jcss,
	YEAR = 1978,
	month = "",
	volume = 16,
	number = "",
	pages = "275--300",
	copy = ""
}


@ARTICLE{CohGol78a,
	AUTHOR = "R. S. Cohen and A. Y. Gold",
	TITLE = "{$\omega$}-computations on {T}uring machines",
	JOURNAL = tcs,
	YEAR = 1978,
	month = "",
	volume = 6,
	number = "",
	pages = "1--23",
	copy = ""
}


@ARTICLE{CohGol80,
	AUTHOR = "R. S. Cohen and A. Y. Gold",
	TITLE = "On the complexity of {$\omega$}-type {T}uring acceptors",
	JOURNAL = tcs,
	YEAR = 1980,
	month = "",
	volume = 10,
	number = "",
	pages = "249--272",
	copy = ""
}
@INPROCEEDINGS{Coh96,
	AUTHOR = "W. H. Cohen",
	TITLE = "Learning trees and rules with set-valued features",
	BOOKTITLE = "AAAI Proceedings",
	YEAR = 1996,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "--",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}


@INPROCEEDINGS{CohJeaGys2005,
	AUTHOR = "D. Cohen and P. Jeavons and M. Gyssens",
	TITLE = "A Unified Theory of Structural Tractability in Constraint Satisfaction and Spread Cut Decompositions",
	BOOKTITLE = "IJCAI",
	YEAR = 2005,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "??--??",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}


@INBOOK{Com83,
	AUTHOR = "K. J. Compton",
	TITLE = "On rich words",
	PAGES = "39--62",
	CHAPTER = "Thue systems and {T}hue sequences",
	crossref = "Cum83",
	copy = ""
}


@ARTICLE{Com64,
	AUTHOR = "L. Comtet",
	TITLE = "Calcul pratique des coefficients de {T}aylor d'une
		  fonction alg\'ebrique",
	JOURNAL = {Enseignement Math.},
	YEAR = 1964,
	month = "",
	volume = 10,
	number = "",
	pages = "267--270",
	copy = ""
}. 

@InProceedings{ConDavKal2006,
author = {V. Conitzer and A. Davenport and J. Kalagnanam},
title = {Improved bounds for computing
{K}emeny rankings},
booktitle = {Proc. 21st AAAI},
OPTcrossref = {},
OPTkey = {},
pages = {620–626},
year = {2006},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}

@ARTICLE{Con75,
	 AUTHOR = "W. M. Conner",
	 TITLE = "The dimension of a formal language",
	 JOURNAL = icalt,
	 YEAR = 1975,
	 VOLUME = 29,
	 NUMBER = "",
	 PAGES = "1--10",
	 copy = ""
 }


@ARTICLE{ConWit94,
	AUTHOR = "Conklin, D. and Witten, I.~H.",
	TITLE = "Complexity-based induction",
	JOURNAL = {Machine Learning},
	YEAR = 1994,
	month = "",
	volume = 16,
	number = "",
	pages = "203--225",
	copy = ""
}

@ARTICLE{ConLab89,
	AUTHOR = "I. Constantineau and J. Labelle",
	TITLE = "Calcul combinatoire du nombre d'endofonctions et
d'arborescences laiss\'ees fixe par une permutation",
	JOURNAL = annsmq,
	YEAR = 1989,
	month = "",
	volume = 13,
	number = "2",
	pages = "33--38",
	copy = ""
}


@ARTICLE{ConLab91,
	AUTHOR = "I. Constantineau and J. Labelle",
	TITLE = "On combinatorial structures kept fixed by the action
of a given permutation",
	JOURNAL = studam,
	YEAR = 1991,
	month = "",
	volume = 84,
	number = "",
	pages = "105--118",
	copy = ""
}



@InProceedings{CooRos76,
author    ="C. M. Cook and A. Rosenfeld",
title     ="Some experiments in grammatical inference",
booktitle ="Proceedings of the NATO Advanced Study Institute of Computer
           Oriented Learning Processes",
year      ="1976",
editor    ="J. C. Simon",
publisher ="Noordhoff",
address   ="Leyden, The Netherlands",
}

@ARTICLE{CooRosAro76,
	AUTHOR = "C. M. Cook and A. Rosenfeld and A. R. Aronson",
	TITLE = "Grammatical inference by hill climbing",
	JOURNAL = infsci,
	YEAR = 1976,
	month = "",
	volume = 10,
	number = "",
	pages = "59--80",
	copy = ""
}


@ARTICLE{CooWan78,
	AUTHOR = "C. R. Cook and P. S.-P. Wang",
	TITLE = "A {C}homsky hierarchy of
isotonic array grammars and languages",
	JOURNAL = cgip,
	YEAR = 1978,
	month = "",
	volume = 8,
	number = "",
	pages = "144--152",
	copy = ""
}


@ARTICLE(Coo81,
    AUTHOR = "S. A. Cook",
    TITLE = "Towards a Complexity Theory of Synchronous
	Parallel Computation",
    JOURNAL = "Enseign. Math.",
    YEAR = 1981,
    VOLUME = 27,
    PAGES = "99--124")



@ARTICLE{CopWin90,
	AUTHOR = "D. Coppersmith and S. Winograd",
	TITLE = "Matrix multiplication via arithmetical progressions",
	JOURNAL = {J. Symbolic Computation},
	YEAR = 1990,
	month = "",
	volume = 9,
	number = "",
	pages = "251--280",
	copy = ""
}


@ARTICLE{CorKei87,
	AUTHOR = "D.~G. Corneill and J.~M. Keil",
	TITLE = "A dynamic programming approach to the dominating set problem on $k$-trees",
	JOURNAL = {SIAM J. Algebraic Discrete Methods},
	YEAR = 1987,
	month = "",
	volume = 8,
	number = "",
	pages = "535--543",
	copy = ""
}


@ARTICLE{CorSchWag2004,
	AUTHOR = "S. Cornelsen and T. Schank and D. Wagner",
	TITLE = "Drawing Graphs on Two and Three Lines",
	JOURNAL = jgaa,
	YEAR = 2004,
	month = "",
	volume = 8,
	number = "",
	pages = "161--177",
	copy = ""
}

@INPROCEEDINGS{CosNic97,
	AUTHOR = "F. Coste and J. Nicolas",
	TITLE = "Regular inference as a graph coloring problem",
	BOOKTITLE = "Workshop on Grammatical Inference, Automata Induction, and Language Acquisition (ICML'97), Nashville, TN",
	YEAR = 1997,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "", note = {available through: {\tt http://www.univ-st-etienne.fr/eurise/pdupont/mlworkshop.html#proc}},
	copy = ""
}


@InProceedings{Cos01,
	AUTHOR	= {Costa Flor\^encio, C.},
	TITLE		= {Combinatory Categorial Grammars and Finite Elasticity},
	BOOKTITLE	= {Proceedings of the Eleventh {B}elgian-{D}utch Conference on {M}achine
		{L}earning},
	EDITOR	= {V. Hoste and G. de Pauw},
	YEAR		= 2001,
	PUBLISHER	= {University of Antwerp},
	PAGES 	= {13--18}
}


@INPROCEEDINGS{CosNic98,
	AUTHOR = "F. Coste and J. Nicolas",
	TITLE = "Inference of finite automata: reducing the search space with an ordering of pairs of states",
	BOOKTITLE = "Proc. of the Tenth European Conference on Machine
Learning ECML-98",
	YEAR = 1998,
	month = "",
	volume = "1398",
	editor = "C. N\'edellec and C. Rouveirol",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "37--42",
	address = "",
	organization = "",
	copy = "", publisher = {Springer},
}


@TECHREPORT{Cos99,
	AUTHOR = "F. Coste",
	TITLE = "State merging inference of finite state classifiers",
	INSTITUTION = "INRIA, IRISA",
	YEAR = 1999,
	month = may,
	number = "Publication interne n$^{o}$ 1250",
	address = "", note = {Submitted to {\em Machine Learning}},
	copy = ""
}


@ARTICLE{CotMos03,
	AUTHOR = "C. Cotta and P. Moscato",
	TITLE = "On the  parameterized complextiy of problems related with feature identification for gene expression data mining techniques",
	JOURNAL = {Bioinformatics},
	YEAR = 2002,
	month = "",
	volume = 1,
	number = "",
	pages = "1--8",
	copy = ""
}

@ARTICLE{CotMos03,
	AUTHOR = "C. Cotta and P. Moscato",
	TITLE = "The {$k$}-feature set problem is {W[2]}-complete",
	JOURNAL = jcss,
	YEAR = 2003,
	month = "",
	volume = 67,
	number = "",
	pages = "686--690",
	copy = ""
}


@ARTICLE{CotMos04,
	AUTHOR = "C. Cotta and P. Moscato",
	TITLE = "The parameterized complexity of metaheuristic approaches for genomic data mining",
	JOURNAL = {Journal of Mathematical Modelling and Algorithms},
	YEAR = 2004,
	month = "",
	volume = {to appear},
	number = "",
	pages = "--",
	copy = ""
}

@INPROCEEDINGS{CotSloMos2004,
	AUTHOR = "C. Cotta and C. Sloper and P. Moscato",
	TITLE = "Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data",
	BOOKTITLE = "Applications of Evolutionary Computing: EvoWorkshops 2004",
	YEAR = 2004,
	month = "",
	volume = "3005",
	editor = "G R. Raidl and others",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "21--30",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INCOLLECTION{CheCreSan99,
	AUTHOR = "C. Cotta and M. Langston and P. Moscato",
	TITLE = "Combinatorial and Algorithmc Issues for Microarray Analysis",
	BOOKTITLE = "Handbook of Approximation Algorithms and Metaheuristics",
	PUBLISHER = "Chapman \& Hall/CRC Press",
	YEAR = 2006,
	month = "",
	volume = "",
	editor = "T. Gonz\'alez",
	series = "",
	chapter = "51",
	pages = "",
	address = "",
	type = "",
	copy = ""
}


@Article{CouMakRot01,
  author =       "B. Courcelle and J.~A. Makowsky and U. Rotics",
  title =        "On the fixed parameter complexity of graph enumeration
                 problems definable in monadic second-order logic",
  journal =      dam, pages={23--52}, 
  volume =       "108",
  year =         "2001",
}


@ARTICLE{CouOla2000,
	AUTHOR = "B. Courcelle and S. Olariu",
	TITLE = "Upper bounds to the clique-width of graphs",
	JOURNAL = dam,
	YEAR = 2000,
	month = "",
	volume = 101,
	number = "",
	pages = "77--104",
	copy = ""
}


@TECHREPORT{Cra95,
	AUTHOR = "I. D. Craig",
	TITLE = "A perspective on multi-agent systems",
	INSTITUTION = "University of Warwick",
	YEAR = 1995,
	month = "",
	number = "CS-RR-273",
	address = "",
	copy = ""
}


@ARTICLE{CreHer96,
	AUTHOR = "N. Creignou and M. Hermann",
	TITLE = "Complexity of generalized satisfiability counting problems",
	JOURNAL = icneu,
	YEAR = 1996,
	month = "",
	volume = 125,
	number = "",
	pages = "1--12",
	copy = ""
}


@ARTICLE{Cre73,
	AUTHOR = "A. B. Cremers",
	TITLE = "Normal forms for context-sensitive grammars",
	JOURNAL = actainform,
	YEAR = 1973,
	month = "",
	volume = 3,
	number = "",
	pages = "59--73",
	copy = ""
}


@ARTICLE{CreMauMay73,
	AUTHOR = "A. Cremers and H. A. Maurer and O. Mayer",
	TITLE = "A note on leftmost restricted random context grammars",
	JOURNAL = ipl,
	YEAR = 1973,
	month = "",
	volume = 2,
	number = "",
	pages = "31--33",
	copy = ""
}


@ARTICLE{CreMay73,
	AUTHOR = "A. Cremers and O. Mayer",
	TITLE = "On matrix languages",
	JOURNAL = icalt,
	YEAR = 1973,
	month = "",
	volume = 23,
	number = "",
	pages = "86--96",
	copy = ""
}


@ARTICLE{CreMay74,
	AUTHOR = "A. Cremers and O. Mayer",
	TITLE = "On vector languages",
	JOURNAL = jcss,
	YEAR = 1974,
	month = "",
	volume = 8,
	number = "",
	pages = "158--166",
	copy = ""
}


@ARTICLE{CreMayWei74,
 	AUTHOR = "A. Cremers and O. Mayer and K. Weiss",
	TITLE = "On the complexity of regulated context-free rewriting",
	JOURNAL = icalt,
	YEAR = 1974,
	month = "",
	volume = 25,
	number = "",
	pages = "10--19",
	copy = ""
}


@ARTICLE{CreGin75,
	AUTHOR = "A. Cremers and S. Ginsburg",
	TITLE = "Context-free grammar forms",
	JOURNAL = jcss,
	YEAR = 1975,
	month = "",
	volume = 11,
	number = "",
	pages = "86--117",
	copy = ""
}



@ARTICLE{CreGinSpa77,
	AUTHOR = "A. Cremers and S. Ginsburg and E. H. Spanier",
	TITLE = "The structure of context-free grammatical families",
	JOURNAL = jcss,
	YEAR = 1977,
	month = "",
	volume = 15,
	number = "",
	pages = "262--279",
	copy = ""
}


@ARTICLE{CreGuiMan75,
	AUTHOR = "S. Crespi-Reghizzi and G. Guida and D. Mandrioli",
	TITLE = "Non-counting context-free languages",
	JOURNAL = jacm,
	YEAR = 1975,
	month = "",
	volume = 25,
	number = "",
	pages = "571--580",
	copy = ""
}



@ARTICLE{CreMelLic72,
	AUTHOR = "S. Crespi-Reghizzi and M. A. Melkanoff and L. Lichten",
	TITLE = "The use of grammatical inference for designing programming languages",
	JOURNAL = cacm,
	YEAR = 1972,
	month = "",
	volume = 16,
	number = "",
	pages = "83--90",
	copy = ""
}


@INPROCEEDINGS{Cre72,
	crossref = "Niv73",
	AUTHOR = "J. P. Crestin",
	TITLE = "Un langage non ambigu dont le carr\'e est d'ambiguit\'e
non born\'ee",
	chapter = "",
	pages = "377--390",
	copy = ""
}


@INCOLLECTION{CreIva89,
	crossref = "Canetal89",
	AUTHOR = "R. Creutzburg and E. Ivanov",
	TITLE = "Fast algorithm for computing fractal dimensions of
image segments",
	PAGES = "42--51",
	copy = ""
}



@ARTICLE{Creetal92,
	AUTHOR = "R. Creutzburg and others",
	TITLE = "Fast algorithm for computing the fractal dimension of
binary images",
	JOURNAL = physa,
	YEAR = 1992,
	month = "",
	volume = 185,
	number = "",
	pages = "56--60",
	copy = ""
}

@article{CreMec2004,
  author    = {V. Crescenzi and
               G. Mecca},
  title     = {Automatic information extraction from large websites},
  journal   = jacm,
  volume    = {51},
  number    = {5},
  year      = {2004},
  pages     = {731--779},
}

@inproceedings{Creetal2004,
  author    = {V. Crescenzi and
               G. Mecca and
               P. Merialdo and
               P. Missier},
  title     = {An Automatic Data Grabber for Large Web Sites},
  booktitle = {International Conference on Very Large Data Bases VLDB},
  year      = {2004},
  pages     = {1321--1324},
  note        = {\url{http://www.vldb.org/conf/2004/DEMP18.PDF}},
 editor    = {M. A. Nascimento and
               M. Tamer {\"O}zsu and
               D. Kossmann and
               R. J. Miller and
               J. A. Blakeley and
               K. B. Schiefer},
  publisher = {Morgan Kaufmann},
}

@inproceedings{CreMer2006,
  author    = {V. Crescenzi and
               P. Merialdo},
  title     = {Efficient Techniques for Effective Wrapper Induction},
  year      = {2006},
  pages     = {47},
  note        = {\url{http://doi.ieeecomputersociety.org/10.1109/ICDEW.2006.53}},
  editor    = {R. S. Barga and
               X. Zhou},
  booktitle     = {International Conference on Data
               Engineering, Workshops, ICDE},
  publisher = {IEEE Computer Society},
}



@INPROCEEDINGS{Croetal98,
	AUTHOR = "M. Crochemore and F. Mignosi and A. Restivo",
	TITLE = "Minimal Forbidden Words and Factor Automata",
	BOOKTITLE = "MFCS'98",
	YEAR = 1998,
	month = "",
	volume = "1450",
	editor = "L. Brim et al.",
	series = "",
	chapter = "",
	pages = "665--673",
	address = "",
	organization = "",
	copy = ""
}


@TECHREPORT{Croetal98a,
	AUTHOR = "M. Crochemore and F. Mignosi and A. Restivo",
	TITLE = "Automata and Forbidden Words",
	INSTITUTION = "Universit\'e de Marne-la-Vall\'ee, Institut Gaspard-Monge",
	YEAR = 1998,
	month = "",
	number = "IGM-98-5",
	address = "",
	copy = "",
note = {enhanced version of \cite{Croetal98}, submitted to } #ipl
}


@TECHREPORT{Croetal98b,
	AUTHOR = "M. Crochemore and F. Mignosi and A. Restivo and S. Salemi",
	TITLE = "Data Compression using Antidictionaries",
	INSTITUTION = "Universit\'e de Marne-la-Vall\'ee, Institut Gaspard-Monge",
	YEAR = 1998,
	month = "",
	number = "IGM-98-10",
	address = "",
	copy = ""
}


@INPROCEEDINGS{Croetal99,
	AUTHOR = "M. Crochemore and others",
	TITLE = "Text compression using antidictionaries",
	BOOKTITLE = "Automata, Languages and Programming 26th ICALP'99",
	YEAR = 1999,
	month = "",
	volume = "1644",
	editor = "J. Wiedermann and P. van Emde Boas and M. Nielsen",
	series = "LNCS",
	chapter = "",
	pages = "261--270",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{Cru84,
	AUTHOR = "J. P. Crutchfield",
	TITLE = "Space-time dynamics in video feedback",
	JOURNAL = physd,
	YEAR = 1984,
	month = "",
	volume = 10,
	number = "",
	pages = "229--245",
	copy = ""
}


@INPROCEEDINGS{CruVid97,
	AUTHOR = "P. P. Cruz-Alc\'azar and E. Vidal-Ruiz",
	TITLE = "A study of grammatical inference algorithms in automatic music composition and music style recognition",
	BOOKTITLE = "Workshop on Grammatical Inference, Automata Induction, and Language Acquisition (ICML'97), Nashville, TN",
	YEAR = 1997,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "", note = {available through: {\tt http://www.univ-st-etienne.fr/eurise/pdupont/mlworkshop.html#proc}},
	copy = ""
}


@ARTICLE{CsuDas90,
   AUTHOR = 	"E. Csuhaj-Varj\'u and J. Dassow",
   TITLE = 	"On cooperating/distributed grammar systems",
   JOURNAL = 	eikneu,
   YEAR = 	"1990",
   VOLUME = 	"26",
   NUMBER = 	"1/2",
   PAGES = 	"49--63",
   MONTH = 	"",
   note = 	""
 }


@ARTICLE{Csu93,
	AUTHOR = "E. Csuhaj-Varj\'u",
	TITLE = "On grammars with local and global context conditions",
	JOURNAL = ijcm,
	YEAR = 1993,
	month = "",
	volume = 47,
	number = "",
	pages = "17--27",
	copy = ""
}


@INPROCEEDINGS{Csu94,
	crossref = "Pau94a",
	AUTHOR = "E. Csuhaj-Varj\'u",
	TITLE = "Grammar systems: a multi-agent framework for natural
		  language generation",
	chapter = "",
	pages = "63--78",
	copy = ""
}


@ARTICLE{Csuetal94a,
	AUTHOR = "E.  Csuhaj-Varj\'u and others",
	TITLE = "Stratified grammar systems",
	JOURNAL = caai,
	YEAR = {1994},
	month = "",
	volume = {13},
	number = "5",
	pages = "409--422",
	copy = ""
}


@Article{CsuMed94, 
 author = "E. Csuhaj-Varj\'u and A. Meduna", 
 title = "Grammars with Context Conditions (Some Results and Open Problems)", 
 journal = eatcs,
 volume = "53", 
 year = "1994", 
 pages = "199--212"
} 


@ARTICLE{CsuDasPau95,
	AUTHOR = "E. Csuhaj-Varj\'u and J. Dassow and Gh. P{\u a}un",
	TITLE = "Dynamically controlled cooperating/distributed
		  grammar systems",
	JOURNAL = infsci,
	YEAR = 1995,
	month = "",
	volume = 69,
	number = "",
	pages = "1--25",
	copy = ""
}


@ARTICLE{CsuPauSal95,
	AUTHOR = "E. Csuhaj-Varj\'u and Gh. P{\u a}un and A. Salomaa",
	TITLE = "Conditional tabled eco-grammar-systems versus
		  {(E)T0L} systems",
	JOURNAL = jucs,
	YEAR = 1995,
	month = "",
	volume = 1,
	number = "5",
	pages = "248--264",
	copy = ""
}



@InProceedings{Csuetal96,
author    ="E. Csuhaj-Varj{\'{u}} and R. Freund and L. Kari and
           Gh. P{\u{a}}un",
title     ="{DNA} computation based on splicing: universality results",
booktitle ="Biocomputing: Proceedings of the 1996 Pacific Symposium",
editor    ="Lawrence Hunter and Teri Klein",
month     =jan,
publisher ="World Scientific Publishing Co., Singapore",
year      ="1996",
note      ="See: \url{http://www.cgl.ucsf.edu/psb/psb96/proceedings/cshhaj-varju.ps}.
Also: Technical report 185-2/FR-2/95, TU Wien, Institute for Computer
           Languages, Wien, Austria, 1995,
           \url{http://www.csd.uwo.ca/\~{}lila/four.ps}",
url       ="\url{http://www.cgl.ucsf.edu/psb/psb96/proceedings/cshhaj-varju.ps}",
abstract  ="{\textbf{Abstract} The paper extends some of the most recently
           obtained results on the computational universality of extended
           H~systems (with regular sets of rules respectively with finite sets of
           rules used with simple additional mechanisms) and shows the
           possibility to obtain universal systems based on these extended
           H~systems, i.e.\ the theoretical possibility to design programmable
           universal DNA computers based on the splicing operation. The
           additional mechanisms considered here are: multisets (counting the
           numbers of copies of each available string), checking the
           presence/absence of certain symbols in the spliced strings, and
           organizing the work of the system in a distributed way (like in a
           parallel communicating grammar system). In the case of multisets we
           also consider the way of simulating a Turing machine (computing a
           partial recursive function) by an equivalent H~system (computing the
           same function), in the other cases we consider the interpretation of
           algorithms as language generating devices, hence the aim is to reach
           the power of Chomsky type-0 grammars, the standard model for
           representing algorithms equivalent with Turing machines taken as
           language generators. }",
keywords  ="DNA splicing, grammar systems, H~systems, Turing machine, universal
           computing.",

}



@Article{Csuetal96a,
author   ="E. Csuhaj-Varj{\'{u}} and L. Kari and Gh.
          P{\u{a}}un",
title    ="Test Tube Distributed Systems Based on Splicing",
journal  =caai,
year     ="1996",
volume   ="15",
number   ="2--3",
pages    ="211--232",
url      ="\url{http://www.csd.uwo.ca/~lila/dnapcgs.ps}",
abstract ="{\textbf{Abstract} We define a symbol processing mechanism with the
          components (test tubes) working as splicing schemes in the sense of
          T.~Head and communicating by redistributing the contents of tubes (in
          a similar way to the \emph{separate} operation of Lipton-Adleman).
          (These systems are similar to the distributed generative mechanisms
          called Parallel Communicating Grammar Systems.) Systems with finite
          initial contents of tubes and finite sets of splicing rules
          associated to each component are computationally complete, they
          characterize the family of recursively enumerable languages. The
          existence of universal test tube distributed systems is obtained on
          this basis, hence the theoretical proof of the possibility to design
          universal programmable computers with the structure of such a system.
          }",
keywords ="DNA computing, Parallel communicating grammar systems, Turing
          machines, universality.",

}


@ARTICLE{CsuVas99,
	AUTHOR = "E. Csuhaj-Varj\'u and Gy. Vaszil",
	TITLE = "On the computational completeness of context-free parallel communicating grammar systems",
	JOURNAL = tcs,
	YEAR = 1999,
	month = "",
	volume = 215,
	number = "",
	pages = "349--358",
	copy = ""
}

 
@ARTICLE{CudSin68,
	   AUTHOR = "D. F. Cudia and W. E. Singletary",
	   TITLE = "Degrees of unsolvability in formal grammars",
	   JOURNAL = jacm,
	   YEAR = 1968,
	   VOLUME = 15,
	   NUMBER = 4,
	   PAGES = "680--692",
	   copy = ""
 }



@ARTICLE{CulRec94,
	AUTHOR = "J. C. Culberson and R. A. Reckhow",
	TITLE = "Covering polygons is hard",
	JOURNAL = jalg,
	YEAR = 1994,
	month = "",
	volume = 17,
	number = "",
	pages = "2--44",
	copy = ""
}


@ARTICLE{Cul68,
	AUTHOR = "{\v{C}}ulik, II, K.",
	TITLE = "Contribution to deterministic top-down analysis of
		  context-free languages",
	JOURNAL = kyb,
	YEAR = 1968,
	month = "",
	volume = 4,
	number = "5",
	pages = "422--431",
	copy = ""
}


@ARTICLE{Cul74,
	AUTHOR = "{{\v C}}ulik, II, K.",
	TITLE = "On some families of languages related to
developmental systems",
	JOURNAL = ijcm,
	YEAR = 1974,
	month = "",
	volume = 4,
	number = "",
	pages = "31--42",
	copy = ""
}


@INBOOK{Cul74a,
	AUTHOR = "{\v{C}}ulik, II, K.",
	TITLE = "Structured {0L}-systems",
        booktitle = {L Systems}, editor = {G. Rozenberg and A. Salomaa},
	PAGES = "216--229",
	CHAPTER = "Different ways of defining {L} languages",
	PUBLISHER = "Berlin: Springer",
	YEAR = 1974,
	month = "",
	address = "",
	volume = 15,
	series = "LNCS",
	type = "",
	copy = ""
}


@ARTICLE{CulOpa74,
	AUTHOR = "{\v{C}}ulik, II, K. and J. Opatrn{\'y}",
	TITLE = "Literal homomorphisms of {0L}-languages",
	JOURNAL = ijcm,
	YEAR = 1974,
	month = "",
	volume = 4,
	number = "",
	pages = "247--267",
	copy = ""
}


@INBOOK{CulOpa74a,
	chapter = "{\v{C}}ulik, II, K. and J. Opatrn\`y: Context in parallel rewriting",
        title = {L Systems}, editor = {G. Rozenberg and A. Salomaa},
	PAGES = "230--243",
	PUBLISHER = "Berlin: Springer",
	YEAR = 1974,
	month = "",
	address = "",
	volume = 15,
	series = "LNCS",
	type = "",
	copy = ""
}


@ARTICLE{CulOpa75,
	AUTHOR = "{\v{C}}ulik, II, K. and J. Opatrn{\'y}",
	TITLE = "Macro {0L}-systems",
	JOURNAL = ijcm,
	YEAR = 1975,
	month = "",
	volume = 4,
	number = "",
	pages = "327--342",
	copy = ""
}


@ARTICLE{CulMau77,
	AUTHOR = "K. {\v{C}}ulik and H. A. Maurer",
	TITLE = "Tree controlled grammars",
	JOURNAL = computing,
	YEAR = 1977,
	month = "",
	volume = 19,
	number = "",
	pages = "129--139",
	copy = ""
}


@ARTICLE{Cul79,
	AUTHOR = "{\v{C}}ulik, II, K.",
	TITLE = "A purely homomorphic characterization of recursively
enumerable sets",
	JOURNAL = jacm,
	YEAR = 1979,
	month = apr,
	volume = 26,
	number = "2",
	pages = "345--350",
	copy = ""
}


@INPROCEEDINGS{Cul79a,
	crossref = "Mau79",
	AUTHOR = "{\v{C}}ulik, II, K.",
	TITLE = "On the homomorphic characterization of families of languages",
	chapter = "",
	pages = "161--170",
	copy = ""
}



@INPROCEEDINGS{Cul80,
	crossref = "Boo80",
	AUTHOR = "{\v{C}}ulik, II, K.",
	TITLE = "Homomorphisms: {D}ecidability, equality and test sets",
	chapter = "",
	pages = "167--194",
	copy = ""
}


@ARTICLE{Cul89,
	AUTHOR = "{\v{C}}ulik, II, K.",
	TITLE = "Variations of the firing squad problem and applications",
	JOURNAL = ipl,
	YEAR = 1989,
	month = "",
	volume = 30,
	number = "",
	pages = "153--157",
	copy = ""
}


@TECHREPORT{Cul90,
	AUTHOR = "{\v{C}}ulik, II, K.",
	TITLE = "New methods for image generation and compression",
	INSTITUTION = "Dep. of Computer Science, University of South Carolina",
	YEAR = 1990,
	type = "",
	number = "",
	address = "",
	copy = ""
}


@ARTICLE{Cul90a,
	AUTHOR = "{\v{C}}ulik, II, K.",
	TITLE = "New techniques for proving the decidability of
equivalence problems",
	JOURNAL = tcs,
	YEAR = 1990,
	volume = 71,
	number = "",
	pages = "29--45",
	copy = ""
}



@ARTICLE{CulCoh73,
	AUTHOR = "K. {\v{C}}ulik and R. Cohen",
	TITLE = "{LR}-regular grammars --- an extension of {LR}$(k)$ grammars",
	JOURNAL = jcss,
	YEAR = 1973,
	month = "",
	volume = 7,
	number = "",
	pages = "66--96",
	copy = ""
}


@ARTICLE{CulDub89,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "Fractal and recurrent behaviour of cellular automata",
	JOURNAL = complex,
	YEAR = 1989,
	month = "",
	volume = 3,
	number = "",
	pages = "253--267",
	copy = "", note = {Also in: R. Janicki and W.W. Koczkodaj
		  (eds.): Computing and Information, Elsevier, 1989}
}


@TECHREPORT{CulDub90,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "Balancing order and chaos in image generation",
	INSTITUTION = "Dep. of Computer Science, University of South Carolina",
	YEAR = 1990,
	number = "",
	note = "A shorter version with the same title appeared in LNCS~510, p.~600~ff.; a
newer version  with the same title is available as a Technical Report TR~9103 from U.S.C.",
	copy = ""
}


@TECHREPORT{CulDub90a,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "Affine automata and related techniques for generation
of complex images",
	INSTITUTION =  "Dep. of Computer Science, University of South Carolina",
	YEAR = 1990,
	number = "TR90009",
	copy = ""
}



@INPROCEEDINGS{CulDub90c,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "Affine automata: {A} technique to generate complex images",
	BOOKTITLE = "Mathematical Foundations of Computer Science 1990 {LNCS}: 452",
	PUBLISHER = "Springer",
	YEAR = 1990,
	pages = "224--231",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{CulDub90d,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "Methods for generating deterministic fractals and
image processing",
	BOOKTITLE = "{LNCS}: 464; {IMYCS}",
	PUBLISHER = "Springer",
	YEAR = 1990,
	pages = "2--28",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{CulDub90e,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "Encoding images as words and languages",
	BOOKTITLE = "International Colloquium on Words, Languages, and Combinatorics",
	YEAR = 1990,
	month = aug,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "???",
	address = "",
	organization = "Kyoto Sangyo Unversity (Japan)",
	note = "Improved version available from the authors; submitted
to: Intern. J. of Algebra and Computation",
	copy = ""
}


@TECHREPORT{CulDub91,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "L-systems and mutually recursive function systems",
	INSTITUTION = "Dep. of Computer Science, University of South Carolina",
	YEAR = 1991,
	month = jun,
	number = "",
	address = "",
	copy = ""
}


@TECHREPORT{CulDub91a,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "Affine automata and related techniques for generation
of complex images",
	INSTITUTION = "Dep. of Computer Science, University of South Carolina",
	YEAR = 1991,
	month = jul,
	number = "",
	address = "",
	copy = ""
}


@ARTICLE{CulDub93,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "L-systems and mutually recursive function systems",
	JOURNAL = actainform,
	YEAR = 1993,
	month = "",
	volume = 30,
	number = "",
	pages = "279--302",
	copy = ""
}


@ARTICLE{CulDub93a,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "Rational and affine expressions for image description",
	JOURNAL = dam,
	YEAR = 1993,
	month = "",
	volume = 41,
	number = "",
	pages = "85--120",
	copy = ""
}


@INPROCEEDINGS{CulDub93b,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "Efficient compression of wavelet coefficients for
smooth and fractal-like data (extended abstract)",
	BOOKTITLE = "STACS 93; 10th Annual Symposium on Theoretical
Aspects of Computer Science, W{\"u}rzburg, Germany",
	YEAR = 1993,
	month = feb,
	volume = 665,
	editor = "Enjalbert, P. and A. Finkel and K.W. Wagner",
	series = "{LNCS}",
	chapter = "",
	pages = "343--353",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{CulDub93d,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "Encoding images as words and languages",
	JOURNAL = ijalgcomp,
	YEAR = 1993,
	month = "",
	volume = 3,
	number = "2",
	pages = "211--326",
	copy = ""
}


@ARTICLE{CulDub93e,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Dube",
	TITLE = "Balancing order and chaos in image generation",
	JOURNAL = cag,
	YEAR = 1993,
	month = "",
	volume = 17,
	number = "4",
	pages = "465--486",
	copy = ""
}
		  

@ARTICLE{CulFicSal82,
	AUTHOR = "{\v{C}}ulik, K. II and F. E. Fich and A. Salomaa",
	TITLE = "A homomorphic characterization of regular languages",
	JOURNAL = dam,
	YEAR = 1982,
	month = "",
	volume = 4,
	number = "",
	pages = "149--152",
	copy = ""
}


@INPROCEEDINGS{CulFri77,
	AUTHOR = "{\v{C}}ulik, II, K. and I. Fri{\v s}",
	TITLE = "The sequence equivalence problem for {D0L} systems is decidable",
	BOOKTITLE = "{ICALP}",
	YEAR = 1977,
	month = jul,
	volume = "52",
	editor = "",
	series = "{LNCS}",
	chapter = "",
	pages = "148--163",
	address = "",
	organization = "{EATCS}",
	copy = ""
}



@ARTICLE{CulFri95,
        AUTHOR = "{\v{C}}ulik, II, K. and I. Fri{\v s}",
        TITLE = "Weighted finite transducers in image processing",
	JOURNAL = dam,
	YEAR = 1995,
	month = "",
	volume = 58,
	number = "",
	pages = "223--237",
	copy = ""
}


@ARTICLE{CulHurYu90,
	AUTHOR = "K. \v Culik and L. P. Hurd and S. Yu",
	TITLE = "Computation theoretic aspects of cellular automata",
	JOURNAL = physd,
	YEAR = 1990,
	month = "",
	volume = 45,
	number = "",
	pages = "357--378",
	copy = ""
}


@ARTICLE{CulHurYu90a,
	AUTHOR = "K. \v Culik and L. P. Hurd and S. Yu",
	TITLE = "Formal languages and global cellular automaton behaviour",
	JOURNAL = physd,
	YEAR = 1990,
	month = "",
	volume = 45,
	number = "",
	pages = "396--403",
	copy = ""
}



@ARTICLE{CulKar79,
	AUTHOR = "{\v{C}}ulik, II, K. and J. Karhum{\"a}ki",
	TITLE = "Interactive {L} systems with almost interactionless behaviour",
	JOURNAL = icalt,
	YEAR = 1979,
	month = "",
	volume = 43,
	number = "",
	pages = "83--100",
	copy = ""
}


@ARTICLE{CulKar93,
        AUTHOR = "{\v{C}}ulik, II, K. and J. Kari",
        TITLE = "Image compression using weighted finite automata",
        JOURNAL = cag,
        year = 1993,
	month = "",
	volume = 17,
	number = "3",
	pages = "305--313",
	copy = ""
}



@article{CulKar93e,
        AUTHOR = "{\v{C}}ulik, II, K. and J. Kari",
        TITLE = "Mechanisms for pattern generation",
        journal = complex,
        year = 1993,
		  volume = 7,
		  pages = "347--365",
}


@ARTICLE{CulKar93f,
        AUTHOR = "{\v{C}}ulik, II, K. and J. Kari",
	TITLE = "Parametrized recurrent systems for image generation",
	JOURNAL = ipl,
	YEAR = 1993,
	month = "",
	volume = 48,
	number = "",
	pages = "267--274",
	copy = ""
}


@ARTICLE{CulKar94,
	AUTHOR = "{\v{C}}ulik, II, K. and J. Kari",
	TITLE = "Image-data compression using edge-optimizing
algorithm for {WFA} inference",
	JOURNAL = jiam,
	YEAR = 1994,
	month = "",
	volume = "30",
	number = "",
	pages = "829--838",
	copy = ""
}

@ARTICLE{CulKar94a,
	AUTHOR = "{\v{C}}ulik, II, K. and J. Kari",
	TITLE = "On the power of {L}-systems in image generation",
	JOURNAL = actainform,
	YEAR = 1994,
	month = "",
	volume = 31,
	number = "",
	pages = "761--773",
	copy = ""
}



@INPROCEEDINGS{CulKar95,
	AUTHOR = "{\v{C}}ulik, II, K. and J. Kari",
	TITLE = "Finite state transformations of images",
	BOOKTITLE = "Automata, Languages and Programming; 22nd
		  International Colloquium, ICALP'95, Szeged, Hungary",
	YEAR = 1995,
	month = "",
	volume = "944",
	editor = "",
	series = "{LNCS}",
	chapter = "",
	pages = "51--62",
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{CulKar96,
	AUTHOR = "{\v{C}}ulik, II, K. and J. Kari",
	TITLE = "An aperiodic set of {W}ang cubes",
	BOOKTITLE = "Proc. of STACS'96",
	YEAR = 1996,
	month = "",
	volume = "1046",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "137--146",
	address = "",
	organization = "",
	copy = ""
}


@article{CulKar96b,
        AUTHOR = "{\v{C}}ulik, II, K. and J. Kari",
        TITLE = "Finite state transformations of images",
        journal =  cag, pages ="125--135", volume="20",
        year = 1996,
	month = "",
	copy = ""
}


@article{CulKar96c,
        AUTHOR = "{\v{C}}ulik, II, K. and J. Kari",
        TITLE = "Image-data compression using edge-optimized algorithm
                  for {WFA} inference",
        journal= "Information Processing and Management",
                  volume = 30, pages = "829--838",
        year = 1994,
	month = "",
	copy = ""
}


@article{CulKar97,
        AUTHOR = "{\v{C}}ulik, II, K. and J. Kari",
        TITLE = "Computational fractal geometry with {WFA}",
         journal = actainform, 
		  volume = 34, 
		  pages = {151--166},
        year = 1997,
	month = "",
	copy = ""
}


@article{CulKarVal97,
    author = "K. {Culik {II}} and J. Kari and V. Valenta",
    title = "Compression of Silhouette-like Images based on {WFA}",
    journal = jucs,
    volume = "3",
    number = "10",
    pages = "1100--??",
    year = "1997",
note = {Conference version at Data Compression Conference DCC'97},
}



 @ARTICLE{CulLin76,
   AUTHOR = 	"{\v{C}}ulik, II, K. and A. Lindenmayer",
   TITLE = 	"Parallel graph generating and graph recurrence
		    systems for multicellular development",
   JOURNAL = 	ijgs,
   YEAR = 	"1976",
   VOLUME = 	"3",
   NUMBER = 	"",
   PAGES = 	"53--66",
   MONTH = 	"",
   note = 	""
 }


@ARTICLE{CulMau79,
	AUTHOR = "{\v{C}}ulik, K. II and H. Maurer",
	TITLE = "On simple representation of language families",
	JOURNAL = rairo,
	YEAR = 1979,
	month = "",
	volume = 13,
	number = "",
	pages = "241--250",
	copy = ""
}


@ARTICLE{CulPac81,
	AUTHOR = "{\v{C}}ulik, II, K. and J.K. Pachl",
	TITLE = "Equivalence problems for mappings on infinite strings",
	JOURNAL = icalt,
	YEAR = 1981,
	month = "",
	volume = 49,
	number = "",
	pages = "52--63",
	copy = ""
}



@ARTICLE{CulRaj95,
        AUTHOR = "{\v{C}}ulik, II, K. and P. Raj\v c\'ani",
        TITLE = "Iterative weighted finite transductions",
	JOURNAL = actainform,
	YEAR = 1995,
	month = "",
	volume = 32,
	number = "",
	pages = "681--703",
	copy = ""
}


@ARTICLE{CulSal82,
	AUTHOR = "{\v{C}}ulik, II, K. and A. Salomaa",
	TITLE = "On infinite words obtained by iterating morphisms",
	JOURNAL = tcs,
	YEAR = 1982,
	volume = 19,
	number = "",
	pages = "29--38",
	copy = ""
}



@ARTICLE{CulSalWoo84,
	AUTHOR = "K. {\v C}ulik and A. Salomaa and D. Wood",
	TITLE = "Systolic tree acceptors",
	JOURNAL = rairo,
	YEAR = 1984,
	month = "",
	volume = 18,
	number = "",
	pages = "53--69",
	copy = ""
}


@ARTICLE{CulWoo78,
	AUTHOR = "{\v{C}}ulik, II, K. and D. Wood",
	TITLE = "Speed-varying {0L} systems",
	JOURNAL = infsci,
	YEAR = 1978,
	month = "",
	volume = 14,
	number = "",
	pages = "161--170",
	copy = ""
}


@ARTICLE{CulWoo79,
   AUTHOR = 	"{\v{C}}ulik, II, K. and D. Wood",
   TITLE = 	"Doubly deterministic tabled {0L} systems",
   JOURNAL = 	ijcis,
   YEAR = 	"1979",
   VOLUME = 	"8",
   NUMBER = 	"4",
   PAGES = 	"335--347",
   MONTH = 	"",
   note = 	""
 }


@ARTICLE{CulYu91,
	AUTHOR = "{\v{C}}ulik, II, K. and S. Yu",
	TITLE = "Cellular automata, {$\omega\omega$}-regular sets and
sofic systems",
	JOURNAL = dam,
	YEAR = 1991,
	month = "",
	volume = 32,
	number = "2",
	pages = "85--101",
	note = "plus contents of dam 32",
	copy = ""
}


@INPROCEEDINGS{Culetal93,
	AUTHOR = "D. Culler and others",
	TITLE = "{LogP}: towards a realistic model of parallel computation",
	BOOKTITLE = "4th ACM SIGPLAN Symposium on Principles and
		  Practice of Parallel Programming PPOPP'93",
	YEAR = 19,
	month = may,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "1--12",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{Czaetal2004,
	AUTHOR = "E. Czabarka and O. S\'ykora and L. A. Sz\'kely and I Vrt'o",
	TITLE = "Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions",
	JOURNAL = {The Electronic Journal of Combinatorics},
	YEAR = 2004,
	month = nov,
	volume = 11,
	number = "",
	pages = "R81",
	copy = ""
}

@INPROCEEDINGS{Czuetal2004,
	AUTHOR = "A. Czumaj and M. Grigni and P. Sissokho and H. Zhao",
	TITLE = "Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs",
	BOOKTITLE = "Symposium on Discrete Algorithms SODA",
	YEAR = 2004,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "489--498",
	address = "",
	organization = "ACM",
        publisher = "",
	copy = ""
}

DDD
 @ARTICLE{DahGai85,
	 AUTHOR = "E. Dahlhaus and H. Gaifman",
	 TITLE = "Concerning two-adjacent context-free languages",
	 JOURNAL = tcs,
	 YEAR = 1985,
	 VOLUME = 41,
	 NUMBER = "",
	 PAGES = "169--184",
	 copy = ""
 }

@ARTICLE{DahWar86,
	AUTHOR = "E. Dahlhaus and M. K. Warmuth",
	TITLE = "Membership for growing context-sensitive grammars is polynomial",
	JOURNAL = jcss,
	YEAR = 1986,
	month = "",
	volume = 33,
	number = "",
	pages = "456--472",
	copy = ""
}


@INPROCEEDINGS{Dah91,
	AUTHOR = "E. Dahlhaus",
	TITLE = "How to implement first order formulas in local memory machine models",
	BOOKTITLE = "Computer Science Logic",
	YEAR = 1991,
	month = "",
	volume = "626",
	editor = "E. B{\"o}rger and others",
	series = "LNCS",
	chapter = "",
	pages = "68--78",
	address = "",
	organization = "",
	copy = ""
}



 @ARTICLE{vanDal70,
   AUTHOR = 	"{D. van} Dalen",
   TITLE = 	"A Note on some systems of {L}indenmayer",
   JOURNAL = 	mst,
   YEAR = 	"1970",
   VOLUME = 	"",
   NUMBER = 	"",
   PAGES = 	"128--140",
   MONTH = 	"",
   note = 	""
 }


@ARTICLE{Dal90,
	AUTHOR = "W. J. Dally",
	TITLE = "Performance analysis of {$k$}-ary {$n$}-cube
interconnection networks",
	JOURNAL = ieeetoc,
	YEAR = 1990,
	month = jun,
	volume = 39,
	number = "6",
	pages = "775--785",
	copy = ""
}


@INPROCEEDINGS{DamOem99,
	AUTHOR = "M. Damian-Iordache and S. V. Pemmaraju",
	TITLE = "Hardness of approximating independent domination in circle graphs",
	BOOKTITLE = "ISAAC'99",
	YEAR = 1999,
	month = "",
	volume = "1741",
	editor = "A. Aggarwal and C. P. Rangan",
	series = "LNCS",
	chapter = "",
	pages = "56--69",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@INPROCEEDINGS{DamOem99a,
	AUTHOR = "M. Damian-Iordache and S. V. Pemmaraju",
	TITLE = "Constant-factor approximation algorithms for domination problems on circle graphs",
	BOOKTITLE = "ISAAC'99",
	YEAR = 1999,
	month = "",
	volume = "1741",
	editor = "A. Aggarwal and C. P. Rangan",
	series = "LNCS",
	chapter = "",
	pages = "70--82",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@INPROCEEDINGS{DamOem00,
	AUTHOR = "M. Damian-Iordache and S. V. Pemmaraju",
	TITLE = "A $(2+\epsilon)$ approximation scheme for minimum domination on circle graphs",
	BOOKTITLE = "Symposium on Discrete Algorithms SODA'00",
	YEAR = 2000,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "672--679",
	address = "",
	organization = "",
        publisher = "ACM-SIAM",
	copy = ""
}

@ARTICLE{DamOem2002,
	AUTHOR = "M. Damian-Iordache and S. V. Pemmaraju",
	TITLE = "A $(2+\epsilon)$ approximation scheme for minimum domination on circle graphs",
	JOURNAL = jalg,
	YEAR = 2002,
	month = "",
	volume = 42,
	number = "",
	pages = "255--276",
	copy = ""
}


@INPROCEEDINGS{Dam2004,
	AUTHOR = "P. Damaschke",
	TITLE = "Parameterized enumeration, transversals, and imperfect phylogeny reconstruction",
	BOOKTITLE = "International Workshop on Parameterized and Exact
Computation IWPEC 2004",
	YEAR = 2004,
	month = "",
	volume = "3162",
	editor = "R. Downey and M. Fellows and F. Dehne",
	series = "LNCS",
	chapter = "",
	pages = "1--12",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}
@INPROCEEDINGS{Dam2007,
	AUTHOR = "P. Damaschke",
	TITLE = "The union of minimal hitting sets: parameterized combinatorial bounds and counting",
	BOOKTITLE = "24th Symposium on Theoretical Aspects of Computer Science STACS",
	YEAR = 2007,
	month = "",
	volume = "4393",
	editor = "W. Thomas and P. Weil",
	series = "LNCS",
	chapter = "",
	pages = "332--343",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@ARTICLE{Dam82,
	AUTHOR = "W. Damm",
	TITLE = "The {IO}- and {OI}-hierarchies",
	JOURNAL = tcs,
	YEAR = 1982,
	month = "",
	volume = 20,
	number = "",
	pages = "95--207",
	copy = ""
}


@ARTICLE{DanEag92,
	AUTHOR = "S. P. Dandamudi and D. L. Eager",
	TITLE = "Hot-spot contention in binary hypercube architectures",
	JOURNAL = ieeetoc,
	YEAR = 1992,
	month = "",
	volume = 41,
	number = "2",
	pages = "239--244",
	copy = ""
}

@ARTICLE{Danetal2004,
	AUTHOR = "P. Dankelmann and G. S. Domke and W. Goddard and P. Grober and J. H. Hattingh and H. C. Swart",
	TITLE = "Maximum sizes of graphs with given domination parameters",
	JOURNAL = dm,
	YEAR = 2004,
	month = "",
	volume = 281,
	number = "",
	pages = "137--148",
	copy = ""
}


@ARTICLE{DarSir86,
	AUTHOR = "V. R. Dare and R. Siromoney",
	TITLE = "Subword topology",
	JOURNAL = tcs,
	YEAR = 1986,
	volume = 47,
	number = "",
	pages = "159--168",
	copy = ""
}

@ARTICLE{Dar98,
	AUTHOR = "A. Darwiche",
	TITLE = "Model-based diagnosis using structured system descriptions",
	JOURNAL = {Journal of Artificial Intelligence Research},
	YEAR = 1998,
	month = "",
	volume = {??},
	number = "",
	pages = "--",
	copy = ""
}



@INPROCEEDINGS{DarKot84,
	crossref = "NivPer84",
	AUTHOR = "Ph. Darondeau and L. Kott",
	TITLE = "A formal proof system for infinitary rational expressions",
	chapter = "Logic and automata",
	pages = "68--80",
	copy = ""
}

@article{DasGoo97,
  author    = {G. Das and
               M. T. Goodrich},
  title     = {On the Complexity of Optimization Problems for 3-dimensional
               Convex Polyhedra and Decision Trees},
  journal   = {Comput. Geom.},
  volume    = {8},
  year      = {1997},
  pages     = {123--137},
}


@ARTICLE{Das76,
	AUTHOR = "J. Dassow",
	TITLE = "{\"U}ber quasideterministische {S}prachen",
	JOURNAL = rmk,
	YEAR = 1976,
	month = "",
	volume = 1,
	number = "",
	pages = "51--60",
	copy = ""
}


@ARTICLE{Das77,
	   AUTHOR = "J. Dassow",
	   TITLE = "{\"Uber} {Abschlu\ss eigenschaften} von biologisch motivierten {S}prachen",
	   JOURNAL = rmk,
	   YEAR = 1977,
	   VOLUME = 4,
	   NUMBER = "",
	   PAGES = "69--84",
	   copy = ""
 }


@ARTICLE{Das79,
	AUTHOR = "J. Dassow",
	TITLE = "On the circular closure of languages",
	JOURNAL = eikalt,
	YEAR = 1979,
	month = "",
	volume = 15,
	number = "",
	pages = "87--94",
	copy = ""
}
		  

@ARTICLE{Das79a,
	AUTHOR = "J. Dassow",
	TITLE = "Concentration dependent {0L} systems",
	JOURNAL = ijcm,
	YEAR = 1979,
	month = "",
	volume = 7,
	number = "",
	pages = "187--206",
	copy = ""
}


@ARTICLE{Das80,
	AUTHOR = "J. Dassow",
	TITLE = "Some extensions of {I}ndian parallel context-free grammars",
	JOURNAL = actacybern,
	YEAR = 1980,
	month = "",
	volume = 4,
	number = "",
	pages = "303--310",
	copy = ""
}


@ARTICLE{Das82,
	AUTHOR = "J. Dassow",
	TITLE = "Grammars with valuations --- a discrete model for
		  self-organization of biopolymers",
	JOURNAL = dam,
	YEAR = 1982,
	month = "",
	volume = 4,
	number = "",
	pages = "161--174",
	copy = ""
}


@ARTICLE{Das83,
	    AUTHOR = "J. Dassow",
	    TITLE = "Comparison of some types of regulated rewriting",
	    JOURNAL = "Colloquia mathematica societatis {J\'a}nos {B}olyai",
	    YEAR = 1983,
	    VOLUME = "",
	    NUMBER = "",
	    PAGES = "301--313",
	    copy = ""
  }


@ARTICLE{Das84,
	AUTHOR = "J. Dassow",
	TITLE = "On some extensions of {R}ussian parallel context-free grammars",
	JOURNAL = actacybern,
	YEAR = 1984,
	month = "",
	volume = 6,
	number = "",
	pages = "355--360",
	copy = ""
}


@ARTICLE{Das86,
        AUTHOR= "J. Dassow",
        TITLE= "Pure grammars with regulated rewriting",
        JOURNAL= rrmpa,
        YEAR= 1986,
        month= "",
        volume= 31,
        number= "",
        pages= "657--666",
        copy= ""
}


@ARTICLE{Das88,
	   AUTHOR = "J. Dassow",
	   TITLE = "A remark on limited {0L} systems",
	   JOURNAL = eikneu,
	   YEAR = 1988,
	   VOLUME = 24,
	   NUMBER = 6,
	   PAGES = "287--291",
	   copy = ""
 }


@ARTICLE{Das88a,
	   AUTHOR = "J. Dassow",
	    TITLE = "Pure languages of regulated rewriting and their codings",
	    JOURNAL = actacybern,
	    YEAR = 1988,
	    VOLUME = 8,
	    NUMBER = 3,
	    PAGES = "227--235",
	    copy = ""
  }

 
@ARTICLE{Das88b,
	    AUTHOR = "J. Dassow",
	    TITLE = "On the sequence equivalence problem for {0L} systems with
		     controlled derivations",
	    JOURNAL = caai,
	    YEAR = 1988,
	    VOLUME = 7,
	    NUMBER = 2,
	    PAGES = "97--105",
	    copy = ""
  }
 

@ARTICLE{Das88c,
   AUTHOR = 	"J. Dassow",
   TITLE = 	"Subregularly controlled derivations: context-free case",
   JOURNAL = 	rmk,
   YEAR = 	"1988",
   VOLUME = 	"34",
   NUMBER = 	"",
   PAGES = 	"61--70",
   MONTH = 	"",
   note = 	""
 }



@ARTICLE{Das91,
	AUTHOR = "J. Dassow",
	TITLE = "A remark on cooperating distributed grammar systems
                  controlled by graphs",
	JOURNAL = {Wiss. Zeit. TU Magdeburg},
	YEAR = 1991,
	month = "",
	volume = 35,
	number = "",
	pages = "4--6",
	copy = ""
}

@INPROCEEDINGS{Das94,
	AUTHOR = "J. Dassow",
	TITLE = "Decision Problems for Edge Grammars",
	BOOKTITLE = "Mathematical Foundations of Computer Science MFCS'94",
	YEAR = 1994,
	month = "",
	volume = "841",
	editor = "",
	series = "{LNCS}",
	chapter = "",
	pages = "286--295",
	address = "",
	organization = "",
	copy = ""
}
@INPROCEEDINGS{DasFerPauSte97,
	AUTHOR = "J. Dassow and H. Fernau and Gh. P\u aun and F. Stephan",
	TITLE = "Linksableitungen bei programmierten Grammatiken",
	BOOKTITLE = "7. Theorietag Automaten und Formale Sprachen",
	YEAR = 1997,
	month = "",
	volume = "",
	editor = "F. Drewes",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = ""
}
@ARTICLE{DasFerPau99,
	AUTHOR = "J. Dassow and H. Fernau and Gh. P\u aun",
	TITLE = "On the leftmost derivation in matrix 
grammars",
	JOURNAL = ijfcs,
	YEAR = 1999,
	month = "",
	volume = 10,
	number = "1",
	pages = "61--80",
	copy = ""
}

  @ARTICLE{DasFes84,
   AUTHOR = 	"J. Dassow and U. Fest",
   TITLE = 	"On regulated {L} systems",
   JOURNAL = 	rmk,
   YEAR = 	"1984",
   VOLUME = 	"25",
   NUMBER = 	"",
   PAGES = 	"99--118",
   MONTH = 	"",
   note = 	""
 }

@INPROCEEDINGS{DasFer2007,
	AUTHOR = "J. Dassow and H. Fernau",
	TITLE = "Comparison of some descriptional complexities of {0L} 
systems obtained by a   unifying approach",
	BOOKTITLE = "Proceedings of the 1st International Conference on Language and Automata Theory and Applications LATA",
	YEAR = 2007,
	month = "",
	volume = "35",
	editor = "",
	series = "Technical Report",
	chapter = "",
	pages = "249--260",
	address = "",
	organization = "",
        publisher = "Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona",
	copy = ""
}


@ARTICLE{Dasetal95,
	AUTHOR = "J. Dassow and others",
	TITLE = "Cooperating array grammar systems",
	JOURNAL = ijprai,
	YEAR = 1995,
	month = "",
	volume = 9,
	number = "6",
	pages = "1--25",
	copy = ""
}

@ARTICLE{DasHin93,
	AUTHOR = "J. Dassow and F. Hinz",
	TITLE = "Decision problems and regular chain code picture languages",
	JOURNAL = dam,
	YEAR = 1993,
	month = "",
	volume = 45,
	number = "",
	pages = "29--49",
	copy = ""
}

@INPROCEEDINGS{DasHor94,
	AUTHOR = "J. Dassow and H. Hornig",
	TITLE = "Conditional grammars with subregular conditions",
	BOOKTITLE = "2nd International Colloquium on Words, Languages, and Combinatorics",
	YEAR = 1994,
	month = aug,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "71--86",
	address = "", publisher = {World Scientific},
	organization = "Kyoto Sangyo Unversity (Japan)",
	copy = ""
}

@Article{DasKel91,
  author =       "J. Dassow and J. Kelemen",
  title =        "Cooperating/Distributed Grammar Systems: a Link
                 between Formal Languages and Artificial Intelligence",
  journal =      eatcs,
  volume =       "45",
  year =         "1991",
  pages =        "131--145"
}
		  
@INPROCEEDINGS{DasLan91,
	AUTHOR = "J. Dassow and K.-J. Lange",
	TITLE = "Computational complexity and hardest languages of
		  automata with abstract storage",
	BOOKTITLE = "Fundamentals of Computation Theory, 8th
		  International Conference FCT'91",
	YEAR = 1991,
	month = "",
	volume = "529",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "200--209",
	address = "",
	organization = "",
	copy = ""
}

@TECHREPORT{DasMit96,
	AUTHOR = "J. Dassow and V. Mitrana",
	TITLE = "Cooperating distributed push-down automata",
	INSTITUTION = "Universit{\"a}t Magdeburg, Fakult{\"a}t f{\"u}r Informatik",
	YEAR = 1996,
	month = "",
	number = "",
	address = "",
	copy = ""
}

@INPROCEEDINGS{DasMit97,
	AUTHOR = "J. Dassow and V. Mitrana",
	TITLE = "On some operations suggested by genome evolution",
	BOOKTITLE = "Pacific Symposium on Biocomputing'97",
	YEAR = 1997,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "97--108",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{DasMitSal97,
	AUTHOR = "J. Dassow and V. Mitrana and A. Salomaa",
	TITLE = "Context-free evolutionary grammars and the structural language of nucleid acids",
	JOURNAL = {BioSystems},
	YEAR = 1997,
	month = "",
	volume = 43,
	number = "",
	pages = "169--177",
	copy = ""
}

@ARTICLE{DasPau85,
	AUTHOR = "J. Dassow and Gh. P{\u a}un",
	TITLE = "On ordered variants of some regulated grammars",
	JOURNAL = eikneu,
	YEAR = 1985,
	month = "",
	volume = 21,
	number = "10/11",
	pages = "491--504",
	copy = ""
}

@ARTICLE{DasPau86,
	AUTHOR = "J. Dassow and Gh. P{\u a}un",
	TITLE = "Further remarks on pure grammars with regulated rewriting",
	JOURNAL = rrmpa,
	YEAR = 1986,
	month = "",
	volume = 31,
	number = "",
	pages = "855--864",
	copy = ""
}

@ARTICLE{DasPau90,
	AUTHOR = "J. Dassow and Gh. P{\u a}un",
	TITLE = "On the degree of non-regularity of context-free languages",
	JOURNAL = ijcm,
	YEAR = 1990,
	month = "",
	volume = 35,
	number = "",
	pages = "13--29",
	copy = ""
}


@ARTICLE{DasPau90a,
	AUTHOR = "J. Dassow and Gh. P{\u a}un",
	TITLE = "Cooperating/distributed grammar systems with registers",
	JOURNAL = {Foundations of  Control Engineering},
	YEAR = 1990,
	month = "",
	volume = 15,
	number = "1",
	pages = "1--38",
	copy = ""
}

@ARTICLE{DasPauVic93,
	AUTHOR = "J. Dassow and Gh. P{\u a}un and S. Vicolov",
	TITLE = "On the power of cooperating/distributed grammar systems with regular components",
	JOURNAL = {Foundations of  Computing and Decision Sciences},
	YEAR = 1993,
	month = "",
	volume = 18,
	number = "2",
	pages = "83--108",
	copy = ""
}

@INPROCEEDINGS{DasPauSal97,
	crossref = "RozSal97II",
	AUTHOR = "J. Dassow and Gh. P\u aun and A. Salomaa",
	TITLE = "Grammars with controlled derivations",
	chapter = "",
	pages = "101--154",
	copy = ""
}

@TECHREPORT{DasPau98b,
	AUTHOR = "J. Dassow and Gh. P\u{a}un",
	TITLE = "On the power of membrane computing",
	INSTITUTION = "Turku Centre for Computer Science TUCS",
	YEAR = 1998,
	month = nov,
	number = "TR 217",
	address = "",
	copy = ""
}

@ARTICLE{DasPauSal93,
	AUTHOR = "J. Dassow and Gh. P{\u a}un and A. Salomaa",
	TITLE = "On the union of {0L} languages",
	JOURNAL = ipl,
	YEAR = 1993,
	month = "",
	volume = 47,
	number = "",
	pages = "59--63",
	copy = ""
}

@ARTICLE{DasWat90,
	AUTHOR = "J. Dassow and D. W{\"a}tjen",
	TITLE = "On the relations between the degree of
synchronization and the degree of nondeterminism in {$k$}-limited and
uniformly {$k$}-limited {T0L} systems",
	JOURNAL = ijcm,
	YEAR = 1990,
	volume = 35,
	number = "",
	pages = "69--82",
	copy = ""
}

@inproceedings{DasNisRei2002,
  author    = {J. Dassow and
               T. Y. Nishida and
               B. Reichel},
  title     = {On the Descriptional Complexity of Some Variants of {L}indenmayer
               Systems},
  booktitle = {Developments in Language Theory DLT},
  year      = {2002/3},
  pages     = {128--139},
  editor    = {M. Ito and
               Ma. Toyama},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {2450},
}

@misc{Das2003,
author = {J. Dassow},
title ={A remark on the nonterminal complexity of context-sensitive languages},
year = 2003, note ={Personal communication}}

@misc{Das2004a,
author = {J. Dassow},
title ={On the number of active symbols in {L}indenmayer systems},
year = 2004, note ={Personal communication}}


@article{Das2004,
  author    = {J. Dassow},
  title     = {On The Descriptional Complexity Of {L}indenmayer Systems},
  journal   = ijfcs,
  volume    = {15},
  number    = {4},
  year      = {2004},
  pages     = {663-672},
}


@ARTICLE{DasNeo87,
	   AUTHOR = "S. Das and N. Deo",
	   TITLE = "Rencontre graphs: a family of bipartite graphs",
	   JOURNAL = "",
	   YEAR = 1987,
	   VOLUME = 25,
	   NUMBER = 3,
	   PAGES = "250--262",
	   copy = ""
 }

@ARTICLE{Dasetal98,
	AUTHOR = "Bh. Dasgupta and others",
	TITLE = "On the complexity and approximation of syntetic distance",
	JOURNAL = dam,
	YEAR = 1998,
	month = "",
	volume = 88,
	number = "",
	pages = "59--82",
	copy = ""
}

@ARTICLE{Das74,
	AUTHOR = "M. Dasgupta",
	TITLE = "On some properties of the {C}antor set and the
construction of a class of sets with {C}antor sets properties",
	JOURNAL = czmj,
	YEAR = 1974,
	month = "",
	volume = 24,
	number = "",
	pages = "416--423",
	copy = ""
}

@INPROCEEDINGS{DauTim84,
	crossref = "NivPer84",
	AUTHOR = "M. Dauchet and E. Timmerman",
	TITLE = "Decidability of yield's equality for infinite regular trees",
	PAGES = "118--136",
	CHAPTER = "Automata on infinite trees",
	copy = ""
}

@TechReport{DavKal2004,
author = {A. Davenport and J. Kalagnanam},
title = {A Computational Study of the {K}emeny Rule for Preference Aggregation},
institution = {IBM Research Division, T. J. Watson Research Center, Yorktown Heights, New York},
year = {2004},
OPTkey = {},
OPTtype = {},
number = {RC23096 (W0401-104)},
OPTaddress = {},
month = jan,
OPTnote = {},
OPTannote = {}
}

@ARTICLE{Dav56,
	AUTHOR = "R. O. Davies",
	TITLE = "A property of {H}ausdorff measures",
	JOURNAL = pcps,
	YEAR = 1956,
	volume = 52,
	number = "",
	pages = "30--34",
	copy = ""
}

@ARTICLE{DavRog69,
	AUTHOR = "R. O. Davies and C. A. Rogers",
	TITLE = "The problem of subsets of finite positive measure",
	JOURNAL = blms,
	YEAR = 1969,
	month = "",
	volume = 1,
	number = "",
	pages = "47--54",
	copy = ""
}

@ARTICLE{DavKnu70,
	AUTHOR = "C. Davis and D. E. Knuth",
	TITLE = "Number representations and dragon curves",
	JOURNAL = jrm,
	YEAR = 1970,
	month = "",
	volume = 3,
	number = "",
	pages = "66--81; 133--149",
	copy = ""
}


@Article{Davetal94,
  author =       "Nathaniel J. {Davis, IV} and F. Gail Gray and Joseph
                 A. Wegner and Shannon E. Lawson and Vinay Murthy and
                 Tennis S. White",
  title =        "Reconfiguring fault-tolerant two-dimensional array
                 architectures",
  journal =      "IEEE Micro",
  volume =       "14",
  number =       "2",
  pages =        "60--69",
  month =        apr,
  year =         "1994",
}




@ARTICLE{Dawetal01,
	AUTHOR = "M. Dawande and P. Keskinocak and J.~M. Swaminathan and S. Tayur",
	TITLE = "On Bipartite and Multipartite Clique Problems",
	JOURNAL = jalg,
	YEAR = 2001,
	month = "",
	volume = 41,
	number = "",
	pages = "388--403",
	copy = ""
}



@ARTICLE{Day85,
	AUTHOR = "J. Day",
	TITLE = "A fault-driven comprehensive redundancy algorithm",
	JOURNAL = ieeedat,
	YEAR = "1985",
	month = "",
	volume =2,
	number = "3",
	pages = "35--44",
	copy = ""
}

@INPROCEEDINGS{Deb88,
	crossref = "KowBow88",
	AUTHOR = "S. K. Debray",
	TITLE = "Static analysis of parallel logic programs",
	chapter = "",
	pages = "711--732",
	copy = ""
}


@INPROCEEDINGS{DebWar86,
	crossref = "Sha86",
	AUTHOR = "S. K. Debray and D. S. Warren",
	TITLE = "Detection and optimization of functional computation
in prolog",
	chapter = "",
	pages = "490--504",
	copy = ""
}

@INPROCEEDINGS{DehFelRos2003,
	AUTHOR = "F. Dehne and M.~R. Fellows and F.~A. Rosamond",
	TITLE = "An {FPT} algorithm for set splitting",
	BOOKTITLE = "WG'03",
	YEAR = 2003,
	month = "",
	volume = "??",
	editor = "H. Bodlaender",
	series = "LNCS",
	chapter = "",
	pages = "To appear",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@INPROCEEDINGS{Dehetal2004,
	AUTHOR = "F. Dehne and M. Fellows and F. Rosamond and P. Shaw",
	TITLE = "Greedy Localization, Iterative Compression and Modeled Crown Reductions: New {FPT} Techniques, an Improved Algorithm for Set Splitting and a novel $2k$ kernelization for vertex cover",
	BOOKTITLE = "International Workshop on Parameterized and Exact
Computation IWPEC 2004",
	YEAR = 2004,
	month = "",
	volume = "3162",
	editor = "R. Downey and M. Fellows and F. Dehne",
	series = "LNCS",
	chapter = "",
	pages = "271--280",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{Dehetal2005,
	AUTHOR = "F. Dehne and M.~R. Fellows and M. Langston and F. Rosamond and K. Stevens",
	TITLE = "An {\mbox{$O(2^{O(k)} n^3 )$}} {FPT} algorithm for the undirected feedback vertex set problem",
	BOOKTITLE = "Computing and Combinatorics COCOON",
	YEAR = 2005,
	month = "",
	volume = "3595",
	editor = "L. Wang",
	series = "LNCS",
	chapter = "",
	pages = "859--869",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{Dehetal2006,
	AUTHOR = "F. Dehne and M. Fellows and H. Fernau and E. Prieto and F. Rosamond",
	TITLE = "{\sc Nonblocker}: parameterized algorithmics for {\sc Minimum Dominating Set}",
	BOOKTITLE = "Software
Seminar SOFSEM",
	YEAR = 2006,
	month = "",
	volume = "3831",
	editor = "J. {\v S}tuller and J. Wiedermann and G. Tel and J. Pokorn\'y  and M. Bielikova",
	series = "LNCS",
	chapter = "",
	pages = "237--245",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@article{Dehetal2007,
  author    = {F. K. H. A. Dehne and
               M. R. Fellows and
               M. A. Langston and
               F. A. Rosamond and
               K. Stevens},
  title     = {An {O(2$^{{O(k)}}$n$^{{3}}$)} FPT Algorithm for the Undirected
               Feedback Vertex Set Problem},
  journal   = tocs,
  volume    = {41},
  number    = {3},
  year      = {2007},
  pages     = {479--492},
}

@ARTICLE{Dek82,
	AUTHOR = "F. M. Dekking",
	TITLE = "Recurrent sets",
	JOURNAL = am,
	YEAR = 1982,
	volume = 44,
	number = "",
	pages = "78--104",
	month = "",
	copy = ""
}



@TECHREPORT{Dek82a,
	AUTHOR = "F. M. Dekking",
	TITLE = "Recurrent sets: {A} fractal formalism",
	INSTITUTION = "Technische Hogeschool, Delft (NL)",
	YEAR = 1982,
	month = "",
	number = "82-32",
	address = "",
	copy = ""
}


@ARTICLE{Dek82b,
	AUTHOR = "F. M. Dekking",
	TITLE = "Replicating superfigures and endomorphisms of free groups",
	JOURNAL = jcth,
	YEAR = 1982,
	month = "",
	volume = "A-32",
	number = "",
	pages = "315--320",
	copy = ""
}


@INBOOK{Dek87,
	AUTHOR = "G. Cherbit (ed.)",
	TITLE = "Non-integral dimensions and applications",
	PAGES = "83--97",
	CHAPTER = "F. M. Dekking: Construction of fractals and
		  dimension problems",
	PUBLISHER = "Chichester: Wiley and Sons",
	YEAR = 1987,
	month = "",
	address = "",
	volume = {},
	series = "",
	type = "",
	copy = ""
}


@ARTICLE{DelKow79,
	AUTHOR = "A. Deliyanni and R. A. Kowalski",
	TITLE = "Logic and semantic networks",
	JOURNAL = cacm,
	YEAR = 1979,
	month = mar,
	volume = 22,
	number = "3",
	pages = "184--192",
	copy = ""
}

@INPROCEEDINGS{Dem01,
	AUTHOR = "E.~D. Demaine",
	TITLE = "Playing games with algorithms: algorithmic combinatorial game theory",
	BOOKTITLE = "Mathematical
Foundations of Computer Science (MFCS 2001)",
	YEAR = 2001,
	month = "",
	volume = "2136",
	editor = "J. Sgall and A. Pultr and P. Kolman",
	series = "LNCS",
	chapter = "",
	pages = "18--32",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@TECHREPORT{Demetal02,
	AUTHOR = "Demaine, E.~D. and Hajiaghayi, M.~T. and Thilikos, D.",
	TITLE = "Exponential Speedup of Fixed Parameter Algorithms on $K_{3,3}$-minor-free or $K_5$-minor-free Graphs",
	INSTITUTION = "MIT",
	YEAR = 2002,
	month = mar,
	number = "MIT-LCS-TR-838",
	address = "",
	note = "Abstract version in P. Bose and P. Morin (editors): 13th Annual International Symposium on Algorithms and Computation, ISAAC 2002, volume 2518 of {\em LNCS}, pp.\  262--273.
  Springer-Verlag, 2002"
}

@INPROCEEDINGS{Demetal02a,
		AUTHOR = "Demaine, E.~D. and Hajiaghayi, M.~T. and Thilikos, D.",
	TITLE = "1.5-approximation for treewidth of graphs excluding a graph with one crossing as a minor",
	BOOKTITLE = "5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2002)",
	YEAR = 2002,
	month = "",
	volume = "2462",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "67--80",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{DemHaj2004,
	AUTHOR = "E. D. Demaine  and M. T. Hajiaghayi",
	TITLE = "Diameter and Treewidth in Minor-Closed Graph Families, Revisited
",
	JOURNAL = alg,
	YEAR = 2004,
	month = "",
	volume = 40,
	number = "",
	pages = "211--215",
	copy = ""
}

@INPROCEEDINGS{Demetal2004,
	AUTHOR = "E. D. Demaine and F. V. Fomin and M. T. Hajiaghayi and D. M. Thilikos",
	TITLE = "Subexponential parameterized algorithms on graphs of bounded genus and {$H$}-minor-free graphs",
	BOOKTITLE = "Symposium on Discrete Algorithms SODA",
	YEAR = 2004,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "823--832",
	address = "",
	organization = "ACM",
        publisher = "",
	copy = ""
}

@INPROCEEDINGS{DemHaj2004a,
	AUTHOR = "E. D. Demaine and M. T. Hajiaghayi",
	TITLE = "Equivalence of local treewidth and linear local treewidth and its algorithmic applications",
	BOOKTITLE = "Symposium on Discrete Algorithms SODA",
	YEAR = 2004,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "833--842",
	address = "",
	organization = "ACM",
        publisher = "",
	copy = ""
}

@INBOOK{DemDemEpp2000,	
editOR = "R. J. Nowakowski",
	TITLE = "More Games of No Chance",
	PAGES = "351--360",
	CHAPTER = "E. D. Demaine, M. L. Demaine and D. Eppstein: Phutball Endgames are Hard",
	PUBLISHER = "Cambridge University Press",
	YEAR = 2000,
	month = "",
	address = "",
	series = "",
	type = "",
	copy = ""
}


@TECHREPORT{Demetal03,
	AUTHOR = "E.~D. Demaine and F.~V. Fomin and M. Hajiaghayi and D.~M. Thilikos",
	TITLE = "Bidimensional parameters and local treewidth",
	INSTITUTION = "Department of Informatics, University of Bergen (Norway)",
	YEAR = 2003, note = {To appear in Proc. LATIN 2004},
	month = "",
	number = "257",
	address = "",
	copy = ""
}

@ARTICLE{Demetal2004a,
	AUTHOR = "E.~D. Demaine and F.~V. Fomin and M. Hajiaghayi and D.~M. Thilikos",
	TITLE = "Bidimensional parameters and local treewidth",
	JOURNAL = siamdm,
	YEAR = 2004,
	month = "",
	volume = 18,
	number = "",
	pages = "501--511",
	copy = ""
}


@TECHREPORT{Demetal03b,
	AUTHOR = "E.~D. Demaine and F.~V. Fomin and M. Hajiaghayi and D.~M. Thilikos",
	TITLE = "Subexponential parameterized algorithms on graphs of bounded genus and {$H$}-minor-free graphs",
	INSTITUTION = "Department of Informatics, University of Bergen (Norway)",
	YEAR = 2003, note = {To appear in Proc. SODA 2004},
	month = "",
	number = "251",
	address = "",
	copy = ""
}


@ARTICLE{DemGriPas98,
	AUTHOR = "M. Demange and  P. Grisoni and V. Th. Paschos",
	TITLE = "Differential approximation algorithms for some combinatorial optimization problems",
	JOURNAL = tcs,
	YEAR = 1998,
	month = "",
	volume = 209,
	number = "",
	pages = "107--122",
	copy = ""
}

@INPROCEEDINGS{DemParPas2000,
	AUTHOR = "M. Demange and X. Paradon and V. Th. Paschos",
	TITLE = "On-line maximum-order induced hereditary subgraph problems",
	BOOKTITLE = "SOFSEM 2000: Theory and Practice of Informatics",
	YEAR = 2000,
	month = "",
	volume = "1963",
	editor = "V. Hlav\'a\v c and K. G. Jeffery and J. Wiedermann",
	series = "LNCS",
	chapter = "",
	pages = "327--335",
	address = "",
	organization = "",
	copy = ""
}

@inproceedings{DemFin00, 
    author = "C. Demetrescu and I. Finocchi",
    title = "Break the ``Right'' Cycles and Get the ``Best'' Drawing",
    booktitle = "Proc. 2nd Work. Algorithm Engineering and Experiments, {ALENEX}",
    month = "7--8~",
    year = "2000",
    url = "citeseer.nj.nec.com/461370.html" }


@Article{DemFin2003,
  author = 	 {C. Demetrescu and I .Finocchi},
  title = 	 {Combinatorial algorithms for feedback problems in directed graphs},
  journal = 	 ipl,
  year = 	 {2003},
  OPTkey = 	 {},
  OPTvolume = 	 {86},
  OPTnumber = 	 {},
  OPTpages = 	 {129--136},
}


@ARTICLE{DemHodNay85,
	AUTHOR = "S. Demko and L. Hogdes and B. Naylor",
	TITLE = "Construction of fractal objects with iterated
function systems",
	JOURNAL = compgraph,
	YEAR = 1985,
	month = "",
	volume = 3,
	number = "19",
	pages = "271--278",
	copy = ""
}



@INBOOK{Den,
	   AUTHOR = "J. D\'enes",
	   TITLE = "Groups and graphs",
	   PAGES = "50--53",
	   PUBLISHER = "Teubner DDR",
	   YEAR = "19??",
	   VOLUME = 59,
	   SERIES = ttzm,
	   copy = ""
 }


@MASTERSTHESIS{Den2001,
	AUTHOR = "Z. Deng",
	TITLE = "Exploiting parse trees for graphs of bounded treewidth",
	SCHOOL = "University of Auckland",
	YEAR = 2001,
 	month = "",
	address = "",
	type = "Master's Thesis",
	copy = ""
}


@ARTICLE{DenGat89,
	AUTHOR = "K. L. Denninghoff and R. W. Gatterdam",
	TITLE = "On the undecidability of splicing systems",
	JOURNAL = ijcm,
	YEAR = 1989,
	month = "",
	volume = 27,
	number = "",
	pages = "133--145",
	copy = ""
}
@inproceedings{Den98,
    author = "F. Denis",
    title = "{PAC} Learning from Positive Statistical Queries",
    booktitle = "Algorithmic Learning Theory {ALT}",
    volume = "1501", series = "LNCS/LNAI", 
    publisher = "Springer",
    pages = "112--126",
    year = "1998",
}

@INPROCEEDINGS{DenLemTer2002,
	crossref = "ICGI2002",
	TITLE = "Some classes of regular languages identifiable in the limit from positive data",
	AUTHOR = "F. Denis and A. Lemay and A. Terlutte",
	pages = "63--76",
	chapter = "",
}


@inproceedings{DenEsp2003,
  author    = {F. Denis and
               Y. Esposito},
  title     = {Residual Languages and Probabilistic Automata},
  booktitle = {Automata, Languages and Programming, 30th International
               Colloquium, ICALP},
  year      = {2003},
  pages     = {452--463},
  editor    = {J. C. M. Baeten and
               J. K. Lenstra and
               J. Parrow and
               G. J. Woeginger},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {2719},

}

@inproceedings{DenEsp2004,
  author    = {F. Denis and
               Y. Esposito},
  title     = {Learning Classes of Probabilistic Automata},
  booktitle = {Conference on Learning Theory COLT},
  year      = {2004},
  pages     = {124--139},
  editor    = {J. Shawe-Taylor and
               Y. Singer},
  publisher = {Springer},
  series    = {LNCS/LNAI},
  volume    = {3120},

}

@INPROCEEDINGS{DenLemTer01,
	AUTHOR = "F. Denis and A. Lemay and A. Terlutte",
	TITLE = "Learning regular languages using {RFSA}",
	BOOKTITLE = "Algorithmic Learning Theory ALT",
	YEAR = 2001,
	month = "",
	volume = "2225",
	editor = "N. Abe and R. Khardon and T. Zeugmann",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "348--363",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@article{DenLemTer2002a,
AUTHOR = "F. Denis and A. Lemay and A. Terlutte",
  title     = {Residual Finite State Automata},
  journal   = fundinform,
  volume    = {51},
  number    = {4},
  year      = {2002},
  pages     = {339--368}, note ={Conference version at STACS 2000}
}

@ARTICLE{DenLemTer2004,
	AUTHOR = "F. Denis and A. L\'emay and A. Terlutte",
	TITLE = "Learning regular languages using {RFSA}s",
	JOURNAL = tcs,
	YEAR = 2004,
	month = "",
	volume = 313,
	number = "",
	pages = "267--294",
	copy = ""
}


@inproceedings{DenEspHab06,
  author    = {F. Denis and
               Y. Esposito and
               A. Habrard},
  title     = {Learning Rational Stochastic Languages},
  booktitle = {Conference on Learning Theory COLT},
  year      = {2006},
  pages     = {274--288},
  editor    = {G. Lugosi and
               H.-U. Simon},
  publisher = {Springer},
  series    = {LNAI/LNCS},
  volume    = {4005},
}


@ARTICLE{DeoQui83,
	   AUTHOR = "N. Deo and M. Quinn",
	   TITLE = "Pascal graphs and their properties",
	   JOURNAL = fiq,
	   YEAR = 1983,
	   VOLUME = 24,
	   NUMBER = 3,
	   PAGES = "203--214",
	   copy = ""
 }


@INPROCEEDINGS{Deretal92,
	AUTHOR = "D. Derencourt and others",
	TITLE = "On computational power of weighted finite automata",
	BOOKTITLE = "Mathematical Foundations of Computer Science",
	YEAR = 1992,
	month = "",
	volume = "629",
	editor = "I.M. Havel and V. Koubek",
	series = "LNCS",
	chapter = "",
	pages = "236--245",
	address = "",
	organization = "",
	copy = ""
}
   

@TECHREPORT{DetPac98,
	AUTHOR = "P. Detti and D. Pacciarelli",
	TITLE = " A Branch and Bound Algorithm for the Minimum Storage-Time Sequencing Problem",
	INSTITUTION = "Department of Computer Science and Automation at
the University of Rome 3",
	YEAR = 1998,
	month = "",
	number = "RT-DIA-36-1998",
	address = "",
	copy = ""
}



@ARTICLE{Deu85,
	AUTHOR = "D. Deutsch",
	TITLE = "Quantum theory, the {C}urch-{T}uring principle and
the universal quantum computer",
	JOURNAL = prsla,
	YEAR = 1985,
	month = "",
	volume = 400,
	number = "",
	pages = "97--117",
	copy = ""
}


@INPROCEEDINGS{DeVJawLuc91,
	crossref = "StoRei91",
	AUTHOR = "R. A. DeVore and B. Jawerth and B. J. Lucier",
	TITLE = "Data compression using wavelets: error, smoothness,
and quantization",
	chapter = "",
	pages = "186--195",
	copy = ""
}


@ARTICLE{DeVJawLuc92,
	AUTHOR = "R. A. DeVore and B. Jawerth and B. J. Lucier",
	TITLE = "Image Compression through wavelet transform coding",
	JOURNAL = ieeetoit,
	YEAR = 1992,
	month = mar,
	volume = 38,
	number = "2",
	pages = "719--746",
	copy = ""
}



@TECHREPORT{Devetal91,
	AUTHOR = "J. Devolder and others",
	TITLE = "Codes and infinite words",
	INSTITUTION = "Laboratoire d'informatique fondamentale de Lille",
	YEAR = 1991,
	month = oct,
	number = "I.T.220",
	address = "",
	copy = ""
}


@INPROCEEDINGS{DeyGieGos03,
	AUTHOR = "T. K. Dey and J. Giesen and S. Goswami",
	TITLE = "Shape segmentation and matching with flow discretization",
	BOOKTITLE = "Algorithms and Data Structures WADS",
	YEAR = 2003,
	month = "",
	volume = "2748",
	editor = "F. Dehne and J.-R. Sack and M. Smid",
	series = "LNCS",
	chapter = "",
	pages = "25--36",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@ARTICLE{DiaSha86,
	AUTHOR = "P. Diaconis and M. Shahshahani",
	TITLE = "Products of random matrices and computer image generation",
	JOURNAL = "Contemporary Mathematics",
	YEAR = 1986,
	month = "",
	volume = 50,
	number = "",
	pages = "173--182",
	copy = ""
}


@ARTICLE{DiaTor90,
	AUTHOR = "J. D\'\i{}az and J. Tor\'an",
	TITLE = "Classes of bounded nondeterminism",
	JOURNAL = mst,
	YEAR = 1990,
	month = "",
	volume = 23,
	number = "",
	pages = "21--32",
	copy = ""
}

@ARTICLE{DiaPetSer2000,
	AUTHOR = "J. D\'\i{}az and J. Petit and M. Serna",
	TITLE = "A survey on graph layout problems",
	JOURNAL = {ACM Computing Surveys},
	YEAR = 2002,
	month = "",
	volume = 34,
	number = "",
	pages = "313--356",
	copy = ""
}


@ARTICLE{Dic13,
	AUTHOR = "L. E. Dickson",
	TITLE = "Finiteness of the odd perfect and primitive abundant numbers with $r$ distinct prime factors",
	JOURNAL = ajm,
	YEAR = 1913,
	month = "",
	volume = 35,
	number = "",
	pages = "413--422",
	copy = ""
}


@ARTICLE{Dic13a,
	AUTHOR = "L. E. Dickson",
	TITLE = "Even abundant numbers",
	JOURNAL = ajm,
	YEAR = 1913,
	month = "",
	volume = 35,
	number = "",
	pages = "423--426",
	copy = ""
}


@INPROCEEDINGS{DidLio98,
	AUTHOR = "W. Didimo and G. Liotta",
	TITLE = "Computing orthogonal drawings in a variable embedding setting",
	BOOKTITLE = "Algorithms and Computation --- 9th International Symposium ISAAC'98",
	YEAR = 1998,
	month = "",
	volume = "1533",
	editor = "K.-Y. Chwa and O. H. Ibarra",
	series = "LNCS",
	chapter = "",
	pages = "79--88",
	address = "",
	organization = "",
	copy = ""
}


@inproceedings{DidGioLio2005,
  author    = {W. Didimo and F. Giordano and G. Liotta},
  title     = {Upward Spirality and Upward Planarity Testing},
  booktitle = {Graph Drawing GD 2005},
  editor    = {P. Healy and
               N. S. Nikolov},
  pages     = {117--128},series = {LNCS},
  volume    = {3843},
  year      = {2006}

}

@inproceedings{Die93,
author          ="M. Dietzfelbinger",
title           ="Simulations between Different Models of Parallel
                 Computers",
series         ="LNCS",
volume          ="710",
booktitle = {Fundamentals of Computation Theory},
		  editor = {Z. Esik},
pages           ="16--30",
year            ="1993"
		  }


@inproceedings{DieHuh94,
author  ="M. Dietzfelbinger and M. H{\"u}hne",
title   ="Matching Upper and Lower Bounds for Simulations of Several Tapes
         on One Multidimensional Tape",
booktitle ="FSTTCS: Foundations of Software Technology and Theoretical
         Computer Science, 14th conference",
		  series = {LNCS},
volume  ="880", editor = {P.S. Thiagarajan},
year    ="1994",
}


@Article{DieKutRei94,
title   ="Exact Lower Time Bounds for Computing {Boolean} Functions on
         {CREW} {PRAMs}",
author  ="Martin Dietzfelbinger and Miros{\l}aw Kuty{\l}owski and
         R{\"u}diger Reischuk",
pages   ="231--254",
journal =jcss,
year    ="1994",
month   =apr,
volume  ="48",
number  ="2",
}


@InProceedings{DieHroSch94,
  title =        "A Comparison of Two Lower Bound Methods for
                 Communication Complexity",
  author =       "M. Dietzfelbinger and J. Hromkovi\v{c} and G. Schnitger",
  editor =       "I. Pr{\'\i}vara and B. Rovan and P. Ruzicka",
  booktitle =    "Mathematical Foundations of Computer Science 1994 19th
                 International Symposium",
  address =      "Kosice, Slovakia",
  month =        "22--26~" # aug,
  year =         "1994",
  series =       "lncs",
  volume =       "841",
  publisher =    "Springer",
  pages =        "326--335",
}

@Article{DieHroSch96,
title       ="A comparison of two lower-bound methods for communication
             complexity",
author      ="Martin Dietzfelbinger and Juraj Hromkovi{\v{c}} and Georg
             Schnitger",
pages       ="39--51",
journal     =tcs,
month       ="10~" # nov,
year        ="1996",
volume      ="168",
number      ="1",
}


@Article{DieKutRei96,
title       ="Feasible Time-Optimal Algorithms for {Boolean} Functions on
             Exclusive-Write Parallel Random-Access Machines",
author      ="Martin Dietzfelbinger and Miros{\l}aw Kuty{\l}owski and
             R{\"u}diger Reischuk",
pages       ="1196--1230",
journal     =siam,
month       =dec,
year        ="1996",
volume      ="25",
number      ="6",
}

@MastersThesis{Dij2007,
author = {C. van Dijk},
title = {Fixed parameter complexity of feedback set problems},
school = {Universiteit Utrecht, The Netherlands},
year = {2007},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = aug,
OPTnote = {},
OPTannote = {}
}

@ARTICLE{Diketal93,
	AUTHOR = "K. Diks and H. N. Djidjev and O. Sykora and I. Vrto",
	TITLE = "Edge separators of planar and outerplanar graphs with applications",
	JOURNAL = jalg,
	YEAR = 1993,
	month = "",
	volume = 14,
	number = "",
	pages = "258--279",
	copy = ""
}


@ARTICLE{DinJohSey01,
	AUTHOR = "G. Ding and T. Johnson and P. Seymour",
	TITLE = "Spanning trees with many leaves",
	JOURNAL = jgth,
	YEAR = 2001,
	month = "",
	volume = {},
	number = "",
	pages = "189--197",
	copy = ""
}



@TECHREPORT{DinSaf01,
	AUTHOR = "I. Dinur and S. Safra",
	TITLE = "The importance of being biased",
	INSTITUTION = "Electronic Colloquium on Computational Complexity (ECCC)",
	YEAR = 2001,
	month = "",
	number = "104", note = {Extended abstract at STOC 2002}, 
	address = "",
	copy = ""
}

@inproceedings{Dinetal03,
	author = {I. Dinur and V. Guruswami and S. Khot and O. Regev},
	title = {A new multilayered {PCP} and the hardness of hypergraph vertex cover},
	booktitle = {Proc. 35th ACM Symp. on Theory of Computing (STOC)},
	year = {2003},
	pages = {595--601},
}

@article{DinSaf2005,
author = "I. Dinur and S. Safra",
title = "On the hardness of approximating
minimum vertex cover",
journal = annmath,
volume = "162",
pages = "439-485",
year = "2005"}

@INPROCEEDINGS{DixPac94,
	AUTHOR = "A. Dix and A. Patrick",
	TITLE = "Query By Browsing",
	BOOKTITLE = " Proceedings of IDS'94: The 2nd International Workshop on User Interfaces to Databases",
	YEAR = 1994,
	month = "",
	volume = "",
	editor = "P. Sawyer",
	series = "",
	chapter = "",
	pages = "236--248",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = "", note={HTML version: \url{http://www.comp.lancs.ac.uk/computing/users/dixa/papers/QbB-IDS94/}}
}


@ARTICLE{Dji85,
	AUTHOR = "H. N. Djidjev",
	TITLE = "A separator theorem for graphs of fixed genus",
	JOURNAL = {Serdica},
	YEAR = 1985,
	month = "",
	volume = 11,
	number = "",
	pages = "319--329",
	copy = ""
}



@ARTICLE{Dji85a,
	AUTHOR = "H. N. Djidjev",
	TITLE = "A linear algorithm for partitioning graphs of fixed genus",
	JOURNAL = {Serdica},
	YEAR = 1985,
	month = "",
	volume = 11,
	number = "",
	pages = "369--387",
	copy = ""
}


@ARTICLE{Dji2000,
	AUTHOR = "H. N. Djidjev",
	TITLE = "Partitioning planar graphs with vertex costs: algorithms and applications",
	JOURNAL = jalg,
	YEAR = 2000,
	month = "",
	volume = 28,
	number = "",
	pages = "51--75",
	copy = ""
}


@INPROCEEDINGS{Dji2000a,
	AUTHOR = "H. N. Djidjev",
	TITLE = "Computing the girth of a planar graph",
	BOOKTITLE = "International Colloquium on Automata, Languages and Programming (ICALP'00)",
	YEAR = 2000,
	month = "",
	volume = "1853",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "821--831",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@ARTICLE{DjiGil99,
	AUTHOR = "H. N. Djidjev and J. R. Gilbert",
	TITLE = "Separators in Graphs with Negative and Multiple Vertex Weights",
	JOURNAL = alg,
	YEAR = 1999,
	month = "",
	volume = 23,
	number = "",
	pages = "57--71",
	copy = ""
}


@INPROCEEDINGS{DjiVen95,
	AUTHOR = "H. Djidjev and S. Venkatesan",
	TITLE = "Planarization of Graphs Embedded on Surfaces",
	BOOKTITLE = "Proc. 21st Workshop on Graph-Theoretic Concepts in Computer Science (WG '95)",
	YEAR = 1995,
	month = "",
	volume = "1017",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "62--72",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@ARTICLE{DjiVen97,
	AUTHOR = "H. Djidjev and S. Venkatesan",
	TITLE = "Reduced constants for simple cycle graph separation",
	JOURNAL = actainform,
	YEAR = 1997,
	month = "",
	volume = 34,
	number = "",
	pages = "231--243",
	copy = ""
}

@ARTICLE{DjiVrt2003,
	AUTHOR = "H. Djidjev and I. Vrt\'{}o",
	TITLE = "Crossing numbers and cutwidths",
	JOURNAL = {Journal of Graph Algorithms and Applications},
	YEAR = 2003,
	month = "",
	volume = 7,
	number = "",
	pages = "245--251",
	copy = ""
}

@InProceedings{DodMarMor2000,
author = {Doddi, S. and Marathe, M. and Moret, B.M.E.},
title = {Point labeling with specified positions},
booktitle = {Proc. 16th Ann. ACM Symp. on Comput. Geometry (SoCG 2000)},
OPTcrossref = {},
OPTkey = {},
OPTpages = {182--190},
OPTyear = {2000},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}

@INBOOK{DoeLin83,
	AUTHOR = "M. de Does and A. Lindenmayer",
	TITLE = "Algorithms for the generation and drawing of maps
representing cell clones",
	PAGES = "39--57",
	PUBLISHER = "Berlin: Springer",
	YEAR = 1983,
	volume = 153,
	series = "LNCS",
	copy = ""
}


@INPROCEEDINGS{terDoe94,
	AUTHOR = "H. ter Doest",
	TITLE = "Stochastic languages and stochastic grammars",
	BOOKTITLE = "GRONICS-94; Proceedings of the 1994 Groningen
Student Conference on Computer Science",
	YEAR = 1994,
	month = "",
	volume = "",
	editor = "H.M. Groenbaum and H.W. Kleijn-Hesselink and M.M. Lankhast",
	series = "",
	chapter = "",
	pages = "51--59",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{Dometal2004,
	AUTHOR = "M. Dom and J. Guo and F. H{\"u}ffner  and R. Niedermeier",
	TITLE = "Error Compensation in Leaf Root Problems",
	BOOKTITLE = "Algorithms and Computation: 15th International Symposium ISAAC 2004",
	YEAR = 2004,
	month = "",
	volume = "3341",
	editor = "R. Fleischer and G. Trippen",
	series = "LNCS",
	chapter = "",
	pages = "389--401",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{Dometal2006,
	AUTHOR = "M. Dom and J. Guo and F. H{\"u}ffner  and R. Niedermeier and A. Tru\ss",
	TITLE = "Fixed-parameter tractability results for feedback set problems in tournaments",
	BOOKTITLE = "Conference on Algorithms and Complexity CIAC",
	YEAR = 2006,
	month = "",
	volume = "3998",
	editor = " T. Calamoneri and I. Finocchi and G. F. Italiano",
	series = "LNCS",
	chapter = "",
	pages = "320--331",
	address = "",
	organization = "",
        publisher = "Springer", 
	copy = ""
}



@Article{Dometal2008,
author = {M. Dom and J. Guo   and R. Niedermeier and S. Wernicke},
title = {Red-blue covering problems and the consecutive ones property},
journal = jda,
year = {2008},
OPTkey = {},
volume = {6},
OPTnumber = {},
pages = {393--407},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@Article{DomHri93,
  author =       "V. Domocos and F. Hristea",
  title =        "A Codification of Column-Convex Polyominoes which
                 Generates a Regular Language",
  journal =      eatcs,
  volume =       "50",
  year =         "1993", pages = {197--208}
}


@INPROCEEDINGS{Dometal92,
	AUTHOR = "P. D{\"o}m{\"o}si and others",
	TITLE = "Some combinatorial properties of words, and the {C}homsky hierarchy",
	BOOKTITLE = "Proc. Internat. Conf. ``Words, Languages and Combinatorics, II'', Kyoto, Japan; eds.: M. Ito and H. J{\"u}rgensen",
	YEAR = 1992,
	month = "",
	volume = "",
	editor = "",
	series = "", publisher = {Singapore: World Scientific},
	chapter = "",
	pages = "105--123",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{Dometal93,
	AUTHOR = "P. D{\"o}m{\"o}si and others",
	TITLE = "Formal languages consisting of primitive words",
	BOOKTITLE = "FCT 1993, Szeged",
	YEAR = 1993,
	month = "",
	volume = "710",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "194--203",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{DomKud02,
	AUTHOR = "P. D{\"o}m{\"o}si and M. Kudlek",
	TITLE = "Iteration lemmata for context-free and linear indexed languages",
	JOURNAL = publmath,
	YEAR = 2002,
	month = "",
	volume = {Supplement 60},
	number = "",
	pages = "1--18",
	copy = ""
}


@inbook{Don91,
  author = 	 "G. Dong",
  chapter = 	 "Theoretical Studies in Computer Science, J.D. Ullman eds",
  title = 	 "On Datalog Linearization of Chain Queries",
  publisher =	 "Academic Press",
  year =	 1991,
  pages =	 "181-206"
}

		  @INPROCEEDINGS{Don92,
	AUTHOR = "G. Dong",
	TITLE = "Grammar Tools and Characterizations",
	BOOKTITLE = "Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database
Systems (PODS'92)",
	YEAR = 1992,
	month = jun,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "81--90",
	address = "",
	organization = "ACM",
	copy = ""
}

@ARTICLE{Don95,
	AUTHOR = "G. Dong",
	TITLE = "On the index of positive programmed formal languages",
	JOURNAL = ipl,
	YEAR = 1995,
	month = "",
	volume = 54,
	number = "",
	pages = "105--110",
	copy = ""
}

@ARTICLE{DonGin95,
	AUTHOR = "G. Dong and S. Ginsburg",
	TITLE = "On Decompositions of Chain Datalog Programs into {${\cal P}$} (left-)linear
     1-rule Components",
	JOURNAL = jlp,
	YEAR = 1995,
	month = "",
	volume = 23,
	number = "",
	pages = "203--236",
	copy = ""
}
@article{DonSuTop95,
  author =       "G. Dong and J. Su and R. Topor",
  title =        "Nonrecursive Incremental  Evaluation of Datalog Queries",
  journal =      "Annals of Mathematics and Artificial Intelligence",
  year =         1995,
  volume =       14,
  number =       "2-4",
  pages =        "187-223",
  annote =      "(Also appeared as Uni Melbourne CS TR 93/3, March 1993)",
   note    =    {Festschrift in honor of Jack Minker.}
}

@INPROCEEDINGS{Don94,
	crossref = "WooJen94",
	AUTHOR = "P. Dongha",
	TITLE = "Toward a formal model of commitment for resource
                  bounded agents",
	chapter = "Part I: Theories",
	pages = "86--101",
	copy = ""
}

@article{DorHen2006,
  author    = {M. Dorfling and
               M. A. Henning},
  title     = {A note on power domination in grid graphs},
  journal   = dam,
  volume    = {154},
  number    = {6},
  year      = {2006},
  pages     = {1023--1027},
}

@MASTERSTHESIS{Dor2003,
	AUTHOR = "F. Dorn",
	TITLE = " Tuning Algorithms for Hard Planar Graph Problems",
	SCHOOL = "Universit{\"a}t T{\"u}bingen",
	YEAR = 2003,
 	month = jan,
	address = "",
	type = "Studienarbeit",
	copy = ""
}


@MASTERSTHESIS{Dor2004,
	AUTHOR = "F. Dorn",
	TITLE = "Special Branch Decomposition: A Natural Link between Tree Decompositions and Branch Decompositions",
	SCHOOL = "Universit{\"a}t T{\"u}bingen",
	YEAR = 2004,
 	month = apr,
	address = "",
	type = "Diplomarbeit",
	copy = ""
}

@TECHREPORT{DorTel2005,
	AUTHOR = "F. Dorn and J.~A. Telle",
	TITLE = "Dynamic programming on tree-decompositions versus branch-decompositions",
	INSTITUTION = "Department of Informatics, University of Bergen, Norway",
	YEAR = 2005,
	month = apr,
	number = "293",
	address = "",
	copy = ""
}

@INPROCEEDINGS{Doretal2005,
	AUTHOR = "F. Dorn and E. Penninkx and H. L. Bodlaender and F. V. Fomin",
	TITLE = "Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions",
	BOOKTITLE = "European Symposium on Algorithms ESA",
	YEAR = 2005,
	month = "",
	volume = "3669",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "95--106",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}
@inproceedings{Dor2006,
  author    = {F. Dorn},
  title     = {Dynamic Programming and Fast Matrix Multiplication},
  booktitle = {Algorithms --- ESA 2006, 14th Annual European Symposium},
  year      = {2006},
  pages     = {280--291},
  editor    = {Y. Azar and
               T. Erlebach},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4168},
}

@inproceedings{DorFomThi2007,
  author    = {F. Dorn and
               F. V. Fomin and
               D. M. Thilikos},
  title     = {Subexponential Parameterized Algorithms},
  booktitle = {Automata, Languages and Programming ICALP},
  year      = {2007},
  pages     = {15--27},
  editor    = {L. Arge and
               C. Cachin and
               T. Jurdzinski and
               A. Tarlecki},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4596},
}

@INBOOK{Dou74,
        title = {L Systems}, editor = {G. Rozenberg and A. Salomaa},
	chapter = "P. G. Doucet: The syntactic inference problem for {D0L}-sequences",
	PAGES = "146--161",
	PUBLISHER = "Berlin: Springer",
	YEAR = 1974,
	VOLUME = 15,
	SERIES = "LNCS",
	copy = ""
}

@PHDTHESIS{Dou76,
AUTHOR = 	"P. Doucet",
TITLE = 	"Studies on {L}-systems",
school = 	"Univ. of Utrecht",
YEAR = 	"1976",
ADDRESS = 	"",
MONTH = 	"",
note = 	""
}


@PHDTHESIS{Dow74,
	AUTHOR = "P. J. Downey",
	TITLE = "Formal languages and recursion schemes",
	SCHOOL = "Center for Research in Computing Technology; Harvard
University",
	YEAR = 1974,
 	month = "",
	address = "Cambridge (MA); USA",
	type = "",
	copy = ""
}

@INPROCEEDINGS{Dow2003,
	AUTHOR = "R. G. Downey",
	TITLE = "Parameterized Complexity for the Skeptic",
	BOOKTITLE = "18th IEEE Annual Conference on Computational Complexity",
	YEAR = 19,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "147--170",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}


@InProceedings{DowFel92, 
 author ="R. G. Downey and M. R. Fellows", 
 title = "Fixed-Parameter Intractability (Extended Abstract)", 
 booktitle = "SCT: Annual Conference on Structure in Complexity Theory", 
 year = "1992", 
pages = {36--49}
} 

@InProceedings{Dowetal94, 
 author="R. G. Downey and M. R. Fellows and B. M. Kapron and
                  M. T. Hallett and H. T. Wareham", 
 title= "The Parameterized Complexity of Some Problems in Logic and Linguistics", 
 booktitle ="LFCS: The 3rd International Symposium on Logical Foundations of Computer Science", 
 year = "1994", 
} 



@InCollection{DowFel93, 
 author ="R. G. Downey and M. R. Fellows", 
 title = "Fixed Parameter Tractability and Completeness {III}", 
 booktitle = "Complexity Theory: Current Research, Edited by Klaus Ambos-Spies, Steven Homer, and Uwe
          Sch{\"o}ning, Cambridge University Press", 
 year = "1993", 
pages = "191--225"
} 


@Article{DowFel95, 
 author = "R. G. Downey and M. R. Fellows", 
 title = "Fixed-Parameter Tractability and Completeness {I}: Basic Results", 
 journal = siam, 
		  pages = "873--921", 
		  number = 4,
 volume = "24", 
 year = "1995", 
} 


@Article{DowFel95a, 
 author = "R. G. Downey and M. R. Fellows", 
 title ="Fixed-Parameter Tractability and Completeness {II}: On Completeness for {W}[1]", 
 journal = tcs,
 volume = "141", 
 year="1995", 
pages = {109--131}} 


@INproceedings{DowFel95b,
	AUTHOR = "R. G. Downey  and M. R. Fellows",
	TITLE = "Parameterized computational feasibility",
booktitle = {P. Clote, J. Remmel (eds.): Feasible Mathematics II},
	PAGES = "219--244",
	PUBLISHER = "Boston: Birkh{\"a}user",
	YEAR = 1995,
	VOLUME = {},
	SERIES = "",
	copy = ""
}


@TECHREPORT{Dowetal97,
	AUTHOR = "R. G. Downey and others",
	TITLE = "The parameterized complexity of some fundamental problems in coding theory",
	INSTITUTION = "CDMTCS",
	YEAR = 1997,
	month = aug,
	number = "052",
	address = "",
	copy = ""
}


@Article{DowFel98,
  title =        "Threshold dominating sets and an improved
                 characterization of~{$W[2]$}",
  author =       "R. G. Downey and M. R. Fellows",
  pages =        "123--140",
  journal =      tcs,
  month =        "6~" # dec,
  year =         "1998",
  volume =       "209",
  number =       "1--2",
}

@INCOLLECTION{DowFelSte99,
	AUTHOR = "R. G. Downey and M. R. Fellows and U. Stege",
	TITLE = "Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability",
	BOOKTITLE = "Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future",
	PUBLISHER = "",
	YEAR = 1999,
	month = "",
	volume = "49",
	editor = "",
	series = "DIMACS Series in Discrete Mathematics and Theoretical Computer Science",
	chapter = "",
	pages = "49--99",
	address = "",
	type = "",
	copy = ""
}

@article{DowFelSte99a,
	AUTHOR = "R. G. Downey and M. R. Fellows and U. Stege",
	TITLE = "Computational tractability: the view from {M}ars",
journal = eatcs,
	YEAR = 1999,
	month = "",
	volume = "69",
	editor = "",
	pages = "49--99",
	address = "",
	type = "",
	copy = ""
}


@ARTICLE{DowFelRam2000,
	AUTHOR = "R. G. Downey and M. R. Fellows and V. Raman",
	TITLE = "The complexity of irredundant set parameterized by size",
	JOURNAL = dam,
	YEAR = 2000,
	month = "",
	volume = 100,
	number = "",
	pages = "155--167",
	copy = ""
}


@INPROCEEDINGS{DowMcC2004,
	AUTHOR = "R. G. Downey and C. McCartin",
	TITLE = "Some New Directions and Questions in Parameterized Complexity",
	BOOKTITLE = "Developments in Language Theory: 8th International Conference, DLT 2004",
	YEAR = 2004,
	month = "",
	volume = "3340",
	editor = "C. S. Calude and E. Calude and M. J. Dinneen",
	series = "LNCS",
	chapter = "",
	pages = "12--26",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@inproceedings{DowMcC2005,
   Author = {Downey, R. G. and McCartin, C.},
   Title = {Bounded Persistence Pathwidth},
   BookTitle = {Eleventh Computing: The Australasian Theory Symposium (CATS2005)},
   Editor = {Atkinson, M. and Dehne, F.},
   Series= {CRPIT},
   Address= {Newcastle, Australia},
   Publisher = {ACS (Australian Computer Society)},
   Volume = {41},
   Pages = {51--56},
   Year = {2005} }

@inproceedings{DowFelMcC2006,
  author    = {R. G. Downey and
               M. R. Fellows and
               C. McCartin},
  title     = {Parameterized Approximation Problems},
  booktitle = {Parameterized and Exact Computation IWPEC},
  year      = {2006},
  pages     = {121--129},
  editor    = {H. L. Bodlaender and
               M. A. Langston},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4169},
}

@INPROCEEDINGS{Dreetal94,
	AUTHOR = "F. Drewes and others",
	TITLE = "Generating self-affine fractals by collage grammars",
	BOOKTITLE = "Developments in Language Theory (Turku, 1993)",
	YEAR = 1994,
	month = "",
	PUBLISHER = "Singapore: World Scientific",
	volume = "",
	editor = "G. Rozenberg and A. Salomaa",
	series = "",
	chapter = "",
	pages = "--",
	address = "",
	organization = "",
	copy = ""
}


@ARTICLE{Dreetal95,
	AUTHOR = "F. Drewes and others",
	TITLE = "Generating self-affine fractals by collage grammars",
	JOURNAL = tcs,
	YEAR = 1995,
	month = "",
	volume = 145,
	number = "",
	pages = "159--187",
	copy = ""
}



@ARTICLE{Dre96,
	AUTHOR = "F. Drewes",
	TITLE = "Language-theoretic and algorithmic properties of $d$-dimensional collages and patterns in a grid",
	JOURNAL = jcss,
	YEAR = 1996,
	month = "",
	volume = 53,
	number = "",
	pages = "33--60",
	copy = ""
}


@ARTICLE{Dre2000,
	AUTHOR = "F. Drewes",
	TITLE = "Tree-based picture generation",
	JOURNAL = tcs,
	YEAR = 2000,
	month = "",
	volume = 246,
	number = "",
	pages = "1--51",
	copy = ""
}

@inproceedings{DreKle2000,
  author    = {F. Drewes and
               R. Klempien-Hinrichs},
  title     = {Picking Knots from Trees --- The Syntactic Structure of Celtic
               Knotwork},
  booktitle = {Theory and Application of Diagrams, First International
               Conference, Diagrams 2000},
  year      = {2000},
  pages     = {89-104},
  editor    = {M. Anderson and
               P. Cheng and
               V. Haarslev},
  publisher = {Springer},
  series    = {LNCS/LNAI}, 
  volume    = {1889},
}

@ARTICLE{Dre2001,
	AUTHOR = "F. Drewes",
	TITLE = "Tree-based  generation of languages of fractals",
	JOURNAL = tcs,
	YEAR = 2001,
	month = "",
	volume = 262,
	number = "",
	pages = "377--414",
	copy = ""
}


@ARTICLE{DreKre96,
        AUTHOR = "F. Drewes and H.-J. Kreowski",
        TITLE = "(Un)decidability of geometric properties of pictures
		  generated by collage grammars",
	JOURNAL = fundinform,
	YEAR = 1996,
	month = "",
	volume = 25,
	number = "3",
	pages = "295--325",
	copy = ""
}

@ARTICLE{Dreetal2005,
	AUTHOR = "F. Drewes and C. du Toit and S. Ewert and B. van der Merwe and A. P. J. van der Walt",
	TITLE = "Random context tree grammars and tree transducers",
	JOURNAL = {South African Computer Journal},
	YEAR = 2005,
	month = "",
	volume = 34,
	number = "",
	pages = "11--25",
	copy = ""
}
	 
@INPROCEEDINGS{Dreetal2006,
	AUTHOR = "F. Drewes and C. du Toit and S. Ewert and B. van der Merwe and A. P. J. van der Walt",
	TITLE = "Bag Context Tree Grammars",
	BOOKTITLE = "Developments in Language Theory DLT",
	YEAR = 2006,
	month = "",
	volume = "4036",
	editor = "O. H. Ibarra and Z. Dang",
	series = "LNCS",
	chapter = "",
	pages = "226--237",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@PHDTHESIS{Dre2000a,
	AUTHOR = "P.~A. Dreyer",
	TITLE = "Applications and Variations of Domination in Graphs",
	SCHOOL = "Rutgers University, New Jersey, USA",
	YEAR = 2000,
 	month = "",
	address = "{PhD} Thesis",
	type = "",
	copy = ""
}

@ARTICLE{DroTur89,
	AUTHOR = "V. Drobot and J. Turner",
	TITLE = "Hausdorff dimension and {P}erron-{F}robenius theory",
	JOURNAL = illjm,
	YEAR = 1989,
	month = "",
	volume = 33,
	number = "1",
	pages = "1--9",
	copy = ""
}



@INPROCEEDINGS{DuWanXu01,
	AUTHOR = "D. Du and L. Wang and B. Xu",
	TITLE = "The {E}uclidian bottleneck {S}teiner tree and {S}teiner tree with mimimum number of {S}teiner points",
	BOOKTITLE = "Computing and Combinatorics, Proceedings COCOON 2001",
	YEAR = 2001,
	month = "",
	volume = "2108",
	editor = "J. Wang",
	series = "LNCS",
	chapter = "",
	pages = "509--518",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@Article{DuEmeJu2006,
author = {Q. Du and M. Emelianenko and L. Ju},
title = {Convergence of the {L}loyd algorithm for computing centroidal {V}oronoi tessellations},
journal = {SIAM Journal on Numerical Analysis},
year = {2006},
OPTkey = {},
volume = {44},
OPTnumber = {},
pages = {102--119},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}


@ARTICLE{DuaHolBel2000,
	AUTHOR = "Z. Duan and M. Holcombe and A. Bell",
	TITLE = "A logic for biological systems",
	JOURNAL = {BioSystems},
	YEAR = 2000,
	month = "",
	volume = 55,
	number = "",
	pages = "93--105",
	copy = ""
}


@INPROCEEDINGS{Dub93b,
        AUTHOR = "S. Dube",
        TITLE = "Using fractal geometry for solving divide-and-conquer
		  recurrences (Extended Abstract)",
BOOKTITLE = "Algorithms and Computation; 4th International Colloquium,
		  ISAAC'93; Hong Kong, December 15--17, 1993",
        year = 1993,
volume = "",
	series = "LNCS",
        pages = {191--200},
	copy = ""
}


@ARTICLE{Dub94,
        AUTHOR = "S. Dube",
        TITLE = "Fractal geometry, {T}uring machines and divide-and-conquer recurrences",
	JOURNAL = rairoita,
        year = 1994,
	month = "",
	volume = 28,
	number = "3--4",
	pages = "405--423",
	copy = ""
}


@ARTICLE{Dub95,
        AUTHOR = "S. Dube",
        TITLE = "Using fractal geometry for solving divide-and-conquer recurrences",
	JOURNAL = jaumsb,
	YEAR = 1995,
	month = "",
	volume = 37,
	number = "",
	pages = "145--171",
	copy = ""
}



@ARTICLE{DubPra79,
	AUTHOR = "D. Dubois and H. Prade",
	TITLE = "Operations in a fuzzy-valued logic",
	JOURNAL = icalt,
	YEAR = 1979,
	month = "",
	volume = 43,
	number = "",
	pages = "224--240",
	copy = ""
}

@INPROCEEDINGS{Dub82,
	AUTHOR = "S. Dubuc",
	TITLE = "Une foire de courbe sans tangentes",
	BOOKTITLE = "Acualit\'es math\'ematiques. Actes du 6-i\'eme
congr\`es du groupement des math\'ematiciens d'expression latine",
	PUBLISHER = "Paris: Gauthier-Villars",
	YEAR = 1982,
	pages = "99--123",
	copy = ""
}

@ARTICLE{Dub85,
	AUTHOR = "S. Dubuc",
	TITLE = "Une \'equation fonctionelle pour diverses
constructions g\'eom\'etriques",
	JOURNAL = annsmq,
	YEAR = 1985,
	month = "",
	volume = 9,
	number = "",
	pages = "151--174",
	copy = ""
}

@ARTICLE{Dubetal89,
	AUTHOR = "B. Dubuc and others",
	TITLE = "Evaluating the fractal dimension of profiles",
	JOURNAL = pra,
	YEAR = 1989,
	month = feb,
	volume = 39,
	number = "3",
	pages = "1500--1512",
	copy = ""
}

@INPROCEEDINGS{DubNek90,
	AUTHOR = "S. Dubuc and F. Nekka",
	TITLE = "???",
	BOOKTITLE = "FRACTALS",
	YEAR = 1990,
	PAGES = "",
	ORGANIZATION = "IFIP",
	copy = ""
}

@INPROCEEDINGS{Duc90,
	AUTHOR = "W. D{\"u}chting",
	TITLE = "Modeling and simulation of cancer gorwth and treatment",
	BOOKTITLE = "ICARCV'90: International conference on automation, robotics and computer vision",
	YEAR = 1990,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "", publisher = {Singapore: McGraw-Hill},
	pages = "734--737",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{Duc90a,
	AUTHOR = "W. D{\"u}chting",
	TITLE = "Tumor growth simulation",
	JOURNAL = cag,
	YEAR = 1990,
	month = "",
	volume = 14,
	number = "3/4",
	pages = "505--508",
	copy = ""
}
@Article{Duc2002,
author = {W. Duckworth},
title = {Minimum connected dominating sets of random cubic graphs},
journal = {The Electronic Journal of Combinatorics},
year = {2002},
OPTkey = {},
volume = {9},
OPTnumber = {},
OPTpages = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@ARTICLE{DucManZit2005,
	AUTHOR = "W. Duckworth and D. F. Manlove and M. Zito",
	TITLE = "On the approximability of the maximum induced matching problem",
	JOURNAL = jda,
	YEAR = 2005,
	month = "",
	volume = 3,
	number = "",
	pages = "79--91",
	copy = ""
}

@INPROCEEDINGS{Dujetal01,
	AUTHOR = "V. Dujmovi{\'c} and M.~R. Fellows and M. Hallett and M. Kitching and G. Liotta and C. McCartin and N. Nishimura and P. Ragde and F.~A. Rosamond and  M. Suderman and S. Whitesides and D.~R. Wood",
	TITLE = "On the Parameterized Complexity of Layered Graph Drawing",
	BOOKTITLE = "9th Annual European Symposium on Algorithms ESA",
	YEAR = 2001,
	month = "",
	volume = "2161",
	editor = "F. Meyer auf der Heide",
	series = "LNCS",
	chapter = "",
	pages = "488--499",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@inproceedings{Dujetal01a,
  AUTHOR =	 "V. Dujmovi{\'c} and M.~R. Fellows and M. Hallett and
                  M. Kitching and G. Liotta and C. McCartin and
                  N. Nishimura and P. Ragde and F.~A. Rosamond and
                  M. Suderman and S. Whitesides and D. R. Wood",
  TITLE =	 "A Fixed-Parameter Approach to Two-Layer
                  Planarization",
  CROSSREF =	 "GD01",
  PAGES =	 "1-15"
}

@ARTICLE{Dujetal2006,
	AUTHOR = "V. Dujmovi{\'c} and M.~R. Fellows and M. Hallett and
                  M. Kitching and G. Liotta and C. McCartin and
                  N. Nishimura and P. Ragde and F.~A. Rosamond and
                  M. Suderman and S. Whitesides and D. R. Wood",
	TITLE = "A Fixed-Parameter Approach to 2-Layer
                  Planarization",
	JOURNAL = alg,
	YEAR = 2006,
	month = "",
	volume = 45,
	number = "",
	pages = "159--182",
	copy = ""
}



@INPROCEEDINGS{DujFerKau04,
	AUTHOR = "V. Dujmovi{\'c} and H. Fernau and M. Kaufmann",
	TITLE = "Fixed parameter algorithms for one-sided crossing minimization revisited",
	BOOKTITLE = "Graph Drawing, 11th International Symposium GD 2003",
	YEAR = 2004,
	month = "",
	volume = "2912",
	editor = "G. Liotta",
	series = "LNCS",
	chapter = "",
	pages = "332--344",
	address = "",
	organization = "",
        publisher = "Springer",
note = "A journal version has been accepted to " # jda, 
	copy = ""
}

@Article{DujFerKau2008,
author = {V. Dujmovi{\'c} and H. Fernau and M. Kaufmann},
title = {Fixed parameter algorithms for one-sided crossing minimization revisited},
journal = jda,
year = {2008},
OPTkey = {},
volume = {6},
OPTnumber = {},
pages = {313--323},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@INPROCEEDINGS{DujWhi02,
	AUTHOR = "V. Dujmovi{\v c} and S. Whitesides",
	TITLE = "An efficient fixed parameter tractable algorithm for 1-sided crossing minimization",
	BOOKTITLE = "Graph Drawing GD 2002",
	YEAR = 2002,
	month = "",
	volume = "2528",
	editor = "M.~T. Goodrich and S.~G. Kobourov",
	series = "LNCS",
	chapter = "",
	pages = "118--129",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@ARTICLE{DujWhi2004,
	AUTHOR = "V. Dujmovi{\'c} and S. Whitesides",
	TITLE = "An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization",
	JOURNAL = alg,
	YEAR = 2004,
	month = "",
	volume = 40,
	number = "",
	pages = "15--32",
	copy = ""
}

@ARTICLE{DujMorWoo2005,
	AUTHOR = "V. Dujmovi{\'c} and P. Morin and D. R. Wood",
	TITLE = "Layout of Graphs with Bounded Tree-Width",
	JOURNAL = siam,
	YEAR = 2005,
	month = "",
	volume = {??},
	number = "",
	pages = "553--579",
	copy = ""
}


@PHDTHESIS{Dul89,
	AUTHOR = "W. Dulz",
	TITLE = "Koppelsprachen. {E}ine kontextsensitive
{E}erweiterung der kontextfreien {S}prachen",
	SCHOOL = "Universit{\"a}t Erlangen-N{\"u}rnberg (Germany)",
	YEAR = 1989,
 	month = "",
	address = "",
	type = "",
	copy = ""
}

@ARTICLE{DulGou90,
	AUTHOR = "S. Dulucq and D. Gouyou-Beauchamps",
	TITLE = "Sur les facteurs des suites de {S}turm",
	JOURNAL = tcs,
	YEAR = 1990,
	month = "",
	volume = 71,
	number = "",
	pages = "381--400",
	copy = ""
}

@ARTICLE{Dum96,
	AUTHOR = "S. Dumitrescu",
	TITLE = "Nonreturning {PC} grammar systems can be simulated by
     returning systems",
	JOURNAL = tcs,
	YEAR = 1996,
	month = "",
	volume = 165,
	number = "2",
	pages = "463--474",
	copy = ""
}

@ARTICLE{DumPau97,
	AUTHOR = "S. Dumitrescu and Gh. P\u aun",
	TITLE = "On the power of parallel communicating grammar systems with right-linear components",
	JOURNAL = rairoita,
	YEAR = 1997,
	month = "",
	volume = 31,
	number = "4",
	pages = "331--354",
	copy = ""
}

@ARTICLE{DumTho89,
	AUTHOR = "J.-M. Dumont and A. Thomas",
	TITLE = "Syst\`emes de num\'eration et fonctions fractales
relatifs aux substitutions",
	JOURNAL = tcs,
	YEAR = 1989,
	month = "",
	volume = 65,
	number = "",
	pages = "153--169",
	copy = ""
}
@article{DupFinRes2001,
  author    = {J. Duparc and
               O. Finkel and
               J.-P. Ressayre},
  title     = {Computer science and the fine structure of {B}orel sets},
  journal   = tcs,
  volume    = {257},
  year      = {2001},
  pages     = {85--105},
}

@INPROCEEDINGS{Dup96,
	AUTHOR = "P. Dupont",
	TITLE = "Incremental Regular Inference",
	BOOKTITLE = "Proceedings of the Third International Colloquium on
                 Grammatical Inference ({ICGI}-96): Learning Syntax from
                 Sentences",
	YEAR = 1996,
	month = "",
	volume = "1147",
	editor = "",  publisher =    "Springer",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "222--237",
	address = "",
	organization = "",
	copy = ""
}

@TECHREPORT{DupMic98,
	AUTHOR = "P. Dupont and L. Miclet",
	TITLE = "Inf\'erence grammaticale r\'eguli\`ere: fondements th\'eoriques et principaux algorithmes",
	INSTITUTION = "INRIA",
	YEAR = 1998,
	month = "",
	number = "RR-3449",
	address = "",
	copy = ""
}

@InProceedings{DupMicVid94,
  author =       "P. Dupont and L. Miclet and E. Vidal",
  title =        "What is the search space of the Regular Inference?",
  pages =        "25--37",
  editor =       "R. C. Carrasco and J. Oncina",
  booktitle =    "Proceedings of the Second International Colloquium on
                 Grammatical Inference ({ICGI}-94): Grammatical Inference and Applications",
  series =       "LNCS/LNAI",
  volume =       "862",
  publisher =    "Springer",
  year =         "1994",
}

@article{DupDenEsp05,
  author    = {P. Dupont and
               F. Denis and
               Y. Esposito},
  title     = {Links between probabilistic automata and hidden {M}arkov models:
               probability distributions, learning models and induction
               algorithms},
  journal   = patrec,
  volume    = {38},
  number    = {9},
  year      = {2005},
  pages     = {1349--1371},
}

@ARTICLE{DusPar84,
	AUTHOR = "J. Duske and R. Parchmann",
	TITLE = "Linear indexed languages",
	JOURNAL = tcs,
	YEAR = 1984,
	month = "",
	volume = 32,
	number = "",
	pages = "47--60",
	copy = ""
}

@ARTICLE{DutHay90,
	AUTHOR = "S. Dutt and J. P. Hayes",
	TITLE = "On designing and reconfiguring $k$-fault-tolerant tree architectures",
	JOURNAL = ieeetoc,
	YEAR = 1990,
	month = "",
	volume = 39,
	number = "4",
	pages = "490--503",
	copy = ""
}

@ARTICLE{DutHay92,
	AUTHOR = "S. Dutt and J. P. Hayes",
	TITLE = "Some practical issues in the design of fault-tolerant multiprocessors",
	JOURNAL = ieeetoc,
	YEAR = 1992,
	month = "",
	volume = 41,
	number = "5",
	pages = "588--598",
	copy = ""
}

@ARTICLE{Duv79,
	AUTHOR = "J. P. Duval",
	TITLE = "P\'eriodes et r\'ep\'etitions des mots du monoide libre",
	JOURNAL = tcs,
	YEAR = 1979,
	month = "",
	volume = 9,
	number = "",
	pages = "17--26",
	copy = ""
}
@ARTICLE{Duv83,
	AUTHOR = "J. P. Duval",
	TITLE = "Factorizing words over an ordered alphabet",
	JOURNAL = jalg,
	YEAR = 1983,
	month = "",
	volume = 4,
	number = "",
	pages = "363--381",
	copy = ""
}

@InProceedings{Dwoetal2001,
author = {C. Dwork and R. Kumar and M. Naor and D. Sivakumar},
title = {Rank aggregation methods for the web},
booktitle = {WWW10},
OPTcrossref = {},
OPTkey = {},
pages = {613--622},
year = {2001},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
organization = {ACM},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}

@ARTICLE{DyeFri86,
	AUTHOR = "M. E. Dyer and A. M. Frieze",
	TITLE = "Planar {3DM} is {NP}-complete",
	JOURNAL = jalg,
	YEAR = 1986,
	month = "",
	volume = 7,
	number = "",
	pages = "174--184",
	copy = ""
}

@InProceedings{DyeYanYas2008,
author = {D. Dyer and
               B. Yang and
               {\"O}. Ya\c{s}ar},
  title     = {On the Fast Searching Problem},
booktitle = {Algorithmic Aspects in Information and Management AAIM 2008},
OPTcrossref = {},
OPTkey = {},
pages = {143--154},
year = {2008},
editor = {R. Flei\-scher and J. Xu},
volume = {5034},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}

@INPROCEEDINGS{DymRuz86,
	AUTHOR = "P. W. Dymond and W. L. Ruzzo",
	TITLE = "Parallel {RAM}'s with owned global memory and
		  deterministic context-free language recognition",
	BOOKTITLE = "Automata, Languages and Programming",
	YEAR = 1986,
	month = "",
	volume = "226",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "95--104",
	address = "",
	organization = "",
	copy = ""
}

     @Article{Dym88,
       author =       "P. Dymond",
       title =        "Input-driven languages are in {$\log n$} depth",
       journal =      ipl,
       volume =       "26",
       number =       "5",
       pages =        "247--250",
       month =        jan,
       year =         "1988"
		  }

@ARTICLE{Dymetal96,
	AUTHOR = "P. Dymond and others",
	TITLE = "Pointers versus arithmetic in {PRAM}s",
	JOURNAL = jcss,
	YEAR = 1996,
	month = "",
	volume = 53,
	number = "",
	pages = "218--232",
	copy = ""
}

@TechReport(DymRuz97,
 Author=      "Dymond, P. and Ruzzo, W.",
 Title=       "Parallel {RAM}s with owned global memory and deterministic
		 context-free language recoginition",
 Institution= "York University, Department of Computer Science",
 Type=        "Techn. Report",
 Number=      "CS-97-02",
 Year=        "1997")

EEEE
@ARTICLE{EadLinSmy93,
	AUTHOR = "P. Eades and X. Lin and W.~F. Smyth",
	TITLE = "A fast \& effective heuristic for the feedback arc set problem",
	JOURNAL = ipl,
	YEAR = 1993,
	month = "",
	volume = 47,
	number = "",
	pages = "319--323",
	copy = ""
}
@ARTICLE{EadLin95,
	AUTHOR = "P. Eades and X. Lin",
	TITLE = "A heuristic for the feedback arc set problem",
	JOURNAL = {Australasian Journal of Combinatorics},
	YEAR = 1995,
	month = "",
	volume = 12,
	number = "",
	pages = "15--25",
	copy = ""
}




@ARTICLE{EadWhi94,
	AUTHOR = "P. Eades and S. Whitesides",
	TITLE = "Drawing graphs in two layers",
	JOURNAL = tcs,
	YEAR = 1994,
	month = "",
	volume = 13,
	number = "", note={\marginpar{wrong reference!}}, 
	pages = "361--374",
	copy = ""
}
@ARTICLE{EadWor94,
	AUTHOR = "P. Eades and N.~C. Wormald",
	TITLE = "Edge crossings in drawings of bipartite graphs",
	JOURNAL = alg,
	YEAR = 1994,
	month = "",
	volume = 11,
	number = "",
	pages = "379--403",
	copy = ""
}


@ARTICLE{EasHorPar96,
	AUTHOR = "T. Easton and S. B. Horton and R. G. Parker",
	TITLE = "A Solvable Case of the Optimal Linear Arrangement Problem on Halin Graphs",
	JOURNAL = {Congressus Numerantium  (Utilitas mathematica)},
	YEAR = 1996,
	month = "",
	volume = 119,
	number = "",
	pages = "3--17",
	copy = ""
}


@ARTICLE{EasHorPar2000,
	AUTHOR = "T. Easton and S. B. Horton and R. G. Parker",
	TITLE = "On the Complexity of Certain Completion Problems",
	JOURNAL = {Congressus Numerantium  (Utilitas mathematica)},
	YEAR = 2000,
	month = "",
	volume = 145,
	number = "",
	pages = "9--31",
	copy = ""
}


@INPROCEEDINGS{EchJan99,
	AUTHOR = "R. Echahed and J.-C. Janodet",
	TITLE = "Parallel admissible graph rewriting",
	BOOKTITLE = "WADT'98",
	YEAR = 1999,
	month = "",
	volume = "1589",
	editor = "J.~L. Fiadeiro",
	series = "",
	chapter = "",
	pages = "122--138",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{Eda95,
	AUTHOR = "A. Edalat",
	TITLE = "Dynamical systems, measures and fractals via domain theory",
	JOURNAL = icneu,
	YEAR = 1995,
	month = "",
	volume = 120,
	number = "",
	pages = "32--48",
	copy = ""
}

@ARTICLE{Eda95a,
	AUTHOR = "A. Edalat",
	TITLE = "Domain theory and integration",
	JOURNAL = tcs,
	YEAR = 1995,
	month = "",
	volume = 151,
	number = "",
	pages = "163--193",
	copy = ""
}

@ARTICLE{Eda95b,
	AUTHOR = "A. Edalat",
	TITLE = "Domain theory in learning processes",
	JOURNAL = entcs,
	YEAR = 1995,
	month = "",
	volume = 1,
	number = "",
	pages = "18",
	copy = ""
}


@ARTICLE{Eda96,
	AUTHOR = "A. Edalat",
	TITLE = "Power domains and iterated function systems",
	JOURNAL = icneu,
	YEAR = 1996,
	month = "",
	volume = 124,
	number = "",
	pages = "182--197",
	copy = ""
}

@INPROCEEDINGS{EdeRef98,
	AUTHOR = "S. Edelkamp and F. Reffel",
	TITLE = "{OBDD}s in heuristic search",
	BOOKTITLE = "{KI}-98: Advances in Artificial Intelligence",
	YEAR = 1998,
	month = "",
	volume = "1504",
	editor = "O. Herzog and A. G{\"u}nter",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "81--92",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@ARTICLE{Edg89,
	AUTHOR = "G. A. Edgar",
	TITLE = "Kiesswetter's fractal has {H}ausdorff dimension 3/2",
	JOURNAL = "Real Analysis Exchange",
	YEAR = {1988--89},
	month = "",
	volume = 14,
	number = "",
	pages = "215--223",
	copy = ""
}

@ARTICLE{EdgMau92,
	AUTHOR = "G. A. Edgar and R. D. Mauldin",
	TITLE = "Multifractal decompositions of digraph recursive fractals",
	JOURNAL = plms3,
	YEAR = 1992,
	month = "",
	volume = 65,
	number = "",
	pages = "604--627",
	copy = ""
}

@ARTICLE{Edg94,
	AUTHOR = "G. A. Edgar",
	TITLE = "Packing measures as a gauge variation",
	JOURNAL = pams,
	YEAR = 1994,
	month = "",
	volume = 122,
	number = "",
	pages = "167--174",
	NOTE = "Also available via AMSPPS, No. 199406-28-001",
	copy = ""
}

@TECHREPORT{Edg94a,
	AUTHOR = "G. A. Edgar",
	TITLE = "Fine variation and fractal measures",
	INSTITUTION = "AMSPPS",
	YEAR = 1994,
	month = "",
	number = "199406-28-002",
	address = "",
	copy = ""
}
		  
@ARTICLE{EdgBat2006,
	AUTHOR = "R. C. Edgar and S. Batzoglou",
	TITLE = "Multiple sequence alignment",
	JOURNAL = {Current Opinion in Structural Biology},
	YEAR = 2006,
	month = "",
	volume = 16,
	number = "",
	pages = "368--373",
	copy = ""
}

@ARTICLE{Egg51,
	AUTHOR = "H. G. Eggleston",
	TITLE = "Sets of fractional dimensions which occur in some
		  problems in number theory",
	JOURNAL = plms2,
	YEAR = 1951,
	month = "",
	volume = 254,
	number = "",
	pages = "42--93",
	copy = "(copied in parts)"
}

@Article{Solms87,
  author =       "E. M. Ehlers and S. H. Von Solms",
  title =        "A Hierarchy of Random-Context Grammars and Automata",
  year =         "1987",
  journal =      "Information Sciences",
  volume =       "42",
  institution =  "Rand AU",
  pages =        "1--29",
  keywords =     "LANGUAGE, MATHEMATICS, LARGE DIMENSIONALITY",
}

@Article{EhlSol89,
  author =       "E. M. Ehlers and S. H. von Solms",
  title =        "Using random context structure grammars to represent
                 chemical structures",
  journal =      ipl,
  volume =       "30",
  number =       "3",
  pages =        "159--166",
  month =        feb,
  year =         "1989",
}
		  
@ARTICLE{EhrHauRoz83,
	AUTHOR = "A. Ehrenfeucht and D. Haussler and G. Rozenberg",
	TITLE = "On regularity of context-free languages",
	JOURNAL = tcs,
	YEAR = 1983,
	volume = 27,
	number = "",
	pages = "311--332",
	copy = ""
}

@ARTICLE{EhrKleRoz85,
	AUTHOR = "A. Ehrenfeucht and H. C. M. Kleijn and G. Rozenberg",
	TITLE = "Adding global forbidding context to context-free grammars",
	JOURNAL = tcs,
	YEAR = 1985,
	month = "",
	volume = 37,
	number = "",
	pages = "337--360",
	copy = ""
}


@INBOOK{EhrLeeRoz74,
	 AUTHOR = "A. Ehrenfeucht and K. P. Lee and G. Rozenberg",
        booktitle = {L Systems}, editor = {G. Rozenberg and A. Salomaa},
	 TITLE = "Generatively deterministic L languages, subword point of view",
	 PAGES = "93--103",
	 PUBLISHER = "Berlin: Springer",
	 YEAR = 1974,
	 VOLUME = 15,
	 SERIES = "LNCS",
	 copy = "ab Seite 96 kopiert"
}

@ARTICLE{EhrMauRoz80,
	AUTHOR = "A. Ehrenfeucht and H. Maurer and G. Rozenberg",
	TITLE = "Continuous grammars",
	JOURNAL = icalt,
	YEAR = 1980,
	VOLUME = 46,
	NUMBER = "",
	PAGES = "71--91",
	copy = ""
}


@ARTICLE{EhrPauRoz96,
	AUTHOR = "A. Ehrenfeucht and G. P\u aun and G. Rozenberg",
	JOURNAL = "The linear landscape of external contextual languages",
	TITLE = actainform,
	YEAR = 1996,
	month = "",
	volume = 33,
	number = "",
	pages = "571--593",
	copy = ""
}



@INBOOK{EhrRoz74,
	 AUTHOR = "A. Ehrenfeucht and G. Rozenberg",
	 TITLE = "Three useful results concerning L languages without interaction",
        booktitle = {L Systems}, editor = {G. Rozenberg and A. Salomaa},
	 PAGES = "71--77",
	 PUBLISHER = "Berlin: Springer",
	 YEAR = 1974,
	 VOLUME = 15,
	 SERIES = "LNCS",
	 copy = "ab Seite 74 kopiert"
}

@INBOOK{EhrRoz76,
	AUTHOR = "A. Ehrenfeucht and G. Rozenberg",
	TITLE = "On inverse homomorphic images of deterministic {ET0L} languages",
	PAGES = "179--189",
	BOOKTITLE = "Automata, Languages, Development",
	PUBLISHER = "North-Holland",
	YEAR = 1976,
	month = "",
	address = "",
	volume = "",
	series = "",
	type = "",
	copy = ""
}

@INBOOK{EhrRoz76a,
	AUTHOR = "A. Ehrenfeucht and G. Rozenberg",
	TITLE = "On {$\theta$}-determined {E0L} languages",
	PAGES = "191--202",
	BOOKTITLE = "Automata, Languages, Development",
	PUBLISHER = "North-Holland",
	YEAR = 1976,
	month = "",
	address = "",
	volume = "",
	series = "",
	type = "",
	copy = ""
}

@ARTICLE{EhrRoz84,
	AUTHOR = "A. Ehrenfeucht and G. Rozenberg",
	TITLE = "An easy proof of {G}reibach normal form",
	JOURNAL = icalt,
	YEAR = 1984,
	month = "",
	volume = 63,
	number = "",
	pages = "190--199",
	copy = ""
}



@ARTICLE{EhrRozSky76,
	AUTHOR = "A. Ehrenfeucht and G. Rozenberg and S. Skyum",
	TITLE = "A relationship between {ET0L} and {EDT0L} languages",
	JOURNAL = tcs,
	YEAR = 1976,
	month = "",
	volume = 1,
	number = "",
	pages = "325--330",
	copy = ""
}

@Article{EhrRoz79, 
 author = "A. Ehrenfeucht and G. Rozenberg", 
 title = "An Observation on Scattered Grammars", 
 journal = ipl,
 volume = "9", 
 year  = "1979",
pages = "84--85"
	} 
	
@ARTICLE{EhrRoz80,
	 AUTHOR = "A. Ehrenfeucht and G. Rozenberg",
	 TITLE = "On basic properties of {D0S} systems and languages",
	 JOURNAL = icalt,
	 YEAR = 1980,
	 VOLUME = 47,
	 NUMBER = "",
	 PAGES = "137--153",
	 copy = ""
}
		  
@ARTICLE{EhrRoz80a,
	AUTHOR = "A. Ehrenfeucht and G. Rozenberg",
	TITLE = "On the emptiness of the intersection of two {D0S}
		  languages problem",
	JOURNAL = ipl,
	YEAR = 1980,
	month = "",
	volume = 10,
	number = "",
	pages = "223--225",
	copy = ""
}

@INPROCEEDINGS{EhrRoz81,
	crossref = "Deu81",
	AUTHOR = "A. Ehrenfeucht and G. Rozenberg",
	TITLE = "On the subword complexity and square-freeness of
formal languages",
	chapter = "",
	pages = "1--4",
	copy = ""
}

@ARTICLE{EhrRoz82,
	AUTHOR = "A. Ehrenfeucht and G. Rozenberg",
	TITLE = "On subword complexities of homomorphic images of languages",
	JOURNAL = rairo,
	YEAR = 1982,
	month = "",
	volume = 16,
	number = "4",
	pages = "303--316",
	copy = ""
}

@ARTICLE{EhrRoz83,
	AUTHOR = "A. Ehrenfeucht and G. Rozenberg",
	TITLE = "On the subword complexity of locally catenative {D0L} sequences",
	JOURNAL = ipl,
	YEAR = 1983,
	volume = 16,
	number = "",
	pages = "7--9",
	copy = ""
}

@ARTICLE{EhrRoz85,
	AUTHOR = "A. Ehrenfeucht and G. Rozenberg",
	TITLE = "Each regular code is included in a maximal regular code",
	JOURNAL = rairoita,
	YEAR = 1985,
	month = "",
	volume = 20,
	number = "1",
	pages = "89--96",
	copy = ""
}

@ARTICLE{EhrRoz86,
	AUTHOR = "A. Ehrenfeucht and G. Rozenberg",
	TITLE = "Each regular code is included in a maximal regular code",
	JOURNAL = rairoita,
	YEAR = 1986,
	month = "",
	volume = 20,
	number = "1",
	pages = "89--96",
	copy = ""
}


@INBOOK{EhrKre76,
	AUTHOR = "H. Ehrig and H.-J. Kreowski",
	TITLE = "Parallel graph grammars",
	PAGES = "425--442",
	BOOKTITLE = "Automata, Languages, Development",
	PUBLISHER = "North-Holland",
	YEAR = 1976,
	month = "",
	address = "",
	volume = "",
	series = "",
	type = "",
	copy = ""
}

@INBOOK{EhrRoz76b,
	AUTHOR = "H. Ehrig and G. Rozenberg",
	TITLE = "Some definitional suggestions for parallel graph grammars",
	PAGES = "443--468",
	BOOKTITLE = "Automata, Languages, Development",
	PUBLISHER = "North-Holland",
	YEAR = 1976,
	month = "",
	address = "",
	volume = "",
	series = "",
	type = "",
	copy = ""
}

@ARTICLE{Eil41,
	AUTHOR = "S. Eilenberg",
	TITLE = "Ordered topological spaces",
	JOURNAL = ajm,
	YEAR = 1941,
	month = "",
	volume = 63,
	number = "",
	pages = "39--45",
	copy = ""
}

@ARTICLE{EilSch69,
	AUTHOR = "S. Eilenberg and M.P. Sch{\"u}tzenberger",
	TITLE = "Rational sets in commutative monoids",
	JOURNAL = "Journal of Algebra",
	YEAR = 1969,
	month = "",
	volume = 13,
	number = "",
	pages = "173--191",
	copy = ""
}

@ARTICLE{EisGra2004,
	AUTHOR = "F.  Eisenbrand and F. Grandoni",
	TITLE = "On the complexity of fixed parameter clique and dominating set",
	JOURNAL = tcs,
	YEAR = 2004,
	month = "",
	volume = 326,
	number = "",
	pages = "57--67",
	copy = ""
}

@inproceedings{EisRav2005,
  author    = {G. Eisman and
               B. Ravikumar},
  title     = {Approximate Recognition of Non-regular Languages by Finite
               Automata},
  booktitle = {ACSC},
  year      = {2005},
  pages     = {219-228},
  ee        = {http://crpit.com/confpapers/CRPITV38Eisman.pdf},
  crossref  = {acsc2005},
}

@proceedings{acsc2005,
  editor    = {V. Estivill-Castro},
  title     = {Computer Science 2005, Twenty-Eighth Australasian Computer
               Science Conference (ACSC2005), Newcastle, NSW, Australia,
               January/February 2005},
  booktitle = {ACSC},
  publisher = {Australian Computer Society},
  series    = {CRPIT},
  volume    = {38},
  year      = {2005},
}

@article{Eit94,
    author = "T. Eiter",
    title = "Exact Transversal Hypergraphs and Application to Boolean $\mu$-Functions",
    journal = "Journal of Symbolic Computation",
    volume = "17",
    number = "3",
    pages = "215-225",
    year = "1994"
}


@article{EitGot95,
    author = "T. Eiter and G. Gottlob",
    title = "Identifying the Minimal Transversals of a Hypergraph and Related Problems",
    journal = "SIAM Journal on Computing",
    volume = "24",
    number = "6",
    pages = "1278--1304",
    year = "1995"}

@inproceedings{EitGot02,
  author = "T. Eiter and G. Gottlob",
  title = "Hypergraph transversal computation and related problems in logic and AI",
  booktitle = "Proc. 8th European Conference on Logics in
    Artificial Intelligence JELIA",
volume = 2424, series = {LNCS}, year =  2002, pages = {549--564},
publisher = {Springer}}

@misc{EitGotMak02,
  author = "T. Eiter and G. Gottlob and K. Makino",
  title = "New results on monotone dualization and generating hypergraph transversals",
  text = "In Proceedings 34th ACM Symposium
    on Theory of Computing (STOC 2002), pp. 14-22. Long version
as Technical Report INFSYS RR-1843-02-05, TU Wien",
  year = "2002"}


@INPROCEEDINGS{EllBra88,
	crossref = "Ale88",
	AUTHOR = "D. B. Ellis and M. G. Branton",
	TITLE = "Non-self-similar attractors of hyperbolic iterated
function systems",
	chapter = "",
	pages = "158--171",
	copy = ""
}

@INPROCEEDINGS{EllFanFel02,
	AUTHOR = "J. Ellis and H. Fan and M.~R. Fellows",
	TITLE = "The dominating set problem is fixed parameter tractable for graphs of bounded genus",
	BOOKTITLE = "SWAT 2002",
	YEAR = 2002,
	month = "",
	volume = "2368",
	editor = "M. Penttonen and E. Meineche Schmidt",
	series = "LNCS",
	chapter = "",
	pages = "180--189",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{EllFanFel2004,
	AUTHOR = "J. Ellis and H. Fan and M. Fellows",
	TITLE = "The dominating set problem is fixed parameter tractable for graphs of bounded genus",
	JOURNAL = jalg,
	YEAR = 2004,
	month = "",
	volume = 52,
	number = "",
	pages = "152--168",
	copy = ""
}

@ARTICLE{ElgMez65,
	AUTHOR = "C. C. Elgot and J. E. Mezei",
	TITLE = "On relations defined by generalized finite automata",
	JOURNAL = {IBM J. Res. Develop.},
	YEAR = 1965,
	month = "",
	volume = 9,
	number = "",
	pages = "47--68",
	copy = ""
}

@INPROCEEDINGS{EloRou03,
	AUTHOR = "T. Elomaa and J. Rousu",
	TITLE = "On decision boundaries of naive {B}ayes in continuous domains",
	BOOKTITLE = "Principles of Knowledge Discovery in Databases PKDD 2003",
	YEAR = 2003,
	month = "",
	volume = "2838",
	editor = "L. Todorovski and H. Blockeel",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "144--155",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = "only electr."
}

@ARTICLE{Elt87,
	AUTHOR = "J. H. Elton",
	TITLE = "An ergodic theorem for iterated maps",
	JOURNAL = etds,
	YEAR = 1987,
	month = "",
	volume = 7,
	number = "",
	pages = "481--488",
	copy = ""
}



@InProceedings{EmeSubTho96,
  author =       "J. D. Emerald and K.G. Subramanian and D. G. Thomas",
  title =        "Learning code regular and code linear grammars languages",
  pages =        "211--221",
  editor =       "L. Miclet and C. de la Higuera",
  booktitle =    "Proceedings of the Third International Colloquium on
                 Grammatical Inference ({ICGI}-96): Learning Syntax from
                 Sentences",
  month =        sep # "25--27~",
  series =       "LNCS/LNAI",
  volume =       "1147",
  publisher =    "Springer",
  year =         "1996",
}

@InProceedings{EmeSubTho98,
  author =       "J. D. Emerald and K.G. Subramanian and D. G. Thomas",
  title =        "Learning a subclass of context-free languages",
  pages =        "223--231",
  editor =       "V. Honavar and G. Slutski",
  booktitle =    "Proceedings of the Fourth International Colloquium on
                 Grammatical Inference ({ICGI}-98)",
  month =        jul,
  series =       "LNCS/LNAI",
  volume =       "1433",
  publisher =    "Springer",
  year =         "1998",
}

@ARTICLE{EngSch77,
	AUTHOR = "J. Engelfriet and E. M. Schmidt",
	TITLE = "{IO} and {OI}. {I}",
	JOURNAL = jcss,
	YEAR = 1977,
	month = "",
	volume = 15,
	number = "",
	pages = "328--353",
	copy = ""
}

@INPROCEEDINGS{Eng77,
	AUTHOR = "J. Engelfriet",
	TITLE = "Macro grammars, {L}indenmayer systems and other
copying devices",
	BOOKTITLE = "{ICALP}",
	YEAR = 1977,
	month = jul,
	volume = "52",
	editor = "",
	series = "{LNCS}",
	chapter = "",
	pages = "220--229",
	address = "",
	organization = "{EATCS}",
	copy = ""
}


@ARTICLE{EngSch78,
	AUTHOR = "J. Engelfriet and E. M. Schmidt",
	TITLE = "{IO} and {OI}. {II}",
	JOURNAL = jcss,
	YEAR = 1978,
	month = "",
	volume = 16,
	number = "",
	pages = "67--99",
	copy = ""
}

@ARTICLE{EngRoz79,
	AUTHOR = "J. Engelfriet and G. Rozenberg",
	TITLE = "Equality languages and fixed point languages",
	JOURNAL = icalt,
	YEAR = 1979,
	month = "",
	volume = 43,
	number = "",
	pages = "20--49",
	copy = ""
}

@ARTICLE{EngRoz80,
	AUTHOR = "J. Engelfriet and G. Rozenberg",
	TITLE = "Fixed point languages, equality languages, and
representation of recursively enumerable languages",
	JOURNAL = jacm,
	YEAR = 1980,
	month = jul,
	volume = 27,
	number = "3",
	pages = "499--518",
	copy = ""
}

@ARTICLE{EngSchvanLee80,
	 AUTHOR = "J. Engelfriet and E. M. Schmidt and J. van Leeuwen",
	 TITLE = "Stack machines and classes of nonnested macro languages",
	 JOURNAL = jacm,
	 YEAR = 1980,
	 VOLUME = 27,
	 NUMBER = 1,
	 PAGES = "96--117",
	 copy = ""
}

@ARTICLE{EngRoz81,
	AUTHOR = "J. Engelfriet and G. Rozenberg",
	TITLE = "A translational theorem for the class of {E0L} languages",
	JOURNAL = icalt,
	YEAR = 1981,
	month = "",
	volume = 50,
	number = "",
	pages = "175--183",
	copy = ""
}
@TechReport{Engelfriet86a, 
 author = "J. Engelfriet", 
 title ="Context-Free Grammars with Storage", 
 institution = "Vakgroep Informatica, Rijksuniversiteit Leiden", 
 type = "report", 
 number = "86-11", 
 month = jul, 
 year    = "1986"} 

@INPROCEEDINGS{EngHoo89,
	AUTHOR = "J. Engelfriet and H. J. Hoogeboom",
	TITLE = "Automata with storage on infinite words",
	BOOKTITLE = "{LNCS} 372: {ICALP}",
	YEAR = 1989,
	pages = "289--303",
	organization = "{EATCS}",
	copy = ""
}
@ARTICLE{EngHoo93,
	AUTHOR = "J. Engelfriet and H. J. Hoogeboom",
	TITLE = "{$X$}-automata on $\omega$-words",
	JOURNAL = tcs,
	YEAR = 1993,
	month = "",
	volume = 110,
	number = "",
	pages = "1--51",
	copy = ""
}


@INPROCEEDINGS{EngSch92,
	crossref = "Encetal92",
	AUTHOR = "G. Englert and M. Schendel",
	TITLE = "Fractals and formal texture specification",
	chapter = "Computer Graphics",
	pages = "83--102",
	copy = ""
}
@ARTICLE{EnoMiy99,
	AUTHOR = "H. Enomoto and M.~S. Miyauchi",
	TITLE = "Embedding graphs into a 3-page book with $O(M\log N)$ crossings over the spine",
	JOURNAL = siamdm,
	YEAR = 1999,
	month = "",
	volume = 12,
	number = "",
	pages = "337--341",
	copy = ""
}




@ARTICLE{Epp99,
	AUTHOR = "D. Eppstein",
	TITLE = "Subgraph isomorphism in planar graphs and related problems",
	JOURNAL = {Journal of Graph Algorithms and Applications},
	YEAR = 1999,
	month = "",
	volume = 3,
	number = "3",
	pages = "1--27",
	copy = ""
}

@ARTICLE{Epp2000,
	AUTHOR = "D. Eppstein",
	TITLE = "Diameter and treewidth in minor-closed graph families",
	JOURNAL = alg,
	YEAR = 2000,
	month = "",
	volume = 27,
	number = "",
	pages = "275--291",
	copy = ""
}


@inproceedings{Epp01,
  title = {{Small maximal independent sets and faster exact graph coloring}},
  author = {D. Eppstein},
  eprint = {cs.DS/0011009},
  booktitle = {Proc. 7th Workshop Algorithms and Data Structures WADS}, volume = 2125, 
  series = {LNCS}, editor = {F. Dehne and J.-R. Sack and R. Tamassia}, 
  publisher = {Springer}, pages = {462--470},
  year = {2001},
}

@ARTICLE{Epp03,
	AUTHOR = "E. Eppstein",
	TITLE = "Small maximal independent sets and faster exact graph coloring",
	JOURNAL = {J. Graph Algorithms \& Applications},
	YEAR = 2003,
	month = "",
	volume = 7,
	number = "",
	pages = "131--140",
	copy = ""
}

@inproceedings{Epp2004,
  title = {{Quasiconvex analysis of backtracking algorithms}},
  author = {D. Eppstein},
  eprint = {cs.DS/0304018},
  booktitle = {Proc. 15th Symp. Discrete Algorithms SODA},
  publisher = {ACM and SIAM},
  pages = {781--790},
  month = {January},
  year = {2004}}



@ARTICLE{EppMilTen95,
	AUTHOR = "D. Eppstein and G.L. Miller and S.-H. Teng",
	TITLE = "A deterministic linear time algorithm for geometric separators and its applications",
	JOURNAL = fundinform,
	YEAR = 1995,
	month = "",
	volume = 22,
	number = "",
	pages = "309--330",
	copy = ""
}

@ARTICLE{EpsTas2003,
	AUTHOR = "L. Epstein and T. Tassa",
	TITLE = " Vector assignment problems: a general framework",
	JOURNAL = jalg,
	YEAR = 2003,
	month = "",
	volume = 48,
	number = "",
	pages = "360--384",
	copy = ""
}

@ARTICLE{ErbTanAli92,
	AUTHOR = "C.~Erbas and M.~M. Tanik and Z.~Aliyazicioglu",
	TITLE = "Linear conguence equations
  for the solutions of the $N$-queens problem",
	JOURNAL = ipl,
	YEAR = 1992,
	month = "",
	volume = 41,
	number = "",
	pages = "301--306",
	copy = ""
}


@ARTICLE{ErdRad52,
	AUTHOR = "P. Erd{\"o}s and R. Rado",
	TITLE = "Sets having a divisor property",
	JOURNAL = amm,
	YEAR = 1952,
	month = "",
	volume = 59,
	number = "",
	pages = "255--257",
	copy = ""
}

@ARTICLE{ErdRad59,
	AUTHOR = "P. Erd{\"o}s and R. Rado",
	TITLE = "A theorem on partial well-orderings of sets of vectors",
	JOURNAL = jlms,
	YEAR = 1959,
	month = "",
	volume = 34,
	number = "",
	pages = "222--224",
	copy = ""
}

@ARTICLE{ErdJacMau93,
	AUTHOR = "P. Erd{\"o}s and S. Jackson and R. D. Mauldin",
	TITLE = "On partitions of lines and space",
	JOURNAL = fundmath,
	YEAR = 1993,
	month = "",
	volume = "??",
	number = "",
	pages = "??--??",
	NOTE = "Preprint obtained from the authors",
	copy = ""
}

@ARTICLE{Erdetal97,
	AUTHOR = "P. L. Erd{\"o}s  and  M. A. Steel and L. A. Sz\'ekely",
	TITLE = "Local quartet splits of a binary tree infer all quartet splits via
one dyadic inference rule",
	JOURNAL = caai,
	YEAR = 1997,
	month = "",
	volume = 16,
	number = "",
	pages = "217--227",
	copy = ""
}

@INPROCEEDINGS{EriZhoElo01,
	AUTHOR = "O. Eriksson and Y. Zhou and A. Elofsson",
	TITLE = "Side Chain-Positioning as an Integer Programming Problem",
	BOOKTITLE = "Algorithms in Bioinformatics, First International Workshop, WABI       2001, Aarhus, Denmark, August 28-31, 2001, Proceedings",
	YEAR = 2001,
	 editor    = {O. Gascuel and
               B. M. E. Moret},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {2149},

}

@INPROCEEDINGS{Erletal2001,
	AUTHOR = "T. Erlebach and others",
	TITLE = "On the complexity of train assignment problems",
	BOOKTITLE = "International Symposium on Algorithms and Computation ISAAC",
	YEAR = 2001,
	month = "",
	volume = "2223",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "390--402",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@INPROCEEDINGS{ErlJanSei01,
	AUTHOR = "T. Erlebach and K. Jansen and E. Seidel",
	TITLE = "Polynomial-time approximation schemes for geometric graphs",
	BOOKTITLE = "Symposium on Discrete Algorithms (SODA)",
	YEAR = 2001,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "--",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@InProceedings{Erletal2008,
  author ={T. Erlebach and T. Hagerup and K. Jansen and M. Minzlaff and A. Wolff},
  title ={Trimming of Graphs, with Application to Point Labeling (pp. 265--276)},
  booktitle ={25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008)},
  year ={2008},
  editor ={Susanne Albers and Pascal Weil},
  publisher ={Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address ={Dagstuhl, Germany},
}

@INPROCEEDINGS{EspRos97,
	AUTHOR = "J. Esparza and P. Rossmanith",
	TITLE = "An automata approach to some problems on context-free grammars",
	BOOKTITLE = "Foundations
     of Computer Science: Potential - Theory - Cognition",
	YEAR = 1997,
	month = "",
	volume = "1337",
	editor = "C. Freksa and M. Jantzen and R. Valk",
	series = "LNCS",
	chapter = "",
	pages = "143--152",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{Esp97,
	AUTHOR = "J. Esparza",
	TITLE = "Petri nets, commutative context-free grammars, and basic parallel processes",
	JOURNAL = fundinform,
	YEAR = 1997,
	month = "",
	volume = 31,
	number = "",
	pages = "13--26",
	copy = ""
}


@INPROCEEDINGS{EspKno99,
	AUTHOR = "J. Esparza and J. Knoop",
	TITLE = "An automata-theoretic approach to interprocedural dataflow analysis",
	BOOKTITLE = "Proceedings von FOSSACS'99",
	YEAR = 1999,
	month = "",
	volume = "1578",
	editor = "W. Thomas",
	series = "LNCS",
	chapter = "",
	pages = "14--30",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{EspGurWan01,
	AUTHOR = "W. Espelage and F. Gurski and E. Wanke",
	TITLE = "Deciding clique-width for graphs of bounded tree-width",
	BOOKTITLE = "{Proc. 7th Workshop Algorithms and Data Structures WADS}",
	YEAR = 2001, volume = 2125, 
  series = {LNCS}, editor = {F. Dehne and J.-R. Sack and R. Tamassia}, 
  publisher = {Springer}, pages = {87--98}
}

@INPROCEEDINGS{EstHou2001,
	AUTHOR = "V. Estivill-Castro and M. E. Houle",
	TITLE = "Data structures for minimization of total with-group distance for spatio-temporal clustering",
	BOOKTITLE = "European Conference on Machine Learning ECML",
	YEAR = 2001,
	month = "",
	volume = "2168",
	series = "LNCS/LNAI",
	chapter = "",
	editor = "L. De Raedt and P. Flach",
	pages = "91--102",
	address = "",
	organization = "",
        publisher = "Springer", note={NP minimization}, 
	copy = ""
}

@INPROCEEDINGS{Estetal2005,
	AUTHOR = "V. Estivill-Castro and M. R. Fellows and M. A. Langston and F. A. Rosamond",
	TITLE = "{FPT} is {P}-time extremal structure {I}",
	BOOKTITLE = "Algorithms and Complexity in Durham ACiD 2005",
	YEAR = 2005,
	month = "",
	volume = "4",
	editor = "H. Broersma and M. Johnson and S. Szeider",
	series = "Texts in Algorithmics",
	chapter = "",
	pages = "1--41",
	address = "",
	organization = "",
        publisher = "King's College Publications",
	copy = ""
}

@ARTICLE{EswTar76,
	AUTHOR = "K.~P. Eswaran and R.~E. Tarjan",
	TITLE = "Augmentation problems",
	JOURNAL = siam,
	YEAR = 1976,
	month = "",
	volume = 5,
	number = "",
	pages = "653--665",
	copy = ""
}


@ARTICLE{Eul1736,
	AUTHOR = "L. Euler",
	TITLE = "Solutio problematis ad geometriam situs pertinentis",
	JOURNAL = "Commentarii academiae scientiarum Petropolitanae",
	YEAR = 1736,
	month = "",
	volume = 8,
	number = "",
	pages = "128--140",
	NOTE = "{Reprint in \cite{Kon86}}",
	copy = ""
}

@inproceedings{Evan99,
  author =       "P. A. Evans",
  title =        "Finding Common Subsequences with Arcs and
                 Pseudoknots",
booktitle = {Combinatorial Pattern Matching CPM},
  series = {LNCS},
  volume =       "1645",
  pages =        "270--280",
  publisher = {Springer}, year=1999
}

@INPROCEEDINGS{Eva81,
	AUTHOR = "R. C. Evans",
	TITLE = "Testing repairable {RAM}s and mostly good memories",
	BOOKTITLE =  "Proceedings of the IEEE Int'l Test Conf.",
	YEAR = 1981,
	month = {},
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "49--55",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{Eveetal01,
	AUTHOR = "G. Even and J. Feldman and G. Kortsarz and Z. Nutov",
	TITLE = "A {3/2}-approximation algorithm for augmenting the edge connectivity of a graph from 1 to 2 using a subset of a given edge",
	BOOKTITLE = "Approximation, Randomization, and Combinatorial Optimization",
	YEAR = 2001,
	month = "",
	volume = "2129",
	editor = "M. Goemans and others",
	series = "LNCS",
	chapter = "",
	pages = "90--101",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{EveNaoZos2000,
	AUTHOR = "G. Even and S. Naor and L. Zosin",
	TITLE = "An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem",
	JOURNAL = siam,
	YEAR = 2000,
	month = "",
	volume = 30,
	number = "",
	pages = "1231--1252",
	copy = ""
}

@ARTICLE{EweWal99,
	AUTHOR = "S. Ewert and A. van der Walt",
	TITLE = "Random context picture grammars",
	JOURNAL = publmath,
	YEAR = 1999,
	month = "",
	volume = 54,
	number = "Supplement",
	pages = "763--785",
	copy = ""
}

@ARTICLE{EweWal99a,
	AUTHOR = "S. Ewert and A. van der Walt",
	TITLE = "Shrink indecomposable fractals",
	JOURNAL = jucs,
	YEAR = 1999,
	month = "",
	volume = 5,
	number = "9",
	pages = "521--531",
	copy = ""
}

@ARTICLE{EyrHigJan2007,
	AUTHOR = "R. Eyraud and C. de la Higuera and J.-C. Janodet",
	TITLE = "{LARS}: {A} learning algorithm for rewriting systems",
	JOURNAL = {Machine Learning},
	YEAR = 2007,
	month = "",
	volume = 66,
	number = "",
	pages = "7--31",
	copy = ""
}

@PHDTHESIS{Eyr86,
	AUTHOR = "G. Eyrolles",
	TITLE = "Synth{\`e}se d'images figuratives d'arbres par des
m{\'e}thodes combinatoires",
	SCHOOL = "L'universit{\'e} de Bordeaux I",
	YEAR = 1986,
 	month = "",
	address = "",
	type = "",
	copy = ""
}


@ARTICLE{Ezaetal76,
	AUTHOR = "Y. Ezawa and others",
	TITLE = "Interactive languages",
	JOURNAL = jcss,
	YEAR = 1976,
	month = "",
	volume = 12,
	number = "",
	pages = "49--63",
	copy = ""
}

FFF

@ARTICLE{FabReiRie94,
	AUTHOR = "D. A. F\'abio and A. Reis and R. Riera",
	TITLE = "Lacunarity calculation in the true fractal limit",
	JOURNAL = jpamg,
	YEAR = 1994,
	month = "",
	volume = 27,
	number = "",
	pages = "1827--1835",
	copy = ""
}


@ARTICLE{FacVas90,
	AUTHOR = "E. Fachini and L. Vassallo",
	TITLE = "Cellular automata with regular behavior",
	JOURNAL = complex,
	YEAR = 1990,
	month = "",
	volume = 4,
	number = "",
	pages = "385--399",
	copy = ""
}

@INPROCEEDINGS{Fag90,
	AUTHOR = "B. Fagarazzi",
	TITLE = "A fractal approach to musical composition",
	BOOKTITLE = "FRACTALS",
	YEAR = 1990,
	PAGES = "",
	ORGANIZATION = "IFIP",
	copy = ""
}

@InProceedings{FahRoo95,
  author =       "A. F. Fahmy and R. Roos",
  title =        "Efficient learning of real time one-counter automata",
  pages =        "25--40",
  ISBN =         "3-540-60454-5",
  editor =       "K. P. Jantke and T. Shinohara and Th. Zeugmann",
  booktitle =    "Proceedings of the 6th International Workshop on
                 Algorithmic Learning Theory ALT'95",
  month =        oct # "~18--20",
  series =       "LNCS/LNAI",
  volume =       "997",
  publisher =    "Springer",
  year =         "1995",
}


@inproceedings{FahRoo96,
  author =       "A. F. Fahmy and R. S. Roos",
  title =        "Efficient learning of real time two-counter automata",
 booktitle = {Proceedings of the 7th International Workshop on
                 Algorithmic Learning Theory ALT'96},
  series =       "LNCS/LNAI",
  editor =       "S. Arikawa and A. K. Sharma",
  volume =       "1160",
  pages =        "113--126",
  year =         "1996",
  publisher = {Springer},
}

@INPROCEEDINGS{Fal84,
	crossref = "Flaetal84",
	AUTHOR = "K. J. Falconer",
	TITLE = "Projection properties of sets of fractional dimension
and relationships to curve packing problems",
	chapter = "Part 1",
	pages = "60--68",
	copy = ""
}

@ARTICLE{Fal85a,
	AUTHOR = "K. J. Falconer",
	TITLE = "The {H}ausdorff dimensions of distance sets",
	JOURNAL = mathe,
	YEAR = 1985,
	month = "",
	volume = 32,
	number = "",
	pages = "206--212",
	copy = ""
}

@ARTICLE{Fal87,
	AUTHOR = "K. J. Falconer",
	TITLE = "The {H}ausdorff dimension of some fractals and
attractors of overlapping construction",
	JOURNAL = jsp,
	YEAR = 1987,
	month = "",
	volume = 47,
	number = "1/2",
	pages = "123--132",
	copy = ""
}

@ARTICLE{Fal87a,
	AUTHOR = "K. J. Falconer",
	TITLE = "Digital sundials, paradoxical sets, and {V}itushkin's conjecture",
	JOURNAL = tmi,
	YEAR = 1987,
	month = "",
	volume = 9,
	number = "1",
	pages = "24--27",
	copy = ""
}

@ARTICLE{Fal88,
	AUTHOR = "K. J. Falconer",
	TITLE = "The {H}ausdorff dimension of self-affine fractals",
	JOURNAL = mpcps,
	YEAR = 1988,
	month = "",
	volume = 103,
	number = "",
	pages = "339--350",
	copy = ""
}


@ARTICLE{FalSch86,
	AUTHOR = "B.-J. Falkowski and L.~Schmitz",
	TITLE = "A note on the queens' problem",
	JOURNAL = ipl,
	YEAR = 1986,
	month = "",
	volume = 23,
	number = "",
	pages = "39--46",
	copy = ""
}



@INPROCEEDINGS{FalRos89,
	AUTHOR = "C. Faloutsos and S. Roseman",
	TITLE = "Fractals for secondary key retrieval",
	BOOKTITLE = "Eight {ACM} Symposium on Principles of Database
		  Systems PODS'89",
	YEAR = 1989,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "247--252",
	address = "",
	organization = "",
	copy = ""
}


@TECHREPORT{FarLibKre97,
	AUTHOR = "M. Farach and V. Liberatore and U. Kremer",
	TITLE = "Hardness and Algorithms for Local Register Allocation",
	INSTITUTION = "DIMACS at Rutgers University (?)",
	YEAR = 1997,
	month = "",
	number = "DCS-TR-32", note = {Revised version at International Conference on Compiler Construction CC'99 (ETAPS'99)},
	address = "",
	copy = ""
}

@TECHREPORT{FarLib97,
	AUTHOR = "M. Farach and V. Liberatore",
	TITLE = "On Local Register Allocation",
	INSTITUTION = "DIMACS at Rutgers University (?)",
	YEAR = 1997,
	month = "",
	number = "DCS-TR-33", note = {Short version in SODA'98},
	address = "",
	copy = ""
}

@ARTICLE{FarGriPol64,
	AUTHOR = "D. J. Farber and R. E. Griswold and I.P. Polonsky",
	TITLE = "{SNOBOL}, a string manipulation language",
	JOURNAL = jacm,
	YEAR = 1964,
	month = "",
	volume = 11,
	number = "2",
	pages = "21--30",
	copy = ""
}

@ARTICLE{Far91,
	AUTHOR = "W. M. Farmer",
	TITLE = "Simple second-order languages for which unification
is undecidable",
	JOURNAL = tcs,
	YEAR = 1991,
	month = "",
	volume = 87,
	number = "",
	pages = "25--41",
	copy = ""
}
@ARTICLE{FarKie96,
	AUTHOR = "C.A. Farrell and D.H. Kieronska",
	TITLE = "Formal specification of parallel {SIMD} execution",
	JOURNAL = tcs,
	YEAR = 1996,
	month = "",
	volume = 169,
	number = "1",
	pages = "39--65",
	copy = ""
}
@ARTICLE{Fas83,
	AUTHOR = "L. F. Fass",
	TITLE = "Learning context-free languages from their structured sentences",
	JOURNAL = sigact,
	YEAR = 1983,
	month = "",
	volume = 15,
	number = "3",
	pages = "24--35",
	copy = ""
}

@INPROCEEDINGS{Fau96,
	AUTHOR = "L. Faulstich",
	TITLE = "Grammatikbasierte Integration von Datenbanken und Textdateien",
	BOOKTITLE = {8. Workshop "Grundlagen von Datenbanken"},
	YEAR = 1996,
	month = "",
	volume = "",
	editor = "",
	series = "Preprint Nr.3/1996",
	chapter = "",
	pages = "11--15",
	address = "",
	organization = {Fakult\"{a}t f{\"u}r Informatik, Universit\"at Magdeburg},
	copy = ""
}

@TECHREPORT{FauLinSpi96,
	AUTHOR = "L. Faulstich and V. Linnemann and M. Spiliopoulou",
	TITLE = "Unterst{\"u}tzung von Internet Data Warehousing durch 
		  Objekt-Grammatiken",
	INSTITUTION = {Medizinische Universit\"at zu L\"ubeck,
		  Institut f{\"u}r Informationssysteme},
	YEAR = 1996,
	month = "",
	number = "A-96-12",
	address = "",
	copy = ""
}

@ARTICLE{Favetal2002,
	AUTHOR = "O. Favaron and T. W. Haynes and S. T. Hedetniemi and M. A. Henning and D. J. Knisley",
	TITLE = "Total irredundance in graphs",
	JOURNAL = dm,
	YEAR = 2002,
	month = "",
	volume = 256,
	number = "",
	pages = "115--127",
	copy = ""
}
@ARTICLE{Favetal2002a,
	AUTHOR = "O. Favaron and G. Fricke and W. Goddard and S. M. Hedetniemi and S. T. Hedetniemi and P. Kristiansen and R. C. Laskar and D. Skaggs",
	TITLE = "Offensive alliances in graphs",
	JOURNAL = {Discussiones Mathematicae -- Graph Theory},
	YEAR = 2002,
	month = "",
	volume = 24,
	number = "",
	pages = "263--275",
	copy = ""
}

@ARTICLE{Fed68,
AUTHOR = 	"J. Feder",
TITLE = 	"Languages of encoded line patterns",
JOURNAL = 	icalt,
YEAR = 	"1968",
VOLUME = 	"13",
NUMBER = 	"",
PAGES = 	"230--244",
MONTH = 	"",
note = 	""
}

@INPROCEEDINGS{FedMot91,
	AUTHOR = "T. Feder and R. Motwani",
	TITLE = "Clique partitions, graph compression and speeding-up algorithms",
	BOOKTITLE = "STOC'91",
	YEAR = 1991,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "123--133",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{Fedetal99,
	AUTHOR = "T. Feder and P. Hell and S. Klein and R. Motwani",
	TITLE = "Complexity of Partition Problems",
	BOOKTITLE = "Proceedings of the 31st Annual ACM Symposium on Theory of Computing STOC'99",
	YEAR = 1999,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "464--472",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{FedKul2004,
	AUTHOR = "S. S. Fedin and A. S. Kulikov",
	TITLE = "Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms",
	BOOKTITLE = "International Workshop on Parameterized and Exact
Computation IWPEC 2004",
	YEAR = 2004,
	month = "",
	volume = "3162",
	editor = "R. Downey and M. Fellows and F. Dehne",
	series = "LNCS",
	chapter = "",
	pages = "248--259",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{FeiHalKor2000,
	AUTHOR = "U. Feige and M. M. Halld\'orsson and G. Kortsarz",
	TITLE = "Appromimating the domatic number",
	BOOKTITLE = "STOC'2000",
	YEAR = 2000,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{Fei79,
	AUTHOR = "M. J. Feigenbaum",
	TITLE = "The universal metric properties of nonlinear transformations",
	JOURNAL = jsp,
	YEAR = 1979,
	month = "",
	volume = 21,
	number = "6",
	pages = "669--706",
	copy = ""
}
@article{Feietal99,
  author    = {J. Feigenbaum and
               S. Kannan and
               M. Y. Vardi and
               M. Viswanathan},
  title     = {The Complexity of Problems on Graphs Represented as {OBDD}s},
  journal   = {Chicago J. Theor. Comput. Sci.},
  volume    = {1999}, note ={Article No. 5, see \url{http://cjtcs.cs.uchicago.edu/articles/1999/5/contents.html}}
}
 
@BOOK{Fei87,
	 AUTHOR = "Feilmeier",
	 TITLE = "Seminar 
		  {A}nwendungsprogrammierung auf dem
		  'message-passing local-memory' - {R}echner {SUPRENUM}",
	 PUBLISHER = "??",
	 YEAR = "September 1987",
	 VOLUME = "",
	 SERIES = "",
	 copy = ""
}

@INPROCEEDINGS{Fei88,
	crossref = "Banetal88",
	AUTHOR = "U. Feiste",
	TITLE = "Expanding mappings and mixed invariant sets",
	chapter = "Geometric measure theory",
	pages = "31--36",
	copy = ""
}
@ARTICLE{Fel72,
	AUTHOR = "J. Feldman",
	TITLE = "Some decidability results on grammatical inference and complexity",
	JOURNAL = icalt,
	YEAR = 1972,
	month = "",
	volume = 20,
	number = "",
	pages = "244--262",
	copy = ""
}

@article{FelTru2002,
  author    = {G. Felici and
               K. Truemper},
  title     = {A {MINSAT} Approach for Learning in Logic Domains},
  journal   = {INFORMS Journal on Computing},
  volume    = {14},
  number    = {1},
  year      = {2002},
  pages     = {20--36},
}

@ARTICLE{Fel94,
	AUTHOR = "A. Fellah",
	TITLE = "Equations and regular-like expressions for {AFA}",
	JOURNAL = ijcm,
	YEAR = 1994,
	month = "",
	volume = 51,
	number = "",
	pages = "157--172",
	copy = ""
}

@ARTICLE{FelLan87,
	AUTHOR = "M. R. Fellows and M. A. Langston",
	TITLE = "Nonconstructive advances in polynomial-time complexity",
	JOURNAL = ipl,
	YEAR = 1987,
	month = "",
	volume = 26,
	number = "",
	pages = "157--162",
	copy = ""
}

@ARTICLE{FelLan88,
	AUTHOR = "M. R. Fellows and M. A. Langston",
	TITLE = "Nonconstructive tools for proving polynomial-time decidability",
	JOURNAL = jacm,
	YEAR = 1988,
	month = "",
	volume = 35,
	number = "",
	pages = "727--739",
	copy = ""
}

@INPROCEEDINGS{FelLan89,
	AUTHOR = "M. R. Fellows and M. A. Langston",
	TITLE = "An analogue of the {M}yhill-{N}erode theorem and its
		  use in computing finite-basis characterizations",
	BOOKTITLE = "FOCS'89",
	YEAR = 1989,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "520--525",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{FelLan92,
	AUTHOR = "M. R. Fellows and M. A. Langston",
	TITLE = "On well-partial-order theory and its applications to
		  combinatorial problems in {VLSI} design",
	JOURNAL = siamdm,
	YEAR = 1992,
	month = "",
	volume = 5,
	number = "1",
	pages = "117--126",
	copy = ""
}

@INPROCEEDINGS{FelHalWar93,
	AUTHOR = "M. R. Fellows and M. T. Hallett and H. T. Wareham",
 	TITLE = "{DNA} physical mappings: three ways difficult",
	BOOKTITLE =  "ESA'93",
	YEAR = 1993,
	month = {},
	volume = "726",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "157--168",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{Feletal2000,
	AUTHOR = "M. R. Fellows and C. McCartin and F.~A. Rosamond and U. Stege",
	TITLE = "Coordinatized kernels and catalytic reductions: an improved {FPT} algorithm for {Max} {Leaf} {Spanning} {Tree} and other problems",
	BOOKTITLE = "FST TCS 2000",
	YEAR = 2000,
	month = "",
	volume = "1974",
	editor = "S. Kapoor and S. Prasad",
	series = "LNCS",
	chapter = "",
	pages = "240--251",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{Fel01,
	AUTHOR = "M.~R.~Fellows",
	TITLE = "Parameterized complexity: new developments and research frontiers",
	BOOKTITLE = "Aspects of Complexity",
	YEAR = 2001,
	month = "",
	volume = "",
	editor = "",
	series = "",  publisher = {De Gruyter},
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = "", note = {To appear}

}


@ARTICLE{Fel02,
	AUTHOR = "M. Fellows",
	TITLE = "Parameterized complexity: the main ideas and connections to practical computing",
	JOURNAL = {Electronic Notes in Theoretical Computer Science},
	YEAR = 2002,
	month = "",
	volume = 61,
	number = "",
	pages = "",
	copy = ""
}

@INPROCEEDINGS{Fel03a,
	AUTHOR = "M. Fellows",
	TITLE = "Blow-ups, win/win's, and crown rules: some new directions in {FPT}",
	BOOKTITLE = "WG 2003",
	YEAR = 2003,
	month = "",
	volume = "2880",
	editor = "H. L. Bodlaender",
	series = "LNCS",
	chapter = "",
	pages = "1--12",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}


@ARTICLE{FelMcC03,
	AUTHOR = "M.~R. Fellows and C. McCartin",
	TITLE = "On the parametric complexity of schedules to minimize tardy tasks",
	JOURNAL = tcs,
	YEAR = 2003,
	month = "",
	volume = 298,
	number = "",
	pages = "317--324",
	copy = ""
}
@INPROCEEDINGS{Feletal2004,
	crossref = "WG2004",
	AUTHOR = "M. Fellows and P. Heggernes and F. Rosamond and C. Sloper and J. A. Telle",
	TITLE = "Exact Algorithms for finding $k$ disjoint triangles in an arbitrary graph",
	chapter = "",
	pages = "235--244",
	copy = ""
}

@inproceedings{Feletal2004a,
  author    = {M. R. Fellows and
               C. Knauer and
               N. Nishimura and
               P. Ragde and
               F. A. Rosamond and
               U. Stege and
               D. M. Thilikos and
               S. Whitesides},
  title     = {Faster Fixed-Parameter Tractable Algorithms for Matching
               and Packing Problems},
  booktitle = {ESA},
  year      = {2004},
  pages     = {311-322},
  crossref  = {esa2004},
}
@Article{Feletal2007,
author = {M. R. Fellows and
               C. Knauer and
               N. Nishimura and
               P. Ragde and
               F. A. Rosamond and
               U. Stege and
               D. M. Thilikos and
               S. Whitesides},
title = {Faster Fixed-Parameter Tractable Algorithms for Matching
               and Packing Problems},
journal = {Algorithmica},
year = {2007},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
OPTpages = {},
OPTmonth = {},
OPTnote = {},
annote = {DOI	10.1007/s00453-007-9146-y}
}

@proceedings{esa2004,
  editor    = {S. Albers and
               T. Radzik},
  title     = {Algorithms --- ESA 2004, 12th Annual European Symposium},
  booktitle = {ESA},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {3221},
  year      = {2004},
}

@INPROCEEDINGS{FelSzeWri2004,
	AUTHOR = "M. Fellows and S. Szeider and G. Wrightson",
	TITLE = "On Finding Short Resolution Refutations and Small Unsatisfiable Subsets",
	BOOKTITLE = "International Workshop on Parameterized and Exact
Computation IWPEC 2004",
	YEAR = 2004,
	month = "",
	volume = "3162",
	editor = "R. Downey and M. Fellows and F. Dehne",
	series = "LNCS",
	chapter = "",
	pages = "223--234",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@TECHREPORT{Feletal05a,
	AUTHOR = "M. R. Fellows and  F. A. Rosamond and U. Rotics and S. Szeider",
	TITLE = "Proving {NP}-hardness for clique-width {I}: non-approximability of sequential clique-width",
	INSTITUTION = "Electronic Colloquium on Computational Complexity (ECCC)",
	YEAR = 2005,
	month = "",
	number = "TR05-080",
	address = "",
	copy = ""
}


@TECHREPORT{Feletal05ab,
	AUTHOR = "M. R. Fellows and  F. A. Rosamond and U. Rotics and S. Szeider",
	TITLE = "Proving {NP}-hardness for clique-width {II}: non-approximability of clique-width",
	INSTITUTION = "Electronic Colloquium on Computational Complexity (ECCC)",
	YEAR = 2005,
	month = "",
	number = "TR05-081",
	address = "",
	copy = ""
}

@InProceedings{FelFer08,
author = {M. R. Fellows and H. Fernau},
title = {Facility Location Problems: A Parameterized View},
booktitle = {Algorithmic Aspects in Information and Management AAIM 2008},
OPTcrossref = {},
OPTkey = {},
pages = {188--199},
year = {2008},
editor = {R. Flei\-scher and J. Xu},
volume = {5034},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}

@ARTICLE{Fel81,
	AUTHOR = "J. Felsenstein",
	TITLE = "Evolutionary trees from {DNA} sequences: a maximum likelihood approach",
	JOURNAL = {J. Mol. Evol.},
	YEAR = 1981,
	month = "",
	volume = 17,
	number = "",
	pages = "368--376",
	copy = ""
}

@ARTICLE{Fel85,
	AUTHOR = "J. Felsenstein",
	TITLE = "Confidence limits on phylogenies: an approach using the bootstrap",
	JOURNAL = {Evolution},
	YEAR = 1985,
	month = "",
	volume = 39,
	number = "",
	pages = "783--791",
	copy = ""
}


@ARTICLE{Fel88,
	AUTHOR = "J. Felsenstein",
	TITLE = "Phylogenies from molecular sequences: inference and reliability",
	JOURNAL = {Annu. Rev. Genet.},
	YEAR = 1988,
	month = "",
	volume = 22,
	number = "",
	pages = "521--565",
	copy = ""
}

@ARTICLE{Fen81,
	 AUTHOR = "T. Feng",
	 TITLE = "A survey of interconnection networks",
	 JOURNAL = ieeetoc,
	 YEAR = 1981,
	 VOLUME = "Dezember",
	 NUMBER = "",
	 PAGES = "12--27",
	 copy = "vielleicht doch nicht ieeetoc"
}

@ARTICLE{Fen03,
	AUTHOR = "D.-J. Feng",
	TITLE = "Exact packing measure of linear {C}antor sets",
	JOURNAL = mn,
	YEAR = 2003,
	month = "",
	volume = "248--249",
	number = "",
	pages = "102--109",
	copy = ""
}


@InProceedings{FenWak94,
  author =       "An Feng and T. Wakayama",
  title =        "{SIMON}: {A} Grammar-based Transformation System for
                 Structured Documents",
  booktitle =    "Fifth International Conference on Electronic
                 Publishing",
  pages =        "361--372",
  publisher =    "Origination, Dissemination, and Design (EPODD) EP
                 '94",
  address =      "Darmstadt, Germany",
  year =         "1994",
}


@ARTICLE{Fere92,
	AUTHOR = "S. Ferenczi",
	TITLE = "Tiling the {M}orse sequence",
	JOURNAL = tcs,
	YEAR = 1992,
	month = "",
	volume = 94,
	number = "",
	pages = "215--221",
	copy = ""
}

@INPROCEEDINGS{Fer84,
	AUTHOR = "D. Ferment",
	TITLE = "Principality results about some matrix language families",
	BOOKTITLE = "11th ICALP'84",
	YEAR = 1984,
	month = "",
	volume = "172",
	editor = "J. Paredaens",
	series = "LNCS",
	chapter = "",
	pages = "151--161",
	address = "",
	organization = "",
	copy = ""
}

@MASTERSTHESIS{FerKra88,
	AUTHOR = "H. Fernau and D. Krafzig",
	TITLE = "Spezielle {G}raphenabbildungen",
	SCHOOL = "TU Braunschweig",
	YEAR = 1988,
 	month = "",
	address = "",
	type = "Studienarbeit",
	copy = ""
}


@MASTERSTHESIS{Fer89,
	AUTHOR = "H. Fernau",
	TITLE = "Verallgemeinerungen {$k$}-limitierter {L}indenmayer-{S}ysteme",
	SCHOOL = "TU Braunschweig",
	YEAR = 1989,
	ADDRESS = "D-3300 Braunschweig",
	TYPE = "Diplomarbeit",
	MONTH = jul,
	note = ""
}

@INPROCEEDINGS{Fer90,
	AUTHOR = "H. Fernau",
	TITLE = "Ersetzungssysteme mit eingeschr{\"a}nkter {P}arallelit{\"a}t",
	BOOKTITLE = "Workshop {\"u}ber {P}arallelverarbeitung",
	YEAR = 1990,
	month = sep,
	pages = "",
	organization = "{TU} {C}lausthal: {I}nformatik {C}olloquium
{L}essach ({\"O}sterreich)",
	copy = ""
}


@ARTICLE{Fer91,
	AUTHOR = "H. Fernau",
	TITLE = "On function-limited {L}indenmayer systems",
	JOURNAL = eikneu,
	YEAR = 1991,
	volume = 27,
	number = 1,
	pages = "21--53",
	copy = ""
}

@INPROCEEDINGS{Fer91a,
	AUTHOR = "H. Fernau",
	TITLE = "Ersetzungssysteme mit eingeschr{\"a}nkter {P}arallelit{\"a}t",
	BOOKTITLE = "Workshop {\"u}ber {P}arallelverarbeitung
({I}nformatik-{B}ericht 91/1)",
	YEAR = 1991,
	month = "",
	pages = "41--58",
	organization = "{TU} {C}lausthal: {I}nformatik {C}olloquium
{L}essach ({\"O}sterreich) 1990",
	copy = ""
}

@INPROCEEDINGS{Fer92,
	AUTHOR = "H. Fernau",
	TITLE = "Unendliche {I}terierte {F}untionensysteme ({IIFS})",
	editor = "K. Ecker and R. Hirschberg",
	BOOKTITLE = "Workshop {\"u}ber {P}arallelverarbeitung
({I}nformatik-{B}ericht 92/1)",
	YEAR = 1992,
	month = "",
	pages = "39--61",
	organization = "{TU} {C}lausthal: {I}nformatik {C}olloquium
{L}essach ({\"O}sterreich) 1991",
	copy = ""
}


@INPROCEEDINGS{Fer92d,
	crossref = "Tho92",
	AUTHOR = "H. Fernau",
	TITLE = "{MRFS}-{F}raktale aus dem {B}lickwinkel der regul{\"a}ren {$\omega$}-{S}prachen",
	chapter = "",
	pages = "46--50",
	copy = ""
}

@PHDTHESIS{Fer93,
	AUTHOR = "H. Fernau",
	TITLE = "Varianten {I}terierter {F}unktionensysteme und {M}ethoden der
{F}ormalen {S}prachen",
	SCHOOL = "Universit{\"a}t Karlsruhe (TH) (Germany)",
	YEAR = 1993,
 	month = "",
	address = "",
	type = "",
	copy = ""
}

@ARTICLE{Fer93a,
        AUTHOR = "H. Fernau",
        TITLE = "Adult Languages of Propagating Systems with Restricted Parallelism",
        year = 1993,
	JOURNAL = eikneu,        
	volume = 29,
	number = 5,
	pages = "249--267",
	copy = ""
}

@TECHREPORT{Fer93d,
        AUTHOR = "H. Fernau",
        TITLE = "{IIFS} and Codes (Extended version)",
	INSTITUTION = "Universit{\"a}t Karlsruhe, Fakult{\"a}t f{\"u}r Informatik",
        year = 1993,
	month = "",
	number = "23/93",
	copy = ""
}


@TECHREPORT{Fer93g,
	AUTHOR = "H. Fernau",
	TITLE = "Bewertungen regul{\"a}rer {A}usdr{\"u}cke, {Z}usammenh{\"a}nge mit strenger
{E}indeutigkeit regul{\"a}rer {A}usdr{\"u}cke sowie {A}nwendungen bei der
{B}erechnung der {H}ausdorff-{D}imension von {F}raktalen, die  mit regul{\"a}ren
{A}usdr{\"u}cken beschrieben werden, in: {V}. {D}iekert: {T}heorietag in {D}agstuhl",
	INSTITUTION = "Universit{\"a}t Stuttgart",
	YEAR = 1993,
	month = oct,
	number = "",
	address = "",
	copy = ""
}


@INPROCEEDINGS{Fer94,
	AUTHOR = "H. Fernau",
	TITLE = "Remarks on adult languages of propagating systems
with restricted parallelism",
	BOOKTITLE = "Developments in Language Theory (Turku, 1993)",
	PUBLISHER = "Singapore: World Scientific",
	YEAR = 1994,
	month = "",
	volume = "",
	editor = "G. Rozenberg and A. Salomaa",
	series = "",
	chapter = "Classical Language Theory",
	pages = "90--101",
	address = "",
	organization = "",
	copy = ""
}

@BOOK{Fer94a,
	AUTHOR = "H. Fernau",
	TITLE = "Iterierte Funktionen, Sprachen und Fraktale",
	PUBLISHER = "Mannheim: BI-Verlag",
	YEAR = 1994,
	month = "",
	volume = "",
	edition = "",
	series = "",
	copy = ""
}

@ARTICLE{Fer94b,
        AUTHOR = "H. Fernau",
        TITLE = "Infinite iterated function systems",
        JOURNAL = mn,
        year = 1994,
	month = "",
	volume = "169",
	number = "",
	pages = "79--91",
	copy = ""
}

@Inproceedings{Fer94c,
	crossref = "DieTeo94",
	AUTHOR = "H. Fernau",
	TITLE = "Bewertungen regul{\"a}rer {A}usdr{\"u}cke, {Z}usammenh{\"a}nge mit strenger
{E}indeutigkeit regul{\"a}rer {A}usdr{\"u}cke sowie {A}nwendungen bei der
{B}erechnung der {H}ausdorff-{D}imension von {F}raktalen, die  mit regul{\"a}ren
{A}usdr{\"u}cken beschrieben werden",
	pages = "18--19",
	copy = ""

}


@TECHREPORT{Fer94g,
	AUTHOR = "H. Fernau",
	TITLE = "Observations on Grammar and Language Families",
	INSTITUTION = "Universit{\"a}t {K}arlsruhe, {F}akult{\"a}t f{\"u}r {I}nformatik",
	YEAR = 1994,
	month = aug,
	number = "22/94",
	address = "",
	NOTE = "Most of this report will appear in " # fundinform # "
in 1996",
	copy = ""
}


@TECHREPORT{Fer94i,
	AUTHOR = "H. Fernau",
	TITLE = "Membership for Limited {ET0L} Languages Is Not Decidable",
	INSTITUTION = "Universit{\"a}t {K}arlsruhe, {F}akult{\"a}t
f{\"u}r {I}nformatik",
	YEAR = 1994,
	month = dec,
	number = "34/94",
	address = "",
	copy = ""
}


@Incollection{Fer94k,
	AUTHOR = "H. Fernau",
	BookTITLE = "Developments In Theoretical Computer Science",
	PAGES = "141--152",
	TITLE = "{IIFS} and codes",
	PUBLISHER = "Basel: Gordon and Breach Science Publishers",
	YEAR = 1994,
	editor = "J. Dassow and A. Kelemenov\'a",
	month = "",
	address = "",
	volume = "",
	series = "",
	type = "",
	copy = ""
}

@ARTICLE{Fer94l,
	AUTHOR = "H. Fernau",
	TITLE = "Membership for 1-limited {ET0L} languages is not decidable",
	JOURNAL = eikneu,
	YEAR = 1994,
	month = "",
	volume = 30,
	number = "4",
	pages = "191--211",
	copy = ""
}

@ARTICLE{FerBor94,
        AUTHOR = "H. Fernau and H. Bordihn",
        TITLE = "Remarks on Accepting Parallel Systems",
	JOURNAL = ijcm,
	volume = 56,
	number = "",
        year = 1995,
	month = "",
        pages = {51--67},
	copy = ""
}

@INPROCEEDINGS{FerSta94,
        AUTHOR = "H. Fernau and L. Staiger",
        TITLE = "Valuations and unambiguity of languages, with
applications to fractal geometry",
        BOOKTITLE = "Automata, Languages and Programming, 21st
International Colloquium, ICALP 94",
        year = 1994,
	month = jul,
	volume = 820,
	editor = "S. Abiteboul and E. Shamir",
	series = "{LNCS}",
	chapter = "Theory of Computation",
	pages = "11--22",
	address = "",
	organization = "",
	copy = "",
        note = "ISBN: 3-540-58201-0"
}


@TECHREPORT{FerSta94b,
	AUTHOR = "H. Fernau and L. Staiger",
	TITLE = "Valuations and unambiguity of languages, with
applications to fractal geometry",
	INSTITUTION = "RWTH Aachen",
	YEAR = 1994,
	month = "",
	number = "94-22",
	address = "",
	copy = ""
}

@ARTICLE{Fer95,
        AUTHOR = "H. Fernau",
        TITLE = "Valuations of languages, with applications to fractal geometry",
        JOURNAL = tcs,
        year = 1995,
	month = jan,
	volume = "137",
	number = "2",
	pages = "177--217",
	copy = ""
}


@ARTICLE{Fer95c,
	AUTHOR = "H. Fernau",
	TITLE = "A note on uniformly limited {ET0L} systems with
		  unique interpretation",
	JOURNAL = ipl,
	YEAR = 1995,
	month = "",
	volume = 54,
	number = "",
	pages = "199--204",
	copy = ""
}

@ARTICLE{Fer95d,
	AUTHOR = "H. Fernau",
	TITLE = "A predicate for separating language classes",
	JOURNAL = eatcs,
	YEAR = 1995,
	month = jun,
	volume = 56,
	number = "",
	pages = "96--97",
	copy = ""
}

@INPROCEEDINGS{Fer95e,
	AUTHOR = "H. Fernau",
	TITLE = "Programmierte Grammatiken mit unbedingtem {\"U}bergang und verwandte Mechanismen",
	BOOKTITLE = "5. GI Theorietag ``Automaten und Formale
		  Sprachen'', Technical Report 9503, Universit{\"a}t Gie\ss{}en, Arbeitsgruppe Informatik",
	YEAR = 1995,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "47--57",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{FerBor95,
	AUTHOR = "H. Fernau and H. Bordihn",
	TITLE = "Programmierte {G}rammatiken und limitierte {L} {S}ysteme als {S}prachakzeptoren",
	BOOKTITLE = "4. GI Theorietag ``Automaten und Formale
		  Sprachen'', Technical Report WSI-95-10,
		  Universit{\"a}t T{\"u}bingen",
	YEAR = 1995,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "21--24",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{FerHolBor95,
	AUTHOR = "H. Fernau and M. Holzer and H. Bordihn",
	TITLE = "Accepting multi-agent systems: the case of cooperating distributed grammar systems",
	JOURNAL = caai,
	YEAR = 1996,
	month = "",
	volume = {},
	number = "",
	pages = "",
	copy = "",
        note = {Submitted for publication}
}


@INPROCEEDINGS{FerLanRei95,
	AUTHOR = "H. Fernau and K.-J. Lange and K. Reinhardt",
	TITLE = "Ein {P}l{\"a}doyer f{\"u}r den {E}igent{\"u}mer",
	BOOKTITLE = "27. Workshop {\"u}ber Komplexit{\"a}tstheorie,
		  {D}atenstrukturen und effiziente {A}lgorithmen",
	YEAR = 1995,
	month = nov,
	volume = "TUM-I9530",
	editor = "S. Bischof and others",
	series = "",
	chapter = "",
	pages = "11",
	address = "Technische {U}niversit{\"a}t {M\"u}nchen",
	organization = "",
	copy = ""
}

@ARTICLE{Fer96,
	AUTHOR = "H. Fernau",
        TITLE = "Valuations, regular expressions, and fractal geometry",
	JOURNAL = {Applicable Algebra in Engineering, Communication
		  and Computing},
	YEAR = 1996,
	month = "",
	volume = 7,
	number = "1",
	pages = "59--75",
	copy = ""
}

@ARTICLE{Fer96a,
	AUTHOR = "H. Fernau",
	TITLE = "Closure properties of ordered languages",
	JOURNAL = eatcs,
	YEAR = 1996,
	month = feb,
	volume = 58,
	number = "",
	pages = "159--162",
	copy = ""
}

@INPROCEEDINGS{Fer96b,
	AUTHOR = "H. Fernau",
	TITLE = "On unconditional transfer",
	BOOKTITLE = "MFCS'96",
	YEAR = 1996,
	month = "",
	volume = "1113",
	editor = "W. Penczek and A. Sza\l{}as",
	series = "LNCS",
	chapter = "",
	pages = "348--359",
	address = "",
	organization = "",
	copy = ""}

@ARTICLE{Fer96c,
	AUTHOR = "H. Fernau",
	TITLE = "Scattered Context Grammars with Regulation",
	JOURNAL = "Ann. Univ. Bucharest, Math.-Informatics Series",
	YEAR = 1996,
	month = "",
	volume = "45",
	number = "1",
	pages = "41--49"
}

@article{Fer96d,
        AUTHOR = "H. Fernau",
        TITLE = "Remarks on propagating partition-limited {ET0L}
                  systems",
	JOURNAL = jucs, 
		  pages = "745--755",
volume = 2, number = 11,
        year = 1996,
	month = "",
	copy = ""
}

@TECHREPORT{Fer96e,
        AUTHOR = "H. Fernau",
        TITLE = "Unconditional transfer in regulated rewriting",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
	YEAR = 1996,
	month = "",
	number = "WSI--96--21",
	address = "",note={A part of this report has been accepted
for publication in } #actainform,
	copy = ""
		  }
@article{Fer96f,
        AUTHOR = "H. Fernau",
        TITLE = "Membership for {$k$}-Limited {ET0L} languages is not
                  decidable",
        journal = jalc, 
		  volume = 1, 
		  pages={243--245},
        year = 1996,
	month = "",
	copy = ""
}


@ARTICLE{Fer96h,
	AUTHOR = "H. Fernau",
	TITLE = "On grammar and language families",
	JOURNAL = fundinform,
	YEAR = 1996,
	month = "",
	volume = 25,
	number = "1",
	pages = "17--34",
	copy = ""
}

@INPROCEEDINGS{FerFre96,
	AUTHOR = "H. Fernau and R. Freund",
	TITLE = "Bounded parallelism in array grammars  used for
		  character recognition",
	BOOKTITLE = "Advances in Structural and Syntactical Pattern
Recognition (Proceedings of the SSPR'96)",
	YEAR = 1996,
	month = "", publisher = {Springer},
	volume = "1121",
	editor = "P. Perner and P. Wang and A. Rosenfeld",
	series = "LNCS",
	chapter = "",
	pages = "40--49",
	address = "",
	organization = "",
	copy = ""
}
		  
@INCOLLECTION{FerFre97,
        AUTHOR = "H. Fernau and R. Freund",
        TITLE = "Accepting array grammars with control mechanisms",
	BOOKTITLE = "New Trends in Formal Languages",
	PUBLISHER = "Berlin: Springer",
	YEAR = 1997,
	month = "",
	volume = "1218",
	editor = "Gh. P\u aun and A. Salomaa",
	series = "LNCS",
	chapter = "",
	pages = "95--118",
	address = "",
	type = "",
	copy = ""
}

@TECHREPORT{FerFreHol96,
	AUTHOR = "H. Fernau and R. Freund and M. Holzer",
	TITLE = "External versus Internal Hybridization for Cooperating
	Distributed Grammar Systems",
	INSTITUTION = "Technische Universit{\"a}t  Wien (Austria)",
	YEAR = 1996,
	month = "",
	number = "TR 185--2/FR--1/96",
	address = "",
	copy = ""
}

@TECHREPORT{FerHol96,
	AUTHOR = "H. Fernau and M. Holzer",
	TITLE = "Bidirectional cooperating distributed grammar systems",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
	YEAR = 1996,
	month = "",
	number = "WSI--96--1",
	address = "",
	copy = ""
		  }

@TECHREPORT{FerHol96a,
	AUTHOR = "H. Fernau and M. Holzer",
	TITLE = "Regulated Finite Index Language Families Collapse",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
	YEAR = 1996,
	month = "",
	number = "WSI--96--16",
	address = "",
	copy = ""
		  }
@article{FerHol96b,
        AUTHOR = "H. Fernau and M. Holzer",
        TITLE = "Accepting multi-agent systems {II}",
        journal = actacybern, 
		  volume = 12, 
		  pages = {361--379},
        year = 1996,
	month = "",
	copy = ""
}

@ARTICLE{FerHolBor96,
	AUTHOR = "H. Fernau and M. Holzer and H. Bordihn",
	TITLE = "Accepting multi-agent systems: the case of
		  cooperating distributed grammar systems",
	JOURNAL = caai,
	YEAR = 1996,
	month = "",
	volume = {15},
	number = "2-3",
	pages = "123--139",
	copy = ""}


@INPROCEEDINGS{FerHolFre96a,
	AUTHOR = "H. Fernau and M. Holzer and R. Freund",
        TITLE = "Bounding resources in multi-agent systems",
	BOOKTITLE = "6. GI Theorietag ``Automaten und Formale
		  Sprachen'', Technical Report MATH-AL-7-1996, Institut f{\"u}r Algebra, Technische Universit{\"a}t Dresden",
	YEAR = 1996,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "29--30",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{FerLanRei96,
	AUTHOR = "H. Fernau and K.-J. Lange and K. Reinhardt",
	TITLE = "Advocating Ownership",
	BOOKTITLE = "Proceedings of the 16th~Conference on Foundations of Software
		Technology and Theoretical Computer Science",
	YEAR = 1996,
	month = dec,
	volume = "1180",
	editor = "V. Chandru",
	series = "LNCS",
        publisher = "Springer", 
	chapter = "",
	pages = "286--297",
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{FerSti96a,
	AUTHOR = "H. Fernau and R. Stiebe",
	TITLE = "L-Systeme mit {V}alenzen und {B}ewertungen",
	BOOKTITLE = "6. GI Theorietag ``Automaten und Formale
		  Sprachen'', Technical Report MATH-AL-7-1996, Institut f{\"u}r Algebra, Technische Universit{\"a}t Dresden",
	YEAR = 1996,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "27--28",
	address = "",
	organization = "",
	copy = ""
}

@TECHREPORT{FerWat96,
        AUTHOR = "H. Fernau and D. W{\"a}tjen",
        TITLE = "Remarks on regulated limited {ET0L} systems and regulated
context-free grammars",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
	YEAR = 1996,
	month = "",
	number = "WSI--96--19",
	address = "",
	copy = "",
        note = "Accepted for publication in " # tcs		  }
}

@ARTICLE{Fer97,
	AUTHOR = "H. Fernau",
	TITLE = "Graph-controlled grammars as language acceptors",
	JOURNAL = jalc,
	YEAR = 1997,
	month = "",
	volume = 2,
	number = "2",
	pages = "79--91",
	copy = ""
}

@ARTICLE{Fer97a,
	AUTHOR = "H. Fernau",
	TITLE = "Unconditional transfer in regulated rewriting",
	JOURNAL = actainform,
	YEAR = 1997,
	month = "",
	volume = 34,
	number = "",
	pages = "837--857",
	copy = ""
}

@INCOLLECTION{FerHol97a,
	AUTHOR = "H. Fernau and M. Holzer",
	TITLE = "Conditional context-free languages of finite index",
	BOOKTITLE = "New Trends in Formal Languages",
	PUBLISHER = "Springer",
	YEAR = 1997,
	month = "",
	volume = "1218",
	editor = "Gh. P\u aun and A. Salomaa",
	series = "LNCS",
	chapter = "",
	pages = "10--26",
	address = "",
	type = "",
	copy = ""
}

@Inproceedings{FerHolFre97,
        AUTHOR = "H. Fernau and M. Holzer and R. Freund",
        TITLE = "Bounding resources in cooperating distributed grammar systems",
	BOOKTITLE = "Proc. of the 3rd Int. Conf. Developments in Language Theory",
	PUBLISHER = "Aristotle University of Thessaloniki",
	YEAR = 1997,
	month = "",
	volume = "",
	editor = "S. Bozapalidis",
	series = "",
	chapter = "",
	pages = "261--272",
	address = "",
	type = "",
	copy = ""
}


@TECHREPORT{FerSte97,
        AUTHOR = "H. Fernau and F. Stephan",
        TITLE = "How Powerful is Unconditional Transfer? ---{W}hen {UT} meets {AC}.---",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
	YEAR = 1997,
	month = "",
	number = "WSI--97--7",
	address = "",
	copy = "",
        NOTE = "Short version to be published in the proceedings of  DLT'97",
}

@INproceedings{FerSte97a,
        AUTHOR = "H. Fernau and F. Stephan",
        TITLE = "How Powerful is Unconditional Transfer? ---{W}hen {UT} meets {AC}.---",
	BOOKTITLE = "Proc. of the 3rd Int. Conf. Developments in Language Theory",
	PUBLISHER = "Aristotle University of Thessaloniki",
	YEAR = 1997,
	month = "",
	volume = "",
	editor = "S. Bozapalidis",
	series = "",
	chapter = "",
	pages = "249--260",
	address = "",
	type = "",
	copy = ""
}

@INPROCEEDINGS{FerSti97a,
	AUTHOR = "H. Fernau and R. Stiebe",
	TITLE = "Regulation by Valences",
	BOOKTITLE = "MFCS'97",
	YEAR = 1997,
	month = "",
	volume = "1295",
	editor = "I.~Pr{\'\i}vara and P. Ru{\v z}i{\v c}ka",
	series = "LNCS",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{Fer98,
	AUTHOR = "H. Fernau",
	TITLE = "On graph-controlled grammars with leftmost derivation",
	BOOKTITLE = "Workshop on Formal Languages, Automata and Petri Nets",
	YEAR = 1998,
	month = "",
	volume = "01/1998",
	editor = "H. Petersen",
	series = "",
	chapter = "",
	pages = "7",
	address = "",
	organization = "Institut f{\"ur} Informatik, Universit{\"a}t Stuttgart",
	copy = ""
}

@INPROCEEDINGS{Fer98a,
	AUTHOR = "H. Fernau",
	TITLE = "Regulated Grammars with Leftmost Derivation",
	BOOKTITLE = "SOFSEM'98",
	YEAR = 1998,
	month = "",
	volume = "1521",
	editor = "B. Rovan",
	series = "LNCS",
	chapter = "",
	pages = "322--331",
	address = "",
	organization = "",
	copy = ""
}


@INPROCEEDINGS{FerFreHol98a,
	AUTHOR = "H. Fernau and R. Freund and M. Holzer",
	TITLE = "The Generative Power of {$d$}-Dimensional 
\#-Context-Free Array Grammars",
	BOOKTITLE = "Proceedings of MCU'98, Volume 2",
	YEAR = 1998,
	month = "",
	volume = "",
	editor = "M. Margenstern",
	series = "",
	chapter = "",
	pages = "43--56",
	address = "",
	organization = "University of Metz",
	copy = ""
}

@INPROCEEDINGS{FerFreHol98c,
	AUTHOR = "H. Fernau and R. Freund and M. Holzer",
	TITLE = "Character recognition with $k$-head finite array automata",
	BOOKTITLE = "Proceedings of SSPR'98",
	YEAR = 1998,
	month = "",
	volume = "1451",
	editor = "A. Amin and others",
	series = "LNCS",
	chapter = "",
	pages = "282--291",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{FerSta98,
	AUTHOR = "H. Fernau and L. Staiger",
	TITLE = "{IFS} and control languages",
	BOOKTITLE = "MFCS'98",
	YEAR = 1998,
	month = "",
	volume = "1450",
	editor = "L. Brim and J. Gruska and J. {Zlatu\v ska}",
	series = "LNCS",
	chapter = "",
	pages = "740--750",
	address = "",
	organization = "",
	copy = ""
}

@TECHREPORT{FerSti98,
	AUTHOR = "H. Fernau and R. Stiebe",
	TITLE = "Regulation by valences",
	YEAR = 1998,
 institution ={Martin-Luther-Universit\"at Halle-Wittenberg, Fachbereich Mathematik und Informatik}, number = {36},
	note = "An extended abstract appeared in \cite{FerSti97a}.",
}

@article{FerWat98,
        AUTHOR = "H. Fernau and D. W{\"a}tjen",
        TITLE = "Remarks on regulated limited {ET0L} systems and regulated
context-free grammars",
		  journal = tcs,
	YEAR = 1998, volume =  194,
		  number = {1--2}, pages = {35--55},
}

@INPROCEEDINGS{Fer99,
	AUTHOR = "H. Fernau",
	TITLE = "Efficient learning of some linear matrix languages",
	BOOKTITLE = "COCOON'99",
	YEAR = 1999,
	month = "",
	volume = "1627",
	editor = "T. Asano and others",
	series = "LNCS",
	chapter = "",
	pages = "221--230",
	address = "", publisher = {Springer}, 
	organization = "",
	copy = ""
}
@techreport{Fer99a,
        AUTHOR = "H. Fernau",
        TITLE = "Learning of terminal distinguishable languages",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
        year = 1999,	number = "WSI--99--23",
	month = "",
	copy = "", NOTE = "Short version published in the proceedings of  AMAI 2000, see {\tt http://rutcor.rutgers.edu/\~{}amai/aimath00/AcceptedCont.htm}",
}

@INPROCEEDINGS{Fer00,
	AUTHOR = "H. Fernau",
	TITLE = "Learning of terminal distinguishable languages",
	BOOKTITLE = "Proc. AMAI 2000",
	YEAR = 2000,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = "", NOTE = "Available through:\\ {\tt http://rutcor.rutgers.edu/\~{}amai/aimath00/AcceptedCont.htm}",
}



@InBOOK{FerFreHol99,
        chapter= "H. Fernau, R. Freund, and M. Holzer: Regulated array grammars of finite index",
        editor = {Gh. P{\u{a}}un and A. Salomaa},
        Title = "Grammatical Models of Multi-Agent Systems",
        publisher = {London: Gordon and Breach},
        year = 1999,
 pages = {157--181 (Part I) and 284--296  (Part II)},
	month = "",
	copy = ""
}

@article{FerHol99,
	AUTHOR = "H. Fernau and M. Holzer",
	TITLE = "Bidirectional cooperating distributed grammar systems",
	YEAR = 1999,
journal = publmath, volume = 54,
	month = "",
	number = "Supplement", pages = {787--806},
	address = "",
	copy = ""
		  }


@TECHREPORT{FerNie99,
	AUTHOR = "H. Fernau and R. Niedermeier",
	TITLE = "An efficient exact algorithm for constraint bipartite vertex cover",
	INSTITUTION = "Technical Report Charles University, Praha, Faculty of
     Mathematics and Physics",
	YEAR = 1999,
	month = mar,
	number = "KAM-DIMATIA Series 99-424",
	address = "",
	copy = ""
}

@INPROCEEDINGS{FerNie99a,
	AUTHOR = "H. Fernau and R. Niedermeier",
	TITLE = "An efficient exact algorithm for constraint bipartite vertex cover",
	BOOKTITLE = "MFCS'99",
	YEAR = 1999,
	month = "",
	volume = "1672",
	editor = "M. Kuty\l{}owski, L. Pacholski and T. Wierzbicki",
	series = "LNCS",
	chapter = "",
	pages = "387--397",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{FerNie99b,
	AUTHOR = "H. Fernau and R. Niedermeier",
	TITLE = "An efficient exact algorithm for constraint bipartite vertex cover",
	BOOKTITLE = "38. Workshop {\"u}ber Komplexit{\"a}tstheorie, Datenstrukturen und effiziente Algorithmen",
	YEAR = 1999,
	month = jun,
	volume = "44",
	editor = "K. Ambos-Spies and others",
	series = "Forschungsberichte Mathematische Logik",
	chapter = "",
	pages = "8",
	address = "",
	organization = "",
	copy = ""
}

@TECHREPORT{FerSta99,
	AUTHOR = "H. Fernau and L. Staiger",
	TITLE = "{IFS} and control languages",
	YEAR = 1999,
 institution ={Martin-Luther-Universit\"at Halle-Wittenberg, Fachbereich Mathematik und Informatik}, number = {16},
	note = "An extended abstract appeared in \cite{FerSta98}. The paper has been accepted for publication in " #icneu,
}

@article{FerSte99,
        AUTHOR = "H. Fernau and F. Stephan",
        TITLE = "Characterizations of recursively enumerable languages by programmed grammars with unconditional transfer",
	YEAR = 1999,
journal = jalc, pages = {117--142}, volume = 4, 
	month = "",
	number = "2",
	address = "",
	copy = "",
}

@INPROCEEDINGS{Fer00a,
	AUTHOR = "H. Fernau",
	TITLE = "{PC} grammar systems with terminal transmission",
	BOOKTITLE = "Proc. International Workshop on Grammar Systems",
	YEAR = 2000,
	month = "",
	volume = "",
	editor = "R. Freund and A. Kelemenov\'a",
	series = "",
	chapter = "",
	pages = "229--252",
	address = "",
	organization = "Silesian University at Opava",
	copy = "", 
}


@INPROCEEDINGS{Fer00b,
	AUTHOR = "H. Fernau",
	TITLE = "$k$-gram extensions of terminal distinguishable languages",
	BOOKTITLE = "International Conference on Pattern Recognition (ICPR 2000)",
	YEAR = 2000,
	month = "",
	volume = "2",
	editor = "",
	series = "",
	chapter = "",
	pages = "125--128",
	address = "", publisher = {IEEE Press}, 
	organization = "IEEE/IAPR", 
	copy = "", 
}

@TECHREPORT{Fer00c,
	AUTHOR = "H. Fernau",
	TITLE = "Efficient Learning of Some Linear Simple Matrix Languages",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
	YEAR = 2000,
	month = "",
	number = "WSI--2000--9",
	address = "",
	copy = "",
        NOTE = "Short version has been published in the proceedings of  COCOON'99",
}

@TECHREPORT{Fer00d,
	AUTHOR = "H. Fernau",
	TITLE = "On Learning Function Distinguishable Languages",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
	YEAR = 2000,
	month = "",
	number = "WSI--2000--13",
	address = "",
	copy = "", note={A conference version will appear at ALT 2000}
}


@TECHREPORT{Fer00f,
	AUTHOR = "H. Fernau",
	TITLE = "Parallel communicating grammar systems with terminal transmission",
institution = {Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik},
	YEAR = 2000,
	month = aug,
	number = "WSI--2000--15",
	address = "",
	copy = "", note = {Extended version of \cite{Fer00a}. A modified
version will appear in }#actainform
}

@ARTICLE{Fer00g,
	AUTHOR = "H. Fernau",
	TITLE = "On regulated grammars under leftmost derivation",
	JOURNAL = {GRAMMARS},
	YEAR = 2000,
	month = "",
	volume = 3,
	number = "1",
	pages = "37--62",
	copy = ""
}

@INPROCEEDINGS{Fer00h,
	AUTHOR = "H. Fernau",
	TITLE = "Identification of function distinguishable languages",
	BOOKTITLE = "Proceedings of the 11th International Conference Algorithmic Learning Theory ALT 2000",
	YEAR = 2000,
	month = "",
	volume = "1968",
	editor = "H. Arimura and S. Jain and A. Sharma",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "116--130",  publisher = {Springer}, 
	address = "",
	organization = "",
	copy = ""
}

@TECHREPORT{Fer00i,
	AUTHOR = "H. Fernau",
	TITLE = "Nonterminal complexity of programmed grammars",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
	YEAR = 2000,
	month = "",
	number = "WSI--2000--26"}


@INPROCEEDINGS{FerFreHol00,
	AUTHOR = "H. Fernau and R. Freund and M. Holzer",
	TITLE = "Cooperating distributed grammar systems with exhausting resources",
	BOOKTITLE = "Proc. International Workshop on Grammar Systems",
	YEAR = 2000,
	month = "",
	volume = "",
	editor = "R. Freund and A. Kelemenov\'a",
	series = "",
	chapter = "",
	pages = "113--125",
	address = "",
	organization = "Silesian University at Opava",
	copy = "", 
}

@INBOOK{FerHol00,
        editor = "C. Martin-Vide and Gh. P\u aun",
        TITLE = "Recent topics in mathematical and computational linguistics",
	PAGES = "104--120",
	CHAPTER = "H. Fernau and M. Holzer: External contextual and conditional languages",
	PUBLISHER = "Bucharest: The Publishing House of the Romanian Academy",
	YEAR = 2000,
	month = "",
	address = "",
note= {ISBN 973-27-0770-4}, 
	type = "",
	copy = ""
}

@INBOOK{FerKui00,
	editOR = "C. Martin-Vide and V. Mitrana",
	TITLE = "Where Mathematics, Computer Science, Linguistics and Biology Meet",
	PAGES = "253--265",
	CHAPTER = "23: H.~Fernau and W.~Kuich: Regularly controlled formal power series",
	PUBLISHER = "Dordrecht: Kluwer",
	YEAR = 2000,
	month = "",
	address = "",
	volume = {},
	series = "",
	type = "",
	copy = ""
}


@TECHREPORT{FerReiSta00,
	AUTHOR = "H. Fernau and K. Reinhardt and L. Staiger",
	TITLE = "Decidability of code properties",
	YEAR = 2000,
 institution ={Martin-Luther-Universit\"at Halle-Wittenberg, Fachbereich Mathematik und Informatik}, number = {11},
	note = "An extended abstract appeared in the Preproceedings of the Conference `Developments in Language Theory IV' (W. Thomas, ed.),
Aachener Informatik-Berichte 99-5, pp. 381--393. 
The paper has been submitted for publication in " #jcss,
}

@INPROCEEDINGS{FerReiSta00a,
	AUTHOR = "H. Fernau and K. Reinhardt and L. Staiger",
	TITLE = "Decidability of code properties",
	BOOKTITLE = "Developments in Language Theory; Foundations, Applications, and Perspectives",
	YEAR = 2000,
	month = "",
	volume = "",
	editor = "G. Rozenberg and W. Thomas",
	series = "",
	chapter = "",
	pages = "153--163", publisher = {World Scientific}, 
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{FerSem00,
           AUTHOR = "H. Fernau and J. M. Sempere",
        TITLE = "Permutations and control sets for learning non-regular language families",
	BOOKTITLE = "Grammatical Inference: Algorithms and Applications, 5th International Colloquium ICGI 2000",
	YEAR = 2000,
	month = "",
	volume = "1891",
	editor = "A.~L. Oliveira",
	series = "LNCS/LNAI",
	chapter = "",  publisher = {Springer}, 
	pages = "75--88",
	address = "",
	organization = "",
	copy = ""
}

@TECHREPORT{FerSti00,
	AUTHOR = "H. Fernau and R. Stiebe",
	TITLE = "Valences in Parallel Systems",
	INSTITUTION = {Martin-Luther-Universit\"at Halle-Wittenberg, Fachbereich Mathematik und Informatik},
	YEAR = 2000,
	month = "",
	number = "18",
	address = "", note={Revised version to appear in: }#fundinform,
	copy = ""
}

@TECHREPORT{FerSti00a,
	AUTHOR = "H. Fernau and R. Stiebe",
	TITLE = "Sequential Grammars and Automata with Valences",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
	YEAR = 2000,
	month = "",
	number = "WSI--2000--25", note = {Revised version to appear in }#tcs}


@TECHREPORT{Fer01,
        AUTHOR = "H. Fernau",
        TITLE = "Learning {XML} Grammars",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
        NOTE = "A revised version is published in the
Proceedings of \emph{Machine Learning and Data Mining MLDM'01}, LNCS 2123",
        year = 2001,	number = "WSI--2001--1",
	month = "",
	copy = ""
}

@TECHREPORT{Fer01a,
        AUTHOR = "H. Fernau",
        TITLE = "Approximative Learning of Regular Languages",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
        year = 2001,	number = "WSI--2001--2",
	month = "",
	copy = ""
}
@ARTICLE{Fer01b,
	AUTHOR = "H. Fernau",
	TITLE = "Parallel communicating grammar systems with terminal transmission",
	JOURNAL = actainform,
	YEAR = 2001,
	month = "",
	volume = 37,
	number = "",
	pages = "511--540",
	copy = ""
}
@INPROCEEDINGS{Fer01c,
	AUTHOR = "H. Fernau",
	TITLE = "Even linear simple matrix languages: formal language aspects",
	BOOKTITLE = "Discrete Mathematics and Theoretical Computer Science , DMTCS'01",
	YEAR = 2001,
	month = "",
	volume = "",
	editor = "C.S. Calude and M.J. Dinneen and S. Sburlan",
	series = "",
	chapter = "",
	pages = "81--96",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@INPROCEEDINGS{Fer01d,
	AUTHOR = "H. Fernau",
	TITLE = "Nonterminal complexity of programmed grammars",
	BOOKTITLE = "Machines, Computations, and Universality; 3rd MCU",
	YEAR = 2001,
	month = "",
	volume = "2055",
	editor = "M. Margenstern and Y. Rogozhin",
	series = "LNCS",
	chapter = "",
	pages = "202--213",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@INPROCEEDINGS{Fer01e,
	AUTHOR = "H. Fernau",
	TITLE = "Learning {XML} grammars",
	BOOKTITLE = "Machine Learning and Data Mining in Pattern Recognition MLDM'01",
	YEAR = 2001,
	month = "",
	volume = "2123",
	editor = "P. Perner",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "73--87",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{Fer01f,
  AUTHOR = "H. Fernau",
        TITLE = "Approximative learning of regular languages",
	BOOKTITLE = "SOFSEM'01; Theory and Practice of Informatics",
	YEAR = 2001,
	month = "",
	volume = "2234",
	editor = "L. Pacholski and P. Ru{\v z}i{\v c}ka",
	series = "LNCS",
	chapter = "",
	pages = "223--232",
	address = "",
	organization = "",
        publisher = "Springer", 
	copy = ""
}

@TECHREPORT{Fer01g,
	AUTHOR = "H. Fernau",
	TITLE = "Learning tree languages from text",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
        year = 2001,	number = "WSI--2001--19",
	address = "",
	copy = ""
}

@INPROCEEDINGS{Fer01h,
	AUTHOR = "H. Fernau",
	TITLE = "Even linear simple matrix languages:
 formal language properties and grammatical inference",
	BOOKTITLE = "11. GI Theorietag ``Automaten und Formale
		  Sprachen'', Preprint Nr. 18, Fak. f{\"u}r Informatik, Universit{\"a}t Magdeburg",
	YEAR = 2001,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "47--51",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@TECHREPORT{Fer01i,
	AUTHOR = "H. Fernau",
	TITLE = "On Parameterized Enumeration",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
        year = 2001,	number = "WSI--2001--21",
	address = "",
	copy = ""
}

@TECHREPORT{Fer01j,
	AUTHOR = "H. Fernau",
	TITLE = "Parameterized Maximization",
	INSTITUTION = "Universit{\"a}t T{\"u}bingen (Germany),
		  Wilhelm-Schickard-Institut f{\"u}r Informatik",
        year = 2001,	number = "WSI--2001--22",
	address = "",
	copy = ""
}

@article{FerFreHol01,
        author =        {H. Fernau and R. Freund and M. Holzer},
        title =         {Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization},
        journal =       tcs,
        volume =        259,
        number =        {1--2},
        pages =         {405--426}, year =2001
}

@inproceedings{FerHol01,
        author =        {H. Fernau and M. Holzer},
        title =         {Graph-Controlled Cooperating Distributed Grammar System
s with Singleton Components},
        booktitle =     {Proceedings of the $3$rd International Workshop on Desc
riptional Complexity of Automata, Grammars and Related Structures},
        month =         jul,
        year =          2001,
        address =       {Wien, Austria},
        pages =         {79--90},
        editor =        {J. Dassow and D. Wotschke},
        organization =  {Fakult\"at f\"ur Informatik},
        publisher =     {Otto-von-Guericke-Universit\"at Magdeburg},
        annote =        {Preprint Nr. 16}
}

@article{FerNie01,
	AUTHOR = "H. Fernau and R. Niedermeier",
	TITLE = "An efficient exact algorithm for constraint bipartite vertex cover",
	JOURNAL = jalg,
	YEAR = 2001,
	month = "",
	volume = 38,
	number = "2",
	pages = "374--410",
	copy = ""
}

@ARTICLE{FerSta01,
	AUTHOR = "H. Fernau and L. Staiger",
	TITLE = "Iterated function systems and control languages",
	JOURNAL = ic,
	YEAR = 2001,
	month = "",
	volume = 168,
	number = "",
	pages = "125--143",
	copy = ""
}

@ARTICLE{FerSti01,
	AUTHOR = "H. Fernau and R. Stiebe",
	TITLE = "Valences in {L}indenmayer systems",
	JOURNAL = fundinform,
	YEAR = 2001,
	month = "",
	volume = 45,
	number = "",
	pages = "329--358",
	copy = ""
}

@INPROCEEDINGS{FerSti01a,
	AUTHOR = "H. Fernau and R. Stiebe",
	TITLE = "Valuated and valence grammars: an algebraic view",
	BOOKTITLE = "Preproceedings DLT'01",
	YEAR = 2001,
	month = "",
	volume = "",
	editor = "W. Kuich",
	series = "",
	chapter = "",
	pages = "290--301",
	address = "",
	organization = "TU Wien, Institut f. Algebra und
Computermathematik",
        publisher = "",
	copy = ""
}


@INBOOK{FerSti01b,
        editor = "M. Ito and Gh. P\u aun and S. Yu",
        TITLE = "Words, Semigroups, and Transductions",
	PAGES = "129--140",
	CHAPTER = "H. Fernau and R. Stiebe: Valence Grammars with Target Sets",
	PUBLISHER = "Singapore: World Scientific",
	YEAR = 2001,
	month = "",
	address = "",
	type = "",
	copy = ""
}

@INPROCEEDINGS{Fer02,
	AUTHOR = "H. Fernau",
	TITLE = "Learning tree languages from text",
	BOOKTITLE = "Computational Learning Theory COLT 2002",
	YEAR = 2002,
	month = "",
	volume = "2375",
	editor = "J. Kivinen and R.~H. Sloan",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "153--168",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{Fer02a,
	AUTHOR = "H. Fernau",
	TITLE = "On parameterized enumeration",
	BOOKTITLE = "Computing and Combinatorics, Proceedings COCOON 2002",
	YEAR = 2002,
	month = "",
	volume = "2383",
	editor = "O.~H. Ibarra and L. Zhang",
	series = "LNCS",
	chapter = "",
	pages = "564--573",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{Fer02b,
	crossref = "ICGI2002",
	TITLE = "Fragmentation: enhancing identifiability",
	AUTHOR = "H. Fernau",
	pages = "92--105",
	chapter = "",
}

@INPROCEEDINGS{FerRad02,
	AUTHOR = "H. Fernau and A. Radl",
	TITLE = "Algorithms for learning function distinguishable regular languages",
	BOOKTITLE = "Structural, Syntactic, and Statistical Pattern Recognition  SSPR and SPR 2002",
	YEAR = 2002,
	month = "",
	volume = "2396",
	editor = "T. Caelli and A. Amin and R.~P.~W. Duin and M. Kamel and D. de Ridder",
	series = "LNCS",
	chapter = "",
	pages = "64--72",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{Fer02c,
	AUTHOR = "H. Fernau",
	TITLE = "Graph separator algorithms: a refined analysis",
	BOOKTITLE = "Graph-Theoretic Concepts in Computer Science WG 2002",
	YEAR = 2002,
	month = "",
	volume = "2573",
	editor = "L. Ku\v cera",
	series = "LNCS",
	chapter = "",
	pages = "186--197",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{Fer02d,
	AUTHOR = "H. Fernau",
	TITLE = "Even linear simple matrix languages: formal language properties and grammatical inference",
	JOURNAL = tcs,
	YEAR = 2002,
	month = "",
	volume = 289,
	number = "",
	pages = "425--489",
	copy = ""
}

@ARTICLE{FerHol02,
	AUTHOR = "H. Fernau and M. Holzer",
	TITLE = "Graph-Controlled Cooperating Distributed Grammar System
s with Singleton Components",
	JOURNAL = jalc,
	YEAR = 2002,
	month = "",
	volume = 7,
	number = "",
	pages = "487--503",
	copy = ""
}



@INPROCEEDINGS{FerSti02,
	AUTHOR = "H. Fernau and R. Stiebe",
	TITLE = "Valuated and valence grammars: an algebraic view",
	BOOKTITLE = "Proceedings DLT'01",
	YEAR = 2002,
	month = "",
	volume = "2295",
	editor = "W. Kuich and G. Rozenberg and A. Salomaa",
	series = "LNCS",
	chapter = "",
	pages = "281--292",
	address = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{FerSti02a,
	AUTHOR = "H. Fernau and R. Stiebe",
	TITLE = "Sequential grammars and automata with valences",
	JOURNAL = tcs,
	YEAR = 2002,
	month = "",
	volume = 276,
	number = "",
	pages = "377--405",
	copy = ""
}

@ARTICLE{FerMed02,
	AUTHOR = "H. Fernau and A. Meduna",
	TITLE = "On the degree of scattered context-sensitivity",
	JOURNAL = tcs,
	YEAR = 2002,
	month = "",
	volume = {To appear},
	number = "",
	pages = "",
	copy = ""
}

@misc{FerMed02a,
	AUTHOR = "H. Fernau and A. Meduna",
	TITLE = {A simultaneous reduction of several 
measures of descriptional complexity in
 scattered context grammars},
note = {Submitted for publication}
}




@ARTICLE{Fer03,
	AUTHOR = "H. Fernau",
	TITLE = "Identification of function distinguishable languages",
	JOURNAL = tcs,
	YEAR = 2003,
	month = "",
	volume = 290,
	number = "",
	pages = "1679--1711",
	copy = ""
}


@ARTICLE{Fer03a,
	AUTHOR = "H. Fernau",
	TITLE = "Parallel Grammars: A Phenomenology",
	JOURNAL = {GRAMMARS},
	YEAR = 2003,
	month = "",
	volume = 6,
	number = "",
	pages = "25--87",
	copy = ""
}

@ARTICLE{Fer03b,
	AUTHOR = "H. Fernau",
	TITLE = "Nonterminal complexity of programmed grammars",
	JOURNAL = tcs,
	YEAR = 2003,
	month = "",
	volume = 296,
	number = "",
	pages = "225--251",
	copy = ""
}


@ARTICLE{FerFreHol03,
	AUTHOR = "H. Fernau and R. Freund and M. Holzer",
	TITLE = "Hybrid modes in cooperating distributed grammar systems: combining the $t$-mode with the modes $\leq k$ and $= k$",
	JOURNAL = tcs,
	YEAR = 2003,
	month = "",
	volume = 299,
	number = "",
	pages = "633--662",
	copy = ""
}

@ARTICLE{FerHolFre03,
	AUTHOR = "H. Fernau and M. Holzer and R. Freund",
	TITLE = "Hybrid modes in cooperating distributed grammar systems: combining the $t$-mode with the modes $\leq k$ and $= k$",
	JOURNAL = tcs,
	YEAR = 2003,
	month = "",
	volume = 299,
	number = "",
	pages = "633--662",
	copy = ""
}

@INPROCEEDINGS{Feretal03,
	AUTHOR = "H. Fernau and T. Hagerup and N. Nishimura and P. Ragde and K. Reinhardt",
	TITLE = "On the parameterized complexity of a generalized Rush Hour puzzle",
	BOOKTITLE = "Canadian Conference on Computational Geometry, CCCG 2003",
	YEAR = 2003,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "6--9",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}



@ARTICLE{FerMed03,
	AUTHOR = "H. Fernau and A. Meduna",
	TITLE = "On the degree of scattered context-sensitivity",
	JOURNAL = tcs,
	YEAR = 2003,
	month = "",
	volume = 290,
	number = "",
	pages = "2121--2124",
	copy = ""
}
@ARTICLE{FerMed03a,
	AUTHOR = "H. Fernau and A. Meduna",
	TITLE = "A simultaneous reduction of several
measures of descriptional complexity in
 scattered context grammars",
	JOURNAL = ipl,
	YEAR = 2003,
	month = "",
	volume = 86,
	number = "",
	pages = "235--240",
	copy = ""
}


@ARTICLE{Fer04,
	AUTHOR = "H. Fernau",
	TITLE = "Identifying terminal distinguishable languages",
	JOURNAL = amai,
	YEAR = 2004,
	month = "",
	volume = 40,
	number = "",
	pages = "263--281",
	copy = ""
}

@ARTICLE{Fer04a,
	AUTHOR = "H. Fernau",
	TITLE = "Complexity of a $\{0,1\}$-matrix problem",
	JOURNAL = {The Australasian Journal of Combinatorics},
	YEAR = 2004,
	month = "",
	volume = 29,
	number = "",
	pages = "273--300",
	copy = ""
}

@TECHREPORT{Fer04b,
	AUTHOR = "H. Fernau",
	TITLE = "Parametric Duality: Kernel Sizes and Algorithmics",
	INSTITUTION = "Electronic Colloquium on Computational Complexity ECCC",
	YEAR = 2004,
	month = "",
	number = "TR04-027",
	address = "",
	copy = ""
}

@TECHREPORT{Fer04c,
	AUTHOR = "H. Fernau",
	TITLE = "A Top-Down Approach to Search-Trees: Improved Algorithmics for {3-Hitting Set}",
	INSTITUTION = "Electronic Colloquium on Computational Complexity ECCC",
	YEAR = 2004,
	month = "",
	number = "TR04-073",
	address = "", note = {An updated version has been accepted to } #
 alg,
	copy = ""
}

@TECHREPORT{Fer04d,
	AUTHOR = "H. Fernau",
	TITLE = "Two-Layer Planarization: Improving on Parameterized Algorithmics",
	INSTITUTION = "Electronic Colloquium on Computational Complexity ECCC",
	YEAR = 2004,
	month = "",
	number = "TR04-078",
	address = "",
	copy = ""
}

@INPROCEEDINGS{Fer04e,
	AUTHOR = "H. Fernau",
	TITLE = "Extracting minimum length {D}ocument {T}ype {D}efinitions in {NP}-hard",
	BOOKTITLE = "Workshop Formale Methoden der Linguistik und 14. Theorietag Automaten 
und 
  Formale Sprachen",
	YEAR = 2004,
	month = "",
	volume = "",
	editor = "S. Bensch and O. Boldt and H. Bordihn and H. J{\"u}rgensen",
	series = "Preprint 2/2004, Institut f{\"u}r Informatik, Universit{\"a}t Potsdam",
	chapter = "",
	pages = "55--56",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@INPROCEEDINGS{Fer04f,
	AUTHOR = "H. Fernau",
	TITLE = "Extracting minimum length {D}ocument {T}ype {D}efinitions in {NP}-hard",
	BOOKTITLE = "Grammatical Inference: Algorithms and Applications; 7th International Colloquium ICGI",
	YEAR = 2004,
	month = "",
	volume = "3264",
	editor = "G. Paliouras and Y. Sakakibara",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "277--278",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@ARTICLE{FerHig04,
	AUTHOR = "H. Fernau and C. de la Higuera",
	TITLE = "Grammar Induction: An Invitation to Formal Language Theorists",
	JOURNAL = {GRAMMARS},
	YEAR = 2004,
	month = "",
	volume = 7,
	number = "",
	pages = "45--55",
	copy = ""
}

@INPROCEEDINGS{FerJue2004,
	AUTHOR = "H. Fernau and D. Juedes",
	TITLE = "A geometric approach to parameterized algorithms for domination problems on planar graphs",
	BOOKTITLE = "Mathematical Foundations of Computer Science MFCS 2004",
	YEAR = 2004,
	month = "",
	volume = "3153",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "488--499",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{Fer05,
	AUTHOR = "H. Fernau",
	TITLE = "Two-layer planarization: improving on parameterized algorithmics",
	BOOKTITLE = "SOFSEM",
	YEAR = 2005,
	month = "",
	volume = "3381",
	editor = "P. Vojt{\'a}{\v s} and M. Bielikov\'a and B. Charron-Bost and O. S\'ykora",
	series = "LNCS",
	chapter = "",
	pages = "137--146",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@PHDTHESIS{Fer05a,
	AUTHOR = "H. Fernau",
	TITLE = "Parameterized Algorithmics: A Graph-Theoretic Approach",
	SCHOOL = "Universit{\"a}t T{\"u}bingen, Germany",
	YEAR = 2005,
 	month = "",
	address = "", 
	type = "Habi\-li\-ta\-tions\-schrift",
	copy = ""
}
@UNPUBLISHED{Fer05b-1,
	AUTHOR = "H. Fernau", 
	TITLE = "Parameterized algorithmics for linear arrangement problems",
        NOTE = "Submitted for publication",
        year = 2005,
	month = aug,
	copy = ""
}


@INPROCEEDINGS{Fer05b,
	AUTHOR = "H. Fernau", 
	TITLE = "Parameterized algorithmics for linear arrangement problems",
	BOOKTITLE = "CTW 2005: Workshop on Graphs and Combinatorial Optimization",
	YEAR = 2005,
	month = "",
	volume = "",
	editor = "U. Faigle",
	series = "",
	chapter = "",
	pages = "27--31",
	address = "",
	organization = "University of Cologne, Germany",
        publisher = "", note ={Long version to appear in } # dam, 
	copy = ""
}

@INPROCEEDINGS{Fer05c,
	AUTHOR = "H. Fernau",
	TITLE = "Algorithms for learning  regular expressions",
	BOOKTITLE = "Algorithmic Learning Theory ALT 2005",
	YEAR = 2005,
	month = "",
	volume = "3734",
	editor = "S. Jain and H.-U. Simon and E. Tomita",
	series = "LNCS / LNAI",
	chapter = "",
	pages = "297--311",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@ARTICLE{Fer05d,
	AUTHOR = "H. Fernau",
	TITLE = "Two-layer planarization: improving on parameterized algorithmics",
	JOURNAL = jgaa,
	YEAR = 2005,
	month = "",
	volume = 9,
	number = "",
	pages = "205--238",
	copy = ""
}


@ARTICLE{FerFreHol05,
	AUTHOR = "H. Fernau and R. Freund and M. Holzer",
	TITLE = "Representations of recursively enumerable array languages by contextual array grammars",
	JOURNAL = fundinform,
	YEAR = 2005,
	month = "",
	volume = 64,
	number = "",
	pages = "159--170",
	copy = ""
}

@INPROCEEDINGS{FerKauPot05,
	AUTHOR = "H. Fernau and M. Kaufmann and M. Poths",
	TITLE = {Comparing trees via crossing minimization},
	BOOKTITLE = "Foundations of Software Technology and Theoretical Computer Science FSTTCS 2005",
	YEAR = 2005,
	month = "",
	volume = "3821",
	editor = "R. Ramanujam and Sandeep Sen",
	series = "LNCS",
	chapter = "",
	pages = "457--469",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}



@INPROCEEDINGS{FerRyaSug05,
	AUTHOR = "H. Fernau and J. Ryan and K. A. Sugeng",
	TITLE = "A sum labelling for the flower $f_{q,p}$",
	BOOKTITLE = "20th British Combinatorial Conference BCC",
	YEAR = 2005,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "80",
	address = "",
	organization = "Durham University and The Open University",
        publisher = "",
	copy = ""
}


@INPROCEEDINGS{Fer06,
	AUTHOR = "H. Fernau",
	TITLE = "{\sc ROMAN Domination}: a parameterized
perspective",
	BOOKTITLE = "Software
Seminar SOFSEM",
	YEAR = 2006,
	month = "",
	volume = "3831",
	editor = "J. {\v S}tuller and J. Wiedermann and G. Tel and J. Pokorn\'y  and M. Bielikova",
	series = "LNCS",
	chapter = "",
	pages = "262--271",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

 
@INPROCEEDINGS{Fer06a,
	AUTHOR = "H. Fernau",
	TITLE = "Parameterized Algorithms for  {\sc Hitting Set}: the Weighted Case",
	BOOKTITLE = "Conference on Algorithms and Complexity CIAC",
	YEAR = 2006,
	month = "",
	volume = "3998",
	editor = " T. Calamoneri and I. Finocchi and G. F. Italiano",
	series = "LNCS",
	chapter = "",
	pages = "332--343",
	address = "",
	organization = "",
        publisher = "Springer", 
	copy = ""
}

@TECHREPORT{Fer06a-1,
	AUTHOR = "H. Fernau",
	TITLE = "Parameterized Algorithms for  {\sc Hitting Set}: the Weighted Case",
	INSTITUTION = "Hasso Plattner Institut;  Electronic Colloquium on Computational Complexity ECCC",
	YEAR = 2006,
	month = jun,
	number = "TR06-72",
	url = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-072/index.html},
	copy = "ISSN 1433-8092"
}

@INPROCEEDINGS{Fer06b,
	AUTHOR = "H. Fernau",
	TITLE = "Edge dominating set:  efficient enumeration-based exact algorithms",
	BOOKTITLE = "International Workshop on Parameterized and Exact Computation IWPEC",
	YEAR = 2006,
	month = "",
	volume = "4169",
	editor = "H. L. Bodlaender and M. Langston",
	series = "LNCS",
	chapter = "",
	pages = "142--153",
	address = "",
	organization = "",
        publisher = "Springer", 
	copy = ""
}
@ARTICLE{Fer06c,
	AUTHOR = "H. Fernau",
	TITLE = "Formal languages: 15th German meeting",
	JOURNAL = eatcs,
	YEAR = 2006,
	month = oct,
	volume = 90,
	number = "",
	pages = "232--236",
	copy = ""
}


@ARTICLE{Fer06d,
	AUTHOR = "H. Fernau",
	TITLE = "Speeding up Exact Algorithms With High Probability",
	JOURNAL = {Electronic Notes in Discrete Mathematics},
	YEAR = 2006,
	month = "",
	volume = 25,
	number = "",
	pages = "57--59",
	copy = ""
}

@TECHREPORT{FerMan06,
	AUTHOR = "Fernau, H. and  Manlove, D. F.",
	TITLE = "Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms",
	INSTITUTION = "Department of Computing Science DCS Glasgow, UK",
	YEAR = 2006,
	month = apr,
	number = "TR-2006-210",
	address = "", note = {Available through: \url{http://www.dcs.gla.ac.uk/publications/paperdetails.cfm?id=8137}},
	copy = ""
}

@INPROCEEDINGS{FerMan06a,
	AUTHOR = "Fernau, H. and  Manlove, D. F.",
	TITLE = "Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms",
	BOOKTITLE = "Algorithms and Complexity in Durham ACiD 2006",
	YEAR = 2006,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "69--84",
	address = "",
	organization = "",
        publisher = "King's College, London",
	copy = ""
}

@INPROCEEDINGS{Fer07,
	AUTHOR = "H. Fernau",
	TITLE = "Dynamic programming for {Q}ueen {D}omination",
	BOOKTITLE = "Proc. 6th Cologne-Twente Workshop on Graphs and Combinatorial Optimization CTW",
	YEAR = 2007,
	month = "",
	volume = "",
	editor = "J.~L. Hurink and W. Kern and G.~F. Post and G.~J. Still",
	series = "",
	chapter = "",
	pages = "43--48",
	address = "",
	organization = "",
        publisher = "CTIT Centre for Telematics and Information Technology, Workshop Proceedings",
	copy = ""
}
@ARTICLE{Fer07a,
	AUTHOR = "H. Fernau",
	TITLE = "Programmmed grammars with rule queues",
	JOURNAL = ijfcs,
	YEAR = 2007,
	month = "",
	volume = 18,
	number = "",
	pages = "1209--1213",
	copy = ""
}

@ARTICLE{Fer07b,
	AUTHOR = "H. Fernau",
	TITLE = "Learning tree languages from text",
	JOURNAL = rairo,
	YEAR = 2007,
	month = "",
	volume = 41,
	number = "",
	pages = "351--374",
	copy = ""
}
@article{Feretal07,
  author  = {H. Fernau and R. Freund and M. Oswald and K. Reinhardt},
  title   = {Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars},
  journal = jalc,
  year    = 2007,
  volume  = 12,
  number  = {1/2},
  pages   = {117--138}
}
@INPROCEEDINGS{FerRai07,
	AUTHOR = "H. Fernau and D. Raible",
	TITLE = "Alliances in graphs: a complexity-theoretic study",
	BOOKTITLE = "SOFSEM 2007, Proceedings Vol. II",
	YEAR = 2007,
	month = "",
	volume = "",
	editor = "Leeuwen, {J. van} and G. F. Italiano and Hoek, {W. van der} and C. Meinel and H. Sack and F. Pl\'a\v sil and M. Bielikov\'a",
	series = "",
	chapter = "",
	pages = "61--70",
	address = "",
	organization = "",
        publisher = "Institute of Computer Science ASCR, Prague",
	copy = ""
}

@INPROCEEDINGS{FerRai07a,
	AUTHOR = "H. Fernau and D. Raible",
	TITLE = "Maximum {A}cyclic {S}ubgraph on cubic graphs in time {$O^*(1.1960^k)$}",
	BOOKTITLE = {53. Workshop \"uber Komplexit\"atstheorie, Datenstrukturen und Effiziente Algorithmen},
	YEAR = 2007,
	month = "",
	volume = "",
	editor = "Th.~Schwentick and V. Weber",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = {Universit\"at Dortmund, Fachbereich Informatik sowie Gesellschaft f\"ur Informatik},
        publisher = "",
	copy = ""
}

@InProceedings{FerRai07b,
  author ={D. Raible and H. Fernau},
  title ={Exact Elimination of Cycles in Graphs},
  booktitle ={Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs},
  year ={2007},
  editor ={E. Demaine and G. Z. Gutin and D. Marx and U. Stege},
  number ={07281},
  series ={Dagstuhl Seminar Proceedings},
  ISSN ={1862-4405},
  publisher ={Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address ={Dagstuhl, Germany},
  URL ={http://drops.dagstuhl.de/opus/volltexte/2007/1235},
}

@TECHREPORT{FerRodSig07,
	AUTHOR = "H. Fernau and J. A. Rodr\'{\i}guez und J. M. Sigarreta",
	TITLE = {Offensive $k$-alliances in graphs},
	INSTITUTION = "ArXiv",
	YEAR = 2007,
	month = "",
	number = "0703598",
	address = "\url{arxiv.org/abs/math.AG/0703598}",
	copy = ""
}

@ARTICLE{FerReiSta2007,
	AUTHOR = "H.~Fernau and K.~Reinhardt and L.~Staiger",
	TITLE = "Decidability of code properties",
	JOURNAL = rairoita,
	YEAR = 2007,
	month = "",
	volume = 41,
	number = "",
	pages = "243--259",
	copy = ""
}

@Article{Fer08,
author = {H. Fernau},
title = {{ROMAN DOMINATION}: a parameterized perspective},
journal = ijcm,
year = {2008},
OPTkey = {},
volume = {85},
OPTnumber = {},
pages = {25--38},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@TechReport{Fer08a,
author = {H. Fernau},
title = {Parameterized Algorithms for  $d$-{\sc Hitting Set}: the Weighted Case},
institution = {
Univ. Trier, FB 4, Abteilung Informatik, 
54286 Trier,
Germany},
year = {2008},
OPTkey = {},
OPTtype = {},
number = {Trierer Forschungsberichte;  
Informatik / Mathematik; No.  08-6},
OPTaddress = {},
month = jul,
OPTnote = {},
OPTannote = {}
}

@InCollection{Fer08b,
author = {H. Fernau},
title = {Parameterized Algorithms
for Drawing Graphs},
booktitle = {Encyclopedia of Algorithms},
OPTcrossref = {},
OPTkey = {},
pages = {631--635},
publisher = {Springer},
year = {2008},
editor = {M.-Y. Kao},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
OPTchapter = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}


@inproceedings{FerRai2008,
 AUTHOR = "H. Fernau and D. Raible",
 title     = {Exact Algorithms for Maximum Acyclic Subgraph on a Superclass
               of Cubic Graphs},
  pages     = {144--156},
  booktitle = {Workshop on Algorithms and Computation: WALCOM},
  editor    = {S.-I. Nakano and
               Md. S. Rahman},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {4921},
  year      = {2008},
}

@TECHREPORT{FerRai2008b,
	AUTHOR = "H. Fernau and D. Raible",
	TITLE = "Exact algorithms for maximum acyclic subgraph on a superclass of 
cubic graphs",
	INSTITUTION = "Technical Reports Mathematics / Computer Science, University 
of Trier, Germany",
	YEAR = 2008,
	month = jun,
	number = "08-5",
	address = {http://www.uni-trier.de/fileadmin/fb4/INF/TechReports/CubicMAS.pdf}
}

@inproceedings{FerRai2008c,
  author    = {H. Fernau and D. Raible},
  title     = {A Parameterized Perspective on Packing Paths of Length Two},
  year      = {2008},
  pages     = {54--63},
  editor    = {B. Yang and
               D.-Z. Du and
               C. An Wang},
  booktitle = {Combinatorial Optimization and Applications COCOA},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {5165},
}


@InProceedings{FerRodSig08,
 AUTHOR = {H. Fernau and J.~A. Rodr{\'{\i}}guez-Vel{\'{a}}zquez and J. M. Sigarreta},
title={Global $r$-alliances and total domination},
booktitle = {Proceedings of the 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization},
pages     ={98--101},
year      ={2008},
publisher ={Universit\`a degli Studi die Milano},
}

@Article{FerRyaSug2008,
author = {H. Fernau and J. F. Ryan and K. A. Sugeng},
title = {A sum labelling for the generalised friendship graph},
journal = dm,
year = {2008},
OPTkey = {},
volume = {308},
OPTnumber = {},
pages = {734--740},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}


@ARTICLE{FerSti08,
	AUTHOR = "H. Fernau and R. Stiebe",
	TITLE = "Blind Counter Automata on $\omega$-Words",
	JOURNAL = fundinform,
	YEAR = 2008,
	month = "",
	volume = 83,
	number = "",
	pages = "51--64",
	copy = ""
}

@INPROCEEDINGS{FerMau94,
	AUTHOR = "C. Ferretti and G. Mauri",
	TITLE = "Identifying regular languages over partially-commutative monoids",
	BOOKTITLE = "Int. Workshop on Analogical and Inductive Inference AII'94 / Algorithmic Learning Theory ALT",
	YEAR = 1994,
	month = "",
	volume = "872",
	editor = "S. Arikawa and K. P. Jantke",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "282--289",
	address = "",
	organization = "",
	copy = ""
}

@INCOLLECTION{FesParRes99,
  author = "P. Festa and P. M. Pardalos and M. G. C. Resende",
  title = "Feedback set problems",
	BOOKTITLE = "Handbook of Combinatorial Optimization",
	PUBLISHER = "Kluwer Academic Publishers",
	YEAR = 1999,
	month = "",
	volume = "Supplemenent Volume A",
	editor = "D.-Z. Du and P. M. Pardalos",
	series = "",
	chapter = "",
	pages = "209--258",
	address = "", note = {Also AT\&T Technical Report No. 99.2.2},
	type = "",
	copy = ""
}





@ARTICLE{FieKam2000,
	AUTHOR = "G. Fielding and M. Kam",
	TITLE = "Weighted matchings for dense stereo correspondence",
	JOURNAL = patrec,
	YEAR = 2000,
	month = "",
	volume = 33,
	number = "",
	pages = "1511--1524",
	copy = ""
}

@TECHREPORT{Fijetal2002,
	AUTHOR = "A. Fijany and F. Vatan and A. Barrett and R. Mackey",
	TITLE = "New approaches for solving the diagnosis problem",
	INSTITUTION = "Jet Propulsion Laboratory, California Institute of Technology",
	YEAR = 2002,
	month = may,
	number = "IPN Progress Report 42--149",
	address = "",
	copy = ""
}


@ARTICLE{Fin72,
	AUTHOR = "A. Finger",
	TITLE = "Zur {B}erechnung der {B}inomialkoeffizienten
{$(\begin{array}{c}n\\k\end{array})\mbox{ mod }p$}",
	JOURNAL = eikalt,
	YEAR = 1972,
	month = "",
	volume = 8,
	number = "",
	pages = "611--616",
	copy = ""
}

@Article{Fin85,
title   ="Une g\'en\'eralisation des th\'eor\`emes de {Higman} et de {Simon}
         aux mots infinis",
author  ="A. Finkel",
pages   ="137--142",
journal =tcs,
year    ="1985",
month   =may,
volume  ="38",
number  ="1",
note    ="Note",
}

@InProceedings{Fin87, 
 author =  "A. Finkel", 
 title = "A Generalization of the Procedure of {K}arp and {M}iller to Well Structured Transition Systems", 
 pages  =  "499--508", 
 editor =   "Thomas Ottmann", 
 booktitle =  "Proceedings of the 14th International Colloquium on Automata, Languages, and Programming", 
 address  =  "Karlsruhe, FRG", 
 month  =  jul, 
 year  =       "1987", 
 series  =     "LNCS", 
 volume   =    "267", 
 publisher    =     "Springer", 
} 

@ARTICLE{Fin01,
	AUTHOR = "O. Finkel",
	TITLE = "Locally finite languages",
	JOURNAL = tcs,
	YEAR = 2001,
	month = "",
	volume = 255,
	number = "",
	pages = "223--261",
	copy = ""
}

@inproceedings{Fin2001,
  author    = {O. Finkel},
  title     = {An Effective Extension of the {W}agner Hierarchy to Blind
               Counter Automata},
  booktitle = {Computer Science Logic CSL},
  year      = {2001},
  pages     = {369--383},
  editor    = {L. Fribourg},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {2142},
}

@INPROCEEDINGS{Fin01a,
	AUTHOR = "I. Finocchi",
	TITLE = "Layered drawings of graphs with crossing constraints",
	BOOKTITLE = "Computing and Combinatorics, Proceedings COCOON 2001",
	YEAR = 2001,
	month = "",
	volume = "2108",
	editor = "J. Wang",
	series = "LNCS",
	chapter = "",
	pages = "357--367",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{FinWea2007,
	AUTHOR = "D. Finozhenok and W. D. Weakley",
	TITLE = "An improved lower bound for domination numbers of the queen's graph",
	JOURNAL = {Australasian Journal of Combinatorics},
	YEAR = 2007,
	month = "",
	volume = 37,
	number = "",
	pages = "295--300",
	copy = ""
}

@ARTICLE{Fioetal2007,
	AUTHOR = "S. Fiorini and N. Hardy and B. Reed and A. Vetta",
	TITLE = "Approximate min-max relations for odd cycles in planar graphs",
	JOURNAL = {Mathematical Programming Ser. B},
	YEAR = 2007,
	month = "",
	volume = 110,
	number = "",
	pages = "71--91",
	copy = ""
}

@ARTICLE{Fis95,
	AUTHOR = "S. Fischer",
	TITLE = "A note on the complexity of local search problems",
	JOURNAL = ipl,
	YEAR = 1995,
	month = "",
	volume = 53,
	number = "",
	pages = "69--75",
	copy = ""
}

@INPROCEEDINGS{Fis69, 
        AUTHOR = "M. Fischer", 
        TITLE = "Two characterizations of the context sensitive languages", 
        BOOKTITLE = "Tenth IEEE Conf. on Switching and Automata Theory SWAT", 
        YEAR = 1969, 
        month = "", 
        volume = "", 
        editor = "", 
        series = "", 
        chapter = "", 
        pages = "149--156", 
        address = "", 
        organization = "", 
        copy = "" 
} 


@ARTICLE{Fisetal68,
	AUTHOR = "P. C. Fischer and A. R. Meyer and A. L. Rosenberg",
	TITLE = "Counter machines and counter languages",
	JOURNAL = mst,
	YEAR = 1968,
	month = "",
	volume = 2,
	number = "",
	pages = "265--283",
	copy = ""
}
@InProceedings{FisMey71,
  title =        "Boolean Matrix Multiplication and Transitive Closure",
  author =       "M. J. Fischer and A. R. Meyer",
  pages =        "129--131",
  booktitle =    "Conference Record 1971 Twelfth Annual Symposium on
                 Switching and Automata Theory",
  month =        "13--15 " # oct,
  year =         "1971",
  address =      "East Lansing, Michigan",
  organization = "IEEE",
}

@Article{FisKin79,
  title =        "Real-Time Computations with Restricted
                 Nondeterminism",
  author =       "Patrick C. Fischer and Chandra M. R. Kintala",
  journal =      mst,
  pages =        "219--231",
  year =         "1979",
  volume =       "12",
}
@ARTICLE{Fis75,
	AUTHOR = "R. Fischer",
	TITLE = "Sofic systems and graphs",
	JOURNAL = monmath,
	YEAR = 1975,
	month = "",
	volume = 80,
	number = "",
	pages = "179--186",
	copy = ""
}
@ARTICLE{FisLad79,
	AUTHOR = "M. J. Fischer and R. E. Ladner",
	TITLE = "Propositional dynamic logic of regular programs",
	JOURNAL = jcss,
	YEAR = 1979,
	month = "",
	volume = 18,
	number = "",
	pages = "194--211",
	copy = ""
}

@INBOOK{Fis82,
	 AUTHOR = "T. Fischer",
	 TITLE = "Zur Kompliziertheit von assoziativen Suchprozessen
		 in mehrdimensionalen {bin\"aren Suchb\"aumen}",
	 PAGES = "111--120",
	 PUBLISHER = wpur,
	 YEAR = 1982,
	 VOLUME = 21,
	 SERIES = rmk,
	 copy = ""
}

@TECHREPORT{FisVolZve2003,
	AUTHOR = "M. Fischermann and L. Volkmann and I. E. Zverovich",
	TITLE = "Unique Irredundance, Domination and Independent Domination in Graphs",
	INSTITUTION = "RUTCOR Research Reports",
	YEAR = 2003,
	month = "",
	number = "25-2003",
	address = "",
	copy = ""
}

@techreport{FisFraSea96,
    author = "D. C. Fisher and K. Fraughnaugh and S. M. Seager",
    title = "Domination of Graphs with Maximum Degree Three",
    number = "UCD-CCM-090",
    month = "1,",
    year = "1996",
    url = "citeseer.ist.psu.edu/55107.html" }

@INPROCEEDINGS{Fla85,
	crossref = "Bra85",
	AUTHOR = "P. Flajolet",
	TITLE = "Ambiguity and transcendence",
	chapter = "",
	pages = "179--188",
	copy = ""
}

@ARTICLE{Fla87,
	AUTHOR = "P. Flajolet",
	TITLE = "Analytic models and ambiguity of context-free languages",
	JOURNAL = tcs,
	YEAR = 1987,
	month = "",
	volume = 49,
	number = "",
	pages = "283--309",
	copy = ""
}
@INPROCEEDINGS{FlaLawGil2000,
	AUTHOR = "G.~W. Flake and S. Lawrence and C. L. Giles",
	TITLE = "Efficient identification of web communities",
	BOOKTITLE = "International Conference on Knowledge Discovery and Data Mining ACM SIGKDD",
	YEAR = 2000,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "150--160",
	address = "",
	organization = "",
        publisher = "ACM Press",
	copy = ""
}

@ARTICLE{Flaetal2002,
	AUTHOR = "G.~W. Flake and S. Lawrence and C. L. Giles and F. M. Coetzee",
	TITLE = "Self-organization and identification of web communities",
	JOURNAL = {IEEE Computer},
	YEAR = 2002,
	month = "",
	volume = 35,
	number = "",
	pages = "66--71",
	copy = ""
}

@ARTICLE{FlaTarTsi2004,
	AUTHOR = "G.~W. Flake and R. E. Tarjan and K. Tsioutsiouliklis",
	TITLE = "Graph clustering and minimum cut trees",
	JOURNAL = {Internet Mathematics},
	YEAR = 2004,
	month = "",
	volume = 1,
	number = "4",
	pages = "385--408",
	copy = ""
}

@INPROCEEDINGS{FleGre99,
	AUTHOR = "S. Flesca and S. Greco",
	TITLE = "Partially ordered regular languages for graph queries",
	BOOKTITLE = "Automata, Languages and Programming 26th ICALP'99",
	YEAR = 1999,
	month = "",
	volume = "1644",
	editor = "J. Wiedermann and P. van Emde Boas and M. Nielsen",
	series = "LNCS",
	chapter = "",
	pages = "321--330",
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{Flo99,
	AUTHOR = "C. C. Flor\^encio",
	TITLE = "Consistent identification in the limit of some of {P}enn and {B}uszkowski's classes is {NP}-hard",
	BOOKTITLE = "Proceedings of CLIN '99; Selected Papers",
	YEAR = 1999,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "1--12",
	address = "",
	organization = "",
        publisher = "see {\tt http://www-uilots.let.uu.nl/publications/clin1999/papers.html}",
	copy = ""
}

@INPROCEEDINGS{Flo00,
	AUTHOR = "C.~C. Flor\^encio",
	TITLE = "On the complexity of consistent identification  of some classes of structure languages",
	BOOKTITLE = "Grammatical Inference: Algorithms and Applications, 5th International Colloquium ICGI 2000",
	YEAR = 2000,
	month = "",
	volume = "1891",
	editor = "A.~L. Oliveira",
	series = "LNCS/LNAI",
	chapter = "",  publisher = {Springer}, 
	pages = "89--102",
	address = "",
	organization = "",
	copy = ""
}



@INPROCEEDINGS{Flo01,
	AUTHOR = "C. C. Flor\^encio",
	TITLE = "Consistent identification in the limit of any of the classes of $k$-valued  is {NP}-hard",
	BOOKTITLE = "Logical Aspects of Computational Linguistics LACL'01",
	YEAR = 2001,
	month = "",
	volume = "2099",
	editor = "P. de Groote and G. Morrill and C. Retor\'e",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "125--138",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{FloUll82,
	AUTHOR = "R. W. Floyd and J. D. Ullman",
	TITLE = "The compilation of regular expressions into
		  integrated circuits",
	JOURNAL = jacm,
	YEAR = 1982,
	month = "",
	volume = 29,
	number = "3",
	pages = "603--622",
	copy = ""
}

@INPROCEEDINGS{FluFriGro2001,
	AUTHOR = "J. Flum and M. Frick and M. Grohe",
	TITLE = "Query evalution via tree-decompositions",
	BOOKTITLE = "Database Theory (ICDT 2001)",
	YEAR = 2001,
	month = "",
	volume = "1973",
	editor = "J. van den Bussche and V. Vianu",
	series = "LNCS",
	chapter = "",
	pages = "22--38",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@ARTICLE{FluGro2004,
	AUTHOR = "J. Flum and M. Grohe",
	TITLE = "The Parameterized Complexity of Counting Problems",
	JOURNAL = siam,
	YEAR = 2004,
	month = "",
	volume = 33,
	number = "",
	pages = "892--922",
	copy = ""
}

@ARTICLE{FluGro2004a,
	AUTHOR = "J. Flum and M. Grohe",
	TITLE = "Parameterized Complexity and subexponential time",
	JOURNAL = eatcs,
	YEAR = 2004,
	month = "",
	volume = 84,
	number = "",
	pages = "71--100",
	copy = ""
}



@TECHREPORT{FomThi2003b,
	AUTHOR = "F.~V. Fomin and D.~M. Thilikos",
	TITLE = "A simple and fast approach for solving problems on planar graphs",
	INSTITUTION = "Department of Informatics, University of Bergen (Norway)",
	YEAR = 2003, note = {To appear in Proc. STACS 2004\marginpar{find out!}},
	month = "",
	number = "258",
	address = "",
	copy = ""
}

@INPROCEEDINGS{FomKraTod2004,
	crossref = "icalp2004",
	AUTHOR = "F. V. Fomin and D. Kratsch and I. Todinca",
	TITLE = "Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In",
	chapter = "Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In",
	pages = "568--580",
	copy = ""
}
@INPROCEEDINGS{FomKraWoe2004,
	crossref = "WG2004",
	AUTHOR = "F. Fomin and D. Kratsch and G. Woeginger",
	TITLE = "Exact (exponential) algorithms for the dominating set problem",
	chapter = "",
	pages = "245--256",
	copy = ""
}


 @TECHREPORT{FomThi02,
    author = "F.~V. Fomin and D.~M. Thilikos",
  title = "A new upper bound on the decomposability of planar graphs and fixed parameter algorithms",
	INSTITUTION = "Departament de Llenguatges i Sistemes Inform\`atics, Universitat Polit\`ecnica de Catalunya, Barcelona",
	YEAR = 2002,
	month = "",
	number = "", type={Technical Report},
	address = "",
}

@INPROCEEDINGS{FomThi2003,
	AUTHOR = "F.~V. Fomin and D.~M. Thilikos",
	TITLE = "Dominating sets in planar graphs: branch-width and exponential speed-up",
	BOOKTITLE = "Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003",
	YEAR = 2003,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "168--177",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@INPROCEEDINGS{FomThi2003a,
	AUTHOR = "F.~V. Fomin and D.~M. Thilikos",
	TITLE = "Dominating sets and local treewidth",
	BOOKTITLE = "Proceedings of the 11th Annual European Symposium on Algorithms, ESA 2003",
	YEAR = 2003,
	month = "",
	volume = "",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@TECHREPORT{FomHoi2005,
	AUTHOR = "F. V. Fomin and K. H{\o}ie",
	TITLE = "Pathwidth of cubic graphs and exact algorithms",
	INSTITUTION = "University of Bergen, Norway, Reports in Informatics",
	YEAR = 2005,
	month = may,
	number = "298",
	address = "", note ={also:  (Inform. Proc. Letters 2006)}, 
	copy = ""
}

@INPROCEEDINGS{FomThi2004,
	crossref = "icalp2004",
	AUTHOR = "F. V. Fomin and D. Thilikos",
	TITLE = "Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up",
	chapter = "Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up",
	pages = "581--592",
	copy = ""
}


@INPROCEEDINGS{FomThi2004a,
	AUTHOR = "F. V. Fomin and D. Thilikos",
	TITLE = "A simple and fast approach for solving problems on planar graphs",
	pages = "56--67",
        BOOKTITLE ={Symposium on Theoretical Aspects of Computer Science STACS}, 
 year = 2004,
 editor = {V. Diekert and M. Habib}, series ={LNCS}, publisher={Springer},
	copy = ""
}

@TECHREPORT{FomPya2005,
	AUTHOR = "F. V. Fomin and A. V. Pyatkin",
	TITLE = "Finding minimum feedback vertex set in bipartite graph",
	INSTITUTION = "Department of Informatics, University of Bergen (Norway)",
	YEAR = 2005,
	month = feb,
	number = "291",
	address = "",
	copy = ""
}

@inproceedings{FomGraKra2005,
	AUTHOR = "F.~V. Fomin and F. Grandoni and D. Kratsch",
	TITLE = "Measure and conquer: domination -- a case study",
  booktitle =  {Automata, Languages and Programming, 32nd International
               Colloquium, ICALP},
  year      = {2005},
  pages     = {191--203},
  editor    = {L. Caires and
               G. F. Italiano and
               L. Monteiro and
               C. Palamidessi and
               M. Yung},
  publisher = {Springer},
  series    = {LNCS},
  volume    = {3580},
}

@TECHREPORT{FomGraKra2005a,
	AUTHOR = "F.~V. Fomin and F. Grandoni and D. Kratsch",
	TITLE = "Some new techniques in design and analysis of exact (exponential) algorithms",
	INSTITUTION = "Department of Informatics, University of Bergen",
	YEAR = 2005,
	month = "",
	number = "307",
	address = "",
	copy = ""
}

@INPROCEEDINGS{FomGasPya2006,
	AUTHOR = "F.~V. Fomin and S. Gaspers and A.~V. Pyatkin",
	TITLE = "Finding a minimum feedback set in time \mbox{${\cal O}(1.7548^n)$}",
	BOOKTITLE = "International Workshop on Parameterized and Exact Computation IWPEC",
	YEAR = 2006,
	month = "",
	volume = "4169",
	editor = "H. L. Bodlaender and M. Langston",
	series = "LNCS",
	chapter = "",
	pages = "184--191",
	address = "",
	organization = "",
        publisher = "Springer", 
	copy = ""
}

@INPROCEEDINGS{FomGraKra2006,
	AUTHOR = "F.~V. Fomin and F. Grandoni and D. Kratsch",
	TITLE = "Solving Connected Dominating Set faster than $2^n$",
	BOOKTITLE = "Foundations of Software Technology and 
Theoretical
               Computer Science FSTTCS",
	YEAR = 2006,
	month = "",
	volume = "4337",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "152--163",
	address = "",
	organization = "",
        publisher = "Springer", 
	copy = ""
}


@TECHREPORT{FomGraKra2007,
	AUTHOR = "F.~V. Fomin and F. Grandoni and D. Kratsch",
	TITLE = "A Measure \& Conquer Approach for the Analysis of Exact Algorithms",
	INSTITUTION = "Department of Informatics, University of Bergen, Norway",
	YEAR = 2007,
	month = jul,
	number = "No 359",
	address = "",
	copy = ""
}

@INPROCEEDINGS{Fometal2007,
	AUTHOR = "F. Fomin and P. Golovach and D. Kratsch and J. Kratochvil and M. Liedloff",
	TITLE = "Branch \& Recharge: Exact algorithms for generalized domination",
	BOOKTITLE = "WADS",
	YEAR = 2007,
	month = "",
	volume = "4619",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "508--519",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@ARTICLE{FowPatTan81,
	AUTHOR = "R. J. Fowler and M. S. Paterson and L. Tanimoto",
	TITLE = "Optimal packing and covering in the plane are {NP}-complete",
	JOURNAL = ipl,
	YEAR = 1981,
	month = "",
	volume = 12,
	number = "3",
	pages = "133--137",
	copy = ""
}

@ARTICLE{For73,
	AUTHOR = "G. D. Forney",
	TITLE = "The {V}iterbi algorithm",
	JOURNAL = ieeeproc,
	YEAR = 1973,
	month = "",
	volume = 3,
	number = "",
	pages = "268--278",
	copy = ""
}

@ARTICLE{Fra2004,
	AUTHOR = "A. S. Fraenkel",
	TITLE = "Complexity, appeal and challenges of combinatorial games",
	JOURNAL = tcs,
	YEAR = 2004,
	month = "",
	volume = 313,
	number = "",
	pages = "393--415",
	copy = ""
}

@ARTICLE{Fra89,
	AUTHOR = "D. S. Franzblau",
	TITLE = "Performance Guarantees on a Sweep Line Heuristic for
Covering Rectilinear Polygons with Rectangles",
	JOURNAL = siamdm,
	YEAR = 1989,
	month = "",
	volume = 2,
	number = "3",
	pages = "307--321",
	copy = ""
}



@INPROCEEDINGS{FraChuWit2000,
	AUTHOR = "Frank, E. and Chui, C. and Witten, I. H.",
	TITLE = "Text categorization using
compression models",
	BOOKTITLE = "Proc Data Compression Conference DCC 2000",
	YEAR = 2000,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "IEEE",
        publisher = "IEEE Press", note ={full version available as Working Paper 00/2}, 
	copy = ""
}

@ARTICLE{Fraetal98,
	AUTHOR = "Frank, E. and Wang, Y. and Inglis, S. and Holmes, G. and Witten, I.H.",
	TITLE = "Using model trees for classification",
	JOURNAL = {Machine Learning},
	YEAR = 1998,
	month = "",
	volume = 32,
	number = "",
	pages = "63--76",
	copy = ""
}

@ARTICLE{FraKle84,
	AUTHOR = "D. S. Franzblau and D. J. Kleitman",
	TITLE = "An Algorithm for Constructing Regions
with Rectangles",
	JOURNAL = icalt,
	YEAR = 1984,
	month = "",
	volume = 63,
	number = "",
	pages = "164--189",
	copy = ""
}




@ARTICLE{FraPag94,
	AUTHOR = "M. Frazier and C.~D. Page",
	TITLE = "Prefix grammars: an alternative characterization of the regular languages",
	JOURNAL = ipl,
	YEAR = 1994,
	month = "",
	volume = 51,
	number = "",
	pages = "67--71",
	copy = ""
}



@ARTICLE{FraPit96,
	AUTHOR = "M. Frazier and L. Pitt",
	TITLE = "Classic Learning",
	JOURNAL = ml,
	YEAR = 1996,
	month = "",
	volume = 25,
	number = "",
	pages = "151--193",
	copy = ""
}

@INPROCEEDINGS{FreLei2000,
	AUTHOR = "A. L. N. Fred and J. M. N. Leit\~ao",
	TITLE = "Partitional vs hierarchical clustering using a minimum grammar complexity approach",
	BOOKTITLE = "Advances in Pattern Recognition, Joint IAPR International Workshops SSPR+SPR'2000",
	YEAR = 2000,
	month = "",
	volume = "1876",
	editor = "F. J. Ferri and others",
	series = "LNCS",
	chapter = "",
	pages = "193--202",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{Fre87,
	AUTHOR = "G.N. Frederickson",
	TITLE = "Fast algorithms for shortest paths in planar graphs, with applications",
	JOURNAL = siam,
	YEAR = 1987,
	month = "",
	volume = 16,
	number = "",
	pages = "1004--1022",
	copy = ""
}

@ARTICLE{FreJaj81,
	AUTHOR = "G.~N. Frederickson and J. J\'aj\'a",
	TITLE = "Approximation algorithms for several graph augmentation problems",
	JOURNAL = siam,
	YEAR = 1981,
	month = "",
	volume = 10,
	number = "",
	pages = "270--283",
	copy = ""
}

@ARTICLE{FreTof82,
	AUTHOR = "E. Fredkin and T. Toffoli",
	TITLE = "Conservative logic",
	JOURNAL = ijtp,
	YEAR = 1982,
	month = "",
	volume = 21,
	number = "3/4",
	pages = "219--253",
	copy = ""
}

@INPROCEEDINGS{FreWol87,
	crossref = "Botetal87",
	AUTHOR = "H. I. Freedman and G. S. K. Wolkowicz",
	TITLE = "A mathematical model of group defence in
predator-prey systems",
	chapter = "",
	pages = "149--153",
	copy = ""
}

@ARTICLE{Fre61,
AUTHOR = 	"H. Freeman",
TITLE = 	"On the encoding of arbitrary geometric configurations",
JOURNAL = 	"Transactions on electronic computers",
YEAR = 	"1961",
VOLUME = 	"10",
NUMBER = 	"",
PAGES = 	"260--268",
MONTH = 	"June",
note = 	""
}

@ARTICLE{Fre74,
AUTHOR = 	"H. Freeman",
TITLE = 	"Computer processing of line drawing images",
JOURNAL = 	Compsur,
YEAR = 	"1974",
VOLUME = 	"6",
NUMBER = 	"1",
PAGES = 	"57--97",
MONTH = 	"March",
copy = 	"nur 68--72 kopiert, der Rest ist uninteressant"
}

@INPROCEEDINGS{Fre97,
	AUTHOR = "D. Freitag",
	TITLE = "Using grammatical inference to improve precision in information extraction",
	BOOKTITLE = "Workshop on Grammatical Inference, Automata Induction, and Language Acquisition (ICML'97), Nashville, TN",
	YEAR = 1997,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "", note = {available through: {\tt http://www.univ-st-etienne.fr/eurise/pdupont/mlworkshop.html\#proc}},
	copy = ""
}

@ARTICLE{FreKinSmi95,
	AUTHOR = "R. Freivalds and E. Kinber and C. H. Smith",
	TITLE = "On the Impact of Forgetting on Learning Machines",
	JOURNAL = jacm,
	YEAR = 1995,
	month = "",
	volume = 42,
	number = "",
	pages = "1146--1168",
	copy = ""
}

@ARTICLE{FreKinSmi95a,
	AUTHOR = "R. Freivalds and E. Kinber and C. H. Smith",
	TITLE = "On the intrinsic complexity of Learning",
	JOURNAL = ic,
	YEAR = 1995,
	month = "",
  volume =       "123",
  number =       "1", pages =        "64--71",
}

@ARTICLE{Fre70,
	AUTHOR = "R. I. Frejdson {\cyr R. I. Freu\u\idzon}",
	TITLE = "{\cyr Ob odno\u\i harakteristike slozhnosti
		  rekursivnyh predikatov}",
	JOURNAL = {{\cyr Trudy matematiqeskogo instituta imena Steklova}},
	YEAR = 1970,
	month = "",
	volume = 113,
	number = "",
	pages = "79--101",
	copy = ""
}

@INPROCEEDINGS{FreNao2002,
	AUTHOR = "A. Freund  and J. Naor",
	TITLE = "Approximating the Advertisement Placement Problem",
	BOOKTITLE = "Integer Programming and Combinatorial Optimization : 9th International IPCO Conference",
	YEAR = 2002,
	month = "",
	volume = "2337",
	editor = "W. J. Cook and A. S. Schulz",
	series = "LNCS",
	chapter = "",
	pages = "415--424",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@Article{FreKea97,
author = {Y. Freund and M. Kearns},
title = {Efficient Learning of Typical Finite
Automata from Random Walks},
journal = icneu,
year = {1997},
OPTkey = {},
volume = {138},
OPTnumber = {},
pages = {23--48},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@ARTICLE{Fre83,
	AUTHOR = "R. Freund",
	TITLE = "Init and {A}nf operating on {$\omega$}-languages",
	JOURNAL = ipl,
	YEAR = 1983,
	month = "",
	volume = 16,
	number = "",
	pages = "265--269",
	copy = ""
}

@INPROCEEDINGS{Fre92,
	AUTHOR = "R. Freund",
	TITLE = "Syntactical Analysis of Handwritten Characters by
Using Quasi-regular Programmed array grammars with Attribute Vectors",
	BOOKTITLE = "Advances in Structural and Syntactic Pattern
Recognition",
	PUBLISHER = "Singapore: World Scientific",
	YEAR = 1992,
	month = "",
	editor = "H. Bunke",
	volume = "5",
	series = "WSP Series in Machine Perception and Artificial Intelligence",
	chapter = "",
	pages = "310--319",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{FrePau93,
	AUTHOR = "R. Freund and Gh. P{\u a}un",
	TITLE = "One-dimensional matrix array grammars",
	JOURNAL = eikneu,
	YEAR = 1993,
	month = "",
	volume = 29,
	number = "6",
	pages = "1--18",
	copy = ""
}

@INPROCEEDINGS{FreTaf93,
	AUTHOR = "R. Freund and F. Tafill",
	TITLE = "Modelling {K}ohonen networks by attributed parallel
array systems",
	BOOKTITLE = "Conference on Neural Networks and Artificial
Intelligence, International Symposium on Substance Identification
Technologies (Innsbruck, 1993)",
	YEAR = 1993,
	month = oct,
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
	copy = ""
}

@INproceedings{Fre94a,
        AUTHOR = "R. Freund",
        TITLE = "Control mechanisms on {$\#$}-context-free array
		  grammars",
		  booktitle = {Mathematical Aspects of Natural and
Formal Languages},
        bookeditor = {Gh. P\u aun}, publisher = {Singapore: World
		  Scientific},
		  pages = {97--137},
        year = 1994,
	month = "",
	copy = ""
}

@INPROCEEDINGS{Fre94,
	AUTHOR = "R. Freund",
	TITLE = "Aspects of {$n$}-dimensional {L}indenmayer systems",
	PUBLISHER = "Singapore: World Scientific",
	BOOKTITLE = "Developments in Language Theory; At The
Crossroads of Mathematics, Computer Science and Biology (Turku,
Finland, 12--15 July 1993)",
	YEAR = 1994,
	month = "",
	volume = "",
	editor = "G. Rozenberg and A. Salomaa",
	series = "",
	chapter = "L Systems, Fractals and Image Generation:
Many Dimensions",
	pages = "250--261",
	address = "",
	organization = "",
	copy = "",
}

@ARTICLE{FrePau95,
	AUTHOR = "R. Freund and Gh. P{\u a}un",
	TITLE = "A variant of team cooperation in grammar systems",
	JOURNAL = jucs,
	YEAR = 1995,
	month = "",
	volume = 1,
	number = "2",
	pages = "105--130",
	copy = ""
}

@INPROCEEDINGS{Fre96,
	AUTHOR = "R. Freund",
	TITLE = "Array grammars with prescribed teams of
array productions",
	BOOKTITLE = "Developments in Language Theory II; at the
                  crossroads of mathematics, computer science and biology",
	YEAR = 1996,
	month = "",
	volume = "",
	editor = "", publisher = {London: Gordon and Breach},
	series = "",
	chapter = "Controlled derivations and grammar systems",
	pages = "220--229",
	address = "",
	organization = "",
	copy = ""
}

@Article{Freund,
author   ="R. Freund and L. Kari and Gh. P{\u{a}}un",
title    ="{DNA} Computation Based on Splicing: The Existence of Universal
          Computers",
journal  =jacm,
note     ="To appear. Also Technical Report 185-2/FR-2/95, TU Wien, 1995.",
www      ="\url{http://www.csd.uwo.ca/~lkari/}",
url      ="\url{http://www.csd.uwo.ca/~lila/jacm.ps}",
abstract ="{\textbf{Abstract} Splicing systems are generative mechanism based
          on the splicing operation introduced by Tom Head as a model of DNA
          recombination. We prove that the generative power of finite extended
          splicing systems equals that of Turing machines, provided we consider
          multisets or provided a control mechanism is added. We also show that
          there exist universal splicing systems with the properties above,
          i.e.\ there exists a universal splicing system with fixed components
          which can simulate the behaviour of any given splicing system, when
          an encoding of the particular splicing system is added to its set of
          axioms. In this way the possibility of designing programmable DNA
          computers based on the splicing operations is proved. }",
keywords ="Theory, DNA Computing, DNA recombination, splicing operation,
          H~systems, Chomsky grammars, Turing machines, random context
          grammars, universal grammars, universal Turing machines.",

}

@INPROCEEDINGS{FrePau2001,
	AUTHOR = "R. Freund and Gh. P{\u a}un",
	TITLE = "On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars",
	BOOKTITLE = "Machines, Computations, and Universality; 3rd MCU",
	YEAR = 2001,
	month = "",
	volume = "2055",
	editor = "M. Margenstern and Y. Rogozhin",
	series = "LNCS",
	chapter = "",
	pages = "214--225",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}


@INPROCEEDINGS{FriGro99,
	AUTHOR = "M. Frick and M. Grohe",
	TITLE = "Deciding first-order properties of locally tree-decomposable structures",
	BOOKTITLE = "26th ICALP'99",
	YEAR = 1999,
	month = "",
	volume = "1644",
	editor = "",
	series = "",
	chapter = "",
	pages = "331--340",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{FriSer89,
	AUTHOR = "H. Friedman and \'A. Seress",
	TITLE = "Decidability in elementary analysis, {I}",
	JOURNAL = am,
	YEAR = 1989,
	month = "",
	volume = 76,
	number = "",
	pages = "94--115",
	copy = ""
}

@ARTICLE{FriSer90,
	AUTHOR = "H. Friedman and \'A. Seress",
	TITLE = "Decidability in elementary analysis, {II}",
	JOURNAL = am,
	YEAR = 1990,
	month = "",
	volume = 79,
	number = "",
	pages = "1--17",
	copy = ""
}

@INBOOK{FriLin74,
	AUTHOR = "D. Frijters and A. Lindenmayer",
	TITLE = "A model for the growth and flowering of aster novae-angliae
		on the basis of table <1,0> {L}-systems",
        booktitle = {L Systems}, editor = {G. Rozenberg and A. Salomaa},
	PAGES = "24--52",
	PUBLISHER = "Berlin: Springer",
	YEAR = 1974,
	VOLUME = 15,
	SERIES = "LNCS",
	copy = ""
}

@INBOOK{FriLin76,
	AUTHOR = "D. Frijters and A. Lindenmayer",
	TITLE = "Developmental descriptions of branching patterns with
paracladial relationships",
	PAGES = "57--73",
	BOOKTITLE = "Automata, Languages, Development",
	PUBLISHER = "North-Holland",
	YEAR = 1976,
	month = "",
	address = "",
	volume = "",
	series = "",
	type = "",
	copy = ""
}

@MASTERSTHESIS{Fri85,
	AUTHOR = "M. Frings",
	TITLE = "Systeme mit eingeschr{\"a}nkter paralleler {E}rsetzung",
	SCHOOL = "TU Braunschweig",
	YEAR = 1985,
	ADDRESS = "D-3300 Braunschweig",
 	MONTH = "",
	note = ""
}

@ARTICLE{Fri68,
	AUTHOR = "I. Fri{\v s}",
	TITLE = "Grammars with partial orderings of the rules",
	JOURNAL = icalt,
	YEAR = 1968,
	VOLUME = 12,
	NUMBER = "",
	PAGES = "415--425",
	copy = ""
}

@ARTICLE{Fri69,
	AUTHOR = "I. Fri{\v s}",
	TITLE = "Errata to: {G}rammars with partial orderings of the rules",
	JOURNAL = icalt,
	YEAR = 1969,
	VOLUME = 15,
	NUMBER = "",
	PAGES = "452--453",
	copy = ""
}
@PHDTHESIS{Fro98,
	AUTHOR = "P. Fr{\"o}hlich",
	TITLE = "{DRUM-II}: Efficient Model-Based Diagnosis of Technical Systems",
	SCHOOL = "Universit{\"a}t Hannover",
	YEAR = 1998,
 	month = "",
	address = "",
	type = "PhD Thesis",
	copy = ""
}

@INPROCEEDINGS{FroShi93,
	AUTHOR = "M. P.J. Fromherz and M. H. Shirley",
	TITLE = "Supporting Service Technicians: Model-Based Diagnosis in Context",
	BOOKTITLE = "Workshop on AI in Service and Support at AAAI'93",
	YEAR = 1993,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@ARTICLE{Fro81,
	AUTHOR = "Ch. Frougny",
	TITLE = "Simple deterministic {NTS} languages",
	JOURNAL = ipl,
	YEAR = 1981,
	month = "",
	volume = 12,
	number = "4",
	pages = "174--178",
	copy = ""
}

@INBOOK{Fu77,
	AUTHOR = "K. S. Fu",
	TITLE = "Syntactic pattern recognition, applications",
		  chapter = {Introduction to syntactic pattern
		  recognition},
	PAGES = "1--30",
	PUBLISHER = "Berlin: Springer",
	YEAR = 1977,
	month = "",
	address = "",
	volume = {},
	series = "",
	type = "",
	copy = ""
}

@ARTICLE{Fu83,
	AUTHOR = "K. S. Fu",
	TITLE = "A step towards unification on syntactic and statistical pattern recognition",
	JOURNAL = ieeetopami,
	YEAR = 1983,
	month = "",
	volume = 5,
	number = "2",
	pages = "200--205",
	copy = ""
}

@INPROCEEDINGS{FucFur86,
	crossref = "Sha86",
	AUTHOR = "K. Fuchi and K. Furukawa",
	TITLE = "The role of logic programming in the fifth generation
computer project",
	chapter = "",
	pages = "1--24",
	copy = ""
}

@INPROCEEDINGS{FucCha89,
	AUTHOR = "W. K. Fuchs and M. Chang",
	TITLE = "Diagnosis and repair of large memories: a critical review and recent results",
	BOOKTITLE = "Proc. Int. Workshop on Defect/Fault Tolerance in {VLSI} Sys.",
	YEAR = 1989,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "213--225",
	address = "",
	organization = "", publisher = {New York: Plenum Press},
	copy = ""
}

@INPROCEEDINGS{FucKerWan2005,
	AUTHOR = "B. Fuchs and W. Kern and X. Wang",
	TITLE = "Speeding up the {D}reyfus-{W}agner algorithm for minimum {S}teiner trees",
	BOOKTITLE = "CTW 2005: Workshop on Graphs and Combinatorial Optimization",
	YEAR = 2005,
	month = "",
	volume = "",
	editor = "U. Faigle",
	series = "",
	chapter = "",
	pages = "110--112",
	address = "",
	organization = "University of Cologne, Germany",
        publisher = "",
	copy = ""
}

@TECHREPORT{Fucetal2005,
	AUTHOR = "B. Fuchs and W. Kern and D. M{\"o}lle and S. Richter and P. Rossmanith and X. Wang",
	TITLE = "Dynamic Programming for Minimum {S}teiner Trees",
	INSTITUTION = "Zentrum f{\"u}r Angewandte Informatik K{\"o}ln ZAIK, Universit{\"a}t zu K{\"o}ln (Cologne), Germany",
	YEAR = 2005,
	month = oct,
	number = "zaik2005-492",
	address = "", note ={Also accepted at STACS 2006}, 
	copy = ""
}
@Article{Fucetal2007,
author = {B. Fuchs and W. Kern and D. M{\"o}lle and S. Richter and P. Rossmanith and X. Wang},
title = {Dynamic Programming for Minimum {S}teiner Trees},
journal = tocs,
year = {2007},
OPTkey = {},
volume = {41},
OPTnumber = {},
pages = {493--500},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}


@ARTICLE{FujHee86,
	AUTHOR = "T. Fuja and C. Heegard",
	TITLE = "Row/column replacement for the control of hard defects in semicondutor {RAM}s",
	JOURNAL = ieeetoc,
	YEAR = 1986,
	month = nov,
	volume = 35,
	number = "",
	pages = "996--1000",
	copy = ""
}

@INPROCEEDINGS{Fuj96,
	AUTHOR = "T. Fujito",
	TITLE = "A Unified Local Ratio Approximation of Node-Deletion Problems (Extended Abstract)",
	BOOKTITLE = "European Symposium on Algorithms ESA",
	YEAR = 1996,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "--",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@ARTICLE{Fuj2000,
	AUTHOR = "T. Fujito",
	TITLE = "Approximating minimum feedback vertex set in hypergraph",
	JOURNAL = tcs,
	YEAR = 2000,
	month = "",
	volume = tcs,
	number = "246",
	pages = "107--116",
	copy = ""
}

@ARTICLE{FujNag2002,
	AUTHOR = "T. Fujito and H. Nagamochi",
	TITLE = "A 2-approximation algorithm for the minimum weight edge dominating set problem",
	JOURNAL = dam,
	YEAR = 2002,
	month = "",
	volume = 118,
	number = "",
	pages = "199--207",
	copy = ""
}

@INPROCEEDINGS{Fuj2000a,
	AUTHOR = "T. Fujito",
	TITLE = "On approximability of the independent / connected edge dominating set problems",
	BOOKTITLE = "FST TCS 2000",
	YEAR = 2000,
	month = "",
	volume = "1974",
	editor = "S. Kapoor and S. Prasad",
	series = "LNCS",
	chapter = "",
	pages = "117--126",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{FujDoi2004,
	AUTHOR = "T. Fujito and T. Doi",
	TITLE = "A 2-approximation {NC} algorithm for connected vertex cover and tree cover",
	JOURNAL = ipl,
	YEAR = 2004,
	month = "",
	volume = 90,
	number = "",
	pages = "59--63",
	copy = ""
}

@INPROCEEDINGS{FukAku2004,
	AUTHOR = "D. Fukagawa and T. Akutsu",
	TITLE = "Fast algorithms for Comparison of Similar Unordered Trees",
	BOOKTITLE = "Algorithms and Computation: 15th International Symposium ISAAC 2004",
	YEAR = 2004,
	month = "",
	volume = "3341",
	editor = "R. Fleischer and G. Trippen",
	series = "LNCS",
	chapter = "",
	pages = "452--463",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@Article{FulJai96,
  title =        "Learning in the presence of inaccurate information",
  author =       "M. Fulk and S. Jain",
  pages =        "235--261",
  journal =      tcs,
  year =         "1996",
  volume =       "161",

}

@inproceedings{FueKas2007,
  author    = {M. F{\"u}rer and S. Kasiviswanathan},
  title     = {Exact {Max 2-SAT}: Easier and Faster},
  booktitle = {SOFSEM},
  year      = {2007},
 pages     = {272--283},
seris = {LNCS}, editor = {J. van Leeuwen and others}, volume = {4362},
publisher = {Springer}
 }

@inproceedings{FurKas2007,
  author    = {M. F{\"u}rer and S. Kasiviswanathan},
  title     = {Exact {Max 2-SAT}: Easier and Faster},
  booktitle = {SOFSEM},
  year      = {2007},
 pages     = {272--283},
seris = {LNCS}, editor = {J. van Leeuwen and others}, volume = {4362},
publisher = {Springer}
 }

GGG
@INPROCEEDINGS{Gab2006,
	AUTHOR = "H. N. Gabow",
	TITLE = "Upper degree-constrained partial orientations",
	BOOKTITLE = "Symposium on Discrete Algorithms SODA",
	YEAR = 2006,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "554--563",
	address = "",
	organization = "SIAM",
        publisher = "",
	copy = ""
}


@ARTICLE{Gab70a,
	AUTHOR = "A. Gabrielian",
	TITLE = "The theory of interacting local automata",
	JOURNAL = icalt,
	YEAR = 1970,
	month = "",
	volume = 16,
	number = "",
	pages = "360--377",
	copy = ""
}

@ARTICLE{GabGin74,
	AUTHOR = "A. Gabrelian and S. Ginsburg",
	TITLE = "Grammar schemata",
	JOURNAL = jacm,
	YEAR = 1974,
	month = apr,
	volume = 21,
	number = "2",
	pages = "213--226",
	copy = ""
}

 @ARTICLE{Gac86
  ,AUTHOR = {G\'acs, Peter}
  ,TITLE  = {Reliable computation with cellular automata},
		  JOURNAL = jcss
  ,VOLUME = 32
  ,NUMBER = {1}
  ,MONTH = {February}
  ,PAGES = {15-78}
  ,YEAR = 1986
 }

@ARTICLE{GacRei88,
	AUTHOR = "P. G\'acs and Reif",
	TITLE = "A Simple Three-Dimensional Real-Time Reliable Cellular Array",
	JOURNAL = jcss,
	YEAR = 1988,
	month = "",
	volume = 36,
	number = "",
	pages = "??--",
	copy = ""

}

@Article{GagKocNei2003,
author = {A. Gagarin and W. Kocay  and D. Neilson},
title = {Embeddings of small graphs on the torus},
journal = {Cubo Mat. Educ.},
year = {2003},
OPTkey = {},
volume = {5},
OPTnumber = {},
pages = {351--371},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}

@ARTICLE{GaiSha80,
	AUTHOR = "H. Gaifman and E. Shamir",
	TITLE = "Roots of the hardest context-free language and other constructs",
	JOURNAL = sigact,
	YEAR = 1980,
	month = "Fall",
	volume = 12,
	number = "",
	pages = "45--51",
	copy = ""
}

@INPROCEEDINGS{Gal74,
	AUTHOR = "Z. Galil",
	TITLE = "Two way deterministic pushdown automaton languages and
		 some open problems in the theory of computation",
	BOOKTITLE = "Conference Record XV. Annual Symposium on
                 Switching and Automata Theory",
	YEAR = "1974",
	PAGES = "170--177",
	ORGANIZATION = "IEEE",
	copy = ""
}

@ARTICLE{Gal81,
	AUTHOR = "Z. Galil",
	TITLE = "String matching in real time",
	JOURNAL = jacm,
	YEAR = 1981,
	month = "",
	volume = 28,
	number = "1",
	pages = "134--149",
	copy = ""
}

@ARTICLE{Gal76,
	AUTHOR = "R. G. Gallager",
	TITLE = "Basic limits on protocol information in data communication networks",
	JOURNAL = ieeetoit,
	YEAR = 1976,
	month = "",
	volume = 22,
	number = "4",
	pages = "385--398",
	copy = ""
}


@TECHREPORT{GalGlaReiVol2000,
	AUTHOR = "M. Galota and C. Gla{\ss}er and S. Reith and H. Vollmer",
	TITLE = "A Polynomial-Time Approximation Scheme for Base Station Positioning in UMTS Networks",
	INSTITUTION = "University of Wuerzburg",
	YEAR = 2000,
	month = "",
	number = "TR No. 264",
	address = "",
	copy = ""
}


@ARTICLE{GalTorMuk03,
	AUTHOR = "J.~H. Gallier and S. La Torre and S. Mukhopadhyay",
	TITLE = "Deterministic automata with recursive calls and {DPDA}s",
	JOURNAL = ipl,
	YEAR = 2003,
	month = "",
	volume = 87,
	number = "",
	pages = "187--193",
	copy = ""
}


@ARTICLE{GalWig83,
	AUTHOR = "H. Galperin and A. Wigderson",
	TITLE = "Succinct representations of graphs",
	JOURNAL = icalt,
	YEAR = 1983,
	month = "",
	volume = 56,
	number = "",
	pages = "183--198",
	copy = ""
}


@INPROCEEDINGS{Gan2001,
	AUTHOR = "J.-G. Ganascia",
	TITLE = "Extraction of Recurrent Patterns from Stratified Ordered Trees",
	BOOKTITLE = "Principles of Data Mining and Knowledge Discovery PKDD",
	YEAR = 2001,
	month = "",
	volume = "2167",
	editor = "L. De Raedt and A. Siebes",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "167--178",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{GanKhuSri2001,
	AUTHOR = "R. Gandhi and S. Khuller and A. Srinivasan",
	TITLE = "Approximation Algorithms for Partial Covering Problems",
	BOOKTITLE = "Proceedings of the Twenty-Eighth International Colloquium on Automata, Languages, and Programming ICALP'01",
	YEAR = 2001,
	month = "",
	volume = "2076",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "225--236",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INPROCEEDINGS{Ganetal2002,
	AUTHOR = "R. Gandhi and S. Khuller and S. Parthasarathy and A. Srinivasan",
	TITLE = "Dependent Rounding in Bipartite Graphs",
	BOOKTITLE = "FOCS",
	YEAR = 2002,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "323--332",
	address = "",
	organization = "IEEE",
        publisher = "",
	copy = ""
}

@INPROCEEDINGS{Ganetal2003,
	AUTHOR = "R. Gandhi and E. Halperin and S. Khuller and G. Kortsarz  and A. Srinivasan",
	TITLE = "An Improved Approximation Algorithm for Vertex Cover with Hard Capacities",
	BOOKTITLE = "Proc. of the Thirtieth International Colloquium on Automata, Languages, and Programming ICALP'03",
	YEAR = 2003,
	month = "",
	volume = "2719",
	editor = "",
	series = "LNCS",
	chapter = "",
	pages = "164--175",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@ARTICLE{GarVidCas87,
	AUTHOR = "P. Garc\'{\i}a and E. Vidal and F. Casacuberta",
	TITLE = "Local languages, the successor method, and a step towards a general methodology for the inference of regular grammars",
	JOURNAL = ieeetopami,
	YEAR = 1987,
	month = "",
	volume = 9,
	number = "",
	pages = "841--845",
	copy = ""
}

@ARTICLE{GarVid90,
	AUTHOR = "P. Garc{\'\i a} and E. Vidal",
	TITLE = "Inference of {$k$}-testable languages in the strict sense and applications to syntactic pattern recognition",
	JOURNAL = ieeetopami,
	YEAR = 1990,
	month = "",
	volume = 12,
	number = "",
	pages = "920--925",
	copy = ""
}
@TECHREPORT{Gar93a,
	AUTHOR = "P. Garc{\'\i a}",
	TITLE = "Learning $k$-testable tree sets from positive data",
	INSTITUTION = "Departamento de Sistemas Inform\'aticos y Computaci\'on, Universidad Polit\'ecnica de Valencia",
	YEAR = 1993,
	month = "",
	number = "DSIC/II/46/1993",
	address = "\url{http://www.dsic.upv.es/users/tlcc/tlcc.html}",
	copy = ""
}


@INPROCEEDINGS{GarVidOnc90,
	AUTHOR = "P. Garc\'{\i}a and E. Vidal and J. Oncina",
	TITLE = "Learning Locally Testable Languages in the Strict Sense",
	BOOKTITLE = "First International Workshop on Algorithmic Learning Theory ALT'90",
	YEAR = 1990,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "325--328",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{GarRui2000,
	AUTHOR = "P. Garc\'{\i}a and J. Ruiz",
	TITLE = "Right and left locally testable languages",
	JOURNAL = tcs,
	YEAR = 2000,
	month = "",
	volume = 246,
	number = "",
	pages = "253--264",
	copy = ""
}

@ARTICLE{GarRui2006,
	AUTHOR = "P. Garc\'{\i}a and J. Ruiz",
	TITLE = "Learning in varieties of the form {{\bf $V^*LI$}} from positive data",
	JOURNAL = tcs,
	YEAR = 2006,
	month = "",
	volume = 362,
	number = "",
	pages = "100--114",
	copy = ""
}

@ARTICLE{Gar83,
	 AUTHOR = "A. Gardiner",
	 TITLE = "Embedding {$k$}-regular graphs in {$k+1$}-regular graphs",
	 JOURNAL = jlms,
	 YEAR = 1983,
	 VOLUME = "(2)28",
	 NUMBER = "",
	 PAGES = "393--400",
	 copy = ""
}

@ARTICLE{GarMau83,
	AUTHOR = "R. J. Gardner and R. D. Mauldin",
	TITLE = "On the {H}ausdorff dimension of a set of complex
continued fractions",
	JOURNAL = illjm,
	YEAR = 1983,
	month = "",
	volume = 27,
	number = "2",
	pages = "334--345",
	copy = ""
}


@ARTICLE{GarJohSto76,
	AUTHOR = "M. R. Garey and D. S. Johnson and L. Stockmeyer",
	TITLE = "Some simplified {NP}-complete graph problems",
	JOURNAL = tcs,
	YEAR = 1976,
	month = "",
	volume = 1,
	number = "",
	pages = "237--267",
	copy = ""
}

@ARTICLE{GarJoh77,
	AUTHOR = "M. R. Garey and D. S. Johnson",
	TITLE = "The rectilinear {S}teiner tree problem is {NP}-complete",
	JOURNAL = siamam,
	YEAR = 1977,
	month = "",
	volume = 32,
	number = "4",
	pages = "826--834",
	copy = ""
}

@InProceedings{GarHelPer97,
  title =        "Colouring Paths in Directed Symmetric Trees with
                 Applications to {WDM} Routing",
  author =       "L. Gargano and P. Hell and S. Perennes",
  editor =       "P. Degano and R. Gorrieri and A.
                 Marchetti-Spaccamela",
  booktitle =    "Automata, Languages and Programming, 24th
                 International Colloquium",
  address =      "Bologna, Italy",
  year =         "1997",
  series =       "LNCS",
  volume =       "1256",
  publisher =    "Springer-Verlag",
  pages =        "505--515",
}
@INPROCEEDINGS{GarRes00,
	AUTHOR = "L. Gargano and A. A. Rescigno",
	TITLE = "Coloring circular arcs with applications to {WDM} routing",
	BOOKTITLE = "ARACNE (Sattelite Workshop ICALP 2000)",
	YEAR = 2000,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "",
	pages = "155--166",
	address = "",
	organization = "",
        publisher = "Carleton",
	copy = ""
}

@ARTICLE{Gar88,
	AUTHOR = "L. Garnett",
	TITLE = "A computer algorithm for determining the {H}ausdorff
		  dimension of certain fractals",
	JOURNAL = "Math. of Computation",
	YEAR = 1988,
	month = "",
	volume = 51,
	number = "",
	pages = "291--300",
	copy = ""
}

@ARTICLE{GarNie95,
	AUTHOR = "D. K. Garnick and N. A. Nieuwejaar",
	TITLE = "Total domination of the $m\times n$ chessboard by kings, crosses, and knights", 
	JOURNAL = arscomb,
	YEAR = 1995,
	month = "",
	volume = 41,
	number = "",
	pages = "45--56",
	copy = ""
}

 @inproceedings{Garetal2000,
    author = "M. Garofalakis and A. Gionis and R. Rastogi and S. Seshadri and K. Shim",
    title = "{XTRACT}: a system for extracting document type descriptors from {XML} documents",
    pages = "165--176",
    year = "2000", booktitle = {Proceedings of ACM SIGMOD Conference on Management of Data}, 
    url = "citeseer.nj.nec.com/garofalakis00xtract.html" }


@ARTICLE{Garetal2003,
	AUTHOR = "M. Garofalakis and A. Gionis and R. Rastogi and S. Seshadri and K. Shim",
	TITLE = "{XTRACT}: learning document type descriptors from {XML} document collections",
	JOURNAL = {Data Mining and Knowledge Discovery},
	YEAR = 2003,
	month = "",
	volume = 7,
	number = "",
	pages = "23--56",
	copy = ""
}


@INPROCEEDINGS{Gar92,
	crossref = "Tho92",
	AUTHOR = "S. G{\"a}rtner",
	TITLE = "Partitions-limitierte {L}indenmayersysteme",
	chapter = "",
	pages = "23--27",
	copy = ""
}

@ARTICLE{Gar93,
	AUTHOR = "S. G{\"a}rtner",
	TITLE = "A remark on the regulation of {$k$lET0L} systems",
	JOURNAL = ipl,
	YEAR = 1993,
	month = "",
	volume = 48,
	number = "",
	pages = "83--85",
	copy = ""
}

@BOOK{Gar95,
	AUTHOR = "S. G{\"a}rtner",
	TITLE = "Partitions-limitierte {L}indenmayer-{S}ysteme",
	PUBLISHER = "Aachen: Shaker-Verlag",
	YEAR = 1995,
	month = "",
	volume = "",
	edition = "",
	series = "Berichte aus der Informatik",
        note = {Zugleich: Dissertation Technische Universit{\"a}t Braunschweig},
	copy = ""
}

@INPROCEEDINGS{Gar96,
	AUTHOR = "S. G{\"a}rtner",
	TITLE = "On partition limited {0L} systems",
	BOOKTITLE = "Developments in Language Theory II; at the
                  crossroads of mathematics, computer science and biology",
	YEAR = 1996,
	month = "",
	volume = "",
	editor = "",
	series = "",
	chapter = "Controlled derivations and grammar systems",
	pages = "230--236",
	address = "",
	organization = "",
	copy = ""
}
@article{GasKin2008,
  author    = {W. I. Gasarch and
               Keung Ma Kin},
  title     = {Invitation to Fixed-Parameter Algorithms; Parameterized
               Complexity Theory; Parameterized Algorithmics: Theory, Practice
               and Prospects},
  journal   = {The Computer Journal},
  volume    = {51},
  number    = {1},
  year      = {2008},
  pages     = {137--140},
}

@INPROCEEDINGS{GauKri00,
	AUTHOR = "D.~R. Gaur and R. Krishnamurti",
	TITLE = "Self-duality of bounded monotone {B}oolean functions and related problems",
	BOOKTITLE = "Proceedings of the 11th International Conference Algorithmic Learning Theory ALT 2000",
	YEAR = 2000,
	month = "",
	volume = "1968",
	editor = "H. Arimura and S. Jain and A. Sharma",
	series = "LNCS/LNAI",
	chapter = "",
	pages = "209--223",  publisher = {Springer}, 
	address = "",
	organization = "",
	copy = ""
}

@INPROCEEDINGS{Gavetal01,
	AUTHOR = "C. Gavoille and D. and Peleg and A. Raspaud and E. Sop\'ena",
	TITLE = "Small $k$-Dominating Sets in Planar Graphs with Applications",
	BOOKTITLE = "Graph-Theoretic Concepts in Computer Science WG'01",
	YEAR = 2001,
	month = "",
	volume = "2204",
	editor = "A. Brandst{\"a}dt and V.~B. Le",
	series = "LNCS",
	chapter = "",
	pages = "",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}

@INCOLLECTION{Gaz88,
	AUTHOR = "G. Gazdar",
	TITLE = "Applicability of indexed grammars to natural languages",
	BOOKTITLE = "Natural Language Parsing and Linguistic Theories",
	PUBLISHER = "D. Reidel, Dordrecht",
	YEAR = 1988,
	month = "",
	volume = "",
	editor = "U. Reyle and C. Rohrer (eds.)",
	series = "",
	chapter = "",
	pages = "69--94",
	address = "",
	type = "",
	copy = ""
}

@INPROCEEDINGS{GazMil90,
	AUTHOR = "H. Gazit and G. L. Miller",
	TITLE = "Planar separators and the {E}uclidean norm",
	BOOKTITLE = "Algorithms (SIGAL'90)",
	YEAR = 1990,
	month = "",
	volume = "450",
	editor = "T. Asano and T. Ibaraki and H. Imai and T. Nishizeki",
	series = "LNCS",
	chapter = "",
	pages = "338--347",
	address = "",
	organization = "",
        publisher = "",
	copy = ""
}

@ARTICLE{Gefetal83,
	AUTHOR = "Y. Gefen and others",
	TITLE = "Geometric implementation of hypercube lattices with
		  noninteger dimensionality by use of low lacunarity
		  fractal lattices",
	JOURNAL = prevl,
	YEAR = 1983,
	month = "",
	volume = 50,
	number = "3",
	pages = "145--148",
	copy = ""
}

@ARTICLE{GefAhaMan84,
	AUTHOR = "Y. Gefen and A. Aharoni and B. B. Mandelbrot",
	TITLE = "Phase transitions on fractals: {III}.\ Infinitely
		  ramified lattices ",
	JOURNAL = jpamg,
	YEAR = 1984,
	month = "",
	volume = 17,
	number = "",
	pages = "1277--1289",
	copy = ""
}

@ARTICLE{Gef88,
	AUTHOR = "V. Geffert",
	TITLE = "A representation of recursively enumerable languages
		  by two homomorphisms and a quotient",
	JOURNAL = tcs,
	YEAR = 1988,
	month = "",
	volume = 62,
	number = "",
	pages = "235--249",
	copy = ""
}

@INPROCEEDINGS{Gef88a,
	AUTHOR = "V. Geffert",
	TITLE = "Context-free like forms for the phrase-structure grammars",
	BOOKTITLE = "Mathematical Foundations of Computer Science MFCS'88",
	YEAR = 1988,
	month = "",
	volume = "324", publisher = "Springer",
	editor = "M. P. Chytil and others",
	series = "LNCS",
	chapter = "",
	pages = "309--317",
	address = "",
	organization = "",
	copy = ""
}

@ARTICLE{Gef91,
	AUTHOR = "V. Geffert",
	TITLE = "How to generate languages using only two pairs of parentheses",
	JOURNAL = eikneu,
	YEAR = 1991,
	month = "",
	volume = 27,
	number = "5/6",
	pages = "303--315",
	copy = ""
}

@ARTICLE{Geketal93,
	AUTHOR = "V. Gekeler and J. Epple and G. Kleymann and H. Probst",
	TITLE = "Selective and synchronous activation of early-{S}-phase replicons of {E}hrlich ascites cells",
	JOURNAL = {Molecular and Cellular Biology},
	YEAR = 1993,
	month = aug,
	volume = 13,
	number = "8",
	pages = "5020--5033",
	copy = ""
}

@ARTICLE{Geletal90,
	AUTHOR = "C. Geldrez and S. Matwin and J. Morin and R.~L. Probert",
	TITLE = "An Application of Explanation-Based Learning to Protocol Conformance Testing",
	JOURNAL = {IEEE Expert: Intelligent Systems and Their Applications},
	YEAR = 1990,
	month = oct,
	volume = 5,
	number = "5",
	pages = "45--47 \& 50--60",
	copy = ""
}


@INPROCEEDINGS{Geo94,
	crossref = "Pau94a",
	AUTHOR = "G. Georgescu",
	TITLE = "Infinite hierarchies of some types of contextual languages",
	chapter = "",
	pages = "137--150",
	copy = ""
}

@ARTICLE{GerKob2000,
	AUTHOR = "M. U. Gerber and D. Kobler",
	TITLE = "Algorithmic approach to the satisfactory graph partitioning problem",
	JOURNAL = ejor,
	YEAR = 2000,
	month = "",
	volume = 125,
	number = "",
	pages = "283--291",
	copy = ""
}

@ARTICLE{GerHar89,
	AUTHOR = "J. S. Geronimo and D. P. Hardin",
	TITLE = "An exact formula for the measure dimensions
associated with a class of piecewice linear maps",
	JOURNAL = constappr,
	YEAR = 1989,
	month = "",
	volume = 5,
	number = "",
	pages = "89--98",
	copy = ""
}

@INPROCEEDINGS{Ghe86,
	AUTHOR = "M. Gheorge",
	TITLE = "Linear valence grammars",
	BOOKTITLE = IMYCS,
	YEAR = 1986,
	PAGES = "281--285", 
	ORGANIZATION = "",
editor = {J. Demetrovics and J. Kelemen}, 
publisher = {Budapest: Computer and Automation  Institute of the Hungarian Academy
	of Sciences, TR no. 185/1986}, 
	copy = ""
}

@ARTICLE{GhoBha84,
	 AUTHOR = "R. K. Ghosh and G. P. Bhattacharjee",
	 TITLE = "Parallel breadth-first search algorithms for
		  trees and graphs",
	 JOURNAL = ijcm,
	 YEAR = 1984,
	 VOLUME = 15,
	 NUMBER = "",
	 PAGES = "225--268",
	 copy = "Corrigendum von Y. Zhang !"
}

@ARTICLE{Gia96,
	AUTHOR = "P. di Gianantonio",
	TITLE = "Real number computability and domain theory",
	JOURNAL = icneu,
	YEAR = 1996,
	month = "",
	volume = 127,
	number = "",
	pages = "11--25",
	copy = ""
}

@ARTICLE{Giaetal96,
	AUTHOR = "D. Giammarresi and others",
	TITLE = "Monadic second-order logic over rectangular pictures
                  and recognizability by tiling systems",
	JOURNAL = icneu,
	YEAR = 1996,
	month = "",
	volume = 125,
	number = "",
	pages = "32--45",
	copy = ""
}

@ARTICLE{GiaRes96,
	AUTHOR = "D. Giammarresi and A. Restivo",
	TITLE = "Two-dimensional finite state recognizability",
	JOURNAL = fundinform,
	YEAR = 1996,
	month = "",
	volume = 25,
	number = "",
	pages = "399--422",
	copy = ""
}

@ARTICLE{GiaMon99,
	AUTHOR = " D. Giammmarresi and R. Montalbano",
	TITLE = "Deterministic generalized automata",
	JOURNAL = tcs,
	YEAR = 1999,
	month = "",
	volume = 215,
	number = "",
	pages = "191--208",
	copy = ""
}


@INPROCEEDINGS{GiamMonWoo01,
	AUTHOR = "D. Giammarresi and  R. Montalbano and D. Wood",
	TITLE = "Block-deterministic regular languages",
	BOOKTITLE = "Theoretical Computer Science; 7th Italian Conference ICTCS 2001",
	YEAR = 2001,
	month = "",
	volume = "2202",
	editor = "A. Restivo and S. Ronchi della Rocca and L. Roversi",
	series = "LNCS",
	chapter = "",
	pages = "184--196",
	address = "",
	organization = "",
        publisher = "Springer",
	copy = ""
}


@ARTICLE{Gie59,
	AUTHOR = "A. Gierl",
	TITLE = "{\"U}ber das {H}ausdorffsche {M}a\ss\ gewisser
{P}unktmengen in der {Z}ifferntheorie",
	JOURNAL = crelle,
	YEAR = 1959,
	month = "",
	volume = 202,
	number = "",
	pages = "183--195",
	note = "Gek{\"u}rzte Fassung der Dissertation (Mainz 1955)"},
	copy = ""
}


@INPROCEEDINGS{Gie90,
	AUTHOR = "E. G. Giessmann",
	TITLE = "Generation of fractal curves by generalizations of {L}indenmayer systems",
	BOOKTITLE = "FRACTALS",
	YEAR = 1990,
	PAGES = "",
	ORGANIZATION = "IFIP",
	copy = ""
}


@INPROCEEDINGS{Gie91,
	crossref = "PeiHenPen91",
	AUTHOR = "E. G. Giessmann",
	TITLE = "Generation of fractal curves by generalizations of {L}indenmayer systems",
	chapter = "",
	pages = "147--157",
	copy = ""
}


@ARTICLE{Gil58,
	AUTHOR = "E. N. Gilbert",
	TITLE = "Gray codes and paths on the n-cube",
	JOURNAL = bstj,
	YEAR = 1958,
	month = may,
	volume = 37,
	number = "",
	pages = "815--826",
	copy = ""
}


@ARTICLE{GilHutTar84,
	AUTHOR = "J. R. Gilbert and J. P. Hutchinson and R. E. Tarjan",
	TITLE = "A separator theorem for graphs of bounded genus",
	JOURNAL = jalg,
	YEAR = 1984,
	month = "",
	volume = 5,
	number = "",
	pages = "391--407",
	copy = ""
}


@ARTICLE{GilGree79,
	AUTHOR = "W. J. Gilbert and R. J. Green",
	TITLE = "Negative based number systems",
	JOURNAL = mm,
	YEAR = 1979,
	month = sep,
	volume = 52,
	number = "4",
	pages = "240--245",
	copy = ""
}


@ARTICLE{Gil81,
	AUTHOR = "W. J. Gilbert",
	TITLE = "Radix representations of quadratic fields",
	JOURNAL = jmaa,
	YEAR = 1981,
	month = "",
	volume = 83,
	number = "",
	pages = "264--274",
	copy = ""
}


@INCOLLECTION{Gil81a,
	AUTHOR = "W. J. Gilber