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},
}
@article{AazSti2009,
author = {A. Aazami and K. Stilp},
title = {Approximation Algorithms and Hardness for Domination with Propagation},
year = {2009},
journal = siamdm,
volume = {23},
number = {3},
pages = {1382--1399},
}
@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",
}
@inproceedings{AbeCosSpi2004,
author = {J. Abela and
F. Coste and
S. Spina},
title = {Mutually Compatible and Incompatible Merges for the Search
of the Smallest Consistent DFA},
pages = {28--39},
editor = {G. Paliouras and
Y. Sakakibara},
booktitle = {Grammatical Inference: Algorithms and Applications ICGI},
publisher = {Springer},
series = {LNCS},
volume = {3264},
year = {2004},
}
@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.~N. 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.~N. 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.~N. 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.~N. 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.~N. 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},
}
@Article{AbuFerLan2008,
author = {F.~N. Abu-Khzam and H. Fernau and M. A. Langston},
title = {A bounded search tree algorithm for parameterized {\sc face cover}},
journal = jda,
year = {2008},
OPTkey = {},
volume = {6},
OPTnumber = {},
pages = {541--552},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@inproceedings{Abu2009,
author = {F.~N. Abu-Khzam},
title = {A quadratic kernel for 3-set packing},
year = {2009},
pages = {81--87},
editor = {J. Chen and S.~B. Cooper},
booktitle = {Theory and Applications of Models of Computation, TAMC},
publisher = {Springer},
series = {LNCS},
volume = {5532},
}
@InProceedings{Abuetal2010,
author = {F.~N. Abu-Khzam and H. Fernau and M. A. Langston and S. Lee-Cultura and U. Stege},
title = {A Fixed-Parameter Algorithm for String-to-String Correction},
booktitle = {Proceedings of the 16th Computing: the Australasian Theory Symposium CATS},
OPTcrossref = {},
OPTkey = {},
pages = {31--37},
year = {2010},
OPTeditor = {},
volume = {109},
OPTnumber = {},
series = {Conferences in Research and Practices in Information Technology CRPIT},
OPTaddress = {},
OPTmonth = {},
organization = {Australian Computer Society ACS},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}
@article{Abu2010,
author = {F.~N. Abu-Khzam},
title = {A kernelization algorithm for $d$-{H}itting {S}et},
journal = jcss,
volume = {76},
number = {7},
year = {2010},
pages = {524--531},
}
@article{Abu2010a,
author = {F.~N. Abu-Khzam},
title = {An improved kernelization algorithm for $r$-{S}et {P}acking},
journal = ipl,
volume = {110},
number = {16},
year = {2010},
pages = {621--624},
}
@article{Abuetal2011,
author = {F.~N. Abu-Khzam and H. Fernau and M. A. Langston and S. Lee-Cultura and U. Stege},
title = {A Fixed-Parameter Algorithm for String-to-String Correction},
journal = "Discrete Optimization",
volume = {8},
year = {2011},
pages = {41--49},
}
@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",
}
@Article{Acuetal2010,
author = {V. Acu\~na and C.~E. Ferreira and A.~S. Freire and E. Moreno},
title = {The biclique $k$-clustering problem in bipartite graphs and its application in bioinformatics},
journal = {Electronic Notes in Discrete Mathematics},
year = {2010},
volume = {36},
pages = {159--166},
}
@article{AdaIwaKas84,
author = {A. Adachi and
S. Iwata and
T. Kasai},
title = {Some Combinatorial Game Problems Require $\Omega(n^{\mbox{k}})$
Time},
journal = jacm,
volume = {31},
number = {2},
year = {1984},
pages = {361--376},
}
@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{Adi2012,
author = {S.~I. Adian},
title = {On a Method for Proving Exact Bounds
on Derivational Complexity in {T}hue Systems},
journal = {Mathematical Notes},
year = {2012},
OPTkey = {},
volume = {92},
number = {1},
pages = {3--15},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@inproceedings{AdiChiSau2010,
author = {A. Adiga and
R.h Chitnis and
S. Saurabh},
title = {Parameterized Algorithms for Boxicity},
booktitle = {Algorithms and Computation - 21st International Symposium,
ISAAC 2010,
Part I},
year = {2010},
pages = {366--377},
editor = {O. Cheong and
K.-Y. Chwa and
K. Park},
publisher = {Springer},
series = {LNCS},
volume = {6506},
}
@Article{Adj35,
author = {K. Adjukiewicz},
title = {Die syntaktische {K}onnexit{\"a}t},
journal = {Studia Philosophica},
year = {1935},
OPTkey = {},
volume = {1},
OPTnumber = {},
pages = {1--27},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = ""
}
@incollection{AdrZaa2006,
year={2006},
booktitle={Innovations in Machine Learning},
volume={194},
series={Studies in Fuzziness and Soft Computing},
editor={Holmes, D.~¨E. and Jain, L.~C.},
title={Computational Grammatical Inference},
publisher={Springer},
author={Adriaans, P.~W. and Zaanen, M.~M.},
pages={187--203}
}
@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{AgaEzrSha2012,
author = {P. K. Agarwal and
E. Ezra and
M. Sharir},
title = {Near-Linear Approximation Algorithms for Geometric Hitting
Sets},
journal = alg,
volume = {63},
year = {2012},
pages = {1--25},
}
@Article{Aggetal2005,
author = {G. Aggarwal and T. Feder and K. Kenthapadi and R. Motwani and R. Panigrahy and D. Thomas and An Zhu},
title = {Approximation Algorithms for $k$-Anonymity},
journal = {Journal of Privacy Technology},
year = {2005},
OPTkey = {},
OPTvolume = {},
number = {20051120001},
OPTpages = {},
OPTmonth = {},
OPTnote = {},
annote = {Availabe from http://www.jopt.org/papers.html}
}
@article{AgrKleRav95,
author = {A. Agrawal and
P. N. Klein and
R. Ravi},
title = {When Trees Collide: An Approximation Algorithm for the Generalized
{S}teiner Problem on Networks},
journal = siam,
volume = {24},
number = {3},
year = {1995},
pages = {440--456},
}
@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",
}
@Article{Aho95,
AUTHOR = "H. Ahonen",
TITLE = "Automatic generation of {SGML} content models",
journal = {Electronic Publishing -- Origination, Dissemination and Design},
year = {1995},
OPTkey = {},
volume = {8},
OPTnumber = {},
pages = {195--206},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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 = ""
}
@PhdThesis{Aho96b,
author = {H. Ahonen},
title = {Generating grammars for structured documents using grammatical inference methods},
school = {Department of Computer Science, University of Helsinki, Finland},
year = {1996},
}
@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 = ""
}
@INPROCEEDINGS{AhoManNik94,
AUTHOR = "H. Ahonen and H. Mannila and E. Nikunen",
TITLE = "Forming grammars for structured documents: an application of grammatical inference",
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,
pages = "153--167",
}
@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 = ""
}
@article{Akbetal2009,
author = {S. Akbari and
S. Bolouki and
P. Hatami and
M. Siami},
title = {On the signed edge domination number of graphs},
journal = dm,
volume = {309},
number = {3},
year = {2009},
pages = {587--594},
}
@Article{AkiNisSai80,
author = {T. Akiyama and T. Nishizeki and N. Saito},
title = {{NP}-completeness of the {H}amiltonian cycle problem for bipartite graphs},
journal = {Journal of Information Processing},
year = {1980},
volume = {3},
pages = {73--76}
}
@article {AktOzd2000,
author = {Akturk, M. S. and {O}zdemir, D.},
title = {An exact approach to minimizing total weighted tardiness with release dates},
journal = {IIE Transactions},
publisher = {Springer Netherlands},
pages = {1091--1101},
volume = {32},
issue = {11},
year = {2000}
}
@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. Halld\'orson",
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{Akuetal2007,
author = {T. Akutsu and
H. Bannai and
S. Miyano and
S. Ott},
title = {On the complexity of deriving position specific score matrices
from positive and negative sequences},
journal = dam,
volume = {155},
number = {6-7},
year = {2007},
pages = {676--685},
}
@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}
}
@Article{AlfBra2005a,
author = {M. Alfalayleh and L. Brankovic},
title = {An overview of security issues and techniques in mobile agents},
journal = {Communications and Multimedia Security},
year = {2005},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
pages = {59--78},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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{Ali2011,
author = {S. Alikhani},
title = {On the graphs with four distinct domination roots},
journal = ijcm,
volume = {88},
number = {13},
year = {2011},
pages = {2717--2720},
}
@article{AliKan2000,
author = {P. Alimonti and
V. Kann},
title = {Some {APX}-completeness results for cubic graphs},
journal = tcs,
volume = {237},
number = {1-2},
year = {2000},
pages = {123-134},
}
@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. H\o{a}stad 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 = ""
}
@Article{AloGutKri2004,
author = {N. Alon and G. Gutin and M. Krivelevich},
title = {Algorithms with large domination ratio},
journal = {Journal of Algorithms},
year = {2004},
volume = {50},
OPTnumber = {},
pages = {118--131},
}
@article{AloMosSaf2006,
author = {N. Alon and
D. Moshkovitz and
S. Safra},
title = {Algorithmic construction of sets for {\it k}-restrictions},
journal = {ACM Transactions on Algorithms},
volume = {2},
number = {2},
year = {2006},
pages = {153--177},
}
@inproceedings{Aloetal2007,
author = {N. Alon and
F. V. Fomin and
G. Gutin and
M. Krivelevich and
S. Saurabh},
title = {Parameterized Algorithms for Directed Maximum Leaf Problems},
booktitle = {Automata, Languages and Programming, 34th International
Colloquium, ICALP},
year = {2007},
pages = {352--362},
editor = {L. Arge and
C. Cachin and
T.Jurdzinski and
A. Tarlecki},
publisher = {Springer},
series = {LNCS},
volume = {4596},
}
@inproceedings{AloLokSau2009,
author = {N. Alon and
D. Lokshtanov and
S. Saurabh},
title = {Fast {FAST}},
year = {2009},
pages = {49--58},
editor = {S. Albers and
A. Marchetti-Spaccamela and
Y. Matias and
S. E. Nikoletseas and
W. Thomas},
booktitle = {Automata, Languages and Programming, 36th International
Colloquium, ICALP 2009, Part I},
publisher = {Springer},
series = {LNCS},
volume = {5555},
}
@Article{Aloetal2009,
author = {N. Alon and
F.~V. Fomin and G. Gutin and M. Krilevich and
S. Saurabh},
title = {Spanning directed trees with many leaves},
journal = siamdm,
year = {2009},
OPTkey = {},
volume = {23},
OPTnumber = {},
pages = {466--476},
}
@Article{Aloetal2009a,
author = {N. Alon and
T. Kaufman and M. Krilevich and
D. Ron},
title = {Testing triangle-freeness in general graphs},
journal = siamdm,
year = {2009},
OPTkey = {},
volume = {22},
OPTnumber = {},
pages = {786--819},
}
@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"
}
@inproceedings{Alpetal2011,
author = {L. Alpoge and
T. Ang and
L. Schaeffer and
J. Shallit},
title = {Decidability and Shortest Strings in Formal Languages},
booktitle = {Descriptional Complexity of Formal Systems, DCFS},
year = {2011},
pages = {55--67},
editor = {M. Holzer and
M. Kutrib and
G. Pighizzini},
publisher = {Springer},
series = {LNCS},
volume = {6808},
}
@INPROCEEDINGS{AlqSan94,
AUTHOR = "R. Alqu\'ezar and A. Sanfeliu",
TITLE = "Incremental grammatical inference from positive and negative data using unbiased finite state automata",
BOOKTITLE = "Shape, Structure and Pattern Recognition. Proc. SSPR'94",
YEAR = 1995,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "291--300",
publisher = "World Scientific",
organization = "IAPR",
copy = ""
}
@article{ALSSai2011,
author = {N.~M.~G. AL-Saidi and
M.~R.~ Md. Said},
title = {Improved digital signature protocol using iterated function
systems},
journal = ijcm,
volume = {88},
number = {17},
year = {2011},
pages = {3613--3625},
}
@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{AlvCacSon2008,
author = {Alves, C.~E.~R., and E.~N. C\'aceres and S.~W. Song},
title = {An all-substrings common subsequence algorithm},
journal = dam,
year = {2008},
OPTkey = {},
volume = {156},
OPTnumber = {},
pages = {1025--1035},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = ""
}
@inproceedings{Alvetal2010,
author = {G.~I. Alvarez and
J. H. Victoria and
E. Bravo and
P. Garc\'{\i}a},
title = {A Non-deterministic Grammar Inference Algorithm Applied
to the Cleavage Site Prediction Problem in Bioinformatics},
booktitle = {Grammatical Inference: Theoretical Results and Applications,
10th International Colloquium, ICGI},
year = {2010},
pages = {267--270},
editor = {J. M. Sempere and
P. Garc\'{\i}a},
publisher = {Springer},
series = {LNCS},
volume = {6339},
}
@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 = ""
}
@inproceedings{Ambetal97a,
author = {A. Ambainis and
K. Apsitis and
C. Calude and
R. Freivalds and
M. Karpinski and
T. Larfeldt and
I. Sala and
J. Smotrovs},
title = {Effects of {K}olmogorov Complexity Present in Inductive Inference
as Well},
booktitle = {ALT},
year = {1997},
pages = {244--259},
editor = {M. Li and
A. Maruoka},
booktitle = {Algorithmic Learning Theory, 8th International Conference,
ALT '97},
publisher = {Springer},
series = {LNCS},
volume = {1316},
}
@inproceedings{Ambetal97,
author = {A. Ambainis and
K. Apsitis and
R. Freivalds and
W. I. Gasarch and
C. H. Smith},
title = {Team Learning as a Game},
booktitle = {ALT},
year = {1997},
pages = {2--17},
editor = {M. Li and
A. Maruoka},
booktitle = {Algorithmic Learning Theory, 8th International Conference,
ALT '97},
publisher = {Springer},
series = {LNCS},
volume = {1316},
}
@ARTICLE{Amb2001,
AUTHOR = "A. Ambainis",
TITLE = "Probabilistic inductive inference: a survey",
JOURNAL = tcs,
YEAR = 2001,
month = "",
volume = 264,
number = "",
pages = "155--167",
copy = ""
}
@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 = ""
}
@inproceedings{AmbTay2003,
author = {A. Ambroladze and
J. Shawe-Taylor},
title = {When Is Small Beautiful?},
booktitle = {Computational Learning Theory and Kernel Machines, 16th
Annual Conference on Computational Learning Theory and 7th
Kernel Workshop, COLT/Kernel 2003, COLT},
year = {2003},
pages = {729--730},
editor = {B. Sch{\"o}lkopf and
M. K. Warmuth},
publisher = {Springer},
series = {LNCS},
volume = {2777},
}
@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},
}
@article{AmbMas2009,
author = {C. Amb{\"u}hl and
M. Mastrolilli},
title = {Single Machine Precedence Constrained Scheduling Is a Vertex
Cover Problem},
journal = alg,
volume = {53},
number = {4},
year = {2009},
pages = {488--503},
ee = {http://dx.doi.org/10.1007/s00453-008-9251-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{AmbMasSve2011,
author = {C. Amb{\"u}hl and
M. Mastrolilli and
O. Svensson},
title = {Inapproximability Results for Maximum Edge Biclique, Minimum
Linear Arrangement, and Sparsest Cut},
journal = siam,
volume = {40},
number = {2},
year = {2011},
pages = {567--596},
}
@article{Ambetal2011,
author = {C. Amb{\"u}hl and
M. Mastrolilli and
N. Mutsanas and
O. Svensson},
title = {On the Approximability of Single-Machine Scheduling with
Precedence Constraints},
journal = {Mathematics of Operations Research},
volume = {36},
number = {4},
year = {2011},
pages = {653--669},
}
@UNPUBLISHED{Ami,
AUTHOR = "J. Amilhastre",
TITLE = "Complexity of minimum biclique decomposition of bipartite graphs",
NOTE = "University of Montpellier",
year = 2002,
month = "",
copy = ""
}
@Article{AmiFomSau2012,
author = {O. Amini and F.~V. Fomin and S. Saurabh},
title = {Counting Subgraphs Via Homomorphisms},
journal = siamdm,
year = {2012},
OPTkey = {},
volume = {26},
number = {2},
pages = {695--717},
}
@article{Amietal2012,
author = {O. Amini and
D. Peleg and
S. P{\'e}rennes and
I. Sau and
S. Saurabh},
title = {On the approximability of some degree-constrained subgraph
problems},
journal = dam,
volume = {160},
number = {12},
year = {2012},
pages = {1661--1679},
}
@MastersThesis{Ami2004,
author = {N. Amit},
title = {The Bicluster Graph
Editing Problem},
school = {Tel Aviv University},
year = {2004},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{AmoCulTad2001,
author = {T.~R. Amoth and
P. Cull and
P. Tadepalli},
title = {On Exact Learning of Unordered Tree Patterns},
journal = {Machine Learning},
volume = {44},
number = {3},
year = {2001},
pages = {211--243},
}
@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 = ""
}
@inproceedings{AnaGusVol2010,
author = {D. S. Ananichev and
V. V. Gusev and
M. V. Volkov},
title = {Slowly Synchronizing Automata and Digraphs},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th
International Symposium, MFCS},
year = {2010},
editor = {P. Hlinen{\'y} and
A. Kucera},
publisher = {Springer},
series = {LNCS},
volume = {6281},
pages = {55--65},
}
@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{AngBamGou2009,
author = {E. Angel and
E. Bampis and
L. Gourv{\`e}s},
title = {On the minimum hitting set of bundles problem},
journal = tcs,
volume = {410},
number = {45},
year = {2009},
pages = {4534--4542},
}
@inproceedings{AngCampLaf2012,
author = {E. Angel and
R. Campigotto and
C. Laforest},
title = {Implementation and Comparison of Heuristics for the Vertex
Cover Problem on Huge Graphs},
booktitle = {Experimental Algorithms --- 11th International Symposium,
SEA},
year = {2012},
pages = {39--50},
editor = {R. Klasing},
publisher = {Springer},
series = {LNCS},
volume = {7276},
}
@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 = ""
}
@TechReport{AngLai86,
AUTHOR = "D. Angluin and P. Laird",
TITLE = "Identifying $k$-{CNF} formulas from noisy examples",
institution = {Yale University, Department of Computer Science},
year = {1986},
number = {TR478},
}
@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 = ""
}
@TechReport{Ang87a,
AUTHOR = "D. Angluin",
TITLE = "Learning $k$-bounded context-free grammars",
institution = {Yale University, Department of Computer Science},
year = {1987},
number = {TR557},
}
@ARTICLE{Ang88,
AUTHOR = "D. Angluin",
TITLE = "Queries and concept learning",
JOURNAL = {Machine Learning},
YEAR = 1988,
month = "",
volume = 2,
number = "",
pages = "319--342",
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{AngWesZhu2000,
AUTHOR = "D. Angluin and J. Westbrook and W. Zhu",
TITLE = "Robot Navigation with Distance Queries",
JOURNAL = siam,
YEAR = 2000,
month = "",
volume = 30,
number = "1",
pages = "110--144",
copy = ""
}
@inproceedings{AngAspKon2012,
author = {D. Angluin and
J. Aspnes and
A. Kontorovich},
title = {On the Learnability of Shuffle Ideals},
booktitle = {Algorithmic Learning Theory ALT},
year = {2012},
pages = {111--123},
editor = {N. H. Bshouty and
G. Stoltz and
N. Vayatis and
T. Zeugmann},
publisher = {Springer},
series = {LNCS},
volume = {7568},
}
@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}}
@Article{AnsCherSan2007,
author = {M. Anselmo and A. Cherubini and P. San Pietro},
title = {Regular languages and associative language descriptions},
journal = {Discrete Mathematics and Theoretical Computer Sience},
year = {2007},
OPTkey = {},
volume = {9},
OPTnumber = {},
pages = {153--174},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = ""
}
@inproceedings{Antetal2011,
author = {T. Antonopoulos and
F. Geerts and
W. Martens and
F. Neven},
title = {Generating, sampling and counting subclasses of regular
tree languages},
booktitle = {Database Theory, 14th International Conference, ICDT},
year = {2011},
pages = {30--41},
editor = {T. Milo},
publisher = {ACM},
year = {2011},
}
@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{Argetal2010,
author = {E. Argyriou and
M. A. Bekos and
M. Kaufmann and
A. Symvonis},
title = {On Metro-Line Crossing Minimization},
journal = jgaa,
volume = {14},
number = {1},
year = {2010},
pages = {75--96},
}
@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{Ari70,
author = {S. Arikawa},
title = {Elementary Formal Systems and Formal Languages --- Simple Formal Systems},
journal = {Memoirs of the Faculty of Science, Kyushu University, Ser. A},
year = {1970},
OPTkey = {},
volume = {24},
number = {1},
pages = {47--75},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@TechReport{AriShiYam89,
author = {S. Arikawa and T. Shinohara and A. Yamamoto},
title = {Elementary Formal Systems as a Unifying Framework for Language Learning},
institution = {Research Institute of Fundamental Information Science},
year = {1989},
OPTkey = {},
OPTtype = {},
number = {RIFIS-TR-CS-14},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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},
booktitle = {11th Annual Symposium on Theoretical Aspects of
Computer Science, STACS},
year = {1994},
pages = {649--660},
editor = {P. Enjalbert and
E. W. Mayr and
K. W. Wagner},
publisher = {Springer},
series = {LNCS},
volume = {775},
}
@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 = ""
}
@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 = ""
}
@Article{ArnDicNiv92,
author = {A. Arnold and A. Dicky and M. Nivat},
title = {A note about minimal non-deterministic automata},
journal = eatcs,
year = {1992},
OPTkey = {},
volume = {47},
OPTnumber = {},
pages = {166--169},
}
@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 = ""
}
@INcollection{AroLun96,
AUTHOR = "S. Arora and C. Lund",
TITLE = "Hardness of Approximations",
BOOKTITLE = "Approximation Algorithms for {NP}-hard Problems",
year={1996},
publisher = {PWS},
editor={D.~S. Hochbaum},
}
@article {AroKar2006,
author = {Arora, S. and Karakostas, G.},
title = {A $2 + \epsilon$ approximation algorithm for the $k$-{MST} problem},
journal = {Mathematical Programming},
pages = {491--504},
volume = {107},
issue = {3},
year = {2006}
}
@ARTICLE{Aro98,
AUTHOR = "S. Arora",
TITLE = "Polynomial time approximation schemes for {E}uclidian traveling salesman and other geometric problems",
JOURNAL = jacm,
YEAR = 1998,
month = "",
volume = 45,
number = "",
pages = "753--782",
copy = ""
}
@ARTICLE{Aroetal98,
AUTHOR = "S. Arora and C. Lund and R. Motwani and M. Sudan and M. Szegedy",
TITLE = "Proof Verification and Hardness of Approximation Problems",
JOURNAL = jacm,
YEAR = 1998,
month = "",
volume = 45,
number = "",
pages = "501--555",
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 = ""
}
@techreport{AraBar2008,
author={Araujo Pardo, M. G. and Barri\`ere Figueroa, E. V.},
title={Defensive alliances in regular graphs and circulant graphs},
year={2008},
note={\url{http://hdl.handle.net/2117/2284}}
}
@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 = ""}
@article{ArvKobLin2009,
author = {V. Arvind and
J. K{\"o}bler and
W. Lindner},
title = {Parameterized learnability of juntas},
journal = tcs,
volume = {410},
number = {47-49},
year = {2009},
pages = {4928--4936},
}
@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" }
@article{AsaHasIwa2002,
title = "Complexity of finding dense subgraphs",
journal = dam,
volume = "121",
number = "1–3",
pages = "15--26",
year = "2002",
author = "Y. Asahiro and R. Hassin and K. Iwama",
}
@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{Asaetal2012,
author = {T. Asano and
E.~D. Demaine and
M.~L. Demaine and
R. Uehara},
title = {{NP}-completeness of generalized {K}aboozle},
journal = {Journal of Information Processing},
year = {2012},
volume = {20},
number = {3},
pages = {713--718},
}
@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 = ""
}
@inproceedings{AsgSte2005,
author = {E. Asgeirsson and
C. Stein},
title = {Vertex Cover Approximations: Experiments and Observations},
booktitle = {Experimental and Efficient Algorithms, WEA},
year = {2005},
pages = {545--557},
editor = {S.~E. Nikoletseas},
publisher = {Springer},
series = {LNCS},
volume = {3503},
}
@inproceedings{AsgSte2007,
author = {E. Asgeirsson and
C. Stein},
title = {Vertex Cover Approximations on Random Graphs},
booktitle = {Experimental Algorithms, WEA},
year = {2007},
pages = {285--296},
editor = {C. Demetrescu},
publisher = {Springer},
series = {LNCS},
volume = {4525},
}
@article{AsiSanMar85,
author = {P. Asirelli and
M. de Santis and
M. Martelli},
title = {Integrity Constraints for Logic Databases},
journal = {J. Log. Program.},
volume = {2},
number = {3},
year = {1985},
pages = {221--232}
}
@ARTICLE{AspHalMan01,
AUTHOR = "B. Aspvall and M. Halld\'orsson 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{AtaAta2013,
author = {A. Atanasiu and R.-F. Atanasiu},
title = {Enriching {P}arikh matrix mappings},
journal = ijcm,
year = {2013},
OPTkey = {},
volume = {90},
OPTnumber = {},
pages = {511--521},
}
@inproceedings{AthCKK2009,
author = {S. Athanassopoulos and
I. Caragiannis and
C. Kaklamanis and
M. Kyropoulou},
title = {An Improved Approximation Bound for Spanning Star Forest
and Color Saving},
booktitle = {Mathematical Foundations of Computer Science 2009, 34th
International Symposium, MFCS},
year = {2009},
pages = {90--101},
editor = {R. Kr{\'a}lovic and
D. Niwinski},
publisher = {Springer},
series = {LNCS},
volume = {5734},
}
@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{Aug2009,
author = {D. Auger},
title = {Identifying Codes in Trees and Planar Graphs},
journal = {Electronic Notes in Discrete Mathematics},
volume = {34},
year = {2009},
pages = {585--588},
}
@article{Aug2010,
author = {D. Auger},
title = {Minimal identifying codes in trees and planar graphs with
large girth},
journal = {Eur. J. Comb.},
volume = {31},
number = {5},
year = {2010},
pages = {1372--1384},
}
@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{AusAtrPro80,
author = {G. Ausiello and
A. D'Atri and
M. Protasi},
title = {Structure Preserving Reductions among Convex Optimization
Problems},
journal = jcss,
volume = {21},
number = {1},
year = {1980},
pages = {136--153},
}
@article{AusMarPro80,
author = {G. Ausiello and
A. Marchetti-Spaccamela and
M. Protasi},
title = {Toward a Unified Approach for the Classification of NP-Complete
Optimization Problems},
journal = tcs,
volume = {12},
year = {1980},
pages = {83--96},
}
@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{AusKhoSaf2011,
author = {P. Austrin and
S. Khot and
M. Safra},
title = {Inapproximability of Vertex Cover and Independent Set in
Bounded Degree Graphs},
journal = {Theory of Computing},
volume = {7},
number = {1},
year = {2011},
pages = {27--43},
}
@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{BabGus2011,
author = {M.~A. Babenko and
A. Gusakov},
title = {New Exact and Approximation Algorithms for the Star Packing
Problem in Undirected Graphs},
booktitle = {28th International Symposium on Theoretical Aspects of Computer
Science, STACS},
year = {2011},
pages = {519--530},
editor = {T. Schwentick and
C. D{\"u}rr},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f\"ur Informatik},
series = {LIPIcs},
volume = {9},
}
@incollection{BabReySon2011,
author = {Babi\'c, D. and Reynaud, D. and Song, D.},
title = {Malware Analysis with Tree Automata Inference},
booktitle = {Computer Aided Verification CAV},
series = {LNCS},
editor = {Gopalakrishnan, G. and Qadeer, S.},
publisher = {Springer},
pages = {116--131},
volume = {6806},
year = {2011}
}
@Article{BacYou2007,
author = {Ba\v{c}a, M. and Youssef, M.~Z.},
title = {Further results on antimagic graph labelings},
journal = {Australasian Journal of Combinatorics},
year = {2007},
OPTkey = {},
volume = {38},
OPTnumber = {},
pages = {163--172},
}
@article{Bacetal2010a,
author = {Ba\v{c}a, M. and P. Kov{\'a}\v{r} and Semani\v{c}ov\'a-Fe\v{n}ov\v{c}\'{\i}kov\'a, A. and Shafiq, M.~K.},
title = {On super $(a, 1)$-edge-antimagic total labelings of regular
graphs},
journal = dm,
volume = {310},
number = {9},
year = {2010},
pages = {1408--1412},
}
@Article{BacSemSha2011,
author = {Ba\v{c}a, M. and Semani\v{c}ov\'a-Fe\v{n}ov\v{c}\'{\i}kov\'a, A. and Shafiq, M.~K.},
title = {A method to generate large classes of edge-antimagic trees},
journal = {Utilitas Math.},
year = {2011},
OPTkey = {},
volume = {86},
OPTnumber = {},
pages = {33--43}, copy ={only TR as electronic copy}
}
@article{Bac2007,
author = {Bachmaier, C.},
title = {A Radial Adaptation of the {S}ugiyama Framework for Visualizing Hierarchical Information},
journal = {IEEE Transactions on Visualization and Computer Graphics},
volume = {13},
number = {3},
year = {2007},
pages = {583--594},
}
@Article{Bacetal2010,
author = {C. Bachmaier and H. Buchner and M. Forster and S.-H. Hong},
title = {Crossing minimization in extended level drawings of graphs},
journal = dam,
year = {2010},
OPTkey = {},
volume = {158},
OPTnumber = {},
pages = {159--179},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = ""
}
@INPROCEEDINGS{Bah2005,
author={Bahl, S.},
booktitle={Defect and Fault-Tolerance in {VLSI} Systems, 2007. DFT '07. 22nd IEEE International Symposium on},
title={A Sharable Built-in Self-repair for Semiconductor Memories with 2-{D} Redundancy Scheme},
year={2007},
month=sep,
pages={331--339},
}
@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},
}
@Article{BaiFer2012,
author = {G. Bai and
H. Fernau},
title = {Constraint Bipartite Vertex Cover: Simpler Exact Algorithms
and Implementations},
journal = joco,
year = {2012},
volume = {23},
pages = {331--355},
}
@TechReport{BaiAldSmi2002,
author = {M. Bailey and J. Alden and R. L. Smith},
title = {Approximate Dynamic Programming using Epsilon-Prunning (Working Paper)},
institution = {Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor},
year = {2002},
OPTkey = {},
OPTtype = {},
OPTnumber = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = ""
}
@inproceedings{BalRajRan93,
author = {H. Balakrishnan and
A. Rajaraman and
C. Pandu Rangan},
title = {Connected Domination and {S}teiner Set on Asteroidal Triple-Free
Graphs},
booktitle = {Algorithms and Data Structures, Third Workshop, WADS},
year = {1993},
pages = {131--141},
editor = {F.~K. H. A. Dehne and
J.-R. Sack and
N. Santoro and
S. Whitesides},
publisher = {Springer},
series = {LNCS},
volume = {709},
}
@Article{BalYu89,
author = {E. Balas and C.-S. Yu},
title = {On graphs with polynomially solvable maximum-weight clique problem},
journal = {Networks},
year = {1989},
volume = {19},
OPTnumber = {},
pages = {247--253},
}
@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{BalCasJai99,
AUTHOR = "G. Baliga and J. Case and S. Jain",
TITLE = "The synthesis of language learners",
JOURNAL = ic,
YEAR = 1999,
month = "",
volume = 152,
number = "",
pages = "16--43",
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" ,
}
@InCollection{Baletal97,
author = {J. L. Balc{\'a}zar and J. D{\'\i}az and R. Gavald{\`a}},
title = {Algorithms for learning finite automata from queries: a unified view},
booktitle = {Advances in Algorithms, Languages, and Complexity},
OPTcrossref = {},
OPTkey = {},
pages = {53--72},
publisher = {Kluwer},
year = {1997},
editor = {D.-Z. Du and Ker-I Ko},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
OPTchapter = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = ""
}
@INPROCEEDINGS{BanBarSla88,
crossref = "AppDisMat88",
AUTHOR = "D.~W. Bange and A.~E. Barkauskas and P.~J. Slater",
TITLE = "Efficient domination sets in graphs",
pages = "189--199",
copy = ""
}
@Article{Banetal96,
author = {D.~W. Bange and A.~E. Barkauskas and L.~H. Host and P.~J. Slater},
title = {Generalized domination and efficient domination
in graphs},
journal = dm,
year = {1996},
volume = {159},
pages = {1--11},
}
@ARTICLE{Ban90,
AUTHOR = "J. Bang-Jensen",
TITLE = "Locally semi-complete digraphs: a generalization of tournaments",
JOURNAL = jgth,
YEAR = 1990,
month = "",
volume = 14,
number = "",
pages = "371--390",
copy = ""
}
@inproceedings{Banetal2009,
author = {M. S. Bansal and
W.-C. Chang and
O. Eulenstein and
D. Fern{\'a}ndez-Baca},
title = {Generalized Binary Tanglegrams: Algorithms and Applications},
booktitle = {Bioinformatics and Computational Biology BICoB},
year = {2009},
pages = {114--125},
editor = {S. Rajasekaran},
publisher = {Springer},
series = {LNCS},
volume = {5462},
}
@article{BarPalMon2010,
author = {S.~C. Barman and
M. Pal and
S. Mondal},
title = {The $k$-neighbourhood-covering problem on interval
graphs},
journal = ijcm,
volume = {87},
number = {9},
year = {2010},
pages = {1918--1935},
}
@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 and 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{BarCha2011,
author = {A. Barecka and
W. Charatonik},
title = {The Parameterized Complexity of Chosen Problems for Finite
Automata on Trees},
booktitle = {Language and Automata Theory and Applications - 5th International
Conference, LATA},
year = {2011},
pages = {129--141},
editor = {A.~H. Dediu and
S. Inenaga and
C. Mart\'{\i}n-Vide},
publisher = {Springer},
series = {LNCS},
volume = {6638},
}
@Article{BarWie2005,
author = {H. Barendregt and F. Wiedijk},
title = {The challenge of computer mathematics},
journal = {Phil. Trans. R. Soc. Lond. A},
year = {2005},
volume = {363},
pages = {2351--2375},
}
@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{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 = ""
}
@MastersThesis{Bar2009,
author = {R. Barrera},
title = {On the Power Domination Problem in
Graphs},
school = {Texas State University, San Marcos, USA},
year = {2009},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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{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{BarRosHow90,
author = {S.~K. Baruah and L.~E. Rosier and R.~R. Howell},
title = {Algorithms and Complexity Concerning the
Preemptive Scheduling of Periodic, Real-Time
Tasks on One Processor},
journal = {Real-Time Systems},
year = {1990},
OPTkey = {},
volume = {2},
OPTnumber = {},
pages = {301--324},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{BarBak2008,
author = {S.~K. Baruah and
T. P. Baker},
title = {Schedulability analysis of global edf},
journal = {Real-Time Systems},
volume = {38},
number = {3},
year = {2008},
pages = {223--235},
}
@InProceedings{BarHowRos90,
author = {S.~K. Baruah and R.~R. Howell and L.~E. Rosier},
title = {On preemptive scheduling of periodic, real-time tasks on one processor},
booktitle = {MFCS'90},
OPTcrossref = {},
OPTkey = {},
pages = {173--179},
year = {1990},
OPTeditor = {},
volume = {452},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}
@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 = ""
}
@article{BarKeh2004,
author = "R. Bar-Yehuda and Z. Kehat",
title = {Approximating the dense set-cover problem},
journal = jcss,
volume = {69},
year = {2004},
pages = {547--561},
}
@article{BarLas2007,
author = {R. Bar-Yehuda and
J. Laserson},
title = {Exploiting locality: approximating sorting buffers},
journal = jda,
volume = {5},
year = {2007},
pages = {729--738},
}
@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",
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 = ""
}
@TECHREPORT{BauBucLie2009,
AUTHOR = {F. Baumann and C. Buchheim and F. Liers},
INSTITUTION = {Zentrum f\"ur Angewandte Informatik K\"oln, Lehrstuhl J\"unger},
TITLE = {Exact Crossing Minimization in General Tanglegrams},
PAGES = {12},
number ={zaik2009-581},
MONTH = {March},
YEAR = {2009}
}
@INPROCEEDINGS{BauBucLie2010,
AUTHOR = {F. Baumann and C. Buchheim and F. Liers},
TITLE = {Exact Bipartite Crossing Minimization under Tree Constraints},
BOOKTITLE = {9th International Symposium on Experimental Algorithms SEA 2010},
PAGES = {118--128},
VOLUME = {6049},
SERIES = {LNCS},
MONTH = {May},
YEAR = {2010},
PUBLISHER = {Springer}
}
@inproceedings{Bauetal2010,
author = {T. Baumgartner and
S. P. Fekete and
A. Kr{\"o}ller and
C. Schmidt},
title = {Exact Solutions and Bounds for General Art Gallery Problems},
booktitle = {Proceedings of the Twelfth Workshop on Algorithm Engineering
and Experiments, ALENEX},
year = {2010},
pages = {11--22},
editor = {G.~E. Blelloch and
D. Halperin},
publisher = {SIAM},
}
@INPROCEEDINGS{BauBra2004,
crossref = "WG2004",
AUTHOR = "M. Baur and U. Brandes",
TITLE = "Crossing minimization in circular layouts",
chapter = "",
pages = "332--343",
copy = ""
}
@inproceedings{BauBra2007,
author = "M. Baur and U. Brandes",
title = {Multi-circular Layout of Micro/Macro Graphs},
booktitle = {Graph Drawing GD},
year = {2007},
pages = {255--267},
editor = {S.-H. Hong and
T. Nishizeki and
W. Quan},
publisher = {Springer},
series = {LNCS},
volume = {4875},
year = {2008},
}
@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{BazCho2012,
author = {C. Bazgan and
M. Chopin},
title = {The Robust Set Problem: Parameterized Complexity and Approximation},
pages = {136--147},
ee = {http://dx.doi.org/10.1007/978-3-642-32589-2_15},
crossref = {DBLP:conf/mfcs/2012},
}
@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 = ""
}
@article{BecGei96,
author = {A. Becker and D. Geiger},
title = {Optimization of {P}earl's Method of Conditioning and Greedy-Like
Approximation Algorithms for the {V}ertex {F}eedback {S}et Problem},
journal = {Artif. Intell.},
volume = {83},
number = {1},
year = {1996},
pages = {167--188},
}
@article{BecGei2001,
author = {A. Becker and D. Geiger},
title = {A sufficiently fast algorithm for finding close to optimal
clique trees},
journal = {Artif. Intell.},
volume = {125},
number = {1-2},
year = {2001},
pages = {3--17},
}
@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{BecDedTir2006,
author = {L. Becerra-Bonache and
A. H. Dediu and
C. T\^{\i}rnauc\u{a}},
title = {Learning {DFA} from Correction and Equivalence Queries},
booktitle = {Grammatical Inference: Algorithms and Applications, 8th
International Colloquium, ICGI},
year = {2006},
pages = {281--292},
editor = {Y. Sakakibara and
S. Kobayashi and
K. Sato and
T. Nishino and
E. Tomita},
publisher = {Springer},
series = {LNCS},
volume = {4201},
}
@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{Becetal2008,
author = {L. Becerra-Bonache and
C. de la Higuera and
J.-C. Janodet and
F. Tantini},
title = {Learning balls of strings from edit corrections},
journal = {J. Mach. Learn. Res.},
year = {2008},
OPTkey = {},
volume = {9},
OPTnumber = {},
pages = {1841--1870},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{Becetal2010,
author = {L. Becerra-Bonache and
J. Case and
S. Jain and
F. Stephan},
title = {Iterative learning of simple external contextual languages},
journal = tcs,
volume = {411},
number = {29-30},
year = {2010},
pages = {2741--2756},
}
@InProceedings{Bec2003,
author = {D. B\'echet},
title = {$k$-valued link grammars are learnable from strings},
booktitle = {Formal Grammar FGVienna},
OPTcrossref = {},
OPTkey = {},
pages = {3--12},
year = {2003},
OPTpublisher = {CSLI},
}
@InProceedings{BecFor2005,
author = {D. B\'echet and A. Foret},
title = {On rigid {NL} {L}ambek grammars inference from generalized functor-argument data},
booktitle = {Formal Grammar FG-MoL},
OPTcrossref = {},
OPTkey = {},
pages = {71--80},
year = {2005},
editor = {J. Rogers},
publisher = {CSLI},
OPTnote = {},
OPTannote = {}
}
@inproceedings{BecFor2003a,
author = {D. B\'echet and A. Foret},
title = {$k$-Valued Non-Associative {L}ambek Categorial Grammars are
not Learnable from Strings},
booktitle = {ACL},
year = {2003},
pages = {351--358},
}
@inproceedings{BecFor2005a,
author = {D. B\'echet and A. Foret},
title = {$k$-Valued Non-associative {L}ambek Grammars
(Without Product) Form a Strict Hierarchy of
Languages},
pages = {1--17},
editor = {P. Blache and others},
booktitle = {LACL 2005},
publisher = {Springer},
series = {LNCS/LNAI},
volume = {3492},
year = {2005},
}
@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{Beeetal2011,
author = {M.~H.~ter Beek and
E. Csuhaj-Varj{\'u} and
M. Holzer and
Gy. Vaszil},
title = {Cooperating Distributed Grammar Systems: Components with
Nonincreasing Competence},
year = {2011},
pages = {70--89},
editor = {J. Kelemen and
A. Kelemenov{\'a}},
title = {Computation, Cooperation, and Life --- Essays Dedicated to
Gheorghe Paun on the Occasion of His 60th Birthday},
booktitle = {Computation, Cooperation, and Life},
publisher = {Springer},
series = {LNCS},
volume = {6610}
}
@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{\"u}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 = ""
}
@inproceedings{BelHirPot2012,
author = {P.~C. Bell and
M. Hirvensalo and
I. Potapov},
title = {Mortality for $2\times 2$ Matrices Is {NP}-Hard},
pages = {148--159},
ee = {http://dx.doi.org/10.1007/978-3-642-32589-2_16},
crossref = {DBLP:conf/mfcs/2012},
}
@inproceedings{Beletal93,
author = {Bellare, M. and Goldwasser, S. and Lund, C. and Russell, A.},
title = {Efficient probabilistically checkable proofs and applications to approximations},
booktitle = {STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing},
year = {1993},
pages = {294--304},
publisher = {ACM},
}
@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 = "A.~M. Ben-Amram and H. Petersen",
year = "1998",
title = "Cons-free Programs with Tree Input",
booktitle = "Proceedings, 25th Int. Colloquium on Automata,
Languages and Programming (ICALP)",
editor = "K. G. Larsen and S. Skyum and G. 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 = ""
}
@Article{BenFis2008,
author = {S. Ben-David and D. Fisman and S. Ruah},
title = {Embedding finite automata within regular expressions},
journal = tcs,
year = {2008},
OPTkey = {},
volume = {404},
OPTnumber = {},
pages = {202--218},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{Benetal2011,
title = "Treewidth governs the complexity of target set selection",
journal = "Discrete Optimization",
volume = "8",
number = "1",
pages = "87--96",
year = "2011",
author = "O. Ben-Zwi and D. Hermelin and D. Lokshtanov and I. Newman",
}
@article{BenWil85,
author = {E.~A. Bender and
H.~S. Wilf},
title = {A Theoretical Analysis of Backtracking in the Graph Coloring
Problem},
journal = jalg,
volume = {6},
number = {2},
year = {1985},
pages = {275--282},
}
@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 = ""
}
@inproceedings{BenBjoDre2010,
author = {S. Bensch and
H. Bj{\"o}rklund and
F. Drewes},
title = {Algorithmic Properties of Millstream Systems},
booktitle = {Developments in Language Theory DLT},
year = {2010},
pages = {54--65},
editor = {Y. Gao and
H. Lu and
S. Seki and
S. Yu},
publisher = {Springer},
series = {LNCS},
volume = {6224},
}
@InProceedings{BenDre2010,
author = {S. Bensch and F. Drewes},
title = {Millstream Systems --- a formal model for linking language modules by interfaces},
booktitle = {Workshop on Applications of Tree Automata in Natural Language Systems},
pages = {28--36},
year = {2010},
organization = {Association for Computational Linguistics ACL},
}
@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 = ""
}
@TechReport{Beretal2005rr-05042,
author = {S. B\'erard and A. Bergeron and C. Chauve and C. Paul},
title = {Sorting by reversals is not always difficult},
institution = {Laboratoire d'Informatique de Robotique et de Micro\'electronique de Montpellier, France},
year = {2005},
OPTkey = {},
OPTtype = {},
number = {LIRMM RR-05042},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@Article{BerLig2009,
author = {S. Berardi and U. de'Liguoro},
title = {Toward the
interpretation of non-constructive reasoning as non-monotonic
learning},
journal = ic,
year = {2009},
OPTkey = {},
volume = {207},
OPTnumber = {},
pages = {63--81},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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{BerDuc88,
crossref = "AppDisMat88",
AUTHOR = "C. Berge and P. Duchet",
TITLE = "Recent problems and results about kernels in directed graphs",
pages = "200--204",
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{BerMul2012,
author = {A. Berger and
M. M{\"u}ller-Hannemann},
title = {How to Attack the {NP}-Complete Dag Realization Problem in
Practice},
booktitle = {Experimental Algorithms --- 11th International Symposium,
SEA},
year = {2012},
pages = {51--62},
editor = {R. Klasing},
publisher = {Springer},
series = {LNCS},
volume = {7276},
}
@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},
}
@InCollection{Ber2011b,
author = {A. Berlea},
title = {Tree-Language Based Querying of Hierarchically Structured and Semi-Structured Data},
booktitle = {Scientific Applications of Language Methods},
OPTcrossref = {},
OPTkey = {},
pages = {205--311},
publisher = {Imperial College Press},
year = {2011},
editor = {C. Mart\'in-Vide},
volume = {2},
OPTnumber = {},
series = {Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory},
}
@inproceedings{Ber2010,
author = {M. V. Berlinkov},
title = {Approximating the Minimum Length of Synchronizing Words
Is Hard},
booktitle = {Computer Science - Theory and Applications, 5th International
Computer Science Symposium in Russia, CSR},
year = {2010},
pages = {37--47},
editor = {F. M. Ablayev and
E. W. Mayr},
publisher = {Springer},
series = {LNCS},
volume = {6072},
}
@ARTICLE{Ber2011,
AUTHOR = "M. V. Berlinkov",
TITLE = "{\cyr O pogreshnosti polinonominal'nogo vytchisleniya optimal'noj
raskaski grafa v sinchronoziruemyj aftomat}",
JOURNAL = {{\cyr Prikladnaya Diskretnaya Matematika}},
YEAR = 2011,
month = "",
volume = "",
number = "",
pages = "49--72",
copy = ""
}
@ARTICLE{Ber2011a,
AUTHOR = "M. V. Berlinkov",
TITLE = "On a conjecture by {C}apri and d'{A}llesandro",
JOURNAL = ijfcs,
YEAR = 2011,
month = "",
volume = "22",
number = "",
pages = "1565--1576",
copy = ""
}
@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 the Approximation Properties of Independent Set Problem
in Degree 3 Graphs},
booktitle = {Algorithms and Data Structures, 4th International Workshop, WADS},
year = {1995},
pages = {449--460},
editor = {S. G. Akl and
F. K. H. A. Dehne and
J.-R. Sack and
N. Santoro},
publisher = {Springer},
series = {LNCS},
volume = {955},
}
@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, P. and Simon, J.",
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{BerKarLin2012,
author = {P. Berman and M. Karpinski and A. Lingas},
title = {Exact and Approximation Algorithms for Geometric
and Capacitated Set Cover Problems},
journal = alg,
year = {2012},
OPTkey = {},
volume = {64},
OPTnumber = {},
pages = {295--310},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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{Beretal2003,
author = {J.-C. Bermond and
J. Bond and
D. Peleg and
S. Perennes},
title = {The Power of Small Coalitions in Graphs},
journal = dam,
volume = {127},
number = {3},
year = {2003},
pages = {399--414},
}
@InProceedings{BerFer2011a,
author = {Bermudo, S. and H. Fernau},
title = {Computing the differential of a graph (Abstract)},
booktitle = {Cologne-Twente Workshop on Graphs and Combinatorial Optimization},
OPTcrossref = {},
OPTkey = {},
pages = {68--71},
year = {2011},
editor = {L. Adacher and M. Flamini and G. Leo and G. Nicosia and A. Pacifici and V. Piccialli},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@article{BerRodSig2011,
author = {S. Bermudo and
J.~M. Rodr\'{\i}guez and
J. M. Sigarreta},
title = {Computing the hyperbolicity constant},
journal = {Computers {\&} Mathematics with Applications},
volume = {62},
number = {12},
year = {2011},
pages = {4592--4595},
}
@ARTICLE{BerFer2012,
AUTHOR = "S. Bermudo and H. Fernau",
TITLE = "Lower bounds on the differential of a graph",
JOURNAL = dm,
YEAR = {2012},
VOLUME = "312",
NUMBER = "",
PAGES = "3236--3250",
copy = ""
}
@Article{BerPla89,
author = {M. Bern and P. Plassmann},
title = {The {S}teiner problem with edge lengths 1 and 2},
journal = ipl,
year = {1989},
volume = {32},
pages = {171--176},
}
@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 = ""
}
@inproceedings{BerKir2011,
author = {A. Bern{\'a}th and Z. Kir{\'a}ly},
title = {On the tractability of some natural packing, covering and partitioning problems},
booktitle = {Proceedings of the 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, May 31 - June 3, 2011, RIMS, Kyoto University, Kyoto, Japan},
year = {2011},
pages = {19--28},
note = {Full version available as the EGRES Technical Report TR-2011-05 from {\tt www.cs.elte.hu/egres}},
grants = {EGRES, OTKA grant CK 80124}
}
@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 = ""
}
@inproceedings{BerMenMos2005,
author = {Berretta, R. and Mendes, A. and Moscato, P.},
title = {Integer programming models and algorithms for molecular classification of cancer from microarray data},
booktitle = {Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38},
series = {ACSC},
year = {2005},
location = {Newcastle, Australia},
pages = {361--370},
publisher = {Australian Computer Society, Inc.},
}
@Article{BerMenMos2007,
author = {Berretta, R. and Mendes, A. and Moscato, P.},
title = {Selection of Discriminative Genes in Microarray
Experiments Using Mathematical Programming},
journal = {Journal of Research and Practice in Information Technology},
year = {2007},
volume = {39},
pages = {287--299},
}
@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",
}
@Article{BerPogSim2010,
author = {A. Berry and Pogorelcnik, R. and Simonet, G.},
TITLE = {An Introduction to Clique Minimal Separator Decomposition},
JOURNAL = {Algorithms},
VOLUME = {3},
YEAR = {2010},
NUMBER = {2},
PAGES = {197--215},
}
@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{BerBoa2002a,
author = {J. Berstel and L. Boasson},
title = {Balanced Grammars and Their Languages},
pages = {3--25},
booktitle = {Formal and Natural Computing},
year = {2002},
editor = {W. Brauer and
H. Ehrig and
J. Karhum{\"a}ki and
A. Salomaa},
publisher = {Springer},
series = {LNCS},
volume = {2300},
}
@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 = {}
}
@TechReport{BerNis2008,
author = {P. Berthom\'e and N. Nisse},
title = {A unified {FPT} Algorithm for Width of Partition
Functions},
institution = {INRIA, France},
year = {2008},
OPTkey = {},
OPTtype = {},
number = {6646},
OPTaddress = {},
month = sep,
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{BerGor88,
author = {A.~A. Bertossi and A. Gori},
title = {Total domination and irredundance in weighted interval graphs},
journal = siamdm,
year = {1988},
volume = {1},
pages = {317--327},
}
@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{BesMar2007,
author = {J. Besombes and
J.-Y. Marion},
title = {Learning tree languages from positive examples and
membership queries},
journal = tcs,
year = {2007},
OPTkey = {},
volume = {382},
OPTnumber = {},
pages = {183--197},
}
@article{BesMar2008,
author = {J. Besombes and
J.-Y. Marion},
title = {Learning discrete categorial grammars from structures},
journal = rairoita,
volume = {42},
number = {1},
year = {2008},
pages = {165--182},
}
@article{BesPauPer2010,
title = "Polynomial kernels for 3-leaf power graph modification problems",
journal = dam,
volume = "158",
number = "16",
pages = "1732--1744",
year = "2010",
author = "S. Bessy and C. Paul and A. Perez",
}
@inproceedings{BesPer2011,
author = {S. Bessy and
A. Perez},
title = {Polynomial Kernels for Proper Interval Completion and Related
Problems},
booktitle = {Fundamentals of Computation Theory --- 18th International
Symposium, FCT},
year = {2011},
pages = {229--239},
editor = {O. Owe and
M. Steffen and
J.~A. Telle},
publisher = {Springer},
series = {LNCS},
volume = {6914},
}
@article{Besetal2011,
author = {S. Bessy and
F. V. Fomin and
S. Gaspers and
C. Paul and
A. Perez and
S. Saurabh and
S. Thomass{\'e}},
title = {Kernels for feedback arc set in tournaments},
journal = jcss,
volume = {77},
number = {6},
year = {2011},
pages = {1071--1078},
}
@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 = {43--53},
year = {2008},
editor = {B. Yang and
D.-Z. Du and
C. A. Wang},
volume = {4165},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}
@Article{BetUhl2009,
author = {N. Betzler and
J. Uhlmann},
title = {Parameterized Complexity
of Candidate Control in Elections and Related Digraph Problems},
journal = tcs,
year = {2009},
OPTkey = {},
volume = {410},
OPTnumber = {},
pages = {5425--5442},
OPTmonth = {},
OPTnote = {},
}
@article{Betetal2012,
author = {N. Betzler and
R. Bredereck and
R. Niedermeier and
J. Uhlmann},
title = {On Bounded-Degree Vertex Deletion parameterized by treewidth},
journal = dam,
volume = {160},
number = {1-2},
year = {2012},
pages = {53--60},
}
@article{BevMosNie2012,
author = {R. van Bevern and
H. Moser and
R. Niedermeier},
title = {Approximation and Tidying -- A Problem Kernel for $s$-Plex
Cluster Vertex Deletion},
journal = alg,
volume = {62},
number = {3-4},
year = {2012},
pages = {930--950},
}
@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 = ""
}
@inproceedings{BexNevVan2007,
author = {G.~J. Bex and
F. Neven and
S. Vansummeren},
title = {Inferring {XML} Schema Definitions from {XML} Data},
booktitle = {Proceedings of the 33rd International Conference on Very
Large Data Bases, VLDB},
year = {2007},
pages = {998--1009},
editor = {C. Koch and
J. Gehrke and
M. N. Garofalakis and
D. Srivastava and
K. Aberer and
A. Deshpande and
D. Florescu and
C. Yong Chan and
V. Ganti and
C.-C. Kanne and
W. Klas and
E. J. Neuhold},
publisher = {ACM},
}
@inproceedings{BexNevVan2008,
author = {G.~J. Bex and
F. Neven and
S. Vansummeren},
title = {Schema{S}cope: a system for inferring and cleaning {XML} schemas},
booktitle = {Proceedings of the ACM SIGMOD International Conference on
Management of Data, SIGMOD},
year = {2008},
pages = {1259--1262},
editor = {J. Tsong-Li Wang},
publisher = {ACM},
}
@article{Bexetal2010,
author = {G.~J. Bex and
F. Neven and
T. Schwentick and
S. Vansummeren},
title = {Inference of concise regular expressions and {DTD}s},
journal = {ACM Transactions on Database Systems},
volume = {35},
number = {2},
year = {2010},
}
@article{Bexetal2010a,
author = {G.~J. Bex and
W. Gelade and
F. Neven and
S. Vansummeren},
title = {Learning Deterministic Regular Expressions for the Inference
of Schemas from {XML} Data},
journal = {ACM Transactions on the Web},
volume = {4},
number = {4},
year = {2010},
}
@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{BhaFu74,
AUTHOR = "B. K. Bhargava and K. S. Fu",
TITLE = "Transformation and inference of tree grammars for syntactic pattern recognition ",
BOOKTITLE = "Proc. IEEE Int. Conf. on Systems, Man and Cybernetics",
YEAR = 1974,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "2--4",
address = "Dallas, TX",
organization = "",
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 = ""
}
@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{Bha99,
author={Bhavsar, D.~K.},
booktitle={Test Conference, 1999. Proceedings. International},
title={An algorithm for row-column self-repair of {RAM}s and its implementation in the {A}lpha 21264},
year={1999},
pages={311--318},
}
@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{Bhietal2007,
author = {C. Bhika and
S. Ewert and
R. Schwartz and
M. Waruhiu},
title = {Table-Driven Context-Free Picture Grammars},
journal = ijfcs,
volume = {18},
number = {6},
year = {2007},
pages = {1151--1160},
}
@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 = ""
}
@inproceedings{BicMat97,
author = {P. Bichebois and
P. Mathery},
title = {Analysis of Defect to Yield Correlation on Memories: Method,
Algorithms and Limits},
booktitle = {Workshop on Defect and Fault-Tolerance in VLSI Systems, DFT},
year = {1997},
pages = {44--52},
publisher = {IEEE Computer Society},
}
@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}
}
@inproceedings{BieBra2006,
author = {T.~C. Biedl and
F.-J. Brandenburg},
title = {Partitions of Graphs into Trees},
booktitle = {Graph Drawing GD 2006},
pages = {430--439},
editor = {M. Kaufmann and
D. Wagner},
publisher = {Springer},
series = {LNCS},
volume = {4372},
year = {2007},
}
@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{BieSey91,
author = {D. Bienstock and P. D. Seymour},
title = {Monotonicity in graph searching},
journal = jalg,
year = {1991},
OPTkey = {},
volume = {12},
OPTnumber = {},
pages = {239--245},
OPTmonth = {},
}
@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",
}
@PhdThesis{Bin2010,
author = {D. Binkele-Raible},
title = {Amortized Analysis of Exponential Time- und Parameterized Algorithms: Measure \& Conquer and Reference Search Trees},
school = {Fachbereich IV, Universit\"at Trier, Germany},
year = {2010},
}
@inproceedings{Binetal2010,
author = {D. Binkele-Raible and
L. Brankovic and
H. Fernau and
J. Kneis and
D. Kratsch and
A. Langer and
M. Liedloff and
P. Rossmanith},
title = {A Parameterized Route to Exact Puzzles: Breaking the $2^n$-Barrier
for {\sc Irredundance}},
pages = {311--322},
editor = {T. Calamoneri and
J. D\'{\i}az},
booktitle = {Algorithms and Complexity CIAC},
publisher = {Springer},
series = {LNCS},
volume = {6078},
year = {2010},
}
@article{Binetal2010a,
author = {D. Binkele-Raible and
H. Fernau and
S. Gaspers and
M. Liedloff},
title = {Exact exponential-time algorithms for finding bicliques},
journal = ipl,
volume = {111},
number = {2},
year = {2010},
pages = {64--67},
}
@InProceedings{BinFer10,
author = {D. Binkele-Raible and H. Fernau},
title = {A Faster Exact Algorithm for the Directed
Maximum Leaf Spanning Tree Problem},
booktitle = {Computer Science in Russia CSR},
OPTcrossref = {},
OPTkey = {},
pages = {328--339},
year = {2010},
editor = {F. Ablayev and E.~W. Mayr},
volume = {6072},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}
@Article{BinFer10a,
author = {D. Binkele-Raible and H. Fernau},
title = {A new upper bound for {Max-2-SAT}: A graph-theoretic approach},
journal = jda,
year = {2010},
OPTkey = {},
volume = {8},
OPTnumber = {},
pages = {388--401},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@InProceedings{BinFer10b,
author = {D. Binkele-Raible and H. Fernau},
title = {Enumerate and measure, improving parameter budget management},
booktitle = {Parameterized and Exact Computation IPEC},
pages = {38--49},
year = {2010},
editor = {V. Raman and S. Saurabh},
volume = {6478},
series = {LNCS},
publisher = {Springer},
}
@article{Binetal2011,
author = {D. Binkele-Raible and
L. Brankovic and M. Cygan and
H. Fernau and
J. Kneis and
D. Kratsch and
A. Langer and
M. Liedloff and M. Pilipczuk and
P. Rossmanith and J.~O. Wojtaszczyk},
title = {Breaking the $2^n$-Barrier
for \textsc{Irredundance}: Two Lines of Attack},
pages = {214--230},
journal = jda,
year = {2011},
volume = 9
}
@Article{BinFer12,
author = {D. Binkele-Raible and H. Fernau},
title = {An Exact Exponential Time Algorithm for \textsc{Power Dominating Set}},
journal = alg,
year = {2012},
volume = {63},
OPTnumber = {},
pages = {323--346},
}
@Article{BinFer12a,
author = {D. Binkele-Raible and H. Fernau},
title = {Parameterized Measure \& Conquer for Problems with No Small Kernels},
journal = alg,
year = {2012},
volume = {64},
OPTnumber = {},
pages = {189--212},
}
@Article{BinFer12b,
author = {D. Binkele-Raible and H. Fernau},
title = {An exact exponential-time algorithm for the Directed Maximum Leaf
Spanning Tree problem},
journal = jda,
year = {2012},
volume = {15},
OPTnumber = {},
pages = {43--55},
}
@article{Binetal2012,
author = {D. Binkele-Raible and
H. Fernau and
F. V. Fomin and
D. Lokshtanov and
S. Saurabh and
Y. Villanger},
title = {Kernel(s) for problems with no kernel: On out-trees with
many leaves},
journal = {ACM Transactions on Algorithms},
volume = {8},
number = {4},
year = {2012},
pages = {38},
ee = {http://doi.acm.org/10.1145/2344422.2344428},
}
@Article{Binetal13,
author = {D. Binkele-Raible and H. Fernau and
S. Gaspers and
M. Liedloff},
title = {Exact and Parameterized Algorithms for \textsc{Max Internal Spanning Tree}},
journal = alg,
year = {2013},
volume = {65},
OPTnumber = {},
pages = {95--128},
}
@Article{BinFer13,
author = {D. Binkele-Raible and H. Fernau},
title = {Packing paths: Recycling saves time},
journal = dam,
year = {2013},
volume = {161},
number = {12},
pages = {1686--1698},
}
@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 = ""
}
@Article{BisHar2009,
author = {K. Biswas and S.~A.~M. Harun},
title = {Constraint minimum vertex cover in $k$-partite graph: approximation algorithm and complexity analysis},
journal = {International Journal of Computer Science and Information Security},
year = {2009},
OPTkey = {},
volume = {4},
number = {1\&2},
OPTpages = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{BitRei75,
author = {Bitner, J.~R. and Reingold, E.~M.},
title = {Backtrack programming techniques},
journal = cacm,
volume = {18},
number = {11},
year = {1975},
pages = {651--656},
publisher = {ACM},
}
@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",
editor = {M. Bugliesi and
B. Preneel and
V. Sassone and
I. Wegener},
YEAR = 2006,
month = "",
volume = "4051",
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{Bjoetal2008a,
author = {A. Bj{\"o}rklund and
T. Husfeldt and
P. Kaski and
M. Koivisto},
title = {The {T}ravelling {S}alesman {P}roblem in Bounded Degree Graphs},
booktitle = {Automata, Languages and Programming, Part I: Tack A: Algorithms, Automata, Complexity,
and Games, ICALP (1)},
year = {2008},
pages = {198--209},
editor = {L. Aceto and
I. Damg{\aa}rd and
L. A. Goldberg and
M. M. Halld{\'o}rsson and
A. Ing{\'o}lfsd{\'o}ttir and
I. Walukiewicz},
publisher = {Springer},
series = {LNCS},
volume = {5125},
}
@inproceedings{Bjo2010,
author = {A. Bj{\"o}rklund},
title = {Determinant Sums for Undirected {H}amiltonicity},
booktitle = {51th Annual IEEE Symposium on Foundations of Computer Science, FOCS},
year = {2010},
pages = {173--182},
publisher = {IEEE Computer Society},
}
@article{BjoSch2010,
author = {H. Bj{\"o}rklund and
T. Schwentick},
title = {On notions of regularity for data languages},
journal = tcs,
volume = {411},
number = {4-5},
year = {2010},
pages = {702--715},
}
@article{BjoMar2012,
author = {H. Bj{\"o}rklund and
W. Martens},
title = {The tractability frontier for {NFA} minimization},
journal = jcss,
volume = {78},
number = {1},
year = {2012},
pages = {198--210},
}
@TechReport{BjoFerKas12,
author = {J. Bj\"orklund and H. Fernau and A. Kasprzik},
title = {Polynomial inference of universal automata from membership and equivalence queries},
institution = {Universit\"at Trier, Forschungsberichte Mathematik und Informatik},
year = {2012},
number = {Technical report 12-3},
}
@InProceedings{BjoFerKas2013,
author = {J. Bj\"orklund and H. Fernau and A. Kasprzik},
title = {{MAT} Learning of Universal Automata},
booktitle = {Language and Automata Theory and Applications, LATA},
pages = {141--152},
year = {2013},
editor = {A.-H. Dediu and C. Mart{\'i}n-Vide and B. Truthe},
volume = {7810},
OPTnumber = {},
series = {LNCS},
publisher = {Springer},
}
@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{Bla2003,
author = {M. Bl{\"a}ser},
title = {Computing small partial coverings},
journal = ipl,
year = {2003},
OPTkey = {},
volume = {85},
OPTnumber = {},
pages = {327--331},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{BlaHof2011,
author = {M. Bl{\"a}ser and
C. Hoffmann},
title = {Fast Evaluation of Interlace Polynomials on Graphs of Bounded
Treewidth},
journal = alg,
volume = {61},
number = {1},
year = {2011},
pages = {3--35},
}
@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 = ""
}
@article{Blietal2008,
author = {L. Blin and
P. Fraigniaud and
N. Nisse and
S. Vial},
title = {Distributed chasing of network intruders},
journal = tcs,
volume = {399},
number = {1-2},
year = {2008},
pages = {12--37},
}
@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{BloMcK2012,
author = {M. Blondin and
P. McKenzie},
title = {The Complexity of Intersecting Finite Automata Having Few
Final States},
booktitle = {Computer Science -- Theory and Applications -- 7th International
Computer Science Symposium in Russia, CSR},
year = {2012},
pages = {31--42},
editor = {E. A. Hirsch and
J. Karhum{\"a}ki and
A. Lepist{\"o} and
M. Prilutskii},
publisher = {Springer},
series = {LNCS},
volume = {7353},
}
@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 = ""
}
@INCOLLECTION{Bluetal2005,
AUTHOR = "J.~Blum and M.~Ding and A.~Thaeler and X.~Cheng",
TITLE = "Connected dominating set in sensor networks and {MANET}s",
PAGES = "329--369",
BOOKTITLE = {Handbook of Combinatorial Optimization},
PUBLISHER = "Springer",
YEAR = "2005",
VOLUME = "B"
}
@article{Bluetal89,
author = {Blumer, A. and Ehrenfeucht, A. and Haussler, D. and Warmuth, M. K.},
title = {Learnability and the {V}apnik-{C}hervonenkis dimension},
journal = jacm,
volume = {36},
number = {4},
year = {1989},
pages = {929--965},
publisher = {ACM},
}
@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 = ""
}
@Article{BoaNiv73,
author = {L. Boasson and M. Nivat},
title = {Sur diverses familles de langages ferm\'ees par tranduction rationelle},
journal = actainform,
year = {1973},
OPTkey = {},
volume = {2},
OPTnumber = {},
pages = {180--188},
}
@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 = ""
}
@inproceedings{BocBuiTru2008,
author = {S. B{\"o}cker and
Q. B. A. Bui and
A. Tru{\ss}},
title = {An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus
Trees},
booktitle = {Parameterized and Exact Computation, Third International
Workshop, IWPEC},
year = {2008},
pages = {43--54},
editor = {M. Grohe and
R. Niedermeier},
publisher = {Springer},
series = {LNCS},
volume = {5018},
}
@inproceedings{Bocetal2009,
author = {S. B{\"o}cker and
F. H{\"u}ffner and
A. Tru{\ss} and
M. Wahlstr{\"o}m},
title = {A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, IWPEC},
year = {2009},
pages = {38--49},
editor = {J. Chen and
F. V. Fomin},
publisher = {Springer},
series = {LNCS},
volume = {5917},
}
@article{Bocetal2009a,
author = {S. B{\"o}cker and
S, Briesemeister and
Q, Bao Anh Bui and
A, Tru{\ss}},
title = {Going weighted: Parameterized algorithms for cluster editing},
journal = tcs,
volume = {410},
number = {52},
year = {2009},
pages = {5467--5480},
}
@article {BocBriKla2011,
author = {S. B{\"o}cker and Briesemeister, S. and Klau, G.},
title = {Exact Algorithms for Cluster Editing: Evaluation and Experiments},
journal = alg,
pages = {316--334},
volume = {60},
issue = {2},
year = {2011}
}
@incollection {Boc2011,
author = {S. B{\"o}cker},
title = {A Golden Ratio Parameterized Algorithm for Cluster Editing},
booktitle = {Combinatorial Algorithms, IWOCA},
series = {LNCS},
editor = {Iliopoulos, C. and Smyth, W.},
publisher = {Springer},
pages = {85--95},
volume = {7056},
year = {2011}
}
@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},
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},
}
@inproceedings{Bodetal2008,
author = {H. L. Bodlaender and
R. G. Downey and
M. R. Fellows and
D. Hermelin},
title = {On Problems without Polynomial Kernels (Extended Abstract)},
booktitle = {Automata, Languages and Programming, Part I: Tack A: Algorithms, Automata, Complexity,
and Games, ICALP (1)},
year = {2008},
pages = {563--574},
editor = {L. Aceto and
I. Damg{\aa}rd and
L. A. Goldberg and
M. M. Halld{\'o}rsson and
A. Ing{\'o}lfsd{\'o}ttir and
I. Walukiewicz},
publisher = {Springer},
series = {LNCS},
volume = {5125},
}
@TechReport{BodThoYeo2008,
author = {H.~L. Bodlaender and
S. Thomass{\'e} and
A. Yeo},
title = {Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels},
institution = {Univ. Utrecht, The Netherlands},
year = {2008},
OPTkey = {},
OPTtype = {},
number = {UU-CS-2008-030},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@TechReport{Bodetal2008a,
author = {H.~L. Bodlaender and E.~D. Demaine and M.~R. Fellows and J.~Guo and D.~Hermelin and
D.~Lokshtanov and M.~Müller and V.~Raman and J.~van Rooij and F.~A. Rosamond},
title = {Open problems in parameterized and exact computation -- IWPEC 2008},
institution = {Department of Informatics and Computing
Sciences, Utrecht University},
year = {2008},
number = {UU-CS-2008-017},
}
@inproceedings{Bod2009,
author = {H.~L. Bodlaender},
title = {Kernelization: New Upper and Lower Bound Techniques},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, IWPEC},
year = {2009},
pages = {17--37},
editor = {J. Chen and
F. V. Fomin},
publisher = {Springer},
series = {LNCS},
volume = {5917},
}
@inproceedings{BodLokPen2009,
author = {H.~L. Bodlaender and
D. Lokshtanov and
E. Penninkx},
title = {Planar Capacitated Dominating Set Is {\it W}[1]-Hard},
pages = {50--60},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, IWPEC},
year = {2009},
editor = {J. Chen and
F. V. Fomin},
publisher = {Springer},
series = {LNCS},
volume = {5917},
}
@Article{Bodetal2009,
author = {H. L. Bodlaender and
R. G. Downey and
M. R. Fellows and
D. Hermelin},
title = {On Problems without Polynomial Kernels},
journal = jcss,
year = {2009},
OPTkey = {},
volume = 75,
OPTnumber = {},
pages = {423--434},
OPTmonth = {},
OPTnote = {},
}
@TechReport{Bodetal2009a,
author = {H.~L. Bodlaender and F.~V. Fomin and A. M. C. A. Koster and D. Kratsch and D. M. Thilikos},
title = {A Note on Exact Algorithms for Vertex Ordering Problems on Graphs},
institution = {Univ. Utrecht, The Netherlands},
year = {2009},
OPTkey = {},
OPTtype = {},
number = {UU-CS-2009-023},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@inproceedings{Bodetal2009b,
author = {H.~L. Bodlaender and
F. V. Fomin and
D. Lokshtanov and
E. Penninkx and
S. Saurabh and
D. M. Thilikos},
title = {({M}eta) Kernelization},
pages = {629--638},
booktitle = {50th Annual IEEE Symposium on Foundations of Computer Science,
FOCS 2009},
publisher = {IEEE Computer Society},
year = {2009},
}
@inproceedings{BodThoYeo2009,
author = {H.~L. Bodlaender and S. Thomass{\'e} and A. Yeo},
title = {Kernel Bounds for Disjoint Cycles and Disjoint Paths},
pages = {635--646},
booktitle = {Algorithms --- ESA 2009, 17th Annual European Symposium},
year = {2009},
editor = {A. Fiat and P. Sanders},
publisher = {Springer},
series = {LNCS},
volume = {5757},
}
@inproceedings{Bodetal2010,
author = {H.~L. Bodlaender and
E.~J. van Leeuwen and
J. M. M. van Rooij and
M. Vatshelle},
title = {Faster Algorithms on Branch and Clique Decompositions},
booktitle = {Mathematical Foundations of Computer Science 2010, MFCS},
year = {2010},
pages = {174--185},
editor = {P. Hlinen{\'y} and
A. Kucera},
publisher = {Springer},
series = {LNCS},
volume = {6281},
}
@article{Bodetal2010a,
author = {H.~L. Bodlaender and
M. R. Fellows and
P. Heggernes and
F. Mancini and
C. Papadopoulos and
F. A. Rosamond},
title = {Clustering with partial information},
journal = tcs,
volume = {411},
number = {7-9},
year = {2010},
pages = {1202--1211},
}
@TechReport{BodJanKra2010,
author = {H.~L. Bodlaender and B. M. P. Jansen and S. Kratsch},
title = {Cross composition: a new technique for kernelization lower bounds},
institution = {arXiv:1011.4224v1},
year = {2010},
}
@inproceedings{BodJanKra2011,
author = {H.~L. Bodlaender and
B. M. P. Jansen and
S. Kratsch},
title = {Preprocessing for Treewidth: A Combinatorial Analysis through
Kernelization},
booktitle = {Automata, Languages and Programming --- 38th International
Colloquium, ICALP
Proceedings, Part I},
year = {2011},
pages = {437--448},
editor = {L. Aceto and
M. Henzinger and
J. Sgall},
publisher = {Springer},
series = {LNCS},
volume = {6755},
}
@article{Bodetal2011,
author = {H. L. Bodlaender and
M. R. Fellows and
M. A. Langston and
M. A. Ragan and
F. A. Rosamond and
M. Weyer},
title = {Quadratic Kernelization for Convex Recoloring of Trees},
journal = alg,
volume = {61},
number = {2},
year = {2011},
pages = {362--388},
}
@article{Bodetal2012,
author = {H.~L. Bodlaender and F.~V. Fomin and A. Koster and D. Kratsch and D. Thilikos},
title = {A Note on Exact Algorithms for Vertex Ordering Problems on Graphs},
journal = tocs, volume = {50},
number = {3},
year = {2012},
pages = {420--432},
}
@TechReport{BodKra2011,
author = {H.~L. Bodlaender and D. Kratsch},
title = {Exact algorithms for {K}ayles},
institution = {Department of Information and Computing Sciences, Utrecht University, The Netherlands},
year = {2011},
number = {UU-CS-2011-003},
month = feb,
}
@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{BojCol2008,
author = {M. Bojanczyk and
T. Colcombet},
title = {Tree-Walking Automata Do Not Recognize All Regular Languages},
journal = siam,
volume = {38},
number = {2},
year = {2008},
pages = {658--701},
}
@inproceedings{BojPla2012,
author = {Boja\'nczyk, M and Place, T,},
title = {Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets},
booktitle = {International Colloquium on Automata, Languages, and Programming, ICALP II},
series = {LNCS},
editor = {Czumaj, A. and Mehlhorn, K. and Pitts, A. and Wattenhofer, R.},
publisher = {Springer},
pages = {104--115},
volume = {7392},
year = {2012}
}
@ARTICLE{Bok81,
AUTHOR = "S.~H. Bokhari",
TITLE = "On the mapping problem",
JOURNAL = ieeetoc,
YEAR = 1981,
VOLUME = "c-30",
NUMBER = 3,
PAGES = "207--214",
copy = ""
}
@inproceedings{Boletal2010,
author = {B. Bollig and
J.-P. Katoen and
C. Kern and
M. Leucker and
D. Neider and
D. R. Piegdon},
title = {\texttt{libalf}: The Automata Learning Framework},
booktitle = {Computer Aided Verification, 22nd International Conference,
CAV},
year = {2010},
pages = {360--364},
editor = {T. Touili and
B. Cook and
P. Jackson},
publisher = {Springer},
series = {LNCS},
volume = {6174},
}
@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 = ""
}
@ARTICLE{BolCoc79,
AUTHOR = "B. Bollob{\'a}s and E. J. Cockayne",
TITLE = "Graph-theoretic parameters concerning domination, independence, and irredundance",
JOURNAL = jgth,
YEAR = 1979,
month = "",
volume = 3,
number = "",
pages = "241--249",
copy = ""
}
@article{BomKerSti2012,
author = {M. Bomhoff and
W. Kern and
G. Still},
title = {On bounded block decomposition problems for under-specified
systems of equations},
journal = jcss,
volume = {78},
number = {1},
year = {2012},
pages = {336--347},
}
@Article{Bom2012,
author = {A. Bompadre},
title = {Exponential Lower Bounds on the Complexity
of a Class of Dynamic Programs for Combinatorial
Optimization Problems},
journal = alg,
year = {2012},
volume = {62},
pages = {659--700},
}
@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" }
@TechReport{Bon2006,
author = {R. Bonato},
title = {A study on learnability for rigid {L}ambek grammars},
institution = {INRIA Futurs},
year = {2006},
OPTkey = {},
OPTtype = {},
number = {5964},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{Bonetal2009,
author = {A. Bonato and
P. A. Golovach and
G. Hahn and
J. Kratochv\'{\i}l},
title = {The capture time of a graph},
journal = dm,
volume = {309},
number = {18},
year = {2009},
pages = {5588--5595},
}
@InCollection{BonYan2011,
author = {A. Bonato and B. Yang},
title = {Graph searching and related problems},
booktitle = {Handbook of Combinatorial Optimization},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
OPTpublisher = {},
year = {2011},
editor = {P. Pardalos and D.~Z. Du and R. Graham},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
OPTchapter = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@InProceedings{Bon2011,
author = {A. Bonato},
title = {Catch me if you can: Cops and Robbers on graphs},
booktitle = {Proceedings of the 6th International Conference on Mathematical and Computational Models (ICMCM'11)},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {2011},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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 = ""
}
@Article{Bonetal99,
author = {M. Bonet and C. Phillips and T. Warnow and S. Yooseph},
title = {Constructing Evolutionary Trees in the Presence of Polymorphic Characters},
journal = siam,
year = {1999},
OPTkey = {},
volume = {29},
OPTnumber = {},
pages = {103--131},
}
@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{Bonetal2010,
author = {P. Bonizzoni and G. Della Vedova and R. Dondi and
Y. Pirola},
title = {Parameterized Complexity of $k$-Anonymity: Hardness
and Tractability},
booktitle = {Combinatorial Algorithms - 21st International Workshop,
IWOCA 2010},
pages = {242--255},
editor = {C. S. Iliopoulos and
W. F. Smyth},
publisher = {Springer},
series = {LNCS},
volume = {6460},
year = {2011},
}
@Article{BonVedDon2011,
author = {P. Bonizzoni and G. Della Vedova and R. Dondi},
title = {Anonymizing binary and small tables
is hard to approximate},
journal = joco,
year = {2011},
OPTkey = {},
volume = {22},
OPTnumber = {},
pages = {97--119},
}
@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, MFCS",
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{BonDor2008,
author = {P.~S. Bonsma and
F. Dorn},
title = {Tight Bounds and a Fast {FPT} Algorithm for {D}irected {M}ax-{L}eaf
{S}panning {T}ree},
pages = {222--233},
editor = {D. Halperin and
K. Mehlhorn},
booktitle = {Algorithms --- ESA 2008, 16th Annual European Symposium},
publisher = {Springer},
series = {LNCS},
volume = {5193},
year = {2008},
}
@article{BonDor2011,
author = {P.~S. Bonsma and
F. Dorn},
title = {Tight bounds and a fast {FPT} Algorithm for {D}irected {M}ax-{L}eaf
{S}panning {T}ree},
journal = {ACM Transactions on Algorithms},
volume = {7},
number = {4},
year = {2011},
pages = {44},
}
@inproceedings{BonZic2008,
author = {P.~S. Bonsma and
F. Zickfeld},
title = {Spanning Trees with Many Leaves in Graphs without Diamonds
and Blossoms},
pages = {531--543},
editor = {E. Sany Laber and
C. F. Bornstein and
L. Tito Nogueira and
L. Faria},
booktitle = {LATIN 2008: Theoretical Informatics},
publisher = {Springer},
series = {LNCS},
volume = {4957},
year = {2008},
}
@inproceedings{BonZic2008,
author = {P.~S. Bonsma and
F. Zickfeld},
title = {A $3/2$-Approximation Algorithm for Finding Spanning Trees
with Many Leaves in Cubic Graphs},
pages = {66--77},
editor = {H. Broersma and
T. Erlebach and
T. Friedetzky and
D. Paulusma},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International
Workshop, WG 2008},
publisher = {Springer},
series = {LNCS},
volume = {5344},
year = {2008},
}
@article{DBonZic2011,
author = {P.~S. Bonsma and
F. Zickfeld},
title = {A $3/2$-Approximation Algorithm for Finding Spanning Trees
with Many Leaves in Cubic Graphs},
journal = siamdm,
volume = {25},
number = {4},
year = {2011},
pages = {1652--1666},
}
@inproceedings{Bon2012,
author = {P.~S. Bonsma},
title = {Surface Split Decompositions and Subgraph Isomorphism in
Graphs on Surfaces},
pages = {531--542},
booktitle = {29th International Symposium on Theoretical Aspects of Computer
Science, STACS},
year = {2012},
editor = {C. D{\"u}rr and
T. Wilke},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
series = {LIPIcs},
volume = {14},
}
@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 = ""
}
@Article{Boo94,
author = {G. Boolos},
title = {G\"odel's second incompleteness theorem explained in words of one syllable},
journal = {Mind},
year = {1994},
OPTkey = {},
volume = {103},
number = {409},
OPTpages = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@article{BooJoh82,
author = {K.~S. Booth and
J.~H. Johnson},
title = {Dominating Sets in Chordal Graphs},
journal = siam,
volume = {11},
number = {1},
year = {1982},
pages = {191--199},
}
@article{BorFur99,
author = {B. Borchers and
J. Furman},
title = {A Two-Phase Exact Algorithm for {MAX-SAT} and Weighted {MAX-SAT}
Problems},
journal = joco,
volume = {2},
number = {4},
year = {1998},
pages = {299--306},
}
@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 = ""
}
@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 = {}
}
@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{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. Mart{\'i}n-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{BorHol2008,
author = "H. Bordihn and M. Holzer", title = {A note on cooperating distributed grammar systems working
in combined modes},
journal = ipl,
volume = "108",
number = "2",
pages = "10--14",
year = "1999",
}
@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",
}
@incollection{BotMauMus2000,
author = {P. Bottoni and
G. Mauri and
P. Mussio},
title = {Bidimensional Contextual Grammars},
crossref={RecentTopics2000},
pages = {25--45},
crossref = {2000},
}
@inproceedings{Botetal2002,
author = {P. Bottoni and
A. Labella and
C. Mart\'{\i}n-Vide and
Gh. P\u{a}un},
title = {Rewriting {P} Systems with Conditional Communication},
booktitle = {Formal and Natural Computing},
year = {2002},
pages = {325--353},
editor = {W. Brauer and
H. Ehrig and
J. Karhum{\"a}ki and
A. Salomaa},
publisher = {Springer},
series = {LNCS},
volume = {2300},
}
@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 = "O. Bournez and M. 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 = ""
}
@InProceedings{BouEscPas2009,
author = {N. Bourgeois and B. Escoffier and V.~Th. Paschos},
title = {Efficient Approximation of Combinatorial
Problems by Moderately Exponential Algorithms},
booktitle = {Workshop on Algorithms and Data Structures WADS},
OPTcrossref = {},
OPTkey = {},
pages = {507–-518},
year = {2009},
editor = {F. Dehne and others},
volume = {5664},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
}
@inproceedings{Bouetal2010,
author = {N. Bourgeois and
B. Escoffier and
V. Th. Paschos and
J. M. M. van Rooij},
title = {Maximum Independent Set in Graphs of Average Degree at Most
Three in $\{\mathcal O\}(1.08537^n)$},
booktitle = {Theory and Applications of Models of Computation, 7th Annual
Conference, TAMC},
year = {2010},
pages = {373--384},
editor = {J. Kratochv\'{\i}l and
A. Li and
J. Fiala and
P. Kolman},
publisher = {Springer},
series = {LNCS},
volume = {6108},
}
@inproceedings{Bouetal2010a,
author = {N. Bourgeois and
B. Escoffier and
V. Th. Paschos and
J. M. M. van Rooij},
title = {A Bottom-Up Method and Fast Algorithms for max independent
set},
booktitle = {Scandinavian Symposium
and Workshops on Algorithm Theory, SWAT},
year = {2010},
pages = {62--73},
editor = {H. Kaplan},
publisher = {Springer},
series = {LNCS},
volume = {6139},
}
@inproceedings{BouEescPas2010,
author = {N. Bourgeois and
B. Escoffier and
V. Th. Paschos},
title = {Fast Algorithms for min independent dominating set},
booktitle = {Structural Information and Communication Complexity, 17th
International Colloquium, SIROCCO},
year = {2010},
pages = {247--261},
editor = {B. Patt-Shamir and
T. Ekim},
publisher = {Springer},
series = {LNCS},
volume = {6058},
}
@article{BouEscPas2011,
author = {N. Bourgeois and
B. Escoffier and
V. Th. Paschos},
title = {Approximation of max independent set, min vertex cover and
related problems by moderately exponential algorithms},
journal = dam,
volume = {159},
number = {17},
year = {2011},
pages = {1954--1970},
}
@article {Bouetal2012,
author = {N. Bourgeois and
B. Escoffier and
V. Th. Paschos and
J. M. M. van Rooij},
title = {Fast Algorithms for \textsc{max independent set}},
journal = alg,
pages = {382--415},
volume = {62},
issue = {1},
year = {2012}
}
@article{Bouetal2012a,
author = {N. Bourgeois and
A. Giannakos and
G. Lucarelli and
I. Milis and
V. Th. Paschos and
O. Potti{\'e}},
title = {The max quasi-independent set problem},
journal = joco,
volume = {23},
number = {1},
year = {2012},
pages = {94--117},
}
@ARTICLE{Bow73,
AUTHOR = "R. Bowen",
TITLE = "Topological entropy for noncompact sets",
JOURNAL = tams,
YEAR = 1973,
month = "",
volume = 184,
number = "",
pages = "125--136",
copy = ""
}
@incollection{Boz2000,
author = {S. Bozapalidis},
title = {New Syntactical Invariants for Tree Languages},
crossref={RecentTopics2000},
pages = {46--54},
}
@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",
}
@article{Bra98,
author = {F.-J. Brandenburg},
title = {The Ancestor Width of Grammars and Languages},
journal = tcs,
volume = {207},
number = {1},
year = {1998},
pages = {25--41},
}
@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 = ""
}
@article{BraLe2006,
title = "Structure and linear time recognition of 3-leaf powers",
journal = ipl,
volume = "98",
number = "4",
pages = "133--138",
year = "2006",
author = "A. Brandst{\"}adt and V. Bang Le",
}
@article{BraLeSri2008,
author = {Brandst\"{a}dt, A. and Le, V. Bang and Sritharan, R.},
title = {Structure and linear-time recognition of 4-leaf powers},
journal = {ACM Trans. Algorithms},
volume = {5},
issue = {1},
month = {December},
year = {2008},
pages = {11:1--11:22},
articleno = {11},
numpages = {22},
}
@article{BraMilSir96,
author = {L. Brankovic and
M. Miller and
J. Sir{\'a}n},
title = {Graphs, 0–1 matrices, and usability of statistical databases},
journal = {Congressus Numerantium},
volume = {12},
year = {1996},
pages = {182--196},
}
@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{BraEst97,
author = {L. Brankovic and V. Estivill-Castro},
title = {Privacy issues in knowledge discovery and data mining},
booktitle = {Australian institute of computer ethics conference},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {1997?},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@inproceedings{Braetal97,
author = {L. Brankovic and
P. Hor{\'a}k and
M. Miller and
G. Wrightson},
editor = {Y. E. Ioannidis and
D. M. Hansen},
title = {Usability of Compromise-Free Statistical Databases},
booktitle = {Ninth International Conference on Scientific and Statistical
Database Management, Proceedings, August 11-13, 1997, Olympia,
Washington, USA},
publisher = {IEEE Computer Society},
year = {1997},
pages = {144--154},
}
@article{Braetal98,
author = {L. Brankovic and
M, Miller and
J, Plesn\'{\i}k and
J, F. Ryan and
J, Sir{\'a}n},
title = {A Note on Constructing Large {C}ayley Graphs of Given Degree
and Diameter by Voltage Assignments},
journal = {Electr. J. Comb.},
volume = {5},
year = {1998},
}
@article{BraHorMil2000,
author = {L. Brankovic and
P. Hor{\'a}k and
M. Miller},
title = {An Optimization Problem in Statistical Databases},
journal = siamdm,
volume = {13},
number = {3},
year = {2000},
pages = {346--353},
}
@inproceedings{BraSir2002,
author = {L. Brankovi\'c and
J. {\v S}ir{\'a}{\v n}},
title = {2-Compromise Usability in 1-Dimensional Statistical Databases},
booktitle = {Computing and Combinatorics, 8th Annual International Conference, COCOON},
year = {2002},
pages = {448--455},
editor = {O. H. Ibarra and
L. Zhang},
publisher = {Springer},
series = {LNCS},
volume = {2387},
}
@article{BraMilSir2002,
author = {L. Brankovic and
M. Miller and
J. Sir{\'a}n},
title = {On Range Query Usability of Statistical Databases},
journal = ijcm,
volume = {79},
number = {12},
year = {2002},
pages = {1265--1271},
}
@article{BraCve2003,
author = {L. Brankovi\'c and D. Cvetkovi\'c},
title = {The eigenspace of the eigenvalue –2 in generalized line graphs and a problem in security of statistical databases},
year ={2003},
journal ={Univ. Beograd, Publ. Elektrotehn.
Fak., Ser. Mat.},
volume= 14,
pages= {37--48}
}
@InProceedings{Braetal2005,
author = {L. Brankovic and Murch, C. and Pond J. and Rosa, A.},
title = {$\alpha$-size of Trees With Maximum Degree Three and Perfect Matching},
booktitle = {Proceedings of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005)},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {2005},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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{BraFer2010,
author = {L. Brankovic and
H. Fernau},
title = {Combining Two Worlds: Parameterised Approximation for Vertex
Cover},
booktitle = {Algorithms and Computation --- 21st International Symposium,
ISAAC 2010,
Part I},
year = {2010},
pages = {390--402},
editor = {O. Cheong and
K.-Y. Chwa and
K. Park},
publisher = {Springer},
series = {LNCS},
volume = {6506},
}
@article{BraWan2011,
author = {L. Brankovic and
I. M. Wanless},
title = {Graceful Labelling: State of the Art, Applications and Future
Directions},
journal = {Mathematics in Computer Science},
volume = {5},
number = {1},
year = {2011},
pages = {11--20},
}
@inproceedings{BraFer1112,
author = {L. Brankovic and
H. Fernau},
title = {Parameterized Approximation Algorithms for \textsc{Hitting Set}},
booktitle = {Approximation and Online Algorithms --- 9th International
Workshop, WAOA 2011},
pages = {63--76},
editor = {R. Solis-Oba and
G. Persiano},
publisher = {Springer},
series = {LNCS},
volume = {7164},
year = {2012},
}
@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"
}
@inproceedings{Bra2012,
author = {M. Braverman},
title = {Interactive information complexity},
pages = {505--524},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing
Conference, STOC},
year = {2012},
editor = {H. J. Karloff and
T. Pitassi},
publisher = {ACM},
}
@article{BraFu77,
AUTHOR = "J. M. Brayer and K. S. Fu",
title = {A note on the $k$-tail method of tree grammar inference},
journal = ieeetsmc,
volume = {7},
number = {4},
year = {1977},
pages = {293--300},
}
@ARTICLE{BraKin86,
AUTHOR = "A. Brazma and E. 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},
editor = {E. Sandewall and C. G. Jansson},
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{Breetal2011,
author = {R. Bredereck and
A. Nichterlein and
R. Niedermeier and
G. Philip},
title = {The Effect of Homogeneity on the Complexity of $k$-Anonymity},
booktitle = {Fundamentals of Computation Theory, FCT},
year = {2011},
pages = {53--64},
editor = {O. Owe and
M. Steffen and
J. A. Telle},
publisher = {Springer},
series = {LNCS},
volume = {6914},
}
@inproceedings{Breetal2011a,
author = {R. Bredereck and
A. Nichterlein and
R. Niedermeier and
G. Philip},
title = {Pattern-Guided Data Anonymization and Clustering},
booktitle = {Mathematical Foundations of Computer Science, MFCS},
year = {2011},
pages = {182--193},
editor = {F. Murlak and
P. Sankowski},
publisher = {Springer},
series = {LNCS},
volume = {6907},
}
@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{BriDutHed2007,
title = "Security in graphs",
journal = dam,
volume = "155",
number = "13",
pages = "1708--1714",
year = "2007",
author = "R.~C. Brigham and R.~D. Dutton and S.~T. Hedetniemi",
}
@Article{Brietal2009,
author = {R.~C. Brigham and R.~D. Dutton and T.~W. Haynes and S.~T. Hedetniemi},
title = {Powerful alliances in graphs},
journal = dam,
year = {2009},
OPTkey = {},
volume = {309},
OPTnumber = {},
pages = {2140--2147},
}
@article{BriHoo2010,
author = {R. Brijder and
H. J. Hoogeboom},
title = {Maximal pivots on graphs with an application to gene assembly},
journal = dam,
volume = {158},
number = {18},
year = {2010},
pages = {1977--1985},
}
@inproceedings{Bri2003,
author = {M. Brinkmeier},
title = {Communities in Graphs},
booktitle = {Innovative Internet Community Systems, Third International
Workshop, IICS},
year = {2003},
pages = {20--35},
editor = {T. B{\"o}hme and
G. Heyer and
H. Unger},
publisher = {Springer},
series = {LNCS},
volume = {2877},
}
@inproceedings{BriWerRec2007,
author = {M. Brinkmeier and
J. Werner and
S. Recknagel},
title = {Communities in graphs and hypergraphs},
booktitle = {Proceedings of the Sixteenth ACM Conference on Information
and Knowledge Management, CIKM},
year = {2007},
pages = {869--872},
editor = {M. J. Silva and
A. H. F. Laender and
R. A. Baeza-Yates and
D. L. McGuinness and
B. Olstad and
O. Haug Olsen and
A. O. Falc{\~a}o},
publisher = {ACM},
}
@ARTICLE{Bri63,
AUTHOR = "J. L. Britton",
TITLE = "The word problem",
JOURNAL = annmath,
YEAR = 1963,
month = "",
volume = 77,
number = "",
pages = "16--32",
copy = ""
}
@article{BriKoiMee2011,
author = {I. Briquel and
P. Koiran and
K. Meer},
title = {On the expressive power of {CNF} formulas of bounded tree-
and clique-width},
journal = dam,
volume = {159},
number = {1},
year = {2011},
pages = {1--14},
}
@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{Broetal2006,
author = {H. Broersma and
F. V. Fomin and
J. Kratochv\'{\i}l and
G. J. Woeginger},
title = {Planar Graph Coloring Avoiding Monochromatic Subgraphs:
Trees and Paths Make It Difficult},
journal = algo,
volume = {44},
number = {4},
year = {2006},
pages = {343--361},
}
@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 = ""
}
@Article{BroPosWoe2008,
author = {Brouwer, A.~E. and Post, G.~F. and Woeginger, G.~J.},
title = {Tight
bounds for break minimization in tournament scheduling.},
journal = jcta,
year = {2008},
OPTkey = {},
volume = {115},
number = {6},
pages = {1065--1068},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = ""
}
@PhdThesis{Bru93b,
author = {A. Br{\"u}ggemann-Klein},
title = {Formal Models in Document Processing},
school = {Universit\"at Freiburg im Breisgau, Germany},
year = {1993},
type = {Habili\-tations\-schrift},
}
@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 = ""
}
@article{BryZon2009,
title = "Polynomial cases of graph decomposition: A complete solution of {H}olyer’s problem",
journal = dm,
volume = "309",
number = "6",
pages = "1294 -- 1326",
year = "2009",
author = "K. Bry\'s and Z. Lonc",
}
@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 = ""
}
@inproceedings{BrzTam2011,
author = {J.~A. Brzozowski and
H. Tamm},
title = {Theory of {\'A}tomata},
pages = {105--116},
booktitle = {Developments in Language Theory DLT},
year = {2011},
editor = {G. Mauri and
A. Leporati},
publisher = {Springer},
series = {LNCS},
volume = {6795},
}
@article{Bsoetal96,
author = {N. H. Bshouty and
S. A. Goldman and
T. R. Hancock and
S. Matar},
title = {Asking Questions to Minimize Errors},
journal = jcss,
volume = {52},
number = {2},
year = {1996},
pages = {268--286},
}
@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. N{\"o}llenburg 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}
}
@inproceedings{Bucetal2008a,
author = {K. Buchin and M. Buchin and J. Byrka and M. N{\"o}llenburg and Y. Okamoto and R. I. Silveira and A. Wolff},
title = {Drawing (Complete) Binary Tanglegrams},
booktitle = {Graph Drawing, 16th International Symposium, GD 2008},
pages = {324--335},
editor = {I. G. Tollis and
M. Patrignani},
publisher = {Springer},
series = {LNCS},
volume = {5417},
year = {2009},
}
@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{BugOli2005,
author = {M.~M.~F. Bugalho and
A. L. Oliveira},
title = {Inference of regular languages using state merging algorithms
with search},
journal = patrec,
volume = {38},
number = {9},
year = {2005},
pages = {1457--1467},
}
@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 = ""
}
@inproceedings{Buietal2011,
author = {B.-M. Bui-Xuan and
P. Heggernes and
D. Meister and
A. Proskurowski},
title = {A Generic Approach to Decomposition Algorithms, with an
Application to Digraph Decomposition},
booktitle = {Computing and Combinatorics COCOON},
year = {2011},
pages = {331--342},
editor = {B. Fu and
D.-Z. Du},
publisher = {Springer},
series = {LNCS},
volume = {6842},
}
@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{BurBonDur2006,
title = "{NP}-completeness results for edge modification problems ",
journal = dam,
volume = "154",
number = "13",
pages = "1824--1844",
year = "2006",
doi = "10.1016/j.dam.2006.03.031",
author = "P. Burzyn and F. Bonomo and G. Dur\'an",
}
@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{BusIsl2007,
author = {J.~F. Buss and
T. Islam},
title = {Algorithms in the {W}-Hierarchy},
journal = tocs,
volume = {41},
number = {3},
year = {2007},
pages = {445--457},
}
@Article{Bus98,
author = {W. Buszkowski},
title = {Algebraic structures in categorial grammar},
journal = tcs,
year = {1998},
OPTkey = {},
volume = {199},
OPTnumber = {},
pages = {5--24},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{But74,
AUTHOR = "J. Butler",
TITLE = "A note on cellular automata simulations",
JOURNAL = icalt,
YEAR = 1974,
VOLUME = 26,
NUMBER = "",
PAGES = "286--295",
copy = ""
}
@inproceedings{ByrGuiJan2008,
author = {J. Byrka and
S. Guillemot and
J. Jansson},
title = {New Results on Optimizing Rooted Triplets Consistency},
booktitle = {Algorithms and Computation, 19th International Symposium, ISAAC},
year = {2008},
pages = {484--495},
editor = {S.-H. Hong and
H. Nagamochi and
T. Fukunaga},
publisher = {Springer},
series = {LNCS},
volume = {5369},
}
@article{ByrAar2010,
author = {J. Byrka and
K. Aardal},
title = {An Optimal Bifactor Approximation Algorithm for the Metric
Uncapacitated Facility Location Problem},
journal = siam,
volume = {39},
number = {6},
year = {2010},
pages = {2212--2231},
}
CCCC
@article{Cabetal2011,
author = {Cabello, S. and Giannopoulos, P. and Knauer, C. and Marx, D. and Rote, G.},
title = {Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension},
journal = {ACM Trans. Algorithms},
volume = {7},
issue = {4},
month = sep,
year = {2011},
pages = {43:1--43:27},
articleno = {43},
numpages = {27},
publisher = {ACM Press},
}
@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{Caietal2007,
author = {L. Cai and
M.~R. Fellows and
D.~W. Juedes and
F.~A. Rosamond},
title = {The Complexity of Polynomial-Time Approximation},
journal = tocs,
volume = {41},
number = {3},
year = {2007},
pages = {459--477},
}
@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},
}
@INPROCEEDINGS{CaiHua2006,
AUTHOR = "L. Cai and X. Huang",
TITLE = "Fixed-Parameter Approximation: Conceptual
Framework and Approximability Results",
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 = "96--108",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@article {CaiHua2010,
AUTHOR = "L. Cai and X. Huang",
title = {Fixed-Parameter Approximation: Conceptual Framework and Approximability Results},
journal = alg,
pages = {398--412},
volume = {57},
issue = {2},
year = {2010}
}
@article{CaiYan2011,
author = {L. Cai and
B. Yang},
title = {Parameterized complexity of even/odd subgraph problems},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
year = {2011},
pages = {231--240},
}
@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{Caketal2007,
author = {O.~A. \c{C}akiroglu and
C. Erten and
{\"O}. Karatas and
M. S{\"o}zdinler},
title = {Crossing Minimization in Weighted Bipartite Graphs},
booktitle = {Experimental Algorithms, 6th International Workshop, WEA},
year = {2007},
pages = {122--135},
editor = {C. Demetrescu},
publisher = {Springer},
series = {LNCS},
volume = {4525},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{CalImpPat2009,
author = {C. Calabro and
R. Impagliazzo and
R. Paturi},
title = {The Complexity of Satisfiability of Small Depth Circuits},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, IWPEC},
year = {2009},
pages = {75--85},
editor = {J. Chen and
F. V. Fomin},
publisher = {Springer},
series = {LNCS},
volume = {5917},
}
@INPROCEEDINGS{Caletal2002,
AUTHOR = "G. C{\u{a}}linescu 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{Caletal2005,
author = {G. C{\u{a}}linescu and A. Dumitrescu and H. Karloff and Peng-Jun Wan},
title = {Separating points by axis-parallel lines},
journal = {International Journal of Computational Geometry \& Applications},
year = {2005},
OPTkey = {},
volume = {15},
OPTnumber = {},
pages = {575--590},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{Caletal2012,
author = {G. C{\u{a}}linescu and
C. G. Fernandes and
H. Kaul and
A. Zelikovsky},
title = {Maximum Series-Parallel Subgraph},
journal = alg,
volume = {63},
year = {2012},
pages = {137--157},
}
@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{CalJurSta2009,
author = {C.~S. Calude and
H. J{\"u}rgensen and
L. Staiger},
title = {Topology on words},
journal = tcs,
volume = {410},
number = {24-25},
year = {2009},
pages = {2323--2335},
}
@Article{CamHar2005,
author = {A.~M. Campbell and J.~R. Hardin},
title = {Vehicle minimization for periodic deliveries},
journal = {European Journal of Operational Research},
year = {2005},
OPTkey = {},
volume = {165},
OPTnumber = {},
pages = {668–-684},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = ""
}
@article{CamKle98,
author = {M.~B. Camp{\^e}lo and
S. Klein},
title = {Maximum Vertex-weighted Matching in Strongly Chordal Graphs},
journal = dam,
volume = {84},
year = {1998},
pages = {71--77},
}
@inproceedings{CamLopPer2007,
author = {M. Campos and
D. L{\'o}pez and
P. Peris},
title = {Incremental Multiple Sequence Alignment},
booktitle = {Progress in Pattern Recognition, Image Analysis and Applications,
12th Iberoamerican Congress on Pattern Recognition, CIARP 2007},
pages = {604--613},
editor = {L. Rueda and
D. Mery and
J. Kittler},
publisher = {Springer},
series = {LNCS},
volume = {4756},
year = {2008}
}
@inproceedings{CanAlv2008,
author = {A. Cano G{\'o}mez and
G.~I. \`Alvarez},
title = {Learning Commutative Regular Languages},
booktitle = {Grammatical Inference: Algorithms and Applications, 9th
International Colloquium, ICGI},
year = {2008},
pages = {71--83},
editor = {A. Clark and
F. Coste and
L. Miclet},
publisher = {Springer},
series = {LNCS/LNAI},
volume = {5278},
}
@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 = ""
}
@inproceedings{CaoChe2010,
author = {Y. Cao and
J. Chen},
title = {Cluster Editing: Kernelization Based on Edge Cuts},
booktitle = {Parameterized and Exact Computation --- 5th International
Symposium, IPEC},
year = {2010},
pages = {60--71},
editor = {V. Raman and
S. Saurabh},
publisher = {Springer},
series = {LNCS},
volume = {6478},
}
@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 = ""
}
@article{CapPisTot99,
author = {A. Caprara and
D. Pisinger and
P. Toth},
title = {Exact Solution of the Quadratic Knapsack Problem},
journal = {INFORMS Journal on Computing},
volume = {11},
number = {2},
year = {1999},
pages = {125--137},
}
@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{Capetal2000,
author = {A. Caprara and
H. Kellerer and
U. Pferschy and
D. Pisinger},
title = {Approximation algorithms for knapsack problems with cardinality
constraints},
journal = {European Journal of Operational Research},
volume = {123},
number = {2},
year = {2000},
pages = {333--345},
}
@article{CaprRiz2002,
title = "Packing triangles in bounded degree graphs",
journal = ipl,
volume = "84",
number = "4",
pages = "175 -- 180",
year = "2002",
author = "A. Caprara and R. Rizzi",
}
@article{CapPanRiz2003,
author = {A. Caprara and
A. Panconesi and
R. Rizzi},
title = {Packing cycles in undirected graphs},
journal = jalg,
volume = {48},
number = {1},
year = {2003},
pages = {239--256},
}
@Article{CapLetSal2010,
author = {A. Caprara and A. N. Letchford and J.-J. Salazar-Gonz\'alez},
title = {Lower Bounds for the Minimum Linear Arrangement of a Graph},
journal = {Electronic Notes in Discrete Mathematics},
year = {2010},
volume = {36},
pages = {843--849},
}
@inproceedings{CarLan2004,
author = {J. Cardinal and
S. Langerman},
title = {Designing Small Keyboards Is Hard},
booktitle = {Theoretical Informatics, LATIN},
year = {2004},
pages = {391--400},
editor = {M. Farach-Colton},
publisher = {Springer},
series = {LNCS},
volume = {2976},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Caretal2011,
author = {J. Cardinal and
E. D. Demaine and
M. L. Demaine and
S. Imahori and
T. Ito and
M. Kiyomi and
S. Langerman and
R. Uehara and
T. Uno},
title = {Algorithmic Folding Complexity},
journal = {Graphs and Combinatorics},
volume = {27},
number = {3},
year = {2011},
pages = {341--351},
}
@article{Caretal2007a,
author = {J. Carme and
R. Gilleron and
A. Lemay and
J. Niehren},
title = {Interactive learning of node selecting tree transducer},
journal = {Machine Learning},
volume = {66},
number = {1},
year = {2007},
pages = {33--67},
}
@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 {CarOncCal2001,
author = "Carrasco-Jim\'enez, R.~C. and Oncina, J. and Calera-Rubio, J.",
title = "Stochastic inference of regular tree languages",
journal = "Machine Learning",
pages = "185--197",
year = "2001"
}
@article{CarRic2003,
AUTHOR = "Carrasco, R.~C. and Rico-Juan, J.~R.",
TITLE = "A similarity between probabilistic tree languages:
Application to {XML} document families",
JOURNAL = patrec,
VOLUME = "36",
YEAR = "2003",
NUMBER = "9",
PAGES = "2197--2199"}
@Article{CarDacFor2009,
author = {R.~C. Carrasco and J. Daciuk and M.~L. Forcada},
title = {Incremental Construction of Minimal Tree Automata},
journal = alg,
year = {2009},
OPTkey = {},
volume = {55},
OPTnumber = {},
pages = {95-110},
}
@article{Caretal2012,
author = {R. Carrascosa and
F. Coste and
M. Gall{\'e} and
G. G. Infante L{\'o}pez},
title = {Searching for smallest grammars on large sequences and application
to {DNA}},
journal = jda,
volume = {11},
year = {2012},
pages = {62--72},
}
@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{CasDiaGar2011,
author = {R.~M. Casablanca and A. Di\'anez and P. Garc\'ia-V\'azquez},
title = {Toughness of the corona of two graphs},
journal = ijcm,
year = {2011},
volume = {88},
number = {13},
pages = {2697-2706},
}
@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{CasJaiMa94,
author = {J. Case and S. Jain and S. N. Manguelle},
title = {Refinement of inductive inference by {P}opperian and reliable machines},
journal = {Kybernetika},
year = {1994},
volume = {30},
OPTnumber = {},
pages = {23--52},
}
@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{CasMoe2011,
author = {J. Case and
S.~E. Moelius},
title = {Optimal language learning from positive data},
journal = ic,
volume = {209},
number = {10},
year = {2011},
pages = {1293--1311},
}
@article{Casetal2012,
author = {J. Case and
S. Jain and
T. D. Le and
Y. S. Ong and
P. Semukhin and
F. Stephan},
title = {Automatic learning of subclasses of pattern languages},
journal = ic,
volume = {218},
year = {2012},
pages = {17--35},
}
@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{Ceretal2008,
author = {M. R. Cerioli and
L. Faria and
T. O. Ferreira and
C. A. J. Martinhon and
F. Protti and
B. Reed},
title = {Partition into cliques for cubic graphs: Planar case, complexity
and approximation},
journal = dam,
volume = {156},
number = {12},
year = {2008},
pages = {2270--2278},
}
@inproceedings{Cer2012,
author = {P. {\v{C}}erno},
title = {Clearing Restarting Automata and Grammatical Inference},
series = {Journal of Machine Learning Research - Proceedings Track},
bookTITLE = {Proceedings of the Eleventh International Conference on Grammatical Inference, ICGI},
Editors = {J. Heinz and C. de la Higuera
and T. Oates},
volume = {21},
year = {2012},
pages = {54--68},
}
@Article{Cer64,
author = {J. {\v{C}}ern\'y},
title = {Pozn\'amka k homog\'ennym experimentom s kone\v{c}n\'ymi automatmi},
journal = {Matematicko-fyzik\'alny \v{c}asopis},
year = {1964},
OPTkey = {},
volume = {14},
number = {3},
pages = {208--216},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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{Cetetal2003,
author = {R. Ceterchi and
M. Mutyam and
Gh. P\u{a}un and
K.~G. Subramanian},
title = {Array-rewriting {P} systems},
journal = {Natural Computing},
volume = {2},
number = {3},
year = {2003},
pages = {229--249},
}
@inproceedings{CetGraJon2004,
author = {R. Ceterchi and
R. Gramatovici and
N. Jonoska},
title = {Tiling Rectangular Pictures with {P} Systems},
booktitle = {Workshop on Membrane Computing, WMC 2003},
pages = {88--103},
editor = {C. Mart\'{\i}n-Vide and
G. Mauri and
Gh. Paun and
G. Rozenberg and
A. Salomaa},
publisher = {Springer},
series = {LNCS},
volume = {2933},
year = {2004},
}
@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 = ""
}
@article{Chaetal2011,
author = {J. Chalopin and
V. Chepoi and
N. Nisse and
Y. Vax{\`e}s},
title = {Cop and robber games when the robber can hide and ride},
journal = siamdm,
volume = {25},
number = {1},
year = {2011},
pages = {333--359},
}
@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 = ""
}
@InProceedings{Chaetal2008,
author = {Chalup, S.~K. and Henderson, N. and Ostwald, M.~J. and Wiklendt, L.},
title = {A method for cityscape analysis by determining the fractal dimension of its skyline},
booktitle = {Proceedings of the 42nd Annual Conference of the Australian and New Zealand Architectural Science Association (Newcastle, NSW 26-28 November, 2008)},
OPTcrossref = {},
OPTkey = {},
pages = {337--344},
year = {2008},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}
@Article{ChaCha2012,
author = {B. Chaluvaraju and V. Chaitra},
title = {Roman Domination in Complementary Prism Graphs},
journal = {International Journal of Mathematical Combinatorics},
year = {2012},
OPTkey = {},
volume = {2},
OPTnumber = {},
pages = {24--31},
}
@article{Chaetal2009,
author = {Chambers, E.~W. and Kinnersley, B. and Prince, N. and West, D.~B.},
title = {Extremal Problems for {R}oman Domination},
journal = siamdm,
volume = {23},
issue = {3},
year = {2009},
pages = {1575--1586},
}
@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 = ""
}
@PhdThesis{Cha2010a,
author = {J. Champav\`ere},
title = {Induction de requ\^etes guid\'ee par sch\'ema (Schema-Guided Query Induction)},
school = {Univ. Lille 1, Science et technologies, Laboratoire d'informatique fondamentale de Lille, France},
year = {2010},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = ""
}
@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{Chaetal90,
author = {V. Chandru and C.~R. Coullard and P.~L. Hammer and M. Monta\~nez and X. Sun},
title = {On renamable {H}orn and generalized {H}orn functions},
journal = amai,
year = {1990},
OPTkey = {},
volume = {1},
OPTnumber = {},
pages = {33--47},
}
@article{ChaSubTho2003,
author = {P. Helen Chandra and
K.~G. Subramanian and
D.~G. Thomas},
title = {Parallel Contextual Array Grammars and Languages},
journal = {Electronic Notes in Discrete Mathematics},
volume = {12},
year = {2003},
pages = {106--117},
}
@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{Cha86,
AUTHOR = "D. K. Chang",
TITLE = "On Fibonacci {$k$}-ary trees",
JOURNAL = fiq,
YEAR = 1986,
VOLUME = 24,
NUMBER = 3,
PAGES = "258--262",
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{Cha94,
title = "The domatic number problem",
journal = dm,
volume = "125",
number = "1–3",
pages = "115--122",
year = "1994",
author = "G.~J. Chang"
}
@Article{ChaNagRan98,
author = {M.-S. Chang and P. Nagavamsi and C. Pandu Rangan},
title = {Weighted irredundance of interval graphs},
journal = ipl,
year = {1998},
OPTkey = {},
volume = {66},
OPTnumber = {},
pages = {65--70},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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{ChaGimHar2008,
author = {G. G. Chappell and
J. G. Gimbel and
C. Hartman},
title = {Bounds on the metric and partition dimensions of a graph},
journal = {Ars Comb.},
volume = {88},
year = {2008},
}
@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{Chaetal2005,
author = {M. Charikar and
E. Lehman and
D. Liu and
R. Panigrahy and
M. Prabhakaran and
A. Sahai and
A. Shelat},
title = {The smallest grammar problem},
journal = {IEEE Transactions on Information Theory},
volume = {51},
number = {7},
year = {2005},
pages = {2554--2576},
}
@article{ChaHudLob2003,
author = {I. Charon and
O. Hudry and
A. Lobstein},
title = {Minimizing the size of an identifying or locating-dominating
code in a graph is {NP}-hard},
journal = tcs,
volume = {290},
number = {3},
year = {2003},
pages = {2109--2120},
}
@article{Chaetal2006a,
author = {I. Charon and
S. Gravier and
O. Hudry and
A. Lobstein and
M. Mollard and
J. Moncel},
title = {A linear algorithm for minimum 1-identifying codes in oriented
trees},
journal = dam,
volume = {154},
number = {8},
year = {2006},
pages = {1246--1253},
}
@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{ChaSalZha2000,
author = {G. Chartrand and E. Salehi and P. Zhang},
title = {The partition dimension of a graph},
journal = {Aequationes Math.},
year = {2000},
OPTkey = {},
volume = {59},
OPTnumber = {},
pages = {45--54},
}
@article{Chaetal2000,
author = {G. Chartrand and
L. Eroh and
M. A. Johnson and
O. Oellermann},
title = {Resolvability in graphs and the metric dimension of a graph},
journal = dam,
volume = {105},
number = {1--3},
year = {2000},
pages = {99--113},
}
@Article{ChaSaeZha2003,
author = {G. Chartrand and V. Saenpholphat and P. Zhang},
title = {The independent resolving number of a graph},
journal = {Math. Bohem.},
year = {2003},
volume = {128},
pages = {379--393},
}
@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 = ""
}
@article{Chaetal2006,
author = {S. Chawla and
R. Krauthgamer and
R. Kumar and
Y. Rabani and
D. Sivakumar},
title = {On the Hardness of Approximating Multicut and Sparsest-Cut},
journal = {Computational Complexity},
volume = {15},
number = {2},
year = {2006},
pages = {94-114},
ee = {http://dx.doi.org/10.1007/s00037-006-0210-9},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{Cha2010,
author = {M. Chapelle},
title = {Parameterized Complexity of Generalized Domination Problems
on Bounded Tree-Width Graphs},
journal = {CoRR},
volume = {abs/1004.2642},
year = {2010},
ee = {http://arxiv.org/abs/1004.2642},
}
@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{Cheetal2011,
author = {M.~A. Cheema and
L. Brankovic and
X. Lin and
W. Zhang and
W. Wang},
title = {Continuous Monitoring of Distance-Based Range Queries},
journal = {IEEE Trans. Knowl. Data Eng.},
volume = {23},
number = {8},
year = {2011},
pages = {1182--1199},
}
@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 = ""
}
@article{Cheetal2009,
AUTHOR = {Chellali, M. and Haynes, T. W. and Randerath, B. and Volkmann,
L.},
TITLE = {Bounds on the global offensive $k$-alliance number in graphs},
JOURNAL = {Discussiones Mathematicae Graph Theory},
VOLUME = {29},
YEAR = {2009},
NUMBER = {3},
PAGES = {597--613},
}
@Article{Che2010,
author = {M. Chellali},
title = {Trees with equal global offensive $k$-alliance and $k$-domination numbers},
journal = {Opuscula Mathematia},
year = {2010},
OPTkey = {},
volume = {30},
OPTnumber = {},
pages = {249--254},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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{CheTanLi2010,
author = {H.-Y. Chen and X. Tan and G.-J. Li},
title = {Perfect Sorting by Reversals and
Deletions/Insertions},
booktitle = {The Ninth International Symposium on Operations Research and Its Applications (ISORA’10)},
OPTcrossref = {},
OPTkey = {},
pages = {512–-518},
year = {2010},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {ORSC \& APORC},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}
@inproceedings{Cheetal2009a,
author = {Y.-F. Chen and
A. Farzan and
E. M. Clarke and
Y.-K. Tsay and
B.-Y. Wang},
title = {Learning Minimal Separating {DFA}'s for Compositional Verification},
booktitle = {Tools and Algorithms for the Construction and Analysis of
Systems, 15th International Conference, TACAS},
year = {2009},
pages = {31--45},
editor = {S. Kowalewski and
A. Philippou},
publisher = {Springer},
series = {LNCS},
volume = {5505},
}
@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{CheKanXia2005,
AUTHOR = "J. Chen and I.~A. Kanj and Xia, G.",
TITLE = "Labeled search trees and amortized analysis: improved upper bounds for {NP}-hard problems",
journal = alg,
YEAR = 2005,
month = "",
volume = "43",
pages = "245--273",
}
@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 = joco,
YEAR = 2006,
month = "",
volume = 11,
number = "",
pages = "231--247",
copy = ""
}
@article{CheZha2006,
author = {J. Chen and
F. Zhang},
title = {On product covering in 3-tier supply chain models: Natural
complete problems for {{\it W}[3]} and {{\it W}[4]}},
journal = tcs,
volume = {363},
number = {3},
year = {2006},
pages = {278--288},
}
@article{Cheetal2006a,
author = {D. Chen and
O. Eulenstein and
D. Fern{\'a}ndez-Baca and
M. Sanderson},
title = {Minimum-Flip Supertrees: Complexity and Algorithms},
journal = {IEEE/ACM Trans. Comput. Biology Bioinform.},
volume = {3},
number = {2},
year = {2006},
pages = {165--173},
}
@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},
}
@inproceedings{CheLu2007,
author = {J. Chen and
S. Lu},
title = {Improved Algorithms for Weighted and Unweighted Set Splitting
Problems},
booktitle = {Computing and Combinatorics COCOON},
year = {2007},
pages = {537--547},
editor = {G. Lin},
publisher = {Springer},
series = {LNCS},
volume = {4598},
}
@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{Cheetal2007-348,
author = {J. Chen and F.~V. Fomin and Y. Liu and S. Lu and Y. Villanger},
title = {Improved Algorithms for the {F}eedback {V}ertex {S}et Problems},
institution = {University of Bergen, Norway, Reports in Informatics},
year = {2007},
OPTkey = {},
OPTtype = {},
number = {348},
OPTaddress = {},
OPTmonth = {},
note = {To appear in }#jcss,
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {}
}
@inproceedings{Cheetal2007b,
author = {J. Chen and F.~V. Fomin and Y. Liu and S. Lu and Y. Villanger},
title = {Improved Algorithms for the Feedback Vertex Set Problems},
year = {2007},
pages = {422--433},
editor = {F.~K.~H.~A. Dehne and
J.-R. Sack and
N. Zeh},
booktitle = {Algorithms and Data Structures, 10th International Workshop,
WADS},
publisher = {Springer},
series = {LNCS},
volume = {4619},
}
@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}},
}
@inproceedings{Cheetal2008a,
author = {Chen, J. and Liu, Y. and Lu, S. and O'Sullivan, B. and Razgon, I.},
title = {A fixed-parameter algorithm for the directed feedback vertex set problem},
booktitle = {STOC '08: Proceedings of the 40th annual ACM Symposium on Theory of Computing},
year = {2008},
pages = {177--186},
publisher = {ACM},
}
@article{Cheetal2008b,
author = {J. Chen and
F. V. Fomin and
Y. Liu and
S. Lu and
Y. Villanger},
title = {Improved algorithms for feedback vertex set problems},
journal = jcss,
volume = {74},
number = {7},
year = {2008},
pages = {1188--1198},
}
@article{Che2009,
author = {N. Chen},
title = {On the Approximability of Influence in Social Networks},
journal = siamdm,
volume = {23},
number = {3},
year = {2009},
pages = {1400--1415},
}
@article{CheLiuLu2009,
author = {J. Chen and
Y. Liu and
S. Lu},
title = {An Improved Parameterized Algorithm for the Minimum Node
Multiway Cut Problem},
journal = alg,
volume = {55},
number = {1},
year = {2009},
pages = {1--13},
}
@article{CheKanXia2010,
author = {J. Chen and
I. A. Kanj and
G. Xia},
title = {Improved upper bounds for vertex cover},
journal = tcs,
volume = {411},
number = {40--42},
year = {2010},
pages = {3736--3756},
}
@inproceedings{Cheetal2010,
author = {Z.-Z. Chen and
M. R. Fellows and
B. Fu and
H. Jiang and
Y. Liu and
L. Wang and
B. Zhu},
title = {A Linear Kernel for Co-Path/Cycle Packing},
booktitle = {Algorithmic Aspects in Information and Management, 6th International
Conference, AAIM},
year = {2010},
pages = {90--102},
editor = {Bo Chen},
publisher = {Springer},
series = {LNCS},
volume = {6124},
}
@article{CheMen2011,
title = "A $2k$ kernel for the cluster editing problem",
journal = jcss,
volume = "78",
number = "1",
pages = "211--220",
year = "2012",
author = "J. Chen and J. Meng",
}
@InProceedings{Cheetal2012,
author = {J. Chen and
H. Fernau and
P. Shaw and
J. Wang and
Z. Yang},
title = {Kernels
for packing and covering problems {\small (Extended Abstract)}},
booktitle = {Sixth International Frontiers of Algorithmics Workshop FAW and Eighth International Conference on Algorithmic Aspects of Information and Management AAIM},
pages = {199--211},
year = {2012},
editor = {J. Snoeyink and P. Lu and K. Su and L. Wang},
volume = {7285},
series = {LNCS},
publisher = {Springer},
}
@article{CheENRRS2013,
author = {N. Chen and
R. Engelberg and
C. Thach Nguyen and
P. Raghavendra and
A. Rudra and
G. Singh},
title = {Improved Approximation Algorithms for the Spanning Star
Forest Problem},
journal = algo,
volume = {65},
number = {3},
year = {2013},
pages = {498--516},
ee = {http://dx.doi.org/10.1007/s00453-011-9607-1},
}
@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 = ""
}
@Article{CheSchSam2011,
author = {W. Chen and M.~C. Schmidt and N.~F. Samatova},
title = {On the parameterized complexity of the {Multi-MCT} and {Multi-MCST} problems},
journal = joco,
year = {2011},
OPTkey = {},
volume = {21},
OPTnumber = {},
pages = {151--158},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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{CheGroGru2006,
AUTHOR = "Y. Chen and M. Grohe and M. Gr{\"u}ber",
TITLE = "On parameterized approximability",
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 = "109--120",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@article{CheFlu2008,
author = {Y. Chen and
J. Flum},
title = {The parameterized complexity of maximality and minimality
problems},
journal = apal,
volume = {151},
number = {1},
year = {2008},
pages = {22--61},
}
@inproceedings{CheFlu2012,
author = {Y. Chen and
J. Flum},
title = {A Parameterized Halting Problem},
booktitle = {The Multivariate Algorithmic Revolution and Beyond},
year = {2012},
pages = {364--397},
editor = {H. L. Bodlaender and
R. Downey and
F. V. Fomin and
D. Marx},
booktitle = {The Multivariate Algorithmic Revolution and Beyond -- Essays
Dedicated to Michael R. Fellows on the Occasion of His 60th
Birthday},
publisher = {Springer},
series = {LNCS},
volume = {7370},
}
@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{CheTanWan2009,
author = {Z.-Z. Chen and R. Tanahashi and L. Wang},
title = {An improved randomized approximation algorithm for maximum triangle packing},
journal = dam,
year = {2009},
OPTkey = {},
volume = {157},
OPTnumber = {},
pages = {1640--1646},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@Article{CheTanWan2010,
author = {Z.-Z. Chen and R. Tanahashi and L. Wang},
title = {Erratum to: An improved randomized approximation algorithm for maximum triangle packing},
journal = dam,
year = {2010},
OPTkey = {},
volume = {??},
OPTnumber = {},
pages = {??},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{CheSon2008,
author = {W. Chen and E. Song},
title = {Lower bounds on several versions of signed domination number},
journal = dm,
volume = {308},
number = {10},
year = {2008},
pages = {1837--1846},
}
@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 = ""
}
@article{CheNgYua2006,
title = "Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs",
journal = tcs,
volume = "362",
number = "1–3",
pages = "273--281",
year = "2006",
note = "",
author = "T.~C.~E. Cheng and C.~T. Ng and J.~J. Yuan",
}
@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 = ""
}
@InProceedings{Cheetal96,
author = {J. Cheriyan and W.~H. Cunningham and L. Tun\c{c}el and Y. Wang},
title = {A linear programming and
rounding approach to {Max-2-SAT}},
booktitle = {Cliques, Coloring, and Satisfiability},
OPTcrossref = {},
OPTkey = {},
pages = {395--414},
year = {1996},
editor = {D.~S. Johnson and M.~A. Trick},
volume = {26},
OPTnumber = {},
series = {DIMACS Series in Discrete Mathematics
and Theoretical Computer Science},
OPTaddress = {},
OPTmonth = {},
organization = {AMS},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}
@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{Cheetal2007c,
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{Cheetal2008c,
author = {J. Chevelu and N. Barbot and O. Boeffard and A. Delhay},
title = {Comparing set-covering strategies for optimal corpus design},
booktitle = {Proceedings of the 6th International Language Resources and Evaluation},
pages = {2951--2956},
year = {2008},
}
@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{ChiNisSai81,
AUTHOR = "N. Chiba and T. Nishizeki and N. Saito",
TITLE = "Applications of the Lipton and Tarjan's planar separator theorem",
JOURNAL = {J Information Proc.},
YEAR = 1981,
month = "",
volume = 4,
number = "",
pages = "203--207",
copy = ""
}
@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 = ""
}
@article{ChiKosLoh84,
title = "Efficient inference control for range Sum queries",
journal = tcs,
volume = "32",
number = "1–2",
pages = "77--86",
year = "1984",
author = "F.~Y. Chin and P. Kossowski and S.~C. Loh"
}
@article{ChiNta92,
author = {W.-P. Chin and
S. C. Ntafos},
title = {The zookeeper route problem},
journal = {Inf. Sci.},
volume = {63},
number = {3},
year = {1992},
pages = {245--259},
}
@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{ChlChl2006,
author = {M. Chleb\'\i{}k and J. Chleb\'\i{}kov\'a},
title = {Approximation hardness of edge dominating set problems},
journal = joco,
pages = {279--290},
volume = {11},
issue = {3},
year = {2006}
}
@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{ChlChl2008a,
author = {M. Chleb\'\i{}k and J. Chleb\'\i{}kov\'a},
title = {Approximation hardness of dominating set problems in bounded
degree graphs},
journal = ic,
volume = {206},
number = {11},
year = {2008},
pages = {1264--1275},
}
@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 hierarchy between {L} and {NL}",
JOURNAL = ipl,
YEAR = 1988,
month = "",
volume = 29,
number = "",
pages = "177--182",
copy = ""
}
@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 = ""
}
@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{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",
}
@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 = ""
}
@inproceedings{Choetal2010,
author = {C. Choffrut and
A. Malcher and
C. Mereghetti and
B. Palano},
title = {On the Expressive Power of {$\textrm{FO}[+]$}},
booktitle = {Language and Automata Theory and Applications, 4th International
Conference, LATA},
year = {2010},
pages = {190--201},
editor = {A. H. Dediu and
H. Fernau and
C. Mart\'{\i}n-Vide},
publisher = {Springer},
series = {LNCS},
volume = {6031},
}
@article{Choetal2012,
author = {C. Choffrut and
A. Malcher and
C. Mereghetti and
B. Palano},
title = {First-order logics: some characterizations and closure properties},
journal = actainform,
volume = {49},
number = {4},
year = {2012},
pages = {225--248},
}
@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{ChrBea84,
author = {N. Christofides and J. Beasley},
title = {The period routing system},
journal = {Networks},
year = {1984},
OPTkey = {},
volume = {14},
OPTnumber = {},
pages = {237--256},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@inproceedings{Chu98,
author = {F.~A. Chudak},
title = {Improved Approximation Algorithms for Uncapitated Facility
Location},
booktitle = {nteger Programming and Combinatorial Optimization, 6th
International IPCO Conference},
year = {1998},
pages = {180--194},
editor = {R. E. Bixby and
E. A. Boyd and
R. Z. R\'{\i}os-Mercado},
publisher = {Springer},
series = {LNCS},
volume = {1412},
}
@Article{Chuetal98,
author = {F.~A. Chudak and M. X. Goemans and D. S. Hochbaum and D. P. Williamson},
title = {A primal-dual interpretation of two 2-approximation algorithms
for the feedback vertex set problem in undirected graphs},
journal = {Operations Research Letters},
year = {1998},
OPTkey = {},
volume = {22},
OPTnumber = {},
pages = {111--118},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{ChuHoc99,
author = {F. A. Chudak and
D. S. Hochbaum},
title = {A half-integral linear programming relaxation for scheduling
precedence-constrained jobs on a single machine},
journal = {Operations Research Letters},
volume = {25},
number = {5},
year = {1999},
pages = {199--204},
}
@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{ChuSey89,
AUTHOR = "F.~R.~K. Chung and P.~D. Seymer",
TITLE = "Graphs with small bandwidth and cutwidth",
JOURNAL = dm,
YEAR = 1989,
month = "",
volume = 75,
number = "",
pages = "113--119",
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{ChuDiYun2011,
author = {C. Chunhua and
Y. Di and
L. Yun},
title = {Sub-classes of the monoid of left cancellative languages},
journal = ijcm,
volume = {88},
number = {8},
year = {2011},
pages = {1619--1628},
}
@InProceedings{ChuMakSid2011,
author = {J. Chuzhoy and
Y. Makarychev and A. Sidiropoulos},
title = {On graph crossing number and edge planarization},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms SODA},
pages = {1050--1069},
year = {2011},
editor = {D. Randall},
organization = {ACM and SIAM},
OPTpublisher = {},
OPTabstract = {},
}
@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 = ""
}
@Article{ChvCoo90,
author = {V. Chv{\'a}tal and W. Cook},
title = {The discipline number of a graph},
journal = dm,
year = {1990},
OPTkey = {},
volume = {86},
OPTnumber = {},
pages = {191--198},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {}
}
@inproceedings{Cicetal2011,
author = {F. Cicalese and
T. Jacobs and
E. Sany Laber and
C. Dias Valentim},
title = {Binary Identification Problems for Weighted Trees},
booktitle = {Algorithms and Data Structures --- 12th International Symposium, WADS},
year = {2011},
pages = {255--266},
editor = {F. Dehne and
J. Iacono and
J.-R. Sack},
publisher = {Springer},
series = {LNCS},
volume = {6844},
}
@inproceedings{CicMilVac2011,
author = {F. Cicalese and
M. Milanic and
U. Vaccaro},
title = {Hardness, Approximability, and Exact Algorithms for Vector
Domination and Total Vector Domination in Graphs},
booktitle = {Fundamentals of Computation Theory, FCT},
year = {2011},
pages = {288--297},
editor = {O. Owe and
M. Steffen and
J. A. Telle},
publisher = {Springer},
series = {LNCS},
volume = {6914},
}
@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 = ""
}
@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},
}
@INPROCEEDINGS{ClaEyr2006,
author = {A. Clark and R. Eyraud},
title = {Learning Auxiliary Fronting with Grammatical Inference},
booktitle = {Proceedings CoNLL 2006},
year = {2006},
pages = {125--132}
}
@Article{ClaEyr2007,
author = {A. Clark and R. Eyraud},
title = {Polynomial identification in the limit of context-free substitutable languages},
journal = {Journal of Machine Learning Research},
year = {2007},
volume = {8},
pages = {1725--1745},
}
@inproceedings{Cla2009,
author = {A. Clark},
title = {A Learnable Representation for Syntax Using Residuated Lattices},
booktitle = {Formal Grammar -- 14th International Conference,FG 2009},
pages = {183--198},
editor = {P. de Groote and
M. Egg and
L. Kallmeyer},
publisher = {Springer},
series = {LNCS},
volume = {5591},
year = {2011},
}
@InProceedings{Cla2010,
author = {A. Clark},
title = {Three learnable models for the description of language},
booktitle = {Language and Automata Theory and Applications LATA},
OPTcrossref = {},
OPTkey = {},
pages = {16--31},
year = {2010},
editor = {A.-H. Dediu and H. Fernau and C. Mart{\'i}n-Vide},
volume = {6031},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}
@inproceedings{Cla2010a,
author = {A. Clark},
title = {Learning Context Free Grammars with the Syntactic Concept
Lattice},
booktitle = {Grammatical Inference: Theoretical Results and Applications,
10th International Colloquium, ICGI},
year = {2010},
pages = {38--51},
editor = {J. M. Sempere and
P. Garc\'{\i}a},
publisher = {Springer},
series = {LNCS/LNAI},
volume = {6339},
}
@inproceedings{Cla2010b,
author = {A. Clark},
title = {Distributional Learning of Some Context-Free Languages with
a Minimally Adequate Teacher},
booktitle = {Grammatical Inference: Theoretical Results and Applications,
10th International Colloquium, ICGI},
year = {2010},
pages = {24-.37},
editor = {J. M. Sempere and
P. Garc\'{\i}a},
publisher = {Springer},
series = {LNCS/LNAI},
volume = {6339},
}´
@inproceedings{Cla2010c,
author = {A. Clark},
title = {Towards General Algorithms for Grammatical Inference},
booktitle = {Algorithmic Learning Theory, 21st International Conference, ALT},
year = {2010},
pages = {11--30},
editor = {M. Hutter and
F. Stephan and
V. Vovk and
T. Zeugmann},
publisher = {Springer},
series = {LNCS/LNAI},
volume = {6331},
}
@inproceedings{Cla2010d,
author = {A. Clark},
title = {Efficient, correct, unsupervised learning for context-sensitive languages},
booktitle = {Fourteenth Conference on Computational Natural Language Learning
, CoNLL},
year = {2010}, PAGES = {28--37},
ADDRESS = {Uppsala, Sweden},
ORGANIZATION = {Association for Computational Linguistics},
}
@Article{ClaEyr2010,
author = {A. Clark and R. Eyraud},
title = {Using Contextual Representations to Efficiently Learn Context-Free Languages},
journal = {Journal of Machine Learning Research},
year = {2007},
volume = {11},
pages = {2707--2744},
}
@inproceedings{Cla2011,
author = {A. Clark},
title = {A Language Theoretic Approach to Syntactic Structure},
booktitle = {he Mathematics of Language -- 12th Biennial Conference, MOL},
year = {2011},
pages = {39--56},
editor = {M. Kanazawa and
A. Kornai and
M. Kracht and
H. Seki},
publisher = {Springer},
series = {LNCS},
volume = {6878},
}
@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 = ""
}
@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{CleTre99,
title = "Improved non-approximability results for minimum vertex cover with density constraints",
journal = tcs,
volume = "225",
number = "1-2",
pages = "113--128",
year = "1999",
author = "A.~E.~F. Clementi and L. Trevisan",
}
@article{CleKen2002,
author = {M. Clerc and
J. Kennedy},
title = {The particle swarm --- explosion, stability, and convergence
in a multidimensional complex space},
journal = {IEEE Trans. Evolutionary Computation},
volume = {6},
number = {1},
year = {2002},
pages = {58--73},
}
@ARTICLE{CocGooHed75,
AUTHOR = "E.~J. Cockayne and S.~E. Goodman and S.~T. Hedetniemi",
TITLE = "A linear algorithm for the domination number of a tree",
JOURNAL = ipl,
YEAR = 1975,
month = "",
volume = 4,
number = "",
pages = "41--44",
copy = ""
}
@Article{CocHedMil78,
author = {E.~J. Cockayne and S.~T. Hedetniemi and D.~J. Miller},
title = {Properties of hereditary hypergraphs and middle graphs},
journal = {Canad. Math. Bull.},
year = {1978},
OPTkey = {},
volume = {21},
OPTnumber = {},
pages = {461--468},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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{CocHedLas88,
author = {E.~J. Cockayne and S. T. Hedetniemi and R. Laskar},
title = {Gallai theorems
for graphs,
hypergraphs
and set systems},
journal = dm,
year = {1988},
OPTkey = {},
volume = {72},
OPTnumber = {},
pages = {35--47},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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{Cocetal97,
author = {Cockayne, E. J. and Grobler, P. J. P. and Hedetniemi, S. T. and McRae, A. A.},
title = {What makes an irredundant set maximal?},
journal = {J. Combin. Math. Combin. Comput.},
year = {1997},
OPTkey = {},
volume = {25},
OPTnumber = {},
pages = {213--223},
}
@Article{Cocetal2008,
author = {Cockayne, E.~J. and O. Favaron and S. Finbow and C.~M. Mynhardt},
title = {Open irredundance and maximum degree in graphs},
journal = dm,
volume = "308",
number = "23",
pages = "5358--5375",
year = "2008",
}
@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 = ""
}
@article{CohTar91,
title = "{NP}-Completeness of graph decomposition problems",
journal = "Journal of Complexity",
volume = "7",
number = "2",
pages = "200 -- 212",
year = "1991",
author = "E. Cohen and M. Tarsi"
}
@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 = ""
}
@article{Cohetal2010,
author = {N. Cohen and
F. V. Fomin and
G. Gutin and
E. J. Kim and
S. Saurabh and
A. Yeo},
title = {Algorithm for finding $k$-vertex out-trees and its application
to $k$-internal out-branching problem},
journal = jcss,
volume = {76},
number = {7},
year = {2010},
pages = {650--662},
}
@TECHREPORT{CohCouLan2012,
AUTHOR = "N. Cohen and D. Coudert and A. Lancin",
TITLE = "Exact and approximate algorithms for
computing the hyperbolicity of large-scale
graphs",
INSTITUTION = "Research Centre
Sophia Antipolis",
YEAR = 2012,
month = "",
number = "8074",
address = "",
copy = ""
}
@article{CofGra72,
author = {E.~G. Coffman Jr. and
R. L. Graham},
title = {Optimal Scheduling for Two-Processor Systems},
journal = actainform,
volume = {1},
year = {1972},
pages = {200--213},
}
@inproceedings{ColPro84,
author = {C.~J. Colbourn and
A. Proskurowski},
title = {Concurrent Transmissions in Broadcast Networks},
booktitle = {Automata, Languages and Programming, 11th Colloquium, ICALP},
year = {1984},
pages = {128--136},
editor = {J. Paredaens},
publisher = {Springer},
series = {LNCS},
volume = {172},
}
@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{ConTor91,
AUTHOR = "L. Console and P. Torasso",
TITLE = "A spectrum of logical definitions of model-based diagnosis",
JOURNAL = {Computational Intelligence},
YEAR = 1991,
month = "",
volume = 7,
number = "",
pages = "133--141",
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")
@InCollection{Coo91,
author = {S.~A. Cook},
title = {Computability and complexity of higher type functions},
booktitle = {Logic From Computer Science},
OPTcrossref = {},
OPTkey = {},
pages = {51--72},
publisher = {Springer},
year = {1991},
editor = {Y.~N. Moschovakis},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
OPTchapter = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@inproceedings{CooKin9596,
author = {T.~B. Cooper and
J. H. Kingston},
title = {The Complexity of Timetable Construction Problems},
booktitle = {Practice and Theory of Automated Timetabling, First International
Conference, PATAT 1995},
pages = {283--295},
editor = {E. K. Burke and
P. Ross},
publisher = {Springer},
series = {LNCS},
volume = {1153},
year = {1996},
}
@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{Coretal2002,
AUTHOR = "L. P. Cordella and P. Foggia and C. Sansone and M. Vento",
TITLE = "Learning structural shape descriptions from examples",
JOURNAL = prl,
YEAR = 2002,
month = "",
volume = 23,
number = "",
pages = "1427--1437",
}
@ARTICLE{CorKei87,
AUTHOR = "D.~G. Corneil 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{CorOlaSte97,
author = {D.~G. Corneil and
S. Olariu and
L. Stewart},
title = {Asteroidal Triple-Free Graphs},
journal = siamdm,
volume = {10},
number = {3},
year = {1997},
pages = {399--430},
}
@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 = ""
}
@article{CorSzw2005,
author = {R. C. Corr{\^e}a and
J. L. Szwarcfiter},
title = {On extensions, linear extensions, upsets and downsets of
ordered sets},
journal = dm,
volume = {295},
number = {1-3},
year = {2005},
pages = {13--30},
}
@inproceedings{Coretal2007,
author = {J. R. Correa and
C. G. Fernandes and
M. Matamala and
Y. Wakabayashi},
title = {A 5/3-Approximation for Finding Spanning Trees with Many
Leaves in Cubic Graphs},
booktitle = {Approximation and Online Algorithms, 5th International Workshop, WAOA},
pages = {184--192},
editor = {C. Kaklamanis and
M. Skutella},
publisher = {Springer},
series = {LNCS},
volume = {4927},
year = {2008},
}
@Article{CorHafMoh2004,
author = {C. Cortes and P. Haffner and M. Mohri},
title = {Rational kernels: theory and algorithms},
journal = {Journal of Machine Learning Research},
year = {2004},
OPTkey = {},
OPTvolume = {5},
OPTnumber = {},
pages = {1035--1062},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {}
}
@InCollection{CorHafMoh2008,
author = {C. Cortes and P. Haffner and M. Mohri},
title = {A machine learning framework for spoken-dialog classification},
booktitle = {Handbook on Speech Processing and Speech Communication, Part E: Speech recognition},
publisher = {Springer},
year = {2008},
editor = {L. Rabiner and F. Juang},
}
@inproceedings{Cosetal2011,
author = {M. Costa Dourado and
L. Draque Penso and
D. Rautenbach and
J. L. Szwarcfiter},
title = {The South Zone: Distributed Algorithms for Alliances},
year = {2011},
pages = {178--192},
editor = {X. D{\'e}fago and
F. Petit and
V. Villain},
booktitle = {Stabilization, Safety, and Security of Distributed Systems
--- 13th International Symposium, SSS},
publisher = {Springer},
series = {LNCS},
volume = {6976},
}
@inproceedings{Cos99,
author = {Costa Flor{\^e}ncio, C.},
title = {Consistent identification in the limit of some of {P}enn and
{B}uszkowski's classes is {NP}-hard},
booktitle = {Computational Linguistics in the Netherlands CLIN 1999, Selected
Papers},
year = {1999},
editor = {P, Monachesi},
publisher = {UILOTS Utrecht},
}
@INPROCEEDINGS{Cos2000,
AUTHOR = "Costa Flor{\^e}ncio, C.",
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{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{Cos2001,
author = {Costa Flor{\^e}ncio, C.},
title = {Consistent Identification in the Limit of Any of the Classes
$k$-Valued Is {NP}-hard},
year = {2001},
pages = {125--138},
editor = {P. de Groote and
G. Morrill and
C. Retor{\'e}},
booktitle = {Logical Aspects of Computational Linguistics, 4th International
Conference, LACL 2001},
publisher = {Springer},
series = {LNCS},
volume = {2099},
}
@inproceedings{Cos2002a,
author = {Costa Flor{\^e}ncio, C.},
title = {Consistent Identification in the Limit of Rigid Grammars
from Strings Is {NP}-hard},
crossref = "ICGI2002",
pages = {49--62},
}
@PhdThesis{Cos2003,
author = {Costa Flor\^encio, C.},
title = {Learning Categorial Grammars},
school = {Universiteit Utrecht, The Netherlands},
year = {2003},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@inproceedings{Cos2003a,
author = {Costa Flor{\^e}ncio, C.},
title = {Rigid grammars in the Associative-Commutative {L}ambek Calculus
are not learnable},
booktitle = {11th Conference of the European Chapter
of the Association for Computational Linguistics EACL},
year = {2003},
pages = {75--82},
}
@InProceedings{CosFer2010,
author = {Costa Flor{\^e}ncio, C. and H. Fernau},
title = {Finding consistent categorial grammars of bounded value: a parameterized approach},
booktitle = {Language and Automata Theory and Applications LATA},
pages = {202--213},
year = {2010},
editor = {A.-H. Dediu and H. Fernau and C. Mart\'in-Vide},
volume = {6031},
series = {LNCS},
publisher = {Springer},
}
@InProceedings{CosFer2010a,
author = {Costa Flor{\^e}ncio, C. and H. Fernau},
title = {H\"older Norms and a Hierarchy Theorem for
Parameterized Classes of {CCG}},
booktitle = {International Colloquium on Grammatical Inference ICGI},
pages = {280--283},
year = {2010},
editor = {J. M. Sempere and P. Garc\'ia},
volume = {6339},
series = {LNCS},
publisher = {Springer},
}
@InProceedings{Cos2012,
author = {Costa Flor{\^e}ncio, C.},
title = {Learning Tree Adjoining Grammars from Structures and Strings},
booktitle = {Proceedings of the Eleventh International Conference on Grammatical Inference, ICGI},
pages = {129--132},
year = {2012},
editor = {J. Heinz and C. de la Higuera and T. Oates},
volume = {21},
OPTnumber = {},
series = {JMLR Workshop and Conference Proceedings},
organization = {Journal of Machine Learning Research},
}
@Article{CosFer2012,
author = {Costa Flor{\^e}ncio, C. and H. Fernau},
title = {On families of categorial grammars of bounded value, their learnability and related complexity questions},
journal = tcs,
year = {2012},
volume = {452},
pages = {21--38},
}
@INPROCEEDINGS{CosVer2012,
AUTHOR = "Costa Flor{\^e}ncio, C. and S. Verwer",
TITLE = "Regular inference
as vertex coloring",
BOOKTITLE = "Algorithmic Learning Theory ALT",
YEAR = 2012,
month = "",
volume = "7568",
editor = "N.~H. Bshouty and
G. Stoltz and
N. Vayatis and
T. Zeugmann",
series = "LNCS/LNAI",
chapter = "",
pages = "81--95",
address = "",
organization = "",
copy = "", publisher = {Springer},
}
@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 = "",
copy = ""
}
@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 = ""
}
@InProceedings{CosShaTet2011,
author = {K.~P. Costello and A. Shapira and P. Tetali},
title = {Randomized greedy: new variants of some classic approximation algorithms},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms SODA},
pages = {647--655},
year = {2011},
editor = {D. Randall},
organization = {ACM and SIAM},
OPTpublisher = {},
OPTabstract = {},
}
@inproceedings{Cotetal2008,
author = {L. Cottret and
P. Vieira Milreu and
V. Acu{\~n}a and
A. Marchetti-Spaccamela and
F. Viduani Martinez and
M.-F. Sagot and
L. Stougie},
title = {Enumerating Precursor Sets of Target Metabolites in a Metabolic
Network},
booktitle = {Algorithms in Bioinformatics, 8th International Workshop, WABI},
year = {2008},
pages = {233--244},
editor = {K. A. Crandall and
J. Lagergren},
series = {LNCS},
volume = {5251},
year = {2008},
}
@ARTICLE{CotMos03a,
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{CotMos03b,
AUTHOR = "C. Cotta and P. Moscato",
TITLE = "A memetic-aided approach to hierarchical clustering from distance matrices: application to gene expression clustering and phylogeny",
JOURNAL = "Biosystems",
YEAR = 2003,
month = "",
volume = 72,
number = "",
pages = "75--97",
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{CouNiwPod91,
author = {B. Courcelle and
D. Niwinski and
A. Podelski},
title = {A Geometrical View of the Determinization and Minimization
of Finite-State Automata},
journal = mst,
volume = {24},
number = {2},
year = {1991},
pages = {117--146},
}
@inproceedings{CouLap98,
author = {B. Courcelle and
D. Lapoire},
title = {Facial Circuits of Planar Graphs and Context-Free Languages},
booktitle = {Mathematical Foundations of Computer Science MFCS},
year = {1998},
pages = {616--624},
editor = {L. Brim and
J. Gruska and
J. Zlatuska},
publisher = {Springer},
series = {LNCS},
volume = {1450},
}
@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{CouMakRot2000a,
AUTHOR = "B. Courcelle and J. Makowsky and U. Rotics",
TITLE = "Linear time solvable optimization problems on certain structured graph families",
JOURNAL = tocs,
YEAR = 2000,
month = "",
volume = {},
number = "{}",
pages = "125--150",
copy = ""
}
@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 = ""
}
@article{CouKra2012,
author = {J.-F. Couturier and
D. Kratsch},
title = {Bicolored independent sets and bicliques},
journal = ipl,
volume = {112},
number = {8-9},
year = {2012},
pages = {329--334},
}
@PhdThesis{Cou2012,
author = {J.-F. Couturier},
title = {Algorithmes exacts et exponentiels
sur les graphes :
\'enum\'eration, comptage et optimisation},
school = {Universit\'e de Lorraine, Metz, France},
year = {2012},
}
@inproceedings{Couetal2012,
author = {J.-F. Couturier and
P. Heggernes and
P. van 't Hof and D. Kratsch},
title = {Minimal Dominating Sets in Graph Classes: Combinatorial
Bounds and Enumeration},
booktitle = {Theory and Practice of Computer Science --- 38th
Conference on Current Trends in Theory and Practice of Computer
Science, SOFSEM},
year = {2012},
pages = {202--213},
editor = {M. Bielikov{\'a} and
G. Friedrich and
G. Gottlob and
S. Katzenbeisser and
G. Tur{\'a}n},
publisher = {Springer},
series = {LNCS},
volume = {7147},
}
@inproceedings{Couetal2012a,
author = {J.-F. Couturier and
P. Heggernes and
P. van 't Hof and
Y. Villanger},
title = {Maximum Number of Minimal Feedback Vertex Sets in Chordal
Graphs and Cographs},
booktitle = {Computing and Combinatorics --- 18th Annual International
Conference, COCOON},
year = {2012},
pages = {133--144},
editor = {J. Gudmundsson and
J. Mestre and
T. Viglas},
publisher = {Springer},
series = {LNCS},
volume = {7434},
}
@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 = ""
}
@INPROCEEDINGS{Cre71,
AUTHOR = "S. Crespi-Reghizzi",
TITLE = "An effective model for grammatical inference",
BOOKTITLE = "Information Processing 71, Proc. IFIP Congress, Vol. 1",
YEAR = 1971,
month = "",
volume = "",
editor = "C. V. Freiman",
series = "",
chapter = "",
pages = "524--529",
address = "",
organization = "", publisher ={North-Holland, 1972},
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{CreSilTre2001,
title = "On Weighted vs Unweighted Versions of Combinatorial Optimization Problems",
journal = ic,
volume = "167",
number = "1",
pages = "10--26",
year = "2001",
author = "P. Crescenzi and R. Silvestri and L. Trevisan"
}
@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},
}
@article{Crietal90,
author = {C. Crimi and A. Guercio and G. Pacini and G. Tortora and M. Tucci},
title = {Automating Visual Language Generation},
journal ={IEEE Transactions on Software Engineering},
volume = {16},
number = {10},
year = {1990},
pages = {1122--1135},
}
@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 = ""
}
@inproceedings{CroJonMni2012,
author = {Crowston, R. and Jones, M. and Mnich, M.},
title = {Max-{C}ut Parameterized above the {E}dwards-{E}rd\H{o}s Bound},
booktitle = {International Colloquium on Automata, Languages, and Programming, ICALP I},
series = {LNCS},
editor = {Czumaj, A. and Mehlhorn, K. and Pitts, A. and Wattenhofer, R.},
publisher = {Springer},
pages = {242--253},
volume = {7391},
year = {2012}
}
@inproceedings{Croetal2012,
author = {R. Crowston and
G. Gutin and
M. Jones and
S. Saurabh and
A. Yeo},
title = {Parameterized Study of the Test Cover Problem},
pages = {283--295},
ee = {http://dx.doi.org/10.1007/978-3-642-32589-2_27},
crossref = {DBLP:conf/mfcs/2012},
}
@article{Croetal2012a,
author = {R. Crowston and
G. Gutin and
M. Jones and
G. Muciaccia and
A. Yeo},
title = {Parameterizations of Test Cover with Bounded Test Sizes},
journal = {CoRR},
volume = {abs/1209.6528},
year = {2012},
}
@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{CrvDolEsi99,
author = {S. Crvenkovi\'c and I. Dolinka and Z. \'Esik},
title = {A note on equations for commutative regular languages},
journal = ipl,
year = {1999},
OPTkey = {},
volume = {70},
OPTnumber = {},
pages = {265--267},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 ="L. Hunter and T. 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 = ""
}
@inproceedings{CsuMitVas2003,
author = {E. Csuhaj-Varj{\'u} and
V. Mitrana and
Gy. Vaszil},
title = {Distributed Pushdown Automata Systems: Computational Power},
booktitle = {Developments in Language Theory DLT},
year = {2003},
pages = {218--229},
editor = {Z. {\'E}sik and
Z. F{\"u}l{\"o}p},
publisher = {Springer},
series = {LNCS},
volume = {2710},
}
@article{CsuDasVas2010,
author = {E. Csuhaj-Varj{\'u} and
J. Dassow and
Gy. Vaszil},
title = {Variants of Competence-Based Derivations in {CD} Grammar Systems},
journal = ijfcs,
volume = {21},
number = {4},
year = {2010},
pages = {549--569},
}
@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 = ""
}
@techreport{Cul2003,
author = {A. Culotta},
title = {Maximizing cascades in social networks},
institution = {University of Massachusetts. USA},
year = {2003},
url = {http://www.cs.umass.edu/\~culotta/pubs/culotta03maximizing.pdf},
}
@Article{CygKowWyk2009,
author = {M. Cygan and \L. Kowalik and M. Wykurz},
title = {Exponential-time approximation of weighted set cover},
journal = ipl,
year = {2009},
OPTkey = {},
volume = {109},
OPTnumber = {},
pages = {957--961},
}
@article{CygPil2010,
author = {M. Cygan and
M. Pilipczuk},
title = {Exact and approximate bandwidth},
journal = tcs,
volume = {411},
number = {40-42},
year = {2010},
pages = {3701--3713},
}
@inproceedings{CygPilWoj2010,
author = {M. Cygan and
M. Pilipczuk and
J. O. Wojtaszczyk},
title = {Irredundant Set Faster Than $2^n$},
pages = {288--298},
editor = {T. Calamoneri and
J. D\'{\i}az},
booktitle = {Algorithms and Complexity CIAC},
publisher = {Springer},
series = {LNCS},
volume = {6078},
year = {2010},
}
@article{Cygetal2011,
author = {M. Cygan and
G. Philip and
M. Pilipczuk and
M. Pilipczuk and
J. O. Wojtaszczyk},
title = {Dominating set is fixed parameter tractable in claw-free
graphs},
journal = tcs,
volume = {412},
number = {50},
year = {2011},
pages = {6982--7000},
}
@inproceedings{Cyg2012,
author = {M. Cygan},
title = {Deterministic Parameterized Connected Vertex Cover},
booktitle = {Algorithm Theory -- SWAT 2012 -- 13th Scandinavian Symposium
and Workshops},
year = {2012},
pages = {95--106},
editor = {F. V. Fomin and
P. Kaski},
publisher = {Springer},
series = {LNCS},
volume = {7357},
}
@inproceedings{Cygetal2012,
author = {M. Cygan and
S. Kratsch and
M. Pilipczuk and
M. Pilipczuk and
M. Wahlstr{\"o}m},
title = {Clique Cover and Graph Separation: New Incompressibility
Results},
booktitle = {Automata, Languages, and Programming -- 39th International
Colloquium, ICALP (1)},
year = {2012},
pages = {254--265},
editor = {A. Czumaj and
K. Mehlhorn and
A. M. Pitts and
R. Wattenhofer},
publisher = {Springer},
series = {LNCS},
volume = {7391},
}
@inproceedings{Cygetal2012a,
author = {M. Cygan and
M. Pilipczuk and
M. Pilipczuk and
J.~O. Wojtaszczyk},
title = {Sitting Closer to Friends Than Enemies, Revisited},
pages = {296-307},
ee = {http://dx.doi.org/10.1007/978-3-642-32589-2_28},
crossref = {DBLP:conf/mfcs/2012},
}
@inproceedings{Cygetal2012b,
author = {M. Cygan and
H. Dell and
D. Lokshtanov and
D. Marx and
J. Nederlof and
Y. Okamoto and
R. Paturi and
S. Saurabh and
M. Wahlstr{\"o}m},
title = {On Problems as Hard as {CNF}-{SAT}},
booktitle = {IEEE Conference on Computational Complexity CCC},
year = {2012},
pages = {74--84},
publisher = {IEEE},
}
@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 = ""
}
@article{CzyKraUrr98,
author = {J. Czyzowicz and
E. Kranakis and
J. Urrutia},
title = {A Simple Proof of the Representation of Bipartite Planar
Graphs as the Contact Graphs of Orthogonal Straight Line
Segments},
journal = ipl,
volume = {66},
number = {3},
year = {1998},
pages = {125--126},
}
DDD
@inproceedings{Dabetal1011,
author = {K. Dabrowski and
V. V. Lozin and
H. M{\"u}ller and
D. Rautenbach},
title = {Parameterized Algorithms for the Independent Set Problem
in Some Hereditary Graph Classes},
booktitle = {Combinatorial Algorithms --- 21st International Workshop,
IWOCA 2010},
pages = {337--348},
editor = {C. S. Iliopoulos and
W. F. Smyth},
publisher = {Springer},
series = {LNCS},
volume = {6460},
year = {2011},
}
@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{DahKar98,
author = {E. Dahlhaus and
M. Karpinski},
title = {Matching and Multidimensional Matching in Chordal and Strongly
Chordal Graphs},
journal = dam,
volume = {84},
year = {1998},
pages = {79--91},
}
@article{DahRauVol2008,
title = "$\alpha$-Domination perfect trees",
journal = dm,
volume = "308",
number = "15",
pages = "3187--3198",
year = "2008",
author = "F. Dahme and D. Rautenbach and L. Volkmann",
}
@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{DalSmi86,
AUTHOR = "R. Daley and C. Smith",
TITLE = "On the complexity of inductive inference",
JOURNAL = icalt,
YEAR = 1986,
month = "",
volume = 69,
number = "",
pages = "12--40",
copy = ""
}
@incollection {Dal87,
author = {Daley, R.},
title = {Towards the development of an analysis of learning algorithms},
booktitle = {Analogical and Inductive Inference},
series = {LNCS},
editor = {Jantke, K.},
publisher = {Springer},
pages = {1--18},
volume = {265},
year = {1987}
}
@TechReport{Daletal2008,
author = {J. Daligault and G. Gutin and E. Jung Kim and A. Yeo},
title = {{FPT} algorithms and kernels for the {D}irected $k$-{L}eaf {P}roblem},
institution = {ArXiv/CoRR},
year = {2008},
OPTkey = {},
OPTtype = {},
number = {0810.4946v2},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@TechReport{DalTho2009,
author = {J. Daligault and
S. Thomass{\'e}},
title = {On Finding Directed Trees with Many Leaves},
institution = {ArXiv/CoRR},
number = {abs/0904.2658},
year = {2009},
}
@inproceedings{DalTho2009a,
author = {J. Daligault and
S. Thomass{\'e}},
title = {On Finding Directed Trees with Many Leaves},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, IWPEC},
year = {2009},
pages = {86--97},
editor = {J. Chen and
F. V. Fomin},
publisher = {Springer},
series = {LNCS},
volume = {5917},
}
@article{Daletal2010,
author = {J. Daligault and
G. Gutin and
E. J. Kim and
A. Yeo},
title = {{FPT} algorithms and kernels for the Directed $k$-Leaf problem},
journal = jcss,
volume = {76},
number = {2},
year = {2010},
pages = {144--152},
}
@PhdThesis{Dal2011,
author = {J. Daligault},
title = {Combinatorial Techniques for Parameterized Algorithms and Kernels,
with Applications to Multicut},
school = {Universi\'e Montpellier II, France},
year = {2011},
}
@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 = ""
}
@article{Dam2001,
author = {P. Damaschke},
title = {Minus domination in small-degree graphs},
journal = dam,
volume = {108},
number = {1-2},
year = {2001},
pages = {53--64},
}
@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{Dam2009,
author = {P. Damaschke},
title = {Multiple hypernode hitting sets and smallest two-cores with
targets},
journal = joco,
volume = {18},
number = {3},
year = {2009},
pages = {294--306},
}
@article{Dam2011,
author = {P. Damaschke},
title = {Parameterized algorithms for double hypergraph dualization
with rank limitation and maximum minimal vertex cover},
journal = {Discrete Optimization},
volume = {8},
number = {1},
year = {2011},
pages = {18--24},
}
@inproceedings{DamMol2011,
author = {P. Damaschke and L. Molokov},
title = {Parameterized Reductions and Algorithms for Another Vertex
Cover Generalization},
pages = {279--289},
booktitle = {Algorithms and Data Structures --- 12th International Symposium, WADS},
year = {2011},
editor = {F. Dehne and
J. Iacono and
J.-R. Sack},
publisher = {Springer},
series = {LNCS},
volume = {6844},
}
@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{Danetal2002,
author = {E. Dantsin and
M. Gavrilovich and
E. A. Hirsch and
B. Konev},
title = {{MAX SAT} approximation beyond the limits of polynomial-time
approximation},
journal = apal,
volume = {113},
year = {2002},
pages = {81--94},
}
@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},
}
@inproceedings{DasMatMoz1011,
author = {A. Das and
C. Mathieu and
S. Mozes},
title = {The Train Delivery Problem --- Vehicle Routing Meets Bin Packing},
booktitle = {Approximation and Online Algorithms - 8th International
Workshop, WAOA 2010},
pages = {94--105},
editor = {K. Jansen and
R. Solis-Oba},
publisher = {Springer},
series = {LNCS},
volume = {6534},
year = {2011},
}
@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{DasFer2008,
author = {J. Dassow and H. Fernau},
title = {Comparison of some descriptional complexities of {0L} systems
obtained by a unifying approach},
journal = ic,
year = {2008},
OPTkey = {},
volume = {206},
OPTnumber = {},
pages = {1095--1103},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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{DasMit99,
title = "Stack Cooperation in Multistack Pushdown Automata",
journal = jcss,
volume = "58",
number = "3",
pages = "611--621",
year = "1999",
author = "J. Dassow and V. Mitrana"
}
@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{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 = ""
}
@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{DasPauSal93a,
author = {J. Dassow and
G. Paun and
A. Salomaa},
title = {Grammars Based on Patterns},
journal = ijfcs,
volume = {4},
number = {1},
year = {1993},
pages = {1--14},
}
@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 = ""
}
@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
M. 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{Das2007,
author = {J. Dassow},
title = {On Cooperating Distributed Grammar Systems with Competence
Based Start and Stop Conditions},
journal = fundinform,
volume = {76},
number = {3},
year = {2007},
pages = {293--304},
}
@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 T. Jiang and S. Kannan and M. Li and E. Sweedyk",
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 = ""
}
@inproceedings{DawKre2009,
author = {A. Dawar and
S. Kreutzer},
title = {Domination Problems in Nowhere-Dense Classes},
booktitle = {IARCS Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, FSTTCS},
year = {2009},
pages = {157--168},
editor = {R. Kannan and
K. Narayan Kumar},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
series = {LIPIcs},
volume = {4},
}
@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 = ""
}
@proceedings{DedFerMar2010,
editor = {A.~H. Dediu and
H. Fernau and
C. Mart\'{\i}n-Vide},
title = {Language and Automata Theory and Applications, 4th International
Conference, LATA 2010, Trier, Germany, May 24-28, 2010.
Proceedings},
booktitle = {LATA},
publisher = {Springer},
series = {LNCS},
volume = {6031},
year = {2010},
}
@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 = ""
}
@INPROCEEDINGS{Dehetal2006a,
AUTHOR = "F. Dehne and and Langston, M. and Luo, X. and Pitre, S. and Shaw, P. and Zhang, Y.",
title = {The Cluster Editing Problem: Implementations and Experiments},
booktitle = {Parameterized and Exact Computation IWPEC},
series = {LNCS},
editor = {Bodlaender, H. and Langston, M.},
publisher = {Springer},
pages = {13--24},
volume = {4169},
year = {2006}
}
@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{DejSch66,
title = "On a question of {E}ggan",
journal = icalt,
volume = "9",
number = "1",
pages = "23--25",
year = "1966",
author = "F. Dejean and M.~P. Sch{\"u}tzenberger"
}
@Article{DekBeeThi90,
author = {R. Dekker and F. Beenker and L. Thijssen},
title = {A realistic fault model and test algorithm for static random access memories},
journal = {IEEE Trans. on Computers CAD},
year = {1990},
OPTkey = {},
volume = {C9},
OPTnumber = {},
pages = {567--572},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = ""
}
@InProceedings{DelMor2004,
author = {M. Delgado and J. Morais},
title = {Approximation to the Smallest Regular
Expression for a Given Regular Language},
booktitle = {CIAA 2004},
OPTcrossref = {},
OPTkey = {},
pages = {312–-314},
year = {2005},
editor = {M. Domaratzki and others},
volume = {3317},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {}
}
@inproceedings{Deletal2010,
author = {O. Delgado-Mohatar and
J. M. Sierra and
L. Brankovic and
A. F{\'u}ster-Sabater},
title = {An Energy-Efficient Symmetric Cryptography Based Authentication
Scheme for Wireless Sensor Networks},
booktitle = {Information Security Theory and Practices. Security and
Privacy of Pervasive Systems and Smart Devices, WISTP},
year = {2010},
pages = {332--339},
editor = {P. Samarati and
M. Tunstall and
J. Posegga and
K. Markantonakis and
D. Sauveron},
publisher = {Springer},
series = {LNCS},
volume = {6033},
}
@article{DelWan2010,
author = {D. Delic and
C. Wang},
title = {Upper signed $k$-domination in a general graph},
journal = ipl,
volume = {110},
number = {16},
year = {2010},
pages = {662--665},
}
@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{DelMel2010,
author = {H. Dell and
D. van Melkebeek},
title = {Satisfiability allows no nontrivial sparsification unless
the polynomial-time hierarchy collapses},
booktitle = {ACM Symposium on Theory of Computing,
STOC 2010},
year = {2010},
pages = {251--260},
editor = {L. J. Schulman},
publisher = {ACM},
}
@inproceedings{DelMar2012,
author = {H. Dell and
D. Marx},
title = {Kernelization of packing problems},
booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium
on Discrete Algorithms, SODA},
year = {2012},
pages = {68--81},
editor = {Y. Rabani},
publisher = {SIAM},
year = {2012},
}
@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 = ""
}
@ARTICLE{Demetal2005,
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",
JOURNAL = jacm,
YEAR = 2005,
month = "",
volume = 52,
number = "6",
pages = "866--893",
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{DemHaj2008,
AUTHOR = "E.~D. Demaine and M. Hajiaghayi",
TITLE = "The Bidimensionality Theory and Its Algorithmic Applications",
JOURNAL = "The Computer Journal",
YEAR = 2008,
month = "",
volume = 51,
number = "3",
pages = "292--302",
copy = ""
}
@InCollection{DemHea2009,
author = {E.~D. Demaine and R.~A. Hearn},
title = {Playing Games with Algorithms: Algorithmic Combinatorial Game Theory},
booktitle = {Games of No Chance 3},
pages = {3--56},
publisher = {Cambridge University Press},
year = {2009},
editor = {M. H. Albert and R. J. Nowakowski},
volume = {56},
series = {Mathematical Sciences Research Institute Publications},
}
@inproceedings{DemHajMar2009,
author = {E.~D. Demaine and
M. Hajiaghayi and
D. Marx},
title = {Minimizing Movement: Fixed-Parameter Tractability},
booktitle = {Algorithms -- ESA 2009, 17th Annual European Symposium},
year = {2009},
pages = {718--729},
editor = {A. Fiat and
P. Sanders},
publisher = {Springer},
series = {LNCS},
volume = {5757},
}
@Article{Demetal2009,
author = {E.~D. Demaine and
M. Hajiaghayi and H. Mahini and A. S. Sayedi-Roshkhar and S. Oveisgharan and M. Zadimoghaddam},
title = {Minimizing Movement},
journal = {ACM Transactions on Algorithms},
year = {2009},
OPTkey = {},
volume = {5},
number = {3},
OPTpages = {},
OPTmonth = {},
note = {Article 30},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@inproceedings{Demetal2010,
author = {E.~D. Demaine and
M.~L. Demaine and
R. Uehara and
T. Uno and
Y. Uno},
title = {{UNO} Is Hard, Even for a Single Player},
booktitle = {Fun with Algorithms, 5th International Conference, FUN},
year = {2010},
pages = {133--144},
editor = {P. Boldi and
L. Gargano},
publisher = {Springer},
series = {LNCS},
volume = {6099},
}
@inproceedings{Demetal2011,
author = {E.~D. Demaine and
S. Eisenstat and
J. Shallit and
D.~A. Wilson},
title = {Remarks on Separating Words},
pages = {147--157},
booktitle = {Descriptional Complexity of Formal Systems, DCFS},
year = {2011},
editor = {M. Holzer and
M. Kutrib and
G. Pighizzini},
publisher = {Springer},
series = {LNCS},
volume = {6808},
}
@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 = ""
}
@Article{DenKirThi97,
author = {N.~D. Dendris and L.~M. Kirousis and D.~M. Thilikos},
title = {Fugitive-search games on graphs and related parameters},
journal = tcs,
year = {1997},
volume = {172},
pages = {233--254},
}
@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 = ""
}
@InCollection{DeoKum97,
author = {Deo, N. and N. Kumar},
title = {Computation of Constrained Spanning Trees: A Unified
Approach},
booktitle = {Network Optimization},
OPTcrossref = {},
OPTkey = {},
pages = {194--220},
publisher = {Springer-Verlag},
year = {1997},
editor = {P. M. Pardalos and others},
OPTvolume = {},
OPTnumber = {},
series = {Lecture Notes in Economics and Mathematical
Systems},
}
@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 = ""
}
@article{DerKri2004,
author = {K.~S. Dersanambika and
K. Krithivasan},
title = {Contextual array {P} systems},
journal = ijcm,
volume = {81},
number = {8},
year = {2004},
pages = {955--969},
}
@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{DiaFigSzw2005,
author = {V. M. F. Dias and
C. M. Herrera de Figueiredo and
J. L. Szwarcfiter},
title = {Generating bicliques of a graph in lexicographic order},
journal = tcs,
volume = {337},
number = {1-3},
year = {2005},
pages = {240--248},
}
@article{DiaFigSzw2007,
author = {V. M. F. Dias and
C. M. Herrera de Figueiredo and
J. L. Szwarcfiter},
title = {On the generation of bicliques of a graph},
journal = dam,
volume = {155},
number = {14},
year = {2007},
pages = {1826--1832},
}
@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 = ""
}
@inproceedings{DiaPetThi2006,
author = {J. D\'{\i}az and
J. Petit and
D. M. Thilikos},
title = {Kernels for the Vertex Cover Problem on the Preferred Attachment
Model},
booktitle = {Experimental Algorithms, 5th International Workshop, WEA},
pages = {231--240},
editor = {C. {\`A}lvarez and
M. J. Serna},
publisher = {Springer},
series = {LNCS},
volume = {4007},
year = {2006},
}
@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{Dieetal2012,
author = {V. Diekert and M. Kufleitner and K. Reinhardt and T. Walter},
title = {Regular Languages Are {C}hurch-{R}osser Congruential},
booktitle = {International Colloquium on Automata, Languages, and Programming, ICALP II},
series = {LNCS},
editor = {Czumaj, A. and Mehlhorn, K. and Pitts, A. and Wattenhofer, R.},
publisher = {Springer},
pages = {177--188},
volume = {7392},
year = {2012}
}
@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 ="M. Dietzfelbinger and J. Hromkovi{\v{c}} and G.
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 ="M. Dietzfelbinger and M. Kuty{\l}owski and
R. 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 = ""
}
@TechReport{Dil87,
author = {J.~M. Dill},
title = {Optimal trie compaction is {NP}-complete},
institution = {Cornell University, Dept. of Computer Science},
year = {1987},
OPTkey = {},
OPTtype = {},
number = {87-814},
OPTaddress = {},
month = mar,
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@article{DilEppHir2000,
author = {M. B. Dillencourt and
D. Eppstein and
D. S. Hirschberg},
title = {Geometric Thickness of Complete Graphs},
journal = jgaa,
volume = {4},
number = {3},
year = {2000},
pages = {5--17},
}
@INPROCEEDINGS{DimPhiSid00,
AUTHOR = "P. Dimitrov and C. Phillips and K. Siddiqi",
TITLE = "Robust and efficient skeletal graphs",
BOOKTITLE = "Conference on Computer Vision and Pattern Recognition CVPR 2000",
YEAR = 2000,
month = "",
volume = "1",
editor = "",
series = "",
chapter = "",
pages = "417--423",
address = "",
organization = "",
publisher = "IEEE",
}
@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 = ""
}
@InCollection{DinNguTha2013,
author = {T.~N. Dinh and D. T. Nguyen and M. T. Thai},
title = {A Unified Approach for Domination Problems on Different Network Topologies},
booktitle = {Handbook of Combinatorial Optimization, Supplement C},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
publisher = {Springer},
year = {2013},
editor = {P. Pardalos and D. Du and R. Graham},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
OPTchapter = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@Article{Dinetal2012,
author = {T.~N. Dinh and
Y. Xuan and M. T. Thai and P. M. Pardalos},
title = {On New Approaches of Assessing Network Vulnerability: Hardness and Approximation},
journal = {IEEE / ACM Transactions on Networking},
year = {2012},
OPTkey = {},
volume = {To appear},
OPTnumber = {},
OPTpages = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@Article{Dinetal2013,
author = {T.~N. Dinh and
Y. Shen and
D.~T. Nguyen and
My T. Thai },
title = {On the approximability of positive influence dominating set in social networks},
journal = joco,
year = {2013},
OPTkey = {},
volume = {To appear},
OPTnumber = {},
OPTpages = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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{DinSaf02,
AUTHOR = "I. Dinur and S. Safra",
title = {The importance of being biased},
booktitle = {Proceedings on 34th Annual ACM Symposium on Theory of Computing, STOC},
year = {2002},
pages = {33--42},
editor = {J. H. Reif},
publisher = {ACM Press},
}
@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"}
@article{Dinetal2905,
author = {I. Dinur and
V. Guruswami and
S. Khot and
O. Regev},
title = {A New Multilayered {PCP} and the Hardness of Hypergraph Vertex
Cover},
journal = siam,
volume = {34},
number = {5},
year = {2005},
pages = {1129--1146},
}
@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{DobVon2012,
author = {S. Dobzinski and
J. Vondr{\'a}k},
title = {From query complexity to computational complexity},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing
Conference, STOC},
year = {2012},
pages = {1107--1116},
editor = {H. J. Karloff and
T. Pitassi},
publisher = {ACM},
}
@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 = {}
}
@inproceedings{DowWin2012,
author = {B. Doerr and
C. Winzen},
title = {Playing Mastermind With Constant-Size Memory},
pages = {441--452},
booktitle = {29th International Symposium on Theoretical Aspects of Computer
Science, STACS},
year = {2012},
editor = {C. D{\"u}rr and
T. Wilke},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
series = {LIPIcs},
volume = {14},
}
@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 {Dometal2006a,
author = {M. Dom and J. Guo and F. H\"uffner and R. Niedermeier},
title = {Error Compensation in Leaf Power Problems},
journal = alg,
pages = {363--381},
volume = {44},
issue = {4},
year = {2006}
}
@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 = {}
}
@inproceedings{Dometal2008a,
author = {M. Dom and
D. Lokshtanov and
S. Saurabh and
Y. Villanger},
title = {Capacitated Domination and Covering: A Parameterized Perspective},
booktitle = {Parameterized and Exact Computation, Third International
Workshop, IWPEC},
year = {2008},
pages = {78--90},
editor = {M. Grohe and
R. Niedermeier},
publisher = {Springer},
series = {LNCS},
volume = {5018},
}
@article{Dometal2008b,
author = {M. Dom and J. Guo and F. H\"uffner and R. Niedermeier},
title = "Closest 4-leaf power is fixed-parameter tractable",
journal = dam,
volume = "156",
number = "18",
pages = "3345--3361",
year = "2008",
}
@inproceedings{DomLokSau2009,
author = {M. Dom and
D. Lokshtanov and
S. Saurabh},
title = {Incompressibility through Colors and {ID}s},
pages = {378--389},
editor = {S. Albers and
A. Marchetti-Spaccamela and
Y. Matias and
S. E. Nikoletseas and
W. Thomas},
booktitle = {Automata, Languages and Programming, 36th International
Colloquium, ICALP 2009, Part I},
publisher = {Springer},
series = {LNCS},
volume = {5555},
year = {2009},
}
@article{DomDunMar97,
title = "Gallai-type theorems and domination parameters",
journal = dm,
volume = "167--168",
number = "",
pages = "237 -- 248",
year = "1997",
note = "Selected Papers 15th British Combinatorial Conference",
author = "G.~S. Domke and J. E. Dunbar and L. R. Markus"
}
@InProceedings{DomRic2001,
author = {P. Domingos and M. Richardson},
title = {Mining the network value of customers},
booktitle = {Proceedings of the
Seventh International Conference on Knowledge
Discovery and Data Mining, KDD},
OPTcrossref = {},
OPTkey = {},
pages = {57-–66},
year = {2001},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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 = ""
}
@article{Don70,
title = "Tree acceptors and some of their applications",
journal = jcss,
volume = "4",
number = "5",
pages = "406--451",
year = "1970",
note = "",
author = "J. Doner"
}
@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{DorTar97,
author = {Dor, D. and Tarsi, M.},
title = {Graph Decomposition is {NP}-Complete: A Complete Proof of Holyer's Conjecture},
journal = siam,
volume = {26},
number = {4},
pages = {1166--1187},
year = {1997},
}
@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},
}
@inproceedings{Doretal2011,
author = {M. D{\"o}rnfelder and
J. Guo and
C. Komusiewicz and
M. Weller},
title = {On the Parameterized Complexity of Consensus Clustering},
booktitle = {Algorithms and Computation -- 22nd International Symposium, ISAAC},
year = {2011},
pages = {624--633},
editor = {T. Asano and
S.-I. Nakano and
Y. Okamoto and
O. Watanabe},
publisher = {Springer},
series = {LNCS},
volume = {7074},
}
@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 = ""
}
@inproceedings{DouKra2012,
author = {M. Doucha and
J. Kratochv\'{\i}l},
title = {Cluster Vertex Deletion: A Parameterization between Vertex
Cover and Clique-Width},
pages = {348--359},
ee = {http://dx.doi.org/10.1007/978-3-642-32589-2_32},
crossref = {DBLP:conf/mfcs/2012},
}
@article{Dou92,
author = {R.~J. Douglas},
title = {{NP}-completeness and degree restricted spanning trees},
journal = dm,
volume = {105},
number = {1-3},
year = {1992},
pages = {41--47},
}
@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",
}
@InProceedings{DowEvaFel93,
title = "Parameterized Learning Complexity",
author = "R. G. Downey and P. A. Evans and M. R.
Fellows",
pages = "51--57",
booktitle = "Proc. Sixth Annual {ACM} Conference on
Computational Learning Theory, COLT",
year = "1993",
publisher = "ACM Press",
}
@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{DowFelReg98,
author = {R.~G. Downey and M. R. Fellows and K.~W. Regan},
title = {Descriptive Complexity and the W Hierarchy},
booktitle = {Proof Complexity and Feasible Arithmetics},
OPTcrossref = {},
OPTkey = {},
pages = {119--134},
publisher = {American Mathematical Society},
year = {1998},
OPTeditor = {},
volume = {39},
OPTnumber = {},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
}
@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},
}
@article{Dowetal2008,
author = {R.~G. Downey and
M. R. Fellows and
C. McCartin and
F. A. Rosamond},
title = {Parameterized approximation of dominating set problems},
journal = ipl,
volume = {109},
number = {1},
year = {2008},
pages = {68--70},
}
@InCollection{DowMcC2010,
author = {R.~G. Downey and
C. McCartin },
title = {Parameterized algorithms},
booktitle = {Algorithms and theory of computation handbook},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
publisher = {Chapman \& Hall},
year = {2010},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
chapter = {25},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@inproceedings{DraRauSzw2009,
author = {L. Draque Penso and
D. Rautenbach and
J. L. Szwarcfiter},
title = {Cycles, Paths, Connectivity and Diameter in Distance Graphs},
pages = {320--328},
editor = {C. Paul and
M. Habib},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International
Workshop, WG 2009},
series = {LNCS},
volume = {5911},
year = {2010}
}
@article{DreVet2010,
author = {Drescher, M. and Vetta, A.},
title = {An approximation algorithm for the maximum leaf spanning arborescence problem},
journal = {ACM Trans. Algorithms},
volume = {6},
number = {3},
year = {2010},
pages = {1--18},
}
@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 = ""
}
@Article{DreHog2007,
author = {Drewes, F. and H{\"o}gberg, J.},
title = {Query Learning of Regular Tree Languages: How to Avoid Dead States},
journal = tocs,
volume = {40},
number = {2},
year = {2007},
pages = {163--185},
}
@article{DreVog2007,
author = {Drewes, F. and Vogler, H.},
title = {Learning Deterministically Recognizable Tree Series},
journal = jalc,
volume = {12},
pages = {333--354},
year = {2007},
}
@article{Dreetal2008,
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},
journal = fundinform,
volume = {86},
number = {4},
year = {2008},
pages = {459--480},
}
@Article{Dre2009,
author = {F. Drewes},
title = {{MAT} Learners for Recognizable Tree Languages and Tree Series},
journal = actacybern,
year = {2009},
OPTkey = {},
volume = {19},
OPTnumber = {},
pages = {249--274},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{DreMer2008,
AUTHOR = "F. Drewes and and B. van der Merwe",
title = {Path Languages of Random Permitting
Context Tree Grammars are Regular},
journal = fundinform,
volume = {82},
number = {1-2},
year = {2008},
pages = {47--60},
}
@article{DreHogMal2011,
author = {F. Drewes and
J. H{\"o}gberg and
A. Maletti},
title = {{MAT} learners for tree series: an abstract data type and
two realizations},
journal = actainform,
volume = {48},
number = {3},
year = {2011},
pages = {165--189},
}
@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{DreRob2009,
author = {P.~A. Dreyer Jr. and
F.~S. Roberts},
title = {Irreversible $k$-threshold processes: Graph-theoretical threshold
models of the spread of disease and of opinion},
journal = dam,
volume = {157},
number = {7},
year = {2009},
pages = {1615--1627},
ee = {http://dx.doi.org/10.1016/j.dam.2008.09.012},
}
@InProceedings{DrmSzp2011,
author = {M. Drmota and W. Szpankowski},
title = {A Master Theorem for Discrete Divide and Conquer Recurrences},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms SODA},
pages = {342--362},
year = {2011},
editor = {D. Randall},
organization = {ACM and SIAM},
OPTpublisher = {},
OPTabstract = {},
}
@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{DroPel99,
author = {L. Drori and
D. Peleg},
title = {Faster Exact Solutions for Some {NP}-Hard Problems},
booktitle = {Algorithms --- ESA '99, 7th Annual European Symposium},
year = {1999},
pages = {450--461},
editor = {J. Nesetril},
publisher = {Springer},
series = {LNCS},
volume = {1643},
}
@article{DroPel2002,
author = {L. Drori and
D. Peleg},
title = {Faster exact solutions for some {NP}-hard problems},
journal = tcs,
volume = {287},
number = {2},
year = {2002},
pages = {473--499},
}
@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{Duetal2012,
author = {H. Du and
W. Wu and
S. Shan and
D. Kim and
W. Lee},
title = {Constructing weakly connected dominating set for secure
clustering in distributed sensor network},
journal = joco,
volume = {23},
number = {2},
year = {2012},
pages = {301--307},
}
@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{Dub87,
AUTHOR = "R. C. Dubes",
TITLE = "How many clusters are best ? --- an experiment",
JOURNAL = patrec,
YEAR = 1987,
month = "",
volume = 20,
number = "",
pages = "645--663",
copy = ""
}
@article{DubFeiUng2011,
title = "Hardness results for approximating the bandwidth",
journal = jcss,
volume = "77",
number = "1",
pages = "62--90",
year = "2011",
author = "C. Dubey and U. Feige and W. Unger",
}
@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{DudTelTom2003,
author = {D. Dudau-Sofronie and I. Tellier and M. Tommasi},
title = {A Learnable Class of Classical
Categorial Grammars from Typed
Examples},
booktitle = {Formal Grammar FGVienna},
OPTcrossref = {},
OPTkey = {},
pages = {81--94},
year = {2003},
OPTpublisher = {CSLI},
}
@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{DujFerKau2003,
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",
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 = {}
}
@article{Dujetal2008,
author = {V. Dujmovi{\'c} and M.~R. Fellows and M. Kitching and G. Liotta and C. McCartin and N. Nishimura and P. Ragde and F.~A. Rosamond and S. Whitesides and D.~R. Wood},
title = {On the Parameterized Complexity of Layered Graph Drawing},
journal = alg,
volume = {52},
number = {2},
year = {2008},
pages = {267--292},
}
@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 = ""
}
@InCollection{Dunetal95,
author = {J. Dunbar and S.~T. Hedetniemi and M.~A. Henning and P.~J. Slater},
title = {Signed domination in graphs},
booktitle = {Graph Theory,
Combinatorics and Applications},
OPTcrossref = {},
OPTkey = {},
pages = {311--322},
publisher = {Wiley, New York},
year = {1995},
}
@article{Dunetal96,
author = {J.~E. Dunbar and
S.~T. Hedetniemi and
M.~A. Henning and
A.~A. McRae},
title = {Minus domination in regular graphs},
journal = dm,
volume = {149},
number = {1-3},
year = {1996},
pages = {311--312},
}
@article{Dunetal96a,
author = {J.~E. Dunbar and
W.~Goddard and
S.~T. Hedetniemi and
A.~A. McRae and
M.~A. Henning},
title = {The Algorithmic Complexity of Minus Domination in Graphs},
journal = dam,
volume = {68},
number = {1-2},
year = {1996},
pages = {73--84},
}
@article{Dunetal99,
author = {J.~E. Dunbar and
S.~T. Hedetniemi and
M.~A. Henning and
A.~A. McRae},
title = {Minus domination in graphs},
journal = dm,
volume = {199},
number = {1-3},
year = {1999},
pages = {35--47},
}
@article{Dunetal2000,
author = {J.~E. Dunbar and
D.~G. Hoffman and
R.~C. Laskar and
L.~R. Markus},
title = {$\alpha$-Domination},
journal = dm,
volume = {211},
year = {2000},
pages = {11--26},
}
@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 = "L. Miclet and C. de la Higuera", 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{DutKlo2013,
author = {R. Dutton and W.~F. Klostermeyer},
title = {Edge Dominating Sets and Vertex Covers},
journal = {Discussiones Mathematicae
Graph Theory},
year = {2013},
volume = {33},
pages = {437--456},
}
@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 = {}
}
@INPROCEEDINGS{DwySch2004,
AUTHOR = "T. Dwyer and F. Schreiber",
TITLE = "Optimal leaf ordering for two and a half dimensional phylogenetic tree visualisation",
BOOKTITLE = "Proc. Australasian Symp. on Information Visualisation (InVis.au 2004)",
YEAR = 2004,
month = "",
volume = "35",
editor = "",
series = "CPRIT",
chapter = "",
pages = "109--115",
address = "",
organization = "",
publisher = "",
copy = ""
}
@Article{DyeFro85,
author = {M. E. Dyer and A. M. Frieze},
title = {On the complexity of partitioning graphs into connected subgraphs},
journal = dam,
year = {1985},
volume = {10},
OPTnumber = {},
pages = {139--153},
}
@ARTICLE{DyeFri86,
AUTHOR = "M. E. Dyer and A. M. Frieze",
TITLE = "Planar {3DM} is {NP}-complete",
JOURNAL = jalg,
YEAR = 1986,
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 = ""
}
@Article{EbaPus2010,
author = {Ebadi, K. and L. Pushpalatha},
title = {Smarandachely {R}oman Edge $s$-Dominating Function},
journal = {International Journal of Mathematical Combinatorics},
year = {2010},
OPTkey = {},
volume = {2},
OPTnumber = {},
pages = {95--101},
}
@Article{EbaKhoPus2010,
author = {Ebadi, K. and E. Khodadadi and L. Pushpalatha},
title = {On the {R}oman edge domination number of a graph},
journal = {International Journal of Mathematical Combinatorics},
year = {2010},
OPTkey = {},
volume = {4},
OPTnumber = {},
pages = {38--45},
}
@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{EdwFar2001,
author = {K. Edwards and
G. Farr},
title = {Fragmentability of Graphs},
journal = jctb,
volume = {82},
number = {1},
year = {2001},
pages = {30--37},
}
@article{EdwFar2008,
author = {K. Edwards and
G. Farr},
title = {Planarization and fragmentability of some classes of graphs},
journal = dm,
volume = {308},
number = {12},
year = {2008},
pages = {2396--2406},
}
@article {Egaetal97,
author = {Egawa, Y. and Kano, M. and Kelmans, A.~K.},
title = {Star partitions of graphs},
journal = jgth,
volume = {25},
number = {3},
pages = {185--190},
year = {1997},
}
@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{Ehretal89,
author = {A. Ehrenfeucht and
D. Haussler and
M. J. Kearns and
L. G. Valiant},
title = {A General Lower Bound on the Number of Examples Needed for
Learning},
journal = ic,
volume = {82},
number = {3},
year = {1989},
pages = {247--261},
}
@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 = ""
}
@InCollection{EhrPauRoz97,
crossref = {RozSal97II},
title = {Contextual grammars and formal languages},
OPTpublisher = {},
OPTyear = {},
author = {A. Ehrenfeucht and G. P\u aun and G. Rozenberg},
ALTeditor = {},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
pages = {237--293},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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},
}
@inproceedings{EicGroGru2008,
author = {K. Eickmeyer and
M. Grohe and
M. Gr{\"u}ber},
title = {Approximation of Natural {W[P]}-Complete Minimisation Problems
Is Hard},
booktitle = {IEEE Conference on Computational Complexity CCC 2008},
year = {2008},
pages = {8--18},
publisher = {IEEE Computer Society},
}
@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 a Technical Report INFSYS RR-1843-02-05, TU Wien",
year = "2002"}
@inproceedings{Ekietal2012,
author = {T. Ekim and
A. Erey and
P. Heggernes and
P. van 't Hof and
D. Meister},
title = {Computing Minimum Geodetic Sets of Proper Interval Graphs},
booktitle = {Theoretical Informatics -- 10th Latin American
Symposium, LATIN},
year = {2012},
pages = {279--290},
editor = {D. Fern{\'a}ndez-Baca},
publisher = {Springer},
series = {LNCS},
volume = {7256},
}
@article{EkiHegMei2013,
author = {T. Ekim and
P. Heggernes and
D. Meister},
title = {Polar permutation graphs are polynomial-time recognisable},
journal = ejc,
volume = {34},
number = {3},
year = {2013},
pages = {576--592},
}
@inproceedings{ElbJakTan2010,
author = {M. Elberfeld and
A. Jakoby and
T. Tantau},
title = {Logspace Versions of the Theorems of {B}odlaender and {C}ourcelle},
booktitle = {51th Annual IEEE Symposium on Foundations of Computer Science, FOCS},
year = {2010},
pages = {143--152},
publisher = {IEEE Computer Society},
}
@inproceedings{ElbJakTan2012,
author = {M. Elberfeld and
A. Jakoby and
T. Tantau},
title = {Algorithmic Meta Theorems for Circuit Classes of Constant
and Logarithmic Depth},
booktitle = {29th International Symposium on Theoretical Aspects of Computer
Science, STACS},
year = {2012},
pages = {66--77},
editor = {C. D{\"u}rr and
T. Wilke},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f\"ur Informatik},
series = {LIPIcs},
volume = {14},
}
@TechReport{ElfJunRin2001,
author = {M. Elf and M. J\"unger and G. Rinaldi},
title = {Minimizing Breaks by Maximizing Cuts},
institution = {Zentrum für Angewandte Informatik der Universit\"at zu K\"oln, Germany},
year = {2001},
OPTkey = {},
OPTtype = {},
number = {zaik2001-409},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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{EllSudTur94,
title = "The Vertex Separation and Search Number of a Graph",
journal = "Information and Computation",
volume = "113",
number = "1",
pages = "50--79",
year = "1994",
author = "J.~A. Ellis and I.~H. Sudborough and J.~S. Turner"
}
@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",
}
@PhdThesis{Enc2009,
author = {R.~I. Enciso},
title = {Alliances in Graphs: Parameterized Algorithms and on Partitioning Series-Parallel Graphs},
school = {College of Engineering and Computer Science
at the University of Central Florida;
Orlando, Florida, USA},
year = {2009},
}
@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{Epp90,
author = {D. Eppstein},
title = {Reset Sequences for Monotonic Automata},
journal = siam,
volume = {19},
number = {3},
year = {1990},
pages = {500--510},
}
@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 = "D. 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 = ""
}
@inproceedings{Epp2003a,
author = {D. Eppstein},
title = {The Traveling Salesman Problem for Cubic Graphs},
booktitle = {Algorithms and Data Structures, 8th International Workshop, WADS},
year = {2003},
pages = {307--318},
editor = {F. K. H. A. Dehne and
J.-R. Sack and
M. H. M. Smid},
publisher = {Springer},
series = {LNCS},
volume = {2748},
}
@article{Epp2006,
author = {Eppstein, D.},
title = {Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms},
journal = {ACM Trans. Algorithms},
volume = {2},
number = {4},
year = {2006},
pages = {492--509}
}
@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 = ""
}
@PhdThesis{Erd2009,
author = {G. Erd{\'e}lyi},
title = {The Control Complexity of Sincere-Strategy Preference-Based Approval Voting and of Fallback Voting, and a Study of Optimal Lobbying and Junta Distributions for SAT},
school = {Mathematisch-Naturwissenschaftliche Fakult{\"a}t der Heinrich-Heine-Universit{\"a}t D{\"u}sseldorf},
year = {2009},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@techreport{Erdetal2009,
author = {G. Erd{\'e}lyi and
H. Fernau and
J. Goldsmith and
N. Mattei and
D. Raible and
J. Rothe},
title = {The Complexity of Probabilistic Lobbying},
institution = {Arxiv},
number = {abs/0906.4431},
year = {2009},
}
@inproceedings{Erdetal2009a,
author = {G. Erd{\'e}lyi and
H. Fernau and
J. Goldsmith and
N. Mattei and
D. Raible and
J. Rothe},
editor = {F. Rossi and
A. Tsouki{\`a}s},
title = {The Complexity of Probabilistic Lobbying},
booktitle = {Algorithmic Decision Theory, First International Conference, ADT},
year = {2009},
pages = {86--97},
publisher = {Springer},
series = {LNCS},
volume = {5783},
}
@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 = ""
}
@article{ErdPyb97,
author = {Paul Erd{\"o}s and
L{\'a}szl{\'o} Pyber},
title = {Covering a graph by complete bipartite graphs},
journal = dm,
volume = {170},
number = {1-3},
year = {1997},
pages = {249--251},
}
@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},
}
@Article{Ermetal2010,
author = {R. Erman and \L. Kowalik and M. Krnc and T. Wale\'n},
title = {Improved induced matchings in sparse graphs},
journal = dam,
year = {2010},
OPTkey = {},
volume = {158},
OPTnumber = {},
pages = {1994--2003},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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{Escetal2012,
author = {B. Escoffier and
J. Monnot and
V. Th. Paschos and
M. Xiao},
title = {New Results on Polynomial Inapproximability and Fixed Parameter
Approximability of edge dominating set},
booktitle = {Parameterized and Exact Computation --- 7th International
Symposium, IPEC},
year = {2012},
pages = {25--36},
editor = {D. M. Thilikos and
G. J. Woeginger},
publisher = {Springer},
series = {LNCS},
volume = {7535},
}
@inproceedings{EstBra99,
author = {V. Estivill-Castro and
L. Brankovic},
title = {Data Swapping: Balancing Privacy against Precision in Mining
for Logic Rules},
year = {1999},
pages = {389--398},
editor = {M. K. Mohania and
A. Min Tjoa},
booktitle = {Data Warehousing and Knowledge Discovery, First International
Conference, DaWaK},
publisher = {Springer},
series = {LNCS},
volume = {1676},
}
@MISC{Est2001,
author = {V. Estivill-Castro},
title = {Computational Geometry Provides Techniques for Approximately Solving the $p$-Median Problem},
address = "The University of Newcastle, AUS, TR 2001-01 (?)",
year = {2001}
}
@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{EstHeeSur2010,
author = {V. Estivill-Castro and
A. Heednacram and
F. Suraweera},
title = {{NP}-completeness and {FPT} Results for Rectilinear Covering
Problems},
journal = jucs,
volume = {16},
number = {5},
year = {2010},
pages = {622--652},
}
@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 = ""
}
@article{EvaWarCha2009,
author = {P. A. Evans and
T. Wareham and
R. Chaytor},
title = {Fixed-parameter tractability of anonymizing data by suppressing
entries},
journal = joco,
volume = {18},
number = {4},
year = {2009},
pages = {362--375},
}
@TECHREPORT{EveShi75,
AUTHOR = "S. Even and Y. Shiloach",
TITLE = "{NP}-completeness of several arrangement problems",
INSTITUTION = "Computer Science Department, The Technion",
YEAR = {1975},
month = "",
number = "43",
address = "Haifa, Israel",
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 = ""
}
@Article{Ezz2007,
author = {Z. Ezziane},
title = {Experimental Comparison Between Evolutionary Algorithm and Barycenter
Heuristic for the Bipartite Drawing Problem},
journal = {Journal of Computer Science},
year = {2007},
OPTkey = {},
volume = {3},
OPTnumber = {},
pages = {717--722},
}
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",
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},
}
@article{FaiSch92,
author = {U. Faigle and
R. Schrader},
title = {A greedy reduction algorithm for setup optimization},
journal = dam,
volume = {35},
number = {1},
year = {1992},
pages = {73--79},
}
@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 = ""
}
@techreport{FalHemHem2006,
Author = "P. Faliszewski and E.~Hemaspaandra and L.~Hemaspaandra",
Title = {How Hard Is Bribery in Elections?},
Month = apr,
Year = "2006",
Number= "arXiv:cs/0608081v3~[cs.GT]",
note={Revised, August 2008},
Institution = "ACM Computing Research Repository (CoRR)"
}
@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 = ""
}
@article{FanPar2011,
author = {N. Fan and P. M. Pardalos},
title = {A rearrangement of adjacency matrix based approach
for solving the crossing minimization problem},
journal = joco,
pages = {747--762},
volume = {22},
year = {2011}
}
@article{FanHua2010,
author = {C.-M. Fan and
C.-C. Huang},
title = {Some properties of involution palindrome languages},
journal = ijcm,
volume = {87},
number = {15},
year = {2010},
pages = {3397--3404},
}
@INPROCEEDINGS{FanCheLee91,
author={Fang, S.-C. and Chen, S.-J. and Lee, S.L.},
booktitle={Circuits and Systems, 1991, IEEE International Symposium on},
title={Novel graph-based algorithms for reconfigurable arrays},
year={1991},
month={jun},
pages={2866--2869, vol.5},
}
@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{Far83,
author = {M. Farber},
title = {Characterizations of strongly chordal graphs},
journal = dm,
volume = {43},
year = {1983},
pages = {173--189},
}
@article{Far84,
author = {M. Farber},
title = {Domination, independent domination, and duality in strongly chordal graphs},
journal = dam,
volume = {7},
year = {1984},
pages = {115--130},
}
@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{FarSha83,
author = {A.~M. Farley and N. Shacham},
title = {Senders in broadcast networks: open irredundancy in graphs},
journal = {Congr. Numer.},
year = {1983},
volume = {38},
pages = {47--57},
}
@Article{FarPro84,
author = {A.~M. Farley and A. Proskurowski},
title = {Computing the maximum order of an open irredundant set in a tree},
journal = {Congr. Numer.},
year = {1984},
volume = {41},
pages = {219--228},
}
@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{Fav96,
author = {O. Favaron},
title = {Signed domination in regular graphs},
journal = dm,
year = {1996},
volume = {158},
pages = {287--293},
}
@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{Favetal2002b,
AUTHOR = "O. Favaron and S. M. Hedetniemi and S. T. Hedetniemi and D. F. Rall",
TITLE = "On $k$-dependent domination",
JOURNAL = dm,
YEAR = 2002,
month = "",
volume = 249,
number = "",
pages = "83--95",
copy = ""
}
@article{Favetal2009,
title = "On the {R}oman domination number of a graph",
journal = dm,
volume = "309",
number = "10",
pages = "3447 -- 3451",
year = "2009",
author = "O. Favaron and H. Karami and R. Khoeilar and S.~M. Sheikholeslami",
}
@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{FedGre88,
author = {Feder, T. and Greene, D.},
title = {Optimal algorithms for approximate clustering},
booktitle = {Proceedings of the twentieth annual ACM Symposium on Theory of Computing STOC '88},
year = {1988},
pages = {434--444},
publisher = {ACM Press},
}
@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 = ""
}
@Article{Fei98,
author = "U. Feige",
title = "A Threshold of $\ln n$ for Approximating Set Cover",
journal = jacm,
volume = "45", pages={634--652},
year = "1998",
}
@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{FeiLan2001,
author = {U. Feige and
M. Langberg},
title = {Approximation Algorithms for Maximization Problems Arising
in Graph Partitioning},
journal = jalg,
volume = {41},
number = {2},
year = {2001},
pages = {174--211},
}
@article{FeiKorPel2001,
author = {U. Feige and
G. Kortsarz and
D. Peleg},
title = {The Dense $k$-Subgraph Problem},
journal = algo,
volume = {29},
number = {3},
year = {2001},
pages = {410--421},
}
@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 = ""
}
@Article{Feletal94,
author = {M. Fellows and G. Fricke and S. Hedetniemi and D. Jacobs},
title = {The private neighbor cube},
journal = {SIAM J. Discrete Math.},
year = {1994},
OPTkey = {},
volume = {7},
OPTnumber = {},
pages = {41--47},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = "Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS",
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 = ""
}
@Article{Feletal2002a,
author = {M. Fellows and P. Moscato and F. Rosamond and C. Cotta},
title = {The parameterized complexity of ﬁnding
irrelevant features and related data mining
problems},
journal = {Bioinformatics},
year = {2002},
OPTkey = {},
volume = {1},
OPTnumber = {},
pages = {1--7},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@INPROCEEDINGS{Fel03a,
AUTHOR = "M. Fellows",
TITLE = "Blow-ups, win/win's, and crown rules: some new directions in {FPT}",
BOOKTITLE = "Graph-Theoretic Concepts in Computer Science, 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},
}
@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},
}
@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 = alg,
year = {2007},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
OPTpages = {},
OPTmonth = {},
OPTnote = {},
annote = {DOI 10.1007/s00453-007-9146-y}
}
@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{Fel2006,
author = {M.~R. Fellows},
title = {The Lost Continent of Polynomial Time: Preprocessing and
Kernelization},
booktitle = {Parameterized and Exact Computation, Second International
Workshop, IWPEC},
year = {2006},
pages = {276--277},
editor = {H.~L. Bodlaender and
M. A. Langston},
publisher = {Springer},
series = {LNCS},
volume = {4169},
}
@inproceedings{Feletal2007a,
author = {Fellows, M. and Langston, M. and Rosamond, F. and Shaw, P.},
title = {Efficient Parameterized Preprocessing for Cluster Editing},
booktitle = {Fundamentals of Computation Theory FCT},
series = {LNCS},
editor = {Csuhaj-Varj\'u, E. and \'Esik, Z.},
publisher = {Springer},
pages = {312--321},
volume = {4639},
year = {2007}
}
@incollection {FelRos2007,
author = {Fellows, M. and Rosamond, F.},
title = {The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number},
booktitle = {Computation and Logic in the Real World},
series = {LNCS},
editor = {Cooper, S. and L{\"o}we, B. and Sorbi, A.},
pages = {268--277},
volume = {4497},
year = {2007}
}
@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 = {}
}
@InProceedings{Feletal09,
author = {M.~R. Fellows and J. Guo and H. Moser and R. Niedermeier},
title = {A generalization of {N}emhauser and {T}rotter's local optimization theorem},
booktitle = {Symposium on Theoretical Aspects of Computer Science STACS},
OPTcrossref = {},
OPTkey = {},
pages = {409--420},
year = {2009},
editor = {S. Albers and J.-Y. Marion},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Schloss Dagstuhl --- Leibniz-Zentrum f{\"u}r Informatik, Germany},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {}
}
@inproceedings{Feletal2008,
author = {M.~R. Fellows and
D. Lokshtanov and
N. Misra and
F.~A. Rosamond and
S. Saurabh},
title = {Graph Layout Problems Parameterized by Vertex Cover},
year = {2008},
pages = {294--305},
editor = {S.-H. Hong and
H. Nagamochi and
T. Fukunaga},
booktitle = {Algorithms and Computation, 19th International Symposium,
ISAAC 2008},
publisher = {Springer},
series = {LNCS},
volume = {5369},
}
@inproceedings{Feletal2008a,
author = {M.~R. Fellows and
D. Meister and
F. A. Rosamond and
R. Sritharan and
J. A. Telle},
title = {Leaf Powers and Their Properties: Using the Trees},
year = {2008},
pages = {402--413},
editor = {S.-H. Hong and
H. Nagamochi and
T. Fukunaga},
booktitle = {Algorithms and Computation, 19th International Symposium,
ISAAC 2008},
publisher = {Springer},
series = {LNCS},
volume = {5369},
}
@article{Feletal2008b,
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 = algo,
volume = {52},
number = {2},
year = {2008},
pages = {167--176},
}
@inproceedings{Fel2009,
author = {M.~R. Fellows},
title = {Towards Fully Multivariate Algorithmics: Some New Results
and Directions in Parameter Ecology},
booktitle = {Combinatorial Algorithms, 20th International Workshop, IWOCA},
year = {2009},
pages = {2--10},
editor = {J. Fiala and
J. Kratochv\'{\i}l and
M. Miller},
publisher = {Springer},
series = {LNCS},
volume = {5874},
}
@article {Feletal2009,
author = {Fellows, M. and Lokshtanov, D. and Misra, N. and Mnich, M. and Rosamond, F. and Saurabh, S.},
title = {The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number},
journal = tocs,
pages = {822--848},
volume = {45},
issue = {4},
year = {2009}
}
@inproceedings{Feletal2009a,
author = {M.~R. Fellows and
F. A. Rosamond and
F. V. Fomin and
D. Lokshtanov and
S. Saurabh and
Y. Villanger},
title = {Local Search: Is Brute-Force Avoidable?},
booktitle = {IJCAI 2009, Proceedings of the 21st International Joint
Conference on Artificial Intelligence},
year = {2009},
pages = {486--491},
editor = {C. Boutilier},
}
@InProceedings{FelGasRos2010,
author = {M.~R. Fellows and S. Gaspers and F.~A. Rosamond},
title = {Parameterizing by the Number of Numbers},
booktitle = {Parameterized and Exact Computation IPEC},
pages = {123--134},
year = {2010},
editor = {V. Raman and S. Saurabh},
volume = {6478},
series = {LNCS},
publisher = {Springer},
}
@Article{FelFer11,
author = {M. R. Fellows and H. Fernau},
title = {Facility Location Problems: A Parameterized View},
journal = dam,
year = {2011},
OPTkey = {},
volume = {159},
OPTnumber = {},
pages = {1118--1130},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@article{Feletal2011,
author = {M. R. Fellows and
J. Guo and
C. Komusiewicz and
R. Niedermeier and
J. Uhlmann},
title = {Graph-based data clustering with overlaps},
journal = {Discrete Optimization},
volume = {8},
number = {1},
year = {2011},
pages = {2--17},
}
@article{Feletal2011a,
author = {M. R. Fellows and
J. Guo and
H. Moser and
R. Niedermeier},
title = {A generalization of {N}emhauser and {T}rotters local optimization
theorem},
journal = jcss,
volume = {77},
number = {6},
year = {2011},
pages = {1141--1158},
}
@inproceedings{Feletal2012,
author = {M. Fellows and A. Kulik and F. Rosamond and H. Shachnai},
title = {Parameterized approximation via fidelity preserving transformations},
booktitle = {International Colloquium on Automata, Languages, and Programming, ICALP I},
series = {LNCS},
editor = {Czumaj, A. and Mehlhorn, K. and Pitts, A. and Wattenhofer, R.},
publisher = {Springer},
pages = {351--362},
volume = {7391},
year = {2012}
}
@article{FelGasRos2012,
author = {M.~R. Fellows and
S. Gaspers and
F.~A. Rosamond},
title = {Parameterizing by the Number of Numbers},
journal = tocs,
volume = {50},
number = {4},
year = {2012},
pages = {675--693},
}
@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{FelLioWis2003,
author = {S. Felsner and
G. Liotta and
S. K. Wismath},
title = {Straight-Line Drawings on Restricted Integer Grids in Two
and Three Dimensions},
journal = jgaa,
volume = {7},
number = {4},
year = {2003},
pages = {363--398},
}
@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",
}
@inproceedings{Fenetal2009,
author = {Q. Feng and Y. Liu and S. Lu and J. Wang},
title = {Improved Deterministic Algorithms for
Weighted Matching and Packing Problems},
year = {2009},
pages = {211--220},
editor = {J. Chen and S.~B. Cooper},
booktitle = {Theory and Applications of Models of Computation TAMC},
publisher = {Springer},
series = {LNCS},
volume = {5532},
}
@inproceedings{FenWanChe2011,
author = {Q. Feng and
J. Wang and
J. Chen},
title = {Matching and {$P_2$}-Packing: Weighted Versions},
pages = {343--353},
title = {Cograph Editing: Complexity and Parameterized Algorithms},
booktitle = {Computing and Combinatorics --- 17th Annual International
Conference, COCOON},
year = {2011},
editor = {B. Fu and
D.-Z. Du},
publisher = {Springer},
series = {LNCS},
volume = {6842},
}
@INPROCEEDINGS{FenBen96,
AUTHOR = "D. Fensel and R. Benjamins",
TITLE = "Assumptions in model-based diagnosis",
BOOKTITLE = "Proc. 10th Banff Knowledge Acquisition for Knowledge-Based Systems Workshop, KAW'96",
YEAR = 1996,
month = "",
volume = "",
editor = "B. R. Gaines and M. A. Musen",
series = "",
chapter = "",
pages = "5/1--5/18",
address = "",
organization = "",
publisher = "SRDG Publications",
copy = ""
}
@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. Mart{\'i}n-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. Mart{\'i}n-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
}
@article{FerHolFre01,
author = {H. Fernau and M. Holzer and R. Freund},
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 is {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 is {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 = "{H}abi\-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 = ""
}
@Article{FerMan2009,
author = {Fernau, H. and Manlove, D. F.},
title = {Vertex and edge covers with clustering properties: Complexity and algorithms},
journal = jda,
year = {2009},
OPTkey = {},
volume = {7},
OPTnumber = {},
pages = {149--167},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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 = "Programmed 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 = {\textsc{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 = {}
}
@Article{Fer08c,
author = {H. Fernau},
title = {Parameterized algorithmics for linear arrangement problems},
journal = dam,
year = {2008},
OPTkey = {},
volume = {156},
OPTnumber = {},
pages = {3166--3177},
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 di 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 = ""
}
@Article{FerRodSig09,
author = {H. Fernau and J.~A. Rodr\'\i guez and S.~M. Sigarreta},
title = {Offensive $r$-alliances in graphs},
journal = dam,
year = {2009},
OPTkey = {},
volume = {157},
OPTnumber = {},
pages = {177--182},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@InProceedings{Feretal09,
author = {H. Fernau and F.~V. Fomin and D. Lokshtanov and D. Raible and S. Saurabh and Y. Villanger},
title = {Kernel(s) for problems with no kernel: on out-trees with many leaves},
booktitle = {Symposium on Theoretical Aspects of Computer Science STACS},
OPTcrossref = {},
OPTkey = {},
pages = {421--432},
year = {2009},
editor = {S. Albers and J.-Y. Marion},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Schloss Dagstuhl --- Leibniz-Zentrum f{\"u}r Informatik, Germany},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {}
}
@Article{Fer09,
author = {H. Fernau},
title = {Algorithms for learning regular expressions from positive data},
journal = ic,
year = {2009},
OPTkey = {},
volume = {207},
OPTnumber = {},
pages = {521--541},
}
@inproceedings{FerRai2009,
author = {H. Fernau and D. Raible},
title = {Searching Trees: an Essay},
year = {2009},
pages = {59--70},
editor = {J. Chen and S.~B. Cooper},
booktitle = {Theory and Applications of Models of Computation TAMC},
publisher = {Springer},
series = {LNCS},
volume = {5532},
}
@inproceedings{FerRai2009a,
author = {H. Fernau and D. Raible},
title = {Packing Paths: Recycling Saves Time},
booktitle = {Cologne-Twente Workshop on Graphs
and Combinatorial Optimization CTW},
year = {2009},
pages = {79--83},
editor = {S. Cafieri and
A. Mucherino and
G. Nannicini and
F. Tarissan and
L. Liberti}
}
@Article{FerRai2009b,
author = {H. Fernau and D. Raible},
title = {A Parameterized Perspective on Packing Paths of Length Two},
journal = joco,
year = {2009},
OPTkey = {},
volume = {18},
OPTnumber = {},
pages = {319--341},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@inproceedings{Feretal09a,
author = {H. Fernau and
S. Gaspers and
D. Kratsch and
M. Liedloff and
D. Raible},
title = {Exact Exponential-Time Algorithms for Finding Bicliques
in a Graph},
booktitle = {Cologne-Twente Workshop on Graphs
and Combinatorial Optimization CTW},
year = {2009},
pages = {205--209},
editor = {S. Cafieri and
A. Mucherino and
G. Nannicini and
F. Tarissan and
L. Liberti}
}
@inproceedings{Feretal09b,
author = {H. Fernau and
J. Kneis and
D. Kratsch and
A. Langer and
M. Liedloff and
D. Raible and
P. Rossmanith},
title = {An exact algorithm for the Maximum Leaf Spanning Tree problem},
pages = {161--172},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, IWPEC},
year = {2009},
editor = {J. Chen and
F. V. Fomin},
publisher = {Springer},
series = {LNCS},
volume = {5917},
}
@Article{Fer10,
author = {H. Fernau},
title = {A Top-Down Approach to Search-Trees: Improved
Algorithmics for {\sc 3-Hitting Set}},
journal = alg,
year = {2010},
OPTkey = {},
volume = {57},
OPTnumber = {},
pages = {97--118},
}
@Article{Fer10a,
author = {H. Fernau},
title = {{\sc minimum dominating set of queens}: A trivial programming exercise?},
journal = dam,
year = {2010},
OPTkey = {},
volume = {158},
OPTnumber = {},
pages = {308--318},
}
@Article{Fer10b,
author = {H. Fernau},
title = {Parameterized Algorithms for $d$-Hitting Set: the Weighted Case},
journal =tcs,
year = {2010},
volume = {411},
pages = {1698--1713},
}
@Article{Fer10c,
author = {H. Fernau},
title = {Parameterized Algorithmics for $d$-Hitting Set},
journal = ijcm,
year = {2010},
volume = {87},
number = {14},
pages = {3157--3174},
}
@inproceedings{FerGasRai2009,
author = {H. Fernau and
S. Gaspers and
D. Raible},
title = {Exact and Parameterized Algorithms for Max Internal Spanning
Tree},
pages = {100--111},
editor = {C. Paul and
M. Habib},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International
Workshop, WG 2009,
Revised Papers},
series = {LNCS},
publisher={Springer},
volume = {5911},
year = {2010},
}
@inproceedings{Feretal2010,
author = {H. Fernau and
F. V. Fomin and G. Philip and S. Saurabh},
title = {The Curse of Connectivity:
$t$-Total Vertex (Edge) Cover},
pages = {34--43},
editor = {M. T. Thai and S. Sahni},
booktitle = {Computing and Combinatorics Conference COCOON},
series = {LNCS},
publisher={Springer},
volume = {6196},
year = {2010},
}
@Article{FerKauPot2010,
author = {H. Fernau and M. Kaufmann and M. Poths},
title = {Comparing trees via crossing minimization},
journal = jcss,
year = {2010},
volume = {76},
pages = {593--608},
}
@inproceedings{Feretal1011,
author = {H. Fernau and
F. V. Fomin and
D. Lokshtanov and
M. Mnich and
G. Philip and
S. Saurabh},
title = {Ranking and Drawing in Subexponential Time},
booktitle = {Combinatorial Algorithms --- 21st International Workshop,
IWOCA 2010},
pages = {337--348},
editor = {C. S. Iliopoulos and
W. F. Smyth},
publisher = {Springer},
series = {LNCS},
volume = {6460},
year = {2011},
}
@article{Feretal11,
author = {H. Fernau and
J. Kneis and
D. Kratsch and
A. Langer and
M. Liedloff and
D. Raible and
P. Rossmanith},
title = {An exact algorithm for the {M}aximum {L}eaf {S}panning {T}ree problem},
journal = tcs,
volume = {412},
number = {45},
year = {2011},
pages = {6290--6302},
}
@InCollection{FerSti11,
author = {H. Fernau and R. Stiebe},
title = {On the expressive power of valences in cooperating distributed grammar systems},
booktitle = {Computation, Cooperation, and Life},
OPTcrossref = {},
OPTkey = {},
pages = {90--106},
publisher = {Springer},
year = {2011},
editor = {J. Kelemen and A. Kelemenov\'a},
volume = {6610},
OPTnumber = {},
series = {LNCS},
}
@incollection{Fer12,
author = "H. Fernau",
title = "Approximative Learning vs. Inductive Learning",
booktitle = "Encyclopedia of the Sciences of Learning",
publisher = "Springer",
editor = "N.~M. Seel",
pages = "293--295",
year = "2012"
}
@InProceedings{Fer12a,
author = {H. Fernau},
title = {Saving on Phases: Parameterized Approximation for \textsc{Total Vertex Cover}},
booktitle = {International Workshop on Combinatorial Algorithms, IWOCA 2012},
pages = {20--31},
year = {2012},
editor = {S. Arumugam and B. Smyth},
volume = {7643},
series = {LNCS},
publisher = {Springer},
}
@InCollection{Fer12b,
author = {H. Fernau},
title = {Cooperating Distributed Tree Automata},
booktitle = {Dassow Festschrift 2012},
OPTcrossref = {},
OPTkey = {},
pages = {75--85},
publisher = {Springer},
year = {2012},
editor = {H. Bordihn and M. Kutrib and B. Truthe},
volume = {7300},
OPTnumber = {},
series = {LNCS},
}
@InProceedings{FerHegVil2013,
author = {H. Fernau and P. Heggernes and Y. Villanger},
title = {A Multivariate Analysis of Some {DFA} Problems},
booktitle = {Language and Automata Theory and Applications, LATA},
pages = {275--286},
year = {2013},
editor = {A.-H. Dediu and C. Mart{\'i}n-Vide and B. Truthe},
volume = {7810},
OPTnumber = {},
series = {LNCS},
publisher = {Springer},
}
@InProceedings{FerSch2013,
author = {H. Fernau and M.~L. Schmid},
title = {Pattern Matching with Variables:
A Multivariate Complexity Analysis
(Extended Abstract)},
booktitle = {Combinatorial Pattern Matching, CPM},
pages = {83--94},
year = {2013},
editor = {J. Fischer and P. Sanders},
volume = {7922},
OPTnumber = {},
series = {LNCS},
publisher = {Springer},
}
@article{FerSanSkl84,
author = {L.~A. Ferrari and
P. V. Sankar and
J. Sklansky},
title = {Minimal rectangular partitions of digitized blobs},
journal = {Computer Vision, Graphics, and Image Processing},
volume = {28},
number = {1},
year = {1984},
pages = {58--71},
}
@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 = ""
}
@article{Feretal2003,
author = {C. Ferretti and
G. Mauri and
Gh. Paun and
C. Zandron},
title = {On three variants of rewriting {P} systems},
journal = tcs,
volume = {1-3},
number = {301},
year = {2003},
pages = {201--215},
}
@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{FesPar2012,
author = {P. Festa and P. M. Pardalos},
title = {Efficient solutions for the far from most string problem},
journal = {Annals of Operations Research},
volume = {196},
number = {1},
year = {2012},
pages = {663--682},
}
@inproceedings{FiaGolKra2009,
author = {J. Fiala and P.~A. Golovach and J. Kratochv\'il},
title = { Parameterized Complexity of Coloring
Problems: Treewidth versus Vertex Cover},
year = {2009},
pages = {221--230},
editor = {J. Chen and S.~B. Cooper},
booktitle = {TAMC},
publisher = {Springer},
series = {LNCS},
volume = {5532},
}
@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 = ""
}
@incollection{FinStuLou2002,
author = {Finger, M. and St\"utzle, T. and Louren\c{c}o, H.},
title = {Exploiting Fitness Distance Correlation of Set Covering Problems},
booktitle = {Applications of Evolutionary Computing},
series = {LNCS},
editor = {Cagnoni, S. and Gottlieb, J. and Hart, E. and Middendorf, M. and Raidl, G.},
publisher = {Springer},
pages = {251--265},
volume = {2279},
year = {2002}
}
@InCollection{FinJac85,
author = {J.~F. Fink and M.~S. Jacobson},
title = {$n$-domination in graphs},
booktitle = {Graph Theory and Its Applications to Algorithms
and Computer Science},
OPTcrossref = {},
OPTkey = {},
pages = {283--300},
publisher = {Wiley, New York},
year = {1985},
}
@InCollection{FinJac85a,
author = {J.~F. Fink and M.~S. Jacobson},
title = {On $n$-domination, $n$-dependence and forbidden subgraphs},
booktitle = {Graph Theory and Its Applications to Algorithms
and Computer Science},
OPTcrossref = {},
OPTkey = {},
pages = {301--312},
publisher = {Wiley, New York},
year = {1985},
}
@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},
}
@article{Fin2005,
title = "A lower bound for the {CO}-irredundance number of a graph",
journal = dm,
volume = "295",
number = "1-3",
pages = "49--62",
year = "2005",
author = "S. Finbow",
}
@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.~A. 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{Fioetal2008,
AUTHOR = "S. Fiorini and N. Hardy and B.~A. Reed and A. Vetta",
title = {Planar graph bipartization in linear time},
journal = dam,
volume = {156},
number = {7},
year = {2008},
pages = {1175--1180},
}
@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 = "P.~C. Fischer and C.~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 = ""
}
@inproceedings{FisGin2005,
author = {J. Fischer and
S. W. Ginzinger},
title = {A 2-Approximation Algorithm for Sorting by Prefix Reversals},
booktitle = {Algorithms --- ESA 2005, 13th Annual European Symposium},
year = {2005},
pages = {415--425},
editor = {G, St{\o}lting Brodal and
S. Leonardi},
publisher = {Springer},
series = {LNCS},
volume = {3669},
year = {2005},
}
@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 = ""
}
@Article{FisTetWin2000,
author = {P. Fishburn and P. Tetali and P. Winkler},
title = {Optimal linear arrangement of a rectangular grid},
journal = dm,
year = {2000},
OPTkey = {},
volume = {213},
OPTnumber = {},
pages = {123--139},
}
@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{FlaPelSor2011,
author = {P. Flajolet and M. Pelletier and M. Soria},
title = {On {B}uffon Machines and Numbers},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms SODA},
pages = {172--183},
year = {2011},
editor = {D. Randall},
organization = {ACM and SIAM},
OPTpublisher = {},
OPTabstract = {},
}
@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{FlaBau2002,
AUTHOR = "G.~W. Flake and E.~B. Baum",
TITLE = "Rush Hour is {PSPACE}-complete, or ``Why you should generously tip parking lot attendants''.",
JOURNAL = tcs, volume={270},
PAGES = {895-911},
YEAR = {2002} }
@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 = ""
}
@article{Fleetal2009,
title = "Covering graphs with few complete bipartite subgraphs ",
journal = tcs,
volume = "410",
number = "21–23",
pages = "2045--2053",
year = "2009",
note = "",
author = "H. Fleischner and E. Mujuni and D. Paulusma and S. Szeider",
}
@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 = ""
}
@article{FomHegTel2005,
author = {F.~V. Fomin and
P. Heggernes and
J.~A. Telle},
title = {Graph Searching, Elimination Trees, and a Generalization
of Bandwidth},
journal = {Algorithmica},
volume = {41},
number = {2},
year = {2005},
pages = {73--87},
}
@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 = ""
}
@Article{FomHoi2006,
author = {F.~V. Fomin and K. H{\o}ie},
TITLE = "Pathwidth of cubic graphs and exact algorithms",
journal = ipl,
year = {2006},
OPTkey = {},
volume = {97},
OPTnumber = {},
pages = {191--196},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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{FomGasSau2006,
author = {F.~V. Fomin and
S. Gaspers and
S. Saurabh},
title = {Branching and Treewidth Based Exact Algorithms},
pages = {16--25},
editor = {T. Asano},
booktitle = {Algorithms and Computation, 17th International Symposium,
ISAAC 2006},
booktitle = {ISAAC},
publisher = {Springer},
series = {LNCS},
volume = {4288},
year = {2006},
}
@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, FST TCS",
YEAR = 2006,
month = "",
volume = "4337",
editor = "",
series = "LNCS",
chapter = "",
pages = "152--163",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@article{FomThi2006,
author = {F. V. Fomin and
D. M. Thilikos},
title = {Dominating Sets in Planar Graphs: Branch-Width and Exponential
Speed-Up},
journal = siam,
volume = {36},
number = {2},
year = {2006},
pages = {281--309},
}
@article{FomHegMih2010,
author = {F.~V. Fomin and
P. Heggernes and
R. Mihai},
title = {Mixed search number and linear-width of interval and split
graphs},
journal = {Networks},
volume = {56},
number = {3},
year = {2010},
pages = {207--214},
}
@Article{FomGraKra2008,
AUTHOR = "F.~V. Fomin and F. Grandoni and D. Kratsch",
TITLE = "Solving {C}onnected {D}ominating {S}et faster than $2^n$",
journal = alg,
year = {2008},
OPTkey = {},
volume = {52},
OPTnumber = {},
pages = {153--166},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@inproceedings{FomGraKra2006a,
AUTHOR = "F.~V. Fomin and F. Grandoni and D. Kratsch",
title = {Measure and conquer: a simple {$O(2^{0.288n})$} independent set algorithm},
booktitle = {SODA '06: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm},
year = {2006},
pages = {18--25},
publisher = {ACM},
}
@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. Kratochv\'{\i}l and M. Liedloff",
TITLE = "Branch \& Recharge: Exact algorithms for generalized domination",
BOOKTITLE = "Workshop on Algorithms and Data Structures WADS",
YEAR = 2007,
month = "",
volume = "4619",
editor = "",
series = "LNCS",
chapter = "",
pages = "508--519",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@inproceedings{Fometal2008,
author = {F.~V. Fomin and
S. Gaspers and
D. Kratsch and
M. Liedloff and
S. Saurabh},
title = {Iterative Compression and Exact Algorithms},
pages = {335--346},
booktitle = {Mathematical Foundations of Computer Science MFCS},
year = {2008},
pages = {551--562},
editor = {E. Ochmanski and
J. Tyszkiewicz},
publisher = {Springer},
series = {LNCS},
volume = {5162},
}
@article{Fometal2008a,
author = {Fomin, F. V. and Grandoni, F. and Pyatkin, A. V. and Stepanov, A. A.},
title = {Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications},
journal = {ACM Trans. Algorithms},
volume = {5},
number = {1},
year = {2008},
pages = {1--17},
publisher = {ACM},
}
@article{FomThi2008,
author = {F.~V. Fomin and
D. M. Thilikos},
title = {An annotated bibliography on guaranteed graph searching},
journal = tcs,
volume = {399},
number = {3},
year = {2008},
pages = {236--245},
}
@Article{FomGraKra2009,
author = {Fomin, F.~V. and Grandoni, F. and D. Kratsch},
title = {A Measure \& Conquer Approach for the analysis of exact algorithms},
journal = jacm,
year = {2009},
OPTkey = {},
volume = {56},
number = {5},
OPTpages = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{Fometal2009,
author = {F.~V. Fomin and
S. Gaspers and
S. Saurabh and
A.~A. Stepanov},
title = {On Two Techniques of Combining Branching and Treewidth},
journal = alg,
volume = {54},
number = {2},
year = {2009},
pages = {181--207},
}
@inproceedings{Fometal2009a,
author = {F.~V. Fomin and
D. Lokshtanov and
V. Raman and
S. Saurabh},
title = {Subexponential Algorithms for Partial Cover Problems},
booktitle = {IARCS Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, FSTTCS},
year = {2009},
pages = {193--201},
editor = {R. Kannan and
K. N. Kumar},
publisher = {Schloss Dagstuhl --- Leibniz-Zentrum f\"ur Informatik},
series = {LIPIcs},
volume = {4},
}
@inproceedings{Fometal2009b,
author = {F.~V. Fomin and
S. Gaspers and
S. Saurabh and
S. Thomass{\'e}},
title = {A Linear Vertex Kernel for {M}aximum {I}nternal {S}panning {T}ree},
booktitle = {Algorithms and Computation, 20th International Symposium, ISAAC},
year = {2009},
pages = {275--282},
editor = {Y. Dong and
D.-Z. Du and
O. H. Ibarra},
publisher = {Springer},
series = {LNCS},
volume = {5878},
}
@article{Fometal2009c,
author = {F.~V. Fomin and
P. A. Golovach and
J. Kratochv\'{\i}l and
D. Kratsch and
M. Liedloff},
title = {Sort and Search: Exact algorithms for generalized domination},
journal = ipl,
volume = {109},
number = {14},
year = {2009},
pages = {795--798},
}
@inproceedings{Fometal2010,
author = {F.~V. Fomin and
D. Lokshtanov and
F. Grandoni and
S. Saurabh},
title = {Sharp Separation and Applications to Exact and Parameterized
Algorithms},
pages = {72--83},
editor = {A. L{\'o}pez-Ortiz},
booktitle = {LATIN 2010: Theoretical Informatics, 9th Latin American
Symposium},
publisher = {Springer},
series = {LNCS},
volume = {6034},
year = {2010},
}
@Article{Fometal2010a,
author = {F.~V. Fomin and S. Gaspers and P. A. Golovach and D. Kratsch and S. Saurabh},
title = {Parameterized algorithm for eternal vertex cover},
journal = ipl,
year = {2010},
OPTkey = {},
volume = 110,
OPTnumber = {},
pages = {702--706},
}
@inproceedings{Fometal2010b,
author = {F.~V. Fomin and
D. Lokshtanov and
S. Saurabh and
D.~M. Thilikos},
title = {Bidimensionality and Kernels},
booktitle = {ACM-SIAM Symposium
on Discrete Algorithms, SODA 2010},
year = {2010},
pages = {503--510},
editor = {M. Charikar},
publisher = {SIAM},
}
@inproceedings{Fometal2010c,
author = {F.~V. Fomin and
D. Lokshtanov and
V. Raman and
S. Saurabh},
title = {Fast Local Search Algorithm for Weighted Feedback Arc Set
in Tournaments},
booktitle = {AAAI Conference on Artificial
Intelligence, AAAI 2010},
year = {2010},
editor = {M. Fox and
D. Poole},
publisher = {AAAI Press},
year = {2010},
}
@article{Fometal2010d,
author = {F.~V. Fomin and
P. A. Golovach and
J. Kratochv\'{\i}l and
N. Nisse and
K. Suchan},
title = {Pursuing a fast robber on a graph},
journal = tcs,
volume = {411},
number = {7-9},
year = {2010},
pages = {1167--1181},
}
@InProceedings{Fometal2011,
author = {F.~V. Fomin and
D. Lokshtanov and
V. Raman and
S. Saurabh},
title = {Bidimensionality and {EPTAS}},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms SODA},
pages = {748--759},
year = {2011},
editor = {D. Randall},
organization = {ACM and SIAM},
OPTpublisher = {},
OPTabstract = {},
}
@article{Fometal2011a,
author = {F.~V. Fomin and
P. A. Golovach and
A. Hall and
M. Mihal{\'a}k and
E. Vicari and
P. Widmayer},
title = {How to Guard a Graph?},
journal = alg,
volume = {61},
number = {4},
year = {2011},
pages = {839--856},
}
@article{Fometal2011b,
author = {F.~V. Fomin and
D. Lokshtanov and
V. Raman and
S. Saurabh},
title = {Subexponential algorithms for partial cover problems},
journal = ipl,
volume = {111},
number = {16},
year = {2011},
pages = {814--818},
}
@article{Fometal2011c,
author = {F.~V. Fomin and
P. A. Golovach and
J. Kratochv\'{\i}l and
D. Kratsch and
M. Liedloff},
title = {Branch and Recharge: Exact Algorithms for Generalized Domination},
journal = alg,
volume = {61},
number = {2},
year = {2011},
pages = {252--273},
}
@inproceedings{FomVil2012,
author = {Fomin, F.~V. and Villanger, Y},
title = {Subexponential parameterized algorithm for minimum fill-in},
booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA},
year = {2012}, editor = {Y. Rabani},
pages = {1737--1746},
publisher = {SIAM},
}
@inproceedings{FomGol2012,
author = {F.~V. Fomin and
P. A. Golovach},
title = {Parameterized Complexity of Connected Even/Odd Subgraph
Problems},
pages = {432--440},
booktitle = {29th International Symposium on Theoretical Aspects of Computer
Science, STACS},
year = {2012},
editor = {C. D{\"u}rr and
T. Wilke},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
series = {LIPIcs},
volume = {14},
}
@article{Fometal2012,
author = {F. V. Fomin and
D. Lokshtanov and
V. Raman and
S. Saurabh and
B. V. Raghavendra Rao},
title = {Faster algorithms for finding and counting subgraphs},
journal = jcss,
volume = {78},
number = {3},
year = {2012},
pages = {698--706},
}
@Article{For2002,
author = {A. Foret},
title = {The emptiness of intersection problem for
languages of $k$-valued categorial
grammars (classical and {L}ambek) is
undecidable},
journal = {Electronic Notes in Theoretical Computer Science},
year = {2002},
OPTkey = {},
volume = {53},
OPTnumber = {},
OPTpages = {},
OPTmonth = {},
note = {This paper was meant to be part of:
Proceedings of the joint meeting of the 6th Conference on Formal
Grammar and the 7th Conference on Mathematics of Language, taking place in
Helsinki in 2001; however,
it is ``not available'' according to {\tt http://www.helsinki.fi/esslli/courses/courses.html}},
OPTannote = {}
}
@ARTICLE{For73,
AUTHOR = "G.~D. Forney",
TITLE = "The {V}iterbi algorithm",
JOURNAL = ieeeproc,
YEAR = 1973,
month = "",
volume = 3,
number = "",
pages = "268--278",
copy = ""
}
@inproceedings{For2004,
author = {M. Forster},
title = {A Fast and Simple Heuristic for Constrained Two-Level Crossing
Reduction},
booktitle = {Graph Drawing GD},
year = {2004},
pages = {206--216},
editor = {J. Pach},
series = {LNCS},
volume = {3383},
}
@PhdThesis{For2004a,
author = {M. Forster},
title = {Crossings in Clustered Level Graphs},
school = {Universit{\"a}t Passau, Germany},
year = {2004},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@inproceedings{ForSan2008,
author = {L. Fortnow and
R. Santhanam},
title = {Infeasibility of instance compression and succinct {PCP}s
for {NP}},
year = {2008},
pages = {133--142},
editor = {C. Dwork},
booktitle = {ACM Symposium on Theory of Computing, STOC},
publisher = {ACM},
}
@article{For2009,
author = {L. Fortnow},
title = {The status of the {P} versus {NP} problem},
journal = cacm,
volume = {52},
number = {9},
year = {2009},
pages = {78--86},
}
@article{FouIsmVig2012,
author = {H. Fournier and
A. Ismail and
A. Vigneron},
title = {Computing the {G}romov hyperbolicity of a discrete metric
space},
journal = {CoRR},
volume = {abs/1210.3323},
year = {2012},
ee = {http://arxiv.org/abs/1210.3323},
}
@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 = ""
}
@InProceedings{FoxPac2011,
author = {J. Fox and
J. Pach},
title = {Computing the independence number of intersection graphs},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms SODA},
pages = {1161--1165},
year = {2011},
editor = {D. Randall},
organization = {ACM and SIAM},
OPTpublisher = {},
OPTabstract = {},
}
@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 = ""
}
@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{FraSal96,
author={Franklin, M. and Saluja, K.~K.},
journal={Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on},
title={Testing reconfigured RAM's and scrambled address RAM's for pattern sensitive faults},
year={1996},
month={sep},
volume={15},
number={9},
pages={1081--1087},
}
@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 = ""
}
@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{FreHam88,
AUTHOR = "G.~N. Frederickson and S. E. Hambrusch",
TITLE = "Planar linear arrangements of outerplanar graphs",
JOURNAL = {IEEE Trans. Circuits Syst.},
YEAR = 1988,
month = "",
volume = 35,
number = "",
pages = "323--332",
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 = ""
}
@inproceedings{FreBarPod91,
author = {R. Freivalds and
J. Barzdin\u s and
K. Podnieks},
title = {Inductive Inference of Recursive Functions: Complexity Bounds},
booktitle = {Baltic Computer Science},
year = {1991},
pages = {111--155},
editor = {J. Barzdins and
D. Bj{\o}rner},
publisher = {Springer},
series = {LNCS},
volume = {502},
}
@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{FreJai97,
author = {R. Freivalds and
S. Jain},
title = {Kolmogorov Numberings and Minimal Identification},
journal = tcs,
volume = {188},
year = {1997},
pages = {175--194},
}
@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 = ""
}
@InCollection{FrePauRoz2007,
author = {R. Freund and Gh.~P\u{a}un and G. Rozenberg},
title = {Chapter 8: Contextual array grammars},
booktitle = {Formal Models, Languages and Applications},
pages = {112--136},
publisher = {World Scientiﬁc},
year = {2007},
editor = {Subramanian, K.~G. and Rangarajan, K. and Mukund, M.},
volume = {66},
OPTnumber = {},
series = {Series in Machine Perception and Artiﬁcial Intelligence},
}
@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 = ""
}
@inproceedings{FriKro2012,
author = {T. Friedrich and A. Krohmer},
title = {Parameterized Clique on Scale-Free Networks},
booktitle = {Algorithms and Computation -- 23rd International Symposium, ISAAC},
year = {2012},
pages = {659--668},
editor = {K.-M. Chao and
T.-s. Hsu and
D.-T. Lee},
publisher = {Springer},
series = {LNCS},
volume = {7676},
}
@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 = ""
}
@Article{FruHar70,
author = {R. Frucht and F. Harary},
title = {On the corona of two graphs},
journal = {Aequationes Math.},
year = {1970},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
pages = {322--325},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTurldate = {},
OPTlastchecked = {},
OPTdoi = {},
OPTisbn = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
OPTkeywords = {},
}
@Article{Fu68,
author = {Y. Fu},
title = {Dominating set and converse dominating set of a directed graph},
journal = {The American Mathematical Monthly},
year = {1968},
OPTkey = {},
volume = {75},
number = {8},
pages = {861--863},
}
@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 = "1136",
editor = "J. D\'{\i}az and
M.~J. Serna",
series = "LNCS",
chapter = "",
pages = "167--178",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@article{Fuj96a,
AUTHOR = "T. Fujito",
title = {A Note on Approximation of the Vertex Cover and Feedback
Vertex Set Problems --- Unified Approach},
journal = ipl,
volume = {59},
number = {2},
year = {1996},
pages = {59--63},
}
@article{Fuj99,
AUTHOR = "T. Fujito",
title = "Approximating Node-Deletion Problems for Matroidal Properties",
journal = jalg,
volume = "31",
number = "1",
pages = "211--227",
year = "1999",
}
@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 = ""
}
@inproceedings{FujOku2001,
author = {T. Fujito and
T. Okumura},
title = {A Modified Greedy Algorithm for the Set Cover Problem with
Weights 1 and 2},
booktitle = {Algorithms and Computation, 12th International Symposium, ISAAC},
year = {2001},
pages = {670--681},
editor = {P. Eades and
T. Takaoka},
publisher = {Springer},
series = {LNCS},
volume = {2223},
}
@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{Fuj2001,
AUTHOR = "T. Fujito",
TITLE = "On approximability of the independent / connected edge dominating set problems",
journal = ipl,
year = {2001},
OPTkey = {},
volume = {79},
OPTnumber = {},
pages = {261--266},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@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{FukKam84,
AUTHOR = "H. Fukuda and K. Kamata",
TITLE = "Inference of tree automata from sample set of trees",
JOURNAL = ijcis,
YEAR = 1984,
month = "",
volume = 13,
number = "",
pages = "177--196",
copy = ""
}
@article{Ful90,
author = {M. A. Fulk},
title = {Prudence and Other Conditions on Formal Language Learning},
journal = icneu,
volume = {85},
year = {1990},
pages = {1--11},
}
@inproceedings{Ful90,
author = {M. A. Fulk},
title = {Robust Separations in Inductive Inference},
year = {1990},
pages = {405--410},
booktitle = {31st Annual Symposium on Foundations of Computer Science,
22-24 October 1990, St. Louis, Missouri, USA},
publisher = {IEEE},
volume = {I},
}
@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",
}
@article{FurMub99,
author = {Z. F{\"u}redi and
D. Mubayi},
title = {Signed Domination in Regular Graphs and Set-Systems},
journal = jcthb,
volume = {76},
number = {2},
year = {1999},
pages = {223--239},
}
@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}
}
@inproceedings{FusDelBra2010,
author = {A. F{\'u}ster-Sabater and
O. Delgado-Mohatar and
L. Brankovic},
title = {On the Linearity of Cryptographic Sequence Generators},
booktitle = {Computational Science and Its Applications, ICCSA (2)},
year = {2010},
pages = {586--596},
editor = {D. Taniar and
O. Gervasi and
B. Murgante and
E. Pardede and
B. O. Apduhan},
publisher = {Springer},
series = {LNCS},
volume = {6017},
}
GGG
@Article{GabTar85,
author = {H.~N. Gabow and R.~E. Tarjan},
title = {A linear-time algorithm for a special case of disjoint set union},
journal = jcss,
year = {1985},
volume = {30},
OPTnumber = {},
pages = {209--221},
}
@Article{Gabetal86,
author = {H.~N. Gabow and Z. Galil and T. Spencer and R.~E. Tarjan},
title = {Efficient algorithms for finding minimum spanning trees in undirected and directed graphs},
journal = combi,
year = {1986},
OPTkey = {},
volume = {6},
OPTnumber = {},
pages = {109--122},
}
@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{GagPogZve2009,
year={2009},
journal={Graphs and Combinatorics},
volume={25},
issue={4},
title={Upper Bounds for $\alpha$-Domination Parameters},
author={Gagarin, A. and Poghosyan, A. and Zverovich, V.},
pages={513--520},
}
@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 = ""
}
@Article{GalMafMor94,
author = {G. Galbiati and F. Maffioli and A. Morzenti},
title = {A short note on the approximability of the {M}aximum {L}eaf {S}panning {T}ree problem},
journal = ipl,
year = {1994},
volume = {52},
pages = {45--49},
}
@article{GalMafMor97,
author = {G. Galbiati and F. Maffioli and A. Morzenti},
title = {On the Approximability of Some Maximum Spanning Tree Problems},
journal = tcs,
volume = {181},
number = {1},
year = {1997},
pages = {107--118},
}
@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 = ""
}
@Article{Gal58,
author = {T. Gallai},
title = {Maximum-{M}inimum {S\"a}tze {\"u}ber {G}raphen},
journal = {Acta Mathematica Hungarica},
year = {1958},
OPTkey = {},
volume = {9},
OPTnumber = {},
pages = {395--434},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{GalMinNic84,
author = {H. Gallaire and
J. Minker and
J. Nicolas},
title = {Logic and Databases: A Deductive Approach},
journal = {ACM Comput. Surv.},
volume = {16},
number = {2},
year = {1984},
pages = {153--185},
}
@inproceedings{GalCalLop2012,
author = {A.~J. Gallego S{\'a}nchez and
J. Calera-Rubio and
D. L{\'o}pez},
title = {Structural Graph Extraction from Images},
booktitle = {Distributed Computing and Artificial Intelligence -- 9th
International Conference, DCAI},
year = {2012},
pages = {717--724},
editor = {S. Omatu and
J. F. De Paz Santana and
S. Rodr\'{\i}guez-Gonz{\'a}lez and
J. M. Molina and
A. M. Bernardos and
J. M. Corchado Rodr\'{\i}guez},
publisher = {Springer},
series = {Advances in Soft Computing},
volume = {151}
}
@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 = ""
}
@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{GalWig83,
AUTHOR = "H. Galperin and A. Wigderson",
TITLE = "Succinct representations of graphs",
JOURNAL = icalt,
YEAR = 1983,
month = "",
volume = 56,
number = "",
pages = "183--198",
copy = ""
}
@Misc{Gam20009,
OPTkey = {Gambette},
author = {P. Gambette},
title = {A Note on Minimum Flip Consensus and Maximum Compatible Subset},
howpublished = {available through {\tt http://www.lirmm.fr/~gambette/2009GambetteMinflip.pdf}},
OPTmonth = {},
OPTyear = {},
OPTnote = {},
OPTannote = {}
}
@inproceedings{GanLod2004,
author = {M.~K. Ganapathy and
S. Lodha},
title = {On Minimum Circular Arrangement},
booktitle = {STACS, 21st Annual Symposium on Theoretical Aspects
of Computer Science},
year = {2004},
pages = {394--405},
editor = {V. Diekert and
M. Habib},
publisher = {Springer},
series = {LNCS},
volume = {2996},
}
@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 = ""
}
@InProceedings{Ganetal2010,
author = {R. Ganian and P. Hlin{\u{e}}n\'y and J. Kneis and D. Meister and J. Obdr{\u{z}}\'alek and P. Rossmanith and S. Sikdar},
title = {Are there any good digraph width measures?},
booktitle = {Parameterized and Exact Computation IPEC},
pages = {135--146},
year = {2010},
editor = {V. Raman and S. Saurabh},
volume = {6478},
series = {LNCS},
publisher = {Springer},
}
@inproceedings{GanKor2006,
author = {E, R. Gansner and
Y. Koren},
title = {Improved Circular Layouts},
booktitle = {Graph Drawing, GD 2006},
year = {2006},
pages = {386--398},
editor = {M. Kaufmann and
D. Wagner},
publisher = {Springer},
series = {LNCS},
volume = {4372},
year = {2007},
}
@Article{GaoLiu96,
author = {T. Gao and C.~L. Liu},
title = {Minimum crosstalk channel routing},
journal = {IEEE Trans. on CAD},
year = {1996},
OPTkey = {},
volume = {15},
OPTnumber = {},
pages = {465--474},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@inproceedings{Gao2008,
author = {Y. Gao},
title = {Random Instances of {W[2]}-Complete Problems: Thresholds,
Complexity, and Algorithms},
booktitle = {Theory and Applications of Satisfiability Testing, SAT},
year = {2008},
pages = {91--104},
editor = {H. Kleine B{\"u}ning and
X. Zhao},
publisher = {Springer},
series = {LNCS},
volume = {4996},
}
@inproceedings{Gao2008a,
author = {Y. Gao},
title = {Phase Transitions and Complexity of Weighted Satisfiability
and Other Intractable Parameterized Problems},
booktitle = {Proceedings of the Twenty-Third AAAI Conference on Artificial
Intelligence, AAAI},
year = {2008},
pages = {265--270},
editor = {D. Fox and
C. P. Gomes},
publisher = {AAAI Press},
}
@article{Gao2009,
author = {Y. Gao},
title = {Data reductions, fixed parameter tractability, and random
weighted $d$-{CNF} satisfiability},
journal = {Artif. Intell.},
volume = {173},
number = {14},
year = {2009},
pages = {1343--1366},
}
@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 = ""
}
@ARTICLE{Garetal90,
AUTHOR = "P. Garc\'{\i}a and E. Segarra and E. Vidal and I. Galiano",
TITLE = "On the use of the morphic generator grammatical inference {(MGGI)} methodology in automatic speech recognition",
JOURNAL = ijprai,
YEAR = 1990,
month = "",
volume = 4,
number = "",
pages = "667--685",
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 = ""
}
@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 = ""
}
@TECHREPORT{GarOnc93,
AUTHOR = "P. Garc{\'\i a} and J. Oncina",
TITLE = "Inference of recognizable tree sets",
INSTITUTION = "Departamento de Sistemas Inform\'aticos y Computaci\'on, Universidad Polit\'ecnica de Valencia",
YEAR = 1993,
month = "",
number = "DSIC-II/47/93",
address = "\url{http://www.dsic.upv.es/users/tlcc/tlcc.html}",
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 = ""
}
@inproceedings{Garetal2005,
author = {P. Garc\'{\i}a and
J. Ruiz and
A. Cano and
G.~I. Alvarez},
title = {Inference Improvement by Enlarging the Training Set While
Learning {DFA}s},
booktitle = {Progress in Pattern Recognition, Image Analysis and Applications,
10th Iberoamerican Congress on Pattern Recognition, CIARP},
year = {2005},
pages = {59--70},
editor = {A. Sanfeliu and
M. Lazo-Cort{\'e}s},
publisher = {Springer},
series = {LNCS/LNAI},
volume = {3773},
}
@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{GarVazLop2008,
author = {P. Garc\'{\i}a and
M. V\'azquez de Parga and
D. L{\'o}pez},
title = {On the efficient construction of quasi-reversible automata
for reversible languages},
journal = ipl,
volume = {107},
number = {1},
year = {2008},
pages = {13--17},
}
@inproceedings{Garetal2008,
author = {P. Garc\'{\i}a and
M. V\'azquez de Parga and
G.~I. Alvarez and
J. Ruiz},
title = {Learning Regular Languages Using Nondeterministic Finite
Automata},
booktitle = {Implementation and Applications of Automata, 13th International
Conference, CIAA},
year = {2008},
pages = {92--101},
editor = {O.~H. Ibarra and
B. Ravikumar},
publisher = {Springer},
series = {LNCS},
volume = {5148},
}
@article{Garetal2008a,
author = {P. Garc\'{\i}a and
M. V\'azquez de Parga and
G.~I. Alvarez and
J. Ruiz},
title = {Universal automata and {NFA} learning},
journal = tcs,
volume = {407},
number = {1-3},
year = {2008},
pages = {192--202},
}
@article{GarLopPar2012,
author = {P. Garc\'{\i}a and
D. L{\'o}pez and
M. {V{\'a}zquez de Parga}},
title = {Polynomial characteristic sets for DFA identification},
journal = tcs,
volume = {448},
year = {2012},
pages = {41--46},
}
@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 = ""
}
@Article{GarGraJoh78,
author = {M. R. Garey and R.~L. Graham and D. S. Johnson},
title = {Performance guarantees for scheduling algorithms},
journal = {Operations Research},
year = {1978},
OPTkey = {},
volume = {26},
OPTnumber = {},
pages = {3--21},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@inproceedings{GarVazYan93,
author = {N. Garg and
V. V. Vazirani and
M. Yannakakis},
title = {Approximate max-flow min-(multi)cut theorems and their applications},
booktitle = {Proceedings of the Twenty-Fifth Annual ACM Symposium on
Theory of Computing, STOC},
year = {1993},
pages = {698--707},
editor = {S. R. Kosaraju and
D. S. Johnson and
A. Aggarwal},
publisher = {ACM Press},
}
@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{GasSauSte2008,
author = {S. Gaspers and
S. Saurabh and
A. A. Stepanov},
title = {A Moderately Exponential Time Algorithm for Full Degree
Spanning Tree},
booktitle = {Theory and Applications of Models of Computation, 5th International
Conference TAMC},
year = {2008},
pages = {479--489},
editor = {M. Agrawal and
D.-Z. Du and
Z. Duan and
A. Li},
publisher = {Springer},
series = {LNCS},
volume = {4978},
}
@InProceedings{GasSor2009,
author = {S. Gaspers and G.~B. Sorkin},
title = {A Universally Fastest Algorithms for {Max} {2-Sat}, {Max} {2-CSP}, and Everything in Between},
booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms SODA},
OPTcrossref = {},
OPTkey = {},
pages = {606--615},
year = {2009},
editor = {C. Mathieu},
publisher = {ACM Press / SIAM},
OPTnote = {},
OPTannote = {}
}
@article{GasSor2012,
author = {S. Gaspers and G.~B. Sorkin},
title = {A Universally Fastest Algorithms for {Max} {2-Sat}, {Max} {2-CSP}, and Everything in Between},
journal = jcss,
volume = {78},
number = {1},
year = {2012},
pages = {305--335},
}
@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 = ""
}
@article{GauIbaKri2002,
author = {D. R. Gaur and
T. Ibaraki and
R. Krishnamurti},
title = {Constant Ratio Approximation Algorithms for the Rectangle
Stabbing Problem and the Rectilinear Partitioning Problem},
journal = jalg,
volume = {43},
number = {1},
year = {2002},
pages = {138--152},
}
@Article{Gav83,
author = {B. Gavish},
title = {Formulations and algorithms for the capacitated minimal directed tree problem},
journal = jacm,
year = {1983},
OPTkey = {},
volume = {30},
OPTnumber = {},
pages = {118--132},
}
@INPROCEEDINGS{Gavetal01,
AUTHOR = "C. Gavoille and D. 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",
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{GefMerPal2010,
title = "More concise representation of regular languages by automata and regular expressions",
journal = "Information and Computation",
volume = "208",
number = "4",
pages = "385--394",
year = "2010",
author = "V. Geffert and C. Mereghetti and B. Palano",
}
@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 = ""
}
@inproceedings{GelNev2007,
author = {W. Gelade and
F. Neven},
title = {Succinctness of Pattern-Based Schema Languages for {XML}},
booktitle = {Database Programming Languages, 11th International Symposium, DBPL},
year = {2007},
pages = {201--215},
editor = {M. Arenas and
M.~I. Schwartzbach},
publisher = {Springer},
series = {LNCS},
volume = {4797},
}
@inproceedings{Geletal2010,
author = {W. Gelade and
T. Idziaszek and
W. Martens and
F. Neven},
title = {Simplifying {XML} schema: single-type approximations of regular
tree languages},
booktitle = {Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART
Symposium on Principles of Database Systems, PODS},
year = {2010},
pages = {251--260},
editor = {J. Paredaens and
D. Van Gucht},
publisher = {ACM},
year = {2010},
}
@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{GerKob2004,
AUTHOR = "M.~U. Gerber and D. Kobler",
TITLE = "Classes of graphs that can be partitioned to satisfy all their vertices",
JOURNAL = {Australasian Journal of Combinatorics},
YEAR = 2004,
month = "",
volume = 29,
number = "",
pages = "201--214",
copy = ""
}
@inproceedings{GerHee1011,
author = {M. Gerbush and
B. Heeringa},
title = {Approximating Minimum Reset Sequences},
booktitle = {Implementation and Application of Automata -- 15th International
Conference, CIAA 2010},
pages = {154--162},
editor = {M. Domaratzki and
K. Salomaa},
publisher = {Springer},
series = {LNCS},
volume = {6482},
year = {2011},
}
@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 !"
}
@inproceedings{GiaLioWis02,
author = {E. Di Giacomo and
G. Liotta and
S. K. Wismath},
title = {Drawing series-parallel graphs on a box},
booktitle = {Canadian Conference on Computational Geometry, CCCG},
year = {2002},
pages = {149--153},
}
@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 = ""
}
@InCollection{GiaRes97,
author = {D. Giammarresi and A. Restivo},
title = {Two-dimensional languages},
crossref = {RozSal97III},
OPTkey = {},
pages = {215--267},
OPTpublisher = {},
OPTyear = {},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
OPTchapter = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@ARTICLE{GiaMon99,
AUTHOR = " D. Giammarresi 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 = ""
}
@inproceedings{GigBra2002,
author = {H. Giggins and L. Brankovic},
title = {Ethical and Privacy Issues in Genetic Databases},
year = {2002}, pages={34--45},
booktitle = {Proceedings of the 3rd Australian Institute of Computer
Ethics Conference AiCE2002}
}
@InProceedings{GigBra2008,
author = {H. Giggins and L. Brankovic},
title = {Statistical disclosure control: To trust or not to trust},
booktitle = {International Symposium on Computer Science and Its Applications, CSA},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {2008},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@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. Gilbert",
TITLE = "Geometry of radix reprsentations",
BOOKTITLE = "The Geometric Vein. The Coxeter Festschrift",
PUBLISHER = "New York: Springer",
YEAR = 1981,
month = "",
volume = "",
editor = "C. Davis and B. Gr{\"u}nbaum and F.A. Sherk",
series = "",
chapter = "",
pages = "129--139",
address = "",
type = "",
copy = ""
}
@ARTICLE{Gil82,
AUTHOR = "W. J. Gilbert",
TITLE = "Fractal geometry derived from complex bases",
JOURNAL = tmi,
YEAR = 1982,
month = "",
volume = 4,
number = "",
pages = "78--86",
copy = ""
}
@ARTICLE{Gil82a,
AUTHOR = "W. J. Gilbert",
TITLE = "Complex numbers with three radix expansions",
JOURNAL = cjm,
YEAR = 1982,
month = "",
volume = "XXXIV",
number = "6",
pages = "1335--1348",
copy = ""
}
@UNPUBLISHED{Gil83,
AUTHOR = "W. J. Gilbert",
TITLE = "The fractal dimension of sets derived from complex bases",
NOTE = "To appear in: Canadian Mathematical Bulletin \cite{Gil86a}",
year = 1983,
month = dec,
copy = ""
}
@ARTICLE{Gil84,
AUTHOR = "W. J. Gilbert",
TITLE = "Arithmetic in complex bases",
JOURNAL = mm,
YEAR = 1984,
month = mar,
volume = 57,
number = "2",
pages = "77--81",
copy = ""
}
@ARTICLE{Gil84a,
AUTHOR = "W. J. Gilbert",
TITLE = "A cube-filling {H}ilbert curve",
JOURNAL = tmi,
YEAR = 1984,
month = "",
volume = 6,
number = "3",
pages = "78",
copy = ""
}
@UNPUBLISHED{Gil86,
AUTHOR = "W. J. Gilbert",
TITLE = "Complex bases and fractal similarity",
NOTE = "to appear in: Ann. sc. Quebec, Proceedings of the
Workshop in Fractal Geometry",
year = 1986,
month = jul,
copy = ""
}
@ARTICLE{Gil86a,
AUTHOR = "W. J. Gilbert",
TITLE = "The fractal dimension of sets derived from complex bases",
JOURNAL = canmathbull,
YEAR = 1986,
month = "",
volume = 29,
number = "",
pages = "495--500",
copy = ""
}
@ARTICLE{Gil79,
AUTHOR = "J. Giles, Jr.",
TITLE = "Infinite-level replicating dissections of plane figures",
JOURNAL = jctha,
YEAR = 1979,
month = "",
volume = 26,
number = "",
pages = "319--327",
copy = ""
}
@ARTICLE{Gil79a,
AUTHOR = "J. Giles, Jr.",
TITLE = "Construction of replicating superfigures",
JOURNAL = jctha,
YEAR = 1979,
month = "",
volume = 26,
number = "",
pages = "328--334",
copy = ""
}
@ARTICLE{Gil79b,
AUTHOR = "J. Giles, Jr.",
TITLE = "Superfigures replicating with polar symmetry",
JOURNAL = jctha,
YEAR = 1979,
month = "",
volume = 26,
number = "",
pages = "335--337",
copy = ""
}
@ARTICLE{Gil2005,
AUTHOR = "R. H. Gilman",
TITLE = "Formal languages and their application to combinatorial group theory",
JOURNAL = {Contemporary Mathematics},
YEAR = 2005,
month = "",
volume = 378,
number = "",
pages = "1--36",
copy = ""
}
@inproceedings{GilDra2005,
author = {S. Gilmour and
M. Dras},
title = {A Two-Pronged Attack on the Dragon of Intractability},
booktitle = {Computer Science 2005, Twenty-Eighth Australasian Computer
Science Conference ACSC},
year = {2005},
pages = {183--192},
editor = {V. Estivill-Castro},
publisher = {Australian Computer Society},
series = {CRPIT},
volume = {38},
}
@inproceedings{GilDra2006,
author = {S. Gilmour and
M. Dras},
title = {Kernelization as Heuristic Structure for the Vertex Cover
Problem},
booktitle = {Ant Colony Optimization and Swarm Intelligence, 5th International
Workshop, ANTS},
year = {2006},
pages = {452--459},
editor = {M. Dorigo and
L. M. Gambardella and
M. Birattari and
A. Martinoli and
R. Poli and
T. St{\"u}tzle},
publisher = {Springer},
series = {LNCS},
volume = {4150},
}
@ARTICLE{GimMahVir97,
AUTHOR = "J. Gimbel and M. Mah\'eo and C. Virlouvet",
TITLE = "Double total domination in graphs",
JOURNAL = dm,
YEAR = 1997,
month = "",
volume = {165/166},
number = "",
pages = "343--351",
copy = ""
}
@ARTICLE{GimTho2000,
AUTHOR = "J. Gimbel and C. Thomassen",
TITLE = "Coloring triangle-free graphs with fixed size",
JOURNAL = dm,
YEAR = 2000,
month = "",
volume = 219,
number = "",
pages = "275--277",
copy = ""
}
@ARTICLE{GinGre69,
AUTHOR = "S. Ginsburg and S. Greibach",
TITLE = "Abstract families of languages",
JOURNAL = memams,
YEAR = 1969,
VOLUME = 87,
NUMBER = "",
PAGES = "1--32",
copy = "hier findet sich der gesamte Band 87"
}
@INPROCEEDINGS{GinGreHar66,
AUTHOR = "S. Ginsburg and S. A. Greibach and M. A. Harrison",
TITLE = "One-way stack automata - extended abstract",
BOOKTITLE = "7th annual symposium on switching and
automata theory",
YEAR = 1966,
PAGES = "47--52",
ORGANIZATION = "IEEE",
copy = ""
}
@ARTICLE{GinGreHop69,
AUTHOR = "S. Ginsburg and S. Greibach and J. Hopcroft",
TITLE = "Pre-AFL",
JOURNAL = memams,
YEAR = 1969,
VOLUME = 87,
NUMBER = "",
PAGES = "41--51",
copy = "befindet sich mit dem gesamten Band 87 unter Ginsburg & Greibach"
}
@ARTICLE{GinRoz75,
AUTHOR = "S. Ginsburg and G. Rozenberg",
TITLE = "{T0L} schemes and control sets",
JOURNAL = icalt,
YEAR = "1975",
VOLUME = "27",
NUMBER = "",
PAGES = "109--125",
MONTH = "",
note = ""
}
@ARTICLE{GinSpa66,
AUTHOR = "S. Ginsburg and E. H. Spanier",
TITLE = "Semigroups, Presburger formulas, and languages",
JOURNAL = pjm,
YEAR = 1966,
VOLUME = 16,
NUMBER = 2,
PAGES = "285--296",
copy = ""
}
@ARTICLE{GinSpa66a,
AUTHOR = "S. Ginsburg and E. H. Spanier",
TITLE = "Finite-turn pushdown automata",
JOURNAL = siamcontr,
YEAR = 1966,
VOLUME = 4,
NUMBER = "3",
PAGES = "429--453",
copy = ""
}
@ARTICLE{GinSpa68,
AUTHOR = "S. Ginsburg and E. H. Spanier",
TITLE = "Derivation-bounded languages",
JOURNAL = jcss,
YEAR = 1968,
month = "",
volume = 2,
number = "",
pages = "228--250",
copy = ""
}
@ARTICLE{GinSpa68a,
AUTHOR = "S. Ginsburg and E. H. Spanier",
TITLE = "Control sets on grammars",
JOURNAL = mst,
YEAR = 1968,
month = "",
volume = 2,
number = "",
pages = "159--177",
copy = ""
}
@ARTICLE{GinSpa71,
AUTHOR = "S. Ginsburg and E. H. Spanier",
TITLE = "{AFL} with the semilinear property",
JOURNAL = jcss,
YEAR = 1971,
VOLUME = 5,
NUMBER = "",
PAGES = "365--396",
copy = ""
}
@TECHREPORT{GisSwa92,
AUTHOR = "S. J. Gismondi and E. R. Swart",
TITLE = "A polynomial-time procedure for resolving the graph
isomorphism problem",
INSTITUTION = "University of Guelph",
YEAR = 1992,
month = oct,
number = "CIS92-D4",
address = "",
copy = ""
}
@TECHREPORT{GisSwa92a,
AUTHOR = "S. J. Gismondi and E. R. Swart",
TITLE = "A polynomial-time solution to the travelling
salesperson problem",
INSTITUTION = "University of Guelph",
YEAR = 1992,
month = sep,
number = "CIS92-D6",
address = "",
copy = ""
}
@TECHREPORT{GlaReiVol99,
AUTHOR = "C. Gla{\ss}er and S. Reith and H. Vollmer",
TITLE = "Approximation Algorithms for Cellular Network Optimization",
INSTITUTION = "University of Wuerzburg",
YEAR = 1999,
month = "",
number = "TR No. 232",
address = "",
copy = ""
}
@INPROCEEDINGS{GlaReiVol2000,
AUTHOR = "C. Gla{\ss}er and S. Reith and H. Vollmer",
TITLE = "The Complexity of Base Station Positioning in Cellular Networks",
BOOKTITLE = "Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), Geneva, Switzerland",
YEAR = 2000,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "??--",
address = "",
organization = "",
copy = ""
}
@article{GleKos98,
title = "On the independent domination number of graphs with given minimum degree",
journal = dm,
volume = "188",
number = "1–3",
pages = "261--266",
year = "1998",
author = "N.~I. Glebov and A.~V. Kostochka"
}
@INPROCEEDINGS{GoaBenEtz96,
AUTHOR = "T. Goan and N. Benson and O. Etzioni",
TITLE = "A grammatical inference algorithm for the {W}orld {W}ide {W}eb",
BOOKTITLE = "Working Notes of the AAAI-96 Spring Symposium on Machine Learning in Information Access",
YEAR = 1996,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "",
address = "",
organization = "",
publisher = "",
copy = ""
}
@ARTICLE{GodHedHed2005,
AUTHOR = "W. Goddard and S. M. Hedetniemi and S. T. Hedetniemi",
TITLE = "Eternal security in graphs",
JOURNAL = {J. Combin. Math. Combin. Comput.},
YEAR = 2005,
month = "",
volume = {52},
number = "",
pages = "169--180",
copy = ""
}
@ARTICLE{GodHed2009,
AUTHOR = "W. Goddard and S. T. Hedetniemi",
TITLE = "A Note on Trees, Tables, and Algorithms",
JOURNAL = {Networks},
YEAR = 2009,
month = "",
volume = {53},
number = "",
pages = "184--190",
copy = ""
}
@ARTICLE{GoeRoz91,
AUTHOR = "N. S. Goel and I. Rozehnal",
TITLE = "Some non-biological applications of {L}-systems",
JOURNAL = ijgs,
YEAR = 1991,
month = "",
volume = 18,
number = "",
pages = "321--405",
copy = ""
}
@ARTICLE{GoeGoo91,
AUTHOR = "N.S. Goel and M.D. Goodwin",
TITLE = "Symbolic computations using {L}-systems",
JOURNAL = applmathcomp,
YEAR = 1991,
month = "",
volume = 42,
number = "",
pages = "223--253",
copy = "Mathebuecherei"
}
@ARTICLE{GoeWil95,
AUTHOR = "M. X. Goemans and D. P. Williamson",
TITLE = "A general approximation technique for constrained forest problems",
JOURNAL = siam,
YEAR = 1995,
month = "",
volume = 24,
number = "",
pages = "296--317",
copy = ""
}
@Article{GoeWil95a,
author = {M. X. Goemans and D. P. Williamson},
title = {Improved Approximation Algorithms for
Maximum Cut and Satisfiability Problems Using
Semidefinite Programming},
journal = jacm,
year = {1995},
OPTkey = {},
volume = {42},
OPTnumber = {},
pages = {1115--1145},
}
@article{GoeWil98,
author = "M. X. Goemans and D. P. Williamson",
title = "Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs",
journal = "Combinatorica",
volume = "18",
number = "1",
pages = "37-59",
year = "1998"}
@ARTICLE{Goe58,
AUTHOR = "A. Goetz",
TITLE = "Bemerkungen {\"u}ber {H}ausdorffsche {M}a\ss e und
{H}ausdorffsche {D}imensionen in {L}ieschen {G}ruppen",
JOURNAL = collmath,
YEAR = 1958,
month = "",
volume = 5,
number = "",
pages = "55--65",
copy = ""
}
@article{Goh97,
author = {W. G{\"o}hring},
title = {Minimal Initializing Word: A Contribution to {{\v C}}ern\'y's Conjecture},
journal = jalc,
volume = {2},
number = {4},
year = {1997},
pages = {209--226},
}
@ARTICLE{GolMatVai96,
AUTHOR = "J. S. Golan and A. Mateescu and D. Vaida",
TITLE = "Semirings and parallel composition of processes",
JOURNAL = jalc,
YEAR = 1996,
month = "",
volume = 1,
number = "",
pages = "199--217",
copy = ""
}
@ARTICLE{Gol72,
AUTHOR = "E. M. Gold",
TITLE = "System identification via state characterization",
JOURNAL = {Automatica},
YEAR = 1972,
month = "",
volume = 8,
number = "",
pages = "621--636",
copy = ""
}
@ARTICLE{Gol67,
AUTHOR = "E. M. Gold",
TITLE = "Language identification in the limit",
JOURNAL = icalt,
YEAR = 1967,
month = "",
volume = 10,
number = "",
pages = "447--474",
copy = ""
}
@ARTICLE{Gol78,
AUTHOR = "E.~M. Gold",
TITLE = "Complexity of automaton identification from given data",
JOURNAL = icalt,
YEAR = 1978,
month = "",
volume = 37,
number = "",
pages = "302--320",
copy = ""
}
@article{Gol78a,
author = {E.~M. Gold},
title = {Deadlock Prediction: Easy and Difficult Cases},
journal = siam,
volume = {7},
number = {3},
year = {1978},
pages = {320--336},
}
@InProceedings{GolUpa95,
author = {S. Goldberg and S. J. Upadhyaya },
title = {Utilizing Spares in Multichip Modules for the Dual Function of Fault Coverage and Fault Diagnosis},
booktitle = {Proceedings of the IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems (DFT '95)},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
OPTyear = {},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}
@InProceedings{GolUpaFuc96,
author = {S. R. Goldberg and S. J. Upadhyaya
and W. K. Fuchs },
title = {Recovery Schemes for Mesh Arrays Utilizing Dedicated Spares},
booktitle = {Proceedings of the 1996 Workshop on Defect and Fault-Tolerance in VLSI Systems (DFT '96)},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
OPTyear = {},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{GolSpeBer95,
AUTHOR = "M. K. Goldberg and T. H. Spencer and D. A. Berque",
TITLE = "A low-exponential algorithm for counting vertex covers",
JOURNAL = {Graph Theory, Combinatorics, Algorithms, and Applications},
YEAR = 1995,
month = "",
volume = 1,
number = "",
pages = "431--444",
copy = ""
}
@ARTICLE{Gol93,
AUTHOR = "R. R. Goldberg",
TITLE = "Finite State Automata from Regular Expression Trees",
JOURNAL = "The Computer Journal",
YEAR = 1993,
month = "",
volume = 36,
number = "7",
pages = "623--630",
copy = ""
}
@article{GolKea95,
author = {S.~A. Goldman and M.~J. Kearns},
title = {On the Complexity of Teaching},
journal = jcss,
volume = {50},
number = {1},
year = {1995},
pages = {20--31},
}
@ARTICLE{GolMat96,
AUTHOR = "S.~A. Goldman and H. D. Mathias",
TITLE = "Teaching a smarter learner",
JOURNAL = jcss,
YEAR = 1996,
month = "",
volume = 52,
number = "2",
pages = "255--267",
copy = ""
}
@article{GolKwe2002,
author = {S.~A. Goldman and
S. Kwek},
title = {On learning unions of pattern languages and tree patterns
in the mistake bound model},
journal = tcs,
volume = {288},
number = {2},
year = {2002},
pages = {237--254},
}
@InCollection{2010,
author = {S.~A. Goldman},
title = {Computational Learning Theory},
booktitle = {Algorithms and Theory of Computation Handbook},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
publisher = {Chapman \& Hall},
year = {2010},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
chapter = {26},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@TECHREPORT{GolTre2001,
AUTHOR = "O. Goldreich and L. Trevisan",
TITLE = "Three theorems regarding testing graph properties",
INSTITUTION = "Electronic Colloquium on Computational Complexity",
YEAR = 2001,
month = jan,
number = "ECCC-10",
address = "",
copy = ""
}
@ARTICLE{GolLevMun96,
AUTHOR = "J. Goldsmith and M. A. Levy and M. Mundhenk",
TITLE = "Limited Nondetermism",
JOURNAL = {SIGACT News},
YEAR = 1996,
month = "",
volume = 27,
number = "2",
pages = "20--29",
copy = ""
}
@INPROCEEDINGS{Gol79,
crossref = "Mau79",
AUTHOR = "J. Goldstine",
TITLE = "A rational theory of {AFL}s",
chapter = "",
pages = "271--281",
copy = ""
}
@ARTICLE{GolLeuWot92,
AUTHOR = "J. Goldstine and H. Leung and D. Wotschke",
TITLE = "On the relation between ambiguity and nondeterminism
in finite automata",
JOURNAL = icneu,
YEAR = 1992,
month = "",
volume = 100,
number = "",
pages = "261--270",
copy = ""
}
@ARTICLE{Gol85,
AUTHOR = "E. Ch. Goles",
TITLE = "Dynamics of positive automata networks",
JOURNAL = tcs,
YEAR = 1985,
month = "",
volume = 41,
number = "",
pages = "19--32",
copy = ""
}
@Article{GolBau65,
author = {S.~W. Golomb and L.~D. Baumert},
title = {Backtrack programming},
journal = jacm,
year = {1965},
volume = {12},
OPTnumber = {},
pages = {516--524},
}
@inproceedings{GolKra2008,
author = {P.~A. Golovach and
J. Kratochv\'{\i}l},
title = {Generalized Domination in Degenerate Graphs: A Complete
Dichotomy of Computational Complexity},
booktitle = {Theory and Applications of Models of Computation, 5th International
Conference, TAMC},
year = {2008},
pages = {182--191},
editor = {M. Agrawal and
D.-Z. Du and
Z. Duan and
A. Li},
publisher = {Springer},
series = {LNCS},
volume = {4978},
}
@article{Goletal2011,
author = {P. Golovach and P. Heggernes and D. Kratsch and D. Lokshtanov and
D. Meister and S. Saurabh},
title = {Bandwidth on {AT}-free graphs},
journal = tcs,
volume = {412},
year = {2011},
pages = {7001--7008},
}
@article{GolThi2011,
author = {P.~A. Golovach and
D.~M. Thilikos},
title = {Paths of bounded length and their cuts: Parameterized complexity
and algorithms},
journal = {Discrete Optimization},
volume = {8},
number = {1},
year = {2011},
pages = {72--86},
}
@article{Goletal2012,
author = {P.~A. Golovach and M. Kami\'nski and D. Paulusma and D.~M. Thilikos},
title = {Containment relations in split graphs},
journal = dam,
volume = {160},
number = {1-2},
year = {2012},
pages = {155--163},
}
@article{Goletal2012a,
author = {P.~A. Golovach and
J. Kratochv\'{\i}l and
O. Such{\'y}},
title = {Parameterized complexity of generalized domination problems},
journal = dam,
volume = {160},
number = {6},
year = {2012},
pages = {780--792},
}
@inproceedings{GolHofPau2012,
author = {P.~A. Golovach and
P. van 't Hof and
D. Paulusma},
title = {Obtaining Planarity by Contracting Few Edges},
pages = {455--466},
ee = {http://dx.doi.org/10.1007/978-3-642-32589-2_41},
crossref = {DBLP:conf/mfcs/2012},
}
@Article{GolLas93,
author = {M.~C. Golumbic and R. Laskar},
title = {Irredundancy in circular-arc graphs},
journal = dam,
year = {1993},
OPTkey = {},
volume = {44},
OPTnumber = {},
pages = {79--90},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@INPROCEEDINGS{Gom2000,
AUTHOR = "C.~P. Gomes",
TITLE = "Structure, Duality, and Randomization --- Common Themes in {AI} and {OR}. Invited Plenary Talk.",
BOOKTITLE = "Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00)",
YEAR = 2000,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "",
address = "",
organization = "",
publisher = "",
copy = ""
}
@inproceedings{GomAlv2008,
author = {A.~C. G{\'o}mez and
G. I. \'Alvarez},
title = {Learning Commutative Regular Languages},
booktitle = {Grammatical Inference: Algorithms and Applications, 9th
International Colloquium, ICGI},
year = {2008},
pages = {71--83},
editor = {A. Clark and
F. Coste and
L. Miclet},
publisher = {Springer},
series = {LNCS},
volume = {5278},
}
@article{Gonetal2011,
author = {D. Gon\c{c}alves and
A. Pinlou and
M. Rao and
S. Thomass{\'e}},
title = {The Domination Number of Grids},
journal = siamdm,
volume = {25},
number = {3},
year = {2011},
pages = {1443--1453},
}
@ARTICLE{GonKleRoz83,
AUTHOR = "J. Gonczarowski and H. C. M. Kleijn and G. Rozenberg",
TITLE = "Closure properties of selective substitution grammars",
JOURNAL = ijcm,
YEAR = 1983,
VOLUME = 14,
NUMBER = "",
PAGES = "19--42,109--135",
copy = ""
}
@ARTICLE{GonSha85,
AUTHOR = "J. Gonczarowski and E. Shamir",
TITLE = "Pattern selector grammars and several parsing algorithms in the context-free style",
JOURNAL = jcss,
YEAR = 1985,
VOLUME = 30,
NUMBER = "",
PAGES = "249--273",
copy = ""
}
@ARTICLE{GonWar85,
AUTHOR = "J. Gonczarowski and M. K. Warmuth",
TITLE = "Applications of scheduling theory to formal language theory",
JOURNAL = tcs,
YEAR = 1985,
VOLUME = 37,
NUMBER = "",
PAGES = "217--243",
copy = ""
}
@ARTICLE{GonWar86,
AUTHOR = "J. Gonczarowski and M. K. Warmuth",
TITLE = "Manipulating derivation forests by scheduling techniques",
JOURNAL = tcs,
YEAR = 1986,
VOLUME = 45,
NUMBER = "",
PAGES = "87--119",
copy = ""
}
@ARTICLE{GonWar89,
AUTHOR = "J. Gonczarowski and M. K. Warmuth",
TITLE = "Scattered versus context-sensitive rewriting",
JOURNAL = actainform,
YEAR = 1989,
month = "",
volume = 27,
number = "",
pages = "81--95",
copy = ""
}
@inproceedings{Gon92,
author ="G. Gonnet",
title= "Efficient Two-Dimensional Searching (Invited)",
series = "Lecture Notes in Computer Science",
volume = "621",
pages = "317",
year = "1992",
booktitle = {Algorithm Theory -- SWAT'92}
}
@ARTICLE{Gon84,
AUTHOR = "T.~F. Gonzalez",
TITLE = "An approximation algorithm for the multi-via assignment problem",
JOURNAL = ieeetocad,
YEAR = 1984,
month = "",
volume = 3,
number = "",
pages = "257--264",
copy = ""
}
@article{Gon85,
AUTHOR = "T.~F. Gonzalez",
title = "Clustering to minimize the maximum intercluster distance",
journal = tcs,
volume = "38",
number = "0",
pages = "293--306",
year = "1985",
}
@ARTICLE{Goo46,
AUTHOR = "I. J. Good",
TITLE = "Normal recurring decimals",
JOURNAL = jlms,
YEAR = 1946,
month = "",
volume = 21,
number = "",
pages = "167--169",
copy = ""
}
@INPROCEEDINGS{Goo91,
crossref = "PeiHenPen91",
AUTHOR = "G. S. Goodman",
TITLE = "A probabilist looks at the chaos game",
chapter = "",
pages = "159--168",
copy = ""
}
@INCOLLECTION{Goo71,
AUTHOR = "B. C. Goodwin",
TITLE = "Biology and meaning",
BOOKTITLE = "Towards a Theoretical Biology 4",
PUBLISHER = "",
YEAR = "1971",
EDITOR = "Waddington",
CHAPTER = "",
PAGES = "259--275",
ADDRESS = "",
MONTH = "",
note = ""
}
@inproceedings{GorKou86,
author = {P. Goralcik and
V. Koubek},
title = {On Discerning Words by Automata},
booktitle = {Automata, Languages and Programming, 13th International
Colloquium, ICALP},
year = {1986},
pages = {116--122},
editor = {L. Kott},
publisher = {Springer},
series = {LNCS},
volume = {226},
}
@article{GorKou98,
author = {P. Goralcik and
V. Koubek},
title = {On the Disjunctive Set Problem},
journal = tcs,
volume = {204},
number = {1-2},
year = {1998},
pages = {99--118},
}
@article{GorKrz2010,
author = {T. A. Gorazd and
J. Krzaczkowski},
title = {Term equation Satisfiability over Finite Algebras},
journal = {International Journal of Algebra and Computation},
volume = {20},
number = {8},
year = {2010},
pages = {1001--1020},
}
@Unpublished{GorKrz2009,
author = {T. A. Gorazd and
J. Krzaczkowski},
title = {The complexity of problems connected with two-element algebras},
note = {Received in 2010},
OPTkey = {},
OPTmonth = {},
OPTyear = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@INPROCEEDINGS{GorSto88,
crossref = "Hyper3",
AUTHOR = "J. M. Gordon and Q. F. Stout",
TITLE = "Hypercube message routing in the presence of faults",
chapter = "6",
pages = "318--327",
copy = ""
}
@article{Goretal2003,
author = {D.~B. Gordon and
G. K. Hom and
S. L. Mayo and
N. A. Pierce},
title = {Exact rotamer optimization for protein design},
journal = {Journal of Computational Chemistry},
volume = {24},
number = {2},
year = {2003},
pages = {232--243},
}
@ARTICLE{Gor80,
AUTHOR = "I. Gorun",
TITLE = "On intersections of context-free languages",
JOURNAL = fundinform,
YEAR = 1980,
month = "",
volume = 3,
number = "4",
pages = "491--496",
copy = ""
}
@Article{Got84,
author ="G. V. Gotchev",
title ={Computer Linguistic analysis of line drawings},
year ="1984",
journal =patrec,
volume ="17",
pages ="433--440",
}
@INPROCEEDINGS{GotLeoSca01,
AUTHOR = "G. Gottlob and N. Leone and F. Scarcello",
TITLE = "Hypertree decompositions: a survey",
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 = "37--57",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@ARTICLE{GotScaSid2002,
AUTHOR = "G. Gottlob and F. Scarcello and M. Sideri",
TITLE = "Fixed-parameter complexity in {AI} and nonmonotonic reasoning",
JOURNAL = {Artif. Intell.},
YEAR = 2002,
month = "",
volume = 138,
number = "",
pages = "55--86",
copy = ""
}
@article{GotKolSch2004,
author = {G. Gottlob and
P.~G. Kolaitis and
T. Schwentick},
title = {Existential second-order logic over graphs: Charting the
tractability frontier},
journal = jacm,
volume = {51},
number = {2},
year = {2004},
pages = {312--362},
}
@Article{GotSze2008,
author = {G. Gottlob and S. Szeider},
title = {Fixed-Parameter Algorithms for Artificial Intelligence, Constraint Satisfaction, and Database Problems},
journal = {The Computer Journal},
year = {2008},
OPTkey = {},
volume = {51},
OPTnumber = {},
pages = {303--325},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@InProceedings{GotPicWei2008,
author = {G. Gottlob and R. Pichler and F. Wei},
title = {Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation},
booktitle = {National Conference on Artificial Intelligence AAAI 2008},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {2008},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {AAAI Press},
note = {To appear},
OPTannote = {}
}
@article {GouRis93,
author = {Gournay, L. and Risler, J.},
title = {Construction of roadmaps in semi-algebraic sets},
journal = {Applicable Algebra in Engineering, Communication and Computing},
pages = {239--252},
volume = {4},
issue = {4},
year = {1993}
}
@ARTICLE{GovShi90,
AUTHOR = "V. K. Govindan and A. P. Shivaprasad",
TITLE = "Character recognition -- an overview",
JOURNAL = patrec,
YEAR = 1990,
month = "",
volume = 23,
number = "",
pages = "671--683",
copy = ""
}
@INPROCEEDINGS{GovLanRam92,
AUTHOR = "R. Govindan and M. Langston and S. Ramachandramurthi",
TITLE = "A practical approach to layout optimization",
BOOKTITLE = "Proc. Intern. Conf. {VLSI} Design, Bombay",
YEAR = 1992,
month = jan,
volume = "",
editor = "",
series = "",
chapter = "",
pages = "??",
address = "",
organization = "", note = {Confer Technical Report \cite{GovLanRam92a}},
copy = ""
}
@TechReport{GovLanRam92a,
author = "R. Govindan and M. A. Langston and S.
Ramachandramurthi",
title = "A Practical Approach to Layout Optimization",
institution = "Department of Computer Science, University of
Tennessee",
number = "UT-CS-92-176",
month = oct,
year = "1992",
url = "ftp://cs.utk.edu/pub/TechReports/1992/ut-cs-92-176.ps.Z",
}
@TechReport{GovLanRam97,
author = "R. Govindan and M. A. Langston and
S. Ramachandramurthi",
title = "Constructive Algorithms Based on Graph Minor",
institution = "Department of Computer Science, University of
Tennessee",
number = "UT-CS-97-345",
month = jan,
year = "1997",
url = "ftp://cs.utk.edu/pub/TechReports/1997/ut-cs-97-345.ps.Z",
}
@INPROCEEDINGS{Govetal91,
AUTHOR = "R. Govindarajan and L. Guo and S. Yu and P. Wang",
TITLE = "Par{C} project: practical constructs for parallel programming languages",
BOOKTITLE = "Proc. of the 15th Annual {IEEE} international computer software and applications conference",
YEAR = 1991,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "183--189",
address = "",
organization = "IEEE",
copy = ""
}
@INPROCEEDINGS{Gra91,
AUTHOR = "E. Gr{\"a}del",
TITLE = "The expressive power of second-order {H}orn logic",
BOOKTITLE = "8th Symp. on Theor. Aspects of Comp. Sci. STACS'91",
YEAR = 1991,
month = "",
volume = "480",
editor = "",
series = "LNCS",
chapter = "",
pages = "466--477",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{Gra91a,
AUTHOR = "E. Gr{\"a}del",
TITLE = "On transitive closure logic",
BOOKTITLE = "Computer Science Logic",
YEAR = 1991,
month = "",
volume = "626",
editor = "E. B{\"o}rger and others",
series = "LNCS",
chapter = "",
pages = "149--163",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{Gra84,
crossref = "Flaetal84",
AUTHOR = "S. Graf",
TITLE = "Random homeomorphisms",
chapter = "Part 1",
pages = "102--106",
copy = ""
}
@ARTICLE{Graetal86,
AUTHOR = "S. Graf and others",
TITLE = "Random homeomorphisms",
JOURNAL = am,
YEAR = 1986,
month = "",
volume = "60",
number = "",
pages = "239--359",
copy = ""
}
@BOOK{Graetal88,
AUTHOR = "S. Graf and others",
TITLE = "The exact {H}ausdorff dimension in random recursive constructions",
PUBLISHER = "Providence, Rhode Island: {AMS}",
YEAR = 1988,
month = "",
volume = "71 [Number 381]",
edition = "",
series = memams,
copy = ""
}
@article{Gra69,
author = {R.~L. Graham},
title = {Bounds on Multiprocessing Timing Anomalies},
journal = siamam,
volume = {17},
number = {2},
year = {1969},
pages = {416--429},
}
@Article{GraHel85,
author = {R.~L. Graham and P. Hell},
title = {On the history of the minimum spanning tree problem},
journal = {Annals of the History of Computing},
year = {1985},
OPTkey = {},
volume = {7},
OPTnumber = {},
pages = {43--57},
}
@ARTICLE{GraWin85,
AUTHOR = "R. L. Graham and P. M. Winkler",
TITLE = "On isometric embeddings of graphs",
JOURNAL = tams,
YEAR = 1985,
VOLUME = 288,
NUMBER = 2,
PAGES = "527--536",
copy = ""
}
@ARTICLE{GraNykUkk99,
AUTHOR = "G. Grahne and M. Nyk{\"a}nen and E. Ukkonen",
TITLE = "Reasoning about strings in databases",
JOURNAL = jcss,
YEAR = 1999,
month = "",
volume = 59,
number = "",
pages = "116--162",
copy = ""
}
@inproceedings{GraMan2011,
author = {R. Gramatovici and
F. Manea},
title = {$k$-Local Internal Contextual Grammars},
booktitle = {Descriptional Complexity of Formal Systems - 13th International
Workshop, DCFS},
year = {2011},
pages = {172--183},
editor = {M. Holzer and
M. Kutrib and
G. Pighizzini},
publisher = {Springer},
series = {LNCS},
volume = {6808},
}
@INPROCEEDINGS{GraGuoNie03,
AUTHOR = "J. Gramm and J. Guo and R. Niedermeier",
TITLE = "On exact and approximation algorithms for distinguishing substring selection",
BOOKTITLE = "Proceedings of the 14th International Symposium on Fundamentals of Computation Theory FCT 2003",
YEAR = 2003,
month = "",
volume = "2751",
editor = "",
series = "LNCS",
chapter = "",
pages = "195--209",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@inproceedings{GraNie2000,
author = {J. Gramm and
R. Niedermeier},
title = {Faster Exact Solutions for {MAX2SAT}},
booktitle = {Algorithms and Complexity, 4th Italian Conference, CIAC 2000},
year = {2000},
pages = {174--186},
publisher = {Springer}, series = {LNCS}, volume = {1767},
}
@INPROCEEDINGS{GraNie01,
AUTHOR = "J. Gramm and R. Niedermeier",
TITLE = "Quartet Inconsistency is fixed parameter
tractable",
BOOKTITLE = "Proceedings of the 12th Annual Symposium on
Combinatorial Pattern Matching (CPM 2001)",
YEAR = 2001,
month = "",
volume = "2089",
editor = "A. Amir and G.~M. Landau",
series = "LNCS",
chapter = "",
pages = "241--256",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@INPROCEEDINGS{Graetal03,
AUTHOR = "J. Gramm and J. Guo and F. H{\"u}ffner and R. Niedermeier",
TITLE = "Graph-modeled data clustering: fixed-parameter algorithms for clique generation",
BOOKTITLE = "Proceedings of the 5th Italian Conference on Algorithms and Complexity CIAC 2003",
YEAR = 2003,
month = "",
volume = "2653",
editor = "",
series = "LNCS",
chapter = "",
pages = "108--119",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@INPROCEEDINGS{GraGuoNie2003,
AUTHOR = "J. Gramm and J. Guo and R. Niedermeier",
TITLE = "On exact and approximation algorithms for distinguishing substring selection",
BOOKTITLE = "International Symposium on Fundamentals of Computation Theory FCT",
YEAR = 2003,
month = "",
volume = "2751",
editor = "",
series = "LNCS",
chapter = "",
pages = "195--209",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@ARTICLE{Graetal03a,
AUTHOR = "J. Gramm and E.~A. Hirsch and R. Niedermeier and P. Rossmanith",
TITLE = "Worst-case upper bounds for {MAX-2-SAT} with an application to {MAX-CUT}",
JOURNAL = dam,
YEAR = 2003,
month = "",
volume = 130,
number = "",
pages = "139--155",
copy = ""
}
@PHDTHESIS{Gra2003,
AUTHOR = "J. Gramm",
TITLE = "Fixed-Parameter Algorithms for the Consensus Analysis of Genomic Data",
SCHOOL = "Wilhelm-Schickard-Institut f{\"u}r Informatik, Universit{\"a}t T{\"u}bingen, Germany",
YEAR = 2003,
month = "",
address = "",
type = "Dissertation",
copy = ""
}
@ARTICLE{Graetal2004,
AUTHOR = "J. Gramm and J. Guo and F. H{\"u}ffner and R. Niedermeier",
TITLE = "Automated generation of search tree algorithms for
hard graph modification problems",
JOURNAL = alg,
YEAR = 2004,
month = "",
volume = 39,
number = "",
pages = "321--347",
copy = ""
}
@article{Graetal2007,
author = {J. Gramm and
J. Guo and
F. H{\"u}ffner and
R. Niedermeier and
H.-P. Piepho and
R. Schmid},
title = {Algorithms for compact letter displays: Comparison and evaluation},
journal = {Computational Statistics {\&} Data Analysis},
volume = {52},
number = {2},
year = {2007},
pages = {725--736},
}
@article{Graetal2007a,
author = {J. Gramm and
T. Nierhoff and
R. Sharan and
T. Tantau},
title = {Haplotyping with missing data via perfect path phylogenies},
journal = dam,
volume = {155},
number = {6-7},
year = {2007},
pages = {788--805},
}
@article{GraNicTan2008,
author = {J. Gramm and
A. Nickelsen and
T. Tantau},
title = {Fixed-Parameter Algorithms in Phylogenetics},
journal = {The Computer Journal},
volume = {51},
number = {1},
year = {2008},
pages = {79--101},
}
@article{Graetal2008,
author = {J. Gramm and
J. Guo and
F. H{\"u}ffner and
R. Niedermeier},
title = {Data reduction and exact algorithms for clique cover},
journal = {ACM Journal of Experimental Algorithmics},
volume = {13}, number={2.2},
year = {2008},
}
@article{Graetal2009,
author = {J. Gramm and
T. Hartman and
T. Nierhoff and
R. Sharan and
T. Tantau},
title = {On the complexity of {SNP} block partitioning under the perfect
phylogeny model},
journal = dm,
volume = {309},
number = {18},
year = {2009},
pages = {5610--5617},
}
@Inproceedings{GraRob91,
author ="E. Grandjean and J. M. Robson",
title ="{RAM} with Compact Memory: {A} Realistic and Robust Model
of Computation",
booktitle = {Computer Science Logic; 4th Workshop, CSL},
series = {LNCS},
volume ="533",
pages ="195--233",
year ="1991",
}
@article{Gra2006,
author = {F. Grandoni},
title = {A note on the complexity of minimum dominating set},
journal = jda,
volume = {4},
number = {2},
year = {2006},
pages = {209--214},
}
@ARTICLE{GraHar96,
AUTHOR = "Z. N. Grant-Zully and P. G. Harrison",
TITLE = "Parallelism via homomorphisms",
JOURNAL = ppl,
YEAR = 1996,
month = "",
volume = 6,
number = "2",
pages = "279--295",
copy = ""
}
@ARTICLE{Gra81,
AUTHOR = "P. Grassberger",
TITLE = "On the {H}ausdorff dimension of fractal attractors",
JOURNAL = jsp,
YEAR = 1981,
month = "",
volume = 26,
number = "1",
pages = "173--179",
copy = ""
}
@Article{GraGri98,
author = "J. Gravner and D. Griffeath",
title = "Cellular Automaton Growth on ${Z}^2$: Theorems,
Examples, and Problems",
journal = "Advances in Applied Mathematics",
volume = "21",
year = "1998",
pages = {241--304}
}
@INPROCEEDINGS{Greetal88,
crossref = "Ale88",
AUTHOR = "C. Grebogi and H.E. Nusse and E. Ott and J. A. Yorke",
TITLE = "Basic sets: {S}ets that determine the dimension of
basin boundaries",
chapter = "",
pages = "220--250",
copy = ""
}
@article{GreKis2012,
author = {M. Grech and A. Kisieliwicz},
title = {The {{\v C}}ern\'y conjecture for automata respecting intervals of a directed graph},
journal = {CoRR},
volume = {abs/1207.2556},
year = {2012},
ee = {http://arxiv.org/abs/1207.2556},
}
@ARTICLE{Gre89,
AUTHOR = "N. Green",
TITLE = "Voxel space automata: {M}odeling with stochastic
growth processes in voxel space",
JOURNAL = compgraph,
YEAR = 1989,
month = jul,
volume = 23,
number = "3",
pages = "175--184",
copy = ""
}
@ARTICLE{GreGam84,
AUTHOR = "J. W. Greene and A. Gamal",
TITLE = "Configuration of {VLSI} arrays in the presence of defects",
JOURNAL = jacm,
YEAR = 1984,
month = "",
volume = 31,
number = "4",
pages = "694--717",
copy = ""
}
@article{GrePet95,
author = "R. Greenlaw and R. Petreschi",
title = "Cubic graphs",
journal ={ACM Computing Surveys},
volume = 27, year =1995, pages="471--495",
}
@ARTICLE{Gre94,
AUTHOR = "J. Gregor",
TITLE = "Data-driven inductive inference of finite-state automata",
JOURNAL = ijprai,
YEAR = 1994,
month = "",
volume = 8,
number = "1",
pages = "305--322",
copy = ""
}
@ARTICLE{diGreTra75,
AUTHOR = "S. di Gregorio and G. Trautteur",
TITLE = "On reversibility in cellular automata",
JOURNAL = jcss,
YEAR = 1975,
month = "",
volume = 11,
number = "",
pages = "382--391",
copy = ""
}
@ARTICLE{Gre68,
AUTHOR = "S. Greibach",
TITLE = "A note on undecidable properties of formal languages",
JOURNAL = mst,
YEAR = 1968,
month = "",
volume = 2,
number = "",
pages = "1--6",
copy = ""
}
@ARTICLE{Gre72,
AUTHOR = "S. Greibach",
TITLE = "A generalization of {P}arikh`s semilinear theorem",
JOURNAL = dm,
YEAR = 1972,
VOLUME = 2,
NUMBER = "",
PAGES = "347--355",
copy = ""
}
@Article{Gre73,
author ="S. A. Greibach",
title = "The hardest context-free language",
journal = "SIAM J. Computing",
volume = "2",
number = "4",
pages = "304--310",
year = "1973"}
@ARTICLE{Gre77,
AUTHOR = "S. A. Greibach",
TITLE = "Control sets on context-free grammar forms",
JOURNAL = jcss,
YEAR = 1977,
month = "",
volume = 15,
number = "",
pages = "35--98",
copy = ""
}
@ARTICLE{Gre78,
AUTHOR = "S. Greibach",
TITLE = "Remarks on blind and partially blind one-way
multicounter machines",
JOURNAL = tcs,
YEAR = 1978,
month = "",
volume = 7,
number = "",
pages = "311--324",
copy = ""
}
@ARTICLE{Gre78a,
AUTHOR = "S. Greibach",
TITLE = "Comments on universal and left universal grammars, context-sensitive languages, and context-free grammar forms",
JOURNAL = icalt,
YEAR = 1978,
month = "",
volume = 39,
number = "",
pages = "135--142",
copy = ""
}
@Article{Gre78b,
author = "S. A. Greibach",
title = "One way finite visit automata",
journal = tcs,
volume = "6",
number = "2",
pages = "175--221",
year = "1978",
}
@Article{Gre78c,
title = "Visits, Crosses, and Reversals for Nondeterministic
Off-Line Machines",
author = "S. A. Greibach",
pages = "174--216",
journal = icalt,
month = feb,
year = "1978",
volume = "36",
number = "2",
}
@ARTICLE{GreHop69,
AUTHOR = "S. Greibach and J. Hopcroft",
TITLE = "Independence of AFL operations",
JOURNAL = memams,
YEAR = 1969,
VOLUME = 87,
NUMBER = "",
PAGES = "32--40",
copy = "befindet sich mit dem gesamten Band 87 unter Ginsburg & Greibach"
}
@ARTICLE{GreHop69a,
AUTHOR = "S. Greibach and J. Hopcroft",
TITLE = "Scattered context grammars",
JOURNAL = jcss,
YEAR = 1969,
VOLUME = 3,
NUMBER = "",
PAGES = "233--247",
copy = ""
}
@ARTICLE{GreSmiWil89,
AUTHOR = "R. Greiner and B. A. Smith and R. W. Wilkerson",
TITLE = "A correction to the algorithm in {Re}iter's theory of diagnosis",
JOURNAL = {Artificial Intelligence},
YEAR = 1989,
month = "",
volume = 41,
number = "",
pages = "79--88",
copy = ""
}
@Article{GriMoo96,
author = "D. Griffeath and C. Moore",
title = "Life Without Death is {P}-complete",
journal = complex,
volume = "10",
year = "1996",
}
@Article{GriKleSha89,
author = {J.~R. Griggs and D.~J. Kleitman and Shastri, A.},
title = {Spanning Trees with Many Leaves in Cubic Graphs},
journal = jgt,
year = {1989},
OPTkey = {},
volume = {13},
OPTnumber = {6},
pages = {669--695},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@Article{GriWu92,
author = {J. R. Griggs and M. Wu},
title = {Spanning Trees in Graphs of Minimum Degree 4 or 5},
journal = dm,
year = 1992,
OPTkey = {},
OPTvolume = {104},
OPTnumber = {},
OPTpages = {167--183},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@INPROCEEDINGS{GriKouPap95,
AUTHOR = "M. Grigni and E. Koutsoupias and C. Papadimitriou",
TITLE = "An approximation scheme for planar graph {TSP}",
BOOKTITLE = "28th Annual Symposium on Foundations of Computer Science",
YEAR = 1995,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "640--646",
address = "",
organization = "IEEE",
publisher = "",
copy = ""
}
@INPROCEEDINGS{GriMan96,
AUTHOR = "M. Grigni and F. Manne",
TITLE = "On the complexity of generalized block distribution",
BOOKTITLE = "IRREGULAR'96",
YEAR = 1996,
month = "",
volume = "1117",
editor = "",
series = "LNCS",
chapter = "",
pages = "319--326",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@INPROCEEDINGS{Gri2000,
AUTHOR = "M. Grigni",
title = "Approximate {TSP} in Graphs with Forbidden Minors",
BOOKTITLE = "International Colloquium on Automata, Languages and Programming (ICALP'00)",
YEAR = 2000,
month = "",
volume = "1853",
editor = "",
series = "LNCS",
chapter = "",
pages = "869-877",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@ARTICLE{GriMirPap2000,
AUTHOR = "M. Grigni and V. Mirelli and C.~H. Papadimitriou",
TITLE = "On the difficulty of designing good classifiers",
JOURNAL = siam,
YEAR = 2000,
month = "",
volume = 30,
number = "",
pages = "318--323",
copy = ""
}
@ARTICLE{GriHahVan91,
AUTHOR = "C. M. Grinstead and B. Hahne and D. Van Stone",
TITLE = "On the queen domination problem",
JOURNAL = dm,
YEAR = 1991,
month = "",
volume = 86,
number = "",
pages = "21--26",
copy = ""
}
@ARTICLE{Grietal93,
AUTHOR = "D. Grinstead and P. Slater and N. Sherwani and N. Holmes",
TITLE = "Efficient edge domination in graphs",
JOURNAL = ipl,
YEAR = 1993,
month = "",
volume = 48,
number = "",
pages = "221--228",
copy = ""
}
@Article{Grietal98,
author = {P. Gritzmann and D. Prangenberg and S. de Vries and M. Wiegelmann},
title = {Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography},
journal = {Int. Journal of Imaging Syst. and Technology},
year = {1998},
OPTkey = {},
volume = {9},
OPTnumber = {},
pages = {101--109},
}
@InProceedings{Gro95,
author = {A.~V. Groenink},
title = {A simple uniform semantics for Concatenation-based Grammars},
booktitle = {Proceedings of the TWLT10/AMiLP meeting},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {1995},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Twente},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTurldate = {},
OPTlastchecked = {},
OPTdoi = {},
OPTisbn = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
OPTkeywords = {},
}
@InProceedings{Gro9596,
author = {A.~V. Groenink},
title = {A Unifying Framework for Concatenation-based Grammar Formalisms},
booktitle = {Proceedings of Accolade 1995},
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {1996},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Amsterdam},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTurldate = {},
OPTlastchecked = {},
OPTdoi = {},
OPTisbn = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
OPTkeywords = {},
}
@techreport{Gro96,
author = {A.~V. Groenink},
title = {Tractability issues in extraposition grammar},
year = {1996},
institution = {Computer Science / Department of Interactive Systems, CWI Amsterdam},
OPTkey = {},
OPTtype = {},
number = {CS-R9635},
}
@INPROCEEDINGS{Gro99,
AUTHOR = "M. Grohe",
TITLE = "Descriptive and parameterized complexity",
BOOKTITLE = "Computer Science Logic CSL'99",
YEAR = 1999,
month = "",
volume = "1683",
editor = "J. Flum and M. Rodriguez-Artalejo",
series = "LNCS",
chapter = "",
pages = "14--31",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@INPROCEEDINGS{GroMar99,
AUTHOR = "M. Grohe and J. Mari{\~n}o",
TITLE = "Definability and descriptive complexity on databases with bounded tree-width",
BOOKTITLE = "Proc. 7th International Conference on Database Theory",
YEAR = 1999,
month = "",
volume = "1540",
editor = "Beeri and Bunemann",
series = "LNCS",
chapter = "",
pages = "70--82",
address = "",
organization = "",
copy = ""
}
@ARTICLE{Gro2001,
AUTHOR = "M. Grohe",
TITLE = "Local tree-width, excluded minors, and approximation algorithms",
JOURNAL = combi,
YEAR = 2001,
month = "",
volume = {To appear},
number = "",
pages = "",
copy = ""
}
@INPROCEEDINGS{Gro2001a,
AUTHOR = "M. Grohe",
TITLE = "The parameterized complexity of database queries",
BOOKTITLE = "POPL 2001",
YEAR = 2001,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "",
address = "",
organization = "ACM",
publisher = "",
copy = ""
}
@inproceedings{GroGru2007,
author = {M. Grohe and
M. Gr{\"u}ber},
title = {Parameterized Approximability of the Disjoint Cycle Problem},
booktitle = {Automata, Languages and Programming, 34th International
Colloquium, ICALP 2007},
year = {2007},
pages = {363--374},
editor = {L. Arge and
C. Cachin and
T. Jurdzinski and
A. Tarlecki},
publisher = {Springer},
series = {LNCS},
volume = {4596},
}
@inproceedings{GroMar2012,
author = {M. Grohe and
D. Marx},
title = {Structure theorem and isomorphism test for graphs with excluded
topological subgraphs},
pages = {173--192},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing
Conference, STOC},
year = {2012},
editor = {H. J. Karloff and
T. Pitassi},
publisher = {ACM},
}
@INBOOK{Gro,
AUTHOR = "O. F. Gronau",
TITLE = "Separating coverings of $K_n$ by complete graphs",
PAGES = "76--79",
PUBLISHER = "Teubner DDR",
YEAR = "19??",
VOLUME = 59,
SERIES = ttzm,
copy = ""
}
@article{Groetal2009,
title = "Cycle transversals in bounded degree graphs",
journal = "Electronic Notes in Discrete Mathematics",
volume = "35",
number = "",
pages = "189 -- 195",
year = "2009",
note = "LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium",
url = "http://www.sciencedirect.com/science/article/B75GV-4XVBKYN-14/2/3a7d2ee99dc09a9accc50dd62855f3b7",
author = "M. Groshaus and P. Hell and S. Klein and L.T. Nogueira and F. Protti",
}
@article{GroSzw2010,
author = {M. Groshaus and
J. L. Szwarcfiter},
title = {Biclique graphs and biclique matrices},
journal = jgt,
volume = {63},
number = {1},
year = {2010},
pages = {1--16},
}
@ARTICLE{Gro94,
AUTHOR = "K. E. Grosspietsch",
TITLE = "Fault tolerance in highly parallel hardware systems",
JOURNAL = {IEEE Micro},
YEAR = 1994,
month = feb,
volume = {},
number = "",
pages = "60--68",
copy = ""
}
@ARTICLE{GroJunRei84,
AUTHOR = "M. Gr{\"{o}}tschel and M.~J{\"u}nger and G. Reinelt",
TITLE = "A Cutting Plane Algorithm for the Linear Ordering Problem",
JOURNAL = {Operations Research},
YEAR = 1984,
month = "",
volume = 32,
number = "",
pages = "1195--1220",
copy = ""
}
@ARTICLE{Gru89,
AUTHOR = "P. M. Gruber",
TITLE = "Dimension and structure of typical compact sets,
continua and curves",
JOURNAL = monmath,
YEAR = 1989,
month = "",
volume = 108,
number = "",
pages = "149--164",
copy = ""
}
@inproceedings{GruHol2008,
author = {H. Gruber and M. Holzer},
title = {Finite Automata, Digraph Connectivity, and
Regular Expression Size (Extended Abstract)},
booktitle = {Automata, Languages and Programming ICALP (2)},
year = {2008},
pages = {39--50},
editor = {L. Aceto and
I. Damg{\aa}rd and
L. A. Goldberg and
M. M. Halld{\'o}rsson and
A. Ing{\'o}lfsd{\'o}ttir and
I. Walukiewicz},
publisher = {Springer},
series = {LNCS},
volume = {5126},
}
@InProceedings{GruGul2010,
author = {H. Gruber and S. Gulan},
title = {Simplifying regular expressions: a quantitative perspective},
booktitle = {Language and Automata Theory and Applications LATA},
OPTcrossref = {},
OPTkey = {},
pages = {285--296},
year = {2010},
editor = {A.-H. Dediu and H. Fernau and C. Mart\'in-Vide},
volume = {6031},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}
@article{Gru2012,
author = {H. Gruber},
title = {Digraph Complexity Measures and Applications in Formal Language
Theory},
journal = {Discrete Mathematics {\&} Theoretical Computer Science},
volume = {14},
number = {2},
year = {2012},
pages = {189--204},
ee = {http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2107},
}
@inproceedings{GruKurPot2006,
author = {I. Grunsky and
O. Kurganskyy and
I. Potapov},
title = {On a Maximal {NFA} Without Mergible States},
year = {2006},
pages = {202--210},
editor = {D. Grigoriev and
J. Harrison and
E. A. Hirsch},
booktitle = {Computer Science --- Theory and Applications, First International
Computer Science Symposium in Russia, CSR 2006},
publisher = {Springer},
series = {LNCS},
volume = {3967},
}
@INPROCEEDINGS{Gru96,
AUTHOR = " P. Gr{\"u}nwald",
TITLE = "A minimum description length approach to grammar inference",
BOOKTITLE = "Symbolic, Connectionist and Statistical Approaches to Learning for Natural Language Processing",
YEAR = 1996,
month = "",
volume = "1040",
editor = "S. Wermter and E. Riloff and G. Scheler",
series = "LNCS/LNAI",
chapter = "",
pages = "203--216",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@Article{Gru67,
author = {J. Gruska},
title = {On a classification of context-free languages},
journal = {Kybernetika},
year = {1967},
OPTkey = {},
volume = {3},
number = {1},
pages = {22--29},
}
@ARTICLE{Gru71,
AUTHOR = "J. Gruska",
TITLE = "A characterization of context-free languages",
JOURNAL = jcss,
YEAR = 1971,
VOLUME = 5,
NUMBER = "",
PAGES = "353--364",
copy = ""
}
@ARTICLE{Gru71a,
AUTHOR = "J. Gruska",
TITLE = "A few remarks on the index of context-free grammars
and languages",
JOURNAL = icalt,
YEAR = 1971,
VOLUME = 19,
NUMBER = "",
PAGES = "216--223",
copy = ""
}
@INPROCEEDINGS{Gru94,
author = "P. Grunwald",
title = "A minimum description length approach to grammar inference",
BOOKTITLE = "Connectionist,
Statistical and Symbolic Approaches to Learning for Natural Language",
YEAR = 1994,
month = "",
volume = "1004",
editor = "G. Scheler and S. Wernter and E. Riloff",
series = "LNCS/LNAI",
chapter = "",
pages = "203--216",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@ARTICLE{Gru99,
AUTHOR = "J. Gruska",
TITLE = "Systolic tree and tree-like automata",
JOURNAL = publmath,
YEAR = 1999,
month = "",
volume = 54,
number = "Supplement",
pages = "807--855",
copy = ""
}
@ARTICLE{Gry96,
AUTHOR = "J. Grytczuk",
TITLE = "Infinite self-similar words",
JOURNAL = dm,
YEAR = 1996,
month = "",
volume = 161,
number = "(1--3)",
pages = "133--141",
}
@ARTICLE{Grz55,
AUTHOR = "A. Grzegorczyk",
TITLE = "Computable functionals",
JOURNAL = fundmath,
YEAR = 1955,
month = "",
volume = 42,
number = "",
pages = "168--202",
copy = ""
}
@ARTICLE{Grz55a,
AUTHOR = "A. Grzegorczyk",
TITLE = "On the definition of computable functionals",
JOURNAL = fundmath,
YEAR = 1955,
month = "",
volume = 42,
number = "",
pages = "232--239",
copy = ""
}
@ARTICLE{Grz56,
AUTHOR = "A. Grzegorczyk",
TITLE = "Some proofs of undecidability of arithmetic",
JOURNAL = fundmath,
YEAR = 1956,
month = "",
volume = 43,
number = "",
pages = "166--177",
copy = ""
}
@ARTICLE{Grz57,
AUTHOR = "A. Grzegorczyk",
TITLE = "On the definitions of computable real continuous functions",
JOURNAL = fundmath,
YEAR = 1957,
month = "",
volume = 44,
number = "",
pages = "61--71",
copy = ""
}
@article{GuaMal2012,
author = {S. Gualandi and F. Malucelli},
title = {Total domination in inflated graphs},
journal = dam,
volume = {160},
number = {1-2},
year = {2012},
pages = {192--196},
}
@Article{GudLev99,
author = {J. Gudmundsson and C. Levcopoulos},
title = {Close approximations of minimum rectangular coverings},
journal = joco,
year = {1999},
OPTkey = {},
volume = {3},
OPTnumber = {},
pages = {437--452},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@PHDTHESIS{Gud2000,
AUTHOR = "J. Gudmundsson",
TITLE = "Geometric Decompositions and Networks --- Approximation Bounds and Algorithms",
SCHOOL = "Lund University",
YEAR = 2000,
month = "",
address = "",
type = "PhD Thesis",
copy = "only electronic version"
}
@Article{GueVanDen94,
author = {A. Gu\'enoche and B. Vandeputte-Riboud and J.~B. Denis},
title = {Selecting varieties using a series of trials and a combinatorial ordering method},
journal = {Agronomie},
year = {1994},
OPTkey = {},
volume = {14},
OPTnumber = {},
pages = {363--375},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@inproceedings{GuhKhu98,
author = "S. Guha and S. Khuller",
title = "Greedy Strikes Back: Improved Facility Location Algorithms",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1998",
pages = {649--657}}
@article {GuhKhu98a,
author = {Guha, S. and Khuller, S.},
title = {Approximation Algorithms for Connected Dominating Sets},
journal = alg,
pages = {374--387},
volume = {20},
issue = {4},
year = {1998}
}
@ARTICLE{Guhetal03,
AUTHOR = "S. Guha and R. Hassin and S. Khuller and E. Or",
TITLE = "Capacitated vertex covering",
JOURNAL = jalg,
YEAR = 2003,
month = "",
volume = 48,
number = "",
pages = "257--270",
copy = ""
}
@inproceedings{GuiJanSun2009,
author = {S. Guillemot and
J. Jansson and
W.-K. Sung},
title = {Computing a Smallest Multi-labeled Phylogenetic Tree from
Rooted Triplets},
booktitle = {Algorithms and Computation, 20th International Symposium, ISAAC},
year = {2009},
pages = {1205--1214},
editor = {Y. Dong and
D.-Z. Du and
O. H. Ibarra},
publisher = {Springer},
series = {LNCS},
volume = {5878},
}
@inproceedings{GuiMni2010,
author = {S. Guillemot and
M. Mnich},
title = {Kernel and Fast Algorithm for Dense Triplet Inconsistency},
booktitle = {Theory and Applications of Models of Computation, TAMC},
year = {2010},
pages = {247--257},
editor = {J. Kratochv\'{\i}l and
A. Li and
J. Fiala and
P. Kolman},
publisher = {Springer},
series = {LNCS},
volume = {6108},
}
@inproceedings{GuiPauPer2010,
author = {S. Guillemot and
C. Paul and
A. Perez},
title = {On the (Non-)existence of Polynomial Kernels for {$P_l$}-free
Edge Modification Problems},
booktitle = {Parameterized and Exact Computation --- 5th International
Symposium, IPEC},
year = {2010},
pages = {147--157},
editor = {V. Raman and
S. Saurabh},
publisher = {Springer},
series = {LNCS},
volume = {6478},
year = {2010},
}
@article{Gui2011,
author = {S. Guillemot},
title = {{FPT} algorithms for path-transversal and cycle-transversal
problems},
journal = {Discrete Optimization},
volume = {8},
number = {1},
year = {2011},
pages = {61--71},
}
@article{Gui2011a,
author = {S. Guillemot},
title = {Parameterized complexity and approximability of the Longest
Compatible Sequence problem},
journal = {Discrete Optimization},
volume = {8},
number = {1},
year = {2011},
pages = {50--60},
}
@article{GuiJansun2011,
author = {S. Guillemot and
J. Jansson and
W.-K. Sung},
title = {Computing a Smallest Multilabeled Phylogenetic Tree from
Rooted Triplets},
journal = {IEEE/ACM Trans. Comput. Biology Bioinform.},
volume = {8},
number = {4},
year = {2011},
pages = {1141--1147},
}
@InProceedings{GulFer08,
author = {S. Gulan and H. Fernau},
title = {Local elimination-strategies in automata for shorter regular expressions},
booktitle = {Theory and Practice of Computer Science: SOFSEM 2008; volume {II}},
OPTcrossref = {},
OPTkey = {},
pages = {46--57},
year = {2008},
editor = {V. Geffert and J. Karhum{\"a}ki and A. Bertoni and B. Preneel and P. N\'avrat and M. Bielikov\'a},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Institute of Computer Science, Faculty of Science, Pavol Jozef \v Saf\'arik University, Ko\v sice, Slovakia},
OPTnote = {},
OPTannote = {}
}
@TECHREPORT{GulFer08a,
AUTHOR = "S. Gulan and H. Fernau",
TITLE = "Top-Down Construction of Finite
Automata from Regular
Expressions",
INSTITUTION = "Technical Reports Mathematics / Computer Science, University
of Trier, Germany",
YEAR = 2008,
month = jul,
number = "08-7",
address = {
http://www.uni-trier.de/fileadmin/fb4/INF/TechReports/Forschungsbericht\_08-7.pdf}
}
@InProceedings{GulFer08b,
author = {S. Gulan and H. Fernau},
title = {An Optimal Construction of Finite Automata from Regular Expressions},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008)},
year = {2008},
editor = {R. Hariharan and M. Mukund and V Vinay},
publisher = {Schloss Dagstuhl --- Leibniz-Zentrum f{\"u}r Informatik, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1754},
pages ={211--222},}
@inproceedings{Gul2011,
author = {S. Gulan},
title = {Graphs Encoded by Regular Expressions},
booktitle = {28th International Symposium on Theoretical Aspects of Computer
Science, STACS},
year = {2011},
pages = {495--506},
editor = {T. Schwentick and
C. D{\"u}rr},
publisher = {Schloss Dagstuhl --- Leibniz-Zentrum f{\"u}r Informatik},
series = {LIPIcs},
volume = {9},
}
@PhdThesis{Gul2011a,
author = {S. Gulan},
title = {On the Relative Descriptional Complexity of Regular Expressions and Finite Automata},
school = {Fachbereich IV, Universit\"at Trier, Germany},
year = {2011},
}
@article {GulHam2010,
author = {G\"uler, \c{C}. and Hamacher, H.},
title = {Capacity inverse minimum cost flow problem},
journal = {Journal of Combinatorial Optimization},
pages = {43--59},
volume = {19},
issue = {1},
year = {2010}
}
@TECHREPORT{GunMey2004,
AUTHOR = "A. Gunawardena and R. R. Meyer",
TITLE = "Equi-Partitioning of Higher-Dimensional Hyper-Rectangular Grid Graphs",
INSTITUTION = "Technical Reports of the Optimization Group in UW-Madison Computer Sciences",
YEAR = 2004,
month = dec,
number = "Optimization Technical Report 04-01",
address = "",
copy = ""
}
@INBOOK{GunSco90,
AUTHOR = "C. A. Gunter and D. S. Scott",
TITLE = "Semantic Domains",
PAGES = "633--674",
CHAPTER = "12",
NOTE = "In J. van Leeuwen, editor, {\em Handbook of Theoretical Computer Science, Volume B,
Formal Models and Semantics}",
PUBLISHER = "Elsevier {\&} MIT Press",
YEAR = 1992,
copy = ""
}
@INPROCEEDINGS{GuoHufNie2004,
AUTHOR = "J. Guo and F. H{\"u}ffner and R. Niedermeier",
TITLE = "A structural view on parameterizing problems: distance from triviality",
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 = "162--173",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@inproceedings{GuoNieRai05,
author = {J. Guo and
R. Niedermeier and
D. Raible},
title = {Improved Algorithms and Complexity Results for Power Domination
in Graphs},
booktitle = {Fundamentals of Computation Theory, 15th International
Symposium,
FCT},
year = {2005},
pages = {172--184},
publisher = {Springer},
series = {LNCS},
volume = {3623}
}
@INPROCEEDINGS{GuoNieWer2005,
AUTHOR = "J. Guo and R. Niedermeier and S. Wernicke",
TITLE = "Parameterized complexity of generalized Vertex Cover problems",
BOOKTITLE = "Proceedings of the 9th Workshop on Algorithms and Data Structures WADS",
YEAR = 2005,
month = "",
volume = "3608",
editor = "",
series = "LNCS",
chapter = "",
pages = "36--48",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@INPROCEEDINGS{Guoetal2005,
AUTHOR = "J. Guo and J. Gramm and F. H{\"u}ffner and R. Niedermeier and S. Wernicke",
TITLE = "Improved fixed-parameter algorithms for two feedback set problems",
BOOKTITLE = "Proceedings of the 9th Workshop on Algorithms and Data Structures WADS",
YEAR = 2005,
month = "",
volume = "3608",
editor = "",
series = "LNCS",
chapter = "",
pages = "158--168",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@ARTICLE{Guoetal2006,
AUTHOR = "J. Guo and J. Gramm and F. H{\"u}ffner and R. Niedermeier and S. Wernicke",
TITLE = "Compression-based fixed-parameter algorithms for Feedback Vertex Set and Edge Bipartization",
JOURNAL = jcss,
YEAR = 2006,
month = "",
volume = 72,
number = "",
pages = "1386--1396",
copy = ""
}
@Article{GuoHufMos2007,
author = {Guo, J. and F. H{\"u}ffner and H. Moser},
title = {Feedback arc set in bipartite tournaments
is {NP}-complete},
journal = ipl,
year = {2007},
OPTkey = {},
volume = {102},
OPTnumber = {},
pages = {62--65},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{GuoNieWer2007,
AUTHOR = "J. Guo and R. Niedermeier and S. Wernicke",
TITLE = "Parameterized complexity of Vertex Cover variants",
journal = tocs,
YEAR = 2007,
month = "",
volume = "41",
pages = "501--520",
copy = ""
}
@INPROCEEDINGS{GuoUhl2007,
AUTHOR = "J. Guo and J. Uhlmann",
TITLE = "Kernelization and complexity results for connectiviy augmentation problems",
BOOKTITLE = "WADS 2007",
YEAR = 2007,
month = "",
volume = "4619",
editor = "F. Dehne and J.-R. Sacksand N. Zeh",
series = "LNCS",
chapter = "",
pages = "484--495",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@article{Guo2009,
author = {J. Guo},
title = {A more effective linear kernelization for cluster editing},
journal = tcs,
volume = {410},
number = {8-10},
year = {2009},
pages = {718--726},
}
@article{GuoUhl2010,
AUTHOR = "J. Guo and J. Uhlmann",
title = {Kernelization and complexity results for connectivity augmentation
problems},
journal = {Networks},
volume = {56},
number = {2},
year = {2010},
pages = {131--142},
}
@inproceedings{GuoNie2007,
author = {J. Guo and
R. Niedermeier},
title = {Linear Problem Kernels for {NP}-Hard Problems on Planar Graphs},
booktitle = {Automata, Languages and Programming ICALP},
year = {2007},
pages = {375--386},
editor = {L. Arge and
C. Cachin and
T. Jurdzinski and
A. Tarlecki},
publisher = {Springer},
series = {LNCS},
volume = {4596},
}
@article{GuoNie2007a,
author = {J. Guo and
R. Niedermeier},
title = {Invitation to data reduction and problem kernelization},
journal = {SIGACT News},
volume = {38},
number = {1},
year = {2007},
pages = {31--45},
}
@article{GuoNieRai08,
author = {J. Guo and
R. Niedermeier and
D. Raible},
title = {Improved Algorithms and Complexity Results for Power Domination
in Graphs},
journal = {Algorithmica},
volume = {52},
number = {2},
year = {2008},
pages = {177--202},
}
@inproceedings{Guoetal2008,
author = {J. Guo and
F. H{\"u}ffner and
C. Komusiewicz and
Y. Zhang},
title = {Improved Algorithms for Bicluster Editing},
booktitle = {TAMC},
year = {2008},
pages = {445--456},
editor = {M. Agrawal and
D.-Z. Du and
Z. Duan and
A. Li},
booktitle = {Theory and Applications of Models of Computation, 5th International
Conference, TAMC 2008},
publisher = {Springer},
series = {LNCS},
volume = {4978},
}
@article{GuoUhl2010,
AUTHOR = "J. Guo and J. Uhlmann",
TITLE = "Kernelization and complexity results for connectiviy augmentation problems",
journal = {Networks},
volume = {56},
number = {2},
year = {2010},
pages = {131--142},
}
@inproceedings{GuoKanKra2011,
author = {J. Guo and
I. A. Kanj and
S. Kratsch},
title = {Safe Approximation and Its Relation to Kernelization},
booktitle = {Parameterized and Exact Computation -- 6th International
Symposium, IPEC 2011},
pages = {169--180},
editor = {D. Marx and
P. Rossmanith},
publisher = {Springer},
series = {LNCS},
volume = {7112},
year = {2012},
}
@article{GuoNieSuc2011,
author = {J. Guo and
R. Niedermeier and
O. Such{\'y}},
title = {Parameterized Complexity of Arc-Weighted Directed Steiner
Problems},
journal = siamdm,
volume = {25},
number = {2},
year = {2011},
pages = {583--599},
}
@inproceedings{Guoetal2011,
author = {J. Guo and
S. Hartung and
R. Niedermeier and
O. Such{\'y}},
title = {The Parameterized Complexity of Local Search for {TSP}, More
Refined},
booktitle = {Algorithms and Computation -- 22nd International Symposium, ISAAC},
year = {2011},
pages = {614--623},
editor = {T. Asano and
S.-I. Nakano and
Y. Okamoto and
O. Watanabe},
publisher = {Springer},
series = {LNCS},
volume = {7074},
}
@inproceedings{GuoShr2012,
author = {J. Guo and
Y. R. Shrestha},
title = {Kernelization and Parameterized Complexity of Star Editing
and Union Editing},
booktitle = {Algorithms and Computation -- 23rd International Symposium, ISAAC},
year = {2012},
pages = {126--135},
editor = {K.-M. Chao and
T.-s. Hsu and
D.-T. Lee},
publisher = {Springer},
series = {LNCS},
volume = {7676},
}
@INPROCEEDINGS{GuoSalYu94,
AUTHOR = "L. Guo and K. Salomaa and S. Yu",
TITLE = "Synchronization expressions and languages",
BOOKTITLE = "Proc. of the 6th IEEE Symposium on Parallel and Distributed Processing",
YEAR = 1994,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "257--264",
address = "",
organization = "IEEE",
copy = ""
}
@ARTICLE{GuoSalYu96,
AUTHOR = "L. Guo and K. Salomaa and S. Yu",
TITLE = "On synchronization languages",
JOURNAL = fundinform,
YEAR = 1996,
month = "",
volume = 25,
number = "",
pages = "423--436",
copy = ""
}
@article {GupHarPot99,
author = {Gupta, J.~N.~D. and Hariri, A.~M.~A. and Potts, C.~N.},
title = {Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs},
journal = {Annals of Operations Research},
pages = {107--123},
volume = {92},
year = {1999}
}
@INPROCEEDINGS{Gupetal03,
AUTHOR = "A. Gupta and A. Kumar and M. P{\'a}l and T. Roughgarden",
TITLE = "Approximation Via Cost Sharing: Simple Approximations for the Multicommodity Rent-or-Buy Problem",
BOOKTITLE = "Proceedings of the 44th Annual IEEE Symposium on the Foundations of Computer Science, FOCS",
YEAR = 2003,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "--",
address = "",
organization = "",
publisher = "",
copy = ""
}
@inproceedings{Gup2007,
author = {S. Gupta},
title = {Feedback Arc Set Problem in Bipartite Tournaments},
booktitle = {Theory and Applications of Models of Computation, TAMC},
year = {2007},
pages = {354--361},
editor = {J.-yi Cai and
S. Barry Cooper and
H. Zhu},
publisher = {Springer},
series = {LNCS},
volume = {4484},
}
@article{Gup2008,
author = {S. Gupta},
title = {Feedback arc set problem in bipartite tournaments},
journal = ipl,
volume = {105},
number = {4},
year = {2008},
pages = {150--154},
}
@ARTICLE{GurIba81,
AUTHOR = "E. M. Gurari and O. H. Ibarra",
TITLE = "The complexity of decision problems for finite-turn multicounter machines",
JOURNAL = jcss,
YEAR = 1981,
month = "",
volume = 22,
number = "",
pages = "220--229",
copy = ""
}
@ARTICLE{GurStoVis84,
AUTHOR = "Y. Gurevich and L. Stockmeyer and U. Vishkin",
TITLE = "Solving {NP}-hard problems on graphs that are almost trees and application to facility location problems",
JOURNAL = jacm,
YEAR = 1984,
month = "",
volume = 31,
number = "",
pages = "459--473",
copy = ""
}
@article{Guretal2001,
author = {V. Guruswami and
C. Pandu Rangan and
M.-S. Chang and
G. J. Chang and
C. K. Wong},
title = {The {$K_{r}$}-Packing Problem},
journal = {Computing},
volume = {66},
number = {1},
year = {2001},
pages = {79--89},
}
@article{Guretal2003,
author = {V. Guruswami and
S. Khanna and
R. Rajaraman and
F. B. Shepherd and
M. Yannakakis},
title = {Near-optimal hardness results and approximation algorithms
for edge-disjoint paths and related problems},
journal = jcss,
volume = {67},
number = {3},
year = {2003},
pages = {473--496},
}
@InProceedings{GurZho2011,
author = {V. Guruswami and Y. Zhou},
title = {Tight Bounds on the Approximability of Almost-satisfiable {H}orn {SAT} and
Exact Hitting Set},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms SODA},
pages = {1574--1589},
year = {2011},
editor = {D. Randall},
organization = {ACM and SIAM},
OPTpublisher = {},
OPTabstract = {},
}
@ARTICLE{Gus2001,
AUTHOR = "D. Gusfield",
TITLE = "Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms",
JOURNAL = {J. Computational Biology},
YEAR = 2001,
month = "",
volume = 8,
number = "",
pages = "305--323",
copy = ""
}
@ARTICLE{Gus95,
AUTHOR = "Gustedt",
TITLE = "Well quasi ordering finite posets and formal languages",
JOURNAL = jcthb,
YEAR = 1995,
month = "",
volume = 65,
number = "",
pages = "111--124",
copy = ""
}
@ARTICLE{Gut89,
AUTHOR = "R. Gutbrod",
TITLE = "A transformation system for generating description
languages of chain code pictures",
JOURNAL = tcs,
YEAR = 1989,
month = "",
volume = 68,
number = "",
pages = "239--252",
copy = ""
}
@TECHREPORT{GutKloLee01,
AUTHOR = "G. Gutin and T. Kloks and C. Lee",
TITLE = "Kernels in planar digraphs",
INSTITUTION = "Optimization Online",
YEAR = 2001,
month = "",
number = "",
address = "Mathematical Programming Society, Philadelphia",
copy = ""
}
@TECHREPORT{Gutetal2005,
AUTHOR = "G. Gutin and A. Rafiey and S. Szeider and A. Yeo",
TITLE = "The linear arrangement problem parameterized above guaranteed value",
INSTITUTION = "{arXiv.org} e-Print archive (computer science)",
YEAR = 2005,
month = nov,
number = "cs.DS/0511030",note={A conference version will
appear in the Proceedings of CIAC as published in the LNCS series
of Springer in 2006},
address = "",
copy = ""
}
@INPROCEEDINGS{Gutetal2006,
AUTHOR = "G. Gutin and A. Rafiey and S. Szeider and A. Yeo",
TITLE = "The linear arrangement problem parameterized above guaranteed value",
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 = "356--367",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@article{Gutetal2007,
author = {G. Gutin and A. Rafiey and S. Szeider and A. Yeo},
title = {The Linear Arrangement Problem Parameterized Above Guaranteed
Value},
journal = tocs,
volume = {41},
number = {3},
year = {2007},
pages = {521--538},
}
@article{GutYeo2008,
author = {G. Gutin and
A. Yeo},
title = {Some Parameterized Problems On Digraphs},
journal = {The Computer Journal},
volume = {51},
number = {3},
year = {2008},
pages = {363--371},
}
@article{Gut2009,
author = {G. Gutin},
title = "Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems",
journal = "Electronic Notes in Discrete Mathematics",
volume = "32",
number = "",
pages = "75--82",
year = "2009",
note = "DIMAP Workshop on Algorithmic Graph Theory",
}
@article{GutJonYeo2011,
author = {G. Gutin and M. Jones and Y. Yeo},
title = "Kernels for below-upper-bound parameterizations of the hitting set and
directed dominating set problems",
journal = tcs,
volume = "412",
number = "",
pages = "5744--5751",
year = "2011",
}
@article{Gutetal2011,
author = {G. Gutin and
E. Jung Kim and
M. Lampis and
V. Mitsou},
title = {Vertex Cover Problem Parameterized Above and Below Tight
Bounds},
journal = tcs,
volume = {48},
number = {2},
year = {2011},
pages = {402--410},
}
@article{GutMucYeo2012,
author = {G. Gutin and
G. Muciaccia and
A. Yeo},
title = {(Non-)existence of Polynomial Kernels for the Test Cover
Problem},
journal = {CoRR},
volume = {abs/1204.4368},
year = {2012},
}
@article{GutMucYeo2013,
author = {G. Gutin and
G. Muciaccia and
A. Yeo},
title = {(Non-)existence of polynomial kernels for the {T}est {C}over
problem},
journal = ipl,
volume = {113},
number = {4},
year = {2013},
pages = {123--126},
}
@INPROCEEDINGS{GuzMarRey90,
AUTHOR = "M. de G\'uzman and M. A. Martin and M. Reyes",
TITLE = "On the derivation of fractal functions",
BOOKTITLE = "FRACTALS",
YEAR = 1990,
PAGES = "",
ORGANIZATION = "IFIP",
copy = ""
}
@Article{GyaWes95,
author = {A. Gy\'arf\'as and D. West},
title = {Multitrack interval graphs},
journal = congnum,
year = {1995},
volume = {109},
pages = {109--116},
}
@ARTICLE{Gyo81,
AUTHOR = "E. Gy{\H o}ry",
TITLE = {Partition conditions and vertex-connectivity of graphs},
JOURNAL = {Combinatorica},
YEAR = 1981,
month = "",
volume = 1,
number = "",
pages = "263--273",
copy = ""
}
@INBOOK{Gyo,
AUTHOR = "E. Gy\H ory",
TITLE = "Partitions of $n$-connected graphs",
PAGES = "80--85",
PUBLISHER = "Teubner DDR",
YEAR = "19??",
VOLUME = 59,
SERIES = ttzm,
copy = ""
}
HHH
@article{HaaWex2002,
author = {R. Haas and
T. B. Wexler},
title = {Bounds on the signed domination number of a graph},
journal = {Electronic Notes in Discrete Mathematics},
volume = {11},
year = {2002},
pages = {742--750},
}
@article{HaaWex2004,
author = {R. Haas and
T. B. Wexler},
title = {Signed domination numbers of a graph and its complement},
journal = dm,
volume = {283},
number = {1-3},
year = {2004},
pages = {87--92},
}
@INPROCEEDINGS{Haa84,
crossref = "Flaetal84",
AUTHOR = "H. Haase",
TITLE = "Non-{H}ausdorff measures constructed by method 1",
chapter = "Part 1",
pages = "113--118",
copy = ""
}
@ARTICLE{Haa86,
AUTHOR = "H. Haase",
TITLE = "Non-$\sigma$-finite sets for packing measure",
JOURNAL = mathe,
YEAR = 1986,
month = "",
volume = 33,
number = "",
pages = "129--136",
copy = ""
}
@ARTICLE{Haa88,
AUTHOR = "H. Haase",
TITLE = "Packing measures on ultrametric spaces",
JOURNAL = studmath,
YEAR = 1988,
month = "",
volume = 91,
number = "",
pages = "189--203",
copy = ""
}
@INPROCEEDINGS{Haa88a,
crossref = "Banetal88",
AUTHOR = "H. Haase",
TITLE = "A survey on packing measures",
chapter = "Geometric measure theory",
pages = "41--48",
copy = ""
}
@ARTICLE{Haa88b,
AUTHOR = "H. Haase",
TITLE = "Metric outer measures of type {I} in the general setting",
JOURNAL = mn,
YEAR = 1988,
month = "",
volume = 135,
number = "",
pages = "35--40",
copy = ""
}
@INPROCEEDINGS{HabKre88,
AUTHOR = "A. Habel and H.-J. Kreowski",
TITLE = "Pretty patterns produced by Hyperedge Replacement",
BOOKTITLE = "Proc. WG'87",
YEAR = 1988,
month = "",
volume = "314",
PUBLISHER = "Springer",
editor = "",
series = "{LNCS}",
chapter = "",
pages = "32--45",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{HabKre91,
AUTHOR = "A. Habel and H.-J. Kreowski",
TITLE = "Collage Grammars",
BOOKTITLE = "???",
YEAR = 1991,
month = "",
volume = "532",
editor = "",
series = "{LNCS}",
PUBLISHER = "Springer",
chapter = "",
pages = "411--429",
address = "",
organization = "",
copy = ""
}
@UNPUBLISHED{Habetal92,
AUTHOR = "A. Habel and others",
TITLE = "Collages and patterns generated by hyperedge replacement",
NOTE = "To appear in: {L}anguages of design 1992",
year = 1992,
month = "",
copy = ""
}
@ARTICLE{Habetal93,
AUTHOR = "A. Habel and H.-J. Kreowski and S. Taubenberger",
TITLE = "Collages and patterns generated by hyperedge replacement",
JOURNAL = langdes,
YEAR = 1993,
month = "",
volume = 1,
number = "",
pages = "125--145",
copy = ""
}
@inproceedings{HabDenEsp06,
author = {A. Habrard and
F. Denis and
Y. Esposito},
title = {Using Pseudo-stochastic Rational Languages in Probabilistic
Grammatical Inference},
booktitle = {Grammatical Inference: Algorithms and Applications, 8th
International Colloquium, ICGI},
year = {2006},
pages = {112--124},
editor = {Y. Sakakibara and
S. Kobayashi and
K. Sato and
T. Nishino and
E. Tomita},
publisher = {Springer},
series = {LNCS/LNAI},
volume = {4201},
}
@inproceedings{HabOnc2006,
author = {A. Habrard and
J. Oncina},
title = {Learning Multiplicity Tree Automata},
pages = {268--280},
booktitle = {Grammatical Inference: Algorithms and Applications, 8th
International Colloquium, ICGI},
year = {2006},
editor = {Y. Sakakibara and
S. Kobayashi and
K. Sato and
T. Nishino and
E. Tomita},
publisher = {Springer},
series = {LNAI/LNCS},
volume = {4201},
}
@article{HadDahSha91,
AUTHOR = "R. W. Haddad and A. T. Dahbura and A. B. Sharma",
TITLE = "Increased throughput for the testing and repair of {RAM}s with redundancy",
journal = ieeetoc,
YEAR = 1991,
month = feb,
volume = "40",
number = "2",
series = "",
chapter = "",
pages = "154--166",
address = "",
organization = "",
copy = ""
}
@ARTICLE{Had75,
AUTHOR = "F. Hadlock",
TITLE = "Finding a maximum cut in a planar graph in polynomial time",
JOURNAL = siam,
YEAR = 1975,
month = "",
volume = 4,
number = "",
pages = "221--225",
copy = ""
}
@article{Had97,
title = "Simple {L}agrangian heuristic for the set covering problem",
journal = "European Journal of Operational Research",
volume = "97",
number = "1",
pages = "200--204",
year = "1997",
note = "",
author = "S. Haddadi",
}
@INPROCEEDINGS{HaePeiSko92,
crossref = "Encetal92",
AUTHOR = "Haeseler, F. v. and H.-O. Peitgen and G. Skordev",
TITLE = "Linear cellular automata, substitutions, hierarchical
iterated function systems and attractors",
chapter = "Fundamentals",
pages = "3--23",
copy = ""
}
@ARTICLE{HaePeiSko2000,
AUTHOR = "Haeseler, F. von and H.-O. Peitgen and G. Skordev",
TITLE = "On the fractal structure of the rescaled evolution set of {C}arlitz sequences of polynomials",
JOURNAL = dam,
YEAR = 2000,
month = "",
volume = 103,
number = "",
pages = "89--109",
copy = ""
}
@TECHREPORT{Haf95,
author = "U. Hafner",
title = "Asymmetric Coding in (m)-WFA Image Compression",
INSTITUTION = "Lehrstuhl f{\"u}r Informatik II, Universit{\"a}t W{\"u}rzburg",
YEAR = 1995,
month = "",
number = "132",
address = "",
}
@inproceedings{Haf97,
author = "U. Hafner",
title = "Image and Video Coding with Weighted Finite Automata",
booktitle = "{ICIP} (1)",
pages = "326-329",
year = "1997",
}
@TECHREPORT{Hafetal97,
author = "U. Hafner and S. Frank and M. Unger and J. Albert",
title = "Hybrid weighted finite automata for image and video compression",
INSTITUTION = "Lehrstuhl f{\"u}r Informatik II, Universit{\"a}t W{\"u}rzburg",
YEAR = 1997,
month = "",
number = "160",
address = "",
copy = ""
}
@misc{Hafetal99,
author = "U. Hafner and S. Frank and M. Unger and J. Albert",
title = "Weighted Finite Automata for Video Compression",
year = 1999
}
@inproceedings{Hagetal2002a,
author = {A. Hagerer and
H. Hungar and
T. Margaria and
O. Niese and
B. Steffen and
H.-D. Ide},
title = {Demonstration of an Operational Procedure for the Model-Based
Testing of {CTI} Systems},
pages = {336--340},
booktitle = {Fundamental Approaches to Software Engineering FASE},
year = {2002},
editor = {R.-D. Kutsche and
H. Weber}, publisher = {Springer},
series = {LNCS},
volume = {2306},
}
@inproceedings{Hagetal2002,
author = {A. Hagerer and
H. Hungar and
O. Niese and
B. Steffen},
pages = {80--95},
title = {Model Generation by Moderated Regular Extrapolation},
booktitle = {Fundamental Approaches to Software Engineering FASE},
year = {2002},
editor = {R.-D. Kutsche and
H. Weber}, publisher = {Springer},
series = {LNCS},
volume = {2306},
}
@INPROCEEDINGS{Hag97,
AUTHOR = "T. Hagerup",
TITLE = "Dynamic algorithms for graphs of bounded treewidth",
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 = "292--302",
address = "",
organization = "",
copy = ""
}
@article{Hag2012,
author = {T. Hagerup},
title = {A strengthened analysis of an algorithm for Dominating Set
in planar graphs},
journal = dam,
volume = {160},
number = {6},
year = {2012},
pages = {793--798},
}
@inproceedings{Hag2012a,
author = {T. Hagerup},
title = {Kernels for Edge Dominating Set: Simpler or Smaller},
pages = {491--502},
ee = {http://dx.doi.org/10.1007/978-3-642-32589-2_44},
crossref = {DBLP:conf/mfcs/2012},
}
@ARTICLE{Hai69,
AUTHOR = "L. Haines",
TITLE = "Representation theorems for context-sensitive languages",
JOURNAL = {Notices of the American Mathematical Society},
YEAR = 1969,
month = "",
volume = 16,
number = "3",
pages = "527",
copy = ""
}
@ARTICLE{HajMahMir03,
AUTHOR = "M. T. Hajiaghayi and Mahdian, M. and Mirrokni, V.~S.",
TITLE = "The facility location problem with general cost functions",
JOURNAL = {Networks},
YEAR = 2003,
month = "",
volume = 42,
number = "",
pages = "42--47",
copy = "HagMahMir03 electronic"
}
@INPROCEEDINGS{Hajetal2001,
AUTHOR = "Hajiaghayi, M.~T. and Nishimura, N. and Ragde, P. and Thilikos, D.",
TITLE = "Fast approximation schemes for $K_{3,3}$-minor-free or $K_{5}$-minor-free graphs",
BOOKTITLE = "Proc. Euroconference on Combinatorics, Graph Theory and Applications, COMB01",
YEAR = 2001,
month = "",
volume = "10",
editor = "",
series = "Electronic Notes in Discrete Mathematics",
chapter = "",
pages = "158--163",
address = "",
organization = "",
publisher = "",
copy = ""
}
@Article{HajGan02,
author = "Hajiaghayi, M.~T. and Ganjali, Y.",
title = "A Note on the Consecutive Ones Submatrix Problem",
journal = ipl, pages = {163--166},
volume = "83",
year = "2002",
}
@INBOOK{Hal,
AUTHOR = "K. Ha{\l}kowska",
TITLE = "On isomorphisms of some product of graphs",
PAGES = "86--89",
PUBLISHER = "Teubner DDR",
YEAR = "19??",
VOLUME = 59,
SERIES = ttzm,
copy = ""
}
@Article{HalJacSew2008,
author = {S.~N. Hall and
S.~H. Jacobson and
E.~C. Sewell},
title = {An Analysis of Pediatric Vaccine
Formulary Selection Problems},
journal = {Operations Research},
year = {2008},
volume = {56},
number = {6},
pages = {1348--1365},
}
@inproceedings{Hal95,
author = {M. M. Halld{\'o}rsson},
title = {Approximating Discrete Collections via Local Improvements},
booktitle = {Symposium on Discrete Algorithms SODA},
year = {1995},
pages = {160--169},
}
@INPROCEEDINGS{HalHalRav01,
AUTHOR = "B.~V. Halld\'orsson and M.~M. Halld\'orsson and R. Ravi",
TITLE = "On the approximability of the minimum test collection problem",
BOOKTITLE = "9th Annual European Symposium on Algorithms ESA",
YEAR = 2001,
month = "",
volume = "2161",
editor = "F. Meyer auf der Heide",
series = "LNCS",
chapter = "",
pages = "158--169",
address = "",
organization = "",
publisher = "",
copy = ""
}
@ARTICLE{Hal93,
AUTHOR = "M. M. Halld{\'o}rsson",
TITLE = "Approximating the minimum maximal independence number",
JOURNAL = ipl,
YEAR = 1993,
month = "",
volume = 46,
number = "",
pages = "169--172",
copy = ""
}
@INPROCEEDINGS{HalRad94,
AUTHOR = "M.~M. Halld\'orsson and J. Radhakrishnan",
TITLE = "Greedy is good: approximating independent sets in sparse and bounded-degree graphs",
BOOKTITLE = "Proc. 26th Ann. ACM Symp. on the Theory of Computing STOC'94",
YEAR = 1994,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "439--448",
address = "",
organization = "ACM",
copy = ""
}
@INPROCEEDINGS{HalRad94a,
AUTHOR = "M. M. Halld\'orsson and J. Radhakrishnan",
TITLE = "Improved approximations of independent sets in bounded-degree graphs",
BOOKTITLE = "Algorithm Theory -- SWAT'94",
YEAR = 1994,
month = "",
volume = "824",
editor = "E. M. Schmidt and S. Skyum",
series = "LNCS",
chapter = "",
pages = "195--206",
address = "",
organization = "",
copy = ""
}
@article {HalRad97,
AUTHOR = "M.~M. Halld\'orsson and J. Radhakrishnan",
title = {Greed is good: Approximating independent sets in sparse and bounded-degree graphs},
journal = alg,
pages = {145--163},
volume = {18},
issue = {1},
year = {1997}
}
@inproceedings{HalKraTel98,
author = "M. M. Halld\'orsson and J. Kratochv\'\i{}l and J. A. Telle",
title = "Independent Sets with Domination Constraints",
series = "LNCS",
volume = "1443",
pages = "176--187",
year = "1998",
booktitle = {Automata, Languages and Programming, 25th ICALP'98},
publisher ={Springer},
editor = {K. G. Larsen and S. Skyum and G. Winskel}
}
@INPROCEEDINGS{HalKar2006,
AUTHOR = "M.~M. Halld\'orsson and R. K. Karlsson",
TITLE = "Strip Graphs: Recognition and Scheduling.",
booktitle = "WG'06",
PAGES = {137--146},
editor = {F.~V. Fomin},
series ={LNCS},
volume = {4271},
publisher ={Springer},
YEAR = {2006} }
@inproceedings{HalSha2010,
author = {M.~M. Halld{\'o}rsson and
H. Shachnai},
title = {Return of the Boss Problem: Competing Online against a Non-adaptive
Adversary},
booktitle = {Fun with Algorithms, 5th International Conference, FUN},
year = {2010},
pages = {237--248},
editor = {P. Boldi and
L. Gargano},
publisher = {Springer},
series = {LNCS},
volume = {6099},
}
@ARTICLE{Hal2002,
AUTHOR = "E. Halperin",
TITLE = "Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs",
JOURNAL = siam,
YEAR = 2002,
month = "",
volume = 31,
number = "",
pages = "1608--1623",
copy = ""
}
@InProceedings{HamGayGoo2004,
author = {Hamdioui, S. and Gaydadjiev, G. and van de Goor, A.~J.},
title = {The state-of-art and future trends in testing embedded memories},
booktitle = {Records of the International Workshop on Memory Technology, Design and Testing MTDT},
OPTcrossref = {},
OPTkey = {},
pages = {54--59},
year = {2004},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
organization = {IEEE},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}
@article{HamPelSun90,
title = "Difference graphs",
journal = dam,
volume = "28",
number = "1",
pages = "35--44",
year = "1990",
author = "P.~L. Hammer and U.~N. Peled and X. Sun"
}
@ARTICLE{Ham71,
AUTHOR = "W. D. Hamilton",
TITLE = "Geometry of the selfish herd",
JOURNAL = jtb,
YEAR = 1971,
volume = 31,
number = "",
pages = "295--311",
copy = ""
}
@ARTICLE{Ham97,
AUTHOR = "R. Hamzaoui",
TITLE = "A new decoding algorithm for fractal image compression",
JOURNAL = {Electronic Letters},
YEAR = 1997,
month = "",
volume = 33,
number = "1",
pages = "46--48",
copy = ""
}
@TECHREPORT{Ham97a,
AUTHOR = "R. Hamzaoui",
TITLE = "Fast decoding algorithms for fractal image compression",
INSTITUTION = "Institut f{\"u}r Informatik, Universit{\"a}t Freiburg",
YEAR = 1997,
month = mar,
number = "86",
address = "",
note ={Also in: Proc. Conf. Fractals in Engineering, June 1997},
copy = ""
}
@article{HanPunYe2009,
author = {Q. Han and A.~P. Punnen and Y. Ye},
title ={An edge-reduction algorithm for the vertex cover problem},
journal ={Operations Research Letters},
volume = {37},
pages ={181--186},
year ={2009}
}
@ARTICLE{HanKur72,
AUTHOR = "M. Hanan and J. M. Kurtzberg",
TITLE = "A review of the placement and quadratic assignment problems",
JOURNAL = {SIAM Rev.},
YEAR = 1972,
month = "",
volume = 14,
number = "",
pages = "324--342",
copy = ""
}
@ARTICLE{HanHar00,
AUTHOR = "K. Handa and K. Haruki",
TITLE = "A Reconfiguration Algorithm for Memory Arrays Containing Faulty Spares",
JOURNAL = {IEICE Trans. Fundamentals},
YEAR = 2000,
month = "",
volume = {E83-A},
number = "6",
pages = "1123--1130",
copy = ""
}
@Article{HanPev95a,
author = "S. Hannenhalli and P. A. Pevzner",
title = "Towards a Computational Theory of Genome
Rearrangements",
journal = "Lecture Notes in Computer Science",
volume = "1000",
pages = "184--??",
year = "1995",
ISSN = "0302-9743",
}
@INPROCEEDINGS{Han95,
AUTHOR = "S. Hannenhalli",
TITLE = "Polynomial-time algorithm for computing translocation distance between genomes",
BOOKTITLE = "6th Combinatorial Pattern Matching CPM",
YEAR = 1995,
month = "",
volume = "??",
editor = "",
series = "LNCS",
chapter = "",
pages = "162--176",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@INPROCEEDINGS{HanPev95,
AUTHOR = "S. Hannenhalli and P. Pevzner",
TITLE = "Transforming cabbage into turnip",
BOOKTITLE = "27th STOC",
YEAR = 1995,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "178--189",
address = "",
organization = "ACM",
publisher = "",
copy = ""
}
@InProceedings{HanPev95b,
author = "S. Hannenhalli and P. A. Pevzner",
title = "Transforming men into mice (polynomial algorithm for
genomic distance problem)",
editor = "{IEEE}",
booktitle = "36th Annual Symposium on Foundations of Computer
Science FOCS",
publisher = "IEEE Computer Society Press",
address = "1109 Spring Street, Suite 300, Silver Spring, MD
20910, USA",
year = "1995",
pages = "581--592",
}
@InProceedings{HanPev96,
author = "S. Hannenhalli and P. Pevzner",
title = "To Cut ... Or Not To Cut (applications of comparative
physical maps in molecular evolution)",
booktitle = "SODA: ACM-SIAM Symposium on Discrete Algorithms (A
Conference on Theoretical and Experimental Analysis of
Discrete Algorithms)",
year = "1996", pages = {304--313}
}
@Article{HanVol2009,
author = {A. Hansberg and L. Volkmann},
title = {Upper bounds on the
$k$-domination number and the $k$-{R}oman domination number},
journal = dam,
year = {2009},
volume = {157},
pages = {1634--1639},
}
@article{HanMeiVol2010,
author = {A. Hansberg and
D. Meierling and
L. Volkmann},
title = {A general method in the theory of domination in graphs},
journal = ijcm,
volume = {87},
number = {13},
year = {2010},
pages = {2915--2924},
}
@article{HanMeiVol2011,
author = {A. Hansberg and
D. Meierling and
L. Volkmann},
title = {Independence and $k$-domination in graphs},
journal = ijcm,
volume = {88},
number = {5},
year = {2011},
pages = {905--915},
}
@ARTICLE{HanPer83,
AUTHOR = "G. Hansel and D. Perrin",
TITLE = "Codes and {B}ernoulli partitions",
JOURNAL = mst,
YEAR = 1983,
month = "",
volume = 16,
number = "",
pages = "133--157",
copy = ""
}
@ARTICLE{HanPer89,
AUTHOR = "G. Hansel and D. Perrin",
TITLE = "Rational probability measures",
JOURNAL = tcs,
YEAR = 1989,
month = "",
volume = 65,
number = "",
pages = "171--188",
copy = ""
}
@InProceedings{Han76,
author = {D.~R. Hanson},
title = {A procedure mechanism for backtrack programming},
booktitle = {ACM Annual Conf.},
OPTcrossref = {},
OPTkey = {},
pages = {401--405},
year = {1976},
}
@article {HanJau90,
author = {Hansen, P. and Jaumard, B.},
title = {Algorithms for the maximum satisfiability problem},
journal = {Computing},
pages = {279--303},
volume = {44},
issue = {4},
year = {1990}
}
@article{Haretal2010,
title = "Packing disjoint cycles over vertex cuts",
journal = dm,
volume = "310",
number = "13–14",
pages = "1974--1978",
year = "2010",
author = "J. Harant and D. Rautenbach and P. Recht and I. Schiermeyer and E.-M. Sprengel",
}
@ARTICLE{HarNog75,
AUTHOR = "M. Harao and S. Noguchi",
TITLE = "Fault tolerant cellular automata",
JOURNAL = jcss,
YEAR = 1975,
month = "",
volume = 11,
number = "",
pages = "171--185",
copy = ""
}
@ARTICLE{HarNog79,
AUTHOR = "M. Harao and S. Noguchi",
TITLE = "Global mapping of cellular systems",
JOURNAL = icalt,
YEAR = 1979,
volume = 43,
number = 2,
pages = "241--254",
note = "Kopie bei worsch"
}
@Article{HarMel76,
author = {F. Harary and R.~A. Melter},
title = {On the metric dimension of a graph},
journal = arscomb,
year = {1976},
volume = {2},
pages = {191--195},
}
@PHDTHESIS{Har85,
AUTHOR = "D. P. Hardin",
TITLE = "Hyperbolic iterated function systems and applications",
SCHOOL = "Georgia Institute of Technology, School of Mathematics",
YEAR = 1985,
month = dec,
address = "Atlanta, Georgia 30332 (USA)",
type = "",
copy = ""
}
@ARTICLE{HarPat94,
AUTHOR = "D. Harel and M. S. Paterson",
TITLE = "Undecidability of {PDL} with {$L=\{a^{2^i}\mid i\geq 0\}$}",
JOURNAL = jcss,
YEAR = 1984,
month = "",
volume = 29,
number = "",
pages = "359--365",
copy = ""
}
@ARTICLE{Har87,
AUTHOR = "D. Harel",
TITLE = "Statecharts: a visual formalism for complex systems",
JOURNAL = "Science of Computer Programming",
YEAR = 1987,
month = "",
volume = 8,
number = "",
pages = "231--274",
copy = ""
}
@ARTICLE{Har88,
AUTHOR = "D. Harel",
TITLE = "On visual formalisms",
JOURNAL = cacm,
YEAR = 1988,
month = "",
volume = 31,
number = "5",
pages = "514--530",
copy = ""
}
@ARTICLE{HarChoSar92,
AUTHOR = "S. Hariri and A. Choudhary and B. Sarikaya",
TITLE = "Architectural support for designing fault-tolerant
open distributed systems",
JOURNAL = ieeecomp,
YEAR = 1992,
month = jun,
volume = "",
number = "",
pages = "50--62",
copy = ""
}
@ARTICLE{HarKumOwi92,
AUTHOR = "V. Harizanov and M. Kummer and J. Owings",
TITLE = "Frequency computations and the cardinality theorem",
JOURNAL = {The Journal of Symbolic Logic},
YEAR = 1992,
month = "",
volume = 57,
number = "",
pages = "682--687",
copy = ""
}
@ARTICLE{HarPen79,
AUTHOR = "T. Harju and M. Penttonen",
TITLE = "Some decidability problems of sentential forms",
JOURNAL = ijcm,
YEAR = 1979,
month = "",
volume = 7,
number = "",
pages = "95--108",
copy = ""
}
@ARTICLE{HarKarKle86,
AUTHOR = "T. Harju and J. Karhum{\"a}ki and H. C. Kleijn",
TITLE = "On morphic generation of regular languages",
JOURNAL = dam,
YEAR = 1986,
month = "",
volume = 15,
number = "",
pages = "55--60",
copy = ""
}
@ARTICLE{HarLin86,
AUTHOR = "T. Harju and M. Linna",
TITLE = "On the periodicity of morphisms on free monoids",
JOURNAL = rairoita,
YEAR = 1986,
month = "",
volume = 20,
number = "1",
pages = "47--54",
copy = ""
}
@ARTICLE{HarKar91,
AUTHOR = "T. Harju and J. Karhum{\"a}ki",
TITLE = "The equivalence problem for multitape finite automata",
JOURNAL = tcs,
YEAR = 1991,
month = "",
volume = 78,
number = "",
pages = "347--355",
copy = ""
}
@ARTICLE{HarKle91,
AUTHOR = "T. Harju and H. C. M. Kleijn",
TITLE = "Decidability problems for unary output sequential transducer",
JOURNAL = dam,
YEAR = {1991},
month = "",
volume = 32,
number = "",
pages = "131--140",
copy = ""
}
@ARTICLE{HarKleLat92,
AUTHOR = "T. Harju and H. C. M. Kleijn and M. Latteux",
TITLE = "Deterministic sequential functions",
JOURNAL = actainform,
YEAR = 1992,
month = "",
volume = 29,
number = "",
pages = "545--554",
copy = ""
}
@ARTICLE{HarKleLat92a,
AUTHOR = "T. Harju and H. C. M. Kleijn and M. Latteux",
TITLE = "Compositional representations of rational functions",
JOURNAL = rairo,
YEAR = 1992,
month = "",
volume = 26,
number = "",
pages = "243--255",
copy = ""
}
@ARTICLE{HarKle93,
AUTHOR = "T. Harju and H. C. M. Kleijn",
TITLE = "Morphisms and rational transducers",
JOURNAL = eatcs,
YEAR = 1993,
month = "",
volume = 51,
number = "",
pages = "168--180",
copy = ""
}
@Article{Haretal94,
author = "T. Harju and H. C. M. Kleijn and M. Latteux and A. Terlutte",
title = "Representation of Rational Functions with Prefix and Suffix Codings",
journal = tcs,
volume = "134",
year="1994",
}
@ARTICLE{HarIli97,
AUTHOR = "T. Harju and L. Ilie",
TITLE = "Languages obtained from infinite words",
JOURNAL = rairoita,
YEAR = 1997,
month = "",
volume = 31,
number = "5",
pages = "445--455",
copy = ""
}
@inproceedings{HarHea2011,
author = {M. Harrigan and
P. Healy},
title = {{$k$}-Level Crossing Minimization Is {NP}-Hard for Trees},
booktitle = {WALCOM: Algorithms and Computation - 5th International Workshop},
year = {2011},
pages = {70--76},
editor = {N. Katoh and
A. Kumar},
publisher = {Springer},
series = {LNCS},
volume = {6552},
}
@ARTICLE{Har87a,
AUTHOR = "L. A. Harris",
TITLE = "SLR(1) and LALR(1) parsing for unrestricted grammars",
JOURNAL = actainform,
YEAR = 1987,
month = "",
volume = 24,
number = "",
pages = "191--209",
copy = ""
}
@Article{HarHat2004,
author = {L. Harris and J.~H. Hattingh},
title = {The algorithmic complexity of certain functional
variations of total domination in graphs},
journal = {Australasian Journal of Combinatorics},
year = {2004},
OPTkey = {},
volume = {29},
OPTnumber = {},
pages = {143--156},
}
@INPROCEEDINGS{HarHav72,
crossref = "Niv73",
AUTHOR = "M. A. Harrison and I. M. Havel",
TITLE = "On a family of deterministic grammars (Extended abstract)",
chapter = "",
pages = "413--441",
copy = ""
}
@ARTICLE{HarIba68,
AUTHOR = "M. A. Harrison and O. H. Ibarra",
TITLE = "Multi-tape and multi-head pushdown automata",
JOURNAL = icalt,
YEAR = 1968,
month = "",
volume = 13,
number = "",
pages = "433--470",
copy = ""
}
@ARTICLE{Har89,
AUTHOR = "J. Harrison",
TITLE = "Embedded continued fractals and their {H}ausdorff dimension",
JOURNAL = constappr,
YEAR = 1989,
month = "",
volume = 5,
number = "",
pages = "99--115",
copy = ""
}
@Article{Har75,
author = {J.~M. Hart},
title = {Recursive generation of local adjunct languages},
journal = tocs,
year = {1975},
OPTkey = {},
volume = {9},
OPTnumber = {},
pages = {315--326},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {10.1007/BF01715358},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@ARTICLE{HarHop70,
AUTHOR = "J. Hartmanis and J. E. Hopcroft",
TITLE = "What makes some language theory properties undecidable",
JOURNAL = jcss,
YEAR = 1970,
VOLUME = 4,
NUMBER = "",
PAGES = "368--376",
copy = ""
}
@ARTICLE{HarLew71,
AUTHOR = "J. Hartmanis and F. D. Lewis",
TITLE = "The use of lists in the study of undecidable problems in automata theory",
JOURNAL = jcss,
YEAR = 1971,
VOLUME = 5,
NUMBER = "",
PAGES = "54--66",
copy = ""
}
@INPROCEEDINGS{Har79,
AUTHOR = "J. Hartmanis",
TITLE = "On the succinctness of different representations of languages",
BOOKTITLE = "ICALP'79",
YEAR = 1979,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "282--288",
address = "",
organization = "",
copy = ""
}
@InProceedings{HasLiu88,
author = "N. Hasan and C. L. Liu",
title = "Minimum Fault Coverage in Reconfigurable Arrays",
pages = "348--353",
booktitle = "International Symposium on Fault-Tolerant Computing
({FTCS} '88)",
month = jun,
publisher = "IEEE Computer Society Press",
address = "Washington, D.C., USA",
year = "1988",
}
@Article{HasLiu90,
author = "N. Hasan and C. L. Liu",
title = "Fault covers in reconfigurable {PLA}s",
journal = "20th Int. Symp. on Fault-Tolerant Computing Systems
(FTCS-20)",
pages = "166--173",
publisher = "IEEE Computer Society Press",
address = "Newcastle upon Tyne, UK",
year = "1990",
}
@UNPUBLISHED{Hasetal97,
AUTHOR = "T. Hasebe and others",
TITLE = "Two-dimensional ruler automata",
NOTE = "Received in " #mar#", improved English version of
the Japanese Technical Report IEICE COMP96--49 with
the title `Hierarchies of two-dimensional ruler
automata based on the number of rulers' ",
year = 1997,
month = "",
copy = ""
}
@ARTICLE{Has83,
AUTHOR = "K. Hashiguchi",
TITLE = "Representation theorems on regular languages",
JOURNAL = jcss,
YEAR = 1983,
month = "",
volume = 27,
number = "",
pages = "101--115",
copy = ""
}
@ARTICLE{HasHon76a,
AUTHOR = "K. Hashiguchi and N. Honda",
TITLE = "Homomorphisms that preserve star height",
JOURNAL = icalt,
YEAR = 1976,
month = "",
volume = 30,
number = "",
pages = "247--266",
copy = ""
}
@ARTICLE{HasHon76b,
AUTHOR = "K. Hashiguchi and N. Honda",
TITLE = "Properties of codes events and homomorphisms over
regular events",
JOURNAL = jcss,
YEAR = 1976,
month = "",
volume = 12,
number = "",
pages = "352--367",
copy = ""
}
@ARTICLE{HasRub94,
AUTHOR = "R. Hassin and S. Rubinstein",
TITLE = "Approximations For The Maximum Acyclic Subgraph Problem",
JOURNAL = ipl,
YEAR = 1997,
month = "",
volume = 51,
number = "",
pages = "133--140",
copy = ""
}
@ARTICLE{HasRub97,
AUTHOR = "R. Hassin and S. Rubinstein",
TITLE = "An Approximation Algorithm For Maximum of 3-edge Paths",
JOURNAL = ipl,
YEAR = 1997,
month = "",
volume = 63,
number = "",
pages = "63--67",
copy = ""
}
@ARTICLE{HasRub98,
AUTHOR = "R. Hassin and S. Rubinstein",
TITLE = "An Approximation Algorithm for the {M}aximum {T}ravelling {S}alesman {P}roblem",
JOURNAL = ipl,
YEAR = 1998,
month = "",
volume = 67,
number = "",
pages = "125--130",
copy = ""
}
@ARTICLE{HasRub2000,
AUTHOR = "R. Hassin and S. Rubinstein",
TITLE = "Better Approximations for max {TSP}",
JOURNAL = ipl,
YEAR = 2000,
month = "",
volume = 75,
number = "",
pages = "181--186",
copy = ""
}
@ARTICLE{HasRub2001,
AUTHOR = "R. Hassin and S. Rubinstein",
TITLE = "Approximation Algorithms for {M}aximum {L}inear {A}rrangement",
JOURNAL = ipl,
YEAR = 2001,
month = "",
volume = 80,
number = "",
pages = "171--177",
copy = ""
}
@article{HasLev2005,
author = {R. Hassin and
A. Levin},
title = {A Better-Than-Greedy Approximation Algorithm for the Minimum
Set Cover Problem},
journal = siam,
volume = {35},
number = {1},
year = {2005},
pages = {189--200},
}
@ARTICLE{HasRub2006,
AUTHOR = "R. Hassin and S. Rubinstein",
TITLE = "An approximation algorithm for maximum triangle packing",
JOURNAL = dam,
YEAR = {2006},
month = "",
volume = 154,
number = "",
pages = "971--979; 2620 [Erratum]",
copy = ""
}
@ARTICLE{Hat85,
AUTHOR = "M. Hata",
TITLE = "On some properties of set-dynamical systems",
JOURNAL = pjaa,
YEAR = 1985,
month = "",
volume = 61,
number = "",
pages = "99--102",
copy = ""
}
@ARTICLE{Hat85a,
AUTHOR = "M. Hata",
TITLE = "On the structure of self-similar sets",
JOURNAL = jjam,
YEAR = 1985,
month = "",
volume = 2,
number = "",
pages = "381--414",
copy = ""
}
@INBOOK{Hat91,
AUTHOR = "J. B\'elair amd S. Dubuc (eds.)",
TITLE = "Fractal geometry and analysis",
PAGES = "255--276",
CHAPTER = "M. Hata: Topological aspects of self-similar sets
and singular functions",
PUBLISHER = "Dordrecht: Kluwer Acad. Publ.",
YEAR = 1991,
month = "",
address = "",
volume = {},
series = "",
type = "",
copy = ""
}
@Article{HatHenSla95,
author = {J.~H. Hattingh and M. A. Henning and P. J. Slater},
title = {The algorithmic complexity of
signed domination in graphs},
journal = {Australasian Journal of Combininatorics},
year = {1995},
OPTkey = {},
volume = {12},
OPTnumber = {},
pages = {101--112},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTurldate = {},
OPTlastchecked = {},
OPTdoi = {},
OPTisbn = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
OPTkeywords = {},
}
@article{HatJou2011,
author = {J.~H. Hattingh and
E.~J. Joubert},
title = {Restrained domination in cubic graphs},
journal = joco,
volume = {22},
year = {2011},
pages = {166--179},
}
@ARTICLE{Hau73,
AUTHOR = "J. Hauck",
TITLE = "Berechenbare reelle {F}unktionen",
JOURNAL = zmathlog,
YEAR = 1973,
month = "",
volume = 19,
number = "",
pages = "121--140",
copy = ""
}
@inproceedings{Hauetal2009,
author = {Hauptman, A. and Elyasaf, A. and Sipper, M. and Karmon, A.},
title = {{GP-Rush}: using genetic programming to evolve solvers for the {R}ush {H}our puzzle},
booktitle = {Proceedings of the 11th Annual conference on Genetic and Evolutionary Computation GECCO},
year = {2009},
pages = {955--962},
publisher = {ACM},
}
@article{HauSchVie2012,
author = {M. Hauptmann and
R. Schmied and
C. Viehmann},
title = {Approximation complexity of Metric Dimension problem},
journal = jda,
volume = {14},
year = {2012},
pages = {214--222},
}
@ARTICLE{HauJan94,
AUTHOR = "D. Hauschildt and M. Jantzen",
TITLE = "Petri net algorithms in the theory of matrix grammars",
JOURNAL = actainform,
year = 1994,
volume = 31,
pages = "719--728",
month = "",
copy = ""
}
@ARTICLE{Hau19,
AUTHOR = "F. Hausdorff",
TITLE = "Dimension und {\"au\ss eres} {Ma\ss}",
JOURNAL = ma,
YEAR = 1919,
volume = 79,
number = "",
pages = "157--179",
copy = ""
}
@INPROCEEDINGS{Hauetal88,
AUTHOR = "D. Haussler and others",
TITLE = "Equivalence of models for polynomial learnability",
BOOKTITLE = "Proc. 1st Workshop of Computational Learning Theory COLT",
YEAR = 1988,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "42--",
address = "",
organization = "",
copy = ""
}
@ARTICLE{HauZei80,
AUTHOR = "D. Haussler and H. P. Zeiger",
TITLE = "Very special languages and representations of
recursively enumerable languages via computation
histories",
JOURNAL = icalt,
YEAR = 1980,
VOLUME = 47,
NUMBER = "",
PAGES = "201--212",
copy = ""
}
@Article{Hau85,
author ="D. Haussler",
year ="1985",
title ="Another generalization of {Higman}'s well quasi order result
on {$\Sigma^*$}",
journal =dm,
volume ="57",
number ="3",
pages ="237--243",
}
@article{Hau87,
author = {D. Haussler},
title = {New Theoretical Directions in Machine Learning},
journal = {Machine Learning},
volume = {2},
number = {4},
year = {1987},
pages = {281--284},
}
@article{Hau88,
author = {D. Haussler},
title = {Quantifying Inductive Bias: {AI} Learning Algorithms and {V}aliant's
Learning Framework},
journal = {Artif. Intell.},
volume = {36},
number = {2},
year = {1988},
pages = {177--221},
}
@article{Hauetal91,
author = {D. Haussler and
M. J. Kearns and
N. Littlestone and
M. K. Warmuth},
title = {Equivalence of Models for Polynomial Learnability},
journal = ic,
volume = {95},
number = {2},
year = {1991},
pages = {129--161},
}
@article{Hau92,
author = {D. Haussler},
title = {Decision Theoretic Generalizations of the {PAC} Model for
Neural Net and Other Learning Applications},
journal = ic,
volume = {100},
number = {1},
year = {1992},
pages = {78--150},
}
@INBOOK{Hav,
AUTHOR = "I. Havel",
TITLE = "Semipaths in directed cubes",
PAGES = "101--108",
PUBLISHER = "Teubner DDR",
YEAR = "19??",
VOLUME = 59,
SERIES = ttzm,
copy = ""
}
@INBOOK{HavLab,
AUTHOR = "I. Havel and J.-M. Laborde",
TITLE = "{\"Uberblick \"uber} Ergebnisse und Probleme zu Einbettungen
von Graphen in den {n-W\"urfel}",
PAGES = "52--56",
PUBLISHER = "Teubner DDR",
YEAR = "19??",
VOLUME = 73,
SERIES = ttzm,
copy = ""
}
@INBOOK{Hav82,
AUTHOR = "I. Havel",
TITLE = "Embedding the directed dichotomic tree into the n-cube",
PAGES = "39--45",
PUBLISHER = wpur,
YEAR = 1982,
VOLUME = 21,
SERIES = rmk,
copy = ""
}
@INBOOK{Hava,
AUTHOR = "I. Havel",
TITLE = "Embedding graphs in undirected and directed graphs",
PAGES = "60--68",
PUBLISHER = "Berlin: Springer",
YEAR = "19??",
VOLUME = 1018,
SERIES = "LN in Mathematics",
copy = ""
}
@ARTICLE{Haw74,
AUTHOR = "J. Hawkes",
TITLE = "Hausdorff measure, entropy, and the independence of
small sets",
JOURNAL = plms3,
YEAR = 1974,
month = "",
volume = 28,
number = "",
pages = "700--724",
copy = ""
}
@article{HaxPikTho2008,
author = {P.~E. Haxell and
O. Pikhurko and
A. Thomason},
title = {Maximum acyclic and fragmented sets in regular graphs},
journal = jgth,
volume = {57},
number = {2},
year = {2008},
pages = {149--156},
}
@ARTICLE{Hay85,
AUTHOR = "S. Hayashi",
TITLE = "Self-similar sets as {T}arski's fixed points",
JOURNAL = pubRIMS,
YEAR = 1985,
month = "",
volume = 21,
number = "",
pages = "1059--1066",
copy = ""
}
@Article{Hay75,
author = {J.~P. Hayes},
title = {Detection of pattern-sensitive faults in random-access memories},
journal = ieeetoc,
year = {1975},
OPTkey = {},
volume = {C-24},
OPTnumber = {},
pages = {150--157},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{HayHen2003,
AUTHOR = "T. W. Haynes and M. A. Henning",
TITLE = "Changing and unchanging domination: a classification",
JOURNAL = dm,
YEAR = 2003,
month = "",
volume = 272,
number = "",
pages = "65--79",
copy = ""
}
@article{Hayetal2002,
author = {T.~W. Haynes and
S. M. Hedetniemi and
S. T. Hedetniemi and
M. A. Henning},
title = {Domination in Graphs Applied to Electric Power Networks},
journal = {SIAM J. Discrete Math.},
volume = {15},
number = {4},
year = {2002},
pages = {519--529},
}
@ARTICLE{HayHedHen2003,
AUTHOR = "T. W. Haynes and S. T. Hedetniemi and M. A. Henning",
TITLE = "Global defensive alliances in graphs",
JOURNAL = {The Electronic J. Combin.},
YEAR = 2003,
month = "",
volume = 10,
number = "R47, \url{www.combinatorics.org/Volume_10/v10i1r47.pdf}",
pages = "",
copy = ""
}
@INPROCEEDINGS{Hea84,
AUTHOR = "T. Head",
TITLE = "Adherence equivalence is decidable for {D0L} languages",
BOOKTITLE = "{LNCS} 166; {STACS}",
YEAR = 1984,
pages = "241--249",
organization = "",
copy = ""
}
@INPROCEEDINGS{Hea84a,
crossref = "NivPer84",
AUTHOR = "T. Head",
TITLE = "The adherences of languages as topological spaces",
chapter = "Part {IV}: {T}opological aspects of automata on
infinite words",
pages = "147--163",
copy = ""
}
@ARTICLE{HeaWil85,
AUTHOR = "T. Head and J. Wilkinson",
TITLE = "Code properties and homomorphisms of {D0L} systems",
JOURNAL = tcs,
YEAR = 1985,
month = "",
volume = 35,
number = "",
pages = "295--312",
copy = ""
}
@ARTICLE{Hea86,
AUTHOR = "T. Head",
TITLE = "The topological structure of adherences of regular languages",
JOURNAL = rairoita,
YEAR = 1986,
month = "",
volume = 20,
number = "1",
pages = "31--41",
copy = ""
}
@ARTICLE{HeaLan86,
AUTHOR = "T. Head and B. Lando",
TITLE = "Periodic {D0L} languages",
JOURNAL = tcs,
YEAR = 1986,
month = "",
volume = 46,
number = "",
pages = "83--89",
copy = ""
}
@ARTICLE{HeaLan86a,
AUTHOR = "T. Head and B. Lando",
TITLE = "Regularity of sets of initial strings of periodic
{D0L}-systems",
JOURNAL = tcs,
YEAR = 1986,
month = "",
volume = 48,
number = "",
pages = "101--108",
copy = ""
}
@ARTICLE{HeaLan87,
AUTHOR = "T. Head and B. Lando",
TITLE = "Bounded {D0L} languages",
JOURNAL = tcs,
YEAR = 1987,
month = "",
volume = 51,
number = "",
pages = "255--264",
copy = ""
}
@INPROCEEDINGS{HeaKobYok98,
AUTHOR = "T. Head and S. Kobayashi and T. Yokomori",
TITLE = "Locality, Reversibility, and Beyond: Learning Languages from
Positive Data",
BOOKTITLE = "ALT'98",
YEAR = 1998,
month = "",
volume = "1537",
editor = "",
series = "LNCS",
chapter = "",
pages = "191--204",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{HeaLyn2005,
AUTHOR = "P. Healy and K. Lynch",
TITLE = "Fixed-parameter tractable algorithms for testing upward planarity",
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 = "199--208",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@inproceedings{HeaDem2002,
author = {R.~A. Hearn and
E.~D. Demaine},
title = {The Nondeterministic Constraint Logic Model of Computation:
Reductions and Applications},
booktitle = {Automata, Languages and Programming ICALP},
year = {2002},
pages = {401--413},
editor = {P. Widmayer and
F. Triguero Ruiz and
R. Morales Bueno and
M. Hennessy and
S. Eidenbenz and
R. Conejo},
publisher = {Springer},
series = {LNCS},
volume = {2380},
}
@article{HeaDem2005,
author = {R.~A. Hearn and
E.~D. Demaine},
title = {{PSPACE}-completeness of sliding-block puzzles and other problems
through the nondeterministic constraint logic model of computation},
journal = tcs,
volume = {343},
number = {1--2},
year = {2005},
pages = {72--96},
}
@ARTICLE{HedLas90,
AUTHOR = "S. T. Hedetniemi and R. C. Laskar",
TITLE = "Bibliography on domination in graphs and some basic definitions of domination parameters",
JOURNAL = dm,
YEAR = 1990,
month = "",
volume = 86,
number = "",
pages = "257--277",
copy = ""
}
@INPROCEEDINGS{HedLas88,
crossref = "AppDisMat88",
AUTHOR = "S.~T. Hedetniemi and R. Laskar",
TITLE = "Recent results and open problems in domination theory",
pages = "205--218",
copy = ""
}
@Article{HedLasPfa85,
author = {S.~T. Hedetniemi and R. Laskar and J. Pfaff},
title = {Irredundance in graphs: a survey},
journal = {Congr. Numer.},
year = {1985},
OPTkey = {},
volume = {48},
OPTnumber = {},
pages = {183--193},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{HebSav2005,
AUTHOR = "S. Heber and C. D. Savage",
TITLE = "Common intervals of trees",
JOURNAL = ipl,
YEAR =2005,
month = "",
volume = 93,
number = "",
pages = "69--74",
copy = ""
}
@ARTICLE{Hed69,
AUTHOR = "G. A. Hedlund",
TITLE = "Endomorphisms and automorphisms of the shift
dynamical system",
JOURNAL = mst,
YEAR = 1969,
month = "",
volume = 3,
number = "",
pages = "320--375",
copy = ""
}
@ARTICLE{Heg82,
AUTHOR = "A. Heged{\"u}s",
TITLE = "Algorithms for covering polygons by rectangles",
JOURNAL = {Computer Aided Design},
YEAR = 1982,
month = "",
volume = 14,
number = "",
pages = "257--260",
copy = ""
}
@article{HegTel98,
author = {P. Heggernes and
J.~A. Telle},
title = {Partitioning Graphs into Generalized Dominating Sets},
journal = {Nord. J. Comput.},
volume = {5},
number = {2},
year = {1998},
pages = {128--142},
}
@inproceedings{HegMih2008,
author = {P. Heggernes and R. Mihai},
title = {Mixed Search Number of Permutation Graphs},
booktitle = {Frontiers in Algorithmics FAW},
year = {2008},
pages = {196--207},
editor = {F. P. Preparata and
X. Wu and
J. Yin},
publisher = {Springer},
series = {LNCS},
volume = {5059},
}
@article{HegMan2009,
author = {P. Heggernes and
F. Mancini},
title = {Minimal split completions},
journal = dam,
volume = {157},
number = {12},
year = {2009},
pages = {2659--2669},
}
@article{HegMan2009a,
author = {P. Heggernes and
F. Mancini},
title = {Dynamically maintaining split graphs},
journal = dam,
volume = {157},
number = {9},
year = {2009},
pages = {2057--2069},
}
@article{HegPap2009,
author = {P. Heggernes and
C. Papadopoulos},
title = {Single-edge monotonic sequences of graphs and linear-time
algorithms for minimal completions and deletions},
journal = tcs,
volume = {410},
number = {1},
year = {2009},
pages = {1--15},
}
@inproceedings{HegMeiRot2010,
author = {P. Heggernes and
D. Meister and
U. Rotics},
editor = {J. Kratochv\'{\i}l and
A. Li and
J. Fiala and
P. Kolman},
title = {Exploiting Restricted Linear Structure to Cope with the
Hardness of Clique-Width},
booktitle = {Theory and Applications of Models of Computation TAMC},
year = {2010},
pages = {284--295},
publisher = {Springer},
series = {LNCS},
volume = {6108},
}
@article{HegMei2010,
author = {P. Heggernes and
D. Meister},
title = {Hardness and approximation of minimum distortion embeddings},
journal = ipl,
volume = {110},
year = {2010},
pages = {312--316},
}
@inproceedings{HegMeiVil2010,
author = {P. Heggernes and
D. Meister and
Y. Villanger},
title = {Induced Subgraph Isomorphism on Interval and Proper Interval
Graphs},
booktitle = {Algorithms and Computation --- 21st International Symposium,
ISAAC 2010,
Part II},
year = {2010},
pages = {399--409},
editor = {O. Cheong and
K.-Y. Chwa and
K. Park},
publisher = {Springer},
series = {LNCS},
volume = {6507},
}
@article{HegMeiPro2011,
author = {P. Heggernes and
D. Meister and
A. Proskurowski},
title = {Computing minimum distortion embeddings into a path for
bipartite permutation graphs and threshold graphs},
journal = tcs,
volume = {412},
number = {12--14},
year = {2011},
pages = {1275--1297},
}
@article{HegMeiPap2011,
author = {P. Heggernes and
D. Meister and
C. Papadopoulos},
title = {Graphs of linear clique-width at most 3},
journal = tcs,
volume = {412},
number = {39},
year = {2011},
pages = {5466--5486},
}
@inproceedings{HegMeiRot2011,
author = {P. Heggernes and
D. Meister and
U. Rotics},
title = {Computing the Clique-Width of Large Path Powers in Linear
Time via a New Characterisation of Clique-Width},
booktitle = {Computer Science Symposium in Russia CSR},
year = {2011},
pages = {233--246},
editor = {A.~S. Kulikov and
N.~K. Vereshchagin},
publisher = {Springer},
series = {LNCS},
volume = {6651},
year = {2011},
}
@InProceedings{Hegetal2011,
author = {P. Heggernes and P. van 't Hof and D. Lokshtanov and C. Paul},
title = {Obtaining a Bipartite Graph by Contracting Few Edges},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {217--228},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
year = {2011},
volume = {13},
editor = {S. Chakraborty and A. Kumar},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
}
@article{HegMeiPap2012,
author = {P. Heggernes and
D. Meister and
C. Papadopoulos},
title = {Characterising the linear clique-width of a class of graphs
by forbidden induced subgraphs},
journal = dam,
volume = {160},
number = {6},
year = {2012},
pages = {888--901},
}
@inproceedings{HeiLub2005,
author = {L. Heinrich-Litan and
M. E. L{\"u}bbecke},
title = {Rectangle Covers Revisited Computationally},
booktitle = {Experimental and Efficient Algorithms, 4th International Workshop, WEA},
year = {2005},
pages = {55--66},
editor = {S. E. Nikoletseas},
publisher = {Springer},
series = {LNCS},
volume = {3503},
}
@article{HeiLub2006,
author = {L. Heinrich-Litan and
M. E. L{\"u}bbecke},
title = {Rectangle covers revisited computationally},
journal = {ACM Journal of Experimental Algorithms},
volume = {11},
year = {2006}, pages = {1--21}
}
@article{HeiKasKot2012,
author = {J. Heinz and
A. Kasprzik and
T. K{\"o}tzing},
title = {Learning in the limit with lattice-structured hypothesis
spaces},
journal = tcs,
volume = {457},
year = {2012},
pages = {111--127},
}
@TECHREPORT{HelKir82,
AUTHOR = "P. Hell and D. G. Kirkpatrick",
TITLE = "Star factors and star packings",
INSTITUTION = "Computing Science, Simon Fraser University",
YEAR = 1982,
month = "",
number = "82-6",
address = "Burnaby, B.C. V5A1S6, Canada",
copy = ""
}
@ARTICLE{HelKir86,
AUTHOR = "P. Hell and D. G. Kirkpatrick",
TITLE = "Packings by complete bipartite graphs",
JOURNAL = {SIAM J. Alg. Disc. Math.},
YEAR = 1986,
month = "",
volume = 7,
number = "",
pages = "199--209",
copy = ""
}
@article{HemHemRot97,
author = {E. Hemaspaandra and L. A. Hemaspaandra and J. Rothe},
title = {Exact analysis of {D}odgson elections: {L}ewis {C}arroll's 1876 voting system is complete for parallel access to {NP}},
journal = jacm,
volume = {44},
number = {6},
year = {1997},
pages = {806--825},
}
@article{HemSpaVog2005,
Author = "E.~Hemaspaandra and H.~Spakowski and J.~Vogel",
Title = "The Complexity of {K}emeny Elections",
Journal = tcs,
volume={349},
number={3},
year={2005},
month=dec,
pages={382--391}
}
@INPROCEEDINGS{HemRed89,
AUTHOR = "V. G. Hemmady and S. M. Reddy",
TITLE = "On the repair of redundant {RAM}s",
BOOKTITLE = "Proc. 26th ACM/IEEE Design Automation Conf.",
YEAR = 1989,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "710--713",
address = "",
organization = "",
copy = ""
}
@INBOOK{Hem82,
AUTHOR = "A. Hemmerling",
TITLE = "Zur {R}aumkompliziertheit von {A}bsuchprozessen auf
endlichen {G}raphen",
PAGES = "77--90",
PUBLISHER = wpur,
YEAR = 1982,
volume = 19,
series = rmk,
copy = ""
}
@INPROCEEDINGS{HenMai91,
AUTHOR = "F. Henglein and H. G. Mairson",
TITLE = "The complexity of type inference for higher-order typed lambda calculi",
BOOKTITLE = "Proc. Symp. Principles of Programming Languages POPL'91",
YEAR = 1991,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "119--130",
address = "",
organization = "",
copy = ""
}
@TECHREPORT{Hen71a,
AUTHOR = "Henke, F. W. von",
TITLE = "Progammschemata und {F}amilien abstrakter {P}rogramme",
INSTITUTION = "GMD Bonn, Mitteilungen",
YEAR = 1971,
month = "",
number = "11",
address = "",
copy = ""
}
@TECHREPORT{Hen72,
AUTHOR = "Henke, F. W. von",
TITLE = "{\"U}ber eine deterministische {T}heorie formaler {S}prachen",
INSTITUTION = "GMD (Bonn), Mitteilungen",
YEAR = 1972,
month = "",
number = "45",
address = "",
copy = ""
}
@MASTERSTHESIS{Hen90,
AUTHOR = "J. C. Henke",
TITLE = "Visualisierung von {L}indenmayersystemen",
SCHOOL = "Universit{\"a}t {K}arlsruhe",
YEAR = 1990,
month = "",
address = "",
type = "Studienarbeit",
copy = ""
}
@ARTICLE{Hen65,
AUTHOR = "F. C. Hennie",
TITLE = "One-tape, off-line Turing machine computations",
JOURNAL = icalt,
YEAR = 1965,
VOLUME = 8,
NUMBER = "",
PAGES = "553--578",
copy = ""
}
@ARTICLE{Hen2003,
AUTHOR = "M.~A. Henning",
TITLE = "Defending the {R}oman {E}mpire from multiple attacks",
JOURNAL = dm,
YEAR = 2003,
month = "",
volume = 271,
number = "",
pages = "101--115",
copy = ""
}
@ARTICLE{Hen2004,
AUTHOR = "M.~A. Henning",
TITLE = "Restricted total domination in graphs",
JOURNAL = dm,
YEAR = 2004,
month = "",
volume = 289,
number = "",
pages = "25--44",
copy = ""
}
@article{HenHed2003,
author = {M.~A. Henning and S. T. Hedetniemi},
title = {Defending the {R}oman Empire: a new strategy},
journal = dm,
volume = {266},
number = {1-3},
year = {2003},
pages = {239--251},
}
@article{HenYeo2007,
author = {M.~A. Henning and
A. Yeo},
title = {A New Upper Bound on the Total Domination Number of a Graph},
journal = {Electr. J. Comb.},
volume = {14},
number = {1},
year = {2007},
}
@article{HenKaz2010,
author = {M.~A. Henning and A. P. Kazemi},
title = {$k$-tuple total domination in graphs},
journal = dam,
volume = {158},
year = {2010},
pages = {1006--1011},
}
@article{HenSchYeo2011,
author = {M.~A. Henning and
I. Schiermeyer and
A. Yeo},
title = {A New Bound on the Domination Number of Graphs with Minimum
Degree Two},
journal = {Electr. J. Comb.},
volume = {18},
number = {1},
year = {2011},
}
@article{HenKaz2012,
author = {M.~A. Henning and A. P. Kazemi},
title = {Total domination in inflated graphs},
journal = dam,
volume = {160},
number = {1-2},
year = {2012},
pages = {164--169},
}
@ARTICLE{HenWil96,
AUTHOR = "M.~R. Henzinger and D. Williamson",
TITLE = "On the Number of Small Cuts in a Graph",
JOURNAL = ipl,
YEAR = 1996,
month = "",
volume = 59,
number = "",
pages = "41--44",
copy = ""
}
@INPROCEEDINGS{HepPruSau91,
crossref = "PeiHenPen91",
AUTHOR = "D. Hepting and P. Prusinkiewicz and D. Saupe",
TITLE = "Rendering methods for iterated function systems",
chapter = "",
pages = "183--224",
copy = ""
}
@ARTICLE{Her69,
AUTHOR = "G. T. Herman",
TITLE = "Computing ability of a developmental model for
filamentous organisms",
JOURNAL = jtb,
YEAR = "1969",
VOLUME = "25",
NUMBER = "",
PAGES = "421--435",
MONTH = "",
note = ""
}
@ARTICLE{Her70,
AUTHOR = "G. T. Herman",
TITLE = "Role of environment in developmental models",
JOURNAL = jtb,
YEAR = "1970",
VOLUME = "29",
NUMBER = "",
PAGES = "329--341",
MONTH = "",
note = ""
}
@INBOOK{Her73,
AUTHOR = "G. T. Herman",
TITLE = "Polar organisms with apolar individual cells",
PAGES = "665--675",
PUBLISHER = "North-Holland ?",
YEAR = 1973,
EDITOR = "Suppes et al.",
VOLUME = 4,
SERIES = "Logic, {M}ethodology and {P}hilosophy of {S}cience",
copy = ""
}
@ARTICLE{Her74,
AUTHOR = "G. Herman",
TITLE = "Closure of developmental languages",
JOURNAL = icalt,
YEAR = 1974,
VOLUME = 24,
NUMBER = "",
PAGES = "--121",
copy = "ab Seite 106 kopiert"
}
@INBOOK{Her74a,
AUTHOR = "G. Herman",
booktitle = {L Systems}, editor = {G. Rozenberg and A. Salomaa},
TITLE = "Recurrence systems",
PAGES = "189--200",
CHAPTER = "Different ways of defining {L} languages",
PUBLISHER = "Berlin: Springer",
YEAR = 1974,
month = "",
address = "",
volume = 15,
series = "LNCS",
type = "",
copy = ""
}
@INCOLLECTION{Her76,
AUTHOR = "G. T. Herman",
TITLE = "Using formal language theory to model biological processes",
BOOKTITLE = "Applied computation theory: analysis, design, modeling",
PUBLISHER = "Prentice Hall",
YEAR = 1976,
EDITOR = "R.T. Yeh",
CHAPTER = "12",
PAGES = "530--564",
ADDRESS = "",
MONTH = "",
note = "",
copy = ""
}
@ARTICLE{HerSch75,
AUTHOR = "G. T. Herman and G. L. Schiff",
TITLE = "Simulation of multi-gradient models of organisms in
the context of {L}-systems",
JOURNAL = jtb,
YEAR = "1975",
VOLUME = "54",
NUMBER = "",
PAGES = "35--46",
MONTH = "",
note = ""
}
@INBOOK{HerWal72,
Chapter = "G. T. Herman, A. D. Walker: The syntactic inference problem applied to biological systems",
PAGES = "341--356",
PUBLISHER = "Edinburgh at the University Press",
YEAR = 1972,
EDITOR = "B. Meltzer and D. Michie",
VOLUME = 7,
title = "Machine {I}ntelligence",
copy = ""
}
@ARTICLE{HerWal75,
AUTHOR = "G. T. Herman and A. D. Walker",
TITLE = "Context free languages in biological systems",
JOURNAL = ijcm,
YEAR = 1975,
VOLUME = "4-A",
NUMBER = "",
PAGES = "369--391",
copy = ""
}
@inproceedings{Heretal2011,
author = {D. Hermelin and
M. Mnich and
E. J. van Leeuwen and
G. J. Woeginger},
title = {Domination When the Stars Are Out},
booktitle = {Automata, Languages and Programming -- 38th International
Colloquium, ICALP (1)},
year = {2011},
pages = {462--473},
editor = {L. Aceto and
M. Henzinger and
J. Sgall},
publisher = {Springer},
series = {LNCS},
volume = {6755},
}
@inproceedings{HerWu2012,
author = {D. Hermelin and
Xi Wu},
title = {Weak compositions and their applications to polynomial lower
bounds for kernelization},
booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium
on Discrete Algorithms, SODA},
year = {2012},
pages = {104--113},
editor = {Y. Rabani},
publisher = {SIAM},
}
@INPROCEEDINGS{Herm86,
crossref = "Sha86",
AUTHOR = "M. V. Hermenegildo",
TITLE = "An abstract machine for restricted {AND}-parallel
execution of logic programs",
chapter = "",
pages = "25--39",
copy = ""
}
@INPROCEEDINGS{HerNas86,
crossref = "Sha86",
AUTHOR = "M. V. Hermenegildo and R. I. Nasr",
TITLE = "Efficient management of backtracking in {AND}-parallelism",
chapter = "",
pages = "40--54",
copy = ""
}
@article{Heretal2005,
title = "On the metric dimension of some families of graphs",
journal = "Electronic Notes in Discrete Mathematics",
volume = "22",
number = "",
pages = "129--133",
year = "2005",
note = "7th International Colloquium on Graph Theory",
author = "M.~C. Hernando and M. Mora and I. M. Pelayo and C. Seara and J. C\'aceres and M. L. Puertas",
}
@MISC{Heretal2007,
author = {C. Hernando and M. Mora and I. M. Pelayo and C. Seara and D. R. Wood},
title = {Extremal Graph Theory for Metric Dimension and Diameter},
url = {http://www.citebase.org/abstract?id=oai:arXiv.org:0705.0938},
year = {2007}
}
@Article{Heretal2010,
author = {C. Hernando and M. Mora and I.~M. Pelayo and C. Seara and D.~R. Wood},
title = {Extremal graph theory for metric dimension and diameter},
journal = {The Electronic Journal of Combinatorics},
year = {2010},
volume = {17},
number = {R30},
}
@ARTICLE{HerManBes90,
AUTHOR = "H. J. Herrmann and G. Mantica and D. Bessis",
TITLE = "Space-filling bearings",
JOURNAL = prevl,
YEAR = 1990,
month = "",
volume = 65,
number = "26",
pages = "3223--3226",
copy = ""
}
@Article{Her72,
author = {W.~S. Herroelen},
title = {Resource-Constrained Project Scheduling -- The State of the Art},
journal = {Operational Research Quarterly},
year = {1972},
OPTkey = {},
volume = {23},
OPTnumber = {},
pages = {261--275},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@inproceedings{HeuVer2010,
author = {M. Heule and
S. Verwer},
title = {Exact {DFA} Identification Using {SAT} Solvers},
booktitle = {Grammatical Inference: Theoretical Results and Applications,
10th International Colloquium, ICGI},
year = {2010},
pages = {66--79},
editor = {J. M. Sempere and
P. Garc\'{\i}a},
publisher = {Springer},
series = {LNCS},
volume = {6339},
}
@ARTICLE{HeuLeeShe98,
AUTHOR = "J. van den Heuvel and R. Lesse and M. Shepherd",
TITLE = "Graph labelling and radio channel assignment",
JOURNAL = jgth,
YEAR = 1998,
month = "",
volume = 29,
number = "4",
pages = "263--283",
copy = ""
}
@Article{Hib74,
author = "T. N. Hibbard",
title = "Context-Limited Grammars",
journal = jacm,
volume = "21",
number = "3",
pages = "446--453",
month = jul,
year = "1974",
}
@Article{Hig52,
author = "G. Higman",
year = "1952",
title = "Ordering by divisibility in abstract algebras",
journal = plms3,
volume = "2",
number = "7",
pages = "326--336",
}
@ARTICLE{Hig97,
AUTHOR = "Higuera, C. de la",
TITLE = "Characteristic sets for polynomial grammatical inference",
JOURNAL = {Machine Learning},
YEAR = 1997,
month = "",
volume = 27,
number = "2",
pages = "125--138",
}
@INPROCEEDINGS{HigOncVid96,
AUTHOR = "C. De La Higuera and J. Oncina and E. Vidal",
TITLE = "Identification of DFA: data-dependant vs data-independant
algorithms",
BOOKTITLE = "Grammatical Inference: learning syntax from sentences ICGI'96",
YEAR = 1996,
month = "",
volume = "1147",
editor = "",
series = "LNCS/LNAI",
chapter = "",
pages = "313--326",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{Hig2000,
AUTHOR = "Higuera, {\mbox{C. de la}}",
TITLE = "Current trends in grammatical inference",
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 = "28--31", publisher = {Springer},
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{HigTho2000,
crossref = "ICGI2000",
AUTHOR = "Higuera, C. de la and F. Thollard",
TITLE = "Identification in the limit with probability one of stochastic deterministic finite automata",
chapter = "",
pages = "141--156",
}
@INPROCEEDINGS{HigJan2001,
AUTHOR = "Higuera, {C. de la} and J.-C. Janodet",
TITLE = "Inferring omega languages from prefixes",
BOOKTITLE = "Algorithmic Learning Theory ALT",
YEAR = 2001,
month = "",
volume = "2255",
editor = "N. Abe and R. Khardon and T. Zeugmann",
series = "LNCS/LNAI",
chapter = "",
pages = "364--378",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@PROCEEDINGS{Higetal2003,
TITLE = "ECML/PKDD 2003 Workshop and Tutorial
Learning Context-Free Grammars",
YEAR = 2003,
month = "",
volume = "",
editor = "C. de la Higuera and P. Adriaans and
M. van Zaanen and J. Oncina",
series = "",
chapter = "",
pages = "",
address = "",
publisher = "",
copy = ""
}
@article{Hig2005,
AUTHOR = "Higuera, C. de la",
TITLE = "A bibliographical study of grammatical inference",
JOURNAL = patrec,
VOLUME = "38",
YEAR = "2005",
NUMBER = "9", pages = "1332--1348",
}
@inproceedings{Hig2006,
author = {C. de la Higuera},
title = {Ten Open Problems in Grammatical Inference},
pages = {32--44},
editor = {Y. Sakakibara and
S. Kobayashi and
K. Sato and
T. Nishino and
E. Tomita},
title = {Grammatical Inference: Algorithms and Applications, 8th
International Colloquium, ICGI},
publisher = {Springer},
series = {LNCS},
volume = {4201},
year = {2006},
}
@ARTICLE{HilPed87,
AUTHOR = "P. Hilton and J. Pedersen",
TITLE = "Looking into {P}ascal's triangle:
Combinatorics, arithmetic, and geometry",
JOURNAL = mm,
YEAR = 1987,
VOLUME = 60,
NUMBER = 5,
PAGES = "305--316",
copy = ""
}
@INPROCEEDINGS{Hin01,
AUTHOR = "P. Hingston",
TITLE = "Inference of regular languages using model simplicity",
BOOKTITLE = "Proceedings of the 24th Australasian conference on Computer science",
YEAR = 2001,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "69--76",
address = "",
organization = "",
publisher = "IEEE Computer Society",
copy = "only electr."
}
@ARTICLE{HinDas89,
AUTHOR = "F. Hinz and J. Dassow",
TITLE = "An undecidability result for regular languages and
its application to regulated rewriting",
JOURNAL = eatcs,
YEAR = 1989,
volume = "38",
number = "",
pages = "168--173",
copy = ""
}
@ARTICLE{HirNas81,
AUTHOR = "S. Hirose and M. Nasu",
TITLE = "Left universal context-free grammars and homomorphic
characterizations of languages",
JOURNAL = icalt,
YEAR = 1981,
month = "",
volume = 50,
number = "",
pages = "110--118",
copy = ""
}
@ARTICLE{HirKikIzu00/01,
AUTHOR = "K. Hiroyasu and K. Kiko and T. Izumi",
TITLE = "Computational complexity of fractal sets",
JOURNAL = {Real Analysis Exchange},
YEAR = {2000/2001},
month = "",
volume = 26,
number = "2",
pages = "773--793",
copy = ""
}
@inproceedings{Hir2000,
author = {E. A. Hirsch},
title = {A New Algorithm for {MAX-2-SAT}},
year = {2000},
pages = {65--73}, editor = {H. Reichel and
S. Tison},
booktitle = {STACS 2000, 17th Annual Symposium on Theoretical Aspects
of Computer Science},
publisher = {Springer},
series = {LNCS},
volume = {1770},
}
@ARTICLE{Hir66,
AUTHOR = "K. E. Hirst",
TITLE = "Translation invariant measures which are not
{H}ausdorff measures",
JOURNAL = pcps,
YEAR = 1966,
month = "",
volume = 62,
number = "",
pages = "693--698",
copy = ""
}
@ARTICLE{HoJohn89,
AUTHOR = "Ching-Tien Ho and S. L. Johnsson",
TITLE = "Spanning balanced trees in boolean cubes",
JOURNAL = "SIAM J. Sci. Stat. Comput.",
YEAR = 1989,
VOLUME = 10,
NUMBER = 4,
PAGES = "607--630",
copy = ""
}
@ARTICLE{HoaSri2001,
AUTHOR = "C. T. Ho\'ang and R. Sritharan",
TITLE = "Finding houses and holes in graphs",
JOURNAL = tcs,
YEAR = 2001,
month = "",
volume = 259,
number = "",
pages = "233--244",
copy = ""
}
@ARTICLE{Hoc82,
AUTHOR = "D. S. Hochbaum",
TITLE = "Approximation algorithms for the set covering and
vertex cover problems",
JOURNAL = siam,
YEAR = 1982,
month = "",
volume = 11,
number = "3",
pages = "555-556",
copy = ""
}
@ARTICLE{Hoc83,
AUTHOR = "D.~S. Hochbaum",
TITLE = "Efficient bounds for the stable set, vertex cover and
set packing problems",
JOURNAL = dam,
YEAR = 1983,
month = "",
volume = 6,
number = "",
pages = "243--254",
copy = ""
}
@Book{Hoc96,
editor = {D.~S. Hochbaum},
title = {Approximation Algorithms for NP-Hard Problems},
publisher = {PWS Publishing Company, Boston, MA},
year = {1996},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{HocMaa85,
AUTHOR = "D.~S. Hochbaum and W. Maass",
TITLE = "Approximation schemes for covering and packing problems in image processing and {VLSI}",
JOURNAL = jacm,
YEAR = 1985,
month = "",
volume = 32,
number = "1",
pages = "130--136",
copy = ""
}
@article{HocShm85,
title = {A Best Possible Heuristic for the $k$-Center Problem},
author = {Hochbaum, D. S. and Shmoys, D. B.},
journal = {Mathematics of Operations Research},
volume = {10},
number = {2},
pages = {180--184},
year = {1985},
}
@ARTICLE{Hocetal93,
AUTHOR = "D.~S. Hochbaum and N. Meggido and J. Naor and A. Tamir",
TITLE = "Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality",
JOURNAL = {Mathematical Programming},
YEAR = 1993,
month = "",
volume = 62,
number = "",
pages = "69--83",
copy = ""
}
@ARTICLE{Hoc98,
AUTHOR = "D.~S. Hochbaum",
TITLE = "Approximating clique and biclique problems",
JOURNAL = jalg,
YEAR = 1998,
month = "",
volume = 29,
number = "",
pages = "174--200",
copy = ""
}
@INPROCEEDINGS{Hoc98a,
AUTHOR = "D.~S. Hochbaum",
TITLE = "The $t$-vertex cover problem: Extending the half integrality framework with budget constraints",
BOOKTITLE = "Approximation Algorithms for Combinatorial Optimization,
APPROX",
YEAR = 1998,
pages = {111--122},
month = "",
volume = "1444",
editor = "K. Jansen and D. S. Hochbaum",
series = "LNCS",
chapter = "",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@INPROCEEDINGS{Hoc98b,
AUTHOR = "D.~S. Hochbaum",
TITLE = "Instant Recognition of Half Integrality and 2-Approximations",
BOOKTITLE = "Approximation Algorithms for Combinatorial Optimization,
APPROX",
YEAR = 1998,
pages = {98--110},
month = "",
volume = "1444",
editor = "K. Jansen and D. S. Hochbaum",
series = "LNCS",
chapter = "",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@ARTICLE{HocPat98,
AUTHOR = "D.~S. Hochbaum and A. Pathria",
TITLE = "Analysis of the Greedy Approach in Covering Problems",
JOURNAL = {Naval Research Quarterly},
YEAR = 1998,
month = "",
volume = 45,
number = "",
pages = "615--627",
copy = ""
}
@article{HocLev2010,
title = "Covering the edges of bipartite graphs using graphs",
journal = tcs,
volume = "411",
number = "1",
pages = "1--9",
year = "2010",
note = "",
author = "D.~S. Hochbaum and A. Levin",
}
@Article{Hod83,
author = {B.~R. Hodgson},
title = {D\'ecidabilit\'e par automate fini},
journal = {Annales de science math\'ematiques du Qu\'ebec},
year = {1983},
volume = {7},
pages = {39--57},
}
@Article{HofNeb2001,
author = {J. Hoffmann and B. Nebel},
title = {The {FF} Planning System: Fast Plan Generation Through Heuristic Search},
journal = jair,
year = {2001},
volume = {14},
pages = {253-302}
}
@ARTICLE{HofRic84,
AUTHOR = "P. Hoffman and B. Richter",
TITLE = "Embedding graphs into surfaces",
JOURNAL = jcth,
YEAR = 1984,
VOLUME = "B 36",
NUMBER = "",
PAGES = "65--84",
copy = ""
}
@inproceedings{Hof2007,
author = {P. Hoffmann},
title = {Improving {RPNI} algorithm using minimal message length},
booktitle = {AIAP'07: Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference},
year = {2007},
pages = {378--383},
location = {Innsbruck, Austria},
publisher = {ACTA Press},
address = {Anaheim, CA, USA},
}
@inproceedings{HofTot02,
author = {M. Hoffmann and
C. D. T\'oth},
title = {Connecting points in the presence of obstacles in the plane},
booktitle = {Canadian Conference on Computational Geometry, CCCG},
year = {2002},
pages = {63--67},
}
@inproceedings{Hof2003,
author = {T. Hofmeister},
title = {An Approximation Algorithm for {MAX-2-SAT} with Cardinality
Constraint},
booktitle = {European Symposium on Algorithms ESA 2003},
year = {2003},
pages = {301--312},editor = {G. Di Battista and
U. Zwick},
publisher = {Springer},
series = {LNCS},
volume = {2832},
}
@Article{Hog89,
author = "J. A. Hogendorp",
title = "Controlled Bidirectional Grammars",
journal = ijcm,
pages = {159--180},
volume = "27",
year = "1989",
}
@Article{Hog90,
author = "J. A. Hogendorp",
title = "Time-Bounded Controlled Bidirectional Grammars",
journal = ijcm,
pages = {93--115},
volume = "35",
year = "1990",
}
@Article{HolKubPla95,
author = "T. Holan and V. Kubo\v{n} and M. Pl\'atek",
title = "Parsing of Free-Word-Order Languages",
booktitle = {SOFSEM'95: Theory and Practice of Informatics},
editor = {M. Barto\v{s}ek and J. Staudek and J. Wiederman},
series = {LNCS},
volume = "1012",
pages = "379--384",
year = "1995",
}
@INPROCEEDINGS{Hol02,
AUTHOR = "J. Holmerin",
TITLE = "Vertex cover on 4-regular hypergraphs is hard to aproximate with $2-\epsilon$",
BOOKTITLE = "17th Conference on Computational Complexity CCC",
YEAR = 2002,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "1--1",
address = "",
organization = "",
publisher = "",
copy = ""
}
@article{Hol81,
author = {I. Holyer},
title = {The {NP}-Completeness of Some Edge-Partition Problems},
journal = siam,
volume = {10},
number = {4},
year = {1981},
pages = {713--717},
}
@article{Holetal2006,
author = {K. Holzapfel and
S. Kosub and
M.~G. Maa{\ss} and
H. T{\"a}ubig},
title = {The complexity of detecting fixed-density clusters},
journal = dam,
volume = {154},
number = {11},
year = {2006},
pages = {1547--1562},
}
@inproceedings{Hol9900,
author = {M. Holzer},
title = {On fixed and general membership for external and internal
contextual languages},
booktitle = {Developments in Language Theory, DLT 1999},
pages = {351--361},
editor = {G. Rozenberg and
W. Thomas},
publisher = {World Scientific},
year = {2000},
}
@inproceedings{HolKon2002,
author = {M. Holzer and
B. K{\"o}nig},
title = {On Deterministic Finite Automata and Syntactic Monoid Size},
booktitle = {Developments in Language Theory DLT 2002},
year = {2002/03},
pages = {258--269},
editor = {M. Ito and
M. Toyama},
publisher = {Springer},
series = {LNCS},
volume = {2450},
}
@article{HolKut2009,
author = {M. Holzer and
M. Kutrib},
title = {Nondeterministic Finite Automata --- Recent Results on the
Descriptional and Computational Complexity},
journal = ijfcs,
volume = {20},
number = {4},
year = {2009},
pages = {563--580},
}
@InCollection{HolKut2010,
author = {M. Holzer and M. Kutrib},
title = {Descriptional Complexity --- An Introductory Survey},
booktitle = {Scientific Applications of Language Methods},
OPTcrossref = {},
OPTkey = {},
pages = {1--58},
publisher = {Imperial College Press},
year = {2010},
editor = {C. Mart\'in-Vide},
volume = {2},
OPTnumber = {},
series = {Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory},
}
@article{HolKut2011,
author = {M. Holzer and M. Kutrib},
title = {Descriptional and computational complexity of finite automata
- A survey},
journal = ic,
volume = {209},
number = {3},
year = {2011},
pages = {456--470},
}
@InCollection{HolKut2011a,
author = {M. Holzer and M. Kutrib},
title = {Descriptional Complexity --- An Introductory Survey},
booktitle = {Scientific Applications of Language Methods},
OPTcrossref = {},
OPTkey = {},
pages = {1--58},
publisher = {Imperial College Press},
year = {2011},
editor = {C. Mart\'in-Vide},
volume = {2},
OPTnumber = {},
series = {Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory},
}
@Article{HolJakKut2012,
author = {M. Holzer and S. Jakobi and M. Kutrib},
title = {The magic number problem for subregular
language families},
journal = ijfcs,
year = {2012},
volume = {23},
pages = {115--131},
}
@article{HolSch04,
author = {M. Holzer and
S. Schwoon},
title = {Assembling molecules in {ATOMIX} is hard},
journal = tcs,
volume = {303},
number = {3},
year = {2004},
pages = {447--462},
}
@InProceedings{Honetal2007,
author = {W.-K. Hon and C.-S. Liu and S.-L. Peng and C.~Y. Tang},
title = {Power Domination on Block-cactus Graphs},
booktitle = {The 24th Workshop on Combinatorial Mathematics and Computation Theory},
OPTcrossref = {},
OPTkey = {},
pages = {280--284},
OPTyear = {},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{Hon71,
AUTHOR = "H. Honda",
TITLE = "Description of the form of trees by the parameters of
the tree-like body: effects of the branching angle and the branch
length on the shape of the tree-like body",
JOURNAL = jtb,
YEAR = 1971,
volume = 31,
number = "",
pages = "331--338",
copy = ""
}
@INPROCEEDINGS{HonCla01,
AUTHOR = "T.~W. Hong and K.~L. Clark",
TITLE = "Using Grammatical Inference to Automate Information
Extraction from the {Web}",
BOOKTITLE = "European Conference on Machine Learning ECML",
YEAR = 2001,
month = "",
volume = "2168",
editor = "L. De Raedt and P. Flach",
series = "LNCS",
chapter = "",
pages = "216--227",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@ARTICLE{HonMehRos83,
AUTHOR = "J.-W. Hong and K. Mehlhorn and A. L. Rosenberg",
TITLE = "Cost trade-offs in graph embeddings, with applications",
JOURNAL = jacm,
YEAR = 1983,
VOLUME = 30,
NUMBER = 4,
PAGES = "709--728",
copy = ""
}
@inproceedings{HonNag2008,
author = {S.-H. Hong and
H. Nagamochi},
title = {Approximating Crossing Minimization in Radial Layouts},
booktitle = {LATIN 2008: Theoretical Informatics, 8th Latin American
Symposium},
year = {2008},
pages = {461--472},
editor = {E. S. Laber and
C. F. Bornstein and
L. T. Nogueira and
L. Faria},
title = {LATIN 2008: Theoretical Informatics, 8th Latin American
Symposium, B{\'u}zios, Brazil, April 7-11, 2008, Proceedings},
publisher = {Springer},
series = {LNCS},
volume = {4957},
year = {2008},
}
@article{HonNag2009,
author = {S.-H. Hong and
H. Nagamochi},
title = {New Approximation to the One-sided Radial Crossing Minimization},
journal = jgaa,
volume = {13},
number = {2},
year = {2009},
pages = {179--196},
}
@article{HonNag2010,
author = {S.-H. Hong and
H. Nagamochi},
title = {Approximation Algorithms for Minimizing Edge
Crossings in Radial Drawings},
journal = alg,
volume = {58},
number = {},
year = {2010},
pages = {478--497},
}
@INPROCEEDINGS{HonSal91,
crossref = "AlbMonArt91",
AUTHOR = "J. Honkala and A. Salomaa",
TITLE = "L morphisms: {B}ounded delay and regularity of ambiguity",
chapter = "Formal Languages",
pages = "566--574",
copy = ""
}
@ARTICLE{Hon95,
AUTHOR = "J. Honkala",
TITLE = "On Images of Algebraic Series",
JOURNAL = jucs,
YEAR = 1995,
month = "",
volume = 1,
number = "4",
pages = "217--223",
copy = ""
}
@ARTICLE{Hon95a,
AUTHOR = "J. Honkala",
TITLE = "A Decision Method for
the Unambiguity of Sets Defined by
Number Systems",
JOURNAL = jucs,
YEAR = 1995,
month = "",
volume = 1,
number = "9",
pages = "652--657",
copy = ""
}
@Article{Hon98,
author = "J. Honkala",
title = "On Slender Languages",
journal = eatcs,
volume = "64",
pages = "145--152",
month = feb,
year = "1998",
}
@INPROCEEDINGS{Hoo2001,
AUTHOR = "H. J. Hoogeboom",
TITLE = "Context-free valence grammars---revisited",
BOOKTITLE = "Preproceedings DLT'01",
YEAR = 2001,
month = "",
volume = "",
editor = "W. Kuich",
series = "",
chapter = "",
pages = "302--313",
address = "",
organization = "TU Wien, Institut f. Algebra und
Computermathematik",
publisher = "",
copy = ""
}
@INPROCEEDINGS{HooRoz86,
AUTHOR = "H. J. Hoogeboom and G. Rozenberg",
TITLE = "Infinitary languages: {B}asic theory and applications
to concurrent systems",
BOOKTITLE = "Springer: Current Trends in Concurrency:
Overviews and Tutorials",
YEAR = 1986,
month = "",
volume = "224",
editor = "",
series = "{LNCS}",
chapter = "",
PAGES = "266--342",
address = "",
organization = "",
copy = ""
}
@TECHREPORT{HooVug01,
AUTHOR = "H. J. Hoogeboom and N. van Vugt",
TITLE = "Upper Bounds for Restricted Splicing",
INSTITUTION = "Universiteit Leiden; Computer Science; Leiden Institute of Advanced Computer Science",
YEAR = 2001,
month = "",
number = "tr01--06",
address = "http://www.liacs.nl/TechRep/2001/",
copy = ""
}
@article{Hooetal2000,
author = {J. N. Hooker and G. Ottosson and
E. S. Thorsteinsson and H.-J. Kim},
title = {A Scheme for Unifying Optimization and Constraint
Satisfaction Methods},
journal = {Knowledge Engineering Review, special issue on {AI/OR}},
volume = {15},
number = {1},
pages = {11--30},
year = {2000},
url = {citeseer.ist.psu.edu/hooker00scheme.html}
}
@ARTICLE{Hoo91,
AUTHOR = "H. J. Hoover",
TITLE = "Real functions, contraction mappings, and {P}-completeness",
JOURNAL = ic,
YEAR = 1991,
month = "",
volume = 93,
number = "",
pages = "333--349",
copy = ""
}
@ARTICLE{HopKar73,
AUTHOR = "J. E. Hopcroft and R. M. Karp",
TITLE = "An {$n^{5/2}$}-algorithm for maximum matchings in
bipartite graphs",
JOURNAL = siam,
YEAR = 1973,
month = "",
volume = 2,
number = "4",
pages = "225--231",
copy = ""
}
@ARTICLE{HopUll67,
AUTHOR = "J. E. Hopcroft and J. D. Ullman",
TITLE = "An approach to a unified theory of automata",
JOURNAL = bstj,
YEAR = 1967,
VOLUME = 46,
NUMBER = "",
PAGES = "1793--1829",
copy = ""
}
@ARTICLE{HopUll68,
AUTHOR = "J. E. Hopcroft and J. D. Ullman",
TITLE = "Decidable and undecidable questions about automata",
JOURNAL = jacm,
YEAR = 1968,
VOLUME = 15,
NUMBER = 2,
PAGES = "317--324",
copy = ""
}
@INCOLLECTION{Hop75,
AUTHOR = "M. {H\"o}pfner",
TITLE = "Eine {C}harakterisierung der {S}zilardsprachen und
ihre {V}erwendung als {S}teuersprachen",
BOOKTITLE = "{GI} --- 4. {J}ahrestagung",
PUBLISHER = "Berlin: Springer",
YEAR = 1975,
EDITOR = "D. Siefkes",
CHAPTER = "",
PAGES = "113--121",
ADDRESS = "",
MONTH = "",
series = {LNCS}, volume = {26},
note = "",
copy = ""
}
@article{HorBraMil99,
title = "A combinatorial problem in database security",
journal = dam,
volume = "91",
number = "1–3",
pages = "119--126",
year = "1999",
author = "P. Horak and L. Brankovic and M. Miller"
}
@INPROCEEDINGS{Hor71,
AUTHOR = "J. J. Horning",
TITLE = "A procedure for grammatical inference",
BOOKTITLE = "Information Processing 71, Proc. IFIP Congress, Vol. 1",
YEAR = 1971,
month = "",
volume = "",
editor = "C. V. Freiman",
series = "",
chapter = "",
pages = "519--523",
address = "",
organization = "", publisher ={North-Holland, 1972},
copy = ""
}
@ARTICLE{HorKil93,
AUTHOR = "J. D. Horton and K. Kilakos",
TITLE = "Minimum edge dominating sets",
JOURNAL = siamdm,
YEAR = 1993,
month = "",
volume = 6,
number = "",
pages = "375--387",
copy = ""
}
@PHDTHESIS{Hor97,
AUTHOR = "S. B. Horton",
TITLE = "The optimal linear arrangement problem: algorithms and approximation",
SCHOOL = "School of Industrial and System Engineering, Georgia Institute of Technology",
YEAR = 1997,
month = "",
address = "Atlanta, GA, USA",
type = "PhD Thesis",
copy = ""
}
@ARTICLE{HorEasPar2003,
AUTHOR = "S. B. Horton and T. Easton and R. G. Parker",
TITLE = "The linear arrangement problem on recursively constructed graphs",
JOURNAL = netw,
YEAR = 2003,
month = "",
volume = 42,
number = "3",
pages = "165--168",
copy = ""
}
@ARTICLE{HorParBor2000,
AUTHOR = "S. B. Horton and R. G. Parker and R. B. Borie",
TITLE = "On Minimum Cuts and the Linear Arrangement Problem",
JOURNAL = dam,
YEAR = 2000,
month = "",
volume = 103,
number = "",
pages = "127--139",
copy = ""
}
@ARTICLE{Hor78,
AUTHOR = "S. Horv\'ath",
TITLE = "The family of languages satisfying {B}ar-{H}illel's lemma",
JOURNAL = rairo,
YEAR = 1978,
month = "",
volume = 12,
number = "3",
pages = "193--199",
copy = ""
}
@INPROCEEDINGS{HotPit95,
AUTHOR = "G. Hotz and G. Pitsch",
TITLE = "A new approach to analyse coupled-context-free languages",
BOOKTITLE = "Mathematical Foundations of Computer Science
1995, 20th International Symposium, MFCS'95",
YEAR = 1995,
month = "",
volume = "969",
editor = "",
series = "LNCS",
chapter = "",
pages = "349--358",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{Hot88,
crossref = "KasRam88",
AUTHOR = "E. Hotzel",
TITLE = "Connection structures --- a component of parallel
programming languages",
chapter = "",
pages = "47--63",
copy = ""
}
@INPROCEEDINGS{Hro84,
AUTHOR = "J. Hromkovi\v c",
TITLE = "Communication complexity",
BOOKTITLE = "11th ICALP'84",
YEAR = 1984,
month = "",
volume = "172",
editor = "J. Paredaens",
series = "LNCS",
chapter = "",
pages = "235--246",
address = "",
organization = "",
copy = ""
}
@ARTICLE{HroKup88,
AUTHOR = "J. Hromkovi\v{c} and E. Kupkov\'a",
TITLE = "Graph controlled table {L}indenmayer systems",
JOURNAL = eikneu,
YEAR = 1988,
month = "",
volume = 24,
number = "",
pages = "481--493",
copy = ""
}
@Article{HroInoTak89,
author ="J. Hromkovi\v{c} and K. Inoue and I. Takanami",
title ="Lower Bounds for Language Recognition on Two-Dimensional
Alternating Multihead Machines",
volume ="38",
pages ="431--451",
journal =jcss,
year ="1989",
}
@ARTICLE{Hsi2007,
AUTHOR = "S.-Y. Hsieh",
TITLE = "Finding maximal leaf-agreement isomorphic subtrees from phylogenetic trees with different species",
JOURNAL = tcs,
YEAR = 2007,
month = "",
volume = 370,
number = "",
pages = "299--308",
copy = ""
}
@article{Hsu95,
author = {W.-L. Hsu},
title = {{$O(M\cdot N)$} Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs},
year = {1995},
journal = siam,
volume = {24},
number = {3},
pages = {411--439},
}
@article{HsuWanWan2009,
author = {C.-J. Hsu and
F.-H. Wang and
Y.-L. Wang},
title = {Global defensive alliances in star graphs},
journal = dam,
volume = {157},
number = {8},
year = {2009},
pages = {1924--1931},
}
@Article{Hua89,
author ="S.-T. Huang",
title ="Termination Detection by Using Distributed Snapshots",
journal = ipl,
volume ="32",
year ="1989",pages={113--119}
}
@ARTICLE{HuaJal92,
AUTHOR = "Y. Huang and P. Jalote",
TITLE = "Effect of fault tolerance on response time ---
analysis of the primary site approach",
JOURNAL = ieeetoc,
YEAR = 1992,
month = "",
volume = 41,
number = "4",
pages = "420--428",
copy = ""
}
@Article{Hubetal2008,
author = {K.Huber and M. Lott and V. Moulton and A. Spillner},
title = {The complexity of deriving multi-labeled trees from bipartitions},
journal = {Journal of Computational Biology},
year = {2008},
OPTkey = {},
volume = {15},
number = {6},
pages = {639--651},
}
@Article{Hud2004,
title = {A note on ``Banks winners in tournaments are difficult to recognize'' by {G. J. Woeginger}},
author = {O. Hudry},
journal = {Social Choice and Welfare},
year = {2004},
OPTkey = {},
volume = {23},
OPTnumber = {},
pages = {113--114},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@Article{Hud2008,
title = {{NP}-hardness results for the aggregation of linear orders into median orders},
author = {O. Hudry},
journal = {Annals of Operations Research},
year = {2008},
OPTkey = {},
volume = {163},
OPTnumber = {},
pages = {63--88},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@INPROCEEDINGS{Huf2005,
AUTHOR = "F. H{\"u}ffner",
TITLE = "Algorithm Engineering for optimal graph bipartization",
BOOKTITLE = "Workshop on Algorithm Engineering WEA",
year = {2005},
pages = {240--252},
editor = {S. E. Nikoletseas},
publisher = {Springer},
series = {LNCS},
volume = {3503},
}
@PhdThesis{Huf2007,
author = {F. H{\"u}ffner},
title = {Algorithms and Experiments for
Parameterized Approaches to
Hard Graph Problems},
school = {Fakult\"at f\"ur Mathematik und Informatik
der Friedrich-Schiller-Universit\"at Jena, Germany},
year = {2007},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@INPROCEEDINGS{HufEdeFerNie01,
AUTHOR = "F. H{\"u}ffner and S. Edelkamp and H. Fernau and R. Niedermeier",
TITLE = "Finding optimal solutions to Atomix",
BOOKTITLE = "KI 2001: Advances in Artificial Intelligence",
YEAR = 2001,
month = "",
volume = "2174",
editor = "F. Baader and G. Brewka and T. Eiter",
series = "LNCS/LNAI",
chapter = "",
pages = "229--243",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@inproceedings{HufBetNie2007,
author = {F. H{\"u}ffner and
N. Betzler and
R. Niedermeier},
title = {Optimal Edge Deletions for Signed Graph Balancing},
booktitle = {Experimental Algorithms, 6th International Workshop, WEA},
year = {2007},
pages = {297--310},
editor = {C. Demetrescu},
publisher = {Springer},
series = {LNCS},
volume = {4525},
}
@inproceedings{Hufetal2008,
author = {F. H{\"u}ffner and
C. Komusiewicz and
H. Moser and
R. Niedermeier},
title = {Fixed-Parameter Algorithms for Cluster Vertex Deletion},
booktitle = {LATIN 2008: Theoretical Informatics, 8th Latin American
Symposium},
year = {2008},
pages = {711--722},
editor = {E. S. Laber and
C. F. Bornstein and
L. Tito Nogueira and
L. Faria},
title = {LATIN 2008: Theoretical Informatics, 8th Latin American
Symposium, B{\'u}zios, Brazil, April 7-11, 2008, Proceedings},
publisher = {Springer},
series = {LNCS},
volume = {4957},
}
@article{HufWerZic2008,
author = {F. H{\"u}ffner and
S. Wernicke and
T. Zichner},
title = {Algorithm Engineering for Color-Coding with Applications
to Signaling Pathway Detection},
journal = algo,
volume = {52},
number = {2},
year = {2008},
pages = {114--132},
}
@article{Hufetal2010,
author = {F. H{\"u}ffner and
C. Komusiewicz and
H. Moser and
R. Niedermeier},
title = {Fixed-Parameter Algorithms for Cluster Vertex Deletion},
journal = tocs,
volume = {47},
number = {1},
year = {2010},
pages = {196--217},
}
@ARTICLE{Hug80,
AUTHOR = "C. E. Hughes",
TITLE = "Derivatives and quotients of prefix-free context-free languages",
JOURNAL = icalt,
YEAR = 1980,
month = "",
volume = 45,
number = "",
pages = "229--235",
copy = ""
}
@ARTICLE{HugSel81,
AUTHOR = "C. E. Hughes and S. E. Selkow",
TITLE = "The finite power property for context-free languages",
JOURNAL = tcs,
YEAR = 1981,
month = "",
volume = 15,
number = "",
pages = "111--114",
copy = ""
}
@ARTICLE{Hul87,
AUTHOR = "M. E. C. Hull",
TITLE = "OCCAM - a programming language for multiprocessor systems",
JOURNAL = complang,
YEAR = 1987,
VOLUME = 12,
NUMBER = 1,
PAGES = "27--37",
copy = ""
}
@inproceedings{HunNieSte2003,
author = {H. Hungar and
O. Niese and
B. Steffen},
title = {Domain-Specific Optimization in Automata Learning},
booktitle = {Computer Aided Verification CAV},
year = {2003},
pages = {315--327},
editor = {W. A. Hunt Jr. and
F. Somenzi},
publisher = {Springer},
series = {LNCS},
volume = {2725},
}
@ARTICLE{HunSzyUll75,
AUTHOR = "H.~B. Hunt, {III} and T. G. Szymanski and J. D. Ullman",
TITLE = "On the complexity of {LR$(k)$} testing",
JOURNAL = cacm,
YEAR = 1975,
month = "",
volume = 18,
number = "12",
pages = "707--716",
copy = ""
}
@ARTICLE{HunRos78,
AUTHOR = "H.~B. Hunt, {III} and D. J. Rosenkrantz",
TITLE = "Computational parallels between the regular and
context-free languages",
JOURNAL = siam,
YEAR = 1978,
month = "",
volume = 7,
number = "1",
pages = "99--114",
copy = ""
}
@article{Hun79,
AUTHOR = "H.~B. Hunt, {III}",
title = "Observations on the complexity of regular expression problems",
journal = jcss,
volume = "19",
number = "3",
pages = "222--236",
year = "1979",
}
@ARTICLE{Hun82,
AUTHOR = "H.~B. Hunt, {III}",
TITLE = "On the decidability of grammar problems",
JOURNAL = jacm,
YEAR = 1982,
month = "",
volume = 29,
number = "2",
pages = "429--447",
copy = ""
}
@INPROCEEDINGS{Hunetal94,
AUTHOR = "H.~B. Hunt, {III} and M.~V. Marathe and V. Radhakrishnan and S.~S. Ravi and D.~J. Rosenkrantz and R.~E. Stearns",
TITLE = "A unified approach to approximation schemes for {NP}-and {PSPACE}-hard problems for geometric graphs",
BOOKTITLE = "Algorithms---ESA'94",
YEAR = 1994,
month = "",
volume = "855",
editor = "J. van Leeuwen",
series = "LNCS",
chapter = "",
pages = "424--435",
address = "",
organization = "",
publisher = "",
copy = ""
}
@INPROCEEDINGS{HunSul87,
AUTHOR = "F. Hunt and F. Sullivan",
TITLE = "Methods of Computing Fractal Dimensions",
BOOKTITLE = "Nonlinear Semigroups, Partial Differential
Equations and Attractors",
YEAR = 1987,
month = "",
volume = "1394",
editor = "T.L. Gill and W.W. Zachary",
series = "LNM",
chapter = "",
pages = "83--95",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{HurLil99,
AUTHOR = "S. Hur and J. Lilis",
TITLE = "Relaxation and clustering in a local search framework: application to linear placement",
BOOKTITLE = "36th Design Automation Conference DAC `99",
YEAR = 1999,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "360--366",
address = "",
organization = "SIGDA",
publisher = "",
copy = ""
}
@ARTICLE{Hur87,
AUTHOR = "L. P. Hurd",
TITLE = "Formal Language Characterizations of Cellular Automata Limit Sets",
JOURNAL = complex,
YEAR = "1987",
month = "",
volume = 1,
number = "",
pages = "69--80",
copy = ""
}
@ARTICLE{Hur90,
AUTHOR = "L. P. Hurd",
TITLE = "Recursive Cellular Automata Invariant Sets",
JOURNAL = complex,
YEAR = "1990",
month = "",
volume = 4,
number = "",
pages = "119--129",
copy = ""
}
@ARTICLE{Hur90a,
AUTHOR = "L. P. Hurd",
TITLE = "Nonrecursive Cellular Automata Invariant Sets",
JOURNAL = complex,
YEAR = "1990",
month = "",
volume = 4,
number = "",
pages = "131--138",
copy = ""
}
@ARTICLE{HurMar84,
AUTHOR = "M. Hurley and C. Martin",
TITLE = "Newton's algorithm and chaotic dynamical systems",
JOURNAL = siamjma,
YEAR = 1984,
month = "",
volume = 15,
number = "2",
pages = "238--252",
copy = ""
}
@article{HurSch89,
author = {C. A. J. Hurkens and A. Schrijver},
title = {On the Size of Systems of Sets Every $t$ of which Have an {SDR}, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems},
publisher = {SIAM},
year = {1989},
journal = siamdm,
volume = {2},
number = {1},
pages = {68--72},
}
@article{Husetal2009,
author = {D. H. Huson and
R. Rupp and
V. Berry and
P. Gambette and
C. Paul},
title = {Computing galled networks from real data},
journal = {Bioinformatics},
volume = {25},
number = {12},
year = {2009},
}
@ARTICLE{Hut81,
AUTHOR = "J. Hutchinson",
TITLE = "Fractals and self-similarity",
JOURNAL = iumj,
YEAR = 1981,
month = "",
volume = 30,
number = "",
pages = "713--747",
copy = ""
}
@ARTICLE{Huy85,
AUTHOR = "D. T. Huynh",
TITLE = "The complexity of semilinear sets",
JOURNAL = eikalt,
YEAR = 1985,
month = "",
volume = 18,
number = "",
pages = "291--338",
copy = ""
}
@ARTICLE{Huy91,
AUTHOR = "D. T. Huynh",
TITLE = "The effective entropies of some extensions of
context-free languages",
JOURNAL = ipl,
YEAR = 1991,
month = feb,
volume = 37,
number = "",
pages = "165--169",
copy = ""
}
@INPROCEEDINGS{HwaLee92,
AUTHOR = "R. Z. Hwang and R. C. T. Lee",
TITLE = "The application of the searching over separators strategy to solve
some {NP}-complete problems on planar graphs",
BOOKTITLE = "Algorithms and Computation, 3rd ISAAC",
YEAR = 1992,
month = "",
volume = "650",
editor = "T. Ibaraki and others",
series = "LNCS",
chapter = "",
pages = "51--60",
address = "",
organization = "",
copy = ""
}
@ARTICLE{HwaChaLee93,
AUTHOR = "R. Z. Hwang and R. C. Chang and R. C. T. Lee",
TITLE = "The searching over separators strategy to solve some {NP}-hard problems in subexponential time",
JOURNAL = alg,
YEAR = 1993,
month = "",
volume = 9,
number = "",
pages = "398--423",
copy = ""
}
@ARTICLE{HwaCha95,
AUTHOR = "S. F. Hwang and G. J. Chang",
TITLE = "The edge domination problem",
JOURNAL = {Discuss. Math. Graph Theory},
YEAR = 1995,
month = "",
volume = 15,
number = "",
pages = "51--57",
copy = ""
}
@ARTICLE{HyaRiv76,
AUTHOR = "R. Hyafil and R. L. Rivest",
TITLE = "Constructing optimal binary trees is {NP}-complete",
JOURNAL = ipl,
YEAR = 1976,
month = "",
volume = 5,
number = "",
pages = "15--17",
copy = ""
}
IIII
@article{Iba72,
author = {T. Ibaraki},
title = {Representation Theorems for Equivalent Optimization Problems},
journal = {Information and Control},
volume = {21},
number = {5},
year = {1972},
pages = {397--435},
}
@article{Iba76,
author = {T. Ibaraki},
title = {Theoretical Comparison of Search Strategies in Branch-and-Bound Algorithms},
journal = ijcis,
volume = {5},
number = {4},
year = {1976},
pages = {315--344},
}
@article{Iba76a,
title = "Finite automata having cost functions",
journal = icalt,
volume = "31",
number = "2",
pages = "153--176",
year = "1976",
author = "T. Ibaraki"
}
@article{Iba77,
author = {T. Ibaraki},
title = {The Power of Dominance Relations in Branch-and-Bound Algorithms},
journal = jacm,
volume = {24},
number = {2},
year = {1977},
pages = {264--279},
}
@Article{Iba77a,
author = {T. Ibaraki},
title = {On the computational efficiency of branch-and-bound algorithms},
journal = {Journal of the Operations Research Society of Japan},
year = {1977},
OPTkey = {},
volume = {26},
OPTnumber = {},
pages = {16--35},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{Iba78a,
AUTHOR = "T. Ibaraki",
TITLE = "Branch-and-bound procedure and state-space representation of combinatorial optimization problems",
JOURNAL = icalt,
YEAR = 1978,
month = "",
volume = 36,
number = "",
pages = "1--27",
copy = ""
}
@ARTICLE{Iba78b,
AUTHOR = "T. Ibaraki",
TITLE = "Finite automata having cost functions: Nondeterministic models",
JOURNAL = icalt,
YEAR = 1978,
month = "",
volume = 37,
number = "",
pages = "40--69",
copy = ""
}
@ARTICLE{Iba70,
AUTHOR = "O. Ibarra",
TITLE = "Simple matrix languages",
JOURNAL = icalt,
YEAR = 1970,
month = "",
volume = 17,
number = "",
pages = "359--394",
copy = ""
}
@ARTICLE{IbaJia91,
AUTHOR = "O. H. Ibarra and T. Jiang",
TITLE = "Learning regular languages from counterexamples",
JOURNAL = jcss,
YEAR = 1991,
month = "",
volume = 43,
number = "",
pages = "299--316",
copy = ""
}
@ARTICLE{Iba74,
AUTHOR = "O. H. Ibarra",
TITLE = "A note on semilinear sets and bounded-reversal
pushdown automata",
JOURNAL = ipl,
YEAR = 1974,
month = "",
volume = 3,
number = "1",
pages = "25--28",
copy = ""
}
@ARTICLE{IbaMel74,
AUTHOR = "O. Ibarra and R. T. Melson",
TITLE = "Some results concerning automata on two-dimensional tapes",
JOURNAL = ijcm,
YEAR = 1974,
month = "",
volume = {4A},
number = "",
pages = "269--279",
copy = ""
}
@ARTICLE{IbaSahKim76,
AUTHOR = "O. H. Ibarra and S. K. Sahni and C. E. Kim",
TITLE = "Finite automata with multiplication",
JOURNAL = tcs,
YEAR = 1976,
month = "",
volume = 2,
number = "",
pages = "271--296",
copy = ""
}
@ARTICLE{Iba78,
AUTHOR = "O. H. Ibarra",
TITLE = "On two-way sequential transductions of full semi-{AFL}'s",
JOURNAL = tcs,
YEAR = 1978,
month = "",
volume = 7,
number = "",
pages = "287--309",
copy = ""
}
@ARTICLE{Iba82,
AUTHOR = "O. H. Ibarra",
TITLE = "2dst mappings on languages and related problems",
JOURNAL = tcs,
YEAR = 1982,
month = "",
volume = 19,
number = "",
pages = "219--227",
copy = ""
}
@ARTICLE{IbaRav88,
AUTHOR = "O. H. Ibarra and B. Ravikumar",
TITLE = "Sublogarithmic-space {T}uring machines, nonuniform
space complexity, and closure properties",
JOURNAL = mst,
YEAR = 1988,
month = "",
volume = 21,
number = "",
pages = "1--17",
copy = ""
}
@ARTICLE{Ibaetal91,
AUTHOR = "O. Ibarra and others",
TITLE = "Some classes of languages in {NC$^1$}",
JOURNAL = icneu,
YEAR = 1991,
month = "",
volume = 90,
number = "",
pages = "86--106",
copy = ""
}
@ARTICLE{IbaTraYan97,
AUTHOR = "O. H. Ibarra and N. Q. Tran and T. Yang",
TITLE = "On the parallel complexity of loops",
JOURNAL = tcs,
YEAR = 1997,
month = "",
volume = 179,
number = "",
pages = "381--395",
copy = ""
}
@inproceedings{Iba2004,
author = {O. H. Ibarra},
title = {The Number of Membranes Matters},
pages = {218--231},
booktitle = {Workshop on Membrane Computing, WMC 2003},
editor = {C. Mart\'{\i}n-Vide and
G. Mauri and
Gh. Paun and
G. Rozenberg and
A. Salomaa},
publisher = {Springer},
series = {LNCS},
volume = {2933},
year = {2004},
}
@INPROCEEDINGS{Idt84,
AUTHOR = "J. Idt",
TITLE = "Automates \`a pile sur des alphabets infinis",
BOOKTITLE = "{LNCS}: 166; {STACS}",
YEAR = 1984,
pages = "260--273",
organization = "",
copy = ""
}
@ARTICLE{IduSch95,
AUTHOR = "R. M. Idury and A. A. Sch{\"a}ffer",
TITLE = "Multiple Matching of Rectangular Patterns",
JOURNAL = icneu,
YEAR = 1995,
month = "",
volume = 117,
number = "",
pages = "78--90",
copy = ""
}
@Article{IduSch96,
title = "Multiple matching of parameterized patterns",
author = "R. M. Idury and A. A. Sch{\"a}ffer",
pages = "203--224",
journal = tcs,
month = "5~" # feb,
year = "1996",
volume = "154",
number = "2",
}
@Article{Ieretal2010,
author = {Iersel, L.~van and S. Kelk and R. Rupp and D. Huson},
title = {Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters},
journal = {Bioinformatics},
year = {2010},
OPTkey = {},
volume = {26},
OPTnumber = {},
pages = {124--131},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@Article{IerSemSte2010,
author = {L. van Iersel and C. Semple and M. Steel},
title = {Locating a tree in a phylogenetic network},
journal = ipl,
year = {2010},
OPTkey = {},
volume = {110},
OPTnumber = {},
pages = {1037--1043},
OPTannote = {}
}
@inproceedings{Ineetal2004,
author = {S. Inenaga and
A. Shinohara and
M. Takeda},
title = {A Fully Compressed Pattern Matching Algorithm for Simple
Collage Systems},
booktitle = {Proceedings of the Prague Stringology Conference},
year = {2004},
pages = {98--113},
editor = {M. Sim{\'a}nek and
J. Holub},
publisher = {Department of Computer Science and Engineering, Faculty
of Electrical Engineering, Czech Technical University},
year = {2004},
}
@ARTICLE{IhlReiWid99,
AUTHOR = "E. Ihler and G. Reich and P. Widmayer",
TITLE = "Class {S}teiner trees and {VLSI}-design",
JOURNAL = dam,
YEAR = 1999,
month = "",
volume = 90,
number = "",
pages = "173--194",
copy = ""
}
@INPROCEEDINGS{Ili94,
crossref = "Pau94a",
AUTHOR = "L. Ilie",
TITLE = "On contextual grammars with parallel derivation",
chapter = "",
pages = "165--172",
copy = ""
}
@Article{Ili94a,
author = "L. Ilie",
title = "On a conjecture about slender context-free languages",
journal = tcs,
volume = "132",
number = "1-2",
pages = "427--434",
day = "26",
year = "1994",
}
@TECHREPORT{Ili96,
AUTHOR = "L. Ilie",
TITLE = "The computational complexity of {M}arcus contextual languages",
INSTITUTION = "TUCS - Turku Centre for Computer Science",
YEAR = 1906,
month = sep,
number = "TUCS-TR-46",
address = "",
copy = ""
}
@article{Ili97,
author = {L. Ilie},
title = {On the Computational Complexity of {M}arcus Contextual Languages},
journal = fundinform,
volume = {30},
number = {2},
year = {1997},
pages = {161--167},
}
@INPROCEEDINGS{IliMohSmy2004,
AUTHOR = "C. S. Iliopoulos and M. Mohamed and W. F. Smyth",
TITLE = "New complexity results for the k-covers problem",
BOOKTITLE = "Proc. 15th Australasian Workshop on Combinatorial Algorithms AWOCA",
YEAR = 2004,
month = "",
volume = "",
editor = "Seok-Hee Hong",
series = "",
chapter = "",
pages = "141--147",
address = "",
organization = "",
publisher = "",
copy = ""
}
@INPROCEEDINGS{ImaMor97,
AUTHOR = "K. Imai and K. Morita",
TITLE = "Generation and parsing of connected patterns by uniquely
parsable array grammars",
BOOKTITLE = "IWPIA'97 (The Fifth
International Workshop on Parallel Image Analysis --- Theory and
Applications ---)",
YEAR = 1997,
month = sep,
volume = "",
editor = "",
series = "",
chapter = "",
pages = "315--325",
address = "Hiroshima",
organization = "",
copy = "",
note = {Proceedings will be distributed at the Workshop, and the papers will be also considered for inclusion in a journal
special issue "International Journal of Pattern Recognition and Artificial Intelligence", see http://kelp.ke.sys.hiroshima-u.ac.jp/iwpia/}
}
@inproceedings{ImaIwa2005,
author = {T. Imamura and
K. Iwama},
title = {Approximating vertex cover on dense graphs},
booktitle = {Proceedings of the Sixteenth Annual ACM-SIAM Symposium on
Discrete Algorithms, SODA},
year = {2005},
pages = {582--589},
publisher = {SIAM},
}
@ARTICLE{Imm86,
AUTHOR = "N. Immerman",
TITLE = "Relational queries computable in polynomial time",
JOURNAL = icalt,
YEAR = 1986,
month = "",
volume = 68,
number = "",
pages = "86--104",
copy = ""
}
@ARTICLE{Imm88,
AUTHOR = "N. Immerman",
TITLE = "Nondeterministic space is closed under complementation",
JOURNAL = siam,
YEAR = 1988,
month = "",
volume = 17,
number = "5",
pages = "935--938",
copy = ""
}
@article{ImpPatZan2001,
author = {R. Impagliazzo and
R. Paturi and
F. Zane},
title = {Which Problems Have Strongly Exponential Complexity?},
journal = jcss,
volume = {63},
number = {4},
year = {2001},
pages = {512--530},
}
@INPROCEEDINGS{Inoetal2005,
AUTHOR = "H. Ino and M. Kudo and A. Nakamura",
TITLE = "Partitioning of web graphs by community topology",
BOOKTITLE = "International World Wide Web Conference WWW",
YEAR = 2005,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "661--669",
address = "",
organization = "ACM",
publisher = "",
copy = ""
}
@ARTICLE{Inoetal78,
AUTHOR = "K. Inoue and others",
TITLE = "A note on two-dimensional finite automata",
JOURNAL = ipl,
YEAR = 1978,
month = "",
volume = 7,
number = "",
pages = "49--52",
copy = ""
}
@Article{Inoetal79,
title ="One-Way Simple Multihead Finite Automata",
author ="K. Inoue and I. Takanami and A. Nakamura and T. Ae",
pages ="311--328",
journal =tcs,
year ="1979",
month =oct,
volume ="9",
number ="3",
}
@ARTICLE{InoTak80,
AUTHOR = "K. Inoue and I. Takanami",
TITLE = "A note on decision problems for three-way
two-dimensional finite automata",
JOURNAL = ipl,
YEAR = 1980,
month = "",
volume = 10,
number = "",
pages = "245--248",
copy = ""
}
@Article{Inoteal86,
author ="K. Inoue and I. Takanami and R. Vollmar",
title ="Three-Way Two-Dimensional Finite Automata with Rotated
Inputs",
year ="1986",
journal =infsci,
volume ="38",
pages ="271--282",
}
@INPROCEEDINGS{InoTak88,
AUTHOR = "K. Inoue and I. Takanami",
TITLE = "A survey of two-dimensional
automata theory",
BOOKTITLE = "Machines, Languages, and Complexity IMYCS'88",
YEAR = 1988,
month = "",
volume = "381",
editor = "J. Dassow and J. Kelemen",
series = "LNCS",
chapter = "",
pages = "72--91",
address = "",
organization = "",
copy = ""
}
@Article{Inoetal92,
author ="K. Inoue and A. Ito and I. Takanami",
title ="A relationship between nondeterministic {Turing} machines
and 1-inkdot {Turing} machines with small space",
journal = ipl,
volume ="43",
number ="4",
pages ="225--227",
day ="28",
month =sep,
year ="1992"
}
@INPROCEEDINGS{InoTak92,
AUTHOR = "K. Inoue and I. Takanami",
TITLE = "A Characterization of Recognizable Picture Languages",
BOOKTITLE = "Parallel Image Analysis",
YEAR = 1992,
month = "",
volume = "654",
editor = "A. Nakamura and others",
series = "LNCS",
chapter = "",
pages = "133--143",
address = "",
organization = "",
copy = ""
}
@Article{Inoetal93,
author ="K. Inoue and A. Ito and I. Takanami and
T. Yoshinaga",
title ="A note on multi-inkdot nondeterministic {Turing}
machines with small space",
journal =ipl,
volume ="48",
number ="6",
pages ="285--288",
day ="20",
month =dec,
year ="1993",
}
@Article{Inoetal94,
title ="On 1-inkdot alternating {Turing} machines with small space",
author ="K. Inoue and A. Ito and I. Takanami",
journal =tcs,
pages ="171--179",
month ="9~" # may,
year ="1994",
volume ="127",
number ="1",
}
@Article{InoYamFuj93,
author = {M. Inoue and T. Yamada and A. Fujiwara},
title = {A new testing acceleration chip for low-cost memory tests},
journal = {IEEE Design and Test of Computers},
year = {1993},
OPTkey = {},
volume = {10},
OPTnumber = {},
pages = {15--19},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{Ipa2012,
author = {F. Ipate},
title = {Learning finite cover automata from queries},
journal = jcss,
volume = {78},
number = {1},
year = {2012},
pages = {221--244},
}
@ARTICLE{Irv91,
AUTHOR = "R. W. Irving",
TITLE = "On approximating the minimum independent dominating set",
JOURNAL = ipl,
YEAR = 1991,
month = "",
volume = 37,
number = "",
pages = "197--200",
copy = ""
}
@ARTICLE{Ish89,
AUTHOR = "H. Ishizaka",
TITLE = "Inductive inference of regular languages based on
model inference",
JOURNAL = ijcm,
YEAR = 1989,
month = "",
volume = 27,
number = "",
pages = "67--83",
copy = ""
}
@InProceedings{IshAriShi94,
author = "H. Ishizaka and H. Arimura and T. Shinohara",
title = "Finding Tree Patterns Consistent with Positive and
Negative Examples Using Queries",
pages = "317--332",
editor = "S. Arikawa and K.~P. Jantke",
booktitle = "Proceedings of the 4th International Workshop on
Analogical and Inductive Inference and 5th
International Workshop on Algorithmic Learning Theory",
month = oct,
series = "LNCS/LNAI",
volume = "872",
publisher = "Springer Verlag",
year = "1994",
}
@inproceedings{IslBra2004,
author = {M.~Z. Islam and
L. Brankovic},
title = {A Framework for Privacy Preserving Classification in Data
Mining},
booktitle = {ACSW Frontiers},
year = {2004},
pages = {163--168},
editor = {J. M. Hogan and
P. Montague and
M. K. Purvis and
C. Steketee},
publisher = {Australian Computer Society ACS},
series = {CRPIT},
volume = {32},
year = {2004},
}
@PhdThesis{Isl2007,
author = {T.~M. Islam},
title = {Characterizing Hardness in Parameterized
Complexity},
school = {University of Waterloo, Canada},
year = {2007},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{Ist77,
AUTHOR = "S. Istrail",
TITLE = "On certain symmetric operators defined over finitely generated free semigroups (in Romanian)",
JOURNAL = studcm,
YEAR = 1977,
month = "",
volume = 29,
number = "",
pages = "385--392",
copy = ""
}
@ARTICLE{Ist79,
AUTHOR = "S. Istrail",
TITLE = "On the complexity of program divergence",
JOURNAL = "Foundations of Control Engineering",
YEAR = 1979,
month = "",
volume = 4,
number = "1",
pages = "19--26",
copy = ""
}
@ARTICLE{Ist82,
AUTHOR = "S. Istrail",
TITLE = "Some remarks on non-algebraic adherences",
JOURNAL = tcs,
YEAR = 1982,
month = "",
volume = 21,
number = "",
pages = "341--349",
copy = ""
}
@ARTICLE{ItoNis82,
AUTHOR = "T. Ito and Y. Nishitani",
TITLE = "On universality of concurrent expressions with synchronization primitives",
JOURNAL = tcs,
YEAR = 1982,
month = "",
volume = 19,
number = "",
pages = "105--115",
copy = ""
}
@INPROCEEDINGS{ItoInoTak88,
AUTHOR = "A. Ito and K. Inoue and I. Takanami",
TITLE = "The simulation of two-dimensional one marker
automata by three-way {T}uring machines",
BOOKTITLE = "Machines, Languages, and Complexity IMYCS'88",
YEAR = 1988,
month = "",
volume = "381",
editor = "J. Dassow and J. Kelemen",
series = "LNCS",
chapter = "",
pages = "92--101",
address = "",
organization = "",
copy = ""
}
@Article{Itoetal89,
author ="A. Ito and K. Inoue and I. Takanami",
title ="Deterministic Two-Dimensional on-Line Tessellation Acceptors
Are Equivalent to Two-Way Two-Dimensional Alternating Finite
Automata Through 180 Degree Rotation",
volume ="66",
pages ="273--287",
journal =tcs,
year ="1989",
}
@ARTICLE{ItoKat91,
AUTHOR = "M. Ito and M. Katsura",
TITLE = "Context-free languages consisting of non-primitive words",
JOURNAL = ijcm,
YEAR = 1991,
month = "",
volume = 40,
number = "",
pages = "157--167",
copy = ""
}
@ARTICLE{Itoetal83,
AUTHOR = "M. It\^o and N. \^Osato and M. Nasu",
TITLE = "Linear cellular automata over {$\ganz_m$}",
JOURNAL = jcss,
YEAR = 1983,
month = "",
volume = 27,
number = "",
pages = "125--140",
copy = ""
}
@article{Itoetal2011,
author = {T. Ito and
E.~D. Demaine and
N. J. A. Harvey and
C. H. Papadimitriou and
M. Sideri and
R. Uehara and
Y. Uno},
title = {On the complexity of reconfiguration problems},
journal = tcs,
volume = {412},
number = {12--14},
year = {2011},
pages = {1054--1065},
}
@ARTICLE{Ito81,
AUTHOR = "S. Y. Itoga",
TITLE = "A new heuristic for inferring regular grammars",
JOURNAL = ieeetopami,
YEAR = 1981,
month = "",
volume = 3,
number = "",
pages = "191--197",
copy = ""
}
@inproceedings{IwaNak2007,
author = {K. Iwama and
T. Nakashima},
title = {An Improved Exact Algorithm for Cubic Graph {TSP}},
booktitle = {Computing and Combinatorics, 13th Annual International Conference, COCOON},
year = {2007},
pages = {108--117},
editor = {G. Lin},
publisher = {Springer},
series = {LNCS},
volume = {4598},
}
@ARTICLE{IwaKas84,
AUTHOR = "S. Iwata and T. Kasai",
TITLE = "Problem requiring $k\log n$ deterministic space",
JOURNAL = {Congressus numerantium (Utilitas mathematica)},
YEAR = 1984,
month = "",
volume = 44,
number = "",
pages = "161--174",
copy = ""
}
@ARTICLE{IwaKas94,
AUTHOR = "S. Iwata and T. Kasai",
TITLE = "The {O}thello game on an $n\times n$ board is {PSPACE}-complete",
JOURNAL = tcs,
YEAR = 1994,
month = "",
volume = 123,
number = "",
pages = "329--340",
copy = ""
}
JJJ
@ARTICLE{JacMau92,
AUTHOR = "S. Jackson and R. D. Mauldin",
TITLE = "Some complexity results in topology and analysis",
JOURNAL = fundmath,
YEAR = 1992,
month = "",
volume = 141,
number = "",
pages = "75--??",
NOTE = "Copy incomplete",
copy = ""
}
@ARTICLE{JacMau93,
AUTHOR = "S. Jackson and R. D. Mauldin",
TITLE = "Borel measurable selections of paretian utility functions",
JOURNAL = jme,
YEAR = 1993,
month = "",
volume = "??",
number = "",
pages = "??--??",
NOTE = "Preprint obtained from the authors",
copy = ""
}
@ARTICLE{Jac90,
AUTHOR = "A. Jacquin",
TITLE = "Fractal image coding based on a theory of iterated
contractive image transformations",
JOURNAL = spie,
YEAR = 1990,
month = "",
volume = 1360,
number = "",
pages = "227--239",
note = "Proceedings of Visual Communications and Image processing, fifth in series, 1-4 Oct,
1990, Lausanne, Switzerland",
copy = ""
}
@INPROCEEDINGS{Jac94,
AUTHOR = "C. Jacob",
TITLE = "Genetic {L}-System Programming",
BOOKTITLE = "PPSN III - Parallel Problem Solving from Nature, International Conference on Evolutionary Computation",
YEAR = 1994,
month = "",
volume = "866",
editor = "",
series = "LNCS",
chapter = "",
pages = "334--343",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@INPROCEEDINGS{JacReh93,
AUTHOR = "C. Jacob and J. Rehder",
TITLE = "Evolution of Neural Net Architectures by a Hierarchical Grammar-Based Genetic System",
BOOKTITLE = "ICANNGA'93, Proc. International Conference on Artificial Neural Networks and Genetic Algorithms",
YEAR = 1993,
month = "",
volume = "",
editor = "R. Albrecht and N. Steele",
series = "",
chapter = "",
pages = "72--79",
address = "",
organization = "",
publisher = "",
copy = ""
}
@Article{JacPet93,
author = {M.~S. Jacobson and K. Peters},
title = {A note on graphs which have upper irredundance equal to independence},
journal = dam,
year = {1993},
OPTkey = {},
volume = {44},
OPTnumber = {},
pages = {91--97},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{Jaf78,
AUTHOR = "J. Jaffe",
TITLE = "A necessary and sufficient pumping lemma for regular languages",
JOURNAL = sigact,
YEAR = 1978,
VOLUME = "",
NUMBER = "summer",
PAGES = "48--49",
copy = ""
}
@ARTICLE{Jag97,
AUTHOR = "H. V. Jagadish",
TITLE = "Analysis of the {H}ilbert curve for representing
two-dimensional space",
JOURNAL = ipl,
YEAR = 1997,
month = "",
volume = 62,
number = "",
pages = "17--22",
copy = ""
}
@article{JagSri2005,
author = {G. J{\"a}ger and
A. Srivastav},
title = {Improved Approximation Algorithms for Maximum Graph Partitioning
Problems},
journal = joco,
volume = {10},
number = {2},
year = {2005},
pages = {133--167},
}
@INPROCEEDINGS{JaiSha90,
crossref = "Pat90",
AUTHOR = "S. Jain and A. Sharma",
TITLE = "Language learning by a ``team''",
chapter = "",
pages = "153--166",
copy = ""
}
@ARTICLE{JaiKin2006,
AUTHOR = "S. Jain and E. Kinber",
TITLE = "Learning languages from positive data and a finite number of queries",
JOURNAL = ic,
YEAR = 2006,
month = "",
volume = 204,
number = "",
pages = "123--175",
copy = ""
}
@inproceedings{JaiKin2006a,
AUTHOR = "S. Jain and E. Kinber",
title = {Iterative Learning from Positive Data and Negative Counterexamples},
booktitle = {Algorithmic Learning Theory, ALT},
year = {2006},
pages = {154--168},
editor = {J. L. Balc{\'a}zar and
P. M. Long and
F. Stephan},
publisher = {Springer},
series = {LNCS},
volume = {4264},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@article{JaiLanZil2007,
author = {S. Jain and
S. Lange and
S. Zilles},
title = {A general comparison of language learning from examples
and from queries},
journal = tcs,
volume = {387},
number = {1},
year = {2007},
pages = {51--66},
}
@Article{JaiKin2007,
author = {S. Jain and E. Kinber},
title = {Learning multiple languages in groups},
journal = tcs,
year = {2007},
volume = {387},
pages = {67--76},
}
@Article{JaiOngSte2010,
author = {S. Jain aand Y. S. Ong and F. Stephan},
title = {Regular patterns, regular languages and context-free languages},
journal = ipl,
year = {2010},
OPTkey = {},
volume = {110},
OPTnumber = {},
pages = {1114--1119},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{JaiKin2011,
author = {S. Jain and
E. B. Kinber},
title = {Iterative learning from texts and counterexamples using
additional information},
journal = {Machine Learning},
volume = {84},
number = {3},
year = {2011},
pages = {291--333},
}
@inproceedings{JaiKin2012,
author = {S. Jain and
E. B. Kinber},
title = {Mind Change Speed-up for Learning Languages from Positive
Data},
booktitle = {29th International Symposium on Theoretical Aspects of Computer
Science, STACS},
year = {2012},
pages = {350--361},
editor = {C. D{\"u}rr and
T. Wilke},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
series = {LIPIcs},
volume = {14},
}
@ARTICLE{Jaietal2002,
AUTHOR = "D. Jaitly and P. Kearney and G. Lin and B. Ma",
TITLE = "Methods for reconstructing the history of tandem repeats and their application to the human genome",
JOURNAL = jcss,
YEAR = 2002,
month = "",
volume = 65,
number = "",
pages = "494--507",
copy = ""
}
@ARTICLE{Jam83,
AUTHOR = "L. D. James",
TITLE = "Imbeddings of the complete graph",
JOURNAL = arscomb,
YEAR = 1983,
VOLUME = "16-B",
NUMBER = "",
PAGES = "57--72",
copy = ""
}
@Article{JamHedMcC2009,
author = {Jamieson, L. H. and Hedetniemi, S. T. and
McRae, A. A.},
title = {The algorithmic complexity of alliances in graphs},
journal = {J. Combin. Math. Combin. Comput.},
year = {2009},
OPTkey = {},
volume = {68},
number = {137--150},
}
@incollection{Jam89,
AUTHOR = {B. Jamison and S. Olariu},
TITLE = {A Linear-Time Recognition Algorithm for P4-Reducible Graphs},
YEAR = 1989,
BOOKTITLE = {Foundations of Software Technology and Theoretical Computer Science: Proc.\ of the Ninth Conference FSTTCS},
EDITOR = {C. E. Veni Madhavan},
PUBLISHER = {Springer},
PAGES = {1-19},
KEYWORDS = {}}
@Inproceedings{JanMraPla92,
author = "P. Jan\v{c}ar and F. Mr\'az and M. Pl\'atek",
title = "Characterization of Context-Free Languages by Erasing
Automata",
booktitle = {MFCS'92: Mathematical Foundations of Computer Science},
editor = {I.M. Havel and V. Koubek},
series = {LNCS},
volume = "629",
pages = "307--314",
year = "1992",
}
@Inproceedings{JanMraPla93,
author = "P. Jan\v{c}ar and F. Mr\'az and M. Pl\'atek",
title = "A taxonomy of forgetting automata",
booktitle = {MFCS'93: Mathematical Foundations of Computer Science},
editor = {S. Sokolowski},
series = {LNCS},
volume = "711",
pages = "527--536",
year = "1993",
}
@Inproceedings{Janetal95,
author = "P. Jan\v{c}ar and others",
title = "Restarting Automata",
booktitle = {Fundamentals of Computation Theory},
editor = {H. Reichel},
series = {LNCS},
volume = "965",
pages = "283--292",
year = "1995",
}
@Inproceedings{Janetal95a,
author = "P. Jan\v{c}ar and others",
title = "Restarting Automata,{M}arcus grammars and context-free languages",
booktitle = {Developments in Language Theory II},
editor = {J. Dassow and others},
series = {},
volume = "", publisher = {World Scientific},
pages = "102--111",
year = "1995",
}
@INCOLLECTION{Janetal97,
AUTHOR = "P. Jan\v{c}ar and others",
TITLE = "On restarting automata with rewriting",
BOOKTITLE = "New Trends in Formal Languages",
PUBLISHER = "Springer",
YEAR = 1997,
month = "",
volume = "1218",
editor = "",
series = "LNCS",
chapter = "",
pages = "119--136",
address = "",
type = "",
copy = ""
}
@Article{JanMraPla96,
author = "P. Jan\v{c}ar and F. Mr{\'a}z and M. Pl{\'a}tek",
title = "Forgetting Automata and Context-Free Languages",
journal = actainform,
pages = "409--420",
year = "1996",
volume = "33",
number = "5",
}
@Incollection{Janetal98,
author = "P. Jan\v{c}ar and others",
title = "Different Types of Monotonicity for Restarting
Automata",
editor = {V. Arvind and R. Ramanujan},
Booktitle = "Foundations of Software Technology and Theoretical Computer Science",
volume = "1530",
pages = "343--354",
year = "1998",
series = {LNCS}
}
@inproceedings{JanMel97,
AUTHOR = "J. Janou\v{s}ek and B. Melichar",
TITLE = "The output-store formal translator directed by {LR} parsing",
BOOKTITLE = {SOFSEM'97},
YEAR = 1997,
month = "",
volume = {1338}, series = {LNCS},
number = "",
pages = {432--439},
copy = ""
}
@INPROCEEDINGS{Jan97,
AUTHOR = "K. Jansen",
TITLE = "Approximation results for the optimum cost chromatic partition problem",
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 = "727--737",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{JanZha2004,
AUTHOR = "K. Jansen and G. Zhang",
TITLE = "Maximizing the Number of Packed Rectangles",
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 = "362--371",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@INPROCEEDINGS{JanZha2004a,
AUTHOR = "K. Jansen and G. Zhang",
TITLE = "On rectangle packing: maximizing benefits",
BOOKTITLE = "Symposium on Discrete Algorithms SODA",
YEAR = 2004,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "197--206",
address = "",
organization = "ACM",
publisher = "",
copy = ""
}
@article{JanZha2007,
AUTHOR = "K. Jansen and G. Zhang",
title = {Maximizing the Total Profit of Rectangles Packed into a
Rectangle},
journal = alg,
volume = {47},
number = {3},
year = {2007},
pages = {323--342},
}
@inproceedings{JanSol2008,
author = {K. Jansen and
R. Solis-Oba},
title = {A Polynomial Time Approximation Scheme for the Square Packing
Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 13th
International Conference, IPCO},
year = {2008},
pages = {184--198},
editor = {A. Lodi and
A. Panconesi and
G. Rinaldi},
publisher = {Springer},
series = {LNCS},
volume = {5035},
}
@article{Jan2009,
author = {K. Jansen},
title = {Parameterized Approximation Scheme for the Multiple Knapsack
Problem},
journal = siam,
volume = {39},
number = {4},
year = {2009},
pages = {1392--1412},
}
@inproceedings{JanPraSch2009,
author = {K. Jansen and
L. Pr{\"a}del and
U. M. Schwarz},
title = {Two for One: Tight Approximation of 2D Bin Packing},
booktitle = {Algorithms and Data Structures, 11th International Symposium, WADS},
year = {2009},
pages = {399--410},
editor = {F. K. H. A. Dehne and
M. L. Gavrilova and
J.-R. Sack and
C. D. T{\'o}th},
publisher = {Springer},
series = {LNCS},
volume = {5664},
}
@inproceedings{Jan2012,
author = {K. Jansen},
title = {A Fast Approximation Scheme for the Multiple Knapsack Problem},
booktitle = {SOFSEM: Theory and Practice of Computer Science},
year = {2012},
pages = {313--324},
editor = {M. Bielikov{\'a} and
G. Friedrich and
G. Gottlob and
S. Katzenbeisser and
Gy. Tur{\'a}n},
publisher = {Springer},
series = {LNCS},
volume = {7147},
}
@article{JanZha2012,
author = {K. Jansen and
Hu Zhang},
title = {Scheduling malleable tasks with precedence constraints},
journal = jcss,
volume = {78},
number = {1},
year = {2012},
pages = {245--259},
}
@ARTICLE{Jan79,
AUTHOR = "M. Jantzen",
TITLE = "A note on vector grammars",
JOURNAL = ipl,
YEAR = 1979,
month = "",
volume = 8,
number = "",
pages = "32--33",
copy = ""
}
@ARTICLE{JanKud84,
AUTHOR = "M. Jantzen and M. Kudlek",
TITLE = "Homomorphic images of sentential form languages defined by semi-{T}hue systems",
JOURNAL = tcs,
YEAR = 1984,
month = "",
volume = 33,
number = "",
pages = "13--43",
copy = ""
}
@INPROCEEDINGS{Jar76,
AUTHOR = "J. F. Jarvis",
TITLE = "Feature recognition in line drawings using regular expressions",
BOOKTITLE = "Proc. 3rd Intl. Joint Conf. on Pattern Recognition",
YEAR = 1976,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "189--192",
address = "",
organization = "",
copy = ""
}
@article{JarNie2008,
author = {M. J{\"a}rvisalo and
I. Niemel{\"a}},
title = {The effect of structural branching on the efficiency of
clause learning {SAT} solving: An experimental study},
journal = jalg,
volume = {63},
year = {2008},
pages = {90--113},
}
@ARTICLE{JarKra75,
AUTHOR = "S. Jarzabek and T. Krawczyk",
TITLE = "{LL}-regular grammars",
JOURNAL = ipl,
YEAR = 1975,
month = "",
volume = 4,
number = "",
pages = "31--37",
copy = ""
}
@ARTICLE{Jen95,
AUTHOR = "B. Jenner",
TITLE = "Knapsack problems for {NL}",
JOURNAL = ipl,
YEAR = 1995,
month = "",
volume = 54,
number = "",
pages = "169--174",
copy = ""
}
@TECHREPORT{JenLanMcK97,
AUTHOR = "B. Jenner and K.-J. Lange and P. McKenzie",
TITLE = "Tree isomorphism and some other complete problems for
deterministic logspace",
INSTITUTION = "Universit\'e de Montr\'eal",
YEAR = 1997,
month = "",
number = "1059",
address = "",
copy = ""
}
@INPROCEEDINGS{JeoHsu01,
AUTHOR = "E. Jeong and C.-H. Hsu",
TITLE = "Induction of integrated view for {XML} data with heterogenous {DTD}s",
BOOKTITLE = "Proceedings of the 10th International Conference on Information and
Knowledge Management CIKM",
YEAR = 2001,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "151--158",
address = "",
organization = "ACM",
publisher = "",
copy = ""
}
@Article{Jeoetal2009,
author = {W. Jeong and
I. Kang and K. Jin and S. Kang},
title = {A Fast Built-in Redundancy Analysis for Memories With Optimal Repair Rate Using a Line-Based Search Tree},
journal = {IEEE Transactions on Very Large Scale Integration (VLSI) Systems},
year = {2009}, volume = {17},
number = {12},
pages = {1665--1678},
}
@Article{Jer74,
author = {R.~G. Jeroslaw},
title = {Trivial integer programs unsolvable by branch-and-bound},
journal = {Mathematical Programming},
year = {1974},
OPTkey = {},
volume = {6},
OPTnumber = {},
pages = {105--109},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{JerWan90,
author = {R.~G. Jeroslow and
J. Wang},
title = {Solving Propositional Satisfiability Problems},
journal = amai,
volume = {1},
year = {1990},
pages = {167--187},
}
@ARTICLE{Jey83,
AUTHOR = "S. Jeyaratnam",
TITLE = "A new algorithm for finding the shortest path between
a specified pair of nodes in a graph of nonnegative arcs",
JOURNAL = ejor,
YEAR = 1983,
VOLUME = 12,
NUMBER = "",
PAGES = "375--378",
copy = ""
}
@ARTICLE{JiaZhaChe2004,
AUTHOR = "W. Jia and C. Zhang and J. Chen",
TITLE = "An efficient parameterized algorithm for $m$-set packing",
JOURNAL = jalg,
YEAR = 2004,
month = "",
volume = 50,
number = "",
pages = "106--117",
copy = ""
}
@ARTICLE{Jia86,
AUTHOR = "T. Jian",
TITLE = "An {$O(2^{0.304n})$}-algorithm for solving maximum independent set problem",
JOURNAL = ieeetoc,
YEAR = 1986,
month = "",
volume = {C-35},
number = "9",
pages = "847--851",
copy = ""
}
@INPROCEEDINGS{Jiaetalt93,
AUTHOR = "T. Jiang and others",
TITLE = "Inclusion is undecidable for pattern languages",
BOOKTITLE = "ICALP'93",
YEAR = 1993,
month = "",
volume = "700",
editor = "A. Lingas, R. Karlsson and S. Carlsson",
series = "{LNCS}",
chapter = "",
pages = "301--312",
address = "",
organization = "",
copy = ""
}
@ARTICLE{Jiaetal94,
AUTHOR = "T. Jiang and others",
TITLE = "Pattern languages with and without erasing",
JOURNAL = ijcm,
YEAR = 1994,
month = "",
volume = 50,
number = "",
pages = "147--163",
copy = ""
}
@ARTICLE{Jiaetal2003,
AUTHOR = "M. Jiang and J. Qian and Z. Qin and B. Zhu and R. Cimikowski",
TITLE = "A simple factor-3 approximation for labeling points with circles",
JOURNAL = ipl,
YEAR = 2003,
month = "",
volume = 87,
number = "",
pages = "101--105",
copy = ""
}
@inproceedings{Jia2010,
author = {M. Jiang},
title = {Recognizing $d$-Interval Graphs and $d$-Track
Interval Graphs},
booktitle = {Frontiers in Algorithmics FAW},
year = {2010},
pages = {160--171},
editor = {D.-T. Lee and
D. Z. Chen and
S. Ying},
publisher = {Springer},
series = {LNCS},
volume = {6213},
}
@article{JiaRav93,
author = {T. Jiang and
B. Ravikumar},
title = {Minimal {NFA} Problems are Hard},
journal = siam,
volume = {22},
number = {6},
year = {1993},
pages = {1117--1141},
}
@InProceedings{JiaWenHu2012,
author = {Y. Jiang and Z. Weng and J. Hu},
title = {Algorithms with Limited Number
of Preemptions for Scheduling
on Parallel Machines},
booktitle = {Sixth International Frontiers of Algorithmics Workshop FAW and Eighth International Conference on Algorithmic Aspects of Information and Management AAIM},
pages = {93--104},
year = {2012},
editor = {J. Snoeyink and P. Lu and K. Su and L. Wang},
volume = {7285},
series = {LNCS},
publisher = {Springer},
}
@ARTICLE{JiaLi96,
AUTHOR = "T. Jiang and M. Li",
TITLE = "$k$ one-way heads cannot do string-matching",
JOURNAL = jcss,
YEAR = 1996,
month = "",
volume = 53,
number = "",
pages = "513--524",
copy = ""
}
@ARTICLE{Jiaetal99,
AUTHOR = "T. Jiang and D. Mubayi and A. Shastri and D.~B. West",
TITLE = "Edge-bandwidth of graphs",
JOURNAL = siamdm,
YEAR = 1999,
month = "",
volume = 12,
number = "",
pages = "307--316",
copy = ""
}
@InProceedings{JigSchTha2002,
author = {W. Jigang and H. Schr{\"o}der and S. Thambipillai},
title = {New architecture and algorithms for degradable {VLSI/WSI} arrays},
booktitle = {COCOON 2002},
OPTcrossref = {},
OPTkey = {},
pages = {181--190},
year = {2002},
editor = {O.~H. Ibarra and L. Zhang},
volume = {2387},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}
@Article{JigSri2003,
author = {W. Jigang and T. Srikanthan},
title = {An improved reconfiguration algorithm for degradable {VLSI/WSI} arrays},
journal = {Journal of Systems Architecture},
year = {2003},
OPTkey = {},
volume = {49},
OPTnumber = {},
pages = {23--31},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@INPROCEEDINGS{JimMar2000,
AUTHOR = "V. M. Jim{\'e}nez and A. Marzal",
TITLE = "Computation of the $N$ best parse trees for weighted and stochastic context-free grammars",
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 = "183--192",
address = "",
organization = "",
copy = ""
}
@article {Jir2011,
author = {Jir\'askov\'a, G.},
title = {Concatenation of Regular Languages and Descriptional Complexity},
journal = tocs,
pages = {306--318},
volume = {49},
issue = {2},
year = {2011}
}
@INBOOK{JohMei74,
AUTHOR = "P. Johansen and E. Meiling",
TITLE = "Free groups in {L}indenmayer systems",
booktitle = {L Systems}, editor = {G. Rozenberg and A. Salomaa},
CHAPTER = "New attacks on {D0L} equivalence problem",
PAGES = "162--176",
PUBLISHER = "Berlin: Springer",
YEAR = 1974,
VOLUME = 15,
SERIES = "LNCS",
copy = ""
}
@INBOOK{Joh76,
AUTHOR = "P. Johansen",
TITLE = "Commutator calculus and {L} systems",
PAGES = "203--210",
BOOKTITLE = "Automata, Languages, Development",
PUBLISHER = "North-Holland",
YEAR = 1976,
month = "",
address = "",
volume = "",
series = "",
type = "",
copy = ""
}
@PhdThesis{Joh67,
author = {Johnson, T.~J.~R.},
title = {An algorithm for the resource-constrained project scheduling
problem},
school = {Massachusets Institute of Technology, USA},
year = {1962},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
url = {http://dspace.mit.edu/handle/1721.1/10584},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
}
@inproceedings{Joh73,
author = {D.~S. Johnson},
title = {Approximation Algorithms for Combinatorial Problems},
booktitle = {Proceedings of the 5th Annual ACM Symposium on Theory of
Computing, STOC},
year = {1973},
pages = {38--49},
editor = {A. V. Aho and
A. Borodin and
R. L. Constable and
R. W. Floyd and
M. A. Harrison and
R. M. Karp and
H. Raymond Strong},
publisher = {ACM},
}
@Article{Joh93,
author = {M.~A. Johnson},
title = {Structure-activity maps for visualizing the graph variables arising in drug
design},
journal = {Journal of Biopharmaceutical Statistics},
year = {1993},
volume = {3},
pages = {203--236},
}
@ARTICLE{Johetal01,
AUTHOR = "T. Johnson and N. Robertson and P.D. Seymour and R. Thomas",
TITLE = "Directed tree-width",
JOURNAL = jcthb,
YEAR = 2001,
month = "",
volume = 82,
number = "",
pages = "138--154",
copy = ""
}
@Article{Joh2004,
author = {L.~F. Johnson},
title = {Tumble, a fast simple iteration algorithm for {F}ibonacci},
journal = ipl,
year = {2004},
OPTkey = {},
volume = {89},
OPTnumber = {},
pages = {187--189},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{Joh2005,
author = {D.~S. Johnson},
title = {The {NP}-completeness column},
journal = acmtalg,
volume = {1},
number = {1},
year = {2005},
pages = {160--176},
}
@article{Joh2006,
author = {D.~S. Johnson},
title = {The {NP}-completeness column: The many limits on approximation},
journal = acmtalg,
volume = {2},
year = {2006},
pages = {473--489},
}
@article{Joh2007,
author = {D.~S. Johnson},
title = {The {NP}-completeness column: Finding needles in haystacks},
journal = acmtalg,
volume = {3},
number = {2},
year = {2007},
}
@ARTICLE{JohPapYan88,
AUTHOR = "D. C. Johnson and C. Papadimitriou and M. Yannakakis",
TITLE = "How easy is local search?",
JOURNAL = jcss,
YEAR = 1988,
month = "",
volume = 37,
number = "",
pages = "79--100",
copy = ""
}
@ARTICLE{Joh87,
AUTHOR = "S. L. Johnsson",
TITLE = "Communication efficient basic linear algebra computations
on hypercube architectures",
JOURNAL = jpdc,
YEAR = 1987,
VOLUME = 4,
NUMBER = "",
PAGES = "133--172",
copy = ""
}
@Article{Joh89,
author = "J.~H. Johnson",
title = "A unified framework for disambiguating finite
transductions",
journal = tcs,
volume = "63",
number = "1",
pages = "91--111",
month = jan,
year = "1989",
}
@Article{Johetal2001,
author = {T. Johnson and N. Robertson and P.~D. Seymour and R. Thomas},
title = {Directed Tree-Width},
journal = jcthb,
year = {2001},
OPTkey = {},
volume = {82},
OPTnumber = {},
pages = {138--155},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{Jon70,
AUTHOR = "N. D. Jones",
TITLE = "A note on the index of a context-free language",
JOURNAL = icalt,
YEAR = 1970,
month = "",
volume = 16,
number = "",
pages = "201--202",
copy = ""
}
@ARTICLE{Jon77,
AUTHOR = "N. D. Jones",
TITLE = "A note on linear time simulation of deterministic two-way pushdown automata",
JOURNAL = ipl,
YEAR = 1977,
month = "",
volume = 6,
number = "4",
pages = "110--112",
copy = ""
}
@article{JonSky77,
author = {N. D. Jones and S. Skyum},
journal = icalt,
pages = {177--188},
title = {Recognition of deterministic {ET0L} languages in logarithmic space},
volume = {35},
year = 1977,
}
@ARTICLE{Jon95,
AUTHOR = "N. D. Jones",
TITLE = "Computability and complexity from a programming perspective ({MFPS} draft preview)",
JOURNAL = entcs,
YEAR = 1995,
month = "",
volume = 1,
number = "",
pages = "",
copy = ""
}
@INPROCEEDINGS{JonKan96,
AUTHOR = "D. de Jongh and M. Kanazawa",
TITLE = "Angluin's theorem for indexed families of r.e. sets and applications",
BOOKTITLE = "Conference on Learning Theory COLT 96",
YEAR = 1996,
pages = "193--204",
address = "",
organization = "ACM",
publisher = "",
}
@inproceedings{Joretal2011,
author = {G. Joret and
C. Paul and
I. Sau and
S. Saurabh and
S. Thomass{\'e}},
title = {Hitting and Harvesting Pumpkins},
booktitle = {Algorithms -- ESA 2011 -- 19th Annual European Symposium},
year = {2011},
pages = {394--407},
editor = {C. Demetrescu and
M. M. Halld{\'o}rsson},
publisher = {Springer},
series = {LNCS},
volume = {6942},
}
@ARTICLE{JosLevTak75,
AUTHOR = "A. K. Joshi and L. S. Levy and M. Takahashi",
TITLE = "Tree adjunct grammars",
JOURNAL = jcss,
YEAR = 1975,
month = "",
volume = 10,
number = "",
pages = "133--163",
copy = ""
}
@INPROCEEDINGS{ChoFelJue2004,
crossref = "WG2004",
AUTHOR = "B. Chor and M. Fellows and D. Juedes",
TITLE = "Linear Kernels in Linear Time, or How to Save $k$ Colors in \mbox{$O(n^2)$} steps",
chapter = "",
pages = "257--269",
copy = ""
}
@ARTICLE{JunMut97,
AUTHOR = "J{\"u}nger, M. and Mutzel, P.",
TITLE = "2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms",
JOURNAL = jgaa,
YEAR = 1997,
month = "",
volume = 1,
number = "",
pages = "1--25",
copy = ""
}
@ARTICLE{JunThi2000,
AUTHOR={J{\"u}nger, M. and S. Thienel},
TITLE={The {ABACUS} System for Branch-and-Cut-and-Price Algorithms in Integer Programming and Combinatorial Optimization},
JOURNAL={Software: Practice and Experience},
PAGES={1325--1352},
VOLUME={30},
YEAR={2000}
}
@ARTICLE{Jur00,
AUTHOR = "J. Jurek",
TITLE = "On the linear computational complexity of the parser for quasi-context context-free languages",
JOURNAL = prl,
YEAR = 2000,
month = "",
volume = 21,
number = "",
pages = "179--187",
copy = ""
}
@ARTICLE{JurYu91,
AUTHOR = "H. J{\"u}rgensen and S. S. Yu",
TITLE = "Relations on free monoids, their independent sets,
and codes",
JOURNAL = ijcm,
YEAR = 1991,
month = "",
volume = 40,
number = "",
pages = "17--46",
copy = ""
}
@ARTICLE{JurWoo82,
AUTHOR = "H. {J\"urgensen} and D. Wood",
TITLE = "Self-regulating {L} systems",
JOURNAL = eikalt,
YEAR = 1982,
VOLUME = 18,
NUMBER = "7/8",
PAGES = "375--387",
copy = ""
}
@ARTICLE{JurKun86,
AUTHOR = "H. {J\"urgensen} and M. Kunze",
TITLE = "{\"Uber} die {I}mplementierung redundanzfreier
{C}odes zur {D}atenverschl{\"u}sselung",
JOURNAL = rairoita,
YEAR = 1986,
month = "",
volume = 20,
number = "1",
pages = "5--30",
copy = ""
}
@ARTICLE{JurLin87,
AUTHOR = "H. {J\"urgensen} and A. Lindenmayer",
TITLE = "Inference algorithms for developmental systems with
cell lineages",
JOURNAL = bmb,
YEAR = 1987,
volume = 49,
number = "1",
pages = "93--123",
copy = ""
}
@ARTICLE{JurSta95,
AUTHOR = "H. J{\"u}rgensen and L. Staiger",
TITLE = "Local {H}ausdorff dimension",
JOURNAL = actainform,
YEAR = 1995,
month = "",
volume = 32,
number = "",
pages = "491--507",
copy = ""
}
@INCOLLECTION{JurKon97,
crossref = "RozSal97I",
AUTHOR = "H. J{\"u}rgensen and S. Konstantinidis",
TITLE = "Codes",
PAGES = "511--607",
CHAPTER = "",
copy = ""
}
@article{JusVed2004,
author = {W. Just and G. Della Vedova},
title = {Multiple Sequence Alignment as a Facility-Location Problem},
journal = {INFORMS J. on Computing},
volume = {16},
number = {4},
year = {2004},
pages = {430--440},
}
@ARTICLE{JuvMoh92,
AUTHOR = "M. Juvan and B. Mohar",
TITLE = "Optimal linear labelings and eigenvalues of graphs",
JOURNAL = dam,
YEAR = 1992,
month = "",
volume = 36,
number = "",
pages = "153--168",
copy = ""
}
@inproceedings{JuvMarMoh95,
author = {M. Juvan and
J. Marincek and
B. Mohar},
title = {Embedding Graphs in the Torus in Linear Time},
booktitle = {Integer Programming and Combinatorial Optimization IPCO},
year = {1995},
pages = {360--363},
editor = {E. Balas and
J. Clausen},
publisher = {Springer},
series = {LNCS},
volume = {920},
}
@ARTICLE{JwoLakDha91,
AUTHOR = "J.-S. Jwo and S. Lakshmivarahan and S. K. Dhall",
TITLE = "Embedding of cycles and grids in star graphs",
JOURNAL = jcsc,
YEAR = 1991,
month = "",
volume = 1,
number = "1",
pages = "43--74",
copy = ""
}
KKK
@ARTICLE{Kac74,
AUTHOR = "B. Ye. Kac",
TITLE = "{\cyr Sinhronnye levokontekstnye preobrazobanuya regulyarnyh yazykov}",
JOURNAL = nti2,
YEAR = 1974,
month = "",
OPTvolume = {},
number = "4",
pages = "36--38",
copy = ""
}
@ARTICLE{Kac91,
AUTHOR = "P. Kacsuk",
TITLE = "A parallel Prolog abstract machine and its
multi-transputer implementation",
JOURNAL = tcj,
YEAR = 1991,
month = "",
volume = 34,
number = "1",
pages = "52--63",
copy = ""
}
@INPROCEEDINGS{Kac92,
crossref = "DeGetal92",
AUTHOR = "P. Kacsuk",
TITLE = "{3DPAM} = {WAM} + {DATAFLOW}",
chapter = "",
pages = "32--53",
copy = ""
}
@TECHREPORT{Kac92a,
AUTHOR = "P. Kacsuk",
TITLE = "Execution of Prolog on Massively Parallel Distributed
Computer Systems, SERC Research Grant Report",
INSTITUTION = "Centre for Parallel Computing",
YEAR = 1992,
month = "",
number = "",
address = "Queen Mary and Westfield College, Mile End Road,
London E14NS, U.K.",
copy = ""
}
@INBOOK{Kad,
AUTHOR = "F. Kaden",
TITLE = "Graph metrics and distance-graphs",
PAGES = "145--158",
PUBLISHER = "Teubner DDR",
YEAR = "19??",
VOLUME = 59,
SERIES = ttzm,
copy = ""
}
@INBOOK{Kada,
AUTHOR = "F. Kaden",
TITLE = "Halbgeordnete Graphmengen und Graphmetriken",
PAGES = "92--95",
PUBLISHER = "Teubner DDR",
YEAR = "19??",
VOLUME = 73,
SERIES = ttzm,
copy = ""
}
@ARTICLE{KahPavBai87,
AUTHOR = "S. Kahan and T. Pavlidis and H. S. Baird",
TITLE = "On the recognition of printed characters of any font
and size",
JOURNAL = ieeetopami,
YEAR = 1987,
month = "",
volume = 9,
number = "2",
pages = "274--288",
copy = ""
}
@ARTICLE{Kah74,
AUTHOR = "D. Kahnert",
TITLE = "Addition linearer {C}antormengen",
JOURNAL = czmj,
YEAR = 1974,
month = "",
volume = 24,
number = "",
pages = "563--575",
copy = ""
}
@PHDTHESIS{Kah75,
AUTHOR = "D. Kahnert",
TITLE = "Ma\ss{} und {D}imension",
SCHOOL = "Universit{\"a}t Stuttgart",
YEAR = 1975,
month = "",
address = "",
type = "Habilitationsschrift",
copy = ""
}
@INPROCEEDINGS{Kah76,
AUTHOR = "D. Kahnert",
TITLE = "Haar-{M}a\ss\ und {H}ausdorff-{M}a\ss",
BOOKTITLE = "Measure Theory, Proceedings of the Conference
held at Oberwolfach, 15--21 June, 1975",
YEAR = 1976,
month = "",
volume = "541",
editor = "A. Bellow and D. K{\"o}lzow",
series = "{LNM}",
chapter = "",
pages = "13--23",
address = "",
organization = "",
copy = ""
}
@Article{KalDes90,
author = {P.~P. Kale and N.~V. Deshpande},
title = {On line independence, domination, irredundance and neighbourhood numbers of a graph},
journal = {Indian J. Pure Appl. Math.},
year = {1990},
OPTkey = {},
volume = {21},
OPTnumber = {},
pages = {695--698},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@ARTICLE{Kam86,
AUTHOR = "T. Kamae",
TITLE = "A characterization of self-affine functions",
JOURNAL = jjam,
YEAR = 1986,
month = "",
volume = 3,
number = "",
pages = "271--280",
copy = ""
}
@Article{KamWei70,
author = {T. Kameda and P. Weiner},
title = {On the state minimization of nondeterministic finite automata},
journal = ieeetoc,
year = {1970},
volume = {C-19},
number = {7},
pages = {617--627},
}
@INPROCEEDINGS{KamFal94,
AUTHOR = "I. Kamel and C. Faloutsos",
TITLE = "Hilbert {R}-tree: an improved {R}-tree using fractals",
BOOKTITLE = "20th {VLBD} Conference, Santiago de Chile",
YEAR = 1994,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "500--509",
address = "",
organization = "",
copy = ""
}
@ARTICLE{Kam85,
AUTHOR = "M. Kaminski",
TITLE = "A classification of {$\omega$}-regular languages",
JOURNAL = tcs,
YEAR = 1985,
month = "",
volume = 36,
number = "",
pages = "217--229",
copy = ""
}
@inproceedings{KamThi2012,
AUTHOR = "M. Kaminski and
D. M. Thilikos",
title = {Contraction checking in graphs on surfaces},
booktitle = {29th International Symposium on Theoretical Aspects of Computer
Science, STACS},
year = {2012}, pages = {182--193},
editor = {C. D{\"u}rr and
T. Wilke},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
series = {LIPIcs},
volume = {14},
}
@ARTICLE{KamKaw98,
AUTHOR = "H. Kamo and K. Kawamura",
TITLE = "Computability of self-similar sets",
JOURNAL = {Math. Log. Quart.},
YEAR = 1998,
month = "",
volume = {To appear},
number = "",
pages = "",
copy = ""
}
@TECHREPORT{Kan94,
AUTHOR = "M. Kanazawa",
TITLE = "A note on language classes with finite elasticity",
INSTITUTION = "CWI, Amsterdam",
YEAR = 1994,
month = "",
number = "CS-R9471",
address = "",
copy = ""
}
@Article{Kan96,
author = {M. Kanazawa},
title = {Identification in the Limit of Categorial Grammars},
journal = {Journal of Logic, Language, and Information},
year = {1996},
OPTkey = {},
volume = {5},
OPTnumber = {},
pages = {115--155},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@PHDTHESIS{Kan97,
AUTHOR = "M. Kanazawa",
TITLE = "Learnable Classes of Categorial Grammars",
SCHOOL = "CSLI",
YEAR = 1998,
month = "",
address = "",
type = "{PhD}",
copy = ""
}
@article{Kan2010,
author = {D.~M. Kane},
title = {Unary Subset-Sum is in Logspace},
journal = {CoRR},
volume = {abs/1012.1336},
year = {2010},
ee = {http://arxiv.org/abs/1012.1336},
}
@INPROCEEDINGS{KanShi88,
crossref = "Hyper3",
AUTHOR = "D. D. Kandlur and K. G. Shin",
TITLE = "Hypercube management in the presence of node failures",
chapter = "6",
pages = "328--336",
copy = ""
}
@article {KanKelNis2001,
author = {Kaneko, A. and Kelmans, A. and Nishimura, T.},
title = {On packing 3-vertex paths in a graph},
journal = jgth,
volume = {36},
number = {4},
pages = {175--197},
year = {2001},
}
@INPROCEEDINGS{Kan90,
AUTHOR = "Kanevsky, A.",
TITLE = "On the number of minimum size separating vertex sets in a graph and how to find all of them",
chapter = "44",
booktitle = {Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms SODA},
pages = "411--421",
copy = ""
}
@ARTICLE{Kan93,
AUTHOR = "A. Kanevsky",
TITLE = "Finding all mimimum-size separating vertex sets in a graph",
JOURNAL = {Networks},
YEAR = 1993,
month = "",
volume = 23,
number = "",
pages = "533--541",
copy = ""
}
@INPROCEEDINGS{Kan83,
AUTHOR = "S. Kang",
TITLE = "Linear ordering and applications to placement",
BOOKTITLE = "Proc.\ 20th Design and Automation Conference DAC",
YEAR = 1983,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "457--464",
address = "",
organization = "IEEE/ACM",
publisher = "",
copy = ""
}
@PHDTHESIS{Kan2001,
AUTHOR = "I. Kanj",
TITLE = "Vertex Cover: Exact and Approximation Algorithms and Applications",
SCHOOL = "Texas A\& M University",
YEAR = 2001,
month = "",
address = "",
type = "PhD Thesis",
copy = ""
}
@INPROCEEDINGS{KanPer2002,
AUTHOR = "I.~A. Kanj and L. Perkovi{\v c}",
TITLE = "Improved parameterized algorithms for planar dominating set",
BOOKTITLE = "Mathematical Foundations of Computer Science 2002, 27th International
Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings",
YEAR = 2002,
month = "",
volume = "2420",
editor = "K. Diks and W. Rytter",
series = "LNCS",
chapter = "",
pages = "399--410",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@TECHREPORT{KanPer2004,
AUTHOR = "I.~A. Kanj and L.~{Perkovi\v c}",
TITLE = "A note on {B}aker's algorithm",
INSTITUTION = "DePaul University",
YEAR = 2004,
month = nov,
number = "04-006",
address = "",
copy = ""
}
@inproceedings{KanNakXia2006,
author={I.~A. Kanj and L. Nakhleh and G. Xia},
title={Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms},
year={2006},
pages={299--308},
booktitle={Proceedings of the 12th Annual International Computing and Combinatorics Conference COCOON},
series = {LNCS}, volume = {4112}
}
@article{KanNXakXia2008,
author={I.~A. Kanj and L. Nakhleh and G. Xia},
title = {The Compatibility of Binary Characters on Phylogenetic Networks:
Complexity and Parameterized Algorithms},
journal = alg,
volume = {51},
number = {2},
year = {2008},
pages = {99--128},
}
@TechReport{KanZha2010,
author = {I.~A. Kanj and F. Zhang},
title = {Independent Set on graphs with maximum degree 3},
institution = {DePaul University, The School of Computing},
year = {2010},
OPTkey = {},
OPTtype = {},
number = {TR 10-004},
OPTaddress = {},
month = jun,
OPTnote = {},
OPTannote = {}
}
@inproceedings {KanZha2011,
author = {I.~A. Kanj and F. Zhang},
title = {\textsc{3-hitting set} on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size},
booktitle = {Theory and Practice of Algorithms in (Computer) Systems, TAPAS},
series = {LNCS},
editor = {Marchetti-Spaccamela, A. and Segal, M.},
publisher = {Springer},
pages = {163--174},
volume = {6595},
year = {2011}
}
@article{Kan91,
author = {V. Kann},
title = {Maximum Bounded 3-Dimensional Matching in {MAX SNP}-Complete},
journal = ipl,
volume = {37},
number = {1},
year = {1991},
pages = {27--35},
}
@article{Kan94,
author = {V. Kann},
title = {Maximum Bounded {H}-Matching is {MAX SNP}-Complete},
journal = ipl,
volume = {49},
year = {1994},
pages = {309--318},
}
@ARTICLE{Kanetal97,
AUTHOR = "V. Kann and S. Khanna and J. Lagergren and A. Panconesi",
TITLE = "On the hardness of approximating max-$k$-cut and its dual",
JOURNAL = {Chicago Journal of Theoretical Computer Science},
YEAR = 1997,
month = "",
volume = {},
number = "2",
pages = "1--18",
copy = ""
}
@INBOOK{KanMon77,
AUTHOR = "R. Kannan and C. L. Monma",
TITLE = "On the computational complexity of integer
programming problems",
PAGES = "161--172",
BOOKTITLE = {Optimization and OR},
CHAPTER = "",
PUBLISHER = "Springer",
YEAR = 1977,
month = "",
address = "",
volume = 157,
series = "Lecture Notes in Economics and Math. Systems",
type = "",
copy = ""
}
@INPROCEEDINGS{KanVemVet2000,
AUTHOR = "R. Kannan and S. Vempala and A. Vetta",
TITLE = "On clusterings --- good, bad and spectral",
BOOKTITLE = "Foundations of Computer Science FOCS",
YEAR = 2000,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "367--377",
address = "",
organization = "IEEE",
publisher = "",
copy = ""
}
@Article{KanThoRan2008,
author = {S. Kannamma and D.~G. Thomas and K. Rangarajan},
title = {Learning of finite coded {P}etri net languages},
journal = {J. Combin. Math. Combin. Comput.},
year = {2008},
OPTkey = {},
volume = {67},
OPTnumber = {},
pages = {223--234},
}
@article{KanKatKir2004,
title = "Packing paths of length at least two",
journal = dm,
volume = "283",
pages = "129--135",
year = "2004",
author = "M. Kano and G.~Y. Katona and Z. Kir\'aly",
}
@Article{Kanetal2002,
author = {T. Kanungo and D.~M. Mount and N.~S, Netanyahu and C.~D. Piatko and R. Silverman and A.~Y. Wu},
title = {Efficient $k$-means clustering algorithm: analysis and implementation},
journal = ieeetopami,
year = {2002},
OPTkey = {},
volume = {24},
OPTnumber = {},
pages = {881--892},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{KaoSewJac2009,
author = {G.~K. Kao and
E. C. Sewell and
S. H. Jacobson},
title = {A branch, bound, and remember algorithm for the {$1|r_i|\Sigma t_i$}
scheduling problem},
journal = {J. Scheduling},
volume = {12},
number = {2},
year = {2009},
pages = {163--175},
}
@INPROCEEDINGS{Kapetal94,
AUTHOR = "H. Kaplan and R. Shamir and R. E. Tarjan",
TITLE = "Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping",
BOOKTITLE = "Foundations of Computer Science FOCS",
YEAR = 1994,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "780--791",
address = "",
organization = "IEEE",
publisher = "",
copy = ""
}
@Article{KapSha96,
author = "H. Kaplan and R. Shamir",
title = "Pathwidth, bandwidth, and completion problems to
proper interval graphs with small cliques",
journal = siam,
volume = "25",
number = "3",
pages = "540--561",
month = jun,
year = "1996",
}
@Article{Kapetal99,
author = "H. Kaplan and R. Shamir and R. E. Tarjan",
title = "Tractability of Parameterized Completion Problems on
Chordal, Strongly Chordal, and Proper Interval Graphs",
journal = siam,
volume = "28",
number = "5",
pages = "1906--1922",
month = oct,
year = "1999",
}
@Article{KapShaTar99,
author = "H. Kaplan and R. Shamir and R.~E. Tarjan",
title = "A Faster and Simpler Algorithm for Sorting Signed
Permutations by Reversals",
journal = siam,
volume = "29",
number = "3",
pages = "880--892",
month = jun,
year = "1999",
}
@article{KapCoo96,
author = {B.~M. Kapron and
S.~A. Cook},
title = {A New Characterization of Type-2 Feasibility},
journal = siam,
volume = {25},
number = {1},
year = {1996},
pages = {117--132},
}
@Article{KarMotRam97,
title = "On Approximating the Longest Path in a Graph",
author = "D.~R. Karger and R. Motwani and G. D. S.
Ramkumar",
journal = "Algorithmica",
pages = "82--98",
month = may,
year = "1997",
volume = "18",
number = "1",
}
@TECHREPORT{Kar2004,
AUTHOR = "G. Karakostas",
TITLE = "A better approximation ratio for the Vertex Cover problem",
INSTITUTION = "ECCC Trier",
YEAR = 2004,
month = "",
number = "ECCC Report TR04-084",
address = "",
copy = ""
}
@inproceedings{Kar2005,
author = {G. Karakostas},
title = {A Better Approximation Ratio for the Vertex Cover Problem},
booktitle = {Automata, Languages and Programming, 32nd International
Colloquium, ICALP},
year = {2005},
pages = {1043--1050},
editor = {L. Caires and
G. F. Italiano and
L. Monteiro and
C. Palamidessi and
M. Yung},
publisher = {Springer},
series = {LNCS},
volume = {3580},
}
@article{Kar2009,
author = {G. Karakostas},
title = {A better approximation ratio for the vertex cover problem},
journal = {ACM Trans. Algorithms},
volume = {5},
issue = {4},
month = {November},
year = {2009},
pages = {41:1--41:8},
articleno = {41},
}
@article {KarSheKho2008,
author = {Karami, H. and Sheikholeslami, S. and Khodkar, A.},
title = {Some Notes on Signed Edge Domination in Graphs},
journal = {Graphs and Combinatorics},
pages = {29--35},
volume = {24},
issue = {1},
year = {2008}
}
@Article{Karetal2013,
author = {H. Karami and R. Khoeilar and S.~M. Sheikholeslami and A. Khodkar},
title = {Global Signed Domination in Graphs},
journal = {BULLETIN of the Malaysian Mathematical Sciences Society},
year = {2013},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
OPTpages = {},
OPTmonth = {},
note = {To appear},
OPTannote = {},
OPTurl = {},
OPTurldate = {},
OPTlastchecked = {},
OPTdoi = {},
OPTisbn = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {},
OPTkeywords = {},
}
@INBOOK{Kar74,
AUTHOR = "J. Karhum{\"a}ki",
booktitle = {L Systems}, editor = {G. Rozenberg and A. Salomaa},
TITLE = "Some growth functions of context-dependent {L}-systems",
PAGES = "127--135",
CHAPTER = "Growth functions",
PUBLISHER = "Berlin: Springer",
YEAR = 1974,
month = "",
address = "",
volume = 15,
series = "LNCS",
type = "",
copy = ""
}
@INBOOK{Kar76,
AUTHOR = "J. Karhum{\"a}ki",
TITLE = "On length set of informationless {L} systems",
PAGES = "227--242",
BOOKTITLE = "Automata, Languages, Development",
PUBLISHER = "North-Holland",
YEAR = 1976,
month = "",
address = "",
volume = "",
series = "",
type = "",
copy = ""
}
@ARTICLE{KarLin83,
AUTHOR = "J. Karhum{\"a}ki and M. Linna",
TITLE = "A note on morphic characterization of languages",
JOURNAL = dam,
YEAR = 1983,
month = "",
volume = 5,
number = "",
pages = "243--246",
copy = ""
}
@INPROCEEDINGS{Kar84,
AUTHOR = "J. Karhum{\"a}ki",
TITLE = "A property of three-element codes",
BOOKTITLE = "{LNCS} 166; {STACS}",
YEAR = 1984,
pages = "305--313",
copy = ""
}
@ARTICLE{Kar85,
AUTHOR = "J. Karhum{\"a}ki",
TITLE = "On three-element codes",
JOURNAL = tcs,
YEAR = 1985,
month = "",
volume = 40,
number = "",
pages = "3--11",
copy = ""
}
@ARTICLE{Kar85a,
AUTHOR = "J. Karhum{\"a}ki",
TITLE = "A property of three-element codes",
JOURNAL = tcs,
YEAR = 1985,
month = "",
volume = 41,
number = "",
pages = "215--222",
copy = ""
}
@INPROCEEDINGS{Kar86,
AUTHOR = "J. {Karhum\"aki}",
TITLE = "The equivalence of mappings on languages",
BOOKTITLE = IMYCS,
YEAR = 1986,editor = {J. Demetrovics and J. Kelemen},
publisher = {Budapest: Computer and Automation Institute of the Hungarian Academy
of Sciences, TR no. 185/1986},
PAGES = "21--35",
ORGANIZATION = "",
copy = ""
}
@INPROCEEDINGS{KarPlaRyt97,
AUTHOR = "J. Karhum{\"a}ki and W. Plandowski and W. Rytter",
TITLE = "Pattern-matching problems for 2-dimensional images
described by finite automata",
BOOKTITLE = "Fundamentals of Computation Theory FCT'97",
YEAR = 1997,
month = "",
volume = "1279",
editor = "B. S. Chlebus and L. Czaja",
series = "LNCS",
chapter = "",
pages = "245--256",
address = "",
organization = "",
copy = ""
}
@ARTICLE{Kar88,
AUTHOR = "J. Kari",
TITLE = "A cryptanalytic observation concerning systems based on language theory",
JOURNAL = dam,
YEAR = 1988,
month = "",
volume = 21,
number = "",
pages = "265--268",
copy = ""
}
@ARTICLE{Kar89,
AUTHOR = "J. Kari",
TITLE = "Observations concerning a public key cryptosystem based on iterated morphisms",
JOURNAL = tcs,
YEAR = 1989,
month = "",
volume = 66,
number = "",
pages = "45--53",
copy = ""
}
@ARTICLE{Kar94,
AUTHOR = "L. Kari",
TITLE = "Deletion operations: closure properties ",
JOURNAL = ijcm,
YEAR = 1994,
month = "",
volume = 52,
number = "",
pages = "23--42",
copy = ""
}
@ARTICLE{Karetal95,
AUTHOR = "L. Kari and others",
TITLE = "Multi-pattern languages",
JOURNAL = tcs,
YEAR = 1995,
month = "",
volume = {},
number = "141",
pages = "253--268",
copy = ""
}
@ARTICLE{Karetal95a,
AUTHOR = "L. Kari and A. Mateescu and Gh. P\u aun and A. Salomaa",
TITLE = "Teams in cooperating distributed grammar systems",
JOURNAL = {Journal of Experimental and Theoretical AI},
YEAR = 1995,
month = "",
volume = 7,
number = "",
pages = "347--359",
copy = ""
}
@ARTICLE{Karetal96,
AUTHOR = "L. Kari and others",
TITLE = "The power of restricted splicing with rules from a
regular language",
JOURNAL = jucs,
YEAR = 1996,
month = "",
volume = 2,
number = "4",
pages = "224--240",
copy = ""
}
@INBOOK{KarMun85,
AUTHOR = "R. G. Karlsson and J.I. Munro",
TITLE = "Proximity on a grid",
PAGES = "187--196",
PUBLISHER = "Berlin: Springer",
YEAR = "1985",
VOLUME = 182,
SERIES = "LNCS",
copy = ""
}
@Article{KarHel67,
author = {R.~M. Karp and M. Held},
title = {Finite-state processes and dynamic programming},
journal = siamam,
year = {1967},
OPTkey = {},
volume = {15},
OPTnumber = {},
pages = {693--718},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@InCollection{Kar72,
author={R.~M. Karp},
title = {Reducibility Among Combinatorial Problems},
booktitle = {Complexity of Computer Computations},
pages = {85--103},
publisher = {New York: Plenum Press},
year = {1972},
editor = {R. E. Miller and J. W. Thatcher},
}
@article{Kar77,
author={R.~M. Karp},
title={Dynamic programming meets the principle of
inclusion-exclusion},
journal=ipl,
volume={1},
number={2},
year={1982},
pages={49--51},
}
@InCollection{KarZel98,
author = {M. Karpinski and A. Zelikovsky},
title = {Approximating dense cases of covering problems},
booktitle = {Network design: connectivity and facilities location},
pages = {169--178},
publisher = {Ameerican Mathematical Society},
year = {1998},
editor = {P.~M. Pardalos and D. Du},
volume = {40},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
}
@article{KarChaLev98,
author = {M.~G. Karpovsky and
K. Chakrabarty and
LB. Levitin},
title = {On a New Class of Codes for Identifying Vertices in Graphs},
journal = {IEEE Transactions on Information Theory},
volume = {44},
number = {2},
year = {1998},
pages = {599--611},
}
@ARTICLE{Kas70,
AUTHOR = "T. Kasai",
TITLE = "A hierarchy between context-free and context-sensitive languages",
JOURNAL = jcss,
YEAR = 1970,
VOLUME = 4,
NUMBER = "",
PAGES = "492--508",
copy = ""
}
@ARTICLE{Kas75,
AUTHOR = "T. Kasai",
TITLE = "A universal context-free grammar",
JOURNAL = icalt,
YEAR = 1975,
month = "",
volume = 28,
number = "",
pages = "30--34",
copy = ""
}
@article{KasAdaIwa79,
author = {T. Kasai and
A. Adachi and
S. Iwata},
title = {Classes of Pebble Games and Complete Problems},
journal = siam,
volume = {8},
number = {4},
year = {1979},
pages = {574--586},
}
@ARTICLE{KasIwa85,
AUTHOR = "T. Kasai and S. Iwata",
TITLE = "Gradually intractable problems and nondeterministic
log-space lower bounds",
JOURNAL = mst,
YEAR = 1985,
month = "",
volume = 18,
number = "",
pages = "153--170",
copy = ""
}
@Article{KasZie2006,
author = {A. Kasperski and P. \.{Z}ieli\'nski},
title = {An approximation algorithm for interval data minmax regret combinatorial optimization problems},
journal = ipl,
year = {2006},
OPTkey = {},
volume = {97},
number = {177--180},
OPTpages = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {}
}
@Article{KasZie2008,
author = {A. Kasperski and P. \.{Z}ieli\'nski},
title = {A 2-approximation algorithm for interval data minmax regret sequencing
problems with the total ﬂow time criterion},
journal = {Operations Research Letters},
year = {2008},
OPTkey = {},
volume = {36},
number = {343–-344},
OPTpages = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
OPTabstract = {}
}
@Article{KasZie2009,
author = {A. Kasperski and P. \.{Z}ieli\'nski},
title = {On the approximability of minmax (regret) network optimization
problems},
journal = ipl,
year = {2009},
OPTkey = {},
volume = {109},
pages = {262--266},
}
@MastersThesis{Kas2007,
author = {A. Kasprzik},
title = {Two Equivalent Regularizations for Tree Adjoining Grammars},
school = {Eberhards-Karls-Universit\"at T\"ubingen, Germany},
year = {2007},
}
@inproceedings{Kas2008,
author = {A. Kasprzik},
title = {A Learning Algorithm for Multi-dimensional Trees, or: Learning
Beyond Context-Freeness},
pages = {111--124},
booktitle = {Grammatical Inference: Algorithms and Applications, 9th
International Colloquium, ICGI},
year = {2008},
editor = {A. Clark and
F. Coste and
L. Miclet},
publisher = {Springer},
series = {LNCS},
volume = {5278},
}
@InProceedings{Kas2009,
author = {A. Kasprzik},
title = {Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees},
booktitle = {Post-proceedings of the 7th International Workshop on Finite-State Methods and Natural Language Processing},
OPTcrossref = {},
OPTkey = {},
pages = {98--109},
year = {2009},
editor = {J. Piskorski and B. Watson and A. Yli-Jyr\"a},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {IOS Press},
OPTnote = {},
OPTannote = {}
}
@InProceedings{KasKot2010,
author = {A. Kasprzik and T. K\"otzing},
title = {String extension learning using lattices},
booktitle = {Language and Automata Theory and Applications LATA},
OPTcrossref = {},
OPTkey = {},
pages = {380--391},
year = {2010},
editor = {A.-H. Dediu and H. Fernau and C. Mart\'in-Vide},
volume = {6031},
OPTnumber = {},
series = {LNCS},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Springer},
OPTnote = {},
OPTannote = {}
}
@InProceedings{Kas2010,
author = {A. Kasprzik},
title = {Learning Residual Finite-State Automata Using Observation Tables},
booktitle = {12th International Workshop
on Descriptional Complexity of Formal Systems (DCFS 2010)},
OPTcrossref = {},
OPTkey = {},
pages = {205--212},
year = {2010},
editor = {I. McQuillan and G. Pighizzini},
volume = {31},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
publisher = {Electronic Proceedings in Theoretical Computer Science},
OPTnote = {},
OPTannote = {}
}
@InProceedings{Kas2010a,
author = {A. Kasprzik},
title = {Generalizing over several learning settings},
booktitle = {International Colloquium on Grammatical Inference ICGI},
pages = {288--202},
year = {2010},
editor = {J. M. Sempere and P. Garc\'ia},
volume = {6339},
series = {LNCS},
publisher = {Springer},
}
@inproceedings{Kas2011,
author = {A. Kasprzik},
title = {Inference of Residual Finite-State Tree Automata from Membership
Queries and Finite Positive Data},
pages = {476--477},
booktitle = {Developments in Language Theory DLT},
year = {2011},
editor = {G. Mauri and
A. Leporati},
publisher = {Springer},
series = {LNCS},
volume = {6795},
}
@inproceedings{KasYos2011,
author = {A. Kasprzik and
R. Yoshinaka},
title = {Distributional Learning of Simple Context-Free Tree Grammars},
booktitle = {Algorithmic Learning Theory ALT},
year = {2011},
pages = {398--412},
editor = {J. Kivinen and
C. Szepesv{\'a}ri and
E. Ukkonen and
T. Zeugmann},
publisher = {Springer},
series = {LNCS},
volume = {6925},
year = {2011},
}
@PhdThesis{Kas2012,
author = {A. Kasprzik},
title = {Formal Tree Languages and Their Algorithmic Learnability},
school = {Fachbereich IV, Universit\"at Trier, Germany},
year = {2012},
}
@ARTICLE{Kas2013,
AUTHOR = "A. Kasprzik",
TITLE = "Four one-shot learners for regular tree languages and their polynomial characterizability",
JOURNAL = tcs,
YEAR = 2013,
month = "",
volume = "485C",
number = "",
pages = "85--106",
copy = ""
}
@ARTICLE{Kas76,
AUTHOR = "L. K\'azsonyi",
TITLE = "On half-planar geometries",
JOURNAL = {Colloquia Mathematica Societatis J\'anos Bolyai},
YEAR = 1976,
month = "",
volume = 18,
number = "",
pages = "639--651",
copy = ""
}
@ARTICLE{KasTuz86,
AUTHOR = "L. K\'azsonyi and Zs. Tuza",
TITLE = "Saturated graphs with minimal number of edges",
JOURNAL = jgth,
YEAR = 1986,
month = "",
volume = 10,
number = "",
pages = "203--210",
copy = ""
}
@ARTICLE{KatOkaEno78,
AUTHOR = "T. Katayama and M. Okamoto and H. Enomoto",
TITLE = "Characterization of the structure-generating
functions of regular sets and the {D0L} growth functions",
JOURNAL = icalt,
YEAR = 1978,
month = "",
volume = 36,
number = "",
pages = "85--101",
copy = ""
}
@ARTICLE{KatSip81,
AUTHOR = "H. P. Katseff and M. Sipser",
TITLE = "Several results in program size complexity",
JOURNAL = tcs,
YEAR = 1981,
month = "",
volume = 15,
number = "",
pages = "291--309",
copy = ""
}
@ARTICLE{KatStr74,
AUTHOR = "Y. Katznelson and K. Stromberg",
TITLE = "Everywhere differentiable, nowhere monotone, functions",
JOURNAL = amm,
YEAR = 1974,
month = "",
volume = 81,
number = "",
pages = "349--354",
copy = ""
}
@InProceedings{Kawetal2000,
author = {T. Kawagoe and J. Ohtani and M. Niiro and T. Ooishi and M. Hamada and H. Hidaka},
title = {A built-in self-repair analyzer {(CRESTA)} for embedded {DRAM}s},
booktitle = {Proc. Int. Test Conf. (ITC)},
OPTcrossref = {},
OPTkey = {},
pages = {567--573},
year = {2000},
organization = {IEEE},
}
@Article{KawMoh2007,
author = {Ken-ichi Kawarabayashi and B. Mohar},
title = {Some Recent Progress and Applications in Graph Minor Theory},
journal = {Graphs and Combinatorics},
year = {2007},
volume = {23},
OPTnumber = {},
pages = {1--46},
}
@inproceedings{KawRee2010,
author = {Ken-ichi Kawarabayashi and
B. A. Reed},
title = {Odd cycle packing},
year = {2010},
pages = {695--704},
editor = {L. J. Schulman},
booktitle = {Proceedings of the 42nd ACM Symposium on Theory of Computing,
STOC 2010},
publisher = {ACM},
}
@inproceedings{KawKob2012,
author = {Ken-ichi Kawarabayashi and
Y. Kobayashi},
title = {Linear min-max relation between the treewidth of {H}-minor-free
graphs and its largest grid},
booktitle = {29th International Symposium on Theoretical Aspects of Computer
Science, STACS},
year = {2012},
pages = {278--289},
editor = {C. D{\"u}rr and
T. Wilke},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
series = {LIPIcs},
volume = {14},
}
@ARTICLE{KavRah02,
AUTHOR = "A. Kaveh and H. Rahami",
TITLE = "An efficient algorithm for embedding nonplanar graphs in planes",
JOURNAL = {J. Mathematical Modelling and Algorithms},
YEAR = 2002,
month = "",
volume = 1,
number = "",
pages = "257--268",
copy = ""
}
@ARTICLE{Kay84,
AUTHOR = "B. H. Kaye",
TITLE = "Multifractal description of a rugged fineparticle profile",
JOURNAL = "Particle Characterization",
YEAR = 1984,
month = "",
volume = 1,
number = "",
pages = "14--21",
copy = ""
}
@ARTICLE{KeaVal94,
AUTHOR = "M. Kearns and L. Valiant",
TITLE = "Cryptographic limitations on learning boolean formulae and finite automata",
JOURNAL = jacm,
YEAR = 1994,
month = "",
volume = 41,
number = "",
pages = "67--95",
copy = ""
}
@ARTICLE{KecSan95,
AUTHOR = "J. Kececioglu and D. Sankoff",
TITLE = "Exact and approximation algorithm for sorting by reversals, with applications to genome rearrangement",
JOURNAL = alg,
YEAR = 1995,
month = "",
volume = 13,
number = "",
pages = "180--210",
copy = ""
}
@ARTICLE{KelKelLin84,
AUTHOR = "J. Kelemen and A. Kelemenov\'a and A. Lindenmayer",
TITLE = "Answers by A. Lindenmayer to questions of J. Kelemen and A. Kelemenov\'a",
JOURNAL = eatcs,
YEAR = 1984,
month = "",
volume = 23,
number = "",
pages = "185--198",
copy = ""
}
@ARTICLE{Kel42,
AUTHOR = "J. L. Kelley",
TITLE = "Hyperspaces of a continuum",
JOURNAL = tams,
YEAR = 1942,
month = "",
volume = 63,
number = "",
pages = "22--36",
copy = ""
}
@article{KelMubSud2001,
author = {A.~K. Kelmans and
D. Mubayi and
B. Sudakov},
title = {Asymptotically Optimal Tree-Packings in Regular Graphs},
journal = {Electr. J. Comb.},
volume = {8},
number = {1},
year = {2001},
}
@article {KelMub2003,
author = {Kelmans, A. and Mubayi, D.},
title = {How many disjoint 2-edge paths must a cubic graph have?},
journal = jgth,
volume = {45},
number = {1},
pages = {57--79},
year = {2003},
}
@TechReport{Kel2006,
author = {A.~K. Kelmans},
title = {Packing $k$-edge trees in graphs of restricted vertex degrees},
institution = {arXiv.math.CO},
year = {2006},
OPTkey = {},
OPTtype = {},
number = {0610384},
OPTaddress = {},
month = oct,
OPTnote = {},
OPTannote = {}
}
@article {Kel2007a,
author = {Kelmans, A.~K.},
title = {Packing $k$-edge trees in graphs of restricted vertex degrees},
journal = jgth,
volume = {55},
number = {4},
pages = {306--324},
year = {2007},
}
@TechReport{Kel2007,
author = {A.~K. Kelmans},
title = {Packing 3-Vertex Paths in 2-Connected Graphs},
institution = {RUTCOR Research Report, Rutgers University (2005)},
year = {2007},
OPTkey = {},
OPTtype = {},
number = {arXiv:0712.4151v1 [math.CO]},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{Kel2011,
title = "Packing 3-vertex paths in claw-free graphs and related topics",
journal = dam,
volume = "159",
number = "2–3",
pages = "112 -- 127",
year = "2011",
author = "A. Kelmans",
}
@INPROCEEDINGS{Kem74,
AUTHOR = "R. Kemp",
TITLE = "Mehrdeutigkeiten kontextfreier Grammatiken",
BOOKTITLE = "Automata, Languages and Programming",
YEAR = 1974,
month = "",
volume = "14",
editor = "J. Loeckx",
series = "{LNCS}",
chapter = "",
pages = "534--546",
address = "",
organization = "",
copy = ""
}
@ARTICLE{Kem80,
AUTHOR = "R. Kemp",
TITLE = "A note on the density of inherently ambiguous
context-free languages",
JOURNAL = actainform,
YEAR = 1980,
month = "",
volume = 14,
number = "",
pages = "295--298",
copy = ""
}
@ARTICLE{Kem82,
AUTHOR = "R. Kemp",
TITLE = "On the number of words in the language
{$\{\,w