AAAA
@article{AalHoo89,
author = {I.~J. Aalbersberg and
H. J. Hoogeboom},
title = {Characterizations of the Decidability of Some Problems for Regular
Trace Languages},
journal = mst,
volume = {22},
number = {1},
pages = {1--19},
year = {1989},
}
@Article{AarJUV2015,
author="Aarts, F.
and Jonsson, B.
and Uijen, J.
and Vaandrager, F.",
title="Generating models of infinite-state communication protocols using regular inference with abstraction",
journal="Formal Methods in System Design",
year="2015",
volume="46",
number="1",
pages="1--41",
}
@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},
}
@PhdThesis{Aaz2008,
author = {A. Aazami},
title = {Hardness results and
approximation algorithms for
some problems on graphs},
school = {University of Waterloo, Canada},
year = {2008},
}
@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},
}
@article{Aaz2010,
author = {A. Aazami},
title = {Domination in graphs with bounded propagation: algorithms, formulations
and hardness results},
journal = joco,
volume = {19},
number = {4},
pages = {429--456},
year = {2010},
}
@article{AazCheJam2012,
author = {A. Aazami and
J. Cheriyan and
K.~R. Jampani},
title = {Approximation Algorithms and Hardness Results for Packing Element-Disjoint
{S}teiner Trees in Planar Graphs},
journal = alg,
volume = {63},
number = {1-2},
pages = {425--456},
year = {2012},
}
@inproceedings{AbaABFH88,
author = {M. Abadi and
E. Allender and
A. Z. Broder and
J. Feigenbaum and
L. A. Hemachandra},
title = {On Generating Solved Instances of Computational Problems},
booktitle = {Advances in Cryptology - CRYPTO '88, 8th Annual International
Cryptology Conference},
pages = {297--310},
editor = {S. Goldwasser},
publisher = {Springer},
series = {LNCS},
volume = {403},
year = {1990},
}
@inproceedings{AbaBshMaz2015,
author = {H. Abasi and
N.~H. Bshouty and
H. Mazzawi},
title = {Non-adaptive Learning of a Hidden Hypergraph},
booktitle = {Algorithmic Learning Theory - 26th International Conference, {ALT}},
pages = {89--101},
year = {2015},
editor = {K. Chaudhuri and
C. Gentile and
S. Zilles},
series = {LNCS},
volume = {9355},
publisher = {Springer},
}
@article{AbbPirVin96,
title = "Preference Structures and Co-comparability Graphs",
journal = "Journal of Multi-Criteria Decision Analysis",
volume = "5",
number = "2",
pages = "81--98",
year = "1996",
author = "Abbas, M. and Pirlot, M. and Vincke, P.",
}
@article{AbbYou2007,
title = "A survey on clustering algorithms for wireless sensor networks",
journal = "Computer Communications",
volume = "30",
number = "14--15",
pages = "2826--2841",
year = "2007",
author = "A.~A. Abbasi and M. Younis",
}
@inproceedings{AbbWilWei2014,
author = {A. Abboud and
V. Vassilevska Williams and
O. Weimann},
title = {Consequences of Faster Alignment of Sequences},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP}, Proceedings, Part
{I}},
pages = {39--51},
year = {2014},
editor = {J. Esparza and
P. Fraigniaud and
T. Husfeldt and
E. Koutsoupias},
series = {LNCS},
volume = {8572},
publisher = {Springer},
}
@inproceedings{AbbBacWil2015,
author = {A. Abboud and
A. Backurs and
V. Vassilevska Williams},
title = {If the Current Clique Algorithms are Optimal, So is {V}aliant's Parser},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}},
pages = {98--117},
editor = {V. Guruswami},
publisher = {{IEEE} Computer Society},
year = {2015},
}
@inproceedings{AbbWilWan2016,
author = {A. Abboud and
V. Vassilevska Williams and
J.~R. Wang},
title = {Approximation and Fixed Parameter Subquadratic Algorithms for Radius
and Diameter in Sparse Graphs},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA}},
pages = {377--391},
year = {2016},
editor = {R. Krauthgamer},
publisher = {{SIAM}},
}
@inproceedings{AbbBac2017,
author = {A. Abboud and
A. Backurs},
title = {Towards Hardness of Approximation for Polynomial Time Problems},
booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS}},
pages = {11:1--11:26},
year = {2017},
editor = {C.~H. Papadimitriou},
series = {LIPIcs},
volume = {67},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
}
@article{AbbWilYu2018,
author = {A. Abboud and
V. Vassilevska Williams and
H. Yu},
title = {Matching Triangles and Basing Hardness on an Extremely Popular Conjecture},
journal = siam,
volume = {47},
number = {3},
pages = {1098--1122},
year = {2018},
}
@article{AbbBHS2022,
author = {A. Abboud and
K. Bringmann and
D. Hermelin and
D. Shabtay},
title = {{SETH}-based Lower Bounds for Subset Sum and Bicriteria Path},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {1},
pages = {6:1--6:22},
year = {2022},
}
@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 = ""
}
@article{AbdHayVal2015,
title = {Mixed {R}oman domination in graphs},
journal = {Bull. Malays. Math. Sci. Soc.},
volume = {40},
pages = {1443--1454},
year = {2017},
author = {H. {Abdollahzadeh Ahangar} and T.~W. Haynes and J.~C. Valenzuela-Tripodoro}
}
@article{AbdHSY2016,
title = {Total {R}oman domination in graphs},
journal = {Applicable Analysis and Discrete Mathematics},
volume = {10},
pages = {501--517},
year = {2016},
author = {H. {Abdollahzadeh Ahangar} and M.~A. Henning and V. Samodivkin and I.~G. Yero}
}
@article{AbdCheShe2017,
title = {On the double {R}oman domination in graphs},
journal = dam,
volume = {232},
pages = {1--7},
year = {2017},
author = {H. {Abdollahzadeh Ahangar} and M. Chellali and S.~M. Sheikholeslami}
}
@article{AbdACSV2021,
title = {Triple {R}oman domination in graphs},
journal = {Applied Mathematics and Computation},
volume = {391},
pages = {125444},
year = {2021},
author = {H. {Abdollahzadeh Ahangar} and M.~P. \'Alvarez and M. Chellali and S.~M. Sheikholeslami and J.~C. Valenzuela-Tripodoro}}
@article{AbdHus2006,
author = {A. Abdullah and
A. Hussain},
title = {A new biclustering technique based on crossing minimization},
journal = {Neurocomputing},
volume = {69},
number = {16-18},
pages = {1882--1896},
year = {2006},
}
@article{AbdBar2015,
author = {A. Abdullah and
A. Barnawi},
title = {A Novel Crossing Minimization Ranking Method},
journal = {Applied Artificial Intelligence},
volume = {29},
number = {1},
pages = {66--99},
year = {2015},
}
@InProceedings{Abe88,
author = "N. Abe",
title = "Polynomial Learnability and Locality of Formal
Grammars",
year = "1988",
booktitle = "Proceedings of the 26$^{~th}$ ACL",
pages = "225--232",
}
@InProceedings{Abe88a,
author = "N. Abe",
title = "Feasible Learnability for Formal Grammars and the
Theory of Natural Language Acquisition",
year = "1988",
booktitle = "Proceedings of the 12$^{~th}$ COLING",
address = "Budapest, Hungary",
pages = "1--6",
}
@article{AbeWar92,
author = {N. Abe and
M. K. Warmuth},
title = {On the Computational Complexity of Approximating Distributions
by Probabilistic Automata},
journal = {Machine Learning},
volume = {9},
year = {1992},
pages = {205--260},
}
@article{AbeMam97,
author = {N. Abe and
H. Mamitsuka},
title = {Predicting Protein Secondary Structure Using Stochastic
Tree Grammars},
journal = {Machine Learning},
volume = {29},
year = {1997},
pages = {275--301},
}
@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{AbeFelSti91,
author = {J. Abello and M. R. Fellows and J. C. Stillwell},
title = {On the Complexity and Combinatorics of Covering Finite Complexes},
journal = {Austral. J. Combin.},
volume = 4,
pages = {103--112},
year = {1991}
}
@article{AbeKKV2017,
author = {J. Abello and
P. Klav{\'{\i}}k and
J. Kratochv{\'{\i}}l and
T. Vyskocil},
title = {{MSOL} restricted contractibility to planar graphs},
journal = tcs,
volume = {676},
pages = {1--14},
year = {2017},
}
@article{AbiPetAmj2015,
author = {M.~R. Abid and
E.~M. Petriu and
E. Amjadian},
title = {Dynamic Sign Language Recognition for Smart Home Interactive Application
Using Stochastic Linear Formal Grammar},
journal = {{IEEE} Trans. Instrumentation and Measurement},
volume = {64},
number = {3},
pages = {596--605},
year = {2015},
}
@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 = "LNCS",
volume = "1186",
publisher = "Springer",
pages = "351--363",
}
@article{AbiCluMil2002,
author = "S. Abiteboul and S. Cluet and T. Milo",
title = {Correspondence and translation for heterogeneous data},
journal = tcs,
volume = {275},
number = {1-2},
pages = {179--213},
year = {2002},
}
@inproceedings{AboHLMR2014,
author = {H. AbouEisha and
S. Hussain and
V. V. Lozin and
J. Monnot and
B. Ries},
title = {A Dichotomy for Upper Domination in Monogenic Classes},
booktitle = {Combinatorial Optimization and Applications - 8th International Conference,
{COCOA}},
pages = {258--267},
year = {2014},
editor = {Z. Zhang and
L. Wu and
W. Xu and
D.{-}Z. Du},
series = {LNCS},
volume = {8881},
publisher = {Springer},
}
@inproceedings{AboHLMR2016,
author = {H. AbouEisha and
S. Hussain and
V. V. Lozin and
J. Monnot and
B. Ries and
V. Zamaraev},
title = {A Boundary Property for {U}pper {D}omination},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA}},
pages = {229--240},
year = {2016},
editor = {V. M{\"{a}}kinen and
S. J. Puglisi and
L. Salmela},
series = {LNCS},
volume = {9843},
publisher = {Springer},
}
@ARTICLE{Abretal87,
AUTHOR = "J. A. Abraham and P. Banerjee and C.-Y. Chen and K.~W. Fuchs and S.-Y. Kuo and A.~L.~N. Reddy",
TITLE = "Fault tolerance techniques for systolic arrays",
JOURNAL = ieeecomp,
YEAR = 1987,
month = jul,
volume = "20",
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",
}
@inproceedings{Abr65a,
author = {S. Abraham},
title = {Some Questions of Language Theory},
booktitle = {First International Conference on Computational Linguistics, {COLING}},
year = {1965}, pages = {1--11}
}
@ARTICLE{Abr72,
AUTHOR = "S. Abraham",
TITLE = "Compound and serial grammars",
JOURNAL = icalt,
YEAR = 1972,
VOLUME = 20,
NUMBER = "",
PAGES = "432--438",
copy = ""
}
@inproceedings{AbrFel91,
author ="K.~A. Abrahamson and M. R. Fellows",
title = {Finite automata, bounded treewidth, and well-quasiordering},
booktitle = {Graph Structure Theory, Proceedings of a {AMS-IMS-SIAM} Joint Summer
Research Conference on Graph Minors held June 22 to July 5, 1991,
at the University of Washington, Seattle},
pages = {539--563},
editor = {N. Robertson and
P.~D. Seymour},
series = {Contemporary Mathematics},
year = {1993},
volume = {147},
publisher = {American Mathematical Society},
}
@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 = ""
}
@article{AbrCosMar2014,
title = "On complementary coverage of {$\Omega_n(T)$}",
journal = "Linear Algebra and its Applications",
volume = "442",
number = "0",
pages = "135--144",
year = "2014",
author = "N. Abreu and L. Costa and E.~A. Martins",
}
@article{AbuCarKat2015,
title = "Bottleneck {S}teiner tree with bounded number of {S}teiner vertices",
journal = jda,
volume = "30",
number = "",
pages = "96--100",
year = "2015",
author = "A.~K. Abu-Affash and P. Carmi and M.~J. Katz",
}
@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{AbuLan2007,
author = {F.~N. Abu{-}Khzam and
M. A. Langston},
title = {Linear-time algorithms for problems on planar graphs with fixed disk
dimension},
journal = ipl,
volume = {101},
number = {1},
pages = {36--40},
year = {2007},
}
@article{AbuFLS2007,
author = {F.~N. Abu{-}Khzam and
M.~R. Fellows and
M.~A. Langston and
W. H. Suters},
title = {Crown Structures for Vertex Cover Kernelization},
journal = tocs,
volume = {41},
number = {3},
pages = {411--430},
year = {2007},
}
@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},
}
@inproceedings{AbuLMN2010,
author = {F.~N. Abu-Khzam and
M.~A. Langston and
A.~E. Mouawad and
C.~P. Nolan},
title = {A Hybrid Graph Representation for Recursive Backtracking
Algorithms},
booktitle = {Frontiers in Algorithmics, 4th International Workshop, FAW},
year = {2010},
pages = {136--147},
editor = {D.-T. Lee and
D.~Z. Chen and
S. Ying},
publisher = {Springer},
series = {LNCS},
volume = {6213},
}
@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 = dopt,
volume = {8},
year = {2011},
pages = {41--49},
}
@article{AbuMouLie2011,
author = {F.~N. Abu{-}Khzam and
A.~E. Mouawad and
M. Liedloff},
title = {An exact algorithm for connected red-blue dominating set},
journal = jda,
volume = {9},
number = {3},
pages = {252--262},
year = {2011},
}
@InProceedings{AbuBCF2014,
author = {F.~N. Abu-Khzam and C. Bazgan and M. Chopin and H. Fernau},
title = {Approximation Algorithms Inspired by Kernelization Methods},
booktitle = {Algorithms and Computation --- 25th International Symposium, ISAAC 2014},
pages = {479--490},
year = {2014},
editor = {H.-K. Ahn and C.-S. Shin},
volume = {8889},
series = {LNCS},
publisher = {Springer},
}
@inproceedings{AbuEFRS2014,
author = {F.~N. Abu{-}Khzam and
J. Egan and
M. R. Fellows and
F. A. Rosamond and
P. Shaw},
title = {On the Parameterized Complexity of Dynamic Problems with Connectivity
Constraints},
booktitle = {Combinatorial Optimization and Applications - 8th International Conference,
{COCOA}},
pages = {625--636},
editor = {Z. Zhang and
L. Wu and
W. Xu and
D.{-}Z. Du},
series = {LNCS},
volume = {8881},
publisher = {Springer},
year = {2014},
}
@article{AbuEFRS2015,
author = {F.~N. Abu{-}Khzam and
J. Egan and
M.~R. Fellows and
F.~A. Rosamond and
P. Shaw},
title = {On the parameterized complexity of dynamic problems},
journal = tcs,
volume = {607},
pages = {426--434},
year = {2015},
}
@article{AbuDMN2015,
author = {F. N. Abu{-}Khzam and
K. Daudjee and
A. E. Mouawad and
N. Nishimura},
title = {On scalable parallel recursive backtracking},
journal = {J. Parallel Distrib. Comput.},
volume = {84},
pages = {65--75},
year = {2015},
}
@article{AbuHeg2016,
author = {F.~N. Abu{-}Khzam and
P. Heggernes},
title = {Enumerating minimal dominating sets in chordal graphs},
journal = ipl,
volume = {116},
number = {12},
pages = {739--743},
year = {2016},
}
@article{AbuBCF2016,
author = {F.~N. Abu-Khzam and C. Bazgan and M. Chopin and H. Fernau},
title = "Data reductions and combinatorial bounds for improved approximation algorithms",
journal = jcss,
volume = "82",
number = "3",
pages = "503--520",
year = "2016",}
@inproceedings{AbuBCF2016a,
author = {F.~N. Abu{-}Khzam and
C. Bazgan and
K. Casel and
H. Fernau},
title = {Building Clusters with Lower-Bounded Sizes},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}},
pages = {4:1--4:13},
year = {2016},
editor = {S.{-}H. Hong},
series = {LIPIcs},
volume = {64},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
}
@inproceedings{AbuLMHP2016,
author = {F.~N. Abu{-}Khzam and
S. Li and
C. Markarian and
F. {Meyer auf der Heide} and
P. Podlipyan},
title = {The Monotone Circuit Value Problem with Bounded Genus Is in {NC}},
booktitle = {Computing and Combinatorics - 22nd International Conference, {COCOON}},
pages = {92--102},
editor = {T.~N. Dinh and
M.~T. Thai},
series = {LNCS},
volume = {9797},
publisher = {Springer},
year = {2016},
}
@inproceedings{AbuLMHP2016a,
author = {F.~N. Abu{-}Khzam and
S. Li and
C. Markarian and
F. {Meyer auf der Heide} and
P. Podlipyan},
title = {On the Parameterized Parallel Complexity and the Vertex Cover Problem},
booktitle = {Combinatorial Optimization and Applications - 10th International Conference,
{COCOA}},
pages = {477--488},
editor = {T.{-}H. H. Chan and
M. Li and
L. Wang},
series = {LNCS},
volume = {10043},
publisher = {Springer},
year = {2016},
}
@article{AbuBCF2018,
author = {F.~N. Abu{-}Khzam and
C. Bazgan and
K. Casel and
H. Fernau},
title = {Clustering with Lower-Bounded Sizes - {A} General Graph-Theoretic
Framework},
journal = alg,
volume = {80},
number = {9},
pages = {2517--2550},
year = {2018},
}
@inproceedings{AbuEGSS2018,
author = {F.~N. Abu{-}Khzam and
J. Egan and
S. Gaspers and
A. Shaw and
P. Shaw},
title = {Cluster Editing with Vertex Splitting},
booktitle = {Combinatorial Optimization - 5th International Symposium, {ISCO}},
pages = {1--13},
year = {2018},
editor = {J. Lee and
G. Rinaldi and
A. Ridha Mahjoub},
series = {LNCS},
volume = {10856},
publisher = {Springer},
}
@INPROCEEDINGS{AbuKPWS2018,
author={F.~N. Abu-Khzam and D. Kim and M. Perry and K. Wang and P. Shaw},
booktitle={18th {IEEE/ACM} International Symposium on Cluster, Cloud and Grid
Computing, {CCGRID}},
title={Accelerating Vertex Cover Optimization on a GPU Architecture},
year={2018},
pages={616--625},
editor = {E. El{-}Araby and
D. K. Panda and
S. Gesing and
A. W. Apon and
V. V. Kindratenko and
M. Cafaro and
A. Cuzzocrea},
publisher = {{IEEE} Computer Society}}
@inproceedings{AbuBazFer2020,
author = {F.~N. Abu{-}Khzam and
C. Bazgan and
H. Fernau},
title = {Parameterized Dynamic Variants of Red-Blue Dominating Set},
pages = {236--247},
editor = {A. Chatzigeorgiou and
R. Dondi and
H. Herodotou and
C. A. Kapoutsis and
Y. Manolopoulos and
G. A. Papadopoulos and
F. Sikora},
booktitle = {Theory and Practice of Computer Science - 46th International
Conference on Current Trends in Theory and Practice of Informatics,
{SOFSEM}},
series = {LNCS},
volume = {12011},
publisher = {Springer},
year = {2020},
}
@inproceedings{AbuAhmMou2020,
author = {F.~N. Abu{-}Khzam and
A. H. Ahmad and
R. H. Mouawi},
editor = {A. Bilgin and
M.~W. Marcellin and
J. Serra{-}Sagrist{\`{a}} and
J. A. Storer},
title = {Concise Fuzzy Representation of Big Graphs: {A} Dimensionality Reduction
Approach},
booktitle = {Data Compression Conference, {DCC}},
pages = {356},
publisher = {{IEEE}},
year = {2020},
}
@article{AbuFegHeg2020,
author = {F. N. Abu{-}Khzam and
C. Feghali and
P. Heggernes},
title = {Partitioning a graph into degenerate subgraphs},
journal = {Eur. J. Comb.},
volume = {83},
year = {2020},
}
@techreport{Abu2021,
author = {F.~N. Abu{-}Khzam},
title = {A Note on the Maximum Number of Minimal Connected Dominating Sets
in a Graph},
institution = {Cornell University, ArXiv/CoRR},
number = {2111.06026},
year = {2021},
url = {https://arxiv.org/abs/2111.06026},
}
@techreport{AbuFerMan2022,
author = {F.~N. Abu{-}Khzam and
H. Fernau and
K. Mann},
title = {Minimal {R}oman Dominating Functions: Extensions and Enumeration},
institution = {Cornell University, ArXiv/CoRR},
number = {2204.04765},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.04765},
}
@inproceedings{AbuFerMan2022b,
author = {F.~N. Abu{-}Khzam and
H. Fernau and
K. Mann},
editor = {M. A. Bekos and
M. Kaufmann},
title = {Minimal {R}oman Dominating Functions: Extensions and Enumeration},
booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International
Workshop, {WG}},
series = {LNCS},
volume = {13453},
pages = {1--15},
publisher = {Springer},
year = {2022},
ydoi = {10.1007/978-3-031-15914-5\_1},
}
@techreport{AbuFGLM2022,
author = {F.~N. Abu{-}Khzam and
H. Fernau and
B. Gras and
M. Liedloff and
K. Mann},
title = {Enumerating Connected Dominating Sets},
institution = {Cornell University, ArXiv/CoRR},
volume = {abs/2205.00086},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.00086},
}
@techreport{AbuFerMan2022a,
url = {https://arxiv.org/abs/2208.05261},
author = {F.~N. Abu{-}Khzam and
H. Fernau and
K. Mann},
title = {Roman Census: Enumerating and Counting {R}oman Dominating Functions on Graph Classes},
institution = {Cornell University, ArXiv/CoRR},
number = {2208.05261},
year = {2022},
}
@InProceedings{AbuFGLM2022a,
author = {Abu-Khzam, F.~N. and Fernau, H. and Gras, B. and Liedloff, M. and Mann, K.},
title = {Enumerating Minimal Connected Dominating Sets},
booktitle = {30th Annual European Symposium on Algorithms, ESA},
pages = {1:1--1:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-247-1},
ISSN = {1868-8969},
year = {2022},
volume = {244},
editor = {Chechik, S. and Navarro, G. and Rotenberg, E. and Herman, G.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
ydoi = {10.4230/LIPIcs.ESA.2022.1},
}
@incollection{AbuLMNSS2022,
author = {F.~N. Abu{-}Khzam and
S. Lamm and
M. Mnich and
A. Noe and
C. Schulz and
D. Strash},
title = {Recent Advances in Practical Data Reduction},
editor = {H. Bast and
C. Korzen and
U. Meyer and
M. Penschuck},
title = {The Space Complexity of Undirected Graph Exploration},
booktitle = {Algorithms for Big Data - {DFG} Priority Program 1736},
series = {LNCS},
volume = {13201},
pages = {152--166},
publisher = {Springer},
year = {2022},
}
@InProceedings{AbuFerMan2023,
author = {Abu-Khzam, F.~N. and Fernau, H. and Mann, K.},
title = {Roman Census: Enumerating and Counting {R}oman Dominating Functions on Graph Classes},
booktitle = {48th International Symposium on Mathematical Foundations of Computer Science, MFCS},
pages = {6:1--6:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
yISBN = {978-3-95977-292-1},
yISSN = {1868-8969},
year = {2023},
volume = {272},
editor = {Leroux, J. and Lombardy, S. and Peleg, D.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
ydoi = {10.4230/LIPIcs.MFCS.2023.6},
}
@article{AcaBleHar2006,
author = {Acar, U.~A. and Blelloch, G.~E. and Harper, R.},
title = {Adaptive Functional Programming},
journal = {ACM Transactions on Programming Languages and Systems},
volume = {28},
number = {6},
month = nov,
year = {2006},
numpages = {45},
}
@INPROCEEDINGS{AccAnc99,
AUTHOR = "A. Accornero and M. Ancona",
TITLE = "All separating triangles in a plane graph can be optimally ``broken'' in polynomial time",
BOOKTITLE = "Proceedings WG'99",
YEAR = 1999,
month = "",
volume = "1665",
editor = "P. Widmayer and others",
series = "LNCS",
chapter = "",
pages = "289--296",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@article{AchHeg89,
author = {Acharya, B. D. and Hegde, S. M.},
title = {Arithmetic graphs},
journal = jgth,
volume = {14},
number = {3},
pages = {275--299},
year = {1989}
}
@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{Ach2007,
author ="B.~D. Acharya",
title ="Domination in Hypergraphs",
journal = {AKCE International Journal
of Graphs and Combinatorics},
volume ="4",
number ="2",
pages ="117--126",
year ="2007",
}
@article{AchKurZas2021,
author = {M. Acharya and
J.~V. Kureethara and
T. Zaslavsky},
title = {Characterizations of some parity signed graphs},
journal = {Australasian Journal of Combinatorics},
volume = {81},
pages = {89--100},
year = {2021},
yurl = {http://ajc.maths.uq.edu.au/pdf/81/ajc\_v81\_p089.pdf},
}
@article{Ach97,
author = {D. Achlioptas},
title = {The complexity of {$G$}-free colourability},
journal = dm,
volume = {165-166},
pages = {21--30},
year = {1997},
}
@Article{AchMoo2006,
author = {D. Achlioptas and C. Moore},
title = {Random {$k$-SAT}: Two Moments Suffice To Cross A Sharp Threshold},
journal = siam,
year = {2006},
OPTkey = {},
volume = {36},
OPTnumber = {},
pages = {740--762},
}
@inproceedings{AckMak2009,
author = {M. Ackerman and
E. M{\"{a}}kinen},
title = {Three New Algorithms for Regular Language Enumeration},
booktitle = {Computing and Combinatorics, 15th Annual International Conference,
{COCOON}},
pages = {178--191},
year = {2009},
editor = {H. Q. Ngo},
series = {LNCS},
volume = {5609},
publisher = {Springer},
}
@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},
}
@article{AdamsBDL2000,
author = {P. Adams and
E.~J. Billington and
I.~J. Dejter and
C.~C. Lindner},
title = {The number of 4-cycles in 2-factorizations of {$K_{2n}$} minus a 1-factor},
journal = dm,
volume = {220},
number = {1-3},
year = {2000},
pages = {1--11},
}
@inproceedings{AdaDGP2023,
author = {D. Adamson and
A. Deligkas and
V. V. Gusev and
I. Potapov},
editor = {L. Gasieniec},
title = {The $k$-Centre Problem for Classes of Cyclic Words},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science},
series = {LNCS},
volume = {13878},
pages = {385--400},
publisher = {Springer},
year = {2023},
}
@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{AdaHMMSTW2017,
author = {K.~L. M. Adamyk and
E.~C. Holmes and
G. R. Mayfield and
D. J. Moritz and
M. Scheepers and
B. E. Tenner and
H. C. Wauck},
title = {Sorting permutations: Games, genomes, and cycles},
journal = dmaa,
volume = {9},
number = {5},
pages = {1--31},
year = {2017},
}
@article{AdcDDORVS2015,
author = {A.~B. Adcock and
E.~D. Demaine and
M. L. Demaine and
M. P. O'Brien and
F. Reidl and
F. S\'anchez Villaamil and
B. D. Sullivan},
title = {Zig-Zag Numberlink is {NP}-Complete},
journal = {Journal of Information Processing},
volume = {23},
number = {3},
pages = {239--245},
year = {2015},
}
@article{AdcSulMeh2016,
author = {A.~B. Adcock and
B.~D. Sullivan and
M.~W. Mahoney},
title = {Tree decompositions and social graphs},
journal = {Internet Mathematics},
volume = {12},
number = {5},
pages = {315--361},
year = {2016},
}
@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 = {},
OPTdoi = {},
}
@inproceedings{AdiChiSau2010,
author = {A. Adiga and
R. 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{AdiBhoCha2011,
author = {Adiga, A. and Bhowmick, D. and Chandran, L.},
title = {Boxicity and Poset Dimension},
journal = siamdm,
volume = {25},
number = {4},
pages = {1687--1698},
year = {2011},
}
@article{AdiKMRRS2017,
title = "Inferring local transition functions of discrete dynamical systems from observations of system behavior",
journal = tcs,
volume = "679",
pages = "126--144",
year = "2017",
author = "A. Adiga and C. J. Kuhlman and M.~V. Marathe and S.~S. Ravi and D.~J. Rosenkrantz and R.~E. Stearns",
}
@inproceedings{AdjHMS2022,
author = {D. Adjiashvili and
F. Hommelsheim and
M. M{\"{u}}hlenthaler and
O. Schaudt},
editor = {A. Czumaj and
Q. Xin},
title = {Fault-Tolerant Edge-Disjoint $s-t$ Paths - Beyond Uniform Faults},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}},
series = {LIPIcs},
volume = {227},
pages = {5:1--5:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
ydoi = {10.4230/LIPIcs.SWAT.2022.5},
}
@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{AdlBPR78,
author = {L.~M. Adleman and
K.~S. Booth and
F.~P. Preparata and
W.~L. Ruzzo},
title = {Improved Time and Space Bounds for {B}oolean Matrix Multiplication},
journal = actainform,
volume = {11},
pages = {61--77},
year = {1978},
}
@article {Adl94,
author = {Adleman, L.~M.},
title = {Molecular computation of solutions to combinatorial problems},
volume = {266},
number = {5187},
pages = {1021--1024},
year = {1994},
doi = {10.1126/science.7973651},
publisher = {American Association for the Advancement of Science},
journal = {Science}
}
@InProceedings{AdlDasDem2016,
author ={A. Adler and C. Daskalakis and E.~D. Demaine},
title ={The Complexity of {H}ex and the {J}ordan Curve Theorem},
pages ={24:1--24:14},
booktitle = {International Colloquium on Automata, Languages and Programming, ICALP},
year = {2016},
editor = {I. Chatzigiannakis and
M. Mitzenmacher and
Y. Rabani and
D. Sangiorgi},
volume = {55},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@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{Adl2004,
author = {I. Adler},
title = {Marshals, monotone marshals, and hypertree-width},
journal = jgth,
volume = {47},
number = {4},
year = {2004},
pages = {275--296},
}
@article{Adl2007,
author = {I. Adler},
title = {Directed tree-width examples},
journal = jcthb,
volume = {97},
number = {5},
year = {2007},
pages = {718--725},
}
@article{AdlGotGro2007,
author = {I. Adler and
G. Gottlob and
M. Grohe},
title = {Hypertree width and related hypergraph invariants},
journal = {Eur. J. Comb.},
volume = {28},
number = {8},
year = {2007},
pages = {2167--2181},
}
@article{Adl2008,
author = {I. Adler},
title = {Tree-Related Widths of Graphs and Hypergraphs},
journal = siamdm,
volume = {22},
number = {1},
year = {2008},
pages = {102--123},
}
@inproceedings{Adl2008a,
author = {I. Adler},
title = {Tree-width and functional dependencies in databases},
booktitle = {Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART
Symposium on Principles of Database Systems, PODS},
year = {2008},
pages = {311--320},
editor = {M. Lenzerini and
D. Lembo},
publisher = {ACM Press},
}
@article{AdlFarPro2014,
author = {I. Adler and
A. M. Farley and
A. Proskurowski},
title = {Obstructions for linear rank-width at most 1},
journal = dam,
volume = {168},
pages = {3--13},
year = {2014},
}
@article{AdlKan2015,
author = {I. Adler and
M.~M. Kant{\'{e}}},
title = {Linear rank-width and linear clique-width of trees},
journal = tcs,
volume = {589},
pages = {87--98},
year = {2015},
}
@article{AdlBHS2015,
author = {A. Adler and
M. de Berg and
D. Halperin and
K. Solovey},
title = {Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple
Polygons},
journal = {{IEEE} Trans. Automation Science and Engineering},
volume = {12},
number = {4},
pages = {1309--1317},
year = {2015},
}
@article{AdlKanKwo2017,
author = {I. Adler and
M. Moustapha Kant{\'{e}} and
O{-}j. Kwon},
title = {Linear Rank-Width of Distance-Hereditary Graphs {I}. {A} Polynomial-Time
Algorithm},
journal = alg,
volume = {78},
number = {1},
pages = {342--377},
year = {2017},
}
@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{AfrChi2011,
author = {F.~N. Afrati and
R. Chirkova},
title = {Selecting and using views to compute aggregate queries},
journal = jcss,
volume = {77},
number = {6},
year = {2011},
pages = {1079--1107},
}
@article{AfsTay2014,
author = {M.~M. Afsar and
M.{-}H. Tayarani{-}N.},
title = {Clustering in sensor networks: {A} literature survey},
journal = {Journal of Network and Computer Applications},
volume = {46},
pages = {198--226},
year = {2014},
}
@inproceedings{AgaCMM2005,
author = {A. Agarwal and
M. Charikar and
K. Makarychev and
Y. Makarychev},
title = {{$O(\sqrt{\log n})$} approximation algorithms for {M}in {UnCut}, {M}in
{2CNF} deletion, and directed cut problems},
booktitle = {Proceedings of the 37th Annual ACM Symposium on Theory of
Computing, STOC},
year = {2005},
pages = {573--581},
editor = {H.~N. Gabow and
R. Fagin},
publisher = {ACM Press},
}
@ARTICLE{AgaPro02,
AUTHOR = "P.~K. Agarwal and C.~M. Procopiuc",
TITLE = "Exact and approximate algorithms for clustering",
JOURNAL = alg,
YEAR = 2002,
month = "",
volume = 33,
number = "",
pages = "201--226",
copy = ""
}
@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},
}
@inproceedings{AgaRam2016,
author = {U. Agarwal and
V. Ramachandran},
editor = {S.{-}H. Hong},
title = {Finding $k$ Simple Shortest Paths and Cycles},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}},
series = {LIPIcs},
volume = {64},
pages = {8:1--8:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
ydoi = {10.4230/LIPIcs.ISAAC.2016.8},
}
@Article{AgeKelPya2014,
author = {Ageev, A. A. and Kel'manov, A. V. and Pyatkin, A. V.},
title = {Complexity of the max-cut problem in a {E}uclidean space (in {R}ussian)},
journal = {Diskretn. Anal. Issled. Oper.},
year = {2014},
volume = {21},
number = {4},
pages = {3--11},
}
@Article{AgeKelPya2014a,
author = {Ageev, A. A. and Kel'manov, A. V. and Pyatkin, A. V.},
title = {{NP} Hardness of the {E}uclidean Max Cut Problem},
journal = {Doklady Akademii Nauk},
year = {2014},
volume = {456},
number = {5},
pages = {511--513},
}
@article{Age2019,
author = {P. Ageev},
title = {Implementation of the Algorithm for Testing an Automaton for Synchronization
in Linear Expected Time},
journal = jalc,
volume = {24},
number = {2-4},
pages = {139--152},
year = {2019},
}
@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 = {Available from http://www.jopt.org/papers.html}
}
@article{AggPFTKKZ2010,
author = {G. Aggarwal and
R. Panigrahy and
T. Feder and
D. Thomas and
K. Kenthapadi and
S. Khuller and
An Zhu},
title = {Achieving anonymity via clustering},
journal = acmtalg,
volume = {6},
number = {3},
year = {2010},
}
@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},
}
@inproceedings{AgrGunLey98,
author = {R. Agrawal and
D. Gunopulos and
F. Leymann},
editor = {H.{-}J. Schek and
F. Saltor and
I. Ramos and
G. Alonso},
title = {Mining Process Models from Workflow Logs},
booktitle = {Advances in Database Technology - EDBT'98, 6th International Conference
on Extending Database Technology},
series = {LNCS},
volume = {1377},
pages = {469--483},
publisher = {Springer},
year = {1998},
ydoi = {10.1007/BFb0101003},
}
@inproceedings{AgrGovMis2014,
author = {A. Agrawal and
S. Govindarajan and
N. Misra},
title = {Vertex Cover Gets Faster and Harder on Low Degree Graphs},
booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON}},
pages = {179--190},
year = {2014},
editor = {Z. Cai and
A. Zelikovsky and
A. G. Bourgeois},
series = {LNCS},
volume = {8591},
publisher = {Springer},
}
@inproceedings{AgrGSS2016,
author = {A. Agrawal and
S. Gupta and
S. Saurabh and
R. Sharma},
title = {Improved Algorithms and Combinatorial Bounds for Independent Feedback
Vertex Set},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC}},
pages = {2:1--2:14},
editor = {J. Guo and
D. Hermelin},
series = {LIPIcs},
volume = {63},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2016},
}
@inproceedings{AgrSSZ2016,
author = {A. Agrawal and
S. Saurabh and
R. Sharma and
M. Zehavi},
title = {Kernels for Deletion to Classes of Acyclic Digraphs},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}},
pages = {6:1--6:12},
editor = {S.{-}H. Hong},
series = {LIPIcs},
volume = {64},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2016},
}
@InProceedings{AgrLMSZ2018,
author ={A. Agrawal and D. Lokshtanov and P. Misra and S. Saurabh and M. Zehavi},
title ={{Erd{\"o}s-P{\'o}sa Property of Obstructions to Interval Graphs}},
booktitle ={35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages ={7:1--7:15},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2018},
volume ={96},
editor ={R. Niedermeier and B. Vall{\'e}e},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@article{AgrSZ2018,
author = {A. Agrawal and
S. Saurabh and
R. Sharma and
M. Zehavi},
title = {Parameterised Algorithms for Deletion to Classes of {DAG}s},
journal = tocs,
volume = {62},
number = {8},
pages = {1880--1909},
year = {2018},
}
@article{AgrSZ2018a,
author = {A. Agrawal and
S. Saurabh and
R. Sharma and
M. Zehavi},
title = {Kernels for deletion to classes of acyclic digraphs},
journal = jcss,
volume = {92},
pages = {9--21},
year = {2018},
}
@inproceedings{AgrGMSZ2019,
author = {A. Agrawal and
G. Guspiel and
J. Madathil and
S. Saurabh and
M. Zehavi},
editor = {G. Barequet and
Y. Wang},
title = {Connecting the Dots (with Minimum Crossings)},
booktitle = {35th International Symposium on Computational Geometry, SoCG},
series = {LIPIcs},
volume = {129},
pages = {7:1--7:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
ydoi = {10.4230/LIPIcs.SoCG.2019.7},
}
@article{AgrFKMS2024,
title = {Recognizing well-dominated graphs is {coNP}-complete},
journal = ipl,
volume = {183},
pages = {106419},
year = {2024},
yissn = {0020-0190},
ydoi = {https://doi.org/10.1016/j.ipl.2023.106419},
author = {A. Agrawal and H. Fernau and P. Kindermann and K. Mann and U.~S. Souza},
}
@article{Aguetal2018,
author = {R. {\'{A}}gueda and
N. Cohen and
S. Fujita and
S. Legay and
Y. Manoussakis and
Y. Matsui and
L. Montero and
R. Naserasr and
H. Ono and
Y. Otachi and
T.Sakuma and
Zs. Tuza and
R. Xu},
title = {Safe sets in graphs: Graph classes and structural parameters},
journal = joco,
volume = {36},
number = {4},
pages = {1221--1242},
year = {2018},
}
@article{AhmIslRah2013,
author = {P. Ahmed and
A.~S.~M.~S. Islam and
M.~S. Rahman},
title = {A graph-theoretic model to solve the approximate string matching problem
allowing for translocations},
journal = jda,
volume = {23},
pages = {143--156},
year = {2013},
}
@article{AhmIIR2014,
title = "The swap matching problem revisited",
journal = tcs,
volume = "557",
pages = "34--49",
year = "2014",
author = "P. Ahmed and C.~S. Iliopoulos and A.~S.~M.~S. Islam and M.~S. Rahman",}
@inproceedings{AhmKobKry2022,
author = {A.~R. Ahmed and
S. G. Kobourov and
M. Kryven},
editor = {P. Angelini and
R. von Hanxleden},
title = {An {FPT} Algorithm for Bipartite Vertex Splitting},
booktitle = {Graph Drawing and Network Visualization - 30th International Symposium,
{GD}},
series = {LNCS},
volume = {13764},
pages = {261--268},
publisher = {Springer},
year = {2022},
ydoi = {10.1007/978-3-031-22203-0\_19},
}
@article{AhmABBKKKNSVW2023,
author = {A.~R. Ahmed and
P. Angelini and
M.~A. Bekos and
G. Di Battista and
M. Kaufmann and
P. Kindermann and
S. G. Kobourov and
M. N{\"{o}}llenburg and
A. Symvonis and
A. Villedieu and
M. Wallinger},
title = {Splitting Vertices in 2-Layer Graph Drawings},
journal = {{IEEE} Computer Graphics and Applications},
volume = {43},
number = {3},
pages = {24--35},
year = {2023},
ydoi = {10.1109/MCG.2023.3264244},
}
@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 = ""
}
@article{AhoGarUll72,
AUTHOR = {Aho, A.~V. and Garey, M.~R. and Ullman, J.~D.},
TITLE = {The transitive reduction of a directed graph},
JOURNAL = siam,
VOLUME = {1},
YEAR = {1972},
NUMBER = {2},
PAGES = {131--137},
}
@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 = {},
OPTdoi = {},
}
@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 = ""
}
@article{AicMulPil2015,
author = {O. Aichholzer and
W. Mulzer and
A. Pilz},
title = {Flip Distance Between Triangulations of a Simple Polygon is {NP}-Complete},
journal = {Discrete {\&} Computational Geometry},
volume = {54},
number = {2},
pages = {368--389},
year = {2015},
}
@article{AigFro84,
author = {M. Aigner and
M. Fromme},
title = {A game of cops and robbers},
journal = dam,
volume = {8},
number = {1},
pages = {1--12},
year = {1984},
}
@article{Aig86,
author = {M. Aigner},
title = {Search problems on graphs},
journal = dam,
volume = {14},
number = {3},
pages = {215--230},
year = {1986},
}
@article{Aig98,
author = {M. Aigner},
title = {Motzkin Numbers},
journal = ejc,
volume = {19},
number = {6},
pages = {663--675},
year = {1998},
}
@article{Aig99,
author = {M. Aigner},
title = {Catalan-like Numbers and Determinants},
journal = jctha,
volume = {87},
number = {1},
pages = {33--51},
year = {1999},
}
@article{Aig99a,
author = {M. Aigner},
title = {A Characterization of the {B}ell numbers},
journal = dm,
volume = {205},
number = {1-3},
pages = {207--210},
year = {1999},
}
@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{Aiketal2004,
author = {K. Aikou and
Y. Suzuki and
T. Shoudai and
T. Miyahara},
title = {Automatic Wrapper Generation for Metasearch Using Ordered
Tree Structured Patterns},
booktitle = {AI 2004: Advances in Artificial Intelligence, 17th Australian
Joint Conference on Artificial Intelligence},
year = {2004},
pages = {1030--1035},
editor = {G. I. Webb and
X. Yu},
publisher = {Springer},
series = {LNCS},
volume = {3339},
}
@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{AilChaNew2008,
author = {Ailon, N. and Charikar, M. and Newman,
A.},
title = {Aggregating inconsistent information: Ranking
and clustering},
journal = jacm,
volume = 55,
number = 5,
year = 2008,
pages = {23:1--23:27},
publisher = {ACM},
}
@article{AIM2008,
author = {AIM Minimum Rank Special Graphs Work Group},
title = {Zero forcing sets and the minimum rank of graphs},
journal = {Linear Algebra and its Applications},
volume = 428,
year = 2008,
pages = {1628--1648},
}
@article{Ais2022,
author = {Aiswarya, C.},
title = {How Treewidth Helps in Verification},
year = {2022},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {9},
number = {1},
doi = {10.1145/3527540.3527542},
journal = {ACM SIGLOG News},
month = {mar},
pages = {6--21},
numpages = {16}
}
@inproceedings{AioMSM2007,
author = {F. Aiolli and
G. Da San Martino and
A. Sperduti and
A. Moschitti},
title = {Efficient Kernel-based Learning for Trees},
booktitle = {Proceedings of the IEEE Symposium on Computational Intelligence
and Data Mining, CIDM},
year = {2007},
pages = {308--315},
publisher = {IEEE},
}
@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 = ""
}
@INPROCEEDINGS{AjaCoh2019,
author={Ajami, Z. and Cohen, S.},
booktitle={2019 IEEE 35th International Conference on Data Engineering, ICDE},
title={Enumerating Minimal Weight Set Covers},
year={2019},
pages={518--529},
publisher = {{IEEE}},
ydoi = {10.1109/ICDE.2019.00053},
}
@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{AkbMey2012,
author="Akbari Torkestani, J.
and Meybodi, M.~R.",
title="A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs",
journal="The Journal of Supercomputing",
year="2012",
volume="59",
number="2",
pages="1035--1054",
}
@article{AkbMey2012a,
author="Akbari Torkestani, J.
and Meybodi, M.~R.",
title = "Finding minimum weight connected dominating set in stochastic graph based on learning automata",
journal = "Information Sciences",
volume = "200",
number = "",
pages = "57--77",
year = "2012",
}
@article{AkbMMY2018,
author = {S. Akbari and
M. Motiei and
S. Mozaffari and
S. Yazdanbod},
title = {Cubic Graphs with Total Domatic Number at Least Two},
journal = {Discussiones Mathematicae Graph Theory},
volume = {38},
pages = {75--82},
year = {2018},
ydoi = {10.7151/dmgt.1996},
}
@article{AkbDHM2020,
author = {S. Akbari and
S. Dalvandi and
F. Heydari and
M. Maghasedi},
title = {Signed complete graphs with maximum index},
journal = {Discussiones Mathematicae Graph Theory},
volume = {40},
number = {2},
pages = {393--403},
year = {2020},
ydoi = {10.7151/dmgt.2276},
}
@Article{AkgTan2010,
author = {I. Akg\"un and B.~\c{C}. Tansel},
title = {Min-degree constrained minimum spanning tree problem: New formulation via
{M}iller-{T}ucker-{Z}emlin constraints},
journal = {Computers \& Operations Research},
year = {2010},
volume = {37},
pages = {72--82},
}
@article{AkgGKZ2019,
author = {{\"{O}}. Akg{\"{u}}n and
I. P. Gent and
S. Kitaev and
H. Zantema},
title = {Solving Computational Problems in the Theory of Word-Representable
Graphs},
journal = {Journal of Integer Sequences},
volume = {22},
number = {2},
pages = {19.2.5},
year = {2019},
}
@Article{AkhHFKS2013,
author = {M.~H. Akhbari and R. Hasni and O. Favaron and
H. Karami and S.~M. Sheikholeslami},
title = {On the outer-connected domination in graphs},
journal = joco,
year = {2013},
volume = {26},
pages = {10--18},
}
@inproceedings{AkiIwa2015,
author = {T. Akiba and
Y. Iwata},
title = {Branch-and-Reduce Exponential/{FPT} Algorithms in Practice: a Case
Study of Vertex Cover},
booktitle = {Proceedings of the Seventeenth Workshop on Algorithm Engineering and
Experiments, {ALENEX}},
pages = {70--81},
year = {2015},
editor = {U. Brandes and
D. Eppstein},
publisher = {{SIAM}}
}
@article{AkiIwa2016,
author = {T. Akiba and
Y. Iwata},
title = {Branch-and-Reduce Exponential/{FPT} Algorithms in Practice: a Case
Study of Vertex Cover},
journal = tcs,
volume = {609},
pages = {211--225},
year = {2016},
}
@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{AkiACE81,
title = {Balancing signed graphs},
journal = dam,
volume = {3},
number = {4},
pages = {227--233},
year = {1981},
author = {J. Akiyama and D. Avis and V. Chvátal and H. Era},}
@MastersThesis{Akr2022,
author = {M. Akram},
title = {On Difference-Labellings
for Directed Graphs},
school = {Karlsruhe Institute of Technology, Germany},
year = {2022},type = {Bachelor Thesis},
}
@article{AkrCGKS2019,
title = {Temporal flows in temporal networks},
journal = jcss,
volume = {103},
pages = {46--60},
year = {2019},
author = {E.~C. Akrida and J. Czyzowicz and L. Gąsieniec and \L. Kuszner and P.~G. Spirakis},}
@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 = ""
}
@article{AksBMSST2005,
author = {V.~A. Aksionov and
O.~V. Borodin and
L.~S. Melnikov and
G. Sabidussi and
M. Stiebitz and
B. Toft},
title = {Deeply asymmetric planar graphs},
journal = jcthb,
volume = {95},
number = {1},
pages = {68--78},
year = {2005},
}
@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}
}
@article{AkuTak94,
author = {T. Akutsu and
A. Takasu},
title = {On {PAC} Learnability of Functional Depencies},
journal = {New Gener. Comput.},
volume = {12},
number = {4},
pages = {359--374},
year = {1994},
}
@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 = ""
}
@inproceedings{AkuBao96,
author = {T. Akutsu and
F. Bao},
editor = {J.{-}y. Cai and
C. K. Wong},
title = {Approximating Minimum Keys and Optimal Substructure Screens},
booktitle = {Computing and Combinatorics, Second Annual International Conference,
{COCOON}},
series = {LNCS},
volume = {1090},
pages = {290--299},
publisher = {Springer},
year = {1996},
}
@article{Aku99,
author = {T. Akutsu},
title = {Approximation and Exact Algorithms for {RNA} Secondary Structure Prediction
and Recognition of Stochastic Context-free Languages},
journal = joco,
volume = {3},
number = {2-3},
pages = {321--336},
year = {1999},
}
@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{Aku2010,
title = "A bisection algorithm for grammar-based compression of ordered trees",
journal = ipl,
volume = "110",
number = "18-19",
pages = "815--820",
year = "2010",
author = "T. Akutsu",
}
@article{AkuTMT2015,
author = {T. Akutsu and
T. Tamura and
A. A. Melkman and
A. Takasu},
title = {On the complexity of finding a largest common subtree of bounded degree},
journal = tcs,
volume = {590},
pages = {2--16},
year = {2015},
}
@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 {R}ussian)",
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 {R}ussian)",
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},
}
@inproceedings{AlaGNB2019,
author = {J.~N. Alanko and
T. Gagie and
G. Navarro and
L. Seelbach Benkner},
editor = {A. Bilgin and
M. W. Marcellin and
J. Serra{-}Sagrist{\`{a}} and
J. A. Storer},
title = {Tunneling on {W}heeler Graphs},
booktitle = {Data Compression Conference, {DCC}},
pages = {122--131},
publisher = {{IEEE}},
year = {2019},
}
@inproceedings{AlaDPP2020,
author = {J. Alanko and
Gi. D'Agostino and
A. Policriti and
N. Prezza},
editor = {S. Chawla},
title = {Regular Languages meet Prefix Sorting},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA}},
pages = {911--930},
publisher = {{SIAM}},
year = {2020},
}
@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",
YEAR = 2001,
month = "",
volume = "2136",
editor = "J. Sgall and A. Pultr and P. Kolman",
series = "LNCS",
chapter = "",
pages = "111--122",
address = "", ynote = {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 = ""
}
@inproceedings{AlbNie2002,
AUTHOR = "J. Alber and R. Niedermeier",
title = {Improved Tree Decomposition Based Algorithms for Domination-like
Problems},
booktitle = {LATIN: Theoretical Informatics, 5th Latin American
Symposium},
year = {2002},
pages = {613--628},
editor = {S. Rajsbaum},
publisher = {Springer},
series = {LNCS},
volume = {2286},
}
@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{AlbGiaWoo2001,
AUTHOR = "J. Albert and D. Giammmarresi and D. Wood",
title = {Normal form algorithms for extended context-free grammars},
journal = tcs,
volume = {267},
number = {1-2},
pages = {35--47},
year = {2001},
}
@INPROCEEDINGS{AlbGiaWoo99,
AUTHOR = "J. Albert and D. Giammmarresi and D. Wood",
TITLE = "Extended context-free grammars and normal form transformations",
BOOKTITLE = "Automata Implementation: WIA'98",
YEAR = 1998,
month = "",
volume = "1660",
editor = "",
series = "LNCS",
chapter = "",
pages = "1--12",
address = "",
organization = "",
publisher = "",
copy = ""
}
@ARTICLE{AlbOKe81,
AUTHOR = "M.~O. Albertson and C.~J. O'Kefe",
TITLE = "Covering regions with squares",
JOURNAL = {SIAM Journal on Algebraic and Discrete Methods},
YEAR = 1981,
month = "",
volume = 2,
number = "",
pages = "240--243",
copy = ""
}
@article{AlbMoo99,
author = {M.~O. Albertson and
E.~H. Moore},
title = {Extending Graph Colorings},
journal = jcthb,
volume = {77},
number = {1},
pages = {83--95},
year = {1999},
}
@Article{Alb2008,
author = {M.~O. Albertson},
title = {Chromatic Number, Independence Ratio, and
Crossing Number},
journal = {Ars Mathematica Contemporanea},
year = {2008},
volume = {1},
pages = {1--6},
}
@inproceedings{Alb0708,
author = {A.~A. Albrecht},
title = {Complexity Aspects of Image Classification},
booktitle = {Medical Imaging and Informatics, 2nd International Conference, MIMI 2007},
pages = {1--4},
editor = {X. W. Gao and
H. M{\"u}ller and
M. Loomes and
R. Comley and
S. Luo},
publisher = {Springer},
series = {LNCS},
volume = {4987},
year = {2008},
}
@article{AlcGLM2020,
author = {Alcaraz, J. and
Garc\i a-Nov\#e, E. M. and
Landete, M. and
Monge, J. F.},
title = {The linear ordering problem with clusters: a new partial ranking},
journal = {TOP; An Official Journal of the Spanish Society of Statistics and Operations Research},
volume = {28},
pages = {646--671},
year = {2020},
}
@article{AleBBIMP2011,
author = {M. Alekhnovich and
A. Borodin and
J. Buresh{-}Oppenheim and
R. Impagliazzo and
A. Magen and
T. Pitassi},
title = {Toward a Model for Backtracking and Dynamic Programming},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {679--740},
year = {2011},
}
@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 = ""
}
@inproceedings{AleDjiAlenex02,
author = {Ly. Aleksandrov and
H. Djidjev and
H. Guo and
A. Maheshwari},
title = {Partitioning Planar Graphs with Costs and Weights},
booktitle = {Algorithm Engineering and Experiments, 4th International Workshop,
{ALENEX}},
pages = {98--110},
year = {2002},
editor = {D.~M. Mount and
C. Stein},
series = {LNCS},
volume = {2409},
publisher = {Springer},
}
@TECHREPORT{AleKorZve02,
AUTHOR = "V. E. Alekseev and D. V. Korobitsyn and I. E. Zverovich",
TITLE = "Boundary classes of graphs for the dominating set problem",
INSTITUTION = "Rutgers University",
YEAR = 2001,
month = sep,
number = "RRR 25-2002",
address = "",
note = {appeared in} # dm #{vol. 285, 1--6, 2004}
}
@INPROCEEDINGS{Aleetal95,
AUTHOR = "A. Alexandrov and others",
TITLE = "{LogGP}: incorporating long messages into the {LoGP} model",
BOOKTITLE = "SPAA'95",
YEAR = 1995,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "??",
address = "",
organization = "",
copy = ""
}
@article{Ale2004,
author = {B. Alexeev},
title = {Minimal {DFA} for testing divisibility},
journal = jcss,
volume = {69},
number = {2},
pages = {235--243},
year = {2004},
}
@INPROCEEDINGS{AlfBra2005,
author={Alfalayleh, M. and Brankovic, L.},
booktitle={3rd IEEE International Conference on Industrial Informatics, INDIN '05},
title={Scout and routed mobile agents},
year={2005},
volume={},
number={},
pages={667--674},
publisher ={IEEE Press}
}
@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},
}
@inproceedings{AlfBra1415,
author = {M. Alfalayleh and L. Brankovic},
title = {Quantifying Privacy: {A} Novel Entropy-Based Measure of Disclosure
Risk},
booktitle = {Combinatorial Algorithms - 25th International Workshop, {IWOCA} 2014},
pages = {24--36},
editor = {J. Kratochv{\'{\i}}l and
M. Miller and
D. Froncek},
series = {LNCS},
volume = {8986},
publisher = {Springer},
year = {2015},
}
@article{AlfHenKup2007,
author = {L. de Alfaro and
T. A. Henzinger and
O. Kupferman},
title = {Concurrent reachability games},
journal = tcs,
volume = {386},
number = {3},
pages = {188--217},
year = {2007},
}
@InCollection{AlhKRV2010,
author = {A. Alhazov and
A. Krassovitskiy and
Y. Rogozhin and
S. Verlan},
title = {Small size insertion and deletion systems},
booktitle = {Applications of Language Methods},
pages = {459--515},
publisher = {Imperial College Press},
year = {2010},
editor = {C. Martin-Vide},
}
@article{AlhKRV2011,
author = {A. Alhazov and
A. Krassovitskiy and
Y. Rogozhin and
S. Verlan},
title = {P systems with minimal insertion and deletion},
journal = tcs,
volume = {412},
number = {1-2},
pages = {136--144},
year = {2011},
}
@article{AlhFreIva2014,
author = {A. Alhazov and
R. Freund and
S. Ivanov},
title = {Length {P} Systems},
journal = fundinform,
volume = {134},
number = {1-2},
pages = {17--37},
year = {2014},
}
@inproceedings{AlhFreVer2015,
author = {A. Alhazov and
R. Freund and
S. Verlan},
title = {Bridging Deterministic {P} Systems and Conditional Grammars},
booktitle = {Membrane Computing - 16th International Conference, {CMC}},
pages = {63--76},
year = {2015},
editor = {G. Rozenberg and
A. Salomaa and
J.~M. Sempere and
C. Zandron},
series = {LNCS},
volume = {9504},
publisher = {Springer},
}
@article{AlhFFISS2017,
title = "Contextual array grammars with matrix control, regular control languages, and tissue {P} systems control",
journal = tcs,
volume = "682",
number = "",
pages = "5--21",
year = "2017",
note = "Special Issue on Languages and Combinatorics in Theory and Nature",
author = "A. Alhazov and H. Fernau and R. Freund and S. Ivanov and R. Siromoney and K.~G. Subramanian",
}
@inproceedings{AlhVerFre2018,
author = {A. Alhazov and
S. Verlan and
R. Freund},
title = {Small Universal Reversible Counter Machines},
booktitle = {Reversibility and Universality, Essays Presented to Kenichi Morita
on the Occasion of his 70th Birthday},
pages = {433--446},
year = {2018},
editor = {A. Adamatzky},
series = {Emergence, Complexity and Computation ECC},
volume = {30},
publisher = {Springer},
}
@inproceedings{AlhFIV1819,
author = {A. Alhazov and
R. Freund and
S. Ivanov and
S. Verlan},
title = {Tissue {P} Systems with Point Mutation Rules},
booktitle = {Membrane Computing - 19th International Conference, {CMC} 2018},
pages = {33--56},
editor = {T. Hinze and
G. Rozenberg and
A. Salomaa and
C. Zandron},
series = {LNCS},
volume = {11399},
publisher = {Springer},
year = {2019},
}
@article{AlhFIV2022,
author = {A. Alhazov and
R. Freund and
S. Ivanov and
S. Verlan},
title = {Regulated Insertion-Deletion Systems},
journal = jalc,
volume = {27},
number = {1-3},
pages = {15--45},
year = {2022},
}
@Article{AliRRA2013,
author = {M. Ali and M.~T. Rahim and G. Ali and U. Ali},
title = {On Metric Dimension of Some Rotationally Symmetric Graphs},
journal = {ISRN Combinatorics},
year = {2013},
note = {Article ID 724049},
}
@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},
}
@PhdThesis{Ali2013,
author = {F. Alinaghipour Taklimi},
title = {Zero Forcing Sets For Graphs},
school = {University of Regina, Canada},
year = {2013},
}
@Article{AliFalMea2014,
author = {F. {Alinaghipour Taklimi} and S. Fallat and K. Meagher},
title = {On the Relationships between Zero Forcing
Numbers and Certain Graph Coverings},
journal = {Special Matrices},
year = {2014},
volume = {2},
OPTnumber = {},
pages = {30--45},
}
@article{Ali2016,
author = {S. Alirezazadeh},
title = {On Pseudovarieties of Forest Algebras},
journal = ijfcs,
volume = {27},
number = {8},
pages = {909--942},
year = {2016},
}
@article{AllLas78,
title = "On domination and independent domination numbers of a graph",
journal = dm,
volume = "23",
number = "2",
pages = "73--76",
year = "1978",
author = "R.~B. Allan and R. Laskar"
}
@article{AllLasHed84,
title = "A note on total domination",
journal = dm,
volume = "49",
number = "1",
pages = "7--13",
year = "1984",
author = "R.~B. Allan and R. Laskar and S. Hedetniemi",
}
@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 = ""
}
@article{AllBKM2009,
author = {E. Allender and
P. B{\"{u}}rgisser and
J. Kjeldgaard{-}Pedersen and
P. B. Miltersen},
title = {On the Complexity of Numerical Analysis},
journal = siam,
volume = {38},
number = {5},
pages = {1987--2006},
year = {2009}
}
@article{AllCLPT2014,
author = {E. Allender and
S. Chen and
T. Lou and
P.~A. Papakonstantinou and
B. Tang},
title = {Width-Parametrized {SAT:} Time-Space Tradeoffs},
journal = {Theory of Computing},
volume = {10},
pages = {297--339},
year = {2014},
}
@article{AllLan2014,
author = {E. Allender and
K.{-}J. Lange},
title = {Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary
Pushdown Automata},
journal = {Theory of Computing},
volume = {10},
pages = {199--215},
year = {2014},
}
@article{AllHir2019,
author = {E. Allender and
S. Hirahara},
title = {New Insights on the (Non-)Hardness of Circuit Minimization and Related
Problems},
journal = {{ACM TOCT}},
volume = {11},
number = {4},
pages = {27:1--27:27},
year = {2019},
}
@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",
}
@inproceedings{AlmMniWil2017,
author = {J. Alman and
M. Mnich and
V. Vassilevska Williams},
title = {Dynamic Parameterized Problems and Algorithms},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP}},
pages = {41:1--41:16},
editor = {I. Chatzigiannakis and
P. Indyk and
F. Kuhn and
A. Muscholl},
series = {LIPIcs},
volume = {80},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2017},
}
@inproceedings{AlmWil2018,
author = {J. Alman and
V. Vassilevska Williams},
title = {Further Limitations of the Known Approaches for Matrix Multiplication},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}},
pages = {25:1--25:15},
year = {2018},
editor = {A.~R. Karlin},
series = {LIPIcs},
volume = {94},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
}
@article{AlmMorRei2007,
author = {M. Almeida and
N. Moreira and
R. Reis},
title = {Enumeration and generation with a string automata representation},
journal = tcs,
volume = {387},
number = {2},
pages = {93--102},
year = {2007},
}
@inproceedings{AlmAAMR2009,
author = {A. Almeida and
M. Almeida and
J. Alves and
N. Moreira and
R. Reis},
title = {{FAdo} and {GUItar}},
booktitle = {Implementation and Application of Automata, 14th International Conference,
{CIAA}},
pages = {65--74},
editor = {S. Maneth},
series = {LNCS},
volume = {5642},
publisher = {Springer},
year = {2009},
}
@Article{AlmMSV2009,
author = {J. Almeida and S. Margolis and B. Steinberg and M. Volkov},
title = {Representation theory of finite semigroups, semigroup radicals and formal language theory},
journal = tams,
year = {2009},
OPTkey = {},
volume = {361},
OPTnumber = {},
pages = {1429--1461},
}
@article{AlmRod2016,
author = {J. Almeida and
E. Rodaro},
title = {Semisimple Synchronizing Automata and the Wedderburn-Artin Theory},
journal =ijfcs,
volume = {27},
number = {2},
pages = {127--146},
year = {2016},
}
@article{AloDHP2009,
author = {D. Aloise and
A. Deshpande and
P. Hansen and
P. Popat},
title = {{NP}-hardness of {E}uclidean sum-of-squares clustering},
journal = {Machine Learning},
volume = {75},
number = {2},
pages = {245--248},
year = {2009},
}
@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\r{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{AloYusZwi97,
AUTHOR = "N. Alon and R. Yuster and U. Zwick",
title = {Finding and Counting Given Length Cycles},
journal = alg,
volume = {17},
number = {3},
pages = {209--223},
year = {1997},
}
@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 = acmtalg,
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},
}
@article{AloGut2009,
author = {N. Alon and
S. Gutner},
title = {Linear Time Algorithms for Finding a Dominating Set of Fixed Size
in Degenerated Graphs},
journal = alg,
volume = {54},
number = {4},
pages = {544--556},
year = {2009},
}
@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},
}
@Article{AloShaSud2009,
author = {N. Alon and A. Shapira and B. Sudakov},
title = {Additive approximation for edge-deletion
problems},
journal = {Annals of Mathematics},
year = {2009},
volume = {170},
pages = {371--411},
}
@Article{AloShpUlm2013,
author="Alon, N.
and Shpilka, A.
and Umans, C.",
title="On sunflowers and matrix multiplication",
journal="Computational Complexity",
year="2013",
volume="22",
number="2",
pages="219--243",
}
@article{AloFel2015,
author = {N. Alon and
O. N. Feldheim},
title = {Drawing outerplanar graphs using three edge lengths},
journal = {Comput. Geom.},
volume = {48},
number = {3},
pages = {260--267},
year = {2015},
}
@article{AloBCMR2015,
author = {N. Alon and
M. Basavaraju and
L. S. Chandran and
R. Mathew and
D. Rajendraprasad},
title = {Separation Dimension of Bounded Degree Graphs},
journal = siamdm,
volume = {29},
number = {1},
pages = {59--64},
year = {2015},
}
@article{AloBCKNW2015,
author = {N. Alon and
R. Bredereck and
J. Chen and
S. Kratsch and
R. Niedermeier and
G. J. Woeginger},
title = {How to Put Through Your Agenda in Collective Binary Decisions},
journal = {{ACM} Trans. Economics and Comput.},
volume = {4},
number = {1},
pages = {5:1--5:28},
year = {2015},
}
@article{AloDGS2015,
author = {N. Alon and
S. Das and
R. Glebov and
B. Sudakov},
title = {Comparable pairs in families of sets},
journal = jcthb,
volume = {115},
pages = {164--185},
year = {2015},
}
@inproceedings{AloNavSud2016,
author = {N. Alon and
H. Naves and
B. Sudakov},
title = {On the maximum quartet distance between phylogenetic trees},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA}},
pages = {2095--2106},
year = {2016},
editor = {R. Krauthgamer},
publisher = {{SIAM}},
}
@inproceedings{AloNen2017,
author = {N. Alon and
R. Nenadov},
title = {Optimal induced universal graphs for bounded-degree graphs},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA}},
pages = {1149--1157},
year = {2017},
editor = {P.~N. Klein},
publisher = {{SIAM}},
}
@inproceedings{AloRSWMCGDO2017,
author = {N. Alon and
D. Reichman and
I. Shinkar and
T. Wagner and
S. Musslick and
J. D. Cohen and
T. Griffiths and
B. Dey and
K. {\"{O}}zcimder},
title = {A graph-theoretic approach to multitasking},
booktitle = {Advances in Neural Information Processing Systems 30: Annual Conference
on Neural Information Processing Systems, NIPS},
pages = {2100--2109},
editor = {I. Guyon and
U. von Luxburg and
S. Bengio and
H. M. Wallach and
R. Fergus and
S. V. N. Vishwanathan and
R. Garnett},
year = {2017},
}
@inproceedings{AloLMM2019,
author = {N. Alon and
R. Livni and
M. Malliaris and
S. Moran},
title = {Private {PAC} learning implies finite {L}ittlestone dimension},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC}},
pages = {852--860},
year = {2019},
editor = {M. Charikar and
E. Cohen},
publisher = {{ACM}},
}
@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{AlsBanDou2000,
author = {H. Alshawi and
S. Bangalore and
S. Douglas},
title = {Head-Transducer Models for Speech Translation and Their Automatic
Acquisition from Bilingual Data},
journal = {Machine Translation},
volume = {15},
number = {1-2},
pages = {105--124},
year = {2000},
}
@article{AlsBanDou2000a,
author = {H. Alshawi and
S. Bangalore and
S. Douglas},
title = {Learning Dependency Translation Models as Collections of Finite State
Head Transducers},
journal = {Computational Linguistics},
volume = {26},
number = {1},
pages = {45--60},
year = {2000},
}
@article{AlsEadRos83,
title = "A lower-bound for the number of productions required for a certain class of languages",
journal = dam,
volume = "6",
number = "2",
pages = "109--115",
year = "1983",
author = "B. Alspach and P. Eades and G. Rose",
}
@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{AlsDea2009,
author = {B. Alspach and
M. Dean},
title = {Honeycomb toroidal graphs are {C}ayley graphs},
journal = ipl,
volume = {109},
number = {13},
pages = {705--708},
year = {2009},
}
@article{AlsCheDea2010,
author = {B. Alspach and
C.~C. Chen and
M. Dean},
title = {Hamilton paths in {C}ayley graphs on generalized dihedral groups},
journal = {Ars Math. Contemp.},
volume = {3},
number = {1},
pages = {29--47},
year = {2010},
}
@article{AlvMSV2017,
author = {M. P. {\'{A}}lvarez{-}Ruiz and
T. Mediavilla{-}Gradolph and
S.~M. Sheikholeslami and
J.~C. Valenzuela Tripodoro and
I.~G. Yero},
title = {On the strong {R}oman domination number of graphs},
journal = dam,
volume = {231},
pages = {44--59},
year = {2017},
ydoi = {10.1016/J.DAM.2016.12.013},
}
@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{AlsGHP2016,
author = {S. Alstrup and
C. Gavoille and
E. Bistrup Halvorsen and
H. Petersen},
editor = {R. Krauthgamer},
title = {Simpler, faster and shorter labels for distances in graphs},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA}},
pages = {338--350},
publisher = {{SIAM}},
year = {2016},
}
@article{AltGodWhi98,
author = {H. Alt and
M. Godau and
S. Whitesides},
title = {Universal 3-dimensional visibility representations for graphs},
journal = {Comput. Geom.},
volume = {9},
number = {1-2},
pages = {111--125},
year = {1998},
}
@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},
}
@INPROCEEDINGS{Altetal99,
AUTHOR = "O. Altamura and F. Esposito and F. A. Lisi and D. Malerba",
TITLE = "Symbolic learning techniques in paper document processing",
BOOKTITLE = "Machine learning and data mining in pattern recognition, MLDM",
YEAR = 1999,
month = "",
volume = "1715",
editor = "P. Perner and M. Petrou",
series = "LNCS/LNAI",
chapter = "",
pages = "159--173",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@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 = ""
}
@article{AluDil94,
author = {R. Alur and
D.~L. Dill},
title = {A Theory of Timed Automata},
journal = tcs,
volume = {126},
number = {2},
pages = {183--235},
year = {1994},
}
@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 = ""
}
@inproceedings{Alu2007,
author = {R. Alur},
editor = {L. Libkin},
title = {Marrying words and trees},
booktitle = {Proceedings of the Twenty-Sixth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, PODS},
pages = {233--242},
publisher = {{ACM}},
year = {2007},
}
@article{AluMad2009,
author = {R. Alur and
P. Madhusudan},
title = {Adding nesting structure to words},
journal = jacm,
volume = {56},
number = {3},
year = {2009},
}
@inproceedings{AluFilTri2012,
author = {R. Alur and
E. Filiot and
A. Trivedi},
title = {Regular Transformations of Infinite Strings},
booktitle = {Proceedings of the 27th Annual {IEEE} Symposium on Logic in Computer
Science, {LICS}},
pages = {65--74},
year = {2012},
publisher = {{IEEE} Computer Society},
}
@TECHREPORT{AlvGre96,
AUTHOR = "C. \`Alvarez and R. Greenlaw",
TITLE = "A Compendium of Problems Complete for Symmetric Logarithmic Space",
INSTITUTION = "ECCC Trier",
YEAR = 1996,
month = "",
number = "TR96-039",
address = "{\tt http://www.eccc.uni-trier.de:/pub/eccc/}",
copy = ""
}
@article{AlvGre2000,
AUTHOR = "C. \`Alvarez and R. Greenlaw",
title = {A compendium of problems complete for symmetric logarithmic space},
journal = {Computational Complexity},
volume = {9},
number = {2},
pages = {123--145},
year = {2000},
}
@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{AlvBDMS2016,
author = {C. {\`{A}}lvarez and
M. J. Blesa and
A. Duch and
A. Messegu{\'{e}} and
M. J. Serna},
title = {Celebrity games},
journal = tcs,
volume = {648},
pages = {56--71},
year = {2016},
ydoi = {10.1016/j.tcs.2016.08.005},
}
@article{AlvSanBen2014,
title = "Recognition of on-line handwritten mathematical expressions using {2D} stochastic context-free grammars and hidden {M}arkov models",
journal = "Pattern Recognition Letters",
volume = "35",
number = "",
pages = "58--67",
year = "2014",
author = "F. \'Alvaro and J.-A. S\'anchez and J.-M. Bened\'i",
}
@article{AlvFSTB2015,
author = {F. \'Alvaro and
F.~C. Fernandez and
J.{-}A. S{\'{a}}nchez and
O. R. Terrades and
J.{\'{e}}{-}M. Bened{\'{\i}}},
title = {Structure detection and segmentation of documents using {2D} stochastic
context-free grammars},
journal = {Neurocomputing},
volume = {150},
pages = {147--154},
year = {2015},
}
@article{AlvPen2020,
title = {Reconfiguration of Discrete Event Systems using Synchronizing Words},
journal = {IFAC-PapersOnLine},
volume = {53},
number = {4},
pages = {453--458},
year = {2020},
note = {15th IFAC Workshop on Discrete Event Systems WODES},
author = {L.~V.~R. Alves and P.~N. Pena},
}
@article{AlzWanFri2003,
author = {K.~M. Alzoubi and
P.-J. Wan and
O. Frieder},
title = {Maximal Independent Set, Weakly-Connected Dominating Set,
and Induced Spanners in Wireless Ad Hoc Networks},
journal = ijfcs,
volume = {14},
number = {2},
year = {2003},
pages = {287--303},
}
@Article{AmaFouGer83,
author = {D. Amar and I. Fournier and A. Germa},
title = {Ordre minimum d'un graphe simple de diam\`etre, degr\'e minimum et connexit\'e donnes},
journal = adm,
year = {1983},
volume = {17},
pages = {7--10},
}
@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{AmaPap2018,
author = {A. Amarilli and
C. Paperman},
title = {Topological Sorting with Regular Constraints},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP}},
pages = {115:1--115:14},
year = {2018},
editor = {I. Chatzigiannakis and
C. Kaklamanis and
D. Marx and
D. Sannella},
series = {LIPIcs},
volume = {107},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
}
@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},
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},
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{AmbJaiSha99,
author = {A. Ambainis and
S. Jain and
A. Sharma},
title = {Ordinal Mind Change Complexity of Language Identification},
journal = tcs,
volume = {220},
number = {2},
pages = {323--343},
year = {1999},
}
@ARTICLE{Amb2001,
AUTHOR = "A. Ambainis",
TITLE = "Probabilistic inductive inference: a survey",
JOURNAL = tcs,
YEAR = 2001,
month = "",
volume = 264,
number = "",
pages = "155--167",
copy = ""
}
@article{AmbBGKMT2006,
author = {A. Ambainis and
M. Beaudry and
M. Golovkins and
A. Kikusts and
M. Mercer and
D. Th{\'{e}}rien},
title = {Algebraic Results on Quantum Automata},
journal = tocs,
volume = {39},
number = {1},
pages = {165--188},
year = {2006},
}
@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},
}
@article{AmiVilJan98,
author = {J. Amilhastre and
M.{-}C. Vilarem and
P. Janssen},
title = {Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition
for Bipartite Domino-free Graphs},
journal = dam,
volume = {86},
number = {2-3},
pages = {125--144},
year = {1998},
}
@UNPUBLISHED{Ami,
AUTHOR = "J. Amilhastre",
TITLE = "Complexity of minimum biclique decomposition of bipartite graphs",
NOTE = "University of Montpellier",
year = 2002,
month = "",
copy = ""
}
@inproceedings{AmiSauSak2008,
author = {O. Amini and
I. Sau and
S. Saurabh},
title = {Parameterized Complexity of the Smallest Degree-Constrained Subgraph
Problem},
booktitle = {Parameterized and Exact Computation, Third International Workshop,
{IWPEC}},
pages = {13--29},
editor = {M. Grohe and
R. Niedermeier},
series = {LNCS},
volume = {5018},
publisher = {Springer},
year = {2008},
}
@article{AmiFomSau2011,
author = {O. Amini and F.~V. Fomin and S. Saurabh},
title = "Implicit branching and parameterized partial cover problems",
journal = jcss,
volume = "77",
number = "6",
pages = "1159--1171",
year = "2011",
}
@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},
}
@ARTICLE{AmiLanSok03,
AUTHOR = "A. Amir and G.~M. Landau and D. Sokol",
TITLE = "Inplace run-length $2d$ compressed search",
JOURNAL = tcs,
YEAR = 2003,
month = "",
volume = 290,
number = "",
pages = "1361--1383",
copy = ""
}
@article{AmiLanSok03a,
AUTHOR = "A. Amir and G.~M. Landau and D. Sokol",
title = {Inplace {$2D$} matching in compressed images},
journal = jalg,
volume = {49},
number = {2},
pages = {240--261},
year = {2003},
}
@article{AmiAKLP2009,
author = {A. Amir and
Y. Aumann and
O. Kapah and
A. Levy and
E. Porat},
title = {Approximate string matching with address bit errors},
journal = tcs,
year = {2009},
volume = {410},
number = {51},
pages = {5334--5346},
}
@inproceedings{AmiLev2010,
author = {A. Amir and
A. Levy},
title = {String Rearrangement Metrics: {A} Survey},
booktitle = {Algorithms and Applications, Essays Dedicated to Esko Ukkonen on the
Occasion of His 60th Birthday},
pages = {1--33},
year = {2010},
editor = {T. Elomaa and
H.i Mannila and
P. Orponen},
series = {LNCS},
volume = {6060},
publisher = {Springer},
}
@article{AmiParRod2013,
author = {A. Amir and
H. Paryenty and
L. Roditty},
title = {On the hardness of the Consensus String problem},
journal = ipl,
volume = {113},
number = {10-11},
pages = {371--374},
year = {2013},
}
@article{AmiParRod2016,
author = {A. Amir and
H. Paryenty and
L. Roditty},
title = {Configurations and Minority in the String Consensus Problem},
journal = alg,
volume = {74},
number = {4},
pages = {1267--1292},
year = {2016},
}
@inproceedings{AmiKKRS2015,
author = {S. A. Amiri and
\L. Kaiser and
S. Kreutzer and
R. Rabinovich and
S. Siebertz},
title = {Graph Searching Games and Width Measures for Directed Graphs},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
{STACS}},
pages = {34--47},
editor = {E. W. Mayr and
N. Ollinger},
series = {LIPIcs},
volume = {30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2015},
}
@article{AmiKreRab2016,
author = {S.~A. Amiri and
S. Kreutzer and
R. Rabinovich},
title = {{DAG}-width is {PSPACE}-complete},
journal = tcs,
volume = {655},
pages = {78--89},
year = {2016},
ydoi = {10.1016/J.TCS.2016.09.011},
}
@article{Ami2021,
author = {S.~A. Amiri},
title = {A note on the fine-grained complexity of {MIS} on regular graphs},
journal = ipl,
volume = {170},
pages = {106123},
year = {2021},
ydoi = {10.1016/J.IPL.2021.106123},
}
@MastersThesis{Ami2004,
author = {N. Amit},
title = {The Bicluster Graph
Editing Problem},
school = {Tel Aviv University},
year = {2004},
OPTkey = {},
OPTtype = {},
OPTaddress = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{AmoMacRei2015,
author = {I. Amorim and
A. Machiavelo and
R. Reis},
title = {On the Number of Linear Finite Transducers},
journal = ijfcs,
volume = {26},
number = {7},
pages = {873--894},
year = {2015},
}
@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{Amr2021,
author = {A. Amrollahi},
title = {A Conceptual Tool to Eliminate Filter Bubbles in Social Networks},
journal = {Australasian Journal of Information Systems},
volume = {25},
year = {2021},
ydoi = {10.3127/AJIS.V25I0.2867},
}
@ARTICLE{Anaetal03,
AUTHOR = "R. S. Anand and T. Erlebach and A. Hall and S. Stefanakos",
TITLE = "Call control with $k$ rejections",
JOURNAL = jcss,
YEAR = 2003,
month = "",
volume = 67,
number = "",
pages = "707--722",
copy = ""
}
@article{AnaCheVol2003,
author = {D.~S. Ananichev and
A. Cherubini and
M.~V. Volkov},
title = {Image reducing words and subgroups of free groups},
journal = tcs,
volume = {307},
number = {1},
pages = {77--92},
year = {2003},
}
@article{AnaVol2004,
author = {D.~S. Ananichev and
M.~V. Volkov},
title = {Synchronizing monotonic automata},
journal = tcs,
volume = {327},
number = {3},
pages = {225--239},
year = {2004},
}
@article{AnaVol2005,
author = {D.~S. Ananichev and
M.~V. Volkov},
title = {Synchronizing generalized monotonic automata},
journal = tcs,
volume = {330},
number = {1},
pages = {3--13},
year = {2005},
}
@article{AnaVolZak2007,
author = {D. S. Ananichev and
M. V. Volkov and Yu.I. Zaks},
title = "Synchronizing automata with a letter of deficiency 2",
journal = tcs,
volume = "376",
number = "1-2",
pages = "30--41",
year = "2007",}
@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{AnaVolGus2013,
author="Ananichev, D. S.
and Volkov, M. V.
and Gusev, V. V.",
title="Primitive digraphs with large exponents and slowly synchronizing automata",
journal="Journal of Mathematical Sciences",
year="2013",
volume="192",
number="3",
pages="263--278",
}
@article{AnaGus2016,
author="Ananichev, D.~S.
and Gusev, V. V.",
title = {Approximation of Reset Thresholds with Greedy Algorithms},
journal = fundinform,
volume = {145},
number = {3},
pages = {221--227},
year = {2016},
}
@article{AnaVor2019,
author = {D. S. Ananichev and
V. Vorel},
title = {A new Lower Bound for Reset Threshold of Binary Synchronizing Automata
with Sink},
journal = jalc,
volume = {24},
number = {2-4},
pages = {153--164},
year = {2019},
}
@PhdThesis{And2019,
author = {Ariel S. Anders},
title = {Reliably arranging objects: a conformant planning
approach to robot manipulation},
school = {Massachusetts Institute of Technology, USA},
year = {2019},
}
@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 = ""
}
@article{AndRSS2009,
author = {T. Anderson and
J. Loftus and
N. Rampersad and
N. Santean and
J. Shallit},
title = {Detecting palindromes, patterns and borders in regular languages},
journal = ic,
volume = {207},
number = {11},
pages = {1096--1118},
year = {2009},
}
@article{AndTSHL2012,
author = {J.~W.~J. Anderson and
P. Tataru and
J. Staines and
J. Hein and
R. B. Lyngs{\o}},
title = {Evolving stochastic context-free grammars for {RNA} secondary
structure prediction},
journal = {BMC Bioinformatics},
volume = {13},
year = {2012},
pages = {78},
ee = {http://dx.doi.org/10.1186/1471-2105-13-78},
}
@article{AndHMVLTH2013,
author = {J.~W.~J. Anderson and
P.~A. Haas and
L.-A. Mathieson and
V. Volynkin and
R. B. Lyngs{\o} and
P. Tataru and
J. Hein},
title = {Oxfold: kinetic folding of {RNA} using stochastic context-free
grammars and evolutionary information},
journal = {Bioinformatics},
volume = {29},
number = {6},
year = {2013},
pages = {704--710},
}
@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 = ""
}
@article{And2010,
title = "Prediction and design of {DNA} and {RNA} structures",
journal = "New Biotechnology",
volume = "27",
number = "3",
pages = "184--193",
year = "2010",
author = "E.~S. Andersen"
}
@INPROCEEDINGS{AndEgaKim2020,
AUTHOR = "K. Ando and Y. Egawa and K. Kimura",
TITLE = "An algorithm for a defensive alliance containing a specified vertex in a tree",
BOOKTITLE = {ITC-CSCC 2020: The 35th International Technical Conference on Circuits/Systems, Computers and Communications},
YEAR = 2020,
month = "",
volume = "",
editor = "Tsuji, K. and Kaneko, Y. and Denshi J{\=o}h{\=o} Ts{\=u}shin Gakkai and Taehan-Ch{\u{o}}nja-Konghakhoe",
series = "",
chapter = "",
pages = "122--125",
address = "",
organization = "",
publisher = "IEEE",
copy = ""
}
@article{AndAig89,
title = "The total interval number of a graph",
journal = jcthb,
volume = "46",
number = "1",
pages = "7--21",
year = "1989",
author = "T. Andreae and M. Aigner",
}
@article{AndFGS2019,
title = {Star partitions on graphs},
journal = dopt,
volume = {33},
pages = {1--18},
year = {2019},
author = {G. Andreatta and C. {De Francesco} and L. {De Giovanni} and P. Serafini},
}
@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 = ""
}
@inproceedings{AndRac2004,
author = {Andreev, K. and R\"{a}cke, H.},
title = {Balanced Graph Partitioning},
booktitle = {Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures},
series = {SPAA '04},
year = {2004},
pages = {120--124},
publisher = {ACM},
}
@inproceedings{AndKud9900,
author = {S. Andrei and
M. Kudlek},
title = {Bidirectional parsing for linear languages},
booktitle = {Developments in Language Theory, Foundations, Applications, and Perspectives, DLT 1999},
pages = {257--269},
editor = {G. Rozenberg and
W. Thomas},
publisher = {World Scientific},
year = {2000},
}
@article{AndMadNem2012,
author = {H. Andr{\'e}ka and
J. X. Madar{\'a}sz and
I. N{\'e}meti},
title = {Decidability, Undecidability, and {G}{\"o}del's Incompleteness
in Relativity Theories},
journal = ppl,
volume = {22},
number = {3},
year = {2012},
}
@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{AngFlaWil2012,
author = {O. Angel and
A.~D. Flaxman and
D.~B. Wilson},
title = {A sharp threshold for minimum bounded-depth and bounded-diameter
spanning trees and {S}teiner trees in random networks},
journal = {Combinatorica},
volume = {32},
number = {1},
year = {2012},
pages = {1--33},
}
@article{AngBPZ2014,
title = "Optimal data placement on networks with a constant number of clients",
journal = tcs,
volume = "540-541",
pages = "82--88",
year = "2014",
author = "E. Angel and E. Bampis and G. G. Pollatos and V. Zissimopoulos",
}
@inproceedings{AngBCK2015,
author = {E. Angel and
E. Bampis and
V. Chau and
A.~V. Kononov},
title = {Min-Power Covering Problems},
booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC}},
pages = {367--377},
editor = {K.~M. Elbassioni and
K. Makino},
series = {LNCS},
volume = {9472},
publisher = {Springer},
year = {2015},
}
@article{AngBEL2018,
author = {E. Angel and
E. Bampis and
B. Escoffier and
M. Lampis},
title = {Parameterized Power Vertex Cover},
journal = dmtcs,
volume = {20},
number = {2},
year = {2018},
URL = {https://dmtcs.episciences.org/4873},
}
@inproceedings{AngBKPU2018,
author = {P. Angelini and
M.~A. Bekos and
M.l Kaufmann and
M. Pfister and
T. Ueckerdt},
title = {Beyond-Planarity: {T}ur{\'{a}}n-Type Results for Non-Planar Bipartite
Graphs},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}},
pages = {28:1--28:13},
year = {2018},
editor = {W.{-}L. Hsu and
D.{-}T. Lee and
C.{-}S. Liao},
series = {LIPIcs},
volume = {123},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik}
}
@article{AngBek2019,
author = {P. Angelini and
M.~A. Bekos},
title = {Hierarchical Partial Planarity},
journal = alg,
volume = {81},
number = {6},
pages = {2196--2221},
year = {2019},
}
@article{AngLoz2019,
author = {P. Angelini and
G. {Da Lozzo}},
title = {Clustered Planarity with Pipes},
journal = alg,
volume = {81},
number = {6},
pages = {2484--2526},
year = {2019},
}
@article{AngBLM2019,
author = {P. Angelini and
M.~A. Bekos and
G. Liotta and
F. Montecchiani},
title = {Universal Slope Sets for 1-Bend Planar Drawings},
journal = alg,
volume = {81},
number = {6},
pages = {2527--2556},
year = {2019},
}
@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{AngBFP2014,
title = "On the tractability of minimal model computation for some {CNF} theories",
journal = "Artificial Intelligence",
volume = "210",
pages = "56--77",
year = "2014",
author = "F. Angiulli and R. Ben-Eliyahu-Zohary and F. Fassetti and L. Palopoli",
}
@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 = ""
}
@ARTICLE{Ang90,
AUTHOR = "D. Angluin",
TITLE = "Negative results for equivalence queries",
JOURNAL = {Machine Learning},
YEAR = 1990,
month = "",
volume = 5,
number = "",
pages = "121--150",
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{AngAspEis2006,
author = {D. Angluin and
J. Aspnes and
D. Eisenstat},
title = {Stably computable predicates are semilinear},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC}},
pages = {292--299},
editor = {E. Ruppert and
D. Malkhi},
publisher = {{ACM}},
year = {2006},
}
@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{AngAEK2013,
author = {D. Angluin and
J. Aspnes and S. Eisenstat and
A. Kontorovich},
title = {On the Learnability of Shuffle Ideals},
journal = {Journal of Machine Learning Research},
year = {2013},
volume = {14},
pages = {1513--1531},
}
@inproceedings{AngFis2014,
author = {D. Angluin and
D. Fisman},
title = {Learning Regular Omega Languages},
booktitle = {Algorithmic Learning Theory - 25th International Conference, {ALT}},
year = {2014},
pages = {125--139},
editor = {P. Auer and
A. Clark and
T. Zeugmann and
S. Zilles},
series = {LNCS},
volume = {8776},
publisher = {Springer},
}
@inproceedings{AngFisSho2020,
author = {D. Angluin and
D. Fisman and
Y. Shoval},
title = {Polynomial Identification of {$\omega$}-Automata},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
- 26th International Conference, {TACAS} 2020, Held as Part of the
European Joint Conferences on Theory and Practice of Software, {ETAPS}, Part {II}},
pages = {325--343},
year = {2020},
editor = {A. Biere and
D. Parker},
series = {LNCS},
volume = {12079},
publisher = {Springer},
}
@article{AniHas92,
author = {S. Anily and
R. Hassin},
title = {The swapping problem},
journal = {Networks},
volume = {22},
number = {4},
pages = {419--433},
year = {1992},
}
@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{AnsGiaMad2005,
author = {M. Anselmo and
D. Giammarresi and
M. Madonia},
title = {New operations and regular expressions for two-dimensional languages
over one-letter alphabet},
journal = tcs,
volume = {340},
number = {1},
pages = {408--431},
year = {2005},
}
@Article{AnsCherSan2007,
author = {M. Anselmo and A. Cherubini and P. San Pietro},
title = {Regular languages and associative language descriptions},
journal = dmtcs,
year = {2007},
OPTkey = {},
volume = {9},
OPTnumber = {},
pages = {153--174},
}
@article{AnsGiaMad2009,
title = "A computational model for tiling recognizable two-dimensional languages",
journal = tcs,
volume = "410",
number = "37",
pages = "3520--3529",
year = "2009",
author = "M. Anselmo and D. Giammarresi and M. Madonia",
}
@article{AnsMad2009,
title = "Deterministic and unambiguous two-dimensional languages over one-letter alphabet",
journal = tcs,
volume = "410",
number = "16",
pages = "1477--1485",
year = "2009",
author = "M. Anselmo and M. Madonia",
}
@article{AnsMad2013,
author = {M. Anselmo and
M. Madonia},
title = {A Stronger Recognizability Condition for Two-dimensional Languages},
journal = dmtcs,
volume = {15},
number = {2},
pages = {139--156},
year = {2013},
}
@article{AnsGiaMad2020,
title = "A Common Framework to Recognize Two-dimensional Languages",
journal = fundinform,
volume = "171",
number = "",
pages = "1--17",
year = "2020",
author = "M. Anselmo and D. Giammarresi and M. Madonia",
}
@inproceedings{AnsFloMad2022,
author = {M. Anselmo and
M. Flores and
M. Madonia},
editor = {P. Fraigniaud and
Y. Uno},
title = {Fun Slot Machines and Transformations of Words Avoiding Factors},
booktitle = {11th International Conference on Fun with Algorithms, {FUN}},
series = {LIPIcs},
volume = {226},
pages = {4:1--4:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
}
@article{AnsKar2011,
author = {E. Anshelevich and
A. Karagiozova},
title = {Terminal Backup, {3D} Matching, and Covering Cubic Graphs},
journal = siam,
volume = {40},
number = {3},
pages = {678--708},
year = {2011},
}
@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},
}
@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 = ""
}
@ARTICLE{ApoLon2000,
AUTHOR = "A. Apostolico and S. Lonardi",
TITLE = "Off-line compression by greedy textual substitution",
JOURNAL = ieeeproc,
YEAR = 2000,
volume = 88,
pages = "1733--1744",
}
@inproceedings{ApoLonDCC2000,
author = {A. Apostolico and S. Lonardi},
title = {Compression of biological sequences by greedy off-line
textual substitution},
booktitle = {Proceedings of the 10th Data Compression Conference, DCC
2000},
year = {2000},
pages = {143--152},
}
@article{ApoDro2009,
author = {A. Apostolico and
G. Drovandi},
title = {Graph Compression by {BFS}},
journal = {Algorithms},
volume = {2},
number = {3},
pages = {1031--1044},
year = {2009},
}
@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},
}
@article{AprDFH2022,
author = {M. Aprile and
M. Drescher and
S. Fiorini and
T. Huynh},
title = {A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem},
journal = {Mathematical Programming},
volume = {to appear},
year = {2022},
url = {https://doi.org/10.1007/s10107-021-01744-w},
}
@article{AraKas77,
title = "Some decision problems related to the reachability problem for {P}etri nets",
journal = tcs,
volume = "3",
number = "1",
pages = "85--104",
year = "1977",
author = "T. Araki and T. Kasami",}
@article{AraTok81,
author = {T. Araki and
N. Tokura},
title = {Flow Languages Equal Recursively Enumerable Languages},
journal = actainform,
volume = {15},
pages = {209--217},
year = {1981}
}
@article{AraKagTok81,
author = {T. Araki and
T. Kagimasa and
N. Tokura},
title = {Relations of Flow Languages to {P}etri Net Languages},
journal = tcs,
volume = {15},
pages = {51--75},
year = {1981},
}
@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}}
}
@article{AraCam2014,
title = "Primitive groups synchronize non-uniform maps of extreme ranks",
journal = jcthb,
volume = "106",
pages = "98--114",
year = "2014",
author = "J. Ara{\'{u}}jo and P.~J. Cameron",
}
@inproceedings{AraBCS2021,
author = {J. Ara{\'{u}}jo and
M. Bougeret and
V. A. Campos and
I. Sau},
editor = {P. A. Golovach and
M. Zehavi},
title = {A New Framework for Kernelization Lower Bounds: The Case of {M}aximum
{M}inimal {V}ertex {C}over},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC}},
series = {LIPIcs},
volume = {214},
pages = {4:1--4:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
}
@techreport{AraBCS2021a,
author = {J. Ara{\'{u}}jo and
M. Bougeret and
V. A. Campos and
I. Sau},
title = {Parameterized complexity of computing maximum minimal blocking and
hitting sets},
institution = {Cornell University, ArXiv/CoRR},
number = {2102.03404},
year = {2021},
url = {https://arxiv.org/abs/2102.03404},
}
@article{ArcEFFLSWY2004,
author = {D. Archdeacon and
J.~A. Ellis-Monaghan and
D. Fisher and
D. Froncek and
P. Che Bor Lam and
S. M. Seager and
B. Wei and
R. Yuster},
title = {Some remarks on domination},
journal = jgth,
volume = {46},
number = {3},
year = {2004},
pages = {207--210},
}
@inproceedings{ArdKSS2023,
author = {P.~S. Ardra and
R. Krithika and
S. Saurabh and
R. Sharma},
editor = {L. Gasieniec},
title = {Balanced Substructures in Bicolored Graphs},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science},
series = {LNCS},
volume = {13878},
pages = {177--191},
publisher = {Springer},
year = {2023},
}
@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{AreCJR2020,
author = {M. Arenas and
L.~A. Croquevielle and
R. Jayaram and
C. Riveros},
title = {Efficient Logspace Classes for Enumeration, Counting, and Uniform
Generation},
journal = {{SIGMOD} Rec.},
volume = {49},
number = {1},
pages = {52--59},
year = {2020},
}
@article{AreCJR2022,
author = {M. Arenas and
L.~A. Croquevielle and
R. Jayaram and
C. Riveros},
title = {{\#}NFA Admits an {FPRAS:} Efficient Enumeration, Counting, and Uniform
Generation for Logspace Classes},
journal = jacm,
volume = {68},
number = {6},
pages = {48:1--48:40},
year = {2021},
}
@article{Argetal2010,
author = {E.~N. 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},
}
@inproceedings{ArgBekSym1011,
author = {E.~N. Argyriou and M.~A. Bekos and A. Symvonis},
title = {Maximizing the Total Resolution of Graphs},
booktitle = {Graph Drawing, GD 2010},
pages = {62--67},
year = {2011},
editor = {U.~Brandes and S.~Cornelsen},
series = {LNCS},
volume = {6502},
publisher = {Springer},
}
@article{ArgBekSym2012,
author = {E.~N. Argyriou and
M. A. Bekos and
A. Symvonis},
title = {The Straight-Line {RAC} Drawing Problem is {NP}-Hard},
journal = jgaa,
volume = {16},
number = {2},
pages = {569--597},
year = {2012},
}
@inproceedings{ArgDAn2018,
author = {G. Argyros and
L. D'Antoni},
title = {The Learnability of Symbolic Automata},
booktitle = {Computer Aided Verification - 30th International Conference, {CAV}, Proceedings, Part {I}},
pages = {427--445},
year = {2018},
editor = {H. Chockler and
G. Weissenbacher},
series = {LNCS},
volume = {10981},
publisher = {Springer},
year = {2018},
}
@ARTICLE{Arietal01,
AUTHOR = "S.~R. Arikati and A. Dessmark and A. Lingas and M.~V. Marathe",
TITLE = "Approximation algorithms for maximum 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 = {},
OPTdoi = {},
}
@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},
}
@inproceedings{AriTot2012,
author = {K. Arikushi and
Cs. D. T{\'{o}}th},
title = {Crossing Angles of Geometric Graphs},
booktitle = {Combinatorial Optimization and Applications - 6th International Conference,
{COCOA}},
pages = {103--114},
year = {2012},
editor = {G. Lin},
series = {LNCS},
volume = {7402},
publisher = {Springer},
}
@inproceedings{AriShiOts91,
author = {H. Arimura and
T. Shinohara and
S. Otsuki},
title = {A Polynomial Time Algorithm for Finding Finite Unions of
Tree Pattern Languages},
booktitle = {Nonmonotonic and Inductive Logic, Second International Workshop, 1991},
pages = {118--131},
editor = {G. Brewka and
K. P. Jantke and
P. H. Schmitt},
publisher = {Springer},
series = {LNCS},
volume = {659},
year = {1993},
}
@InProceedings{AriIshShi92,
author = "H. Arimura and H. Ishizaka and T.
Shinohara",
title = "Polynomial Time Inference of a Subclass of
Context-free Transformations",
pages = "136--143",
editor = "D. Haussler",
booktitle = "Proceedings of the 5th Annual {ACM} Workshop on
Computational Learning Theory, COLT",
month = jul,
year = "1992",
publisher = "ACM Press",
}
@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{AriSakAri2001,
author = {H. Arimura and
H. Sakamoto and
S. Arikawa},
title = {Efficient Learning of Semi-structured Data from Queries},
booktitle = {Algorithmic Learning Theory, 12th International Conference, ALT},
year = {2001},
pages = {315--331},
editor = {N. Abe and
R. Khardon and
T. Zeugmann},
publisher = {Springer},
series = {LNCS},
volume = {2225},
}
@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,
volume = {35},
number = {3},
pages = {531--566},
}
@article{Arketal2009,
author = {E.~M. Arkin and
S.~P. Fekete and
K. Islam and
H. Meijer and
J. S. B. Mitchell and
Y. N{\'{u}}{\~{n}}ez Rodr{\'{\i}}guez and
V. Polishchuk and
D. Rappaport and
H. Xiao},
title = {Not being (super)thin or solid is hard: {A} study of grid {H}amiltonicity},
journal = {Comput. Geom.},
volume = {42},
number = {6-7},
pages = {582--605},
year = {2009},
}
@article{Arm2011,
author = {A. Armon},
title = {On min-max $r$-gatherings},
journal = tcs,
volume = {412},
number = {7},
pages = {573--582},
year = {2011},
}
@article{ArmJac2003,
author = {D.~E. Armstrong and
S.~H. Jacobson},
title = {Studying the Complexity of Global Verification for {NP}-Hard
Discrete Optimization Problems},
journal = {J. Global Optimization},
volume = {27},
number = {1},
year = {2003},
pages = {83--96},
ee = {http://dx.doi.org/10.1023/A:1024680908847},
}
@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{ArnHig94,
author = {Arnim, A. von and
Higuera, C. de la},
title = {Computing the Jump Number on Semi-orders Is Polynomial},
journal = dam,
volume = {51},
number = {1-2},
pages = {219--232},
year = {1994},
}
@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},
}
@article{ArnSte2006,
title = "Synchronizing groups and automata",
journal = tcs,
volume = "359",
number = "1",
pages = "101--110",
year = "2006",
author = "F. Arnold and B. Steinberg",
}
@TechReport{ArpRei2004,
author = {J. Arpe and
R. Reischuk},
title = {On the Complexity of Optimal Grammar-Based Compression},
year = {2004},
number = {Schriftenreihe der Institute f\"ur
Informatik/Mathematik;
Serie A; SIIM-TR-A-05-14},
institution = {Universit\"at zu L\"ubeck
Technisch-Naturwissenschaftliche Fakult\"at, Germany},
month = dec,
}
@inproceedings{ArpRei2006,
author = {J. Arpe and
R. Reischuk},
title = {On the Complexity of Optimal Grammar-Based Compression},
booktitle = {2006 Data Compression Conference {(DCC})},
pages = {173--182},
publisher = {{IEEE} Computer Society},
year = {2006},
}
@INPROCEEDINGS{Aroetal2004,
AUTHOR = "B. Aronov and T. Asano and N. Katoh and K. Mehlhorn and T. Tokuyama",
TITLE = "Polyline Fitting of Planar Points Under Min-sum Criteria",
BOOKTITLE = "Algorithms and Computation: 15th International Symposium ISAAC 2004",
YEAR = 2004,
month = "",
volume = "3341",
editor = "R. Fleischer and G. Trippen",
series = "LNCS",
chapter = "",
pages = "77--88",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@Article{AroBBJJKLLSS2011,
author = {B. Aronov and K. Buchin and M. Buchin and B. Jansen and T. de Jong and M. van Kreveld and M. L\"offler and J. Luo and R.~I. Silveira and B. Speckmann},
title = {Connect the dot: Computing feed-links for network extension},
journal = {Journal of Spatial Information Science},
year = {2011},ydoi= {10.5311/JOSIS.2011.3.47},
volume = {},
number = {3},
pages = {3--31},
}
@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{Aroetal97,
AUTHOR = "S. Arora and L. Babai and J. Stern and J. Sweedyk",
TITLE = "The hardness of approximate optima in lattices, codes and systems of linear equations",
JOURNAL = jcss,
YEAR = 1997,
month = "",
volume = 54,
number = "",
pages = "317--331",
copy = ""
}
@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{AroKarKar99,
author = {S. Arora and
D. R. Karger and
M. Karpinski},
title = {Polynomial Time Approximation Schemes for Dense Instances of {NP}-Hard
Problems},
journal = jcss,
volume = {58},
number = {1},
pages = {193--210},
year = {1999},
}
@article{AroBarSte2015,
author = {S. Arora and
B. Barak and
D. Steurer},
title = {Subexponential Algorithms for Unique Games and Related Problems},
journal = jacm,
volume = {62},
number = {5},
pages = {42},
year = {2015},
}
@article{ArqFre95,
year = {Fall 1995},
author = {Arquilla, J. and Fredricksen, H.},
journal = {Military Operations Research},
url = {http://hdl.handle.net/10945/38438},
title = {``{G}raphing'' an Optimal Grand Strategy}, pages = {3--17}}
@article{Arq2011,
author = {J. Arquilla},
title = {From blitzkrieg to bitskrieg: the military encounter with computers},
journal = cacm,
volume = {54},
number = {10},
pages = {58--65},
year = {2011},
}
@Article{ArrSte2009,
author="Arratia Quesada, A.~A. and Stewart, I.~A.",
title="On the power of deep pushdown stacks",
journal=actainform,
year="2009",
volume="46",
number="7",
pages="509--531",
}
@inproceedings{ArrFOW2020,
author = {E. Arrighi and
H. Fernau and
M. de Oliveira Oliveira and
P. Wolf},
editor = {N. Saxena and
S. Simon},
title = {Width Notions for Ordering-Related Problems},
booktitle = {40th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS}},
series = {LIPIcs},
volume = {182},
pages = {9:1--9:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
doi = {10.4230/LIPIcs.FSTTCS.2020.9},
}
@inproceedings{ArrFLOW2021,
author = {E. Arrighi and
H. Fernau and
D. Lokshtanov and
M. de Oliveira Oliveira and
P. Wolf},
editor = {Z.{-}H. Zhou},
title = {Diversity in {K}emeny Rank Aggregation: {A} Parameterized Approach},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI}},
pages = {10--16},
publisher = {ijcai.org},
year = {2021},
doi = {10.24963/ijcai.2021/2},
}
@inproceedings{ArrFOW2021,
author = {E. Arrighi and
H. Fernau and
M. de Oliveira Oliveira and
P. Wolf},
editor = {F. Bonchi and
S.~J. Puglisi},
title = {Order Reconfiguration Under Width Constraints},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS}},
series = {LIPIcs},
volume = {202},
pages = {8:1--8:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
}
@inproceedings{ArrFHHJOW2021,
author = {E. Arrighi and
H. Fernau and
S. Hoffmann and
M. Holzer and
I. Jecker and
M. de Oliveira Oliveira and
P. Wolf},
editor = {M. Bojanczyk and
C. Chekuri},
title = {On the Complexity of Intersection Non-emptiness for Star-Free Language
Classes},
booktitle = {41st {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS}},
series = {LIPIcs},
volume = {213},
pages = {34:1--34:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
doi = {10.4230/LIPIcs.FSTTCS.2021.34},
}
@Phdthesis{Arr2022,
title = {Order-Related Problems Parameterized by Width},
author = {E. Arrighi},
school = {The University of Bergen, Norway},
year = {2022}
}
@inproceedings{ArrGMSW2023,
author = {E. Arrighi and
N. Gr{\"{u}}ttemeier and
N. Morawietz and
F. Sommer and
P. Wolf},
editor = {L. Gasieniec},
title = {Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic
Temporal Graphs},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science},
series = {LNCS},
volume = {13878},
pages = {283--297},
publisher = {Springer},
year = {2023},
}
@inproceedings{ArrFOW2023,
author = {E. Arrighi and
H. Fernau and
M. de Oliveira Oliveira and
P. Wolf},
title = {Synchronization and Diversity of Solutions},
booktitle = {The Thirty-Seventh AAAI Conference on Artificial Intelligence (AAAI-23)},
pages = {11516--11524},
publisher = {AAAI},
year = {2023},
yvolume={37},
yurl = {https://doi.org/10.1609/aaai.v37i10.26361},
ydoi = {10.1609/aaai.v37i10.26361},
}
@techreport{ArrFFMQW2023,
title={Defensive Alliances in Signed Networks},
author={E. Arrighi and Z. Feng and H. Fernau and K. Mann and X. Qi and P. Wolf},
year={2023},
institution = {Cornell Univ.},
eprint={2309.06801},
archivePrefix={arXiv},
primaryClass={cs.CC}
}
@article{ArrFOW2023a,
author = {E. Arrighi and
H. Fernau and
M. de Oliveira Oliveira and
P. Wolf},
title = {Order Reconfiguration under Width Constraints},
journal = jgaa,
volume = {27},
number = {6},
pages = {409--431},
year = {2023},
ydoi = {10.7155/JGAA.00628},
}
@Article{Art25,
author="Artin, E.",
title="Theorie der {Z}{\"o}pfe",
journal="Abhandlungen aus dem Mathematischen Seminar der Universit{\"a}t Hamburg",
year="1925",
volume="4",
number="1",
pages="47--72",
}
@ARTICLE{Artetal92,
AUTHOR = "P.~J. Artymiuk and P.~A. Bath and H.~M. Grindley and C.~A. Pepperrell and A.~R. Poirrette and D.~W. Rice and D.~A. Thorner and D.~J. Wild and P. Willett",
TITLE = "Similarity searching in databases of three-dimensional molecules",
JOURNAL = {J. Chemical Information and Computer Sciences},
YEAR = 1992,
month = "",
volume = 32,
number = "",
pages = "617--630",
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 = ""
}
@ARTICLE{AruFavSud2010,
AUTHOR = "S. Arumugam and O. Favoron and S. Sudha",
TITLE = "Irredundance saturation number of a graph",
JOURNAL = {Australasian Journal of Combinatorics},
YEAR = 2010,
month = "",
volume = 46,
number = "",
pages = "37--49",
copy = ""
}
@article{AruMatShe2013,
author = {S. Arumugam and
V. Mathew and
J. Shen},
title = {On fractional Metric Dimension of graphs},
journal = dmaa,
volume = {5},
number = {4},
year = {2013},
}
@article{AruJBT2013,
title = {Equality of domination and transversal numbers in hypergraphs},
journal = dam,
volume = {161},
number = {13},
pages = {1859--1867},
year = {2013},
author = {S. Arumugam and B.~K. Jose and Cs. Bujtás and Zs. Tuza},
}
@INPROCEEDINGS{ArvRam2002,
AUTHOR = "V. Arvind and V. Raman",
TITLE = "Approximation Algorithms for Some Parameterized Counting Problems",
BOOKTITLE = "Algorithms and Computation, 13th International Symposium, ISAAC
2002",
year={2002},
pages = "453--464",
publisher = {Springer},
series = {LNCS},
editor={P. Bose and P. Morin},
volume = {2518},
copy = ""}
@inproceedings{ArvJog2008,
author = {V. Arvind and
P.~S. Joglekar},
title = {Algorithmic Problems for Metrics on Permutation Groups},
booktitle = {{SOFSEM} 2008: Theory and Practice of Computer Science, 34th Conference
on Current Trends in Theory and Practice of Computer Science},
pages = {136--147},
editor = {V. Geffert and
J. Karhum{\"{a}}ki and
A. Bertoni and
B. Preneel and
P. N{\'{a}}vrat and
M. Bielikov{\'{a}}},
series = {LNCS},
volume = {4910},
publisher = {Springer},
year = {2008},
}
@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{Arv2013,
author = {V. Arvind},
title = {The Parameterized Complexity of Fixpoint Free Elements and Bases in
Permutation Groups},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC}},
pages = {4--15},
year = {2013},
editor = {G.~Z. Gutin and
S. Szeider},
series = {LNCS},
volume = {8246},
publisher = {Springer},
}
@article{Arv2017,
author = {V. Arvind},
title = {Finding fixed point free elements and small bases in permutation groups},
journal = tcs,
volume = {687},
pages = {70--78},
year = {2017},
}
@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{Asc2004,
author = {M. Aschbacher},
title = {The Status of the
Classification of the
Finite Simple Groups},
journal = {Notices of the AMS},
year = {2004},
volume = {51},
number = {7},
pages = {736--740},
}
@ARTICLE{AscKri2000,
AUTHOR = "G. Ascoli and J. L. Krichmar",
TITLE = "L-Neuron: a modeling tool for the efficient generation and parsimonious description of dendritic morphology",
JOURNAL = {Neurocomputing},
YEAR = 2000,
month = "",
volume = {32--33},
number = "",
pages = "1003--1011",
copy = ""
}
@article{AsdNik2007,
title = {{NP}-completeness results for some problems on subclasses of bipartite and chordal graphs},
journal = tcs,
volume = {381},
number = {1},
pages = {248--259},
year = {2007},
author = {K. Asdre and S.~D. Nikolopoulos},
}
@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{AshBBCDK2009,
author = {M.~V. Ashley and
T.~Y. Berger-Wolf and
P. Berman and
W. Art Chaovalitwongse and
B. DasGupta and
M.-Y. Kao},
title = {On approximating four covering and packing problems},
journal = jcss,
volume = {75},
number = {5},
year = {2009},
pages = {287--302},
}
@article{AshGer2016,
author = {P.~K. Ashraf and
K.~A. Germina},
title = {Double domination in signed graphs},
journal = {Cogent Mathematics},
volume = {3},
number = {1},
year = {2016},
pages = {1186135}, ydoi ={10.1080/23311835.2016.1186135}
}
@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{AspRic2015,
author = {A. Asperti and
W. Ricciotti},
title = {A formalization of multi-tape {T}uring machines},
journal = tcs,
volume = {603},
pages = {23--42},
year = {2015},
}
@article{AspTelPro2000,
author = {B. Aspvall and
J.~A. Telle and
A. Proskurowski},
title = {Memory Requirements for Table Computations in Partial $k$-Tree Algorithms},
journal = alg,
volume = {27},
number = {3},
pages = {382--394},
year = {2000},
}
@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{AssSei2007,
author = {Assent,I. and Seibert,S.},
title = {An upper bound for transforming self-verifying automata into deterministic ones},
journal = rairoita,
volume = {41},
issue = {03},
month = {7},
year = {2007},
pages = {261--265},
}
@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{AstAst2011,
author = {A. Ã…strÃ¶m and C. Ã…strÃ¶m },
title = {Circular knotworks consisting of pattern no. 295: a mathematical approach},
journal = {Journal of Mathematics and the Arts},
volume = {5},
number = {4},
pages = {185--197},
year = {2011},
}
@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{Asv2006,
author = {P.~R.~J. Asveld},
title = {Generating all permutations by context-free grammars in {C}homsky normal
form},
journal = tcs,
volume = {354},
number = {1},
pages = {118--130},
year = {2006},
}
@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 = ""
}
@InCollection{AtaSRW2007,
author = {A. Atanasiu and K.~G.Subramanian and K. Rangarajan and P.~S.~P.Wang},
title = {Finite Array Automata and Regular Array Grammars},
booktitle = {Formal Models, Languages and Applications},
pages = {1--16},
publisher = {World Scientific},
year = {2007},
editor = {K.~G. Subramanian and M. Mukund},
series = {MPAI},
}
@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},
}
@article{AtaTeh2016,
author = {A. Atanasiu and
W.~C. Teh},
title = {A New Operator over {P}arikh Languages},
journal = ijfcs,
volume = {27},
number = {6},
pages = {757--770},
year = {2016},
}
@article{AthCarKak2009,
author = {S. Athanassopoulos and
I. Caragiannis and
C. Kaklamanis},
title = {Analysis of Approximation Algorithms for \emph{k}-Set Cover Using
Factor-Revealing Linear Programs},
journal = tocs,
year = {2009},
volume = {45},
number = {3},
pages = {555--576},
}
@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{AthJun2018,
author = {N. Athanasopoulos and
R.~M. Jungers},
title = {Combinatorial methods for invariance and safety of hybrid systems},
journal = {Automatica},
volume = {98},
pages = {130--140},
year = {2018}
}
@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 = ""
}
@inproceedings{AtiCHKSZ2016,
author = {M.~F. Atig and
D. Chistikov and
P. Hofman and
K. Narayan Kumar and
P. Saivasan and
G. Zetzsche},
title = {The complexity of regular abstractions of one-counter languages},
booktitle = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer
Science, {LICS}},
pages = {207--216},
editor = {M. Grohe and
E. Koskinen and
N. Shankar},
publisher = {{ACM}},
year = {2016},
}
@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 = {}
}
@inproceedings{AtmLozRaz2012,
author = {A. Atminas and
V.~V. Lozin and
I. Razgon},
title = {Linear Time Algorithm for Computing a Small Biclique in Graphs without
Long Induced Paths},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium},
pages = {142--152},
year = {2012},
editor = {F.~V. Fomin and
P. Kaski},
series = {LNCS},
volume = {7357},
publisher = {Springer},
}
@PhdThesis{Atm2015,
author = {A. Atminas},
title = {Well-quasi-ordering of Combinatorial Structures},
school = {University of Warwick, UK},
year = {2015},
}
@article{AtmCLZ2015,
author = {A. Atminas and
A. Collins and
V. V. Lozin and
V. Zamaraev},
title = {Implicit representations and factorial properties of graphs},
journal = dm,
volume = {338},
number = {2},
pages = {164--179},
year = {2015},
}
@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{AugCHL2013,
title = "Watching systems in graphs: An extension of identifying codes",
journal = dam,
volume = "161",
number = "12",
pages = "1674--1685",
year = "2013",
author = "D. Auger and I. Charon and O. Hudry and A. Lobstein",
}
@article{AulPer01,
AUTHOR = "V. Auletta and P. Persiano",
TITLE = "Optimal pebble motion on a tree",
journal = icneu,
year = 2001,
volume=165,
pages={42--68},
}
@ARTICLE{AulMar2012,
author={F. Auli-Llinas and M.~W. Marcellin},
journal={IEEE Transactions on Image Processing},
title={Scanning Order Strategies for Bitplane Image Coding},
year={2012},
volume={21},
number={4},
pages={1920--1933},
month={April},
}
@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{AusEMP2009,
title = "Reoptimization of minimum and maximum traveling salesman's tours",
journal = jda,
volume = "7",
number = "4",
pages = "453--463",
year = "2009",
author = "G. Ausiello and B. Escoffier and J. Monnot and V. Th. Paschos",
}
@article{AusLau2017,
title = "Directed hypergraphs: Introduction and fundamental algorithmsâ€”A survey",
journal = tcs,
volume = "658",
pages = "293--306",
year = "2017",
author = "G. Ausiello and L. Laura",
}
@ARTICLE{Ausetal93,
AUTHOR = "J. Auslander and others",
TITLE = "Optimal Leapfrogging",
JOURNAL = mm,
YEAR = 1993,
month = "",
volume = 66,
number = "1",
pages = "14--19",
copy = ""
}
@article{AusDieHer2003,
author = {H. Austinat and
V. Diekert and
U. Hertrampf},
title = {A structural property of regular frequency computations},
journal = tcs,
volume = {292},
number = {1},
pages = {33--43},
year = {2003},
}
@article{AusDHP2005,
author = {H. Austinat and
V. Diekert and
U. Hertrampf and
H. Petersen},
title = {Regular frequency computations},
journal = tcs,
volume = {330},
number = {1},
pages = {15--21},
year = {2005},
}
@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},
}
@article{AweBRS99,
author = {B. Awerbuch and
M. Betke and
R.~L. Rivest and
M. Singh},
title = {Piecemeal Graph Exploration by a Mobile Robot},
journal = ic,
volume = {152},
number = {2},
pages = {155--172},
year = {1999},
}
@article{AxeBen93,
author = {R. Axelrod and
D.~S. Bennet},
title = {A landscape theory of aggregation},
journal = {British Journal of Political Science},
volume = {23},
pages = {211--233},
year = {1993},
}
@article{AxeHolKut2017,
author = {H.~B. Axelsen and
M. Holzer and
M. Kutrib},
title = {The Degree of Irreversibility in Deterministic Finite Automata},
journal = ijfcs,
volume = {28},
number = {5},
pages = {503--522},
year = {2017},
}
@article{AxeBHW2013,
author = {M. Axenovich and
A. Beveridge and
J.~P. Hutchinson and
D.~B. West},
title = {Visibility Number of Directed Graphs},
journal = siamdm,
volume = {27},
number = {3},
pages = {1429--1449},
year = {2013},
}
@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{AyaMCMT2017,
author = {V. Ayala{-}Rivera and
P. McDonagh and
T. Cerqueus and
L. Murphy and
C. Thorpe},
title = {Enhancing the Utility of Anonymized Data by Improving the Quality
of Generalization Hierarchies},
journal = {Transactions on Data Privacy},
volume = {10},
number = {1},
pages = {27--59},
year = {2017},
}
@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{AzaBFLNE2002,
author = {Y. Azar and
J. Boyar and
L. M. Favrholdt and
K. S. Larsen and
M. N. Nielsen and
L. Epstein},
title = {Fair versus Unrestricted Bin Packing},
journal = alg,
volume = {34},
number = {2},
pages = {181--196},
year = {2002},
}
@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 = ""
}
@article{AziRadKam2023,
author = {N. A. A. Aziz and
N. J. Rad and
H. Kamarulhaili},
title = {Roman {\(k\)}-domination revisited},
journal = {{RAIRO} Operations Research},
volume = {57},
number = {3},
pages = {1209--1217},
year = {2023},
ydoi = {10.1051/RO/2023072},
}
BBBB
@inproceedings{BabLukSer87,
author = {L. Babai and
E. M. Luks and
{\'{A}}. Seress},
editor = {A.~V. Aho},
title = {Permutation Groups in {NC}},
booktitle = {Proceedings of the 19th Annual {ACM} Symposium on Theory of Computing, STOC},
pages = {409--420},
publisher = {{ACM}},
year = {1987},
}
@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{BabQuaShi2016,
author = {P. Babari and
K. Quaas and
M. Shirmohammadi},
title = {Synchronizing data words for register automata},
pages = {15:1--15:15},
year = {2016},
editor = {P. Faliszewski and
A. Muscholl and
R. Niedermeier},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS}},
series = {LIPIcs},
volume = {58},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
}
@article{BabGenKho2015,
author = {M. Babbitt and
J. Geneson and
T. Khovanova},
title = {On $k$-visibility graphs},
journal = jgaa,
volume = {19},
number = {1},
pages = {345--360},
year = {2015},
}
@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{BabOGoAsp2013,
author = {Babbush, R. and O'Gorman, B. and Aspuru-Guzik, A.},
title = {Resource efficient gadgets for compiling adiabatic quantum optimization problems},
journal = {Annalen der Physik},
volume = {525},
number = {10-11},
pages = {877--888},
}
@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{BacBSSS2011,
author = {Ba\v{c}a, M. and E.~T. Baskoro and A.~N.~M. Salman and S.~W. Saputro and D. Suprijanto},
title = {The metric dimension of regular bipartite graphs},
journal = {Bull. Math. Soc. Sci. Math. Roumanie},
year = {2011},
OPTkey = {},
volume = {54(102)},
number = {1},
pages = {15--28},
}
@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 = {}
}
@article{BacBGH2015,
author = {C. Bachmaier and
F.~J. Brandenburg and
A. Glei{\ss}ner and
A. Hofmeier},
title = {On the hardness of maximum rank aggregation problems},
journal = jda,
volume = {31},
pages = {2--13},
year = {2015},
}
@article{BacParRos2013,
title = "Computing cooperative solution concepts in coalitional skill games",
journal = "Artificial Intelligence",
volume = "204",
number = "0",
pages = "1--21",
year = "2013",
author = "Y. Bachrach and D.~C. Parkes and J.~S. Rosenschein",
}
@inproceedings{BacTza2017,
author = {A. Backurs and
C. Tzamos},
title = {Improving {V}iterbi is Hard: Better Runtimes Imply Faster Clique Algorithms},
booktitle = {Proceedings of the 34th International Conference on Machine Learning,
{ICML}},
pages = {311--321},
year = {2017},
editor = {D. Precup and
Y. Whye Teh},
series = {Proceedings of Machine Learning Research},
volume = {70},
publisher = {{PMLR}},
}
@article{BacInd2018,
author = {A. Backurs and
P. Indyk},
title = {Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless
{SETH} is False)},
journal = siam,
volume = {47},
number = {3},
pages = {1087--1097},
year = {2018},
}
@article{BacBTT2019,
author = {G. Bacs{\'{o}} and
Cs. Bujt{\'{a}}s and
C. Tompkins and
Zs. Tuza},
title = {Disjoint Paired-Dominating sets in Cubic Graphs},
journal = {Graphs and Combinatorics},
volume = {35},
number = {5},
pages = {1129--1138},
year = {2019},
ydoi = {10.1007/s00373-019-02063-w},
}
@article{Bad2011,
author = {M. Bader},
title = {The transposition median problem is {NP}-complete},
journal = tcs,
volume = {412},
number = {12-14},
pages = {1099--1110},
year = {2011},
}
@article{BadVag2017,
title = "Characterization of context-free languages",
journal = tcs,
volume = "676",
number = "Supplement C",
pages = "92--96",
year = "2017",
author = "M. Badano and D. Vaggione",
}
@article{BaeSpa69,
author = {R.~M. Baer and
E.~H. Spanier},
title = {Referenced Automata and Metaregular Families},
journal = jcss,
volume = {3},
number = {4},
pages = {423--446},
year = {1969},
}
@inproceedings{BaeCuiTil2008,
author = {J.~C.~M. Baeten and
P.~J. L. Cuijpers and
P. J. A. van Tilburg},
title = {A Context-Free Process as a Pushdown Automaton},
pages = {98--113},
editor = {F. van Breugel and
M. Chechik},
booktitle = {Concurrency Theory, 19th International Conference,
{CONCUR}},
series = {LNCS},
volume = {5201},
publisher = {Springer},
year = {2008},
}
@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},
}
@article{BahrHSX2013,
author = {A. Bahremandpour and
{Fu-T.} Hu and
S.~M. Sheikholeslami and
{J.-M.} Xu},
title = {On the {R}oman bondage Number of a Graph},
journal = dmaa,
year = {2013},
volume = {5},
number = {1},
}
@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},
}
@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 = ""
}
@inproceedings{Bai2018,
author = {U. Baier},
editor = {G. Navarro and
D. Sankoff and
B. Zhu},
title = {On Undetected Redundancy in the {B}urrows-{W}heeler Transform},
booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM}},
series = {LIPIcs},
volume = {105},
pages = {3:1--3:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
}
@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},
}
@Article{BaiCam2011,
author = {Bailey, R.~F. and Cameron, P.~J.},
title = {Base size, metric dimension an other invariants of groups and graphs},
journal = blms,
year = {2011},
volume = {43},
pages = {209--242},
}
@inproceedings{BaiDenRal2009,
author = {R. Bailly and
F. Denis and
L. Ralaivola},
title = {Grammatical inference as a principal component analysis problem},
booktitle = {Proceedings of the 26th Annual International Conference on Machine
Learning, {ICML}},
year = {2009},
pages = {33--40},
editor = {A. Pohoreckyj Danyluk and
L. Bottou and
M. L. Littman},
series = {{ACM} International Conference Proceeding Series},
volume = {382},
publisher = {{ACM}},
}
@inproceedings{BaiHabDen2010,
author = {R. Bailly and
A. Habrard and
F. Denis},
title = {A Spectral Approach for Probabilistic Grammatical Inference on Trees},
booktitle = {Algorithmic Learning Theory, 21st International Conference, {ALT}},
year = {2010},
pages = {74--88},
editor = {M. Hutter and
F. Stephan and
V. Vovk and
T. Zeugmann},
series = {LNCS},
volume = {6331},
publisher = {Springer},
}
@article{BaiDen2011,
author = {R. Bailly and
F. Denis},
title = {Absolute convergence of rational series is semi-decidable},
journal = ic,
year = {2011},
volume = {209},
number = {3},
pages = {280--295},
}
@inproceedings{BaiCLQ2013,
author = {R. Bailly and
X. Carreras and
F. M. Luque and
A. Quattoni},
title = {Unsupervised Spectral Learning of {WCFG} as Low-rank Matrix Completion},
booktitle = {Proceedings of the 2013 Conference on Empirical Methods in Natural
Language Processing, {EMNLP} 2013. {A} meeting of SIGDAT, a Special
Interest Group of the {ACL}},
year = {2013},
pages = {624--635},
publisher = {{ACL}},
}
@inproceedings{BaiCarQua2013,
author = {R. Bailly and
X. Carreras and
A. Quattoni},
title = {Unsupervised Spectral Learning of Finite State Transducers},
booktitle = {Advances in Neural Information Processing Systems 26, NIPS},
year = {2013},
pages = {800--808},
editor = {C. J. C. Burges and
L. Bottou and
Z. Ghahramani and
K. Q. Weinberger},
}
@inproceedings{BaiPHWBKH2022,
author = {A. Bailoni and
C. Pape and
N. H{\"{u}}tsch and
S. Wolf and
T. Beier and
A. Kreshuk and
F. A. Hamprecht},
title = {{GASP}, a generalized framework for agglomerative clustering of signed
graphs and its application to Instance Segmentation},
booktitle = {{IEEE/CVF} Conference on Computer Vision and Pattern Recognition,
{CVPR}},
pages = {11635--11645},
publisher = {{IEEE}},
year = {2022},
ydoi = {10.1109/CVPR52688.2022.01135},
}
@article{BaiBBCMMV2014,
author = {W. Baird and A. Beveridge and A. Bonato and P. Codenotti and A. Maurer and J. McCauley and S. Valeva},
title = {On the minimum order of \$k\$-cop win graphs},
journal = {Contributions to Discrete Mathematics},
volume = {9},
number = {1},
year = {2014},
}
@article {BakFisRob72,
author = {Baker, K.~A. and Fishburn, P.~C. and Roberts, F.~S.},
title = {Partial orders of dimension 2},
journal = {Networks},
volume = {2},
pages = {11--28},
year = {1972},
}
@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{Bal2002,
author = {S. Bala},
editor = {P. Widmayer and
F. Triguero Ruiz and
R. Morales Bueno and
M. Hennessy and
S. J. Eidenbenz and
R. Conejo},
title = {Intersection of Regular Languages and Star Hierarchy},
booktitle = {Automata, Languages and Programming, 29th International Colloquium,
{ICALP}.},
series = {LNCS},
volume = {2380},
pages = {159--169},
publisher = {Springer},
year = {2002}
}
@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{Bal2017,
author = {S. Balamurugan},
title = {Changing and unchanging isolate domination: Edge removal},
journal = dmaa,
volume = {9},
number = {1},
pages = {1750003},
year = {2017},
}
@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},
}
@Inbook{BalMSPW2017,
author="Balasingam, B. and Mannaru, P. and Sidoti, D.
and Pattipati, K.
and Willett, P.",
editor="Pedrycz, W.
and Chen, S.-M.",
title="Online Anomaly Detection in Big Data: The First Line of Defense Against Intruders",
bookTitle="Data Science and Big Data: An Environment of Computational Intelligence",
year="2017",
publisher="Springer International Publishing",
pages="83--107",
}
@Article{Baletal2002,
author = {S. Balasubramanian and J. Farr and K. Bernasconi and R. Laskar and J. Villalpando and K. Hutson and G. Stevens and M. Gairing and S.~T. Hedetniemi},
title = {Gallai theorems involving domination parameters},
journal = {Congressus Numerantium},
year = {2002},
volume = {157},
pages = {149--157},
}
@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{BalThe2021,
author = {A. R. Balasubramanian and
K. S. Thejaswini},
editor = {S. Haddad and
D. Varacca},
title = {Adaptive Synchronisation of Pushdown Automata},
booktitle = {32nd International Conference on Concurrency Theory, {CONCUR}},
series = {LIPIcs},
volume = {203},
pages = {17:1--17:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
}
@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 = ""
}
@inproceedings{BalRSV2017,
author = {M. Ball and
A. Rosen and
M. Sabin and
P. Nalini Vasudevan},
editor = {H. Hatami and
P. McKenzie and
V. King},
title = {Average-case fine-grained hardness},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC}},
pages = {483--496},
publisher = {{ACM}},
year = {2017},
}
@article{BalCasGav2013,
author = {B. Balle and
J. Castro and
R. Gavald{\`a}},
title = {Learning probabilistic automata: A study in state distinguishability},
journal = tcs,
volume = {473},
year = {2013},
pages = {46--60},
}
@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},
}
@article{BalMas2021,
author = {J. Balun and
T. Masopust},
title = {On verification of {D}-detectability for discrete event systems},
journal = {Automatica},
volume = {133},
pages = {109884},
year = {2021},
}
@InProceedings{BanKhu2001,
author = {S. Banerjee and S. Khuller},
title = {A clustering scheme for hierarchical control in
multi-hop wireless networks},
booktitle = {Proceedings of 20th Joint Conference
of the IEEE Computer and Communications Societies (INFO-
COM'01)},
pages = {1028--1037},
year = {2001},
publisher = {IEEE Society Press},
}
@article{BanBBBDMR2017,
author = {S. Banerjee and
B. B. Bhattacharya and
B. Bhattacharya and
A. Biswas and
S. Das and
R. Mandal and
S. Roy},
title = {On representing a simple polygon perceivable to a blind person},
journal = ipl,
volume = {120},
pages = {1--5},
year = {2017},
}
@article{BanKeiPra2019,
title = {Perfect {R}oman domination in graphs},
journal = tcs,
volume = {796},
pages = {1--21},
year = {2019},
ydoi = {https://doi.org/10.1016/j.tcs.2019.08.017},
author = {S. Banerjee and J.~M. Keil and D. Pradhan},
}
@article{BanHenPra2020,
author = {S. Banerjee and
M.~A. Henning and
D. Pradhan},
title = {Algorithmic results on double {R}oman domination in graphs},
journal = joco,
volume = {39},
number = {1},
pages = {90--114},
year = {2020},
}
@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 = ""
}
@article{BanMul86,
author = {H.{-}J. Bandelt and
H.~M. Mulder},
title = {Distance-hereditary graphs},
journal = jcthb,
volume = {41},
number = {2},
pages = {182--208},
year = {1986},
}
@article{Ban88a,
author = {H.{-}J. Bandelt},
title = {Hereditary modular graphs},
journal = {Combinatorica},
volume = {8},
number = {2},
pages = {149--157},
year = {1988},
}
@article{BanDre94,
author = {H.{-}J. Bandelt and
A.~W.~M. Dress},
title = {An order theoretic framework for overlapping clustering},
journal = dm,
volume = {136},
number = {1-3},
pages = {21--37},
year = {1994},
}
@article{BanChe98,
author = {H.{-}J. Bandelt and
V. Chepoi},
title = {Embedding into the rectilinear grid},
journal = {Networks},
volume = {32},
number = {2},
pages = {127--132},
year = {1998},
}
@article{BanHubMou2002,
author = {H.{-}J. Bandelt and
K.~T. Huber and
V. Moulton},
title = {Quasi-median graphs from sets of partitions},
journal = dam,
volume = {122},
number = {1-3},
pages = {23--35},
year = {2002},
}
@article{BanChe2003,
author = {H.{-}J. Bandelt and
V. Chepoi},
title = {1-Hyperbolic Graphs},
journal = siamdm,
volume = {16},
number = {2},
pages = {323--334},
year = {2003},
}
@inproceedings{BanOTKY2009,
author = {Y. Bandoh and
H. Ohbayashi and
S. Takamura and
K. Kamikura and
Y. Yashima},
title = {Mathematical analysis of the energy compaction affected by the dimensionality
of {K}arhunen-{L}o{\`{e}}ve transform},
booktitle = {Proceedings of the International Conference on Image Processing, {ICIP}},
pages = {21--24},
publisher = {{IEEE}},
year = {2009},
}
@PHDTHESIS{Ban82,
AUTHOR = "C. Bandt",
TITLE = "Zum Zusammenhang von Ma\ss\ und Metrik",
SCHOOL = "Ernst-Moritz-Arndt Universit{\"a}t Greifswald",
YEAR = 1982,
month = "",
address = "",
type = "Dissertation",
copy = ""
}
@ARTICLE{Ban83,
AUTHOR = "C. Bandt",
TITLE = "Many measures are {H}ausdorff measures",
JOURNAL = bpasm,
YEAR = 1983,
month = "",
volume = 31,
number = "3--4",
pages = "107--114",
copy = ""
}
@INPROCEEDINGS{Ban88,
crossref = "Banetal88",
AUTHOR = "C. Bandt",
TITLE = "Self-similar sets 4. {T}opology and measure",
chapter = "Geometric measure theory",
pages = "8--16",
copy = ""
}
@ARTICLE{Ban89,
AUTHOR = "C. Bandt",
TITLE = "Self-similar sets. {I}. {T}opological {M}arkov chains
and mixed self-similar sets",
JOURNAL = mn,
YEAR = 1989,
month = "",
volume = 142,
number = "",
pages = "107--123",
copy = ""
}
@ARTICLE{Ban89a,
AUTHOR = "C. Bandt",
TITLE = "Self-similar sets 3. {C}onstructions with sofic systems",
JOURNAL = monmath,
YEAR = 1989,
month = "",
volume = 108,
number = "",
pages = "89--102",
copy = ""
}
@ARTICLE{Ban91,
AUTHOR = "C. Bandt",
TITLE = "Self-similar sets 5. {I}nteger matrices and fractal
tilings of {${\BBb R}^n$}",
JOURNAL = pams,
YEAR = 1991,
month = jun,
volume = 112,
number = "2",
pages = "549--562",
copy = ""
}
@ARTICLE{BanFei81,
AUTHOR = "C. Bandt and U. Feiste",
TITLE = "Some questions and examples concerning {H}ausdorff measures",
JOURNAL = mn,
YEAR = 1981,
month = "",
volume = 104,
number = "",
pages = "171--182",
copy = ""
}
@INPROCEEDINGS{BanFei84,
crossref = "Flaetal84",
AUTHOR = "C. Bandt and U. Feiste",
TITLE = "Which measures are {H}ausdorff measures",
chapter = "Part 1",
pages = "32--43",
copy = ""
}
@ARTICLE{BanGra92,
AUTHOR = "C. Bandt and S. Graf",
TITLE = "Self-similar sets 7. {A} characterization of
self-similar fractals with positive {H}ausdorff measure",
JOURNAL = pams,
YEAR = 1992,
month = apr,
volume = 114,
number = "4",
pages = "995--1001",
copy = ""
}
@TECHREPORT{BanKel90,
AUTHOR = "C. Bandt and K. Keller",
TITLE = "Self-similar sets 2. {A} simple approach to the
topological structure of fractals",
INSTITUTION = "Ernst-Moritz-Arndt-Universit{\"a}t Greifswald (DDR)",
YEAR = 1990,
month = "",
number = "Preprint-Reihe Mathematik 24",
address = "",
copy = ""
}
@ARTICLE{BanRet92,
AUTHOR = "C. Bandt and T. Retta",
TITLE = "Topological spaces admitting a unique fractal structure",
JOURNAL = fundmath,
YEAR = 1992,
month = "",
volume = 141,
number = "",
pages = "257--268",
copy = ""
}
@INPROCEEDINGS{BanStu88,
crossref = "Hyper3",
AUTHOR = "P. Banerjee and C. B. Stunkel",
TITLE = "A novel approach to system-level fault tolerance in
hypercube multiprocessors",
chapter = "6",
pages = "307--311",
copy = ""
}
@ARTICLE{Banetal90,
AUTHOR = "P. Banerjee and others",
TITLE = "Algorithm-based fault tolerance on a hypercube multiprocessor",
JOURNAL = ieeetoc,
YEAR = 1990,
month = "",
volume = 39,
number = "9",
pages = "1132--1145",
copy = ""
}
@ARTICLE{BanChaPra2023,
AUTHOR = "S. Banerjee and J. Chaudhary and D. Pradhan",
TITLE = "Unique Response {R}oman Domination: Complexity and Algorithms",
JOURNAL = alg,
YEAR = 2023,
doi = {10.1007/s00453-023-01171-7},
month = "",
yvolume = {},
ynumber = {},
ypages = "to appear",
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{BanPol91,
author = {J. Bang{-}Jensen and
S. Poljak},
title = {Eulerian trails through a set of terminals in specific, unique and
all orders},
booktitle = {Graph Structure Theory, Proceedings of a {AMS-IMS-SIAM} Joint Summer
Research Conference on Graph Minors held June 22 to July 5, 1991,
at the University of Washington, Seattle},
pages = {247--258},
editor = {N. Robertson and
P.~D. Seymour},
series = {Contemporary Mathematics},
year = {1993},
volume = {147},
publisher = {American Mathematical Society},
}
@article{BanGut97,
author = {J. Bang{-}Jensen and
G. Gutin},
title = {Alternating cycles and paths in edge-coloured multigraphs: {A} survey},
journal = dm,
volume = {165-166},
pages = {39--60},
year = {1997},
}
@article{BanHavTro2012,
title = "Finding an induced subdivision of a digraph",
journal = tcs,
volume = "443",
number = "0",
pages = "10--24",
year = "2012",
note = "",
doi = "http://dx.doi.org/10.1016/j.tcs.2012.03.017",
author = "J. Bang-Jensen and F. Havet and N. Trotignon",
}
@inproceedings{BanKPS2017,
author = {A. Banik and
M. J. Katz and
E. Packer and
M. Simakov},
title = {Tracking Paths},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}},
pages = {67--79},
editor = {D. Fotakis and
A. Pagourtzis and
V. Th. Paschos},
series = {LNCS},
volume = {10236},
year = {2017},
}
@inproceedings{BanP0SS2017,
author = {A. Banik and
F. Panolan and
V. Raman and
V. Sahlot and
S. Saurabh},
title = {Parameterized Complexity of Geometric Covering Problems Having Conflicts},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}},
pages = {61--72},
editor = {F. Ellen and
A. Kolokolova and
J.{-}R. Sack},
series = {LNCS},
volume = {10389},
publisher = {Springer},
year = {2017},
}
@inproceedings{BanCho2018,
author = {A. Banik and
P. Choudhary},
title = {Fixed-Parameter Tractable Algorithms for Tracking Set Problems},
booktitle = {Algorithms and Discrete Applied Mathematics - 4th International Conference,
{CALDAM}},
pages = {93--104},
year = {2018},
editor = {B. S. Panda and
P. P. Goswami},
series = {LNCS},
volume = {10743},
publisher = {Springer},
}
@inproceedings{BanCLRS2018,
author = {A. Banik and
P. Choudhary and
D. Lokshtanov and
V. Raman and
S. Saurabh},
title = {A Polynomial Sized Kernel for Tracking Paths Problem},
booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium},
pages = {94--107},
year = {2018},
editor = {M.~A. Bender and
M. Farach{-}Colton and
M.~A. Mosteiro},
series = {LNCS},
volume = {10807},
publisher = {Springer},
}
@article{BanCLRS2020,
author = {A. Banik and
P. Choudhary and
D. Lokshtanov and
V. Raman and
S. Saurabh},
title = {A Polynomial Sized Kernel for Tracking Paths Problem},
journal = alg,
volume = {82},
number = {1},
pages = {41--63},
year = {2020},
}
@InProceedings{BanTan2018,
author ={M. Bannach and T. Tantau},
title ={Computing Hitting Set Kernels By {$AC^0$}-Circuits},
booktitle ={35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages ={9:1--9:14},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2018},
volume ={96},
editor ={R. Niedermeier and B. Vall{\'e}e},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@article{BanTan2021,
title={On the Descriptive Complexity of Color Coding}, volume={14}, ISSN={1999-4893}, url={http://dx.doi.org/10.3390/a14030096}, DOI={10.3390/a14030096}, number={3}, journal={Algorithms}, publisher={MDPI AG}, author={Bannach, M. and Tantau, T.}, year={2021}, month={Mar}, pages={96}}
@article{BanGagI2020,
author = {H. Bannai and
T. Gagie and
T. I},
title = {Refining the \emph{r}-index},
journal = tcs,
volume = {812},
pages = {96--108},
year = {2020},
}
@article{BanEppSim2012,
author = {M.~J. Bannister and
D. Eppstein and
J.~A. Simons},
title = {Inapproximability of Orthogonal Compaction},
journal = jgaa,
volume = {16},
number = {3},
pages = {651--673},
year = {2012}}
@article{BanBluCha2004,
author = {N. Bansal and
A. Blum and
S. Chawla},
title = {Correlation Clustering},
journal = {Machine Learning},
volume = {56},
number = {1-3},
pages = {89--113},
year = {2004},
}
@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},
}
@inproceedings{BanKriSah2011,
author = {N. Bansal and
R. Krishnaswamy and
B. Saha},
title = {On Capacitated Set Cover Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} and 15th
International Workshop, {RANDOM}},
pages = {38--49},
year = {2011},
editor = {L.~A. Goldberg and
K. Jansen and
R. Ravi and
J. D. P. Rolim},
series = {LNCS},
volume = {6845},
publisher = {Springer},
}
@article{BanGNV2018,
author = {N. Bansal and
S. Garg and
J. Nederlof and
N. Vyas},
title = {Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related
Problems},
journal = siam,
volume = {47},
number = {5},
pages = {1755--1777},
year = {2018},
}
@inproceedings{BanBBBFH2022,
author = {B. Banyassady and
M. de Berg and
K. Bringmann and
K. Buchin and
H. Fernau and
D. Halperin and
I. Kostitsyna and
Y. Okamoto and
S. Slot},
editor = {X. Goaoc and
M. Kerber},
title = {Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds},
booktitle = {38th International Symposium on Computational Geometry, SoCG},
series = {LIPIcs},
volume = {224},
pages = {12:1--12:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
}
@article{BapGutXia2003,
author = {Bapat, R.B. and
Gutman, I. and W. Xiao},
title = {A Simple Method for Computing Resistance Distance},
journal = {Zeitschrift f{\"u}r Naturforschung A},
volume = {53},
pages = {494--498},
year = {2003},
}
@article{Bap2004,
author = {Bapat, R.B.},
title = {Resistance matrix of a weighted graph},
journal = {MATCH: Communications in Mathematical and in Computer Chemistry},
volume = {50},
pages = {73--82},
year = {2004},
}
@article{BapGup2010,
author = {Bapat, R.B. and
Gupta, S.},
title = {Resistance distance in wheels and fans},
journal = {Indian J. Pure Appl. Math.},
volume = {41},
pages = {1--13},
year = {2010},
}
@article{BarEBN2008,
author = {C. Baral and
T. Eiter and
M. Bj{\"{a}}reland and
M. Nakamura},
title = {Maintenance goals of agents in a dynamic environment: Formulation
and policy construction},
journal = {Artifial Intelligence},
volume = {172},
number = {12-13},
pages = {1429--1469},
year = {2008}, }
@inproceedings{BarKar0001,
author = {I. B{\'{a}}r{\'{a}}ny and
Gy. K{\'{a}}rolyi},
title = {Problems and Results around the {E}rd{\H{o}}s-{S}zekeres Convex Polygon
Theorem},
booktitle = {Discrete and Computational Geometry, Japanese Conference, {JCDCG} 2000},
pages = {91--105},
editor = {J. Akiyama and
M. Kano and
M. Urabe},
series = {LNCS},
volume = {2098},
publisher = {Springer},
year = {2001},
}
@inproceedings{BarLodSer2006,
author = {V. B{\'{a}}r{\'{a}}ny and
C. L{\"{o}}ding and
O. Serre},
title = {Regularity Problems for Visibly Pushdown Languages},
booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
Science},
pages = {420--431},
editor = {B. Durand and
W. Thomas},
series = {LNCS},
volume = {3884},
publisher = {Springer},
year = {2006},
}
@article{BarOkh2014,
author = {M. Barash and
A. Okhotin},
title = {An extension of context-free grammars with one-sided context specifications},
journal = ic,
volume = {237},
pages = {268--293},
year = {2014},
}
@article{BarOkh2015,
author = {M. Barash and
A. Okhotin},
title = {Linear grammars with one-sided contexts and their automaton representation},
journal = rairo,
volume = {49},
number = {2},
pages = {153--178},
year = {2015},
}
@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 = ""
}
@inproceedings{BarPer2015,
author = {J. Barbay and
P. P{\'{e}}rez{-}Lantero},
title = {Adaptive Computation of the Swap-Insert Correction Distance},
booktitle = {String Processing and Information Retrieval - 22nd International Symposium,
{SPIRE}},
pages = {21--32},
year = {2015},
editor = {C. S. Iliopoulos and
S. J. Puglisi and
E. Yilmaz},
series = {LNCS},
volume = {9309},
publisher = {Springer},
}
@article{BarPer2018,
author = {J. Barbay and
P. P{\'{e}}rez{-}Lantero},
title = {Adaptive Computation of the Swap-Insert Correction Distance},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {4},
pages = {49:1--49:16},
year = {2018},
}
@article{BarGJSY2016,
author = {F. Barbero and
G. Gutin and
M. Jones and
B. Sheng and
A. Yeo},
title = {Linear-vertex kernel for the problem of packing $r$-stars into a graph
without long induced paths},
journal = ipl,
volume = {116},
number = {6},
pages = {433--436},
year = {2016},
}
@inproceedings{BarPauPil2017,
author = {F. Barbero and
C. Paul and
M. Pilipczuk},
title = {Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete
Digraphs},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP}},
pages = {70:1--70:13},
year = {2017},
editor = {I. Chatzigiannakis and
P. Indyk and
F. Kuhn and
A. Muscholl},
series = {LIPIcs},
volume = {80},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
}
@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{BarCFFH95,
author = {C. Barefoot and
K. Casey and
D. C. Fisher and
K. Fraughnaugh and
F. Harary},
title = {Size in maximal triangle-free graphs and minimal graphs of diameter
2},
journal = dm,
volume = {138},
number = {1-3},
pages = {93--99},
year = {1995},
}
@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 = ""
}
@article{BarFalHog2004,
title = "Computation of minimal rank and path cover number for certain graphs",
journal = "Linear Algebra and its Applications",
volume = "392",
number = "Supplement C",
pages = "289--303",
year = "2004",
author = "F. Barioli and S. Fallat and L. Hogben",
}
@article{BarFalHog2005,
title = "On the difference between the maximum multiplicity and path cover number for tree-like graphs",
journal = "Linear Algebra and its Applications",
volume = "409",
number = "Supplement C",
pages = "13--31",
year = "2005",
author = "F. Barioli and S. Fallat and L. Hogben",
}
@article{BarBFHHSDH2010,
author = {F. Barioli and
W. Barrett and
S.~M. Fallat and
H.~T. Hall and
L. Hogben and
B.~L. Shader and
P. van den Driessche and
H. van der Holst},
title = {Zero forcing parameters and minimum rank problems},
journal = {Linear Algebra and its Applications},
volume = {433},
pages = {401--411},
year = {2010},
}
@article{BarFMN2011,
author = {F. Barioli and
S.~M. Fallat and
L. H. Mitchell and S. K. Narayan},
title = {Minimum semidefinite rank of outerplanar graphs and the tree cover number},
journal = {Electron. J. Linear Algebra},
volume = {22},
pages = {10--21},
year = {2011},
}
@article{BarBFHHSDH2013,
author = {F. Barioli and
W. Barrett and
S.~M. Fallat and
H.~T. Hall and
L. Hogben and
B.~L. Shader and
P. van den Driessche and
H. van der Holst},
title = {Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity
of a Graph},
journal = jgth,
volume = {72},
number = {2},
pages = {146--177},
year = {2013},
}
@inproceedings{BarShi2023,
author = {R. D. Barish and
T. Shibuya},
editor = {L. Gasieniec},
title = {Hardness of Bounding Influence via Graph Modification},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science},
series = {LNCS},
volume = {13878},
pages = {129--143},
publisher = {Springer},
year = {2023},
}
@INPROCEEDINGS{Bark88,
crossref = "KowBow88",
AUTHOR = "J. Barklund",
TITLE = "Condition graphs",
chapter = "",
pages = "435--446",
copy = ""
}
@inproceedings{BarKup2018,
author = {S. Barlocco and
C. Kupke},
editor = {S. N. Art{\"{e}}mov and
A. Nerode},
title = {Angluin Learning via Logic},
booktitle = {Logical Foundations of Computer Science - International Symposium,
{LFCS}},
series = {LNCS},
volume = {10703},
pages = {72--90},
publisher = {Springer},
year = {2018},
}
@inproceedings{BarKupRot2019,
author = {S. Barlocco and
C. Kupke and
J. Rot},
editor = {M. Bojanczyk and
A. Simpson},
title = {Coalgebra Learning via Duality},
booktitle = {Foundations of Software Science and Computation Structures - 22nd
International Conference, {FOSSACS}},
series = {LNCS},
volume = {11425},
pages = {62--79},
publisher = {Springer},
year = {2019},
}
@inproceedings{BarFLM2020,
author = {C. Barloy and
N. Fijalkow and
N. Lhote and
F. Mazowiecki},
editor = {M. Fern{\'{a}}ndez and
A. Muscholl},
title = {A Robust Class of Linear Recurrence Sequences},
booktitle = {28th {EACSL} Annual Conference on Computer Science Logic, {CSL}},
series = {LIPIcs},
volume = {152},
pages = {9:1--9:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
}
@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{BarDow2017,
author = {G. Barmpalias and
R.~G. Downey},
title = {Kobayashi compressibility},
journal = tcs,
volume = {675},
pages = {89--100},
year = {2017},
}
@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 = ""
}
@incollection{Bar2009a,
author = {J.~H. Barnett},
title = {Early Writings on Graph Theory: {H}amiltonian Circuits and The Icosian Game},
editor = {Hopkins, B.},
booktitle = {Resources for Teaching Discrete Mathematics: Classroom Projects, History Modules, and Articles},
publisher = {Mathematical Association of America},
year = 2009,
series = {MAA Notes},
volume = 74,
pages = {217--224}
}
@article{BarNoyMotNao92,
author = {A. Bar{-}Noy and
R. Motwani and
J. Naor},
title = {The Greedy Algorithm is Optimal for On-Line Edge Coloring},
journal = ipl,
volume = {44},
number = {5},
pages = {251--253},
year = {1992},
}
@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 = siamjma,
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},
}
@article{BarFer2011,
author = {R. Barrera and
D. Ferrero},
title = {Power domination in cylinders, tori, and generalized {P}etersen graphs},
journal = {Networks},
volume = {58},
number = {1},
pages = {43--49},
year = {2011},
}
@article{Baretal2006,
title = "Complexity of reachability problems for finite discrete dynamical systems",
journal = jcss,
volume = "72",
number = "8",
pages = "1317--1345",
year = "2006",
author = "C.~L. Barrett and H.~B. Hunt III and M.~V. Marathe and S.~S. Ravi and D.~J. Rosenkrantz and R.~E. Stearns",
}
@Article{BarBCFHHY2014,
author = {W. Barrett and S. Butler and M. Catral and S.~M. Fallat and H.~T. Hall and L. Hogben and M. Young},
title = {The maximum nullity of a complete subdivision graph is equal to its zero
forcing number},
journal = {Electronic Journal of Linear Algebra},
year = {2014},
volume = {27},
OPTnumber = {},
pages = {444--457},
}
@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{BarKLM2001,
author = {D.~A.~M. Barrington and
P. Kadau and
K.{-}J. Lange and
P. McKenzie},
title = {On the Complexity of Some Problems on Groups Input as Multiplication
Tables},
journal = jcss,
volume = {63},
number = {2},
pages = {186--200},
year = {2001},
}
@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 = ""
}
@article{Bar97,
author = {A. Barg},
title = {Complexity Issues in Coding Theory},
journal = {Electronic Colloquium on Computational Complexity {(ECCC)}},
volume = {4},
number = {46},
year = {1997},
}
@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 = ""
}
@inproceedings{BarHof2012,
author = {S. Barth and
M. Hofmann},
title = {Learn with {SAT} to Minimize {B}{\"{u}}chi Automata},
booktitle = {Proceedings Third International Symposium on Games, Automata, Logics
and Formal Verification, GandALF},
pages = {71--84},
year = {2012},
editor = {M. Faella and
A. Murano},
series = {{EPTCS}},
volume = {96},
}
@inproceedings{Bar2016,
author = {S. Barth},
title = {Deciding Monadic Second Order Logic over $\omega$
-Words by Specialized Finite Automata},
booktitle = {Integrated Formal Methods - 12th International Conference, {IFM}},
pages = {245--259},
year = {2016},
editor = {E. {\'{A}}brah{\'{a}}m and
M. Huisman},
series = {LNCS},
volume = {9681},
publisher = {Springer},
}
@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{Bar2022,
title = {Class of models for random hypergraphs},
author = {Barthelemy, M.},
journal = {Phys. Rev. E},
volume = {106},
issue = {6},
pages = {064310},
numpages = {10},
year = {2022},
month = {Dec},
ypublisher = {American Physical Society},
ydoi = {10.1103/PhysRevE.106.064310},
}
@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{BarBDLM2021,
author = {V. Bartier and
N. Bousquet and
C. Dallard and
K. Lomer and
A. E. Mouawad},
title = {On Girth and the Parameterized Complexity of Token Sliding and Token
Jumping},
journal = alg,
volume = {83},
number = {9},
pages = {2914--2951},
year = {2021},
}
@techreport{BarDefMcI2023,
title={Minimal dominating sets enumeration with {FPT}-delay parameterized by the degeneracy and maximum degree},
author={V. Bartier and O. Defrain and F. {Mc Inerney}},
year={2023},
eprint={2305.06974},
eprinttype ={arXiv},
institution = {Cornell University, ArXiv/CoRR},
number = {abs/2305.06974},
doi = {10.48550/arXiv.2305.06974},
}
@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{BarDLMS2014,
author = {A. Bartoli and
G. Davanzo and
A. De Lorenzo and
E. Medvet and
E. Sorio},
title = {Automatic Synthesis of Regular Expressions from Examples},
journal = {Computer},
volume = {47},
number = {12},
pages = {72--80},
year = {2014},
}
@article{BarLMT2016b,
author = {A. Bartoli and
A. De Lorenzo and
E. Medvet and
F. Tarlao},
title = {Can a Machine Replace Humans in Building Regular Expressions? {A}
Case Study},
journal = {{IEEE} Intell. Syst.},
volume = {31},
number = {6},
pages = {15--21},
year = {2016},
}
@article{BarLMT2016,
author = {A. Bartoli and
A. De Lorenzo and
E. Medvet and
F. Tarlao},
title = {Inference of Regular Expressions for Text Extraction from Examples},
journal = {{IEEE} Trans. Knowl. Data Eng.},
volume = {28},
number = {5},
pages = {1217--1230},
year = {2016},
}
@article{BarLMT2016a,
author = {A. Bartoli and
A. De Lorenzo and
E. Medvet and
F. Tarlao},
title = {Correction to "Inference of Regular Expressions for Text Extraction
from Examples"},
journal = {{IEEE} Trans. Knowl. Data Eng.},
volume = {28},
number = {7},
pages = {1944},
year = {2016},
}
@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{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{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 = ""
}
@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{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 = ""
}
@UNPUBLISHED{BarKeh02,
AUTHOR = "R. Bar-Yehuda and Z. Kehat",
TITLE = "Approximating the dense set-cover problem",
NOTE = "",
year = 2002,
month = "",
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},
}
@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},
}
@inproceedings{BarRaw2006,
author = {R. Bar{-}Yehuda and
D. Rawitz},
title = {A Tale of Two Methods},
booktitle = {Theoretical Computer Science, Essays in Memory of Shimon Even},
pages = {196--217},
year = {2006},
editor = {O. Goldreich and
A.~L. Rosenberg and
A.~L. Selman},
series = {LNCS},
volume = {3895},
publisher = {Springer},
}
@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 = ""
}
@article{BarHerRaw2010,
author = {R. Bar-Yehuda and
D. Hermelin and
D. Rawitz},
title = {An Extension of the {N}emhauser-{T}rotter Theorem to Generalized
Vertex Cover with Applications},
journal = siamdm,
volume = {24},
number = {1},
year = {2010},
pages = {287--300},
}
@inproceedings{Bar91,
author = {G. Barzdins},
title = {Inductive synthesis of term rewriting systems},
booktitle = {Baltic Computer Science},
year = {1991},
editor = {J. Barzdins and
D. Bj{\o}rner},
publisher = {Springer},
series = {LNCS},
volume = {502},
pages = {253--285},
}
@article{BasGuiHer99,
author = {J. Basch and
L.~J. Guibas and
J. Hershberger},
title = {Data Structures for Mobile Data},
journal = jalg,
volume = {31},
number = {1},
pages = {1--28},
year = {1999},
}
@article{BasEGHZ2004,
author = {J. Basch and
J. Erickson and
L.~J. Guibas and
J. Hershberger and
Li Zhang},
title = {Kinetic collision detection between two simple polygons},
journal = {Computational Geometry},
volume = {27},
number = {3},
pages = {211--235},
year = {2004},
}
@article{BasSLC2020,
author = {Basilio, L.~A. and Simon, J.~C. and Lea\~nos, J. and Cayetano, O.~R.},
title = {The Differential on Graph Operator {$Q(G)$}},
journal = {Symmetry},
volume = {12},
number = {751},
pages = {1--8},
year = {2020},
}
@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{BasNic2007,
author = {F. Bassino and
C. Nicaud},
title = {Enumeration and random generation of accessible automata},
journal = tcs,
volume = {381},
number = {1-3},
pages = {86--104},
year = {2007},
}
@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 = ""
}
@InProceedings{BasFRS2013,
author ={M. Basavaraju and M. C. Francis and M. S. Ramanujan and S. Saurabh},
title ={Partially Polynomial Kernels for Set Cover and Test Cover},
booktitle ={IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},
pages ={67--78},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2013},
volume ={24},
editor ={A. Seth and N.~K. Vishnoi},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
}
@inproceedings{BasPRRS2014,
author = {M. Basavaraju and
F. Panolan and
A. Rai and
M.~S. Ramanujan and
S. Saurabh},
title = {On the Kernelization Complexity of String Problems},
booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON}},
pages = {141--153},
editor = {Z. Cai and
A. Zelikovsky and
A.~G. Bourgeois},
series = {LNCS},
volume = {8591},
publisher = {Springer},
year = {2014},
}
@inproceedings{BasHHSV2014,
author = {M. Basavaraju and
P. Heggernes and
P. van 't Hof and
R. Saei and
Y. Villanger},
title = {Maximal Induced Matchings in Triangle-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG}},
pages = {93--104},
editor = {D. Kratsch and
I. Todinca},
series = {LNCS},
volume = {8747},
publisher = {Springer},
year = {2014},
}
@article{BasHHSV2016,
author = {M. Basavaraju and
P. Heggernes and
P. van 't Hof and
R. Saei and
Y. Villanger},
title = {Maximal Induced Matchings in Triangle-Free Graphs},
journal = {Journal of Graph Theory},
volume = {83},
number = {3},
pages = {231--250},
year = {2016},
}
@article{BasPRRS2018,
author = {M. Basavaraju and
F. Panolan and
A. Rai and
M. S. Ramanujan and
S. Saurabh},
title = {On the kernelization complexity of string problems},
journal =tcs,
volume = {730},
pages = {21--31},
year = {2018},
}
@article{BasBKS2017,
author = {J. Baste and
F. Beggas and
H. Kheddouci and
I. Sau},
title = {On the parameterized complexity of the Edge Monitoring problem},
journal = ipl,
volume = {121},
pages = {39--44},
year = {2017},
}
@inproceedings{BasThi2017,
author = {J. Baste and
D. M. Thilikos},
editor = {D. Lokshtanov and
N. Nishimura},
title = {Contraction-Bidimensionality of Geometric Intersection Graphs},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC}},
series = {LIPIcs},
volume = {89},
pages = {5:1--5:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
}
@techreport{BasFJMOPR2019,
author = {J. Baste and
M.~R. Fellows and
L. Jaffke and
T. Masar{\'{\i}}k and
M. de Oliveira Oliveira and
G. Philip and
F.~A. Rosamond},
title = {Diversity in Combinatorial Optimization},
number = {abs/1903.07410},
year = {2019},
url = {http://arxiv.org/abs/1903.07410},
archivePrefix = {arXiv},
institution = {ArXiv, Cornell University},}
@article{BasJMPR2019,
author = {J. Baste and
L. Jaffke and
T. Masar{\'{\i}}k and
G. Philip and
G. Rote},
title = {{FPT} Algorithms for Diverse Collections of Hitting Sets},
journal = {Algorithms},
volume = {12},
number = {12},
pages = {254},
year = {2019},
}
@inproceedings{BasFJMOPR2020,
author = {J. Baste and
M. R. Fellows and
L. Jaffke and
T. Masar{\'{\i}}k and
M. de Oliveira Oliveira and
G. Philip and
F.~A. Rosamond},
editor = {C. Bessiere},
title = {Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter
Tractability Theory},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI} 2020},
pages = {1119--1125},
publisher = {ijcai.org},
year = {2020},
}
@article{BasFJMOPR2022,
author = {J. Baste and
M. R. Fellows and
L. Jaffke and
T. Masar{\'{\i}}k and
M. de Oliveira Oliveira and
G. Philip and
F.~A. Rosamond},
title = {Diversity of solutions: An exploration through the lens of fixed-parameter
tractability theory},
journal = {Artificial Intelligence},
volume = {303},
pages = {103644},
year = {2022},
}
@article{BasEhaRau2022,
TITLE = {Non-monotone target sets for threshold values restricted to $0$, $1$,
and the vertex degree},
AUTHOR = {J. Baste and S. Ehard and D. Rautenbach},
yURL = {https://dmtcs.episciences.org/9443},
yDOI = {10.46298/dmtcs.6844},
JOURNAL = dmtcs,
VOLUME = {24}, number = 1,
YEAR = {2022},
}
@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 = ""
}
@Article{BauBei2002,
author = {S. Bau and L.~W. Beineke},
title = {The decycling number of graphs},
journal = {Australasian Journal of Combinatorics},
year = {2002},
volume = {25},
pages = {285--298},
}
@INPROCEEDINGS{Bauetal2000,
AUTHOR = "C. Bauckhage and S. Kronenberg and F. Kummert and G. Sagerer",
TITLE = "Grammars and discourse theory to describe and recognize mechanical assemblies",
BOOKTITLE = "Advances in Pattern Recognition, Joint IAPR International Workshops SSPR+SPR'2000",
YEAR = 2000,
month = "",
volume = "1876",
editor = "F. J. Ferri and others",
series = "LNCS",
chapter = "",
pages = "173--182",
address = "",
organization = "",
copy = ""
}
@inproceedings{BauRey2018,
author = {N. Baudru and
P.{-}A. Reynier},
title = {From Two-Way Transducers to Regular Function Expressions},
pages = {96--108},
booktitle = {Developments in Language Theory - 22nd International Conference, {DLT}},
year = {2018},
editor = {M. Hoshi and
S. Seki},
series = {LNCS},
volume = {11088},
publisher = {Springer},
}
@article{BauMahSac2022,
author = {F. Bauern{\"{o}}ppel and
A. Maheshwari and
J.{-}R. Sack},
title = {An $\Omega(n^d)$ lower bound on the number of cell crossings for weighted shortest paths in $d$-dimensional polyhedral structures},
journal = {Computational Geometry: Theory and Applications},
volume = {107},
pages = {101897},
year = {2022},
}
@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},
PAGES = {118--128},
VOLUME = {6049},
editor = {P. Festa},
SERIES = {LNCS},
YEAR = {2010},
PUBLISHER = {Springer}
}
@inproceedings{BauPfrRut2023,
author = {J. Baumann and
M. Pfretzschner and
I. Rutter},
editor = {D. Paulusma and
B. Ries},
title = {Parameterized Complexity of Vertex Splitting to Pathwidth at Most~1},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG}},
series = {LNCS},
volume = {14093},
pages = {30--43},
publisher = {Springer},
year = {2023},
ydoi = {10.1007/978-3-031-43380-1\_3},
}
@PhdThesis{Bau2012,
author = {D. Baumeister},
title = {Computational Complexity in
Three Areas of Computational
Social Choice: Possible Winners,
Unidirectional Covering Sets, and
Judgment Aggregation},
school = {Mathematisch-Naturwissenschaftlichen Fakult\"at der Heinrich-Heine-Universit\"at D\"usseldorf, Germany},
year = {2012},
}
@article{BauRot2009,
author = {D. Baumeister and
J. Rothe},
title = {The three-color and two-color Tantrix\({}^{\mbox{TM}}\) rotation puzzle
problems are NP-complete via parsimonious reductions},
journal = ic,
volume = {207},
number = {11},
pages = {1119--1139},
year = {2009},
}
@article{BauRot2009a,
author = {D. Baumeister and
J. Rothe},
title = {Satisfiability Parsimoniously Reduces to the Tantrix\({}^{\mbox{TM}}\)
Rotation Puzzle Problem},
journal = fundinform,
volume = {91},
number = {1},
pages = {35--51},
year = {2009},
}
@article{BauRot2012,
author = {D. Baumeister and
J. Rothe},
title = {Taking the final step to a full dichotomy of the possible winner problem
in pure scoring rules},
journal = ipl,
volume = {112},
number = {5},
pages = {186--190},
year = {2012},
}
@inproceedings{BauEER2013,
author = {D. Baumeister and
G. Erd{\'{e}}lyi and
O.~J. Erd{\'{e}}lyi and
J. Rothe},
title = {Computational Aspects of Manipulation and Control in Judgment Aggregation},
booktitle = {Algorithmic Decision Theory - Third International Conference, {ADT}},
pages = {71--85},
year = {2013},
editor = {P. Perny and
M. Pirlot and
A. Tsouki{\`{a}}s},
series = {LNCS/LNAI},
volume = {8176},
publisher = {Springer},
}
@article{BauBF0R2013,
author = {D. Baumeister and
F. Brandt and
F.~A. Fischer and
J. Hoffmann and
J. Rothe},
title = {The Complexity of Computing Minimal Unidirectional Covering Sets},
journal = tocs,
volume = {53},
number = {3},
pages = {467--502},
year = {2013},
}
@inproceedings{BauBLN0R2014,
author = {D. Baumeister and
S. Bouveret and
J. Lang and
N.{-}T. Nguyen and
T. T. Nguyen and
J. Rothe},
title = {Scoring Rules for the Allocation of Indivisible Goods},
booktitle = {{ECAI} 2014 - 21st European Conference on Artificial Intelligence, Including Prestigious
Applications of Intelligent Systems {(PAIS} 2014)},
pages = {75--80},
editor = {T. Schaub and
G. Friedrich and
B. O'Sullivan},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {263},
publisher = {{IOS} Press},
year = {2014},
}
@inproceedings{BauNeuRot2015,
author = {D. Baumeister and
D. Neugebauer and
J. Rothe},
title = {Verification in Attack-Incomplete Argumentation Frameworks},
pages = {341--358},
editor = {T. Walsh},
booktitle = {Algorithmic Decision Theory - 4th International Conference, {ADT}},
series = {LNCS/LNAI},
volume = {9346},
publisher = {Springer},
year = {2015},
}
@inproceedings{BauRotSch2015,
author = {D. Baumeister and
J. Rothe and
H. Schadrack},
title = {Verification in Argument-Incomplete Argumentation Frameworks},
pages = {359--376},
editor = {T. Walsh},
booktitle = {Algorithmic Decision Theory - 4th International Conference, {ADT}},
series = {LNCS/LNAI},
volume = {9346},
publisher = {Springer},
year = {2015},
}
@inproceedings{BauRotSel2015,
author = {D. Baumeister and
J. Rothe and
A.{-}K. Selker},
title = {Complexity of Bribery and Control for Uniform Premise-Based Quota
Rules Under Various Preference Types},
pages = {432--448},
editor = {T. Walsh},
booktitle = {Algorithmic Decision Theory - 4th International Conference, {ADT}},
series = {LNCS/LNAI},
volume = {9346},
publisher = {Springer},
year = {2015},
}
@inproceedings{BauDenRey2015,
author = {D. Baumeister and
S. Dennisen and
L. Rey},
title = {Winner Determination and Manipulation in Minisum and Minimax Committee
Elections},
pages = {469--485},
editor = {T. Walsh},
booktitle = {Algorithmic Decision Theory - 4th International Conference, {ADT}},
series = {LNCS/LNAI},
volume = {9346},
publisher = {Springer},
year = {2015},
}
@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 2007},
pages = {255--267},
editor = {S.-H. Hong and
T. Nishizeki and
W. Quan},
publisher = {Springer},
series = {LNCS},
volume = {4875},
year = {2008},
}
@inproceedings{BauSanOmm2017,
author = {M.~A. Bautista and
A. Sanakoyeu and
B. Ommer},
title = {Deep Unsupervised Similarity Learning Using Partially Ordered Sets},
booktitle = {{IEEE} Conference on Computer Vision and Pattern Recognition,
{CVPR}},
pages = {1923--1932},
year = {2017},
publisher = {{IEEE} Computer Society},
}
@article{BazSanTuz99,
author = {C. Bazgan and
M. Santha and
Z. Tuza},
title = {On the Approximation of Finding A(nother) {H}amiltonian Cycle in Cubic
{H}amiltonian Graphs},
journal = jalg,
volume = {31},
number = {1},
pages = {249--268},
year = {1999},
}
@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
Gh. P\u{a}un},
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{BazMPS2005,
author = {C. Bazgan and J. Monnot and V. Th. Paschos and F. Serri\'ere},
title = {On the differential approximation of {MIN} {SET} {COVER}},
journal = tcs,
volume = {332},
number = {1-3},
pages = {497--513},
year = {2005},
}
@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{BazCouTuz2009,
author = {C. Bazgan and
B. Cou{\"e}toux and
Z. Tuza},
title = {Covering a Graph with a Constrained Forest (Extended Abstract)},
booktitle = {Algorithms and Computation, 20th International Symposium, ISAAC},
year = {2009},
pages = {892--901},
editor = {Y. Dong and
D.-Z. Du and
O. H. Ibarra},
publisher = {Springer},
series = {LNCS},
volume = {5878},
}
@inproceedings{BazChoFel2011,
author = {C. Bazgan and
M. Chopin and
M.~R. Fellows},
title = {Parameterized Complexity of the Firefighter Problem},
booktitle = {Algorithms and Computation --- 22nd International Symposium, ISAAC},
year = {2011},
pages = {643--652},
editor = {T. Asano and
S.-I. Nakano and
Y. Okamoto and
O. Watanabe},
publisher = {Springer},
series = {LNCS},
volume = {7074},
}
@article{BazTouTuz2011,
author = {C. Bazgan and
S. Toubaline and
Z. Tuza},
title = {The most vital nodes with respect to independent set and vertex cover},
journal = dam,
volume = {159},
number = {17},
pages = {1933--1946},
year = {2011},
}
@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},
}
@article{BazChoRie2013,
author = {C. Bazgan and
M. Chopin and
B. Ries},
title = {The firefighter problem with more than one firefighter on
trees},
journal = dam,
volume = {161},
number = {7-8},
year = {2013},
pages = {899--908},
}
@inproceedings{BazCNS2013,
author = {C. Bazgan and
M. Chopin and
A. Nichterlein and
F. Sikora},
title = {Parameterized Approximability of Maximizing the Spread of
Influence in Networks},
booktitle = {Computing and Combinatorics, 19th International Conference, COCOON},
year = {2013},
pages = {543--554},
editor = {D.-Z. Du and
G. Zhang},
publisher = {Springer},
series = {LNCS},
volume = {7936},
}
@article{BazCNS2014a,
author = {C. Bazgan and
M. Chopin and
A. Nichterlein and
F. Sikora},
title = {Parameterized Approximability of Maximizing the Spread of
Influence in Networks},
journal = jda,
volume = {27},
year = {2014},
pages = {54--65},
}
@article{BazCCFFL2014,
author = {C. Bazgan and
M. Chopin and
M. Cygan and
M.~R. Fellows and
F.~V. Fomin and
E.~J. van Leeuwen},
title = {Parameterized complexity of firefighting},
journal = jcss,
volume = {80},
number = {7},
year = {2014},
pages = {1285--1297},
}
@article{BazCho2014,
author = {C. Bazgan and
M. Chopin},
title = {The complexity of finding harmless individuals in social networks},
journal = dopt,
volume = {14},
pages = {170--182},
year = {2014},
}
@inproceedings{BazCNS2014,
author = {C. Bazgan and
M. Chopin and
A. Nichterlein and
F. Sikora},
title = {Parameterized Inapproximability of Target Set Selection
and Generalizations},
pages = {11--20},
editor = {A. Beckmann and
E. Csuhaj-Varj{\'u} and
K. Meer},
booktitle = {Language, Life, Limits - 10th Conference on Computability
in Europe, CiE},
publisher = {Springer},
series = {LNCS},
volume = {8493},
}
@InProceedings{BazBCF2016,
author = {C. Bazgan and L. Brankovic and K. Casel and H. Fernau},
title = {On the Complexity Landscape of the Domination Chain},
booktitle = {Algorithms and Discrete Applied Mathematics - CALDAM},
pages = {61--72},
year = {2016},
editor = {S. Govindarajan and A. Maheshwari},
volume = {9602},
series = {LNCS},
publisher = {Springer},
}
@InProceedings{Bazetal2016a,
author = {C. Bazgan and L. Brankovic and K. Casel and H. Fernau and K. Jansen and K.-M. Klein and M. Lampis and M. Liedloff and J. Monnot and V. Paschos},
title = {Algorithmic Aspects of Upper Domination: A Parameterised Perspective},
booktitle = {Algorithmic Aspects in Information and Management - 11th International Conference, AAIM},
pages = {113--124},
year = {2016},
editor = {R. Dondi and G. Fertin and G. Mauri},
volume = {9778},
series = {LNCS},
publisher = {Springer},
}
@inproceedings{Bazetal2016b,
author = {C. Bazgan and L. Brankovic and K. Casel and H. Fernau and K. Jansen and K.-M. Klein and M. Lampis and M. Liedloff and J. Monnot and V. Paschos},
title = {Upper Domination: Complexity and Approximation},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA}},
pages = {241--252},
editor = {V. M{\"{a}}kinen and
S. J. Puglisi and
L. Salmela},
series = {LNCS},
volume = {9843},
publisher = {Springer},
year = {2016},
}
@article{BazBHNW2016,
author = {C. Bazgan and
R. Bredereck and
S. Hartung and
A. Nichterlein and
G.~J. Woeginger},
title = {Finding large degree-anonymous subgraphs is hard},
journal = tcs,
volume = {622},
pages = {90--110},
year = {2016},
}
@inproceedings{BazPonTuz2017,
author = {C. Bazgan and
T. Pontoizeau and
Zs. Tuza},
title = {On the Complexity of Finding a Potential Community},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}},
pages = {80--91},
year = {2017},
editor = {D. Fotakis and
A. Pagourtzis and
V.~Th. Paschos},
series = {LNCS},
volume = {10236},
}
@article{Bazetal2018,
title = "The many facets of upper domination",
journal = tcs,
volume = "717",
pages = "2--25",
year = "2018",
author = {C. Bazgan and L. Brankovic and K. Casel and H. Fernau and K. Jansen and K.-M. Klein and M. Lampis and M. Liedloff and J. Monnot and V. Paschos},
}
@article{BazFerTuz2019,
title = "Aspects of upper defensive alliances",
journal = dam,
volume = "266",
pages = "111--120",
year = "2019",
author = "C. Bazgan and H. Fernau and Zs. Tuza",}
@article{BazBCF2020,
title = "Domination chain: Characterisation, classical complexity, parameterised complexity and approximability",
journal = dam,
volume = "280",
pages = "23--42",
year = "2020",
issn = "0166-218X",
author = {C. Bazgan and L. Brankovic and K. Casel and H. Fernau},}
@proceedings{BazFer2022,
editor = {C. Bazgan and
H. Fernau},
title = {Combinatorial Algorithms - 33rd International Workshop, {IWOCA}},
series = {LNCS},
volume = {13270},
publisher = {Springer},
year = {2022},
}
@inproceedings{BazCasCaz2022,
author = {C. Bazgan and
K. Casel and
P. Cazals},
editor = {A. Czumaj and
Q. Xin},
title = {Dense Graph Partitioning on Sparse and Dense Graphs},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}},
series = {LIPIcs},
volume = {227},
pages = {13:1--13:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
}
@article{BazHRTV2022,
author = {C. Bazgan and
A. Herzel and
S. Ruzika and
C. Thielen and
D. Vanderpooten},
title = {An approximation algorithm for a general class of parametric optimization
problems},
journal = joco,
volume = {43},
number = {5},
pages = {1328--1358},
year = {2022},
}
@INPROCEEDINGS{Beaetal96,
AUTHOR = "M. B\'eal 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.-P. B\'eal and O. Carton and
C. Reutenauer",
TITLE = "Cyclic languages and strongly cyclic languages",
BOOKTITLE = "13th Annual Symposium on Theoretical Aspects of Computer
Science, STACS",
YEAR = 1996,
month = "",
volume = "1046",
editor = {C. Puech and
R. Reischuk},
series = "LNCS",
chapter = "",
pages = "49--59",
address = "",
organization = "",
copy = ""
}
@article{BeaCKP2008,
author = {M.-P. B\'eal and
E. Czeizler and
J. Kari and
D. Perrin},
title = {Unambiguous Automata},
journal = {Math. Comput. Sci.},
volume = {1},
number = {4},
pages = {625--638},
year = {2008},
}
@article{BeaBerPer2011,
author = {M.{-}P. B{\'{e}}al and
M. V. Berlinkov and
D. Perrin},
title = {A quadratic upper bound on the size of a synchronizing word in one-cluster
automata},
journal = ijfcs,
volume = {22},
number = {2},
pages = {277--288},
year = {2011},
}
@inproceedings{BeaCDJL2012,
author = {M.{-}P. B{\'{e}}al and
J.{-}M. Champarnaud and
J.{-}P. Dubernard and
H. Jeanne and
S. Lombardy},
title = {Decidability of Geometricity of Regular Languages},
booktitle = {Developments in Language Theory - 16th International Conference, {DLT}
2012},
pages = {62--72},
editor = {H.{-}C. Yen and
O. H. Ibarra},
series = {LNCS},
volume = {7410},
publisher = {Springer},
year = {2012},
}
@article{BeaAdj2016,
author = {R. Beal and
D.~A. Adjeroh},
title = {Compressed parameterized pattern matching},
journal = tcs,
volume = {609},
pages = {129--142},
year = {2016},
}
@Article{BeaHenSwa94,
author = {T.~J. Bean and M.~A. Henning and H.~C. Swart},
title = {On the integrity of distance domination in graphs},
journal = {Australasian Journal of Combinatorics},
year = {1994},
OPTkey = {},
volume = {10},
OPTnumber = {},
pages = {29--43},
}
@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{Bea80,
AUTHOR = "J.~C. Beatty",
title = "Two iteration theorems for the {$LL(k)$} languages",
journal = tcs,
volume = "12",
number = "2",
pages = "193--228",
year = "1980",
}
@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{BeaKanNou1213,
author = {L. Beaudou and
M.~M. Kant{\'{e}} and
L. Nourine},
title = {The Lattice of all Betweenness Relations: Structure and Properties},
booktitle = {Proceedings of The Ninth International Conference on Concept Lattices
and Their Applications, 2012},
pages = {317--326},
editor = {L. Szathmary and
U. Priss},
series = {{CEUR} Workshop Proceedings},
volume = {972},
publisher = {CEUR-WS.org},
year = {2013},
}
@article{Bea88,
AUTHOR = "M. Beaudry",
title = {Membership Testing in Commutative Transformation Semigroups},
journal = icneu,
volume = {79},
number = {1},
pages = {84--93},
year = {1988},
}
@article{Bea89,
AUTHOR = "M. Beaudry",
title = {Characterization of Idempotent Transformation Monoids},
journal = ipl,
volume = {31},
number = {3},
pages = {163--166},
year = {1989},
}
@article{BeaMcKThe92,
author = {M. Beaudry and
P. McKenzie and
D. Th{\'{e}}rien},
title = {The Membership Problem in Aperiodic Transformation Monoids},
journal = jacm,
volume = {39},
number = {3},
pages = {599--616},
year = {1992},
}
@article{Bea94,
AUTHOR = "M. Beaudry",
title = {Membership Testing in Threshold One Transformation Monoids},
journal = icneu,
volume = {113},
number = {1},
pages = {1--25},
year = {1994},
}
@article{BeaMcK95,
author = {M. Beaudry and
P. McKenzie},
title = {Circuits, Matrices, and Nonassociative Computation},
journal = jcss,
volume = {50},
number = {3},
pages = {441--455},
year = {1995},
}
@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{BeaMPT97,
author = {M. Beaudry and
P. McKenzie and
P. P{\'{e}}ladeau and
D. Th{\'{e}}rien},
title = {Finite Moniods: From Word to Circuit Evaluation},
journal = siam,
volume = {26},
number = {1},
pages = {138--152},
year = {1997},
}
@article{Bea98,
AUTHOR = "M. Beaudry",
title = {Languages Recognized by Finite Aperiodic Groupoids},
journal = tcs,
volume = {209},
number = {1-2},
pages = {299--317},
year = {1998},
}
@article{Bea98a,
AUTHOR = "M. Beaudry",
title = {Finite idempotent groupoids and regular languages},
journal = rairoita,
volume = {32},
number = {4-6},
pages = {127--140},
year = {1998},
}
@article{BeaFerHol2005,
author = {M. Beaudry and
J. M. Fernandez and
M. Holzer},
title = {A common algebraic description for probabilistic and quantum computations},
journal = tcs,
volume = {345},
number = {2-3},
pages = {206--234},
year = {2005},
}
@article{BeaHol2007,
author = {M. Beaudry and
M. Holzer},
title = {The Complexity of Tensor Circuit Evaluation},
journal = {Computational Complexity},
volume = {16},
number = {1},
pages = {60--111},
year = {2007},
}
@article{BeaDDLT2014,
title = "Conservative groupoids recognize only regular languages",
journal = ic,
volume = "239",
pages = "13--28",
year = "2014",
author = "M. Beaudry and D. Dub\'e and M. Dub\'e and M. Latendresse and P. Tesson",
}
@ARTICLE{Bea79,
AUTHOR = "J. Beauquier",
TITLE = "Deux familles de langages incomparables",
JOURNAL = icalt,
YEAR = 1979,
month = "",
volume = 43,
number = "",
pages = "101--122",
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{BeaBer81,
author = {J. Beauquier and
J. Berstel},
title = {More about the "Geography" of Context-Free Languages},
journal = icalt,
volume = {49},
number = {2},
pages = {91--108},
year = {1981},
}
@ARTICLE{Bea82a,
AUTHOR = "J. Beauquier",
TITLE = "Sur la structure des langages alg\'ebriques",
JOURNAL = ijcm,
YEAR = 1982,
month = "",
volume = 11,
number = "",
pages = "3--19",
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{BeaBlaLat87,
author = {J. Beauquier and
M. Blattner and
M. Latteux},
title = {On Commutative Context-Free Languages},
journal = jcss,
volume = {35},
number = {3},
pages = {311--320},
year = {1987},
}
@article{BeaGir87,
author = {J. Beauquier and
F. Gire},
title = {Une Note sur le Th{\'{e}}or{\`{e}}me de Caract{\'{e}}risation
des G{\'{e}}n{\'{e}}rateurs Alg{\'{e}}briques},
journal = tcs,
volume = {51},
pages = {117--127},
year = {1987},
}
@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 = ""
}
@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 = ""
}
@article{BeaPin91,
author = {D. Beauquier and
J.-E. Pin},
title = {Languages and Scanners},
journal = tcs,
volume = {84},
number = {1},
year = {1991},
pages = {3--21},
}
@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{Bea95,
author = {D. Beaver},
title = {Computing with {DNA}},
journal = {Journal of Computational Biology},
volume = {2},
number = {1},
pages = {1--7},
year = {1995},
}
@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{Bec2014,
author = {L. Becerra-Bonache},
title = {How can Grammatical Inference Contribute to Computational
Linguistics?},
booktitle = {Language, Life, Limits -- 10th Conference on Computability
in Europe, CiE},
year = {2014},
pages = {21--31},
editor = {A. Beckmann and
E. Csuhaj-Varj{\'u} and
K. Meer},
publisher = {Springer},
series = {LNCS},
volume = {8493},
}
@article{BecJim2014,
author = {L. Becerra{-}Bonache and
M.~D. Jim{\'{e}}nez{-}L{\'{o}}pez},
title = {An Overview of the Interrelation Among Agent Systems, Learning Models
and Formal Languages},
journal = {Transactions on Computational Collective Intelligence},
volume = {17},
pages = {46--65},
year = {2014},
note ={Also: LNCS 8790}
}
@InProceedings{Bec2003,
author = {D. B\'echet},
title = {$k$-valued link grammars are learnable from strings},
booktitle = {Formal Grammar FG Vienna},
OPTcrossref = {},
OPTkey = {},
pages = {3--12},
year = {2003},
publisher = {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},
}
@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{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}
@article{BecDie2013,
author = {F. Beck and
S. Diehl},
title = {On the impact of software evolution on software clustering},
journal = {Empirical Software Engineering},
volume = {18},
number = {5},
pages = {970--1004},
year = {2013},
}
@inproceedings{BecGBBW2014,
author = {F. Beck and
S. Gulan and
B. Biegel and
S. Baltes and
D. Weiskopf},
title = {Reg{V}iz: visual debugging of regular expressions},
booktitle = {36th International Conference on Software Engineering, {ICSE} '14,
Companion Proceedings},
pages = {504--507},
year = {2014},
editor = {P. Jalote and
L.~C. Briand and
A. van der Hoek},
publisher = {{ACM}},
}
@InProceedings{BecBDW2014,
author = {F. Beck and M. Burch and S. Diehl and D. Weiskopf},
title = {The State of the Art in Visualizing Dynamic Graphs},
booktitle = {Eurographics Conference on Visualization (EuroVis)},
OPTpages = {},
year = {2014},
editor = {R. Borgo and R. Maciejewski and I. Viola},
}
@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 = ""
}
@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{BecCDG2020,
author = {R. Becker and
F. Cor{\`{o}} and
G. D'Angelo and
H. Gilbert},
title = {Balancing Spreads of Influence in a Social Network},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020},
pages = {3--10},
publisher = {{AAAI} Press},
year = {2020},
}
@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 = ""
}
@article{BedGRY2016,
author = {Z. Bedn{\'{a}}rov{\'{a}} and
V. Geffert and
K. Reinhardt and
A. Yakaryilmaz},
title = {New Results on the Minimum Amount of Useful Space},
journal = ijfcs,
volume = {27},
number = {2},
pages = {259--282},
year = {2016},
}
@inproceedings{BeeMarMit2005,
author = {M.~H. ter Beek and
C. Mart{\'i}n-Vide and
V. Mitrana},
title = {Synchronized shuffles},
journal = tcs,
year = {2005}, volume = 341,
pages = {263--275},
}
@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}},
booktitle = {Computation, Cooperation, and Life --- Essays Dedicated to
Gheorghe P\u{a}un on the Occasion of His 60th Birthday},
publisher = {Springer},
series = {LNCS},
volume = {6610}
}
@article{BeeHayHed2016,
author = {R.~A. Beeler and
T.~W. Haynes and
S.~T. Hedetniemi},
title = {Double {R}oman domination},
journal = dam,
volume = {211},
pages = {23--29},
year = {2016},
}
@inproceedings{BeeEEHHMR2005,
author = {Z. Beerliova and
F. Eberhard and
T. Erlebach and
A. Hall and
M. Hoffmann and
M. Mihal{\'{a}}k and
L. Shankar Ram},
title = {Network Discovery and Verification},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG}.},
year = {2005},
pages = {127--138},
editor = {D. Kratsch},
series = {LNCS},
volume = {3787},
publisher = {Springer},
}
@article{Beh46,
author = {F.~A. Behrend},
title = {On sets of integers which contain no three terms in arithmetical progression},
journal = {Proc. Natl. Acad. Sci. U.S.A.},
volume = {32},
number = {12},
pages = {331--332},
year = {1946},
}
@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 = ""
}
@inproceedings{BehFSS2015,
author = {B. Behsaz and
Z. Friggstad and
M.~R. Salavatipour and
R. Sivakumar},
title = {Approximation Algorithms for Min-Sum $k$-Clustering and Balanced $k$-Median},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP}, Part {I}},
pages = {116--128},
year = {2015},
editor = {M.~M. Halld{\'{o}}rsson and
K. Iwama and
N. Kobayashi and
B. Speckmann},
series = {LNCS},
volume = {9134},
publisher = {Springer},
}
@TechReport{BehDJO2015,
author = {A. Behtoei and A. Davoodi and M. Jannesari and B. Omoomi},
title = {A characterization of some graphs with metric dimension two},
institution = {ArXiv, Cornell University},
year = {2015},
number = {arXiv:1509.02129},
}
@article{BehDJO2017,
author = {A. Behtoei and A. Davoodi and M. Jannesari and B. Omoomi},
title = {A characterization of some graphs with metric dimension two},
journal = dmaa,
volume = {9},
number = {2},
pages = {1--15},
year = {2017},
}
@inproceedings{BeiHolKut2017,
author = {S. Beier and
M. Holzer and
M. Kutrib},
title = {Operational State Complexity and Decidability of Jumping Finite Automata},
booktitle = {Developments in Language Theory - 21st International Conference, {DLT}},
pages = {96--108},
editor = {{\'{E}}. Charlier and
J. Leroy and
M. Rigo},
series = {LNCS},
volume = {10396},
publisher = {Springer},
year = {2017},
}
@inproceedings{BeiHol2018,
author = {S. Beier and
M. Holzer},
title = {Decidability of Right One-Way Jumping Finite Automata},
pages = {109--120},
booktitle = {Developments in Language Theory - 22nd International Conference, {DLT}},
year = {2018},
editor = {M. Hoshi and
S. Seki},
series = {LNCS},
volume = {11088},
publisher = {Springer},
}
@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 = ""
}
@article{BeiFu99,
author = {R. Beigel and
B. Fu},
title = {Molecular Computing, Bounded Nondeterminism, and Efficient Recursion},
journal = alg,
volume = {25},
number = {2-3},
pages = {222--238},
year = {1999},
}
@article{BeiGas2016,
author = {R. Beigel and
W.~I. Gasarch},
title = {On the sizes of {DPDA}s, {PDA}s, {LBA}s},
journal = tcs,
volume = {638},
pages = {63--75},
year = {2016},
}
@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 = ""
}
@article{BekKou2010,
author = {S. Bekkai and
M. Kouider},
title = {On mean distance and girth},
journal = dam,
volume = {158},
number = {17},
pages = {1888--1893},
year = {2010}
}
@inproceedings{BekKKNR2013,
author = {M.~A. Bekos and
M. Kaufmann and
R. Krug and
S. N{\"a}her and
V. Roselli},
title = {Slanted Orthogonal Drawings},
booktitle = {Graph Drawing --- 21st International Symposium, GD},
year = {2013},
pages = {424--435},
editor = {S. Wismath and
A. Wolff},
publisher = {Springer},
series = {LNCS},
volume = {8242},
}
@Article{BekGroRaf2016,
author = {M.~A. Bekos and M. Gronemann and C.~N. Raftopoulou},
title = {Two-Page Book Embeddings of 4-Planar Graphs},
journal = alg,
year = {2016},
volume = {75},
OPTnumber = {},
pages = {158--185},
}
@inproceedings{BekFKKKKS2023,
author = {M.~A. Bekos and
H. F{\"{o}}rster and
M. Kaufmann and
S. G. Kobourov and
M. Kryven and
A. Kuckuk and
L. Schlipf},
editor = {L. Gasieniec},
title = {On the 2-Layer Window Width Minimization Problem},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science},
series = {LNCS},
volume = {13878},
pages = {209--221},
publisher = {Springer},
year = {2023},
}
@inproceedings{BelMit97,
author = {E. Belani and
R. Mittal},
title = {A General Reconfiguration Technique for Fault Tolerant Processor
Architectures},
booktitle = {10th International Conference on VLSI Design},
year = {1997},
pages = {360--363},
publisher = {IEEE Computer Society},
}
@article{BelBruCia2019,
title = {Edge perturbation on signed graphs with clusters: Adjacency and {L}aplacian eigenvalues},
journal = dam,
volume = {269},
pages = {130--138},
year = {2019},
ydoi = {https://doi.org/10.1016/j.dam.2019.02.018},
author = {F. Belardo and M. Brunetti and A. Ciampella},
}
@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{BelGOS2013,
author = {T. Beller and
S. Gog and
E. Ohlebusch and
T. Schnattinger},
title = {Computing the longest common prefix array based on the {B}urrows-{W}heeler
transform},
journal = jda,
volume = {18},
pages = {22--31},
year = {2013},
}
@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 = ""
}
@article{BelFGR2017,
author = {R. Belmonte and
F. V. Fomin and
P. A. Golovach and
M. S. Ramanujan},
title = {Metric Dimension of Bounded Tree-length Graphs},
journal = siamdm,
volume = {31},
number = {2},
pages = {1217--1243},
year = {2017},
}
@InProceedings{BelLamMit2018,
author ={R. Belmonte and M. Lampis and V. Mitsou},
title ={Parameterized (Approximate) Defective Coloring},
booktitle ={35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages ={10:1--10:15},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2018},
volume ={96},
editor ={R. Niedermeier and B. Vall{\'e}e},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@article{BelHKKKKLO2022,
author = {R. Belmonte and
T. Hanaka and
M. Kanzaki and
M. Kiyomi and
Y. Kobayashi and
Y. Kobayashi and
M. Lampis and
H. Ono and
Y. Otachi},
title = {Parameterized Complexity of {$(A, {\(\mathscr{l}\)} )$}-Path Packing},
journal = algo,
volume = {84},
number = {4},
pages = {871--895},
year = {2022},
}
@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{BenGabZeh2016,
author = {R. Ben{-}Basat and
A. Gabizon and
M. Zehavi},
title = {The $k$-distinct language: Parameterized automata constructions},
journal = tcs,
volume = {622},
pages = {1--15},
year = {2016},
}
@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 = dopt,
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 = ""
}
@article{BenMyn2010,
author = {S. Benecke and
C.~M. Mynhardt},
title = {Domination of generalized {C}artesian products},
journal = dm,
volume = {310},
number = {8},
year = {2010},
pages = {1392--1397},
}
@article{Benetal2003,
author = {Y. Benenson and R. Adar and T. Paz-Elizur and Z. Livneh and E. Shapiro},
title = {{DNA} Molecule Provides a Computing Machine with Both Data and Fuel},
journal = {Proceedings of the National Academy of Sciences of the United States of America},
volume = {100},
number = {5},
year = {2003},
pages = {2191--2196},
}
@article{BenBBV97,
author = {C.~H. Bennett and
E. Bernstein and
G. Brassard and
U.~V. Vazirani},
title = {Strengths and Weaknesses of Quantum Computing},
journal = siam,
volume = {26},
number = {5},
pages = {1510--1523},
year = {1997},
}
@ARTICLE{BenLiMa03,
AUTHOR = "C.~H. Bennett and M. Li and B. Ma",
TITLE = "Chain letters and evolutionary histories",
JOURNAL = {Scientific American},
YEAR = 2003,
month = jul,
volume = 32,
number = "",
pages = "32--37",
copy = ""
}
@inproceedings{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{BenBHK2009,
author = {S. Bensch and
H. Bordihn and
M. Holzer and
M. Kutrib},
title = {On input-revolving deterministic and nondeterministic finite automata},
journal = ic,
volume = {207},
number = {11},
pages = {1140--1155},
year = {2009},
}
@techreport{BenFFFHVW2017,
author = {K.~F. Benson and
D. Ferrero and M. Flagg and V. Furst and
L. Hogben and V. Vasilevska and B. Wissman},
title = {Zero forcing and power domination for graph products},
institution = {Cornell University, ArXiv/CoRR, math.CO},
number = {1510.02421},
year = {2017},
}
@article{BenFNN2019,
author = {M. Bentert and
T. Fluschnik and
A. Nichterlein and
R. Niedermeier},
title = {Parameterized aspects of triangle enumeration},
journal = jcss,
volume = {103},
pages = {61--77},
year = {2019},
}
@inproceedings{BenSko2020,
author = {M. Bentert and
P. Skowron},
title = {Comparing Election Methods Where Each Voter Ranks Only Few Candidates},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020},
pages = {2218--2225},
publisher = {{AAAI} Press},
year = {2020},
}
@inproceedings{BenNRZ2021,
author = {M. Bentert and
A. Nichterlein and
M. Renken and
P. Zschoche},
editor = {N. Bansal and
E. Merelli and
J. Worrell},
title = {Using a Geometric Lens to Find $k$ Disjoint Shortest Paths},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP}},
series = {LIPIcs},
volume = {198},
pages = {26:1--26:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
}
@article{BenNRZ2023,
author = {M. Bentert and
A. Nichterlein and
M. Renken and
P. Zschoche},
title = {Using a Geometric Lens to Find {$k$}-Disjoint
Shortest Paths},
journal = siamdm,
volume = {37},
number = {3},
pages = {1674--1703},
year = {2023}
}
@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 = ""
}
@inproceedings{BenGibTha2020,
author = {J. W. Bentley and
D. Gibney and
S. V. Thankachan},
editor = {F. Grandoni and
G. Herman and
P. Sanders},
title = {On the Complexity of {BWT}-Runs Minimization via Alphabet Reordering},
booktitle = {28th Annual European Symposium on Algorithms, {ESA}},
series = {LIPIcs},
volume = {173},
pages = {15:1--15:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
}
@article{BenCorRie2013,
author = {C. Bentz and
D. Cornaz and
B. Ries},
title = {Packing and covering with linear programming: A survey},
journal = {European Journal of Operational Research},
volume = {227},
number = {3},
year = {2013},
pages = {409--422},
}
@article{Ben2019,
author = {C. Bentz},
title = {An {FPT} Algorithm for Planar Multicuts with Sources and Sinks on
the Outer Face},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {224--237},
year = {2019},
}
@inproceedings{BenKot2013,
author = {F. Benz and
T. K{\"{o}}tzing},
title = {An effective heuristic for the smallest grammar problem},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO}},
pages = {487--494},
year = {2013},
editor = {C. Blum and
E. Alba},
publisher = {{ACM}},
}
@article{BerGKR2014,
author = {S.~K. Bera and
S. Gupta and
A. Kumar and
S. Roy},
title = {Approximation algorithms for the partition vertex cover problem},
journal = tcs,
volume = {555},
pages = {2--8},
year = {2014},
}
@article{BerMah2016,
author = {S. Bera and
K. Mahalingam},
title = {Some Algebraic Aspects of {P}arikh $q$-Matrices},
journal = ijfcs,
volume = {27},
number = {4},
pages = {479--500},
year = {2016},
}
@article{BerMah2016a,
author = {S. Bera and
K. Mahalingam},
title = {Structural Properties of Word Representable Graphs},
journal = {Math. Comput. Sci.},
volume = {10},
number = {2},
pages = {209--222},
year = {2016},
}
@article{Ber87,
author = {B. B{\'e}rard},
title = {Literal Shuffle},
journal = tcs,
volume = {51},
year = {1987},
pages = {281--299},
}
@article{Ber87a,
author = {B. B{\'e}rard},
title = {Formal properties of literal shuffle},
journal = actacybern,
volume = {8},
year = {1987},
pages = {27--39},
}
@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 = {}
}
@article{BerKan2022,
author = {Berberler, Z.~N. and Kanli, A.},
title = {Differential in complementary prisms},
journal = {Numer. Methods Partial Differential Equations},
volume = {38},
number = {4},
pages = {936--946},
year = {2022},
}
@article{BerKho2016,
author = {D. Berdinsky and
B. Khoussainov},
title = {Cayley Automatic Representations of Wreath Products},
journal = ijfcs,
volume = {27},
number = {2},
pages = {147--160},
year = {2016},
}
@inproceedings{BerBJW2016,
author = {Berg, M. de and
K. Buchin and
B.~M.~P. Jansen and
G.~J. Woeginger},
title = {Fine-Grained Complexity Analysis of Two Classic {TSP} Variants},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP}},
pages = {5:1--5:14},
editor = {I. Chatzigiannakis and
M. Mitzenmacher and
Y. Rabani and
D. Sangiorgi},
series = {LIPIcs},
volume = {55},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2016},
}
@article{BerKisWoe2019,
author = { Berg, M. de and
S. Kisfaludi{-}Bak and
G.~J. Woeginger},
title = {The complexity of Dominating Set in geometric intersection graphs},
journal = tcs,
volume = {769},
pages = {18--31},
year = {2019},
}
@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{BerKle2010,
author = {T. Berg-Kirkpatrick and
D. Klein},
title = {Phylogenetic Grammar Induction},
booktitle = {ACL 2010, Proceedings of the 48th Annual Meeting of the
Association for Computational Linguistics},
year = {2010},
pages = {1288--1297},
editor = {J. Hajic and
S. Carberry and
S. Clark},
publisher = {The Association for Computer Linguistics},
}
@inproceedings{BerCGW2017,
author = {P. Berg{\'{e}} and
J. Crampton and
G. Gutin and
R. Watrigant},
title = {The Authorization Policy Existence Problem},
booktitle = {Proceedings of the Seventh {ACM} on Conference on Data and Application
Security and Privacy, {CODASPY}},
pages = {163--165},
year = {2017},
editor = {G.{-}J. Ahn and
A. Pretschner and
G. Ghinita},
publisher = {{ACM}},
}
@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},
}
@article{BerGHZ2014,
author = {A. Berger and
A. Grigoriev and
P. Heggernes and
R. van der Zwaan},
title = {Scheduling unit-length jobs with precedence constraints of small height},
journal = {Oper. Res. Lett.},
volume = {42},
number = {2},
pages = {166--172},
year = {2014},
}
@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},
}
@inproceedings{BerBjoHog2011,
author = {M. Berglund and
H. Bj{\"o}rklund and
J. H{\"o}gberg},
title = {Recognizing Shuffled Languages},
booktitle = {Language and Automata Theory and Applications --- 5th International
Conference, LATA},
year = {2011},
pages = {142--154},
editor = {A.~H. Dediu and
S. Inenaga and
C. Mart\'{\i}n-Vide},
publisher = {Springer},
series = {LNCS},
volume = {6638},
}
@article{BerBjoBjo2013,
author = {M. Berglund and
H. Bj{\"o}rklund and
J. Bj{\"o}rklund},
title = {Shuffled languages - Representation and recognition},
journal =tcs,
volume = {489--490},
year = {2013},
pages = {1--20},
}
@InProceedings{BerBjoDre2013,
author = {M. Berglund and
H. Bj{\"o}rklund and F. Drewes},
title = {On the parameterized complexity of Linear Context-Free Rewriting Systems},
booktitle = {Proceedings of the 13th Meeting on the Mathematics of Language (MoL 13)},
pages = {21--29},
year = {2013},
organization = {Association for Computational Linguistics},
}
@article{BerMer2017,
author = {M. Berglund and
B. van der Merwe},
title = {On the semantics of regular expression parsing in the wild},
journal = tcs,
volume = {679},
pages = {69--82},
year = {2017},
}
@InProceedings{BerMer2017a,
author = {M. Berglund and
B. van der Merwe},
title = {Regular Expressions with Backreferences Re-examined},
editor = {J. Holub and J. \v{Z}d\'arek},
booktitle = {Proceedings of Prague Stringology Conference, PSC},
pages = {30--41},
year = {2017},
publisher = {Czech Technical University in Prague},
}
@inproceedings{BerElb2014,
author = {C. Berkholz and
M. Elberfeld},
title = {Parameterized Complexity of Fixed Variable Logics},
booktitle = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS}},
pages = {109--120},
editor = {V. Raman and
S. P. Suresh},
series = {LIPIcs},
volume = {29},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2014},
}
@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},
}
@article{BerBBCHKLW2017,
author = {A. Berliner and
C. Bozeman and
S. Butler and
M. Catral and
L. Hogben and
B. Kroschel and
J. C.{-}H. Lin and
N. Warnberg and
M. Young},
title = {Zero forcing propagation time on oriented graphs},
journal = dam,
volume = {224},
pages = {45--59},
year = {2017},
}
@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},
}
@inproceedings{Ber2010a,
author = {M.~V. Berlinkov},
title = {On a Conjecture by {C}arpi and {D'A}lessandro},
booktitle = {Developments in Language Theory, 14th International Conference, {DLT}},
pages = {66--75},
editor = {Y. Gao and
H. Lu and
S. Seki and
S. Yu},
series = {LNCS},
volume = {6224},
publisher = {Springer},
year = {2010},
}
@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{Ber2012,
author = {M.~V. Berlinkov},
title = {Synchronizing Automata on Quasi-{E}ulerian Digraph},
booktitle = {Implementation and Application of Automata - 17th International Conference,
{CIAA}},
pages = {90--100},
year = {2012},
editor = {N. Moreira and
R. Reis},
series = {LNCS},
volume = {7381},
publisher = {Springer},
}
@article{Ber2014,
author = {M.~V. Berlinkov},
title = {Approximating the minimum length of synchronizing words is hard},
journal = tocs,
volume = {54},
number = {2},
pages = {211--223},
year = {2014},
}
@inproceedings{Ber2014a,
author = {M.~V. Berlinkov},
title = {On two algorithmic problems about synchronizing automata - (short
paper)},
booktitle = {Developments in Language Theory - 18th International Conference, {DLT}},
pages = {61--67},
editor = {A.~M. Shur and
M.~V. Volkov},
series = {LNCS},
volume = {8633},
publisher = {Springer},
year = {2014},
}
@inproceedings{BerSzy2015,
author = {M.~V. Berlinkov and
M. Szyku\l{}a},
title = {Algebraic Synchronization Criterion and Computing Reset Words},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS}, Part {I}},
pages = {103--115},
editor = {G.~F. Italiano and
G. Pighizzini and
D. Sannella},
series = {LNCS},
volume = {9234},
publisher = {Springer},
year = {2015},
}
@inproceedings{Ber2016,
author = {M.~V. Berlinkov},
title = {On the Probability of Being Synchronizable},
booktitle = {Algorithms and Discrete Applied Mathematics - Second International
Conference, {CALDAM}},
pages = {73--84},
year = {2016},
editor = {S. Govindarajan and
A. Maheshwari},
series = {LNCS},
volume = {9602},
publisher = {Springer},
}
@article{BerSzy2016,
author = {M.~V. Berlinkov and
M. Szyku\l{}a},
title = {Algebraic synchronization criterion and computing reset words},
journal = infsci,
volume = {369},
pages = {718--730},
year = {2016},
}
@inproceedings{BerFerSzy2018,
author = {M.~V. Berlinkov and
R. Ferens and
M. Szyku\l a},
title = {Complexity of Preimage Problems for Deterministic Finite Automata},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS}},
pages = {32:1--32:14},
year = {2018},
editor = {I. Potapov and
P.~G. Spirakis and
J. Worrell},
series = {LIPIcs},
volume = {117},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
}
@inproceedings{BerFRS2021,
author = {M.~V. Berlinkov and
R. Ferens and
A. Ryzhikov and
M. Szykula},
editor = {M. Bl{\"{a}}ser and
B. Monmege},
title = {Synchronizing Strongly Connected Partial DFAs},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS}},
series = {LIPIcs},
volume = {187},
pages = {12:1--12:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
}
@article{BerFerSzy2021,
author = {M.~V. Berlinkov and
R. Ferens and
M. Szyku\l a},
title = {Preimage problems for deterministic finite automata},
journal = jcss,
volume = {115},
pages = {214--234},
year = {2021},
}
@article{Ber81,
author = {K.~A. Berman},
title = {Matchings and spanning trees in {B}oolean weighted graphs},
journal = jcthb,
volume = {30},
number = {3},
pages = {343--350},
year = {1981},
}
@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{Ber86b,
author = {K.~A. Berman},
title = {Bicycles and spanning trees},
journal = {SIAM J. Alg. Disc. Meth.},
volume = {7},
number = {1},
pages = {1--23},
year = {1986},
}
@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{Beretal01,
author = "P. Berman and Bh. DasGupta and S. Muthukrishnan and S. Ramaswami",
title = "Improved approximation algorithms for rectangle tiling and packing",
booktitle = "Symposium on Discrete Algorithms SODA",
pages = "427-436",
year = "2001", publisher = {ACM Press}
}
@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{BerKLPR2002,
author = {P. Berman and
M. Karpinski and
L.~L. Larmore and
W. Plandowski and
W. Rytter},
title = {On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional
Texts},
journal = jcss,
volume = {65},
number = {2},
pages = {332--350},
year = {2002},
}
@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 = ""
}
@article{BerKarSco2003,
author = {P. Berman and
M. Karpinski and
A.~D. Scott},
title = {Approximation Hardness and Satisfiability of Bounded Occurrence Instances
of {SAT}},
journal = {Electronic Colloquium on Computational Complexity {(ECCC)}},
volume = {10},
number = {022},
year = {2003},
}
@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{BerKarSco2007,
author = {P. Berman and
M. Karpinski and
A.~D. Scott},
title = {Computational complexity of some restricted instances of {3-SAT}},
journal = dam,
volume = {155},
number = {5},
pages = {649--653},
year = {2007},
}
@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 = {},
OPTurl = {},
OPTdoi = {},
}
@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{BerFavMah89,
author = {J.-C. Bermond and
Od. Favaron and
M. Mah{\'{e}}o},
title = {Hamiltonian decomposition of {C}ayley graphs of degree 4},
journal = jcthb,
volume = {46},
number = {2},
pages = {142--153},
year = {1989},
}
@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},
}
@article{BerGKMP2006,
author = {J.-C. Bermond and
J. Galtier and
R. Klasing and
N. Morales and
S. Perennes},
title = {Hardness and Approximation of Gathering in Static Radio
Networks},
journal = ppl,
volume = {16},
number = {2},
year = {2006},
pages = {165--184},
}
@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 = {},
OPTdoi = {},
}
@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{BerFer2014,
AUTHOR = "S. Bermudo and H. Fernau",
title = {Computing the differential of a graph: hardness, approximability and exact algorithms},
journal = dam,
year = {2014},
volume = {165},
pages = {69--82},
}
@Article{BerFerSig2014,
AUTHOR = "S. Bermudo and H. Fernau and J.~M. Sigarreta",
title = {The differential and the {R}oman
domination number of a graph},
journal = {Applicable Analysis and Discrete Mathematics},
year = {2014},
volume = {8},
pages = {155--171},
}
@Article{BerFer2014acc,
author = "S. Bermudo and H. Fernau",
title = {Combinatorics for Smaller Kernels: The Differential of a Graph},
journal = {To appear in }#tcs,
year = {},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
OPTpages = {},
}
@Article{BerFer2015,
author = "S. Bermudo and H. Fernau",
title = {Combinatorics for Smaller Kernels: The Differential of a Graph},
journal = tcs,
year = {2015},
volume = {562},
pages = {330-345},
}
@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.}
}
@inproceedings{BerMcQ2018,
author = {J. Bernard and
I. McQuillan},
title = {New Techniques for Inferring {L}-systems Using Genetic Algorithm},
booktitle = {Bioinspired Optimization Methods and Their Applications - 8th International
Conference, {BIOMA}},
pages = {13--25},
editor = {P. Korosec and N. Melab and El{-}G. Talbi},
series = {LNCS},
volume = {10835},
publisher = {Springer},
year = {2018},
}
@Article{BerCla2015,
author = {J.-P. Bernardy and K. Claessen},
title = {Efficient parallel and incremental parsing of
practical context-free languages},
journal = {Journal of Functional Programming},
year = {2015},
volume = {25},
number = {e10},
pages = {1--39},
}
@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 = ""
}
@article{BerVaz97,
author = {E. Bernstein and
U.~V. Vazirani},
title = {Quantum Complexity Theory},
journal = siam,
volume = {26},
number = {5},
pages = {1411--1473},
year = {1997},
}
@inproceedings{BerHig2014,
author = {A. Beros and
C. de la Higuera},
title = {A Canonical Semi-Deterministic Transducer},
booktitle = {Proceedings of the 12th International Conference on Grammatical Inference,
{ICGI}},
pages = {33--48},
year = {2014},
editor = {A. Clark and
M. Kanazawa and
R. Yoshinaka},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {34},
publisher = {JMLR.org},
}
@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 = ""
}
@inproceedings{BerScoWel2020,
author = {V. Berry and
C. Scornavacca and
M. Weller},
title = {Scanning Phylogenetic Networks Is {NP}-hard},
pages = {519--530},
editor = {A. Chatzigeorgiou and
R. Dondi and
H. Herodotou and
C. A. Kapoutsis and
Y. Manolopoulos and
G. A. Papadopoulos and
F. Sikora},
booktitle = {Theory and Practice of Computer Science - 46th International
Conference on Current Trends in Theory and Practice of Informatics,
{SOFSEM}},
series = {LNCS},
volume = {12011},
publisher = {Springer},
year = {2020},
}
@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{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{Ber8889,
author = {J. Berstel},
title = {Finite automata and rational languages. An introduction},
booktitle = {Formal Properties of Finite Automata and Applications, {LITP} Spring
School on Theoretical Computer Science, 1988},
pages = {2--14},
editor = {J.{-}E. Pin},
series = {LNCS},
volume = {386},
publisher = {Springer},
year = {1989},
}
@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 = ""
}
@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 = ""
}
@InBook{BerBoa90,
title = {Handbook of Theoretical Computer Science},
chapter = {2. Context-free Languages},
publisher = {Springer},
year = {1990},
author = {J. Berstel and L. Boasson},
ALTeditor = {},
OPTkey = {},
volume = {B},
pages = {59--102},
}
@article{BerSee93,
AUTHOR = "J. Berstel and P. S\'e\'ebold",
title = {A Characterization of Overlap-Free Morphisms},
journal = dam,
volume = {46},
number = {3},
pages = {275--281},
year = {1993},
}
@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 = ""
}
@article{BerBoa99,
author = {J. Berstel and
L. Boasson},
title = {Partial Words and a Theorem of {F}ine and {W}ilf},
journal = tcs,
volume = {218},
number = {1},
pages = {135--141},
year = {1999},
}
@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",
}
@article{BerBoa2002b,
author = "J. Berstel and L. Boasson",
title = {Shuffle factorization is unique},
journal = tcs,
volume = {273},
number = {1-2},
pages = {47--67},
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},
}
@article{Ber2005,
author = {J. Berstel},
title = {Growth of repetition-free words -- a review},
journal = tcs,
volume = {340},
number = {1},
pages = {280--290},
year = {2005},
}
@article{BerBCPP2006,
author = {J. Berstel and
L. Boasson and
O. Carton and
B. Petazzoni and
J.{-}E. Pin},
title = {Operations preserving regular languages},
journal = tcs,
volume = {354},
number = {3},
pages = {405--420},
year = {2006},
}
@article{BerBCPR2010,
author = {J. Berstel and
L. Boasson and
O. Carton and
J.{-}E. Pin and
A. Restivo},
title = {The expressive power of the shuffle product},
journal = ic,
volume = {208},
number = {11},
pages = {1258--1272},
year = {2010},
}
@article{BerBoaFag2012,
author = {J. Berstel and
L. Boasson and
I. Fagnot},
title = {Splicing systems and the {C}homsky hierarchy},
journal = tcs,
volume = {436},
pages = {2--22},
year = {2012},
}
@article{BerHJKWH92,
author = {D. Bergstrand and K. Hodges and G. Jennings and L. Kuklinski and J. Wiener and F. Harary},
journal = {Mathematics Magazine},
number = {4},
pages = {262--264},
publisher = {Mathematical Association of America},
title = {Product Graphs Are Sum Graphs},
volume = {65},
year = {1992}
}
@Article{Beretao2007,
author = {V. Berth\'e and H. Ei and S. Ito and H. Rao},
title = {On substitution invariant {S}turmian words: an application of {R}auzy fractals},
journal = rairoita,
year = {2007},
OPTkey = {},
volume = {41},
OPTnumber = {},
pages = {329--349},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@article{BerFDDLPRR2017,
author = {V. Berth{\'{e}} and
C. De Felice and
V. Delecroix and
F. Dolce and
J. Leroy and
D. Perrin and
C. Reutenauer and
G. Rindone},
title = {Specular sets},
journal = tcs,
volume = {684},
pages = {3--28},
year = {2017},
}
@TechReport{BerNis2008,
author = {P. Berthom\'e and N. Nisse},
title = {A unified {FPT} Algorithm for Width of Partition
Functions},
institution = {INRIA, France},
year = {2008},
number = {6646},
month = sep,
}
@inproceedings{BerBPR2021,
author = {R. Berthon and
A. Boiret and
G. A. P{\'{e}}rez and
J.{-}F. Raskin},
editor = {N. Moreira and
R. Reis},
title = {Active Learning of Sequential Transducers with Side Information About
the Domain},
booktitle = {Developments in Language Theory - 25th International Conference, {DLT}},
series = {LNCS},
volume = {12811},
pages = {54--65},
publisher = {Springer},
year = {2021},
}
@article{BerPerTed2016,
author = {M. Bertier and
M. Perrin and
C. Tedeschi},
title = {On the Complexity of Concurrent Multiset Rewriting},
journal = ijfcs,
volume = {27},
number = {1},
pages = {67--84},
year = {2016},
}
@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{BerChoDAl2014,
author = {A. Bertoni and
C. Choffrut and
F. D'Alessandro},
title = {On the Decidability of the Intersection Problem for Quantum Automata
and Context-Free Languages},
journal = ijfcs,
volume = {25},
number = {8},
pages = {1065--1082},
year = {2014},
}
@article{Ber83a,
author = {A.~A. Bertossi},
title = {Finding {H}amiltonian Circuits in Proper Interval Graphs},
journal = ipl,
volume = {17},
number = {2},
pages = {97--101},
year = {1983},
}
@article{Ber86a,
author = {A.~A. Bertossi},
title = {Total Domination in Interval Graphs},
journal = ipl,
volume = {23},
number = {3},
pages = {131--134},
year = {1986},
}
@article{BerBon86,
author = {A.~A. Bertossi and
M.~A. Bonuccelli},
title = {Hamiltonian Circuits in Interval Graph Generalizations},
journal = ipl,
volume = {23},
number = {4},
pages = {195--200},
year = {1986},
}
@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},
}
@inproceedings{BerGar2014,
author = {L.~E. Bertossi and
J. Gardezi},
title = {Tractable vs. Intractable Cases of Query Answering under Matching
Dependencies},
booktitle = {Scalable Uncertainty Management -- 8th International Conference, {SUM}},
pages = {51--65},
year = {2014},
editor = {U. Straccia and
A. Cal{\`{\i}}},
series = {LNCS},
volume = {8720},
publisher = {Springer},
}
@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{BerNed99,
author = {E. Bertsch and M.-J. Nederhof},
title = {Regular closure of deterministic languages},
journal =siam,
year = {1999},
volume = {29},
number = {1},
pages = {81--102},
}
@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{BerDHKO2012,
author = {D. Berwanger and
A. Dawar and
P. Hunter and
S. Kreutzer and
J. Obdrz{\'a}lek},
title = {The {DAG}-width of directed graphs},
journal = jcthb,
volume = {102},
number = {4},
year = {2012},
pages = {900--923},
}
@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{BetRivSin95,
author = {M. Betke and
R.~L. Rivest and
M. Singh},
title = {Piecemeal Learning of an Unknown Environment},
journal = {Mach. Learn.},
volume = {18},
number = {2-3},
pages = {231--254},
year = {1995},
}
@article{BetGur97,
author = {M. Betke and
L. Gurvits},
title = {Mobile robot localization using landmarks},
journal = {{IEEE} Trans. Robotics Autom.},
volume = {13},
number = {2},
pages = {251--263},
year = {1997},
}
@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{Betetal2009,
author = {N. Betzler and M. R. Fellows and
J. Guo and
R. Niedermeier and
F. A. Rosamond},
title = {Fixed-Parameter Algorithms for {K}emeny rankings},
journal = tcs,
volume = {410},
number = {45},
year = {2009},
pages = {4554--4570},
}
@article{BetDor2010,
author = {N. Betzler and
B. Dorn},
title = {Towards a dichotomy for the Possible Winner problem in elections
based on scoring rules},
journal = jcss,
volume = {76},
number = {8},
year = {2010},
pages = {812--836},
}
@article{Betetal2010,
author = {N. Betzler and
J. Guo and
R. Niedermeier},
title = {Parameterized Computational Complexity
of {D}odgson and {Y}oung Elections},
journal = ic,
volume = {208},
number = {2},
year = {2010},
pages = {165--177},
}
@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{BetBreNie2014,
author = {N. Betzler and
R. Bredereck and
R.Niedermeier},
title = {Theoretical and empirical evaluation of data reduction for exact {K}emeny
Rank Aggregation},
journal = {Auton. Agents Multi Agent Syst.},
volume = {28},
number = {5},
pages = {721--748},
year = {2014},
}
@inproceedings{BevKMN2010,
author = {Bevern, R. van and
C. Komusiewicz and
H. Moser and
R. Niedermeier},
title = {Measuring Indifference: Unit Interval Vertex Deletion},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG}},
pages = {232--243},
editor = {D.~M. Thilikos},
series = {LNCS},
volume = {6410},
year = {2010},
}
@article{BevMosNie2012,
author = {Bevern, R. van 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{BevFGR2013,
author = {Bevern, R. van and
M.~R. Fellows and
S. Gaspers and
F.~A. Rosamond},
title = {Myhill-{N}erode Methods for Hypergraphs},
booktitle = {Algorithms and Computation - 24th International Symposium, ISAAC},
year = {2013},
pages = {372--382},
editor = {L. Cai and
S.-W. Cheng and
T.~W. Lam},
publisher = {Springer},
series = {LNCS},
volume = {8283},
}
@article{Bev2014,
author = {Bevern, R. van},
title = {Towards Optimal and Expressive Kernelization for $d$-Hitting Set},
journal = alg,
volume = {70},
number = {1},
pages = {129--147},
year = {2014},
}
@article{BevFSS2015,
author = {Bevern, R. van and
A.~E. Feldmann and
M. Sorge and
O. Such{\'{y}}},
title = {On the Parameterized Complexity of Computing Balanced Partitions in
Graphs},
journal = tocs,
volume = {57},
number = {1},
pages = {1--35},
year = {2015},
}
@article{BevDFGR2015,
author = {Bevern, R. van and
R.~G. Downey and
M.~R. Fellows and
S. Gaspers and
F.~A. Rosamond},
title = {Myhill-{N}erode Methods for Hypergraphs},
journal = alg,
volume = {73},
number = {4},
pages = {696--729},
year = {2015},
}
@article{BevBCHHNS2017,
author = {R. van Bevern and
R. Bredereck and
M. Chopin and
S. Hartung and
F. H{\"{u}}ffner and
A. Nichterlein and
O. Such{\'{y}}},
title = {Fixed-parameter algorithms for {DAG} Partitioning},
journal = dam,
volume = {220},
pages = {134--160},
year = {2017},
ydoi = {10.1016/J.DAM.2016.12.002},
}
@article{BevBBCFNW2017,
author = {R. van Bevern and
R. Bredereck and
L. Bulteau and
J. Chen and
V. Froese and
R. Niedermeier and
G.~J. Woeginger},
title = {Partitioning Perfect Graphs into Stars},
journal = jgth,
volume = {85},
number = {2},
pages = {297--335},
year = {2017},
ydoi = {10.1002/JGT.22062},
}
@article{BevFMMSS2018,
author = {R. van Bevern and
T. Fluschnik and
G. B. Mertzios and
H. Molter and
M. Sorge and
O. Such{\'{y}}},
title = {The parameterized complexity of finding secluded solutions to some
classical optimization problems on graphs},
journal = discopt,
volume = {30},
pages = {20--50},
year = {2018},
ydoi = {10.1016/J.DISOPT.2018.05.002},
}
@article{BevSlu2020,
title = {A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem},
journal = {Historia Mathematica},
volume = {53},
pages = {118-127},
year = {2020},
author = {Bevern, R. van and V.~A. Slugina},
}
@article{BevSmi2020,
author = {Bevern, R. van and
P.~V. Smirnov},
title = {Optimal-size problem kernels for $d$-Hitting Set in linear time
and space},
journal = ipl,
volume = {163},
pages = {105998},
year = {2020},
}
@article{BevFluTsi2020,
author = {R. van Bevern and
T. Fluschnik and
O. Yu. Tsidulko},
title = {Parameterized algorithms and data reduction for the short secluded
$s-t$-path problem},
journal = {Networks},
volume = {75},
number = {1},
pages = {34--63},
year = {2020},
ydoi = {10.1002/NET.21904},
}
@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{BhaGHKK2016,
author ={A. Bhangale and R. Gandhi and M.~T. Hajiaghayi and R. Khandekar and G. Kortsarz},
title ={{Bicovering: Covering Edges With Two Small Subsets of Vertices}},
booktitle ={43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
pages ={6:1--6:12},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2016},
volume ={55},
editor ={I. Chatzigiannakis and M. Mitzenmacher and Y. Rabani and D. Sangiorgi},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@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 = ""
}
@article{BhaCos87,
author = {S.~N. Bhatt and
S.~S. Cosmadakis},
title = {The Complexity of Minimizing Wire Lengths in {VLSI} Layouts},
journal = ipl,
volume = {25},
number = {4},
pages = {263--267},
year = {1987},
}
@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 = ""
}
@inproceedings{BhaKLRS2012,
author = {K. Bhawalkar and
J. M. Kleinberg and
K. Lewi and
T. Roughgarden and
A. Sharma},
title = {Preventing Unraveling in Social Networks: The Anchored $k$-Core
Problem},
booktitle = {Automata, Languages, and Programming --- 39th International
Colloquium, ICALP (2)},
year = {2012},
pages = {440--451},
editor = {A. Czumaj and
K. Mehlhorn and
A. M. Pitts and
R. Wattenhofer},
publisher = {Springer},
series = {LNCS},
volume = {7392},
}
@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},
}
@article{BiaNTT2021,
author = {S.~M. Bianchi and
G.~L. Nasini and
P.~B. Tolomei and
L.~M. Torres},
title = {On dominating set polyhedra of circular interval graphs},
journal = dm,
volume = {344},
number = {4},
pages = {112283},
year = {2021},
}
@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 = ""
}
@ARTICLE{BieKan98,
AUTHOR = "T. Biedl and G. Kant",
TITLE = "A better heuristic for orthogonal graph drawings",
JOURNAL = {Computational Geometry},
YEAR = 1998,
month = "",
volume = 9,
number = "",
pages = "159--180",
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}
}
@article{BieBraDen2009,
author = {T. C. Biedl and
F.-J. Brandenburg and
X. Deng},
title = {On the complexity of crossings in permutations},
journal = dm,
volume = {309},
number = {7},
year = {2009},
pages = {1813--1823},
}
@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},
}
@inproceedings{BieBNNPR2013,
author = {T.~C. Biedl and
T. Bl{\"{a}}sius and
B. Niedermann and
M. N{\"{o}}llenburg and
R. Prutkin and
I. Rutter},
title = {Using {ILP/SAT} to Determine Pathwidth, Visibility Representations,
and other Grid-Based Graph Drawings},
pages = {460--471},
editor = {S.~K. Wismath and
A. Wolff},
booktitle = {Graph Drawing - 21st International Symposium, {GD}},
series = {LNCS},
volume = {8242},
publisher = {Springer},
year = {2013},
}
@inproceedings{BieLioMon2016,
author = {T.~C. Biedl and
G. Liotta and
F. Montecchiani},
title = {On Visibility Representations of Non-Planar Graphs},
booktitle = {32nd International Symposium on Computational Geometry, SoCG},
pages = {19:1--19:16},
year = {2016},
editor = {S. P. Fekete and
A. Lubiw},
series = {LIPIcs},
volume = {51},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
}
@article{BieCDM2020,
author = {T.~C. Biedl and
M. Chimani and
M. Derka and
P. Mutzel},
title = {Crossing Number for Graphs with Bounded Pathwidth},
journal = alg,
volume = {82},
number = {2},
pages = {355--384},
year = {2020},
}
@article{BieBurDal2007,
author = {F. Biegler and
M.~J. Burrell and
M. Daley},
title = {Regulated {RNA} rewriting: Modelling {RNA} editing with guided insertion},
journal = tcs,
volume = {387},
number = {2},
pages = {103--112},
year = {2007},
}
@article{BieSal2009,
author = {F. Biegler and
K. Salomaa},
title = {On the synchronized derivation depth of context-free grammars},
journal = tcs,
volume = {410},
number = {35},
pages = {3198--3208},
year = {2009},
}
@article{BieDHM2009,
author = {F. Biegler and
M. Daley and
M. Holzer and
I. McQuillan},
title = {On the uniqueness of shuffle on words and finite languages},
journal = tcs,
volume = {410},
number = {38-40},
pages = {3711--3724},
year = {2009},
}
@article{BieDalMcQ2010,
author = {F. Biegler and
M. Daley and
I. McQuillan},
title = {On the Shuffle Automaton Size for Words},
journal = jalc,
volume = {15},
number = {1/2},
pages = {53--70},
year = {2010},
}
@article{BieDalMcQ2012,
author = {F. Biegler and
M. Daley and
I. McQuillan},
title = {Algorithmic decomposition of shuffle on words},
journal = tcs,
volume = {454},
pages = {38--50},
year = {2012},
}
@inproceedings{BieMcQ2014,
author = {F. Biegler and
I. McQuillan},
title = {On Comparing Deterministic Finite Automata and the Shuffle of Words},
booktitle = {Implementation and Application of Automata - 19th International Conference,
{CIAA}},
pages = {98--109},
editor = {M. Holzer and
M. Kutrib},
series = {LNCS},
volume = {8587},
publisher = {Springer},
year = {2014},
}
@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{BieGSW93,
author = {D. Bienstock and
M.~X. Goemans and
D. Simchi{-}Levi and
D. P. Williamson},
title = {A note on the prize collecting traveling salesman problem},
journal = {Math. Program.},
volume = {59},
pages = {413--420},
year = {1993}
}
@ARTICLE{BieOzb2004,
AUTHOR = "D. Bienstock and N. Ozbay",
TITLE = "Tree-width and the {S}herali-{A}dams operator",
JOURNAL = dopt,
YEAR = 2004,
month = "",
volume = 1,
number = "",
pages = "13--21",
copy = ""
}
@ARTICLE{BieFel72,
AUTHOR = "A.~W. Biermann and J.~A. Feldman",
TITLE = "On the synthesis of finite-state machines from samples and their behavior",
JOURNAL = ieeetoc,
YEAR = 1972,
month = "",
volume = 21,
number = "",
pages = "592--597",
copy = ""
}
@ARTICLE{BieKri76,
AUTHOR = "A. W. Biermann and R. Krishnaswamy",
TITLE = "Constructing programs from example computations",
JOURNAL = {IEEE Trans. Softw. Eng.},
YEAR = 1976,
month = "",
volume = 2,
number = "",
pages = "141--153",
copy = ""
}
@article{Big73,
author = {N. Biggs},
title = {Perfect codes in graphs},
journal = jcthb,
volume = {15},
pages = {289--296},
year = {1973},
}
@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 = ""
}
@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{BilFar2008,
author = {P. Bille and
M. Farach{-}Colton},
title = {Fast and compact regular expression matching},
journal = tcs,
volume = {409},
number = {3},
pages = {486--496},
year = {2008},
}
@article{Bil2012,
author = {P. Bille},
title = {Faster Approximate String Matching for Short Patterns},
journal = tocs,
volume = {50},
number = {3},
pages = {492--515},
year = {2012},
}
@article{BilDGLM2018,
author = {S.~J.~L. Billinge and
P.~M. Duxbury and
D.~S. Gon{\c{c}}alves and
C. Lavor and
A. Mucherino},
title = {Recent results on assigned and unassigned distance geometry with applications
to protein molecules and nanostructures},
journal = {Ann. Oper. Res.},
volume = {271},
number = {1},
pages = {161--203},
year = {2018},
}
@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{Bil93,
author = "D. Billington",
title = "Using the Context-Free Pumping Lemma",
journal = jacm,
volume = "36",
pages = "21,81",
year = "1993",
}
@article{Bil99,
author = {E.~J. Billington},
title = {Decomposing complete tripartite graphs into cycles of lengths
3 and 4},
journal = dm,
volume = {197-198},
year = {1999},
pages = {123--135},
}
@Article{BilFuRod2001,
author = {E.~J. Billington and H.-L. Fu and C.~A. Rodger},
title = {Packing complete multipartite
graphs with 4-cycles},
journal = {J. Combinatorial Designs},
year = {2001},
volume = {9},
pages = {107--127},
}
@article{Bil2004,
author = {E.~J. Billington},
title = {Multipartite graph decomposition:
cycles and closed trails},
journal = {LE MATEMATICHE},
volume = {59},
year = {2004},
pages = {53--72},
}
@article{BilFuRod2005,
author = {E.~J. Billington and H.-L. Fu and C.~A. Rodger},
year={2005},
journal={Graphs and Combinatorics},
volume={21},
number={2},
title={Packing $\lambda$-Fold Complete Multipartite Graphs with 4-Cycles},
pages={169--186},
}
@article{BilJau89,
title = {A decomposition method for minimizing quadratic pseudo-Boolean functions},
journal = {Operations Research Letters},
volume = {8},
number = {3},
pages = {161--163},
year = {1989},
}
@inproceedings{BilWidZyc2008,
author = {D. Bil{\`{o}} and
P. Widmayer and
A. Zych},
title = {Reoptimization of Weighted Graph and Covering Problems},
booktitle = {Approximation and Online Algorithms, 6th International Workshop, {WAOA}},
pages = {201--213},
year = {2008},
editor = {E. Bampis and
M. Skutella},
series = {LNCS},
volume = {5426},
publisher = {Springer},
}
@article{BilPro2008,
author = {D. Bil{\`{o}} and
G. Proietti},
title = {On the complexity of minimizing interference in ad-hoc and sensor
networks},
journal = tcs,
volume = {402},
number = {1},
pages = {43--55},
year = {2008},
}
@article{BilBKKMSZ2011,
author = {D. Bil{\`{o}} and
H.{-}J. B{\"{o}}ckenhauer and
D. Komm and
R. Kr{\'{a}}lovic and
T. M{\"{o}}mke and
S. Seibert and
A. Zych},
title = {Reoptimization of the Shortest Common Superstring Problem},
journal = alg,
volume = {61},
number = {2},
pages = {227--251},
year = {2011},
}
@inproceedings{BilZyc2012,
author = {D. Bil{\`{o}} and
A. Zych},
title = {New Advances in Reoptimizing the Minimum {S}teiner Tree Problem},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS}.},
pages = {184--197},
year = {2012},
editor = {B. Rovan and
V. Sassone and
P. Widmayer},
series = {LNCS},
volume = {7464},
publisher = {Springer},
}
@PhdThesis{Bin2010,
author = {D. Binkele-Raible},
title = {Amortized Analysis of Exponential Time- and 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 = acmtalg,
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{BinEFGMR2014,
author = {D. Binkele-Raible and G. Erd\'elyi and H. Fernau and J. Goldsmith and
N. Mattei and J. Rothe},
title = {The complexity of probabilistic lobbying},
journal = dopt,
year = {2014},
OPTkey = {},
volume = {11},
OPTnumber = {},
pages = {1--21},
}
@Article{BinFer14,
author = {D. Binkele-Raible and H. Fernau},
title = {A Parameterized Measure-and-Conquer
Analysis for Finding a $k$-Leaf Spanning Tree
in an Undirected Graph},
journal = dmtcs,
year = {2014},
volume = {16},
number = {1},
pages = {179--200},
}
@article{BinDidPat2013,
author = {C. Binucci and W. Didimo and
M. Patrignani},
title = {Upward and quasi-upward planarity testing of embedded
mixed graphs},
journal = tcs,
volume = {to appear},
year = {2013},
pages = {},
}
@incollection{BinBDGHKMSSS2019,
author = {C. Binucci and
U. Brandes and
T. Dwyer and
M. Gronemann and
R. von Hanxleden and
M. J. van Kreveld and
P. Mutzel and
M. Schaefer and
F. Schreiber and
B. Speckmann},
editor = {B. Steffen and
G. J. Woeginger},
title = {10 Reasons to Get Interested in Graph Drawing},
booktitle = {Computing and Software Science - State of the Art and Perspectives},
series = {LNCS},
volume = {10000},
pages = {85--104},
publisher = {Springer},
year = {2019},
}
@ARTICLE{BioIba95,
AUTHOR = "J. C. Bioch and T. Ibaraki",
TITLE = "Generating and approximating nondominated coteries",
JOURNAL = {IEEE Trans. on Parallel and Distributed Systems},
YEAR = 1995,
month = "",
volume = 6,
number = "9",
pages = "905--913",
copy = ""
}
@article{BioIba95a,
AUTHOR = "J.~C. Bioch and T. Ibaraki",
title = {Complexity of Identification and Dualization of Positive {B}oolean Functions},
journal = ic,
volume = {123},
number = {1},
pages = {50--63},
year = {1995},
}
@article{BioIba95b,
AUTHOR = "J.~C. Bioch and T. Ibaraki",
title = {Decompositions of positive self-dual {B}oolean functions},
journal = dm,
volume = {140},
number = {1-3},
pages = {23--46},
year = {1995},
}
@article{Bio98,
author = {J.~C. Bioch},
title = {Dualization, Decision Lists and Identification of Monotone Discrete
Functions},
journal = amai,
volume = {24},
number = {1-4},
pages = {69--91},
year = {1998},
}
@article{Bio2005,
author = {J.~C. Bioch},
title = {The complexity of modular decomposition of {B}oolean functions},
journal = dam,
volume = {149},
number = {1-3},
pages = {1--13},
year = {2005},
}
@article{Bir73,
author = {M. Bird},
title = {The Equivalence Problem for Deterministic Two-Tape Automata},
journal = jcss,
volume = {7},
number = {2},
pages = {218--236},
year = {1973},
}
@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{Bir92,
AUTHOR = "J.-C. Birget",
title = {Intersection and Union of Regular Languages and State Complexity},
journal = ipl,
volume = {43},
number = {4},
pages = {185--190},
year = {1992},
}
@article{Bir93,
AUTHOR = "J.-C. Birget",
title = {Partial Orders on Words, Minimal Elements of Regular Languages and
State Complexity},
journal = tcs,
volume = {119},
number = {2},
pages = {267--291},
year = {1993},
}
@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{Bir2003,
author = {E. Birmel{\'{e}}},
title = {Tree-width and circumference of graphs},
journal = jgth,
volume = {43},
number = {1},
pages = {24--25},
year = {2003},}
@article{BirHujTuz92,
author = {M. Bir{\'{o}} and
M. Hujter and
Zs. Tuza},
title = {Precoloring extension. {I}. {I}nterval graphs},
journal = dm,
volume = {100},
number = {1-3},
pages = {267--279},
year = {1992},
}
@article{BirManRiz2009,
author = {P. Bir{\'{o}} and
D. Manlove and
R. Rizzi},
title = {Maximum Weight Cycle Packing in Directed Graphs, with Application
to Kidney Exchange Programs},
journal = dmaa,
volume = {1},
number = {4},
pages = {499--518},
year = {2009},
}
@article{BisMar2008,
author = {R. Bisdorff and J.-L. Marichal},
title = {Counting Non-Isomorphic Maximal
Independent Sets of the $n$-Cycle Graph},
journal = {Journal of Integer Sequences},
volume = {11},
year = {2008},
number = {08.5.7}
}
@article{BisGhoPau2013,
author = {A. Bishnu and
A. Ghosh and
S. Paul},
title = {Parameterized complexity of $k$-tuple and liar's domination},
journal = {CoRR},
volume = {abs/1309.5461},
year = {2013},
ee = {http://arxiv.org/abs/1309.5461},
}
@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},
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},
}
@article{BjoHK2009,
author = {A. Bj{\"{o}}rklund and
T. Husfeldt and
M. Koivisto},
title = {Set Partitioning via Inclusion-Exclusion},
journal = siam,
volume = {39},
number = {2},
pages = {546--563},
year = {2009},
}
@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{BjoHKK2010,
author = {A. Bj{\"{o}}rklund and
T. Husfeldt and
P. Kaski and
M. Koivisto},
title = {Evaluation of permanents in rings and semirings},
journal = ipl,
volume = {110},
number = {20},
pages = {867--870},
year = {2010},
}
@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{BjoHKK2011,
author = {A. Bj{\"{o}}rklund and
T. Husfeldt and
P. Kaski and
M. Koivisto},
title = {Covering and packing in linear space},
journal = ipl,
volume = {111},
number = {21-22},
pages = {1033--1036},
year = {2011},
}
@inproceedings{Bjo2012,
author = {A. Bj{\"{o}}rklund},
title = {Counting perfect matchings as fast as {R}yser},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA}},
pages = {914--921},
year = {2012},
editor = {Y. Rabani},
publisher = {{SIAM}},
}
@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},
}
@inproceedings{BjoKKL2015,
author = {A. Bj{\"{o}}rklund and
P. Kaski and
L. Kowalik and
J. Lauri},
editor = {U. Brandes and
D. Eppstein},
title = {Engineering Motif Search for Large Graphs},
booktitle = {Proceedings of the Seventeenth Workshop on Algorithm Engineering and
Experiments, {ALENEX}},
pages = {104--118},
publisher = {{SIAM}},
year = {2015},
}
@inproceedings{BjoKKZ2015,
author = {A. Bj{\"{o}}rklund and
V. Kamat and
L. Kowalik and
M. Zehavi},
title = {Approximation Algorithms for Min-Sum $k$-Clustering and Balanced $k$-Median},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP}, Part {I}},
pages = {243--255},
year = {2015},
editor = {M.~M. Halld{\'{o}}rsson and
K. Iwama and
N. Kobayashi and
B. Speckmann},
series = {LNCS},
volume = {9134},
publisher = {Springer},
}
@article{BjoFerKas2016,
author = {J. Bj\"orklund and H. Fernau and A. Kasprzik},
title = "Polynomial inference of universal automata from membership and equivalence queries",
journal = ic,
volume = "246",
number = "",
pages = "3--19",
year = "2016",
}
@InCollection{BjoFer2016,
author = {J. Bj\"orklund and H. Fernau},
title = {Learning Tree Languages},
booktitle = {Topics in Grammatical Inference},
editors = {Heinz, J. and Sempere, J.~M.},
OPTcrossref = {},
OPTkey = {},
pages = {173--213},
publisher = {Springer},
year = {2016},
}
@article{BjoHKK2017,
author = {A. Bj{\"{o}}rklund and
T. Husfeldt and
P. Kaski and
M. Koivisto},
title = {Narrow sieves for parameterized paths and packings},
journal = jcss,
volume = {87},
pages = {119--139},
year = {2017},
}
@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 = ""
}
@article{BlaBodWin2017,
author = {F. Blanchet{-}Sadri and
M. Bodnar and
B. De Winkle},
title = {New Bounds and Extended Relations Between Prefix Arrays, Border Arrays,
Undirected Graphs, and Indeterminate Strings},
journal = tocs,
volume = {60},
number = {3},
pages = {473--497},
year = {2017},
}
@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 = ""
}
@ARTICLE{Bla85,
AUTHOR = "J. P. Blanks",
TITLE = "Near-optimal quadratic-based placement for a class of {IC} layout problems",
JOURNAL = {IEEE Circuits and Devices Magazine},
YEAR = 1985,
month = sep,
volume = {},
number = "",
pages = "31--37",
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},
}
@article{BlaMan2005,
author = {M. Bl{\"{a}}ser and
B. Manthey},
title = {Approximating Maximum Weight Cycle Covers in Directed Graphs with
Weights Zero and One},
journal = alg,
volume = {42},
number = {2},
pages = {121--139},
year = {2005},
}
@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},
}
@inproceedings{BlaFLMS2019,
author = {Bl\"asius, T. and Friedrich, T. and Lischeid, J. and Meeks, K. and Schirneck, M.},
booktitle = {Algorithm Engineering and Experiments (ALENEX)},
title = {Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling},
pages = {130--143},
publisher = {{SIAM}},
year = 2019
}
@inproceedings{BlaFFS2019,
author = {T. Bl{\"{a}}sius and
P. Fischbeck and
T. Friedrich and
M. Schirneck},
editor = {K. Avrachenkov and
P. Pralat and
N. Ye},
title = {Understanding the Effectiveness of Data Reduction in Public Transportation
Networks},
booktitle = {Algorithms and Models for the Web Graph - 16th International Workshop,
{WAW}},
series = {LNCS},
volume = {11631},
pages = {87--101},
publisher = {Springer},
year = {2019},}
@article{BlaFLMS2022,
author = {T. Bl{\"{a}}sius and
T. Friedrich and
J. Lischeid and
K. Meeks and
M. Schirneck},
title = {Efficiently enumerating hitting sets of hypergraphs arising in data
profiling},
journal = jcss,
volume = {124},
pages = {192--213},
year = {2022},
}
@article{BlaFriSch2022,
author = {T. Bl{\"{a}}sius and
T. Friedrich and
M. Schirneck},
title = {The complexity of dependency detection and discovery in relational
databases},
journal = tcs,
volume = {900},
pages = {79--96},
year = {2022},
}
@article{BlaGur82,
author = {A. Blass and
Y. Gurevich},
title = {On the Unique Satisfiability Problem},
journal = icalt,
volume = {55},
number = {1-3},
pages = {80--88},
year = {1982},
}
@inproceedings{BlaGNV2005,
author = {A. Blass and
Y. Gurevich and
L. Nachmanson and
M. Veanes},
editor = {W. Grieskamp and
C. Weise},
title = {Play to Test},
booktitle = {Formal Approaches to Software Testing, 5th International Workshop,
{FATES}},
series = {LNCS},
volume = {3997},
pages = {32--46},
publisher = {Springer},
year = {2005},
}
@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 = ""
}
@inproceedings{BlaLat81,
author = {M. Blattner and
M. Latteux},
title = {Parikh-Bounded Languages},
booktitle = {Automata, Languages and Programming, 8th Colloquium, ICALP},
pages = {316--323},
year = {1981},
editor = {S. Even and
O. Kariv},
series = {LNCS},
volume = {115},
publisher = {Springer},
}
@article{BliWol2018,
author = {B. Bliem and
S. Woltran},
title = {Defensive alliances in graphs of bounded treewidth},
journal = dam,
volume = {251},
pages = {334--339},
year = {2018},
}
@article{BliWol2018a,
author = {B. Bliem and
S. Woltran},
title = {Complexity of Secure Sets},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2909--2940},
year = {2018},
}
@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},
}
@inproceedings{BliBDRS2012,
author = {G. Blin and
P. Bonizzoni and
R. Dondi and
R. Rizzi and
F. Sikora},
title = {Complexity Insights of the Minimum Duplication Problem},
booktitle = {SOFSEM 2012: Theory and Practice of Computer Science --- 38th
Conference on Current Trends in Theory and Practice of Computer
Science},
year = {2012},
pages = {153--164},
editor = {M. Bielikov{\'a} and
G. Friedrich and
G. Gottlob and
S. Katzenbeisser and
G. Tur{\'a}n},
publisher = {Springer},
series = {LNCS},
volume = {7147},
}
@article{BliBDS2012,
author = {G. Blin and
P. Bonizzoni and
R. Dondi and
F. Sikora},
title = {On the parameterized complexity of the repetition free longest
common subsequence problem},
journal = ipl,
volume = {112},
number = {7},
year = {2012},
pages = {272--276},
}
@article{BliCreOli2021,
title = {Locally definable vertex set properties are efficiently enumerable},
journal = dam,
volume = {303},
pages = {186--202},
year = {2021},
doi = {https://doi.org/10.1016/j.dam.2020.05.037},
author = {S. Blind and N. Creignou and F. Olive},
}
@article{BliCKM2015,
author = {I. Bliznets and
M. Cygan and
P. Komosa and
L. Mach},
title = {Kernelization lower bound for Permutation Pattern Matching},
journal = ipl,
volume = {115},
number = {5},
pages = {527--531},
year = {2015},
}
@article{BliFPP2015,
author = {I. Bliznets and
F. V. Fomin and
M. Pilipczuk and
M. Pilipczuk},
title = {A Subexponential Parameterized Algorithm for Proper Interval Completion},
journal = siamdm,
volume = {29},
number = {4},
pages = {1961--1987},
year = {2015},
}
@Article{BliFGKKS2017,
author="Bliznets, I.
and Fomin, F.~V.
and Golovach, P.~A.
and Karpov, N.
and Kulikov, A.~S.
and Saurabh, S.",
title="Parameterized Complexity of Superstring Problems",
journal=alg,
year="2017",
volume="79",
number="3",
pages="798--813",}
@inproceedings{BloWil2010,
author = {J. Blocki and
R. Williams},
title = {Resolving the Complexity of Some Data Privacy Problems},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP}, Part
{II}},
pages = {393--404},
year = {2010},
editor = {S. Abramsky and
C. Gavoille and
C. Kirchner and
F. Meyer auf der Heide and
P. G. Spirakis},
series = {LNCS},
volume = {6199},
publisher = {Springer},
}
@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 = ""
}
@InProceedings{BloEspJaa2018,
author ={M. Blondin and J. Esparza and S. Jaax},
title ={Large Flocks of Small Birds: on the Minimal Size of Population Protocols},
booktitle ={35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages ={16:1--16:14},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2018},
volume ={96},
editor ={R. Niedermeier and B. Vall{\'e}e},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@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 = ""
}
@article{BloEsi97,
author = {S.~L. Bloom and
Z. {\'E}sik},
title = {Axiomatizing Shuffle and Concatenation in Languages},
journal = ic,
volume = {139},
number = {1},
year = {1997},
pages = {62--91},
}
@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},
}
@Article{BloKreMcK2016,
author="Blondin, M.
and Krebs, A.
and McKenzie, P.",
title="The complexity of intersecting finite automata having few final states",
journal="Computational Complexity",
year="2016",
month="Dec",
day="01",
volume="25",
number="4",
pages="775--814",
}
@article{BloEFGHLMT2021,
author = {M. Blondin and
M. Englert and
A. Finkel and
S. G{\"{o}}ller and
C. Haase and
R. Lazic and
P. McKenzie and
P. Totzke},
title = {The Reachability Problem for Two-Dimensional Vector Addition Systems
with States},
journal = jacm,
volume = {68},
number = {5},
pages = {34:1--34:43},
year = {2021},
}
@InProceedings{Blo91,
author = "D. M. Blough",
title = "On the Reconfiguration of Memory Arrays Containing
Clustered Faults",
pages = "444--451",
booktitle = "Fault Tolerant Computing",
month = jun,
publisher = "IEEE Computer Society Press",
address = "Los Alamitos, Ca., USA",
year = "1991",
}
@ARTICLE{BloPel92,
AUTHOR = "D. M. Blough and A. Pelc",
TITLE = "Complexity of fault diagnosis in comparison models",
JOURNAL = ieeetoc,
YEAR = 1992,
month = "",
volume = 41,
number = "3",
pages = "318--323",
copy = ""
}
@ARTICLE{BloSulMas92,
AUTHOR = "D. M. Blough and G. F. Sullivan and G. M. Masson",
TITLE = "Efficient diagnosis of multiprocessor systems under
probabilistic models",
JOURNAL = ieeetoc,
YEAR = 1992,
month = "",
volume = 41,
number = "9",
pages = "1126--1136",
copy = ""
}
@article{BloPel93,
author = {D. M. Blough and
A. Pelc},
title = {A Clustered Failure Model for the Memory Array Reconfiguration
Problem},
journal = ieeetoc,
volume = {42},
number = {5},
year = {1993},
pages = {518--528},
}
@ARTICLE{Blu63,
AUTHOR = "H. Bluhmke",
TITLE = "Three-dimensional crossword puzzles in {H}ebrew",
JOURNAL = icalt,
YEAR = 1963,
month = "",
volume = 6,
number = "",
pages = "306--309",
copy = ""
}
@ARTICLE{BluBlu75,
AUTHOR = "L. Blum and M. Blum",
TITLE = "Toward a mathematical theory of inductive inference",
JOURNAL = icalt,
YEAR = 1975,
month = "",
volume = 28,
number = "",
pages = "125--155",
copy = ""
}
@INPROCEEDINGS{BluHew67,
AUTHOR = "M. Blum and C. Hewitt",
TITLE = "Automata on a two-dimensional tape",
BOOKTITLE = "IEEE Symposium on Switching and Automata Theory",
YEAR = 1967,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "155--160",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{BluKoz78,
AUTHOR = "M. Blum and D. Kozen",
TITLE = "On the power of the compass",
BOOKTITLE = "Proc. 19th Ann. Symp. on Foundations in Computer Science",
YEAR = 1978,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "132--142",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{BluSak77,
AUTHOR = "M. Blum and W. J. Sakoda",
TITLE = "On the capability of finite automata in 2 and 3 dimensional space",
BOOKTITLE = "Proc. 18th Ann. Symp. on Foundations in Computer Science",
YEAR = 1977,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "147--161",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{BluShuSma88,
AUTHOR = "L. Blum and M. Shub and S. Smale",
TITLE = "On a theory of computation over the real numbers;
{NP} completeness, recursive functions and universal machines",
BOOKTITLE = "{FOCS} proceedings",
YEAR = 1988,
pages = "387--397",
organization = "{FOCS}",
copy = ""
}
@ARTICLE{BluShuSma89,
AUTHOR = "L. Blum and M. Shub and S. Smale",
TITLE = "On a theory of computation and complexity over the real numbers;
{NP} completeness, recursive functions and universal machines",
JOURNAL = bamsnew,
YEAR = 1989,
volume = 21,
number = "1",
pages = "1--46",
copy = ""
}
@article{BluRagSch97,
author = {A. Blum and
P. Raghavan and
B. Schieber},
title = {Navigating in Unfamiliar Geometric Terrain},
journal = siam,
volume = {26},
number = {1},
pages = {110--137},
year = {1997},
}
@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{BluKoc99,
author = {N. Blum and
R. Koch},
title = {Greibach Normal Form Transformation Revisited},
journal = ic,
volume = {150},
number = {1},
pages = {112--118},
year = {1999},}
@article{BluBFK2013,
title = "Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata",
journal = "Journal of Visual Languages \& Computing",
volume = "24",
number = "3",
pages = "192--206",
year = "2013",
author = "C. Blume and H.~J.~S. Bruggink and M. Friedrich and B. K{\"o}nig"
}
@inproceedings{BluGra2000,
author = {A. Blumensath and
E. Gr{\"{a}}del},
title = {Automatic Structures},
booktitle = {15th Annual {IEEE} Symposium on Logic in Computer Science, Santa Barbara, LICS},
pages = {51--62},
publisher = {{IEEE} Computer Society},
year = {2000},
ydoi = {10.1109/LICS.2000.855755},
}
@article{BluGra2004,
author = {A. Blumensath and
E. Gr{\"{a}}del},
title = {Finite Presentations of Infinite Structures: Automata and Interpretations},
journal = tocs,
volume = {37},
number = {6},
pages = {641--674},
year = {2004},
ydoi = {10.1007/s00224-004-1133-y},
}
@Article{BluCou2014,
author = {A. Blumensath and B. Courcelle},
title = {Monadic second-order definable graph orderings},
journal = {Logical Methods in Computer Science},
year = {2014},
volume = {10},
OPTnumber = {},
pages = {1--36},
}
@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 = ""
}
@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 = ""
}
@INPROCEEDINGS{Boa72,
crossref = "Niv73",
AUTHOR = "L. Boasson",
TITLE = "Un crit\`ere de rationnalit\'e des langages algebriques",
chapter = "",
pages = "359--365",
copy = ""
}
@article{Boa73,
author = {L. Boasson},
title = {Two Iteration Theorems for Some Families of Languages},
journal = jcss,
volume = {7},
number = {6},
pages = {583--596},
year = {1973},
}
@article{Boa73a,
author = {L. Boasson},
title = {The Inclusion of the Substitution Closure of Linear and One-Counter
Languages in the Largest Sub-{AFL} of the Family of Algebraic Languages
is Proper},
journal = ipl,
volume = {2},
number = {5},
pages = {135--140},
year = {1973},
}
@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}
}
@ARTICLE{BoaRes77,
AUTHOR = "L. Boasson and A. Restivo",
TITLE = "Une charact\'erisation des langages alg\'ebriques born\'es",
JOURNAL = rairo,
YEAR = 1977,
month = "",
volume = 11,
number = "3",
pages = "203--205",
copy = ""
}
@ARTICLE{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 = ""
}
@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{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{BoaSen85,
author = {L. Boasson and
G. S{\'{e}}nizergues},
title = {{NTS} Languages Are Deterministic and Congruential},
journal = jcss,
volume = {31},
number = {3},
pages = {332--342},
year = {1985},
}
@inproceedings{BocHMW2008,
author = {H.{-}J. B{\"{o}}ckenhauer and
J. Hromkovic and
T. M{\"{o}}mke and
P. Widmayer},
title = {On the Hardness of Reoptimization},
editor = {V. Geffert and
J. Karhum{\"{a}}ki and
A. Bertoni and
B. Preneel and
P. N{\'{a}}vrat and
M. Bielikov{\'{a}}},
booktitle = {{SOFSEM}: Theory and Practice of Computer Science, 34th Conference
on Current Trends in Theory and Practice of Computer Science},
series = {LNCS},
volume = {4910},
pages = {50--65},
publisher = {Springer},
year = {2008}
}
@article{BocHKMR2009,
author = {H.{-}J. B{\"{o}}ckenhauer and
J. Hromkovic and
R. Kr{\'{a}}lovic and
T. M{\"{o}}mke and
P. Rossmanith},
title = {Reoptimization of {S}teiner trees: Changing the terminal set},
journal = tcs,
volume = {410},
number = {36},
pages = {3428--3435},
year = {2009},
}
@article{BocKom2010,
author = {H.{-}J. B{\"{o}}ckenhauer and
D. Komm},
title = {Reoptimization of the metric deadline {TSP}},
journal = jda,
volume = {8},
number = {1},
pages = {87--100},
year = {2010},
}
@article{BocFHMSS2012,
author = {H.{-}J. B{\"{o}}ckenhauer and
K. Freiermuth and
J. Hromkovic and
T. M{\"{o}}mke and
A. Sprock and
B. Steffen},
title = {Steiner tree reoptimization in graphs with sharpened triangle inequality},
journal = jda,
volume = {11},
pages = {73--86},
year = {2012},
}
@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{BocDam2011,
author = {S. B{\"{o}}cker and
P. Damaschke},
title = {Even faster parameterized cluster deletion and cluster editing},
journal = ipl,
volume = {111},
number = {14},
pages = {717--721},
year = {2011},
}
@article{BocDam2012,
author = {S. B{\"{o}}cker and
P. Damaschke},
title = {A note on the parameterized complexity of unordered maximum tree orientation},
journal = dam,
volume = {160},
number = {10},
pages = {1634--1638},
year = {2012},}
@article{BocBuiTru2012,
author = {S. B{\"o}cker and
Q. B. A. Bui and
A. Tru{\ss}},
title = {Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {1},
pages = {7:1--7:17},
year = {2012},
}
@inproceedings{BocBau2013,
author = {S. B{\"o}cker and
J. Baumbach},
title = {Cluster Editing},
booktitle = {The Nature of Computation. Logic, Algorithms, Applications
--- 9th Conference on Computability in Europe, CiE},
year = {2013},
pages = {33--44},
editor = {P. Bonizzoni and
V. Brattka and
B. L{\"o}we},
publisher = {Springer},
series = {LNCS},
volume = {7921},
}
@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{BodGenPes2013,
author ={O. Bodini and A. Genitrini and F. Peschanski},
title ={{The Combinatorics of Non-determinism}},
booktitle ={IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},
pages ={425--436},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2013},
volume ={24},
editor ={A. Seth and N.~K. Vishnoi},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
}
@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{Bod91,
author = {H.~L. Bodlaender},
title = {On the Complexity of Some Coloring Games},
journal = ijfcs,
volume = {2},
number = {2},
year = {1991},
pages = {133--147},
}
@InProceedings{BodGonKlo91,
author = "H.~L. Bodlaender and T. Gonzales and T. Kloks",
title = "Complexity Aspects of Map Compression",
booktitle = "DCC: Data Compression Conference",
publisher = "IEEE Computer Society",
year = "1991", pages = "287--296"
}
@article{Bod93,
author = {H.~L. Bodlaender},
title = {A Tourist Guide through Treewidth},
journal = actacybern,
volume = {11},
number = {1-2},
pages = {1--21},
year = {1993},
}
@inproceedings{BodKloKra93,
author = {H.~L. Bodlaender and
T. Kloks and
D. Kratsch},
editor = {A. Lingas and
R.~G. Karlsson and
S. Carlsson},
title = {Treewidth and Pathwidth of Permutation Graphs},
booktitle = {Automata, Languages and Programming, 20nd International Colloquium,
ICALP},
series = {LNCS},
volume = {700},
pages = {114--125},
publisher = {Springer},
year = {1993},
}
@article{Bod94,
author = {H.~L. Bodlaender},
title = {On Disjoint Cycles},
journal = ijfcs,
volume = {5},
number = {1},
year = {1994},
pages = {59--68},
}
@article{Bod96,
author = {H.~L. Bodlaender},
title = {A Linear-Time Algorithm for Finding Tree-Decompositions
of Small Treewidth},
journal = siam,
volume = {25},
number = {6},
year = {1996},
pages = {1305--1317},
}
@InProceedings{Bod97,
author = {H.~L. Bodlaender},
title = {Treewidth: Algorithmic techniques and results},
booktitle = {Proc. 22nd Mathematical Foundations of Computer Science MFCS'97},
pages = {19--36},
editor = {I. Pr\'{\i}vara and
P. Ruzicka},
year = {1997},
volume = {1295},
series = {LNCS},
publisher = {Springer},
}
@article{BodEng97,
author = {H.~L. Bodlaender and J. Engelfriet},
title = {Domino Treewidth},
journal = jalg,
volume = {24},
year = {1997},
pages = {94--123},
}
@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},
}
@article{BodEng97,
author = {H.~L. Bodlaender and
J. Engelfriet},
title = {Domino Treewidth},
journal = jalg,
volume = {24},
number = {1},
pages = {94--123},
year = {1997},
ydoi = {10.1006/JAGM.1996.0854},
}
@article{Bod99,
author = {H.~L. Bodlaender},
title = {A note on domino treewidth},
journal = dmtcs,
volume = {3},
number = {4},
pages = {141--150},
year = {1999},
ydoi = {10.46298/DMTCS.256},
}
@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},
}
@article{BodTel2004,
author = {H.~L. Bodlaender and
G. Tel},
title = {A Note on Rectilinearity and Angular Resolution},
journal = jgaa,
volume = {8},
pages = {89--94},
year = {2004},
}
@article{BodWolKos2006,
author = {H.~L. Bodlaender and
T. Wolle and
A. M. C. A. Koster},
title = {Contraction and Treewidth Lower Bounds},
journal = jgaa,
volume = {10},
number = {1},
pages = {5--49},
year = {2006},
ydoi = {10.7155/jgaa.00117},
}
@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: Track 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\"uller 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},
}
@article{BodFelThi2009,
author = {H.~L. Bodlaender and
M.~R. Fellows and
D.~M. Thilikos},
title = {Derivation of algorithms for cutwidth and related graph layout parameters},
journal = jcss,
volume = {75},
number = {4},
pages = {231--244},
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},
}
@article{BodKos2010,
title = "Treewidth computations {I}. {U}pper bounds",
journal = ic,
volume = "208",
number = "3",
pages = "259--275",
year = "2010",
author = "H.~L. Bodlaender and A.~M.~C.~A. Koster",
}
@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{BodKos2011,
title = "Treewidth computations {II}. {L}ower bounds",
journal = ic,
volume = "209",
pages = "1103--1119",
year = "2011",
author = "H.~L. Bodlaender and A.~M.~C.~A. Koster",
}
@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,
}
@inproceedings{BodKra2011a,
author = {H.~L. Bodlaender and D. Kratsch},
title = {Exact algorithms for {K}ayles},
booktitle = {Graph-Theoretic Concepts in Computer Science --- 37th International
Workshop, WG},
year = {2011},
pages = {59--70},
editor = {P. Kolman and
J. Kratochv\'{\i}l},
publisher = {Springer},
series = {LNCS},
volume = {6986},
}
@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},
}
@inproceedings{BodCKN2013,
author = {H.~L. Bodlaender and
M. Cygan and
S. Kratsch and
J. Nederlof},
title = {Deterministic Single Exponential Time Algorithms for Connectivity
Problems Parameterized by Treewidth},
booktitle = {Automata, Languages, and Programming --- 40th International
Colloquium, ICALP (1)},
year = {2013},
pages = {196--207},
editor = {F.~V. Fomin and
R. Freivalds and
M. Z. Kwiatkowska and
D. Peleg},
publisher = {Springer},
series = {LNCS},
volume = {7965},
}
@article{BodJanKra2014,
author = {H.~L. Bodlaender and
B.~M.~P. Jansen and
S. Kratsch},
title = {Kernelization Lower Bounds by Cross-Composition},
journal = siamdm,
volume = {28},
number = {1},
year = {2014},
pages = {277--305},
}
@inproceedings{BodNed2015,
author = {H.~L. Bodlaender and
J. Nederlof},
title = {Subexponential Time Algorithms for Finding Small Tree and Path Decompositions},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium},
pages = {179--190},
editor = {N. Bansal and
I. Finocchi},
series = {LNCS},
volume = {9294},
publisher = {Springer},
year = {2015},
}
@article{BodKre2015,
author = {H.~L. Bodlaender and
M.~J. van Kreveld},
title = {Google {S}cholar makes it hard - the complexity of organizing one's
publications},
journal = ipl,
volume = {115},
number = {12},
pages = {965--968},
year = {2015},
ydoi = {10.1016/j.ipl.2015.07.003},
}
@techreport{Utrecht-TR-2015-016,
author = {H.~L. Bodlaender and E. Boros and P. Heggernes and D. Kratsch},
title = {Open Problems of the {L}orentz Workshop
``{E}numeration Algorithms using Structure''},
number = {UU-CS-2015-016},
month= nov,
year = 2015,
institution = {Department of Information and Computing Sciences,
Utrecht University, Utrecht, The Netherlands}
}
@article{BodCKN2015,
author = {H.~L. Bodlaender and
M. Cygan and
S. Kratsch and
J. Nederlof},
title = {Deterministic single exponential time algorithms for connectivity
problems parameterized by treewidth},
journal = ic,
volume = {243},
pages = {86--111},
year = {2015},
}
@article{BodFLPST2016,
author = {H.~L. Bodlaender and
F.~V. Fomin and
D. Lokshtanov and
E. Penninkx and
S. Saurabh and
D.~M. Thilikos},
title = {(Meta) Kernelization},
journal = jacm,
volume = {63},
number = {5},
pages = {44:1--44:69},
year = {2016},
}
@article{BodDDFLP2016,
author = {H.~L. Bodlaender and
P.~G. Drange and
M.~S. Dregi and
F.~V. Fomin and
D. Lokshtanov and
M. Pilipczuk},
title = {A {$c^kn$} 5-Approximation Algorithm for Treewidth},
journal = siam,
volume = {45},
number = {2},
pages = {317--378},
year = {2016},
}
@inproceedings{BodGroSwe2021,
author = {H.~L. Bodlaender and
C. Groenland and
C.~M.~F. Swennenhuis},
editor = {P. A. Golovach and
M. Zehavi},
title = {Parameterized Complexities of Dominating and Independent Set Reconfiguration},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC}},
series = {LIPIcs},
volume = {214},
pages = {9:1--9:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
}
@inproceedings{BodGNS2021,
author = {H.~L. Bodlaender and
C. Groenland and
J. Nederlof and
C.~M.~F. Swennenhuis},
title = {Parameterized Problems Complete for Nondeterministic {FPT} time and
Logarithmic Space},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}},
pages = {193--204},
publisher = {{IEEE}},
year = {2021},
yurl = {https://doi.org/10.1109/FOCS52979.2021.00027},
}
@inproceedings{Bod2022,
author = {H.~L. Bodlaender},
editor = {P. Mutzel and
Md.~S. Rahman and
Slamin},
title = {From the {W}-hierarchy to {XNLP} - Classes of Fixed Parameter Intractability},
booktitle = {{WALCOM:} Algorithms and Computation - 16th International Conference
and Workshops},
series = {LNCS},
volume = {13174},
pages = {15--25},
publisher = {Springer},
year = {2022},
yurl = {https://doi.org/10.1007/978-3-030-96731-4\_2},
}
@inproceedings{BodGJJL2022,
author = {H. L. Bodlaender and
C. Groenland and
H. Jacob and
L. Jaffke and
P. T. Lima},
editor = {H. Dell and
J. Nederlof},
title = {{XNLP}-Completeness for Parameterized Problems on Graphs with a Linear
Structure},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC}},
series = {LIPIcs},
volume = {249},
pages = {8:1--8:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
}
@inproceedings{BodGroJac2022,
author = {H.~L. Bodlaender and
C. Groenland and
H. Jacob},
editor = {H. Dell and
J. Nederlof},
title = {On the Parameterized Complexity of Computing Tree-Partitions},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC}},
series = {LIPIcs},
volume = {249},
pages = {7:1--7:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
ydoi = {10.4230/LIPICS.IPEC.2022.7},
}
@article{BoeLucRes80,
title = "Minimal complete sets of words",
journal = tcs,
volume = "12",
number = "3",
pages = "325--332",
year = "1980",
author = {J.~M. Bo\"e and A. de Luca and A. Restivo},
}
@article{BoeGim77,
author = {Boesch, F. T. and Gimpel, J. F.},
title = {Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization},
journal = jacm,
volume = {24},
number = {2},
month = apr,
year = {1977},
pages = {192--198},
}
@incollection{Bog82,
author = {K.~P. Bogart},
title = {Some Social Science Applications of Ordered Sets},
editor={Rival, I.},
booktitle={Ordered Sets},
series= {NATO Advanced Study Institutes Series (Series C â€” Mathematical and Physical Sciences)},
volume= 83,
publisher = {D. Reidel Publishing Company},
year = 1982,
pages="759--787"
}
@article{BogBonMit95,
author = {K.~P. Bogart and
J.~E. Bonin and
J. Mitas},
title = {Interval orders Based on Weak orders},
journal = dam,
volume = {60},
number = {1-3},
pages = {93--98},
year = {1995},
}
@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{BohGSW2005,
author = {E. B{\"o}hler and
C. Gla{\ss}er and
B. Schwarz and
K.~W. Wagner},
title = {Generation problems},
journal = tcs,
volume = {345},
number = {2-3},
year = {2005},
pages = {260--295},
}
@INPROCEEDINGS{Bohetal98,
AUTHOR = "K. B{\"o}hm and K. Aberer and M. T. {\"O}zsu and K. Gayer",
TITLE = "Query optimization for structured documents based on knowledge on the document type definition",
BOOKTITLE = "Proc. Advances in Digital Libraries",
YEAR = 1998,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "",
address = "",
organization = "IEEE Press",
copy = ""
}
@inproceedings{BohGolJan2013,
author = {S. B{\"{o}}hm and
S. G{\"{o}}ller and
P. Jan\v car},
title = {Equivalence of deterministic one-counter automata is {NL}-complete},
booktitle = {Symposium on Theory of Computing Conference, STOC},
pages = {131--140},
year = {2013},
editor = {D. Boneh and
T. Roughgarden and
J. Feigenbaum},
publisher = {{ACM}},
}
@article{BohGolJan2014,
author = {S. B{\"{o}}hm and
S. G{\"{o}}ller and
P. Jan\v car},
title = {Bisimulation equivalence and regularity for real-time one-counter
automata},
journal = jcss,
volume = {80},
number = {4},
pages = {720--743},
year = {2014},
}
@article{BohBGKS97,
author = {T. B{\"{o}}hme and
H. Broersma and
F. G{\"{o}}bel and
A. V. Kostochka and
M. Stiebitz},
title = {Spanning trees with pairwise nonadjacent endvertices},
journal = dm,
volume = {170},
number = {1-3},
pages = {219--222},
year = {1997},
}
@article{BohMoh2003,
author = {T. B{\"{o}}hme and
B. Mohar},
title = {Domination, Packing and Excluded Minors},
journal = {Electron. J. Comb.},
volume = {10},
year = {2003},
ydoi = {10.37236/1749},
}
@inproceedings{BoiWol2002,
author = {B. Boigelot and
P. Wolper},
editor = {P.~J. Stuckey},
title = {Representing Arithmetic Constraints with Finite Automata: An Overview},
booktitle = {Logic Programming, 18th International Conference, {ICLP}},
series = {LNCS},
volume = {2401},
pages = {1--19},
publisher = {Springer},
year = {2002},
}
@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 = ""
}
@inproceedings{BoiDel2005,
author = {J.{-}D. Boissonnat and
C. Delage},
editor = {G. St{\o}lting Brodal and
S. Leonardi},
title = {Convex Hull and {V}oronoi Diagram of Additively Weighted Points},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium},
series = {LNCS},
volume = {3669},
pages = {367--378},
publisher = {Springer},
year = {2005},
ydoi = {10.1007/11561071\_34},
}
@article{BoiGru2008,
title = "Reduction and Refinement",
journal = "Electronic Notes in Theoretical Computer Science",
volume = "201",
pages = "31--44",
year = "2008",
note = "Proceedings of the BCS-FACS Refinement Workshop (REFINE 2007)",
issn = "1571-0661",
author = "E. Boiten and D. Grundy",}
@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}
}
@inproceedings{BojKieLho2019,
author = {M. Bojanczyk and
S. Kiefer and
N. Lhote},
editor = {C. Baier and
I. Chatzigiannakis and
P. Flocchini and
S. Leonardi},
title = {String-to-String Interpretations With Polynomial-Size Output},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP}},
series = {LIPIcs},
volume = {132},
pages = {106:1--106:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
}
@inproceedings{BojKSZ2020,
author = {M. Bojanczyk and
E. Kelmendi and
R. Stefanski and
G. Zetzsche},
editor = {H. Hermanns and
L. Zhang and
N. Kobayashi and
D. Miller},
title = {Extensions of {\(\omega\)}-Regular Languages},
booktitle = {{LICS} '20: 35th Annual {ACM/IEEE} Symposium on Logic in Computer
Science},
pages = {266--272},
publisher = {{ACM}},
year = {2020},}
@article{BokBreJer2012,
author = {D. Bokal and
B. Bre{\v{s}}ar and
J. Jerebic},
title = {A generalization of {H}ungarian method and {H}all's theorem
with applications in wireless sensor networks},
journal = dam,
volume = {160},
number = {4-5},
year = {2012},
pages = {460--470},
}
@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{BolHLM2014,
author = {B. Bollig and
P. Habermehl and
M. Leucker and
B. Monmege},
title = {A Robust Class of Data Languages and an Application to Learning},
journal = {Logical Methods in Computer Science},
volume = {10},
number = {4},
year = {2014},
}
@inproceedings{Bol2016,
author = {B. Bollig},
title = {One-Counter Automata with Counter Observability},
booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS}},
pages = {20:1--20:14},
year = {2016},
editor = {A. Lal and
S. Akshay and
S. Saurabh and
S. Sen},
series = {LIPIcs},
volume = {65},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
}
@InProceedings{BolForGas2018,
author ={B. Bollig and M. Fortin and P. Gastin},
title ={Communicating Finite-State Machines and Two-Variable Logic},
booktitle ={35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages ={17:1--17:14},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2018},
volume ={96},
editor ={R. Niedermeier and B. Vall{\'e}e},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@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 = ""
}
@book{Bol1851,
author={B. Bolzano},
title={Paradoxien des {U}nendlichen},
year={1851},
publisher={Reclam sen., Leipzig},
note={Anmerkungen von H. Hahn, Verlag Felix Meiner, Leipzig, 1920}}
@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" }
@article{Bon0LPP2014,
author = {M. Bonamy and
M. Johnson and
I. Lignos and
V. Patel and
D. Paulusma},
title = {Reconfiguration graphs for vertex colourings of chordal and chordal
bipartite graphs},
journal = joco,
year = {2014},
volume = {27},
number = {1},
pages = {132--143},
}
@article{BonKow2016,
author = {M. Bonamy and
\L. Kowalik},
title = {A $13k$-kernel for planar feedback vertex set via region decomposition},
journal = tcs,
volume = {645},
pages = {25--40},
year = {2016},
}
@InProceedings{BonDFJP2017,
author ={M. Bonamy and K.~K. Dabrowski and C. Feghali and M. Johnson and D. Paulusma},
title ={Recognizing Graphs Close to Bipartite Graphs},
booktitle ={42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages ={70:1--70:14},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2017},
volume ={83},
editor ={K.~G. Larsen and H.~L. Bodlaender and J.-F. Raskin},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@article{BonDFJP2018,
author ={M. Bonamy and K.~K. Dabrowski and C. Feghali and M. Johnson and D. Paulusma},
title = "Independent feedback vertex sets for graphs of bounded diameter",
journal = ipl,
volume = "131",
pages = "26--32",
year = "2018",}
@TechReport{BonDHR2018,
author = {M. Bonamy and O. Defrain and M. Heinrich and J.-F. Raymond},
title = {Enumerating Minimal Dominating Sets in Triangle-free Graphs},
institution = {Cornell University, ArXiv},
year = {2018},
OPTkey = {},
OPTtype = {},
number = {arXiv:1810.00789 [cs.DM]},
}
@inproceedings{BonDHR2019,
author = {M. Bonamy and O. Defrain and M. Heinrich and J.-F. Raymond},
title = {Enumerating Minimal Dominating Sets in Triangle-Free Graphs},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
editor = {R. Niedermeier and C. Paul},
series = {LIPIcs},
volume = {126},
pages = {16:1--16:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2019}
}
@article{BonDFJP2019,
author = {M. Bonamy and
K.~K. Dabrowski and
C. Feghali and
M. Johnson and
D. Paulusma},
title = {Independent Feedback Vertex Set for {$P_5$}-Free Graphs},
journal = alg,
volume = {81},
number = {4},
pages = {1342--1369},
year = {2019},
}
@inproceedings{BonGavPhi2020,
author = {M. Bonamy and
C. Gavoille and
M. Pilipczuk},
editor = {S. Chawla},
title = {Shorter Labeling Schemes for Planar Graphs},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA}},
pages = {446--462},
publisher = {{SIAM}},
year = {2020},
}
@article{BonDHPR2020,
author = {M. Bonamy and
O. Defrain and
M. Heinrich and
M. Pilipczuk and
J.{-}F. Raymond},
title = {Enumerating Minimal Dominating Sets in {$K_t$}-free Graphs and Variants},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {3},
pages = {39:1--39:23},
year = {2020},
}
@article{BonDorOuv2021,
author = {M. Bonamy and
P. Dorbec and
P. Ouvrard},
title = {Dominating sets reconfiguration under token sliding},
journal = dam,
volume = {301},
pages = {6--18},
year = {2021},
ydoi = {10.1016/j.dam.2021.05.014},
}
@article{BonGavPil2022,
author = {M. Bonamy and
C. Gavoille and
M. Pilipczuk},
title = {Shorter Labeling Schemes for Planar Graphs},
journal = siamdm,
volume = {36},
number = {3},
pages = {2082--2099},
year = {2022},
}
@TechReport{Bon2006a,
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 = {},
publisher = {Springer},
year = {2011},
editor = {P. Pardalos and D.~Z. Du and R. Graham},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTtype = {},
OPTchapter = {},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTdoi = {},
}
@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 = {},
OPTdoi = {},
}
@article{BonMac2017,
author = {A. Bonato and
G. MacGillivray},
title = {Characterizations and algorithms for generalized Cops and Robbers
games},
journal = {Contributions to Discrete Mathematics},
volume = {12},
number = {1},
year = {2017},
}
@inproceedings{BonVol2016,
author = {E.~A. Bondar and
M.~V. Volkov},
title = {Completely Reachable Automata},
booktitle = {Descriptional Complexity of Formal Systems - 18th {IFIP} {WG} 1.2
International Conference, {DCFS} 2016},
pages = {1--17},
editor = {C. C{\^{a}}mpeanu and
F. Manea and
J. Shallit},
series = {LNCS},
volume = {9777},
publisher = {Springer},
year = {2016},
}
@inproceedings{BonVol2018,
author = {E.~A. Bondar and
M. V. Volkov},
title = {A Characterization of Completely Reachable Automata},
pages = {145--155},
booktitle = {Developments in Language Theory - 22nd International Conference, {DLT}},
year = {2018},
editor = {M. Hoshi and
S. Seki},
series = {LNCS},
volume = {11088},
publisher = {Springer},
}
@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 = ""
}
@inproceedings{BonDonZan2017,
author = {Bondt, M. de and
H. Don and
H. Zantema},
title = {{DFA}s and {PFA}s with Long Shortest Synchronizing Word Length},
booktitle = {Developments in Language Theory - 21st International Conference, {DLT}},
pages = {122--133},
year = {2017},
editor = {{\'{E}}. Charlier and
J. Leroy and
M. Rigo},
series = {LNCS},
volume = {10396},
publisher = {Springer},
year = {2017},
}
@article{BonDonZan2019,
author = {Bondt, M. de and
H. Don and
H. Zantema},
title = {Lower Bounds for Synchronizing Word Lengths in Partial Automata},
journal = ijfcs,
volume = {30},
number = {1},
pages = {29--60},
year = {2019},
}
@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},
}
@article{Bon2010,
author = {B. Bonet},
title = {Conformant plans and beyond: Principles and complexity},
journal = {Artificial Intelligence},
volume = {174},
number = {3-4},
pages = {245--269},
year = {2010},
}
@inproceedings{BonKacMar2007,
author = {G. Bonfante and
M. Kaczmarek and
J.{-}Y. Marion},
title = {A Classification of Viruses Through Recursion Theorems},
booktitle = {Computation and Logic in the Real World, Third Conference on Computability
in Europe, CiE},
pages = {73--82},
year = {2007},
editor = {S.~B. Cooper and
B. L{\"{o}}we and
A. Sorbi},
series = {LNCS},
volume = {4497},
publisher = {Springer},
}
@article{BonDel2018,
author = {G. Bonfante and
F. Deloup},
title = {The genus of regular languages},
journal = {Mathematical Structures in Computer Science},
volume = {28},
number = {1},
pages = {14--44},
year = {2018},
}
@article{BonGavHan2005,
author = {N. Bonichon and
C. Gavoille and
N. Hanusse},
title = {Canonical Decomposition of Outerplanar Maps and Application to Enumeration,
Coding and Generation},
journal = jgaa,
volume = {9},
number = {2},
pages = {185--204},
year = {2005},
}
@article{BonGHPS2006,
author = {N. Bonichon and
C. Gavoille and
N. Hanusse and
D. Poulalhon and
G. Schaeffer},
title = {Planar Graphs, via Well-Orderly Maps and Trees},
journal = {Graphs and Combinatorics},
volume = {22},
number = {2},
pages = {185--202},
year = {2006},
}
@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{BonFMZ2002,
author = {P. Bonizzoni and
C. de Felice and
G. Mauri and
R. Zizza},
editor = {Masami Ito and
Masafumi Toyama},
title = {Decision Problems for Linear and Circular Splicing Systems},
booktitle = {Developments in Language Theory, 6th International Conference, {DLT}},
series = {LNCS},
volume = {2450},
pages = {78--92},
publisher = {Springer},
year = {2002},
}
@article{BonFMZ2004,
author = {P. Bonizzoni and
C. de Felice and
G. Mauri and
R. Zizza},
title = {Circular splicing and regularity},
journal = rairo,
volume = {38},
number = {3},
year = {2004},
pages = {189--228},
}
@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{BonVDP2010,
author = {P. Bonizzoni and G. Della Vedova and R. Dondi and
Y. Pirola},
title = {Variants of constrained longest common subsequence},
journal = ipl,
volume = {110},
number = {20},
year = {2010},
pages = {877--881},
}
@article{BonDeFZiz2010,
title = "A characterization of (regular) circular languages generated by monotone complete splicing systems",
journal = tcs,
volume = "411",
number = "48",
pages = "4149--4161",
year = "2010",
author = "P. Bonizzoni and C. De Felice and R. Zizza",}
@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{BonDMZ2012,
author = {P. Bonizzoni and
R. Dondi and
G. Mauri and
I. Zoppis},
title = {Restricted and Swap Common Superstring: A Parameterized
View},
booktitle = {Parameterized and Exact Computation --- 7th International
Symposium, IPEC},
year = {2012},
pages = {49--60},
editor = {D. M. Thilikos and
G. J. Woeginger},
publisher = {Springer},
series = {LNCS},
volume = {7535},
}
@article{BonVDP2013,
author = {P. Bonizzoni and
G. Della Vedova and
R. Dondi and
Y. Pirola},
title = {Parameterized complexity of $k$-anonymity: hardness and tractability},
journal = joco,
volume = {26},
year = {2013},
pages = {19--43},
}
@article{BonSik2016,
author = {{\'{E}}. Bonnet and
F. Sikora},
title = {A Note on Edge Isoperimetric Numbers and Regular Graphs},
journal = ijfcs,
volume = {27},
number = {6},
pages = {771--774},
year = {2016},
}
@article{BonJamSaf2016,
author = {{\'{E}}. Bonnet and
F. Jamain and
A. Saffidine},
title = {On the complexity of connection games},
journal = tcs,
volume = {644},
pages = {2--28},
year = {2016},
}
@article{BonBGMS2018,
author = {F. Bonomo and
B. Bre\v{s}ar and
L. N. Grippo and
M. Milanic and
M.~D. Safe},
title = {Domination parameters with number : Interrelations and algorithmic
consequences},
journal = dam,
volume = {235},
pages = {23--50},
year = {2018},
}
@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 = ""
}
@PhdThesis{Bon2006,
author = {P.~S. Bonsma},
title = {Sparse Cuts, Matching-Cuts
and Leafy Trees in Graphs},
school = {University of Twente, Enschede, NL},
year = {2006},
}
@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{BonCer2009,
author = {P.~S. Bonsma and
L. Cereceda},
title = {Finding Paths between graph colourings: {PSPACE}-completeness
and superpolynomial distances},
journal = tcs,
volume = {410},
number = {50},
year = {2009},
pages = {5215--5226},
}
@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 = acmtalg,
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{BonZic2008a,
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},
}
@article{Bon2013,
author = {P.~S. Bonsma},
title = {The complexity of rerouting shortest paths},
journal = tcs,
volume = {510},
pages = {1--12},
year = {2013},
}
@inproceedings{BonKamWro2014,
author = {P. Bonsma and
M. Kami\'nski and
M. Wrochna},
title = {Reconfiguring Independent Sets in Claw-Free Graphs},
booktitle = {Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium
and Workshops},
year = {2014},
pages = {86--97},
editor = {R. Ravi and
I. Li G{\o}rtz},
publisher = {Springer},
series = {LNCS},
volume = {8503},
}
@article{Bon2017,
author = {P.~S. Bonsma},
title = {Rerouting shortest paths in planar graphs},
journal = dam,
volume = {231},
pages = {95--112},
year = {2017},
}
@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{BonHHHLR2021,
author = {K.~M.~J. De Bontridder and
B.~V. Halld{\'{o}}rsson and
M.~M. Halld{\'{o}}rsson and
C.~A.~J. Hurkens and
J.~K. Lenstra and
R. Ravi and
L. Stougie},
title = {Local improvement algorithms for a path packing problem: {A} performance
analysis based on linear programming},
journal = {Operations Research Letters},
volume = {49},
number = {1},
pages = {62--68},
year = {2021},
}
@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 = ""
}
@Article{BooCha76,
author="Book, R.~V.
and Chandra, A.~K.",
title="Inherently nonplanar automata",
journal=actainform,
year="1976",
volume="6",
number="1",
pages="89--94",
}
@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 = {},
OPTdoi = {},
}
@article{Boo78,
author = {K.~S. Booth},
title = {Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are
Polynomially Equivalent Problems},
journal = siam,
volume = {7},
number = {3},
pages = {273--279},
year = {1978},
}
@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},
}
@inproceedings{BooGLR92,
author = {H. Booth and
R. Govindan and
M. A. Langston and
S. Ramachandramurthi},
title = {Cutwidth approximation in linear time},
booktitle = {Proceedings of the Second Great Lakes Symposium on VLSI},
pages = {70--73},
publisher = {{IEEE}},
year = {1992},
}
@article{BorCKP2016,
author = {A. Boral and
M. Cygan and
T. Kociumaka and
M. Pilipczuk},
title = {A Fast Branching Algorithm for Cluster Vertex Deletion},
journal = tocs,
volume = {58},
number = {2},
pages = {357--376},
year = {2016},
}
@article{Bor2016a,
author = {M. Borassi},
title = {A note on the complexity of computing the number of reachable vertices
in a digraph},
journal = ipl,
volume = {116},
number = {10},
pages = {628--630},
year = {2016},
}
@article{BorCreHab2016,
author = {M. Borassi and
P. Crescenzi and
M. Habib},
title = {Into the Square: On the Complexity of Some Quadratic-time Solvable
Problems},
journal = {Electron. Notes Theor. Comput. Sci.},
volume = {322},
pages = {51--67},
year = {2016},
}
@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{BorCadMan2008,
author = {L. Bordeaux and
M. Cadoli and
T. Mancini},
title = {A Unifying Framework for Structural Properties of {CSP}s: Definitions,
Complexity, Tractability},
journal = {J. Artif. Intell. Res.},
volume = {32},
pages = {607--629},
year = {2008},
}
@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 = ""
}
@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 = {}
}
@article{BorRei2002,
author = {H. Bordihn and
B. Reichel},
title = {On Descriptions of Context-Free Languages by {CD} Grammar Systems},
journal = jalc,
volume = {7},
number = {4},
pages = {447--454},
year = {2002},
}
@article{BorSun2009,
author = {H. Bordihn and
B. Sunckel},
title = {Descriptional Complexity of Restricted {CD} Grammar Systems},
journal = jalc,
year = {2009},
volume = {14},
number = {1},
pages = {7--22},
}
@article{BorDasHol2010,
author = {H. Bordihn and
J. Dassow and
M. Holzer},
title = {Extending regular expressions with homomorphic replacement},
journal = rairoita,
volume = {44},
number = {2},
pages = {229--255},
year = {2010},
}
@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{Bor2004,
author = {H. Bordihn},
title = {Context-freeness of the power of context-free languages is undecidable},
journal = tcs,
year = {2004},
volume = {314},
number = {3},
pages = {445--449},
}
@article{Bor2005,
author = {H. Bordihn},
title = {On the number of components in cooperating distributed grammar systems},
journal = tcs,
year = {2005},
volume = {330},
number = {2},
pages = {195--204},
}
@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}
}
@inproceedings{BorVas2007,
author = {H. Bordihn and
Gy. Vaszil},
editor = {E. Csuhaj{-}Varj{\'{u}} and
Z. {\'{E}}sik},
title = {Top-Down Deterministic Parsing of Languages Generated by {CD} Grammar
Systems},
booktitle = {Fundamentals of Computation Theory, 16th International Symposium,
{FCT}},
series = {LNCS},
volume = {4639},
pages = {113--124},
publisher = {Springer},
year = {2007},
}
@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 = "2008",
}
@article{BorHolKut2011,
author = {H. Bordihn and
M. Holzer and
M. Kutrib},
title = {Decidability of operation problems for {T0L} languages and subclasses},
journal = ic,
volume = {209},
number = {3},
pages = {344--352},
year = {2011},
}
@article{Bor2017,
author = {H. Bordihn},
title = {Active symbols in grammars with valuations},
journal = tcs,
volume = {682},
pages = {42--48},
year = {2017},
}
@article{BorHol2021,
author = {H. Bordihn and
M. Holzer},
title = {On the number of active states in finite automata},
journal = actainform,
volume = {58},
number = {4},
pages = {301--318},
year = {2021},
}
@article{BorPas2010,
title = "Fast reoptimization for the minimum spanning tree problem",
journal = jda,
volume = "8",
number = "3",
pages = "296--310",
year = "2010",
author = "N. Boria and V.~Th. Paschos",
}
@article{BorMonPas2013,
author = {N. Boria and
J. Monnot and
V. Th. Paschos},
title = {Reoptimization under Vertex Insertion: {M}ax {$P_k$}-Free
{S}ubgraph and {M}ax {P}lanar {S}ubgraph},
journal = dmaa,
year = {2013},
volume = {5},
number = {2},
}
@article{BorMonPas2013a,
author = {N. Boria and
J. Monnot and
V.~Th. Paschos},
title = {Reoptimization of maximum weight induced hereditary subgraph problems},
journal = tcs,
year = {2013},
pages = {61--74},
volume = 514
}
@inproceedings{BorCroPas2013,
author = {N. Boria and
F. Della Croce and
V. Th. Paschos},
title = {On the max min vertex cover Problem},
booktitle = {Approximation and Online Algorithms - 11th International Workshop,
{WAOA} 2013},
pages = {37--48},
editor = {C. Kaklamanis and
K. Pruhs},
series = {LNCS},
volume = {8447},
publisher = {Springer},
year = {2014},
}
@article{BorCro2014,
author = {N. Boria and
F. Della Croce},
title = {Reoptimization in machine scheduling},
journal = tcs,
volume = {540},
pages = {13--26},
year = {2014},
}
@article{BorCroPas2015,
title = "On the max min vertex cover problem",
journal = dam,
volume = "196",
pages = "62--71",
year = "2015",
author = "N. Boria and F. Della Croce and V. Th. Paschos"}
@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{BorTovKoe2011,
author = {R.~B. Borie and C. A. Tovey and
S. Koenig},
title = {Algorithms and complexity results for graph-based pursuit evasion},
journal = {Auton. Robots},
year = {2011},
volume = {31},
number = {4},
pages = {317--332},
}
@article{Bor2016,
author = {Borna, K.},
title = {The generalization of rooks problem and quasi-determinant of matrices},
journal = dmaa,
volume = {08},
number = {02},
pages = {1650023},
year = {2016},
}
@ARTICLE{Bor79,
AUTHOR = "O. Borodin",
TITLE = "On acyclic colorings of planar graphs",
JOURNAL = dm,
YEAR = 1979,
month = "",
volume = 25,
number = "",
pages = "211--236",
copy = ""
}
@article{Bor2013,
title = "Colorings of plane graphs: A survey",
journal = dm,
volume = "313",
number = "4",
pages = "517--539",
year = "2013",
note = "",
author = "O.~V. Borodin",
}
@article{BorIbaMak98,
author = {E. Boros and
T. Ibaraki and
K. Makino},
title = {Error-Free and Best-Fit Extensions of Partially Defined {B}oolean Functions},
journal = icneu,
volume = {140},
number = {2},
pages = {254--283},
year = {1998},
}
@article{BorGurHam98,
author = {E. Boros and V. Gurvich and P.~L. Hammer},
title = {Dual subimplicants of positive {B}oolean functions},
journal = {Optimization Methods and Software},
volume = {10},
number = {2},
pages = {147--156},
year = {1998}
}
@inproceedings{BorIbaMak2000,
author = {E. Boros and
T. Ibaraki and
K. Makino},
title = {Fully Consistent Extensions of Partially Defined Boolean Functions
with Missing Bits},
booktitle = {Theoretical Computer Science, Exploring New Frontiers of Theoretical
Informatics, International Conference {IFIP} {TCS} 2000},
pages = {257--272},
year = {2000},
editor = {J. van Leeuwen and
O. Watanabe and
M. Hagiya and
P. D. Mosses and
T. Ito},
series = {LNCS},
volume = {1872},
publisher = {Springer},
}
@article{BorGKM2000,
author = {E. Boros and
V. Gurvich and
L. Khachiyan and
K. Makino},
title = {Dual-Bounded Generating Problems: Partial and Multiple Transversals
of a Hypergraph},
journal = siam,
volume = {30},
number = {6},
pages = {2036--2050},
year = {2000},
}
@inproceedings{BorEGKM2001,
author = {E. Boros and
K.~M. Elbassioni and
V. Gurvich and
L. Khachiyan and
K. Makino},
title = {On Generating All Minimal Integer Solutions for a Monotone System
of Linear Inequalities},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP}},
pages = {92--103},
editor = {F. Orejas and
P.~G. Spirakis and
J. van Leeuwen},
series = {LNCS},
volume = {2076},
publisher = {Springer},
year = {2001},
}
@article{BorEGK2002,
author = {E. Boros and
K. M. Elbassioni and
V. Gurvich and
L. Khachiyan},
title = {Generating dual-bounded hypergraphs},
journal = {Optimization Methods and Software},
volume = {17},
number = {5},
pages = {749--781},
year = {2002},
ydoi = {10.1080/1055678021000060801},
}
@inproceedings{BorGKM2002,
author = {E. Boros and
V. Gurvich and
L. Khachiyan and
K. Makino},
editor = {H. Alt and
A. Ferreira},
title = {On the Complexity of Generating Maximal Frequent and Minimal Infrequent
Sets},
booktitle = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
Science},
series = {LNCS},
volume = {2285},
pages = {133--141},
publisher = {Springer},
year = {2002},
doi = {10.1007/3-540-45841-7\_10},
}
@inproceedings{BorEGK2004,
author = {E. Boros and
K.~M. Elbassioni and
V. Gurvich and
L. Khachiyan},
title = {Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections},
booktitle = {{LATIN} 2004: Theoretical Informatics, 6th Latin American Symposium},
pages = {488--498},
editor = {M. Farach{-}Colton},
series = {LNCS},
volume = {2976},
publisher = {Springer},
year = {2004},
}
@inproceedings{BorElbGur2004,
author = {E. Boros and
K.~M. Elbassioni and
V. Gurvich},
title = {Algorithms for Generating Minimal Blockers of Perfect Matchings in
Bipartite Graphs and Related Problems},
booktitle = {Algorithms - {ESA}},
pages = {122--133},
editor = {S. Albers and
T. Radzik},
series = {LNCS},
volume = {3221},
publisher = {Springer},
year = {2004},
}
@InCollection{BorEGM2009,
author = {E. Boros and
K.~M. Elbassioni and
V. Gurvich and
K. Makino},
title = {Generating Vertices of Polyhedra and
Related Problems of Monotone Generation},
booktitle = {Polyhedral Computation},
pages = {15--33},
publisher = {AMS and Centre de Recherches Mathématiques},
year = {2009},
editor = {D. Avis and D. Bremner and A. Deza},
volume = {48},
series = {CRM Proceedings \& Lecture Notes},
}
@article{BorMicSid97,
AUTHOR = {Borowiecki, M. and Michalak, D. and Sidorowicz, E.},
TITLE = {Generalized domination, independence and irredudance in graphs},
JOURNAL = {Discussiones Mathematicae Graph Theory},
VOLUME = {17},
YEAR = {1997},
NUMBER = {1},
PAGES = {147--153},}
@article{BorMic98,
author = {M. Borowiecki and
D. Michalak},
title = {Generalized independence and domination in graphs},
journal = dm,
volume = {191},
year = {1998},
pages = {51--56},
}
@article{BorDrgSid2014,
author = {M. Borowiecki and
E. Drgas{-}Burchardt and
E. Sidorowicz},
title = {A feedback vertex set of 2-degenerate graphs},
journal = tcs,
volume = {557},
pages = {50--58},
year = {2014},
}
@Article{Bor2018,
author="Borowiecki, P.",
title="Computational aspects of greedy partitioning of graphs",
journal=joco,
year="2018",
month="Feb",
day="01",
volume="35",
number="2",
pages="641--665",
}
@article{BorBCM2021,
author = {A. Borsotti and
L. Breveglieri and
S. Crespi{-}Reghizzi and
A. Morzenti},
title = {A deterministic parsing algorithm for ambiguous regular expressions},
journal = actainform,
volume = {58},
number = {3},
pages = {195--229},
year = {2021},}
@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 = ""
}
@inproceedings{BoseDHS9697,
author = {P. Bose and
A.~M. Dean and
J.~P. Hutchinson and
T.~C. Shermer},
title = {On Rectangle Visibility Graphs},
booktitle = {Graph Drawing, Symposium on Graph Drawing, {GD} '96},
pages = {25--44},
editor = {S.~C. North},
series = {LNCS},
volume = {1190},
publisher = {Springer},
year = {1997},
}
@article{BoseEFHLMRRSWZ98,
author = {P. Bose and
H. Everett and
S.~P. Fekete and
M.~E. Houle and
A. Lubiw and
H. Meijer and
K. Romanik and
G. Rote and
T.~C. Shermer and
S. Whitesides and
C. Zelle},
title = {A Visibility Representation for Graphs in Three Dimensions},
journal = jgaa,
volume = {2},
number = {2},
year = {1998},
}
@article{BosEveWis2003,
author = {P. Bose and
H. Everett and
S.~K. Wismath},
title = {Properties of Arrangement Graphs},
journal = {Int. J. Comput. Geometry Appl.},
volume = {13},
number = {6},
pages = {447--462},
year = {2003},
}
@article{BosHur2009,
author = {P. Bose and
F. Hurtado},
title = {Flips in planar graphs},
journal = {Computational Geometry},
volume = {42},
number = {1},
pages = {60--80},
year = {2009},
}
@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},
}
@inproceedings{BotThoRet2017,
author = {F. Both and
S. Thoma and
A. Rettinger},
title = {Cross-modal Knowledge Transfer: Improving the Word Embedding of Apple
by Looking at Oranges},
booktitle = {Proceedings of the Knowledge Capture Conference, {K-CAP}},
pages = {18:1--18:8},
year = {2017},
editor = {{\'{O}}. Corcho and
K. Janowicz and
G. Rizzo and
I. Tiddi and
D. Garijo},
publisher = {{ACM}},
year = {2017},
}
@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},
}
@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{BouMusTou2007,
author = {A. Bouajjani and
A. Muscholl and
T. Touili},
title = {Permutation rewriting and algorithmic verification},
journal = ic,
volume = {205},
number = {2},
pages = {199--224},
year = {2007},
}
@article{BouBHIMV2011,
author = {A. Bouajjani and
M. Bozga and
P. Habermehl and
R. Iosif and
P. Moro and
T. Vojnar},
title = {Programs with lists are counter automata},
journal = {Formal Methods in System Design},
volume = {38},
number = {2},
pages = {158--192},
year = {2011},
}
@article{BouMa2011,
author = {C. Boucher and
B. Ma},
title = {Closest string with outliers},
journal = {{BMC} Bioinformatics},
volume = {12},
number = {{S-1}},
pages = {S55},
year = {2011},
}
@article{BouLLPW2013,
author = {C. Boucher and
G.~M. Landau and
A. Levy and
D. Pritchard and
O. Weimann},
title = {On approximating string selection problems with outliers},
journal = tcs,
volume = {498},
pages = {107--114},
year = {2013},
}
@article{BouHab87,
author = {V. Bouchitt{\'{e}} and
M. Habib},
title = {{NP}-Completeness Properties About Linear
Extensions},
journal = {Order},
volume = {4},
number = {2},
pages = {143--154},
year = {1987},
}
@article{BouTod2003,
author = {V. Bouchitt{\'{e}} and
I. Todinca},
title = {Approximating the treewidth of {AT}-free graphs},
journal = dam,
volume = {131},
number = {1},
pages = {11--37},
year = {2003},
}
@article{BouKMT2004,
author = {V. Bouchitt{\'{e}} and
D. Kratsch and
H. M{\"{u}}ller and
I. Todinca},
title = {On treewidth approximations},
journal = dam,
volume = {136},
number = {2-3},
pages = {183--196},
year = {2004},
}
@article{BouBliChe2014,
author = {A. Bouchou and
M. Blidia and
M. Chellali},
title = {Relations between the {R}oman $k$-domination and {R}oman domination numbers
in graphs},
journal = dmaa,
year = {2014},
volume = {6},
number = {3}, pages ={}
}
@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{Bou2000,
author = {P. Boullier},
title = {A Cubic Time Extension of Context-Free Grammars},
journal = {Grammars},
volume = {3},
number = {2/3},
pages = {111--131},
year = {2000},
}
@article{Bou2001,
author = {P. Boullier},
title = {From Contextual Grammars to Range Concatenation Grammars},
journal = {Electr. Notes Theor. Comput. Sci.},
volume = {53},
pages = {41--52},
year = {2001},
}
@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{BouCom96,
author = {A. Boudet and
H. Comon},
editor = {H. Kirchner},
title = {Diophantine Equations, {P}resburger Arithmetic and Finite Automata},
booktitle = {Trees in Algebra and Programming - CAAP'96, 21st International Colloquium},
series = {LNCS},
volume = {1059},
pages = {30--43},
publisher = {Springer},
year = {1996},
}
@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{BouEscPas2010,
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 \textsc{max independent set}, \textsc{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{BouCEP2013,
author = {N. Bourgeois and
F. Della Croce and
B. Escoffier and
V. Th. Paschos},
title = {Fast algorithms for min independent dominating set},
journal = dam,
volume = {161},
number = {4-5},
pages = {558--572},
year = {2013},
}
@article{BouCEP2013a,
author = {N. Bourgeois and
F. Della Croce and
B. Escoffier and
V. Th. Paschos},
title = {Algorithms for dominating clique problems},
journal = tcs,
volume = {459},
pages = {77--88},
year = {2013},
}
@article{BouDeaHan99,
author = {C. Boutilier and
T. L. Dean and
S. Hanks},
title = {Decision-Theoretic Planning: Structural Assumptions and Computational
Leverage},
journal = {J. Artif. Intell. Res. {(JAIR)}},
volume = {11},
pages = {1--94},
year = {1999},
}
@article{BovGanSze2016,
author = {S. Bova and
R. Ganian and
S. Szeider},
title = {Quantified conjunctive queries on partially ordered sets},
journal = tcs,
volume = {618},
pages = {72--84},
year = {2016},
}
@article{BovGanSze2016a,
author = {S. Bova and
R. Ganian and
S. Szeider},
title = {Model Checking Existential Logic on Partially Ordered Sets},
journal = {{ACM} Trans. Comput. Log.},
volume = {17},
number = {2},
pages = {10},
year = {2016},
}
@ARTICLE{Bow73,
AUTHOR = "R. Bowen",
TITLE = "Topological entropy for noncompact sets",
JOURNAL = tams,
YEAR = 1973,
month = "",
volume = 184,
number = "",
pages = "125--136",
copy = ""
}
@article{BoyDDG85,
author = {J.~E. Boyce and
D.~P. Dobkin and
R.~L. (Scot) Drysdale III and
L.~J. Guibas},
title = {Finding Extremal Polygons},
journal = siam,
volume = {14},
number = {1},
pages = {134--147},
year = {1985},
}
@article{BoyUra91,
author = {S.~C. Boyd and
H. Ural},
title = {On the Complexity of Generating Optimal Test Sequences},
journal = {{IEEE} Trans. Software Eng.},
volume = {17},
number = {9},
pages = {976--978},
year = {1991},
}
@article{BoyUra91a,
author = {S.~C. Boyd and
H. Ural},
title = {The Synchronization Problem in Protocol Testing and its Complexity},
journal = ipl,
volume = {40},
number = {3},
pages = {131--136},
year = {1991},
}
@incollection{Boz2000,
author = {S. Bozapalidis},
title = {New Syntactical Invariants for Tree Languages},
crossref={RecentTopics2000},
pages = {46--54},
}
@Article{BozCCGR2017,
author = {C. Bozeman and M. Catral and B. Cook and O. Gonz\'alez and C. Reinhart},
title = {On the tree cover number of a graph},
journal = {Involve},
year = {2017},
volume = {10},
number = {5},
OPTpages = {767--779},
}
@article{BozMauPin2015,
author = {L. Bozzelli and
B. Maubert and
S. Pinchinat},
title = {Uniform strategies, rational relations and jumping automata},
journal = ic,
volume = {242},
pages = {80--107},
year = {2015},
}
@article{BozSan2018,
author = {L. Bozzelli and
C. S{\'{a}}nchez},
title = {Visibly Linear Temporal Logic},
journal = {J. Autom. Reasoning},
volume = {60},
number = {2},
pages = {177--220},
year = {2018},
}
@InProceedings{BozMonPer2019,
author = {L. Bozzelli and A. Montanari and A. Peron},
title = {{Interval Temporal Logic for Visibly Pushdown Systems}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {33:1--33:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
year = {2019},
volume = {150},
editor = {A. Chattopadhyay and P. Gastin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
address = {Dagstuhl, Germany},
}
@article{BraGieMol2010,
author = {C. Brabrand and
R. Giegerich and
A. M{\o}ller},
title = {Analyzing ambiguity of context-free grammars},
journal = {Science of Computer Programming},
volume = {75},
number = {3},
pages = {176--191},
year = {2010},
ydoi = {10.1016/j.scico.2009.11.002},
}
@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",
publisher = "Springer",
chapter = "",
pages = "61--70",
address = "",
organization = "",
copy = ""
}
@article{Bra81b,
AUTHOR = "F.~J. Brandenburg",
title = {Unary Multiple Equality Sets: The Languages of Rational Matrices},
journal = icalt,
volume = {50},
number = {3},
pages = {199--227},
year = {1981},
}
@inproceedings{Bra82,
author = {F.{-}J. Brandenburg},
title = {Extended {C}homsky-{S}ch{\"{u}}tzenberger Theorems},
booktitle = {Automata, Languages and Programming, ICALP},
pages = {83--93},
year = {1982},
editor = {M. Nielsen and
E. Meineche Schmidt},
series = {LNCS},
volume = {140},
publisher = {Springer},
}
@article{Bra82a,
author = {F.{-}J. Brandenburg},
title = {A Note on Generalized {P}arikh Equality Sets},
journal = eikalt,
volume = {18},
number = {10/11},
pages = {565--568},
year = {1982},
}
@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 = "F.-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},
}
@article{BraGleHof2013,
author = {F.-J. Brandenburg and
A. Glei\ss{}ner and
A. Hofmeier},
title = {Comparing and Aggregating Partial Orders with {K}endall tau Distances},
journal = dmaa,
year = {2013},
volume = {5},
number = {2},
}
@article{BraGleHof2013a,
author = {F.-J. Brandenburg and
A. Glei\ss{}ner and
A. Hofmeier},
title = {The nearest neighbor {S}pearman footrule distance for bucket, interval,
and partial orders},
journal = joco,
volume = {26},
number = {2},
pages = {310--332},
year = {2013},
}
@article{Bra2014,
author = {F.~J. Brandenburg},
title = {1-Visibility Representations of 1-Planar Graphs},
journal = jgaa,
volume = {18},
number = {3},
pages = {421--438},
year = {2014},
}
@article{BraGle2016,
author = {F.~J. Brandenburg and
A. Glei{\ss}ner},
title = {Ranking chain sum orders},
journal = tcs,
volume = {636},
pages = {66--76},
year = {2016},
}
@article{BraDEKL2016,
author = {F.~J. Brandenburg and
W. Didimo and
W. S. Evans and
P. Kindermann and
G. Liotta and
F. Montecchiani},
title = {Recognizing and drawing {IC}-planar graphs},
journal = tcs,
volume = {636},
pages = {1--16},
year = {2016},
}
@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 = ""
}
@article{BraFlePup2007,
author = {U. Brandes and
D. Fleischer and
T. Puppe},
title = {Dynamic Spectral Layout with an Application to Small Worlds},
journal = jgaa,
volume = {11},
number = {2},
pages = {325--343},
year = {2007},
}
@inproceedings{Bra2020,
author = {U. Brandes},
editor = {H. Fernau},
title = {Central Positions in Social Networks},
booktitle = {Computer Science - Theory and Applications - 15th International Computer
Science Symposium in Russia, {CSR}},
series = {LNCS},
volume = {12159},
pages = {30--45},
publisher = {Springer},
year = {2020},
}
@inproceedings{BraSim2015,
author = {C. Brandl and
H.~U. Simon},
editor = {I. Potapov},
title = {Complexity Analysis: Transformation Monoids of Finite Automata},
booktitle = {Developments in Language Theory - 19th International Conference, {DLT}},
series = {LNCS},
volume = {9168},
pages = {143--154},
publisher = {Springer},
year = {2015},
}
@article{Bra81c,
author = {A. Brandst{\"{a}}dt},
title = {Closure Properties of Certain Families of Formal Languages with Respect
to a Generalization of Cyclic Closure},
journal = rairoita,
volume = {15},
number = {3},
pages = {233--252},
year = {1981}
}
@article{BraKra87,
author = {A. Brandst{\"{a}}dt and
D. Kratsch},
title = {On Domination Problems for Permutation and Other Graphs},
journal = tcs,
year = {1987},
volume = {54},
pages = {181--198},
}
@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 = acmtalg,
volume = {5},
issue = {1},
month = {December},
year = {2008},
pages = {11:1--11:22},
articleno = {11},
numpages = {22},
}
@inproceedings{BraLeiRau2012,
author = {A. Brandst{\"a}dt and
A.Leitert and
D. Rautenbach},
title = {Efficient Dominating and Edge Dominating Sets for Graphs
and Hypergraphs},
year = {2012},
pages = {267--277},
editor = {K.-M. Chao and
T.-s. Hsu and
D.-T. Lee},
booktitle = {Algorithms and Computation --- 23rd International Symposium,
ISAAC},
publisher = {Springer},
series = {LNCS},
volume = {7676},
}
@article{Bra2002,
title = "Triangle-free graphs and forbidden subgraphs ",
journal = dam,
volume = "120",
number = "1-3",
pages = "25--33",
year = "2002",
author = "S. Brandt"
}
@inproceedings{Bra2001a,
author = {J. Branke},
title = {Dynamic Graph Drawing},
booktitle = {Drawing Graphs, Methods and Models},
pages = {228--246},
editor = {M. Kaufmann and
D. Wagner},
series = {LNCS},
volume = {2025},
publisher = {Springer},
year = {2001},
}
@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 = {},
OPTdoi = {},
}
@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{Braetal98a,
author = {L. Brankovic and
M, Miller and
J, Plesn\'{\i}k and
J, F. Ryan and
J, Sir{\'a}n},
title = {Large Graphs with Small Degree and Diameter: A Voltage Assignment Approach},
journal = {Australasian Journal of Combinatorics},
volume = {18},
pages ={65--76},
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 = {},
OPTdoi = {},
}
@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},
note = {Long version see \url{http://dx.doi.org/10.1016/j.tcs.2012.12.003}.}
}
@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},
}
@Article{BraFer2013,
author = {L. Brankovic and
H. Fernau},
title = {A novel parameterised approximation algorithm for
\textsc{minimum vertex cover}},
journal = tcs,
year = {2013},
volume = {511},
pages = {85--108},
}
@Article{BraLMS2014,
author = {L. Brankovic and N. L\'opez and M. Miller and F. Seb\'e},
title = {Triangle randomization for social network data
anonymization},
journal = {Ars Mathematica Contemporanea},
year = {2014},
volume = {7},
pages = {461--477},
}
@article{BraIKMPV2016,
author = {L. Brankovic and
C. S. Iliopoulos and
R. Kundu and
M. Mohamed and
S. P. Pissis and
F. Vayani},
title = {Linear-time superbubble identification algorithm for genome assembly},
journal = tcs,
volume = {609},
pages = {374--383},
year = {2016},
}
@article{BraLSW71,
author = {P. Branquart and
J. Lewi and
M. Sintzoff and
P. Wodon},
title = {The Composition of Semantics in {A}lgol 68},
journal = cacm,
volume = {14},
number = {11},
pages = {697--708},
year = {1971},
}
@article{Bra2000,
author = {P.~V. Brannon},
title = {Medieval {I}reland: Music in Cathedral, Church and Cloister},
journal = {Early Music},
volume = {28},
number = {2},
pages = {193--202},
year = {2000},
}
@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}
}
@inproceedings{BraRMB2011,
author = {F. Brauer and
R. Rieger and
A. Mocan and
W.~M. Barczynski},
title = {Enabling information extraction by inference of regular expressions
from sample entities},
booktitle = {Proceedings of the 20th {ACM} Conference on Information and Knowledge
Management, {CIKM}},
pages = {1285--1294},
year = {2011},
editor = {C. Macdonald and
I. Ounis and
I. Ruthven},
publisher = {{ACM}},
}
@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",
editor ="H.~A. Maurer",
booktitle ="Proceedings of the 6th Colloquium on Automata, Languages and
Programming",
month =jul,
year ="1979",
series ="LNCS",
volume ="71",
publisher ="Springer",
}
@Article{BraVer85,
author = "Braunm{\"u}hl, B von and R. Verbeek",
title = "Input-driven Languages are Recognized in {$\log n$} Space",
journal = "Annals of Discrete Mathematics",
volume = "24",
year = "1985",
pages = "1--20"
}
@article{BraLeSch2015,
author = {C. Brause and
N. C. L{\^{e}} and
I. Schiermeyer},
title = {The Maximum Independent Set Problem in Subclasses of Subcubic Graphs},
journal = dm,
volume = {338},
number = {10},
pages = {1766--1778},
year = {2015},
}
@article{BraKri2017,
title = "On a relation between $k$-path partition and $k$-path vertex cover",
journal = dam,
volume = "223",
number = "",
pages = "28--38",
year = "2017",
author = "C. Brause and R. Krivo\v{s}-Bellu\v{s}",
}
@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},
}
@inproceedings{BraNet2003,
author = {C. Bravo and
J.~J. Neto},
editor = {O. H. Ibarra and
Z. Dang},
title = {Building Context-Sensitive Parsers from {CF} Grammars with Regular
Control Language},
booktitle = {Implementation and Application of Automata, 8th International Conference,
{CIAA}},
series = {LNCS},
volume = {2759},
pages = {306--308},
publisher = {Springer},
year = {2003},
}
@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{Bra91,
author = {A. Brazma},
title = {Inductive synthesis of dot expressions},
booktitle = {Baltic Computer Science},
year = {1991},
pages = {156--212},
editor = {J. Barzdins and
D. Bj{\o}rner},
publisher = {Springer},
series = {LNCS},
volume = {502},
}
@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{BreNicNie2013,
author = {R. Bredereck and
A. Nichterlein and
R. Niedermeier},
title = {Pattern-Guided {$k$}-Anonymity},
booktitle = {Frontiers in Algorithmics {\it and} Algorithmic Aspects
in Information and Management, Third Joint International
Conference, FAW-AAIM},
year = {2013},
pages = {350--361},
editor = {M.~R. Fellows and
X. Tan and
B. Zhu},
publisher = {Springer},
series = {LNCS},
volume = {7924},
}
@Article{BreNicNie2013a,
author = {R. Bredereck and
A. Nichterlein and
R. Niedermeier},
title = {Pattern-Guided {$k$}-Anonymity},
JOURNAL = {Algorithms},
VOLUME = {6},
YEAR = {2013},
NUMBER = {4},
PAGES = {678--701},
}
@inproceedings{BreFHNNT2014,
author = {R. Bredereck and
V. Froese and
S. Hartung and
A. Nichterlein and
R. Niedermeier and
N. Talmon},
title = {The Complexity of Degree Anonymization by Vertex Addition},
booktitle = {Algorithmic Aspects in Information and Management - 10th International
Conference, {AAIM}},
year = {2014},
pages = {44--55},
editor = {Q. Gu and
P. Hell and
B. Yang},
series = {LNCS},
volume = {8546},
publisher = {Springer},
}
@Article{BreCFGNW2014,
author = {R. Bredereck and
J. Chen and
P. Faliszewski and
J. Guo and
R. Niedermeier and
G.~J. Woeginger},
title = {Parameterized Algorithmics for Computational Social Choice:
Nine Research Challenges},
journal = {Tsinghua Science and Technology},
year = {2014},
volume = {19},
number = {4},
pages = {358--373},
}
@article{BreFHNNT2015,
author = {R. Bredereck and
V. Froese and
S. Hartung and
A. Nichterlein and
R. Niedermeier and
N. Talmon},
title = {The complexity of degree anonymization by vertex addition},
journal = tcs,
volume = {607},
pages = {16--34},
year = {2015},
}
@inproceedings{BreFNST2015,
author = {R. Bredereck and
P. Faliszewski and
R. Niedermeier and
P. Skowron and
N. Talmon},
title = {Elections with Few Candidates: Prices, Weights, and Covering Problems},
booktitle = {Algorithmic Decision Theory - 4th International Conference, {ADT}},
pages = {414--431},
editor = {T. Walsh},
series = {LNCS},
volume = {9346},
publisher = {Springer},
year = {2015},
}
@inproceedings{BreFKKN2020,
author = {R. Bredereck and
P. Faliszewski and
A. Kaczmarczyk and
D. Knop and
R. Niedermeier},
title = {Parameterized Algorithms for Finding a Collective Set of Items},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020},
pages = {1838--1845},
publisher = {{AAAI} Press},
year = {2020},
}
@inproceedings{BreKacNie2020,
author = {R. Bredereck and
A. Kaczmarczyk and
R. Niedermeier},
title = {Electing Successive Committees: Complexity and Algorithms},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020},
pages = {1846--1853},
publisher = {{AAAI} Press},
year = {2020},
}
@article{BreHenRal2008,
author = {B. Bre\v{s}ar and and M. Henning and D.~F. Rall},
title = {Rainbow domination in graphs},
journal = {Taiwanese Journal of Mathematics},
volume = {12},
number = {1},
pages = {213--225},
year = {2008},
}
@article{BreKlaRal2010,
author = {B. Bre\v{s}ar and and S. Klav\v{z}ar and D.~F. Rall},
title = {Domination Game and an Imagination Strategy},
journal = siamdm,
volume = {24},
number = {3},
pages = {979--991},
year = {2010},
}
@article{BreKKS2011,
author = {B. Bre{\v{s}}ar and
F. Kardos and
J. Katreni{\v{c}} and
G. Semanisin},
title = {Minimum $k$-path vertex cover},
journal = dam,
volume = {159},
number = {12},
year = {2011},
pages = {1189--1195},
}
@article{BreJKST2013,
title = "On the vertex $k$-path cover",
journal = dam,
volume = "161",
number = "13-14",
pages = "1943--1949",
year = "2013",
author = "B. Bre\v{s}ar and M. Jakovac and J. Katreni\v{c} and G. Semani\v{s}in and A. Taranenko",}
@article{BreDKKR2016,
author = {B. Bre{\v{s}}ar and
P. Dorbec and
S. Klavzar and
G. Ko\v{s}mrlj and
G. Renault},
title = {Complexity of the game domination problem},
journal = tcs,
volume = {648},
pages = {1--7},
year = {2016}
}
@article{Breetal2017,
author = {B. Bre{\v{s}}ar and
Cs.Bujt{\'{a}}s and
T. Gologranc and
S. Klavzar and
G. Kosmrlj and
B. Patk{\'{o}}s and
Zs. Tuza and
M. Vizer},
title = {Grundy dominating sequences and zero forcing sets},
journal = dopt,
volume = {26},
pages = {66--77},
year = {2017},
}
@article{BreBreTse2013,
author = {G. Bresler and
M. Bresler and
D. Tse},
title = {Optimal Assembly for High Throughput Shotgun Sequencing},
journal = {BMC Bioinformatics},
volume = {14 (Suppl 5)},
year = {2013},
number = {S~18}
}
@inproceedings{BrePruHla2016a,
author = {M. Bresler and
D. Pr\r{u}\v{s}a and
V. Hlav{\'{a}}c},
title = {Recognizing Off-Line Flowcharts by Reconstructing Strokes and Using
On-Line Recognition Techniques},
booktitle = {15th International Conference on Frontiers in Handwriting Recognition,
{ICFHR}},
pages = {48--53},
year = {2016},
publisher = {{IEEE} Computer Society},
}
@article{BrePruHla2016,
author = {M. Bresler and
D. Pr\r{u}\v{s}a and
V. Hlav{\'{a}}c},
title = {Online recognition of sketched arrow-connected diagrams},
journal = {International Journal on Document Analysis and Recognition},
volume = {19},
number = {3},
pages = {253--267},
year = {2016},
}
@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)",
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 = "",
}
@article{BreMMN2016,
author = {R.~C. Brewster and
S. McGuinness and
B. Moore and
J. A. Noel},
title = {A dichotomy theorem for circular colouring reconfiguration},
journal = tcs,
volume = {639},
pages = {1--13},
year = {2016},
}
@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{BriLozSta2016,
author = {R. Brignall and
V.~V. Lozin and
J. Stacho},
title = {Bichain graphs: Geometric model and universal graphs},
journal = dam,
volume = {199},
pages = {16--29},
year = {2016},
}
@article{BriHooRoz2006,
author = {R. Brijder and
H.~J. Hoogeboom and
G. Rozenberg},
title = {Reducibility of gene patterns in ciliates using the breakpoint graph},
journal = tcs,
volume = {356},
number = {1-2},
pages = {26--45},
year = {2006},
}
@article{BriHoo2009,
author = {R. Brijder and
H.~J. Hoogeboom},
title = {Perfectly quilted rectangular snake tilings},
journal = tcs,
volume = {410},
number = {16},
pages = {1486--1494},
year = {2009},
}
@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{Bri2014,
author = {R. Brijder},
title = {Output Stability and Semilinear Sets in Chemical Reaction Networks
and Deciders},
booktitle = {{DNA} Computing and Molecular Programming - 20th International Conference,
{DNA} 20},
pages = {100--113},
editor = {S. Murata and
S. Kobayashi},
series = {LNCS},
volume = {8727},
publisher = {Springer},
year = {2014},
}
@InProceedings{Bri93,
author = "E. Brill",
title = "Automatic Grammar Induction and Parsing Free Text: a
Transformation-Based Approach",
booktitle = "Proceedings of the 31$^{~th}$ ACL",
year = "1993",
pages = "259--265",
}
@inproceedings{BriMNBK2005,
author = {V.~E. Brimkov and
A. Maimone and
G. Nordo and
R.~P. Barneva and
R. Klette},
title = {The Number of Gaps in Binary Pictures},
booktitle = {Advances in Visual Computing, First International Symposium, {ISVC}},
pages = {35--42},
year = {2005},
editor = {G. Bebis and
R. D. Boyle and
D. Koracin and
B. Parvin},
series = {LNCS},
volume = {3804},
publisher = {Springer}
}
@article{BriHic2017a,
author = {B. Brimkov and
I.~V. Hicks},
title = {Complexity and computation of connected zero forcing},
journal = dam,
volume = {229},
pages = {31--45},
year = {2017},
}
@techreport{BriFasHic2017,
author = {B. Brimkov and C.~C. Fast and I.~V. Hicks},
title = {Computational Approaches for Zero Forcing and Related Problems},
institution = {Cornell University, ArXiv/CoRR},
number = {1704.02065},
year = {2017},
}
@inproceedings{BriKun2015,
author = {K. Bringmann and
M. K{\"{u}}nnemann},
title = {Quadratic Conditional Lower Bounds for String Problems and Dynamic
Time Warping},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}},
pages = {79--97},
editor = {V. Guruswami},
publisher = {{IEEE} Computer Society},
year = {2015},
}
@inproceedings{BriGSW2016,
author = {K. Bringmann and
F. Grandoni and
B. Saha and
V. Vassilevska Williams},
title = {Truly Sub-cubic Algorithms for Language Edit Distance and {RNA}-Folding
via Fast Bounded-Difference Min-Plus Product},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}},
pages = {375--384},
year = {2016},
editor = {I. Dinur},
publisher = {{IEEE} Computer Society},}
@inproceedings{BriWel2017,
author = {K. Bringmann and
P. Wellnitz},
title = {Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM}},
pages = {12:1--12:14},
year = {2017},
editor = {J. K{\"{a}}rkk{\"{a}}inen and
J. Radoszewski and
W. Rytter},
series = {LIPIcs},
volume = {78},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
}
@inproceedings{BriGroLar2017,
author = {K. Bringmann and
A. Gr{\o}nlund and
K.~G. Larsen},
title = {A Dichotomy for Regular Expression Membership Testing},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}},
pages = {307--318},
year = {2017},
editor = {C. Umans},
publisher = {{IEEE} Computer Society},
}
@inproceedings{BriKun2018,
author = {K. Bringmann and
M. K{\"{u}}nnemann},
title = {Multivariate Fine-Grained Complexity of Longest Common Subsequence},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA}},
pages = {1216--1235},
editor = {A. Czumaj},
publisher = {{SIAM}},
year = {2018},
}
@inproceedings{Bri2019,
author = {K. Bringmann},
editor = {R. Niedermeier and
C. Paul},
title = {Fine-Grained Complexity Theory (Tutorial)},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS}},
series = {LIPIcs},
volume = {126},
pages = {4:1--4:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
}
@InProceedings{BriFisKun2019,
author = {K. Bringmann and N. Fischer and M. K{\"u}nnemann},
title = {A Fine-Grained Analogue of {S}chaefer's Theorem in {P}: Dichotomy of {$\exists^k\,\forall$}-Quantified First-Order Graph Properties},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {31:1--31:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
year = {2019},
volume = {137},
editor = {A. Shpilka},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@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},
}
@inproceedings{BriJan2023,
author = {H. Brinkop and
K. Jansen},
editor = {L. Gasieniec},
title = {Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science},
series = {LNCS},
volume = {13878},
pages = {33--46},
publisher = {Springer},
year = {2023},
}
@ARTICLE{Bri2000a,
AUTHOR = "E. J. Briscoe",
TITLE = "Grammatical Acquisition: inductive bias and coevolution of language and the language acquisition device",
JOURNAL = {Language},
YEAR = 2000,
month = "",
volume = 76,
number = "2",
pages = "245--296",
copy = ""
}
@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},
}
@article{BrlHNR2004,
author = {S. Brlek and
S. Hamel and
M. Nivat and
C. Reutenauer},
title = {On The Palindromic Complexity Of Infinite Words},
journal = ijfcs,
volume = {15},
number = {2},
year = {2004},
pages = {293--306},
}
@article{BrlLabLac2008,
author = {S. Brlek and
G. Labelle and
A. Lacasse},
title = {Shuffle operations on discrete paths},
journal = tcs,
volume = {391},
number = {1-2},
year = {2008},
pages = {75--89},
}
@inproceedings{Brl2011,
author = {S. Brlek},
title = {Interactions between Digital Geometry and Combinatorics
on Words},
booktitle = {Proceedings 8th International Conference Words 2011},
year = {2011},
pages = {1--12},
editor = {P. Ambroz and
S. Holub and
Z. Mas{\'a}kov{\'a}},
series = {EPTCS},
volume = {63},
}
@article{Bro2011,
author = {D. Br\'od},
title = {On the Number of Minimal Dominating Sets
in Some Classes of Trees},
journal = {Int. J. Contemp. Math. Sciences},
volume = {6},
pages = {503--506},
year = {2011},
}
@article{BroMMR2014,
author = {S. Broda and
A. Machiavelo and
N. Moreira and
R. Reis},
title = {A Hitchhiker's Guide to descriptional complexity through analytic
combinatorics},
journal = tcs,
volume = {528},
pages = {85--100},
year = {2014},
}
@inproceedings{BroMMR2015,
author = {S. Broda and
A. Machiavelo and
N. Moreira and
R. Reis},
title = {Partial Derivative Automaton for Regular Expressions with Shuffle},
booktitle = {Descriptional Complexity of Formal Systems {DCFS}},
pages = {21--32},
year = {2015},
editor = {J. Shallit and A. Okhotin},
publisher = {Springer},
series = {LNCS},
volume = "9118",
}
@article{BroMMR2015a,
author = {S. Broda and
A. Machiavelo and
N. Moreira and
R. Reis},
title = {Average Size of Automata Constructions from Regular Expressions},
journal = eatcs,
volume = {116},
year = {2015},
}
@article{BroMMR2018,
author = {S. Broda and
A. Machiavelo and
N. Moreira and
R. Reis},
title = {Automata for regular expressions with shuffle},
journal = ic,
volume = {259},
number = {2},
pages = {162--173},
year = {2018},
}
@article{BroHHM95,
author = {I. Broere and
J.~H. Hattingh and
M.~A. Henning and
A.~A. McRae},
title = {Majority domination in graphs},
journal = dm,
volume = {138},
pages = {125--135},
year = {1995},
}
@article{BroZan2019,
author = {B. Broere and
H. Zantema},
title = {The $k$-Dimensional Cube is $k$-Representable},
journal = jalc,
volume = {24},
number = {1},
pages = {3--12},
year = {2019},
}
@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",
chapter = "",
pages = "760--770",
address = "",
organization = "",
publisher = {Springer},
series = {LNCS},
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 = alg,
volume = {44},
number = {4},
year = {2006},
pages = {343--361},
}
@article{BroGolPat2013,
author = {H. Broersma and
P.~A. Golovach and
V. Patel},
title = {Tight complexity bounds for {FPT} subgraph problems parameterized
by the clique-width},
journal = tcs,
volume = {485},
year = {2013},
pages = {69--84},
}
@article{BroFGKPP2015,
author = {H. Broersma and
J. Fiala and
P.~A. Golovach and
T. Kaiser and
D. Paulusma and
A. Proskurowski},
title = {Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity
of Interval Graphs},
journal = {Journal of Graph Theory},
volume = {79},
number = {4},
pages = {282--299},
year = {2015},
}
@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{BroKer73,
author = {C. Bron and
J. Kerbosch},
title = {Finding All Cliques of an Undirected Graph (Algorithm 457)},
journal = cacm,
volume = {16},
number = {9},
pages = {575--576},
year = {1973},
}
@Article{BroGoo95,
author="Br{\"o}nnimann, H.
and Goodrich, M. T.",
title="Almost optimal set covers in finite {VC}-dimension",
journal="Discrete {\&} Computational Geometry",
year="1995",
month="Dec",
day="01",
volume="14",
number="4",
pages="463--479",
}
@techreport{BroLLMP2020,
author = {C. Brosse and
A. Lagoutte and
V. Limouzy and
A. Mary and
L. Pastor},
title = {Efficient enumeration of maximal split subgraphs and sub-cographs
and related classes},
institution = {Cornel University},
volume = {abs/2007.01031},
year = {2020},
url = {https://arxiv.org/abs/2007.01031},
archivePrefix = {arXiv},
eprint = {2007.01031},
}
@article{BroCEZ2016,
author = {T. Brough and
L. Ciobanu and
M. Elder and
G. Zetzsche},
title = {Permutations of context-free, {ET0L} and indexed languages},
journal = dmtcs,
volume = {17},
number = {3},
pages = {167--178},
year = {2016},
}
@Article{BroPosWoe2008,
author = {Brouwer, A.~E. and Post, G.~F. and Woeginger, G.~J.},
title = {Tight
bounds for break minimization in tournament scheduling},
journal = jctha,
year = {2008},
OPTkey = {},
volume = {115},
number = {6},
pages = {1065--1068},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@Article{BroTuf2014,
author="Brown, J.~I.
and Tufts, J.",
title="On the Roots of Domination Polynomials",
journal="Graphs and Combinatorics",
year="2014",
volume="30",
number="3",
pages="527--547",
}
@Inproceedings{Bro2013,
author="Brown, R.~D.",
editor="Habernal, I. and Matou{\v{s}}ek, V.",
title="Selecting and Weighting N-Grams to Identify 1100 Languages",
bookTitle="Text, Speech, and Dialogue: 16th International Conference, TSD",
year="2013",
publisher="Springer Berlin Heidelberg",
pages="475--483",
series = {LNCS},
volume = {8082}
}
@INPROCEEDINGS{Bro89,
crossref = "Baketal90",
AUTHOR = "M. Broy",
TITLE = "Functional specification of time sensitive
communicating systems",
chapter = "",
pages = "153--179",
copy = ""
}
@Article{BruQia94,
author="Brualdi, R.~A.
and Qiao, L.",
title="Partial {F}errers matrices",
journal="Applied Mathematics -- A Journal of Chinese Universities",
year="1994",
volume="9",
number="3",
pages="279--289",
}
@inproceedings{BruFer2019,
author = {J. Bruchertseifer and
H. Fernau},
title = {Synchronizing series-parallel automata with loops},
booktitle = {Eleventh Workshop on Non-Classical Models of Automata and Applications,
{NCMA}},
pages = {63--78},
year = {2019},
editor = {R. Freund and
M. Holzer and
J.~M. Sempere},
publisher = {{\"{O}}sterreichische Computer Gesellschaft},
}
@inproceedings{BruFer2020,
author = {J. Bruchertseifer and
H. Fernau},
title = {Synchronizing Words and Monoid Factorization: {A} Parameterized Perspective},
booktitle = {Theory and Applications of Models of Computation, 16th International
Conference, {TAMC}},
pages = {352--364},
editor = {J. Chen and
Q. Feng and
J. Xu},
series = {LNCS},
volume = {12337},
publisher = {Springer},
year = {2020},
doi = {10.1007/978-3-030-59267-7},
isbn = {978-3-030-59266-0},
}
@Article{BruFer2021,
author = {J. Bruchertseifer and
H. Fernau},
title="Synchronizing series-parallel deterministic automata with loops and related problems",
journal=rairoita,
year="2021",
volume="55",
number="7",
pages="1--24",
doi = {10.1051/ita/2021005}
}
@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{BruHKN2013,
author = {S. Bruckner and
F. H{\"{u}}ffner and
C. Komusiewicz and
R. Niedermeier},
title = {Evaluation of {ILP}-Based Approaches for Partitioning into Colorful
Components},
booktitle = {Experimental Algorithms, 12th International Symposium, {SEA}},
pages = {176--187},
year = {2013},
editor = {V. Bonifaci and
C. Demetrescu and
A. Marchetti{-}Spaccamela},
series = {LNCS},
volume = {7933},
publisher = {Springer},
}
@article{BruHufKom2015,
author = {S. Bruckner and
F. H{\"{u}}ffner and
C. Komusiewicz},
title = {A graph modification approach for finding core-periphery structures
in protein interaction networks},
journal = {Algorithms Mol. Biol.},
volume = {10},
pages = {16},
year = {2015},
}
@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{BruLac2016,
author = {M.-L. Bruner and M. Lackner},
title = {A Fast Algorithm for Permutation Pattern Matching
Based on Alternating Runs},
journal =alg,
year = {2016},
volume = {75},
pages = {84--117},
}
@Article{BruSte2010,
author = {M. Brusco and D. Steinley},
title = {\emph{K}-Balance Partitioning: An Exact Method With Applications to
Generalized Structural Balance and Other Psychological Contexts},
journal = {Psychological Methods},
year = {2010},
volume = {15}, number = 2,
pages = {145--157},
}
@article{Bru91,
author = {V. Bruy{\`{e}}re},
title = {Maximal Codes With Bounded Deciphering Delay},
journal = tcs,
volume = {84},
number = {1},
pages = {53--76},
year = {1991},
}
@article{Bru98,
author = {V. Bruy{\`{e}}re},
title = {On Maximal Codes with Bounded Synchronization Delay},
journal = tcs,
volume = {204},
number = {1-2},
pages = {11--28},
year = {1998},
}
@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 {BryHMS2011,
author = {Bryant, D. and Horsley, D. and Maenhaut, B. and Smith, B.~R.},
title = {Cycle decompositions of complete multigraphs},
journal = {Journal of Combinatorial Designs},
volume = {19},
number = {1},
pages = {42--69},
year = {2011},
}
@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",
}
@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{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{BrzSim73,
title = "Characterizations of locally testable events",
journal = dm,
volume = "4",
number = "3",
pages = "243--271",
year = "1973",
author = "J.~A. Brzozowski and I. Simon"
}
@article{Brz76,
author = {J.~A. Brzozowski},
title = {Hierarchies of Aperiodic Languages},
journal = rairoita,
volume = {10},
number = {2},
pages = {33--49},
year = {1976},
}
@article{BrzKna78,
author = {J.~A. Brzozowski and
R. Knast},
title = {The Dot-Depth Hierarchy of Star-Free Languages is Infinite},
journal = jcss,
volume = {16},
number = {1},
pages = {37--55},
year = {1978},
}
@article{BrzFic80,
author = {J.~A. Brzozowski and
F.~E. Fich},
title = {Languages of {\sc R}-Trivial Monoids},
journal = jcss,
volume = {20},
number = {1},
pages = {32--49},
year = {1980},
}
@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{BrzKna86,
author = {J.~A. Brzozowski and
R. Knast},
title = {Graph Congruences and Pair Testing},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {20},
number = {2},
pages = {129--147},
year = {1986},
}
@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{BrzShaXu2011,
author = {J.~A. Brzozowski and
J. Shallit and
Z. Xu},
title = {Decision problems for convex languages},
journal = ic,
volume = {209},
number = {3},
pages = {353--367},
year = {2011},
}
@article{BrzTam2013,
author = {J.~A. Brzozowski and
H. Tamm},
title = {Complexity of atoms of Regular Languages},
journal = ijfcs,
volume = {24},
number = {7},
pages = {1009--1028},
year = {2013},
}
@article{BrzSzy2015,
author = {J.~A. Brzozowski and
M. Szykula},
title = {Large Aperiodic Semigroups},
journal = ijfcs,
volume = {26},
number = {7},
pages = {913--932},
year = {2015},
}
@inproceedings{BrzKLS2018,
author = {J. A. Brzozowski and
L. Kari and
B. Li and
M. Szykula},
editor = {C. C{\^{a}}mpeanu},
title = {State Complexity of Overlap Assembly},
booktitle = {Implementation and Application of Automata - 23rd International Conference,
{CIAA}},
series = {LNCS},
volume = {10977},
pages = {109--120},
publisher = {Springer},
year = {2018},
}
@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{BuCRW2009,
author = {Y. Bu and
D. Chen and
A. Raspaud and
W. Wang},
title = {Injective coloring of planar graphs},
journal = dam,
volume = {157},
number = {4},
pages = {663--672},
year = {2009},
}
@PHDTHESIS{Buc2011,
AUTHOR = "A.~W. Buch",
TITLE = "Linguistic Spaces:
Kernel-based models of natural language",
SCHOOL = "Philosophischen Fakult{\"a}t
der Eberhard Karls Universit{\"a}t T{\"u}bingen, Germany",
YEAR = 2011,
month = "",
address = "",
type = "Doktor der Philosophie",
copy = ""
}
@article{BuYuaZha2015,
title = "Computing on binary strings",
journal = tcs,
volume = "562",
pages = "122--128",
year = "2015",
author = "T.-M. Bu and C. Yuan and P. Zhang",
}
@article{BucCNS2016,
author = {N. Buchbinder and
S. Chen and
J. Naor and
O. Shamir},
title = {Unified Algorithms for Online Learning and Competitive Analysis},
journal = {Math. Oper. Res.},
volume = {41},
number = {2},
pages = {612--625},
year = {2016},
}
@article{Buc81,
author = {W. Bucher},
title = {A Note on a Problem in the Theory of Grammatical Complexity},
journal = tcs,
volume = {14},
pages = {337--344},
year = {1981},
}
@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 = ""
}
@article{BucUma2011,
title = "The complexity of Boolean formula minimization",
journal = jcss,
volume = "77",
number = "1",
pages = "142--153",
year = "2011",
author = "D. Buchfuhrer and C. Umans",}
@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}
}
@article{BucJun2005,
author = {C. Buchheim and
M. J{\"{u}}nger},
title = {Linear optimization over permutation groups},
journal = dopt,
volume = {2},
number = {4},
pages = {308--319},
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},
}
@article{BucCamWu2009,
author = {C. Buchheim and
P.~J. Cameron and
T. Wu},
title = {On the subgroup distance problem},
journal = dm,
volume = {309},
number = {4},
pages = {962--968},
year = {2009},
}
@article{BucWieZhe2010,
author = {C. Buchheim and
A. Wiegele and
L. Zheng},
title = {Exact Algorithms for the Quadratic Linear Ordering Problem},
journal = {{INFORMS} J. Comput.},
volume = {22},
number = {1},
pages = {168--177},
year = {2010},
}
@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 = ""
}
@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},
}
@article{BucGPV2008,
author = {A.~L. Buchsbaum and
E.~R. Gansner and
C.~M. Procopiuc and
S. Venkatasubramanian},
title = {Rectangular layouts and contact graphs},
journal = {{ACM} Trans. Algorithms},
volume = {4},
number = {1},
pages = {8:1--8:28},
year = {2008},
}
@INPROCEEDINGS{BucZet2013,
AUTHOR = {Buckheister, P. and Zetzsche, G.},
TITLE = {Semilinearity and Context-Freeness of Languages Accepted by Valence Automata},
YEAR = {2013},
BOOKTITLE = {Proc. of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013)},
EDITOR = {Chatterjee, K. and Sgall, J.},
PUBLISHER = {Springer},
PAGES = {231--242},
VOLUME = {8087},
SERIES = {LNCS},
}
@ARTICLE{Bud87,
AUTHOR = "A. O. Buda",
TITLE = "Multiprocessor automata",
JOURNAL = ipl,
YEAR = 1987,
month = "",
volume = 25,
number = "",
pages = "257--261",
copy = ""
}
@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{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 = ""
}
@inproceedings{BuhPatSpe2021,
author = {H. Buhrman and
S. Patro and
F. Speelman},
editor = {M. Bl{\"{a}}ser and
B. Monmege},
title = {A Framework of Quantum Strong Exponential-Time Hypotheses},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS}},
series = {LIPIcs},
volume = {187},
pages = {19:1--19:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
}
@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 = ""
}
@article{BuiZen2014,
author = {D.~D.~A. Bui and
Q. Zeng{-}Treitler},
title = {Research and applications: Learning regular expressions for clinical
text classification},
journal = {Journal of the American Medical Informatics Association {JAMIA}},
volume = {21},
number = {5},
pages = {850--857},
year = {2014},
}
@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},
}
@article{BuiTV2011,
author = {B.-M. Bui-Xuan and
J.~A. Telle and
M. Vatshelle},
title = {Boolean-width of graphs},
journal = tcs,
volume = {412},
number = {39},
year = {2011},
pages = {5187--5204},
}
@article{BuiSTV2013,
author = {B.-M. Bui-Xuan and
O. Such{\'y} and
J.~A. Telle and
M. Vatshelle},
title = {Feedback vertex set on graphs of low clique-width},
journal = {Eur. J. Comb.},
volume = {34},
number = {3},
year = {2013},
pages = {666--679},
}
@article{BujHenTuz2012,
title = {Transversals and domination in uniform hypergraphs},
journal = {European Journal of Combinatorics},
volume = {33},
number = {1},
pages = {62--71},
year = {2012},
author = {Cs. Bujtás and M.~A. Henning and Zs. Tuza},}
@inproceedings{Bul2017,
author = {A.~A. Bulatov},
editor = {C. Umans},
title = {A Dichotomy Theorem for Nonuniform {CSP}s},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}},
pages = {319--330},
publisher = {{IEEE} Computer Society},
year = {2017},
ydoi = {10.1109/FOCS.2017.37},
}
@article{BulKSS2017,
author = {A.~A. Bulatov and
O. Karpova and
A.~M. Shur and
K. Startsev},
title = {Lower Bounds on Words Separation: Are There Short Identities in Transformation
Semigroups?},
journal = {Electron. J. Comb.},
volume = {24},
number = {3},
pages = {3},
year = {2017},
ydoi = {10.37236/6450},
}
@article{BulFerRus2012,
author = {L. Bulteau and
G. Fertin and
I. Rusu},
title = {Sorting by Transpositions Is Difficult},
journal = siamdm,
volume = {26},
number = {3},
pages = {1148--1180},
year = {2012},
}
@inproceedings{BulFKR2013,
author = {L. Bulteau and
G. Fertin and
C. Komusiewicz and
I. Rusu},
title = {A Fixed-Parameter Algorithm for Minimum Common String Partition with
Few Duplications},
pages = {244--258},
year = {2013},
editor = {A.~E. Darling and
J. Stoye},
booktitle = {Algorithms in Bioinformatics - 13th International Workshop, {WABI}},
series = {LNCS},
volume = {8126},
publisher = {Springer},
}
@inproceedings{BulFerKom2014,
author = {L. Bulteau and
G. Fertin and
C. Komusiewicz},
title = {Reversal Distances for Strings with Few Blocks or Small Alphabets},
booktitle = {Combinatorial Pattern Matching - 25th Annual Symposium, {CPM}},
pages = {50--59},
year = {2014},
editor = {A. S. Kulikov and
S. O. Kuznetsov and
P. A. Pevzner},
series = {LNCS},
volume = {8486},
publisher = {Springer},
}
@article{BulHKN2014,
author = {L. Bulteau and
F. H{\"{u}}ffner and
C. Komusiewicz and
R. Niedermeier},
title = {Multivariate Algorithmics for {NP}-Hard String Problems},
journal = eatcs,
volume = {114},
year = {2014},
url = {http://bulletin.eatcs.org/index.php/beatcs/article/view/310/292},
}
@inproceedings{BulKom2014,
author = {L. Bulteau and
C. Komusiewicz},
title = {Minimum Common String Partition Parameterized by Partition Size Is
Fixed-Parameter Tractable},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA}},
pages = {102--121},
year = {2014},
editor = {C. Chekuri},
publisher = {{SIAM}},
}
@article{BulFHN2016,
author = {L. Bulteau and
V. Froese and
S. Hartung and
R. Niedermeier},
title = {Co-Clustering under the Maximum Norm},
journal = {Algorithms},
volume = {9},
number = {1},
pages = {17},
year = {2016},
}
@inproceedings{BulGKS2019,
author = {L. Bulteau and
N. Gr{\"{u}}ttemeier and
C. Komusiewicz and
M. Sorge},
title = {Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure
with Edge Colors},
editor = {P. Heggernes},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}},
series = {LNCS},
volume = {11485},
pages = {99--111},
publisher = {Springer},
year = {2019}
}
@inproceedings{BulSch2018,
author = {L. Bulteau and
M.~L. Schmid},
title = {Consensus Strings with Small Maximum Distance and Small Distance Sum},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS}},
pages = {1:1--1:15},
year = {2018},
editor = {I. Potapov and
P.~G. Spirakis and
J. Worrell},
series = {LIPIcs},
volume = {117},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
}
@inproceedings{BulFJK2021,
author = {L. Bulteau and
G. Fertin and
G. Jean and
C. Komusiewicz},
title = {Sorting by Multi-cut Rearrangements},
editor = {T. Bures and
R. Dondi and
J. Gamper and
G. Guerrini and
T. Jurdzinski and
C. Pahl and
F. Sikora and
P. W. H. Wong},
booktitle = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM}},
series = {LNCS},
volume = {12607},
pages = {593--607},
publisher = {Springer},
year = {2021},
}
@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/}}
}
@techreport{BumMeePet2020,
author = {B.~M. Bumpus and
K. Meeks and
W. Pettersson},
title = {Directed branch-width: {A} directed analogue of tree-width},
year = {2020},
url = {https://arxiv.org/abs/2009.08903},
archivePrefix = {arXiv},
eprint = {2009.08903},
institution = {Cornell University}
}
@article{BunFanWei2003,
AUTHOR = "P. Buneman and W. Fan and S. Weinstein",
title = {Interaction between path and type constraints},
journal = {ACM Transactions on Computational Logic},
volume = {4},
number = {4},
year = {2003},
pages = {530--577}, copy ={from the authors}
}
@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 = ""
}
@INPROCEEDINGS{Bur94a,
AUTHOR = "A. Burago",
TITLE = "Learning structurally reversible context-free grammars from queries and counterexamples in polynomial time",
BOOKTITLE = "Proceedings of the Seventh Annual ACM Conference on Computational
Learning Theory, COLT 1994",
YEAR = 1994,
editor = {M.~K. Warmuth},
publisher = {ACM},
pages = "140--146",
address = "",
organization = "",
copy = ""
}
@article{BurCFL2012,
author = {P. Burcsi and
F. Cicalese and
G. Fici and
Z. Lipt{\'{a}}k},
title = {Algorithms for Jumbled Pattern Matching in Strings},
journal = ijfcs,
volume = {23},
number = {2},
pages = {357--374},
year = {2012},
}
@article{BurDavImp2011,
author = {J. Buresh{-}Oppenheim and
S. Davis and
R. Impagliazzo},
title = {A Stronger Model of Dynamic Programming Algorithms},
journal = alg,
volume = {60},
number = {4},
pages = {938--968},
year = {2011},
}
@article{BurDHSY2013,
author = {D. Burgarth and
D. D'Alessandro and
L. Hogben and
S. Severini and
M. Young},
title = {Zero Forcing, Linear and Quantum Controllability for Systems Evolving
on Networks},
journal = {{IEEE} Trans. Automat. Contr.},
volume = {58},
number = {9},
pages = {2349--2354},
year = {2013},
}
@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{BurHenVuu2009,
author = {A.~P. Burger and
M.~A. Henning and
J.~H. van Vuuren},
title = {On the ratios between packing and domination parameters of a graph},
journal = dm,
volume = {309},
number = {8},
pages = {2473--2478},
year = {2009},
}
@article{BurVilVuu2014,
author = {A.~P. Burger and
A.~P. de Villiers and
J.~H. van Vuuren},
title = {A linear algorithm for secure domination in trees},
journal = dam,
volume = {171},
pages = {15--27},
year = {2014},
}
@article{BurCCDFJP2020,
title = {Cops that surround a robber},
journal = dam,
volume = {285},
pages = {552--566},
year = {2020},
author = {A.~C. Burgess and R.~A. Cameron and N.~E. Clarke and P. Danziger and S. Finbow and C.~W. Jones and D.~A. Pike},
}
@article{BurCamIri2017,
author = {J.~F. Burgos and
F.~J.~H. Campe\~na and
A.~N.~V. Iriberri},
title = {A Sum Labelling for Some Families of Unicyclic Graphs},
journal = {Manila Journal of Science},
volume = {10},
pages = {16--24},
year = {2017},
}
@article{BurRusSug2008,
author = {H. Burhan and R. Rusin and K.~A. Sugeng},
title = {Optimum sum labeling of finite union of sum graphs},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
volume = {65},
pages = {133--138},
year = {2008},
}
@inproceedings{BurFHKW2019,
author = {E. Burjons and
F. Frei and
E. Hemaspaandra and
D. Komm and
D. Wehner},
editor = {P. Rossmanith and
P. Heggernes and
J.{-}P. Katoen},
title = {Finding Optimal Solutions With Neighborly Help},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS}},
series = {LIPIcs},
volume = {138},
pages = {78:1--78:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
}
@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",
}
@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 = ""
}
@inproceedings{Bur2000,
author = {M. Buro},
editor = {T. A. Marsland and
I. Frank},
title = {Simple {A}mazons Endgames and Their Connection to {H}amilton Circuits
in Cubic Subgrid Graphs},
booktitle = {Computers and Games, Second International Conference, {CG}},
series = {LNCS},
volume = {2063},
pages = {250--261},
publisher = {Springer},
year = {2000},
}
@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 = ""
}
@inproceedings{BurLPS2013,
author = {Burton, B.~A. and Lewiner, T. and Paix\~{a}o, J. and Spreer, J.},
title = {Parameterized Complexity of Discrete {M}orse Theory},
booktitle = {Proceedings of the Twenty-ninth Annual Symposium on Computational Geometry, SoCG},
year = {2013},
pages = {127--136},
publisher = {ACM},
}
@article{BurBonDur2006,
title = "{NP}-completeness results for edge modification problems ",
journal = dam,
volume = "154",
number = "13",
pages = "1824--1844",
year = "2006",
author = "P. Burzyn and F. Bonomo and G. Dur\'an",
}
@article{BusMusRay2018,
author = {N. Bus and
N. H. Mustafa and
S. Ray},
title = {Practical and efficient algorithms for the geometric hitting set problem},
journal = dam,
volume = {240},
pages = {25--32},
year = {2018},
}
@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{ButTru2007,
author = {S. Butenko and
S. Trukhanov},
title = {Using critical sets to solve the maximum independent set problem},
journal = {Oper. Res. Lett.},
volume = {35},
number = {4},
pages = {519--524},
year = {2007},}
@ARTICLE{But74,
AUTHOR = "J. Butler",
TITLE = "A note on cellular automata simulations",
JOURNAL = icalt,
YEAR = 1974,
VOLUME = 26,
NUMBER = "",
PAGES = "286--295",
copy = ""
}
@article{But2005,
title = "Minimax 16-run supersaturated designs",
journal = "Statistics \& Probability Letters",
volume = "73",
number = "2",
pages = "139--145",
year = "2005",
author = "N.~A. Butler",
}
@article{But68,
author = {A.~R. Butz},
title = {Space Filling Curves and Mathematical Programming},
journal = icalt,
volume = {12},
number = {4},
pages = {314--330},
year = {1968},
}
@article{But69,
author = {A.~R. Butz},
title = {Convergence with {H}ilbert's Space Filling Curve},
journal = jcss,
volume = {3},
number = {2},
pages = {128--146},
year = {1969},
}
@article{But81,
author = {A.~R. Butz},
title = {Functions Realized by Consistent Sequential Machines},
journal = icalt,
volume = {48},
number = {2},
pages = {147--191},
year = {1981},
}
@article{But90,
author = {A.~R. Butz},
title = {Regular sets and rank order processors},
journal = {{IEEE} Trans. Acoustics, Speech, and Signal Processing},
volume = {38},
number = {2},
pages = {241--246},
year = {1990},
}
@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},
}
@article{ByrGuiJan2010,
author = {J. Byrka and
S. Guillemot and
J. Jansson},
title = {New results on optimizing rooted triplets consistency},
journal = dam,
volume = {158},
number = {11},
pages = {1136--1147},
year = {2010}
}
@article{BysMadSkj2005,
author = {J. Makholm Byskov and
B.~A. Madsen and
B. Skjernaa},
title = {New algorithms for Exact Satisfiability},
journal = tcs,
volume = {332},
number = {1-3},
pages = {515--541},
year = {2005},
}
@inproceedings{ByuKBL2007,
author = {Ji{-}W. Byun and
A. Kamra and
E. Bertino and
N. Li},
title = {Efficient $k$-Anonymization Using Clustering Techniques},
booktitle = {Advances in Databases: Concepts, Systems and Applications, {DASFAA}},
pages = {188--200},
editor = {K. Ramamohanarao and
P. R. Krishna and
M. K. Mohania and
E. Nantajeewarawat},
series = {LNCS},
volume = {4443},
publisher = {Springer},
year = {2007},
}
CCCC
@article{CabGiaKna2008,
author = {S. Cabello and
P. Giannopoulos and
C. Knauer},
title = {On the parameterized complexity of $d$-dimensional point set pattern
matching},
journal = ipl,
year = {2008},
volume = {105},
number = {2},
pages = {73--77},
}
@article{CabKna2009,
author = {S. Cabello and
C. Knauer},
title = {Algorithms for graphs of bounded treewidth via orthogonal range searching},
journal = {Comput. Geom.},
volume = {42},
number = {9},
pages = {815--824},
year = {2009},
}
@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 = acmtalg,
volume = {7},
issue = {4},
month = sep,
year = {2011},
pages = {43:1--43:27},
articleno = {43},
numpages = {27},
publisher = {ACM Press},
}
@article{CabChiHli2014,
author = {S. Cabello and
M. Chimani and
P. Hlinen{\'{y}}},
title = {Computing the Stretch of an Embedded Graph},
journal = siamdm,
volume = {28},
number = {3},
pages = {1391--1401},
year = {2014},
ydoi = {10.1137/130945636},
}
@article{CabPueRod2021,
author = {Cabrera Martínez, A. and Puertas, M.L. and Rodríguez-Velázquez, J.A.},
title = {On the 2-Packing Differential of a Graph},
journal = {Results in Mathematics},
volume = {76},
year = {2021},
pages = {175:1--175:24},
articleno = {175},
numpages = {24},
ydoi = {10.1007/s00025-021-01473-8}
}
@article{CabRod2022,
author = {Cabrera Martínez, A. and Rodríguez-Velázquez, J.A.},
title = {On the perfect Differential of a Graph},
journal = {Quaestiones Mathematicae},
volume = {45},
number = {3},
pages = {327--345},
year = {2022},
ydoi = {10.2989/16073606.2020.1858992},
}
@article{CacHMPPSW2007,
author = {J. C{\'{a}}ceres and
M.~C. Hernando and
M. Mora and
I.~M. Pelayo and
M.~L. Puertas and
C. Seara and
D.~R. Wood},
title = {On the Metric Dimension of {C}artesian Products of Graphs},
journal = siamdm,
volume = {21},
number = {2},
pages = {423--441},
year = {2007},
}
@article{CacGGMLR2018,
title = {Shortcut sets for the locus of plane {E}uclidean networks},
journal = {Applied Mathematics and Computation},
volume = {334},
pages = {192--205},
year = {2018},
ydoi = {https://doi.org/10.1016/j.amc.2018.04.010},
author = {J. Cáceres and D. Garijo and A. González and A. Márquez and M. Luz Puertas and P. Ribeiro},
}
@article{CadFinMcK2012,
author = {M. Cadilhac and
A. Finkel and
P. McKenzie},
title = {Bounded {P}arikh Automata},
journal = ijfcs,
volume = {23},
number = {8},
pages = {1691--1710},
year = {2012},
}
@article{CadFinMcK2013,
author = {M. Cadilhac and
A. Finkel and
P. McKenzie},
title = {Unambiguous constrained Automata},
journal = ijfcs,
volume = {24},
number = {7},
pages = {1099--1116},
year = {2013}
}
@inproceedings{CadKreMcK2013,
author = {M. Cadilhac and
A. Krebs and
P. McKenzie},
title = {The Algebraic Theory of {P}arikh Automata},
booktitle = {Algebraic Informatics - 5th International Conference, {CAI}},
pages = {60--73},
year = {2013},
editor = {T. Muntean and
D. Poulakis and
R. Rolland},
series = {LNCS},
volume = {8080},
publisher = {Springer},
}
@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{CadSch2006,
author = {M. Cadoli and
M. Schaerf},
title = {Partial Solutions with Unique Completion},
booktitle = {Reasoning, Action and Interaction in {AI} Theories and Systems, Essays
Dedicated to {L}uigia {C}arlucci {A}iello},
pages = {101--115},
year = {2006},
editor = {O. Stock and
M. Schaerf},
series = {LNCS},
volume = {4155},
publisher = {Springer},
}
@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 = ""
}
@article{CaiMey87,
author = {J.{-}y. Cai and
G.~E. Meyer},
title = {Graph Minimal Uncolorability is {$D^P$}-Complete},
journal = siam,
volume = {16},
number = {2},
pages = {259--277},
year = {1987},
}
@article{CaiFurImm92,
author = {J.{-}yi Cai and
M. F{\"{u}}rer and
N. Immerman},
title = {An optimal lower bound on the number of variables for graph identification},
journal = {Combinatorica},
volume = {12},
number = {4},
pages = {389--410},
year = {1992},
}
@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{Cai94,
author = {L. Cai},
title = {{NP}-Completeness of Minimum Spanner Problems},
journal = dam,
volume = {48},
number = {2},
pages = {187--194},
year = {1994},
ydoi = {10.1016/0166-218X(94)90073-6},
timestamp = {Thu, 11 Feb 2021 23:24:23 +0100},
biburl = {https://dblp.org/rec/journals/dam/Cai94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{CaiCor95,
author = {L. Cai and
D. G. Corneil},
title = {Tree Spanners},
journal = siamdm,
volume = {8},
number = {3},
pages = {359--387},
year = {1995},
ydoi = {10.1137/S0895480192237403},
}
@article{Cai97a,
author = {L. Cai},
title = {On Spanning 2-trees in a Graph},
journal = dam,
volume = {74},
number = {3},
pages = {203--216},
year = {1997},
ydoi = {10.1016/S0166-218X(96)00045-5},
}
@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{Cai97,
title = "On spanning 2-trees in a graph",
journal = dam,
volume = "74",
number = "3",
pages = "203--216",
year = "1997",
author = "L. Cai",
}
@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{Caietal97a,
author ="L. Cai and J. Chen and R. Downey and M. Fellows",
title = "On the parameterized complexity
of short computation and factorization",
journal= "Archive for Mathematical Logic",
pages ={321--337},
volume= "36",
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 = ""
}
@inproceedings{CaiMalWu2003,
author = {L. Cai and
R.~L. Malmberg and
Y. Wu},
title = {Stochastic modeling of {RNA} pseudoknotted structures: a grammatical
approach},
booktitle = {Proceedings of the Eleventh International Conference on Intelligent
Systems for Molecular Biology},
pages = {66--73},
year = {2003},
}
@article{CaiCHO2005,
title = "Competing provers yield improved {K}arp-{L}ipton collapse results",
journal = ic,
volume = "198",
number = "1",
pages = "1--23",
year = "2005",
author = "J.-Y. Cai and V.~T. Chakaravarthy and L.~A. Hemaspaandra and M. Ogihara",
}
@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{CaiHLRS2008,
author = {L. Cai and
X. Huang and
C. Liu and
F. A. Rosamond and
Y. Song},
title = {Parameterized Complexity and Biopolymer Sequence Comparison},
journal = {The Computer Journal},
volume = {51},
number = {3},
year = {2008},
pages = {270--291},
}
@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{CaiVerYan2008,
author = {L. Cai and
E. Verbin and
L. Yang},
title = {Firefighting on Trees: $(1-1/e)$-Approximation, Fixed Parameter
Tractability and a Subexponential Algorithm},
booktitle = {Algorithms and Computation, 19th International Symposium, ISAAC},
year = {2008},
pages = {258--269},
editor = {S.-H. Hong and
H. Nagamochi and
T. Fukunaga},
publisher = {Springer},
series = {LNCS},
volume = {5369},
}
@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 = ""
}
@inproceedings{CaiChaCha2006,
author = {L. Cai and
S.~M. Chan and
S.~O. Chan},
title = {Random Separation: {A} New Method for Solving Fixed-Cardinality Optimization
Problems},
booktitle = {Parameterized and Exact Computation, Second International Workshop,
{IWPEC}},
pages = {239--250},
year = {2006},
editor = {H.~L. Bodlaender and
M.~A. Langston},
series = {LNCS},
volume = {4169},
publisher = {Springer},
}
@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{CaiCVZ2010,
author = {L. Cai and
Y. Cheng and
E. Verbin and
Y. Zhou},
title = {Surviving Rates of Graphs with Bounded Treewidth for the
Firefighter Problem},
journal = siamdm,
volume = {24},
number = {4},
year = {2010},
pages = {1322--1335},
}
@article{CaiYan2011,
author = {L. Cai and
B. Yang},
title = {Parameterized complexity of even/odd subgraph problems},
journal = jda,
volume = {9},
number = {3},
year = {2011},
pages = {231--240},
}
@inproceedings{CaiYe2014,
author = {L. Cai and
J. Ye},
title = {Parameterized Complexity of Connected Induced Subgraph Problems},
booktitle = {Algorithmic Aspects in Information and Management - 10th International
Conference, {AAIM}},
year = {2014},
pages = {219--230},
editor = {Q. Gu and
P. Hell and
B. Yang},
series = {LNCS},
volume = {8546},
publisher = {Springer},
}
@inproceedings{CaiYe2014a,
author = {L. Cai and
J. Ye},
title = {Dual Connectedness of Edge-Bicolored Graphs and Beyond},
booktitle = {Mathematical Foundations of Computer Science, {MFCS},
Part {II}},
pages = {141--152},
year = {2014},
editor = {E. Csuhaj{-}Varj{\'{u}} and
M. Dietzfelbinger and
Z. {\'{E}}sik},
series = {LNCS},
volume = {8635},
publisher = {Springer},
}
@article{CaiYe2015,
author = {L. Cai and
J. Ye},
title = {Parameterized complexity of finding connected induced subgraphs},
journal = tcs,
volume = {607},
pages = {49--59},
year = {2015},
}
@article{CaiDenZan2000,
author = {M.{-}c. Cai and
X. Deng and
W. Zang},
title = {An Approximation Algorithm for Feedback Vertex Sets in Tournaments},
journal = siam,
volume = {30},
number = {6},
pages = {1993--2007},
year = {2000}
}
@article{CaiLinLuo2017,
author = {S. Cai and
J. Lin and
C. Luo},
title = {Finding a Small Vertex Cover in Massive Sparse Graphs: Construct,
Local Search, and Preprocess},
journal = {J. Artif. Intell. Res.},
volume = {59},
pages = {463--494},
year = {2017},
}
@inproceedings{CaiMiaLi2019,
author = {Z. Cai and
D. Miao and
Y. Li},
title = {Deletion Propagation for Multiple Key Preserving Conjunctive Queries:
Approximations and Complexity},
booktitle = {International Conference on Data Engineering, {ICDE}},
pages = {506--517},
publisher = {{IEEE}},
year = {2019}
}
@article{CarHan2017,
author = {Y. Caro and A. Hansberg},
title = {Partial Domination -- the Isolation Number of a Graph},
journal = {Filomat},
volume = {31},
pages = {3925--3944},
year = {2017},
}
@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}
}
@article{Caketal2009,
author = {O.~A. \c{C}akiroglu and
C. Erten and
{\"O}. Karatas and
M. S{\"o}zdinler},
title = {Crossing minimization in weighted bipartite graphs},
journal = jda,
volume = {7},
number = {4},
pages = {439--452},
year = {2009},
}
@inproceedings{CalImpPat2006,
author = {C. Calabro and
R. Impagliazzo and
R. Paturi},
title = {A Duality between Clause Width and Clause Density for {SAT}},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC})},
pages = {252--260},
year = {2006},
}
@article{CalIKP2008,
author = {C. Calabro and
R. Impagliazzo and
V. Kabanets and
R. Paturi},
title = {The complexity of {U}nique $k$-{SAT}: An Isolation Lemma for $k$-{CNF}s},
journal = jcss,
volume = {74},
number = {3},
pages = {386--393},
year = {2008},
}
@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},
}
@article{CalImpPat2013,
author = {C. Calabro and
R. Impagliazzo and
R. Paturi},
title = {On the Exact Complexity of Evaluating Quantified $k$-{CNF}},
journal = alg,
volume = {65},
number = {4},
pages = {817--827},
year = {2013},
}
@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{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{CalDes2015,
author = {C.~S. Calude and
D. Desfontaines},
title = {Anytime Algorithms for Non-Ending Computations},
journal = ijfcs,
volume = {26},
number = {4},
pages = {465--476},
year = {2015},
}
@article{CalStaSte2016,
author = {C.~S. Calude and
L. Staiger and
F. Stephan},
title = {Finite state incompressible infinite sequences},
journal = ic,
volume = {247},
pages = {23--36},
year = {2016},
}
@article{CalDinHua2017,
author = {C.~S. Calude and
M.~J. Dinneen and
R. Hua},
title = {{QUBO} formulations for the graph isomorphism problem and related
problems},
journal = tcs,
volume = {701},
pages = {54--69},
year = {2017},
}
@article{CalDinHua2020,
author = {C.~S. Calude and
M.~J. Dinneen and
R. Hua},
title = {Quantum solutions for densest $k$-subgraph problems},
journal = {J. Membr. Comput.},
volume = {2},
number = {1},
pages = {26--41},
year = {2020},
}
@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{CamSchTuz2010,
author = {S.~M. Camacho and
I. Schiermeyer and
Z. Tuza},
title = {Approximation algorithms for the minimum rainbow subgraph problem},
journal = dm,
volume = {310},
number = {20},
pages = {2666--2670},
year = {2010},
}
@inproceedings{CamBonDon2021,
author = {S. Cambie and
M. de Bondt and
H. Don},
editor = {N. Moreira and
R. Reis},
title = {Extremal Binary {PFA}s in a {\v{C}}ern{\'{y}} Family},
booktitle = {Developments in Language Theory - 25th International Conference, {DLT}},
series = {LNCS},
volume = {12811},
pages = {78--89},
publisher = {Springer},
year = {2021},
}
@article{CamSch2014,
author = {E. Camby and
O. Schaudt},
title = {The price of connectivity for dominating set: Upper bounds and complexity},
journal =dam,
volume = {177},
pages = {53--59},
year = {2014}
}
@article{CamCFS2014,
author = {E. Camby and
J. Cardinal and
S. Fiorini and
O. Schaudt},
title = {The Price of Connectivity for Vertex Cover},
journal = dmtcs,
volume = {16},
number = {1},
pages = {207--224},
year = {2014}
}
@PHDTHESIS{Cam2015a,
author = {Camby, E.},
TITLE = "Connecting hitting sets and hitting paths
in graphs",
SCHOOL = "UNIVERSITÃ‰ LIBRE DE BRUXELLES,
FacultÃ© des Sciences
DÃ©partement de MathÃ©matique",
YEAR = 2015,
month = jun,
address = "",
type = "",
copy = ""
}
@techreport{Cam2018,
author = {Camby, E.},
month = feb,
year = 2018,
title = {Algorithms
and computational complexity on the {$P_k$}-hitting set problem}
,
institution = {GERAD, HEC MontrÃ©al,
Canada},
number = {Les Cahiers du GERAD G-2018-08}
}
@article{Cam2019,
author = {E. Camby},
title = {Price of Connectivity for the Vertex Cover Problem and the Dominating
Set Problem: Conjectures and Investigation of Critical Graphs},
journal = {Graphs and Combinatorics},
volume = {35},
number = {1},
pages = {103--118},
year = {2019}
}
@inproceedings{CamHab74,
author = {R.~H. Campbell and
A.~N. Habermann},
title = {The specification of process synchronization by path expressions},
booktitle = {Operating Systems OS},
pages = {89--102},
editor = {E. Gelenbe and
C. Kaiser},
series = {LNCS},
volume = {16},
publisher = {Springer},
year = {1974},
}
@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{Cam78,
title = "The min-max spanning tree problem and some extensions",
journal = ipl,
volume = "7",
number = "1",
pages = "10--14",
year = "1978",
author = "P.~M. Camerini",
}
@article{CamGalMaf80,
title = "Complexity of spanning tree problems: Part {I}",
journal = "European Journal of Operational Research",
volume = "5",
number = "5",
pages = "346--352",
year = "1980",
author = "P.~M. Camerini and G. Galbiati and F. Maffioli",
}
@article{Cam89,
author = {K. Cameron},
title = {Induced matchings},
journal = dam,
volume = {24},
number = {1-3},
pages = {97--102},
year = {1989},
}
@article{CamSriTan2003,
author = {K. Cameron and
R. Sritharan and
Y. Tang},
title = {Finding a maximum induced matching in weakly chordal graphs},
journal = dm,
volume = {266},
number = {1-3},
pages = {133--142},
year = {2003},
}
@article{Cam2004,
author = {K. Cameron},
title = {Induced matchings in intersection graphs},
journal = dm,
volume = {278},
number = {1-3},
pages = {1--9},
year = {2004},
}
@article{CamWu2010,
title = "The complexity of the weight problem for permutation and matrix groups",
journal = dm,
volume = "310",
number = "3",
pages = "408--416",
year = "2010",
author = "P.~J. Cameron and T. Wu",
}
@Article{CamCGM2017,
author="Cameron, P. J.
and Castillo-Ramirez, A.
and Gadouleau, M.
and Mitchell, J. D.",
title="Lengths of words in transformation semigroups generated by digraphs",
journal="Journal of Algebraic Combinatorics",
year="2017",
volume="45",
number="1",
pages="149--170",
}
@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{CamRRT2001,
author = {C.~M. Campbell and
E.~F. Robertson and
N. Ru\v{s}kuc and
R.~M. Thomas},
title = {Automatic semigroups},
journal = tcs,
volume = {250},
number = {1-2},
pages = {365--391},
year = {2001},
}
@article{CamSanYu2001,
author = {C. C{\^{a}}mpeanu and
N. Santean and
S. Yu},
title = {Minimal cover-automata for finite languages},
journal = tcs,
volume = {267},
number = {1-2},
pages = {3--16},
year = {2001},
}
@article{CamSalYu2003,
author = {C\^ampeanu, C. and Salomaa, K. and Yu, S.},
title = {A Formal Study Of Practical Regular Expressions},
journal = ijfcs,
volume = {14},
number = {06},
pages = {1007--1018},
year = {2003},
}
@article{CamPauSmi2006,
author = {C. C{\^{a}}mpeanu and
A. Paun and
J. R. Smith},
title = {Incremental construction of minimal deterministic finite cover automata},
journal = tcs,
volume = {363},
number = {2},
pages = {135--148},
year = {2006},
}
@article{CamSan2009,
author = {C. C{\^{a}}mpeanu and
N. Santean},
title = {On the closure of pattern expressions languages under intersection
with regular languages},
journal = actainform,
volume = {46},
number = {3},
pages = {193--207},
year = {2009},
}
@article{CamSan2009a,
author = {C. C{\^{a}}mpeanu and
N. Santean},
title = {On the intersection of regex languages with regular languages},
journal = tcs,
volume = {410},
number = {24-25},
pages = {2336--2344},
year = {2009},
}
@inproceedings{CamMorRei2014,
author = {C. C{\^{a}}mpeanu and
N. Moreira and
R. Reis},
title = {The distinguishability operation on regular languages},
booktitle = {Sixth Workshop on Non-Classical Models for Automata and Applications
- {NCMA}},
pages = {85--100},
year = {2014},
editor = {S. Bensch and
R. Freund and
F. Otto},
series = {books@ocg.at},
volume = {304},
publisher = {{\"{O}}sterreichische Computer Gesellschaft},
}
@inproceedings{CamSal2015,
author = {C. C{\^{a}}mpeanu and
K. Salomaa},
title = {Nondeterministic Tree Width of Regular Languages},
booktitle = {Descriptional Complexity of Formal Systems - 17th International Workshop,
{DCFS}},
pages = {46--57},
year = {2015},
editor = {J. Shallit and
A. Okhotin},
series = {LNCS},
volume = {9118},
publisher = {Springer},
}
@article{Cam2015,
author = {C. C{\^{a}}mpeanu},
title = {Non-Deterministic Finite Cover Automata},
journal = {Scientific Annals of Computer Science},
volume = {25},
number = {1},
pages = {3--28},
year = {2015},
}
@article{Cam2018a,
author = {C. C{\^a}mpeanu},
title = {What is a Complex Regular Language?},
journal = jalc,
volume = {23},
number = {1--3},
pages = {111--126},
year = {2018},
}
@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{Can88,
author = {J.~F. Canny},
title = {Constructing Roadmaps of Semi-Algebraic Sets {I}: Completeness},
journal = {Artif. Intell.},
volume = {37},
number = {1-3},
year = {1988},
pages = {203--222},
}
@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{Can1879,
AUTHOR = "G. Cantor",
TITLE = "Ueber unendliche, lineare {P}unktmannichfaltigkeiten. {N}r. 1",
JOURNAL = ma,
YEAR = 1879,
month = "",
volume = 15,
number = "",
pages = "1--7",
copy = ""
}
@ARTICLE{Can1880,
AUTHOR = "G. Cantor",
TITLE = "Ueber unendliche, lineare {P}unktmannichfaltigkeiten. {N}r. 2",
JOURNAL = ma,
YEAR = 1880,
month = "",
volume = 17,
number = "",
pages = "355--358",
copy = ""
}
@ARTICLE{Can1882,
AUTHOR = "G. Cantor",
TITLE = "Ueber unendliche, lineare {P}unktmannichfaltigkeiten. {N}r. 3",
JOURNAL = ma,
YEAR = 1882,
month = "",
volume = 20,
number = "",
pages = "113--121",
copy = ""
}
@ARTICLE{Can1883,
AUTHOR = "G. Cantor",
TITLE = "Ueber unendliche, lineare {P}unktmannichfaltigkeiten. {N}r. 4",
JOURNAL = ma,
YEAR = 1883,
month = "",
volume = 21,
number = "",
pages = "51--58",
copy = ""
}
@ARTICLE{Can1883a,
AUTHOR = "G. Cantor",
TITLE = "Ueber unendliche, lineare {P}unktmannichfaltigkeiten. {N}r. 5",
JOURNAL = ma,
YEAR = 1883,
month = "",
volume = 21,
number = "",
pages = "545--591",
copy = ""
}
@ARTICLE{Can1884,
AUTHOR = "G. Cantor",
TITLE = "Ueber unendliche, lineare {P}unktmannichfaltigkeiten. {N}r. 6",
JOURNAL = ma,
YEAR = 1884,
month = "",
volume = 23,
number = "",
pages = "453--488",
copy = ""
}
@ARTICLE{Can1895,
AUTHOR = "G. Cantor",
TITLE = "Beitr{\"a}ge zur {B}egr{\"u}ndung der transfiniten {M}engenlehre ({E}rster {A}rtikel)",
JOURNAL = ma,
YEAR = 1895,
month = Nov,
volume = 46,
number = "4",
pages = "481--512",
copy = ""
}
@ARTICLE{Can1897,
AUTHOR = "G. Cantor",
TITLE = "Beitr{\"a}ge zur {B}egr{\"u}ndung der transfiniten {M}engenlehre ({Z}weiter {A}rtikel)",
JOURNAL = ma,
YEAR = 1897,
month = "",
volume = 49,
number = "",
pages = "207--246",
copy = ""
}
@article{Can62,
author = {D.~G. Cantor},
title = {On The Ambiguity Problem of {B}ackus Systems},
journal = jacm,
volume = {9},
number = {4},
pages = {477--479},
year = {1962},
ydoi = {10.1145/321138.321145},
}
@inproceedings{CaoCulSte2009,
author = {Y. Cao and
J.~C. Culberson and
L. Stewart},
title = {{DP}-Complete Problems Derived from Extremal {NP}-Complete Properties},
booktitle = {Mathematical Foundations of Computer Science 2009, 34th International
Symposium, {MFCS}},
pages = {199--210},
editor = {R. Kr{\'{a}}lovic and
D. Niwinski},
series = {LNCS},
volume = {5734},
publisher = {Springer},
year = {2009},
}
@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},
}
@article{CaoKOY2018,
author = {Y. Cao and
Y. Ke and
Y. Otachi and
J. You},
title = {Vertex deletion problems on chordal graphs},
journal = tcs,
volume = {745},
pages = {75--86},
year = {2018},
}
@inproceedings{Cap94,
author = {C. Capelle},
editor = {V. Bouchitt{\'{e}} and
M. Morvan},
title = {Representation of an Order as Union of Interval Orders},
booktitle = {Orders, Algorithms, and Applications, International Workshop {ORDAL}},
series = {LNCS},
volume = {831},
pages = {143--161},
publisher = {Springer},
year = {1994},
}
@article{CapStr2019,
author = {F. Capelli and Y. Strozecki},
title = {Incremental delay enumeration: Space and time},
journal = dam,
volume = {268},
pages = {179--190},
year = {2019},
}
@article{CapStr2021,
title = {Enumerating models of {DNF} faster: Breaking the dependency on the formula size},
journal = dam,
year = {2021},
volume = {303},
pages = {203--215},
author = {F. Capelli and Y. Strozecki},
}
@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},
}
@article{CarGut2014,
author = {P. de Caria and
M. Gutierrez},
title = {On the correspondence between tree representations of chordal and
dually chordal graphs},
journal = dam,
volume = {164},
pages = {500--511},
year = {2014},
}
@article{CarFRS2009,
title = "Lattices of local two-dimensional languages",
journal = tcs,
volume = "410",
number = "27-29",
pages = "2701---2713",
year = "2009",
author = "F. De Carli and A. Frosini and S. Rinaldi and A. Sorbi",
}
@article{CarKKK2021,
title = {Efficiently enumerating minimal triangulations},
journal = dam,
year = {2021},
doi = {https://doi.org/10.1016/j.dam.2020.05.034},
author = {N. Carmeli and B. Kenig and B. Kimelfeld and M. Kröll},
}
@ARTICLE{CarPar90,
AUTHOR = "R. Carraghan and P.~M. Pardalos",
TITLE = "An exact algorithm for the maximum clique problem",
JOURNAL = {Operations Research Letters},
YEAR = 1990,
month = "",
volume = 9,
number = "",
pages = "375--382",
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 = ""
}
@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},
}
@article{CarLev2010,
author = {J. Cardinal and
E. Levy},
title = {Connected vertex covers in dense graphs},
journal = tcs,
volume = {411},
number = {26-28},
pages = {2581--2590},
year = {2010}
}
@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{CarFioJor2012,
author = {J. Cardinal and
S. Fiorini and
G. Joret},
title = {Minimum Entropy Combinatorial Optimization Problems},
journal = tocs,
volume = {51},
number = {1},
pages = {4--21},
year = {2012},
}
@article{CarBru2013,
author = {Cardinali, I. and De Bruyn, B.},
journal = arscomb,
pages = {309--319},
title = {Spin-embeddings, two-intersection sets and two-weight codes},
volume = {109},
year = {2013},
}
@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{Car2002,
author = {M. Carlsson},
title = {Monads for incremental computing},
booktitle = {Proceedings of the Seventh {ACM} {SIGPLAN} International Conference
on Functional Programming {(ICFP)}},
pages = {26--35},
year = {2002},
editor = {M. Wand and
S.~L.~P. Jones},
publisher = {{ACM}},
}
@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",
}
@InProceedings{CarCerGoe2006,
author = {Carme, J. and Ceresna, M. and Goebel, M.},
title = {Query-based learning of {XPath} expressions},
booktitle = {Grammatical Inference: Algorithms and Applications, 8th
International Colloquium, ICGI},
year = {2006},
pages = {342--343},
editor = {Y. Sakakibara and
S. Kobayashi and
K. Sato and
T. Nishino and
E. Tomita},
publisher = {Springer},
series = {LNCS/LNAI},
volume = {4201},
}
@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 = ""
}
@inproceedings{CarGIMPS2016,
author = {M.~L. Carmosino and
J. Gao and
R. Impagliazzo and
I. Mihajlin and
R. Paturi and
S. Schneider},
editor = {M. Sudan},
title = {Nondeterministic Extensions of the Strong Exponential Time Hypothesis
and Consequences for Non-reducibility},
booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical
Computer Science, ICTS},
pages = {261--270},
publisher = {{ACM}},
year = {2016},
}
@article{CarProSou2019,
author = {A.~D.~A. Carneiro and
F. Protti and
U.~S. Souza},
title = {Deadlock resolution in wait-for graphs by vertex/arc deletion},
journal = joco,
volume = {37},
number = {2},
pages = {546--562},
year = {2019},
}
@ARTICLE{CarWesYus00,
AUTHOR = "Y. Caro and D.~B. West and R. Yuster",
TITLE = "Connected Domination and Spanning Trees with Many Leaves",
JOURNAL = siamdm,
YEAR = 2000,
month = "",
volume = 13,
number = "",
pages = "202--211",
copy = ""
}
@article{Car2000,
author = {P. Caron},
title = {Families of locally testable languages},
journal = tcs,
volume = {242},
number = {1-2},
pages = {361--376},
year = {2000}
}
@article{CarCamMib2014,
author = {P. Caron and
J.{-}M. Champarnaud and
L. Mignot},
title = {A general framework for the derivation of regular expressions},
journal = rairoita,
volume = {48},
number = {3},
pages = {281--305},
year = {2014},
}
@article{CarMigMik2017,
author = {P. Caron and
L. Mignot and
C. Miklarz},
title = {On the hierarchy of generalizations of one-unambiguous regular languages},
journal = tcs,
volume = {679},
pages = {95--106},
year = {2017},
}
@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{CarLMP2016,
author = {P. Caron and
J.{-}G. Luque and
L. Mignot and
B. Patrou},
title = {State Complexity of Catenation Combined with a Boolean Operation:
{A} Unified Approach},
journal = ijfcs,
volume = {27},
number = {6},
pages = {675--704},
year = {2016},
}
@inproceedings{CarHamLuq2019,
author = {P. Caron and
E. Hamel{-}De le Court and
J.{-}G. Luque},
editor = {J. Leroux and
J.{-}F. Raskin},
title = {Algebraic and Combinatorial Tools for State Complexity: Application
to the Star-Xor Problem},
booktitle = {Proceedings Tenth International Symposium on Games, Automata, Logics,
and Formal Verification, GandALF},
series = {{EPTCS}},
volume = {305},
pages = {154--168},
year = {2019},
}
@inproceedings{CarHamLuq2020,
author = {P. Caron and
E. Hamel{-}De le Court and
J.{-}G. Luque},
editor = {N. Jonoska and
D. Savchuk},
title = {A Study of a Simple Class of Modifiers: Product Modifiers},
booktitle = {Developments in Language Theory - 24th International Conference, {DLT}},
series = {LNCS},
volume = {12086},
pages = {110--121},
publisher = {Springer},
year = {2020},
}
@article{CarHLP2020,
author = {P. Caron and
E. Hamel{-}De le Court and
J.{-}G. Luque and
B. Patrou},
title = {New tools for state complexity},
journal = dmtcs,
volume = {22},
number = {1},
year = {2020},
}
@article{Car88,
title = "On synchronizing unambiguous automata",
journal = tcs,
volume = "60",
number = "3",
pages = "285--296",
year = "1988",
author = "A. Carpi",
}
@article{CarDAl2009,
author = {A. Carpi and
F. D'Alessandro},
title = {Strongly transitive automata and the {\v{C}}ern{\'{y}} conjecture},
journal = actainform,
volume = {46},
number = {8},
pages = {591--607},
year = {2009},
}
@inproceedings{CarDAl2009a,
author = {A. Carpi and
F. D'Alessandro},
title = {The Synchronization Problem for Locally Strongly Transitive Automata},
booktitle = {Mathematical Foundations of Computer Science 2009, 34th International
Symposium, {MFCS}},
pages = {211--222},
year = {2009},
editor = {R. Kr{\'{a}}lovic and
D. Niwinski},
series = {LNCS},
volume = {5734},
publisher = {Springer},
}
@inproceedings{CarDAl2010,
author = {A. Carpi and
F. D'Alessandro},
title = {On the Hybrid {\v C}ern{\'{y}}-Road Coloring Problem and {H}amiltonian Paths},
booktitle = {Developments in Language Theory, 14th International Conference, {DLT}},
pages = {124--135},
year = {2010},
editor = {Y. Gao and
H. Lu and
S. Seki and
S. Yu},
series = {LNCS},
volume = {6224},
publisher = {Springer},
}
@inproceedings{CarDAl2014,
author = {A. Carpi and
F. D'Alessandro},
title = {\v{C}ern\'y-like problems for finite sets of words},
booktitle = {Proceedings of the 15th Italian Conference on Theoretical Computer
Science, ICTCS},
pages = {81--92},
year = {2014},
editor = {S. Bistarelli and
A. Formisano},
series = {{CEUR} Workshop Proceedings},
volume = {1231},
publisher = {CEUR-WS.org},
url = {http://ceur-ws.org/Vol-1231},
}
@article{CarDAl2017,
author = {A. Carpi and
F. D'Alessandro},
title = {On incomplete and synchronizing finite sets},
journal = tcs,
volume = {664},
pages = {67--77},
year = {2017},}
@inproceedings{CarDAl2018,
author = {A. Carpi and
F. D'Alessandro},
title = {On the Commutative Equivalence of Context-Free Languages},
pages = {169--181},
booktitle = {Developments in Language Theory - 22nd International Conference, {DLT}},
year = {2018},
editor = {M. Hoshi and
S. Seki},
series = {LNCS},
volume = {11088},
publisher = {Springer},
}
@article{CarDAl2019,
author = {A. Carpi and
F. D'Alessandro},
title = {Locally Strongly Transitive Automata in the {\v{C}}ern{\'{y}}
Conjecture and Related Problems},
journal = jalc,
volume = {24},
number = {2-4},
pages = {165--184},
year = {2019},
}
@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 = ""
}
@Phdthesis{Car97,
title = {Inferencia de lenguajes racionales estoc{\'a}sticos},
author = {Carrasco, R.~C.},
school = {Universidad de Alicante, Spain},
year = {1997}
}
@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{CarRod90,
author = {Y. Caro and Y. Roditty},
title = {A note on the $k$-domination number of a graph},
journal = {International Journal of Mathematics and Mathematical Sciences},
year = {1990},
OPTkey = {},
volume = {13},
number = {1},
pages = {205--206},
}
@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{Caretal2011a,
author = {R. Carrascosa and
F. Coste and
M. Gall{\'e} and
G. G. Infante L{\'o}pez},
title = {The Smallest Grammar Problem as Constituents Choice and Minimal Grammar
Parsing},
journal = {Algorithms},
volume = {4},
number = {4},
pages = {262--284},
year = {2011},
}
@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{CarPou2018,
author = {O. Carton and
M. Pouzet},
title = {Simon's Theorem for Scattered Words},
pages = {182--193},
booktitle = {Developments in Language Theory - 22nd International Conference, {DLT}},
year = {2018},
editor = {M. Hoshi and
S. Seki},
series = {LNCS},
volume = {11088},
publisher = {Springer},
}
@article{CarHar56,
title={Structural balance: a generalization of {H}eider's theory},
author={D. Cartwright and F. Harary},
journal={The Psychological Review},
year={1956},
volume={63},
number ={5},
pages={277--293}
}
@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 = "Topology of strings: Median string is {NP} complete",
JOURNAL = tcs,
YEAR = 2000,
month = "",
volume = 230,
number = "",
pages = "39--48",
copy = ""
}
@inproceedings{CasHig2000a,
AUTHOR = "F. Casacuberta and C. de la Higuera",
title = {Computational Complexity of Problems on Probabilistic Grammars
and Transducers},
year = {2000},
pages = {15--24},
editor = {A.~L. Oliveira},
booktitle = {Grammatical Inference: Algorithms and Applications, 5th
International Colloquium, ICGI},
publisher = {Springer},
series = {LNCS},
volume = {1891},
}
@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 = ""
}
@INPROCEEDINGS{CasSmi78,
AUTHOR = "J. Case and C. Smith",
TITLE = "Anomaly hierarchies of mechanised inductive inference",
BOOKTITLE = "Proceedings of the tenth Annual ACM Symposium on Theory of computing STOC",
YEAR = 1978,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "314--319",
address = "",
organization = "",
copy = ""
}
@INPROCEEDINGS{CasLyn82,
AUTHOR = "J. Case and C. Lynes",
TITLE = "Machine inductive inference and language identification",
BOOKTITLE = "ICALP'82",
YEAR = 1982,
month = "",
volume = "140",
editor = "",
series = "LNCS",
chapter = "",
pages = "107--115",
address = "",
organization = "",
publisher = "",
copy = ""
}
@ARTICLE{CasJaiSha94,
AUTHOR = "J. Case and S. Jain and A. Sharma",
TITLE = "Vacillatory Learning of Nearly Minimal Size Grammars",
JOURNAL = jcss,
YEAR = 1994,
month = "",
volume = 49,
number = "",
pages = "189--207",
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{CasJOSS2014,
author = {J. Case and
S. Jain and
Y. S. Ong and
P. Semukhin and
F. Stephan},
title = {Automatic learners with feedback queries},
journal = jcss,
volume = {80},
number = {4},
pages = {806--820},
year = {2014},
}
@article{CasKot2016,
author = {J. Case and
T. K{\"{o}}tzing},
title = {Topological separations in inductive inference},
journal = tcs,
volume = {620},
pages = {33--45},
year = {2016},
}
@MastersThesis{Cas2013,
author = {K. Casel},
title = {Algorithmic and complexity-theoretic
studies of combinatorial problems in
statistical databases},
school = {Abteilung Informatikwissenschaften, Fachbereich IV, Universit\"at Trier, Germany},
year = {2013},
}
@inproceedings{Cas2014,
author = {K. Casel},
title = {A Fixed-Parameter Approach for Privacy-Protection with Global
Recoding},
booktitle = {Frontiers in Algorithmics - 8th International Workshop, FAW},
year = {2014},
pages = {25--35},
editor = {J. Chen and
J. E. Hopcroft and
J. Wang},
publisher = {Springer},
series = {LNCS},
volume = {8497},
}
@Article{CasEFR2016,
author = {K. Casel and A. Estrada-Moreno and H. Fernau and J.~A. Rodr\'iguez-Vel\'azquez},
title = {Weak total resolvability in graphs},
journal = {Discussiones Mathematicae Graph Theory},
year = {2016},
volume = {36},
pages = {185--210},
}
@InProceedings{CasFGGS2016,
author = {K. Casel and H. Fernau and S. Gaspers and B. Gras and M.~L. Schmid},
title = {On the Complexity of Grammar-Based Compression over Fixed Alphabets},
booktitle = {International Colloquium on Automata, Languages and Programming, ICALP},
year = {2016},
editor = {I. Chatzigiannakis and
M. Mitzenmacher and
Y. Rabani and
D. Sangiorgi},
pages = {122:1--122:14},
volume = {55},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@InProceedings{CasFGSW2017,
author ={K. Casel and H. Fernau and A. Grigoriev and M.~L. Schmid and S. Whitesides},
title ={Combinatorial Properties and Recognition of Unit Square Visibility Graphs},
booktitle ={42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages ={30:1--30:15},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN ={978-3-95977-046-0},
ISSN ={1868-8969},
year ={2017},
volume ={83},
editor ={K.~G. Larsen and H.~L. Bodlaender and J.-F. Raskin},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@PhdThesis{Cas2018,
author = {K. Casel},
title = {Lower-Bounded Clustering - Models, Complexity and (Parameterised) Approximation},
school = {Abteilung Informatikwissenschaften, Fachbereich IV, Universit\"at Trier, Germany},
year = {2018},
}
@TechReport{CasFGMS2018,
author = {K. Casel and H. Fernau and M.~K. Ghadikolaei and J. Monnot and F. Sikora},
title = {On the Complexity of Solution Extension of Optimization Problems},
institution = {Cornell University, ArXiv},
year = {2018},
OPTkey = {},
OPTtype = {},
number = {arXiv:1810.04553 [cs.CC]},
}
@TechReport{CasFGMS2018a,
author = {K. Casel and H. Fernau and M.~K. Ghadikolaei and J. Monnot and F. Sikora},
title = {Extension of vertex cover and independent set in some classes
of graphs and generalizations},
institution = {Cornell University, ArXiv},
year = {2018},
OPTkey = {},
OPTtype = {},
number = {arXiv:1810.04629 [cs.CC]},
}
@inproceedings{Cas1819,
author = {K. Casel},
title = {Resolving Conflicts for Lower-Bounded Clustering},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018},
pages = {23:1--23:14},
editor = {C. Paul and
M. Pilipczuk},
series = {LIPIcs},
volume = {115},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2019},
}
@inproceedings{CasFKMS2019,
author = {K. Casel and
H. Fernau and
M. Khosravian Ghadikolaei and
J. Monnot and
F. Sikora},
title = {Extension of Vertex Cover and Independent Set in Some Classes of Graphs},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}},
pages = {124--136},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_11},
editor = {P. Heggernes},
series = {LNCS},
volume = {11485},
publisher = {Springer},
}
@inproceedings{CasFKMS2019a,
author = {K. Casel and
H. Fernau and
M. Khosravian Ghadikolaei and
J. Monnot and
F. Sikora},
title = {Extension of Some Edge Graph Problems: Standard and Parameterized
Complexity},
booktitle = {Fundamentals of Computation Theory - 22nd International Symposium,
{FCT}},
pages = {185--200},
editor = {L. A. Gasieniec and
J. Jansson and
C. Levcopoulos},
series = {LNCS},
volume = {11651},
publisher = {Springer},
year = {2019},
}
@inproceedings{CasDFKMS2019,
author = {K. Casel and
J.~D. Day and
P. Fleischmann and
T. Kociumaka and
F. Manea and
M.~L. Schmid},
editor = {C. Baier and
I. Chatzigiannakis and
P. Flocchini and
S. Leonardi},
title = {Graph and String Parameters: Connections Between Pathwidth, Cutwidth
and the Locality Number},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP}},
series = {LIPIcs},
volume = {132},
pages = {109:1--109:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
}
@article{CasDFGKVSL2020,
author = {K. Casel and
J. Dreier and
H. Fernau and
M. Gobbert and
P. Kuinke and
F. S{\'{a}}nchez Villaamil and
M.~L. Schmid and
E.~J. van Leeuwen},
title = {Complexity of independency and cliquy trees},
journal = dam,
volume = {272},
pages = {2--15},
year = {2020},
}
@article{CasFGGS2021,
author = {K. Casel and H. Fernau and S. Gaspers and B. Gras and M.~L. Schmid},
title = {On the Complexity of the Smallest Grammar Problem over Fixed Alphabets},
journal = tocs,
volume = {65},
number = {2},
pages = {344--409},
year = {2021},
}
@inproceedings{CasFGMS2021,
author = {K. Casel and
H. Fernau and
M. Khosravian Ghadikolaei and
J. Monnot and
F. Sikora},
editor = {T. Calamoneri and
F. Cor{\`{o}}},
title = {Abundant Extensions},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}},
series = {LNCS},
volume = {12701},
pages = {3--17},
publisher = {Springer},
year = {2021},
doi = {10.1007/978-3-030-75242-2\_1},
}
@article{CasFGMS2022,
author = {K. Casel and
H. Fernau and
M. Khosravian Ghadikolaei and
J. Monnot and
F. Sikora},
title = {On the complexity of solution extension of optimization problems},
journal = tcs,
year = {2022},
volume = {904},
pages = {48--65},
ydoi = {https://doi.org/10.1016/j.tcs.2021.10.017},
}
@article{CasFGSW2023,
author = {K. Casel and
H. Fernau and
A. Grigoriev and
M.~L. Schmid and
S. Whitesides},
title = {Combinatorial Properties and Recognition of Unit Square Visibility
Graphs},
journal = {Discrete \& Computational Geometry},
volume = {69},
number = {4},
pages = {937--980},
year = {2023},
ydoi = {10.1007/s00454-022-00414-8},
}
@article{CasFGMS2023,
title = {Extension of some edge graph problems: Standard, parameterized and approximation complexity},
journal = dam,
volume = {340},
pages = {183--201},
year = {2023},
yissn = {0166-218X},
ydoi = {https://doi.org/10.1016/j.dam.2023.06.042},
author = {K. Casel and H. Fernau and M. {Khosravian Ghadikolaei} and J. Monnot and F. Sikora},
}
@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{CasKab2016,
author = {J. Cassaigne and
I. Kabor{\'{e}}},
title = {Abelian Complexity and Frequencies of Letters in Infinite Words},
journal = ijfcs,
volume = {27},
number = {5},
pages = {631--650},
year = {2016},
}
@article{CasHJS2016,
author = {S. Cassel and
F. Howar and
B. Jonsson and
B. Steffen},
title = {Active learning for extended finite state machines},
journal = {Formal Aspects of Computing},
volume = {28},
number = {2},
pages = {233--263},
year = {2016},
ydoi = {10.1007/S00165-016-0355-5},
}
@inproceedings{CasHJS1618,
author = {S. Cassel and
F. Howar and
B. Jonsson and
B. Steffen},
editor = {A. Bennaceur and
R. H{\"{a}}hnle and
K. Meinke},
title = {Extending Automata Learning to Extended Finite State Machines},
booktitle = {Machine Learning for Dynamic Software Analysis: Potentials and Limits
- International Dagstuhl Seminar 16172, 2016, Revised Papers},
series = {LNCS},
volume = {11026},
pages = {149--177},
publisher = {Springer},
year = {2018},
}
@article{CasMeyZha2016,
author = {F. Cassez and
R. van der Meyden and
C. Zhang},
title = {The complexity of synchronous notions of information flow security},
journal = tcs,
volume = {631},
pages = {16--42},
year = {2016},
}
@article{CasFGSY2015,
author = {A. Casteigts and
P. Flocchini and
E. Godard and
N. Santoro and
M. Yamashita},
title = {On the expressivity of time-varying graphs},
journal = tcs,
volume = {590},
pages = {27--37},
year = {2015},
}
@article{CasPetSch2021,
author = {A. Casteigts and
J.~G. Peters and
J. Schoeters},
title = {Temporal cliques admit sparse spanners},
journal = jcss,
volume = {121},
pages = {1--17},
year = {2021},
}
@ARTICLE{Casetal98,
AUTHOR = "A. Castellanos and E. Vidal and M. A. Varo and J. Oncina",
TITLE = "Language understanding and subsequential transducer learning",
JOURNAL = {Computer Speech and Understanding},
YEAR = 1998,
month = "",
volume = 12,
number = "",
pages = "193--228",
copy = ""
}
@article{CasWor2003,
year={2003},
journal={Graphs and Combinatorics},
volume={19},
number={4},
title={Enumeration of {$P_4$}-Free Chordal Graphs},
author={Castelo, R. and Wormald, N.},
pages={467--474},
}
@article{CasRes2012,
author = {G. Castiglione and
A. Restivo},
title = {On the Shuffle of Star-Free Languages},
journal = fundinform,
volume = {116},
number = {1-4},
pages = {35--44},
year = {2012},
}
@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 = jgaa,
YEAR = 2002,
month = "",
volume = 6,
number = "",
pages = "7--26",
copy = ""
}
@article{CatJun2019,
author = {C. Catalano and
R.~M. Jungers},
title = {On Random Primitive Sets, Directable {NFA}s and the Generation of Slowly
Synchronizing {DFA}s},
journal = jalc,
volume = {24},
number = {2-4},
pages = {185--217},
year = {2019},
}
@Article{CatCHHLPY2012,
author = {M. Catral and A. Cepek and L. Hogben and M. Huyn and K. Lazebnik and T. Peters and M. Young},
title = {Zero forcing number, maximum nullity, and path
cover number of subdivided graphs},
journal = {Electronic Journal of Linear Algebra},
year = {2012},
volume = {23},
OPTnumber = {},
pages = {906--922},
}
@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 = ""
}
@InProceedings{CatPer2014,
author="Cattan{\'e}o, D.
and Perdrix, S.",
editor="Gopal, T. V.
and Agrawal, M.
and Li, A.
and Cooper, S.~B.",
title="The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes",
booktitle="Theory and Applications of Models of Computation, TAMC",
year="2014",
publisher="Springer",
yaddress="Cham",
pages="86--103",
series = {LNCS},
volume = "8402"
}
@ARTICLE{Cat44,
AUTHOR = "R. Cattell",
TITLE = "A Note on Correlation Clusters and Cluster Search Methods",
JOURNAL = {Psychometrika},
YEAR = 1944,
month = "",
volume = 9,
number = "3", pages = "169--184",
copy = ""
}
@article{CatDinFel96,
author = {K. Cattell and
M.~J. Dinneen and
M.~R. Fellows},
title = {A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width},
journal = ipl,
volume = {57},
number = {4},
pages = {197--203},
year = {1996},
}
@inproceedings{Cau89,
author = {D. Caucal},
title = {A Fast Algorithm to Decide on Simple Grammars Equivalence},
booktitle = {Optimal Algorithms, International Symposium},
pages = {66--85},
editor = {H. Djidjev},
series = {LNCS},
volume = {401},
publisher = {Springer},
year = {1989},
}
@inproceedings{CauMon9091,
author = {D. Caucal and
R. Monfort},
title = {On the transition graphs of automata and grammars},
booktitle = {Graph-Theoretic Concepts in Computer Science, 16rd International Workshop,
{WG}'90},
pages = {311--337},
editor = {R. H. M{\"{o}}hring},
series = {LNCS},
volume = {484},
publisher = {Springer},
year = {1991},
}
@inproceedings{Cau2006,
author = {D. Caucal},
title = {Synchronization of Pushdown Automata},
booktitle = {Developments in Language Theory, 10th International Conference, {DLT}},
pages = {120--132},
year = {2006},
editor = {O.~H. Ibarra and
Z. Dang},
series = {LNCS},
volume = {4036},
publisher = {Springer}
}
@inproceedings{CauHas2008,
author = {D. Caucal and
S. Hassen},
title = {Synchronization of Grammars},
booktitle = {Computer Science - Theory and Applications, Third International Computer
Science Symposium in Russia, {CSR}},
pages = {110--121},
editor = {E.~A. Hirsch and
A.~A. Razborov and
A.~L. Semenov and
A. Slissenko},
series = {LNCS},
volume = {5010},
publisher = {Springer},
year = {2008},
}
@inproceedings{Cau2009,
author = {D. Caucal},
title = {Synchronization of Regular Automata},
booktitle = {Mathematical Foundations of Computer Science 2009, 34th International
Symposium, {MFCS}},
pages = {2--23},
editor = {R. Kr{\'{a}}lovic and
D. Niwinski},
series = {LNCS},
volume = {5734},
publisher = {Springer},
year = {2009},
}
@inproceedings{CauRis2018,
author = {D. Caucal and
C. Rispal},
title = {Recognizability for Automata},
booktitle = {Developments in Language Theory - 22nd International Conference, {DLT}},
pages = {206--218},
editor = {M. Hoshi and
S. Seki},
series = {LNCS},
volume = {11088},
publisher = {Springer},
year = {2018},
}
@article{CavBil2000,
year={2000},
journal={Graphs and Combinatorics},
volume={16},
number={1},
title={Decompositions of Complete Multipartite Graphs into Cycles of Even Length},
author={Cavenagh, N.~J. and Billington, E.~J.},
pages={49--65},
}
@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{CazKar2008,
author = {F. Cazals and
C. Karande},
title = {A note on the problem of reporting maximal cliques},
journal = tcs,
volume = {407},
number = {1-3},
pages = {564--568},
year = {2008},
}
@article{CazRiv2018,
title = "Relationship between superstring and compression measures: New insights on the greedy conjecture",
journal =dam,
volume = "245",
pages = "59 - 64",
year = "2018",
author = "B. Cazaux and E. Rivals"}
@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{CelRus2012,
author = {M. Celaya and
F. Ruskey},
title = {An Undecidable Nested Recurrence Relation},
booktitle = {How the World Computes - Turing Centenary Conference and 8th Conference
on Computability in Europe},
pages = {107--117},
year = {2012},
editor = {S. B. Cooper and
A. Dawar and
B. L{\"{o}}we},
series = {LNCS},
volume = {7318},
publisher = {Springer},
}
@article{CenShs2012,
author = {K. Censor-Hillel and
H. Shachnai},
title = {Fast Information Spreading in Graphs with Large Weak Conductance},
journal = siam,
volume = {41},
number = {6},
year = {2012},
pages = {1451--1465},
}
@article{CenDDRS2010,
author = {C.~C. Centeno and
S. Dantas and
M. Costa Dourado and
D. Rautenbach and
J. L. Szwarcfiter},
title = {Convex Partitions of Graphs induced by Paths of Order Three},
journal = dmtcs,
volume = {12},
number = {5},
year = {2010},
pages = {175--184},
}
@article{CenDPRS2011,
author = {C.~C. Centeno and
M. Costa Dourado and
L. Draque Penso and
D. Rautenbach and
J. L. Szwarcfiter},
title = {Irreversible conversion of graphs},
journal = tcs,
volume = {412},
number = {29},
year = {2011},
pages = {3693--3700},
}
@article{CerHeuJoh2008,
author = {L. Cereceda and
J. van den Heuvel and
M. Johnson},
title = {Connectedness of the graph of vertex-colourings},
journal = dm,
volume = {308},
number = {5--6},
year = {2008},
pages = {913--919},
}
@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},
volume = {14},
number = {3},
pages = {208--216},
}
@article{CerPirRos71,
author = {\v{C}ern\'y, J. and Pirick\'a, A. and Rosenauerov\'a, B.},
journal = {Kybernetika},
number = {4},
pages = {289--298},
title = {On directable automata},
volume = {7},
year = {1971},
}
@inproceedings{Cer92,
author = {E. Cerny},
title = {Verification of {I/O} Trace Set Inclusion for a Class of Non-Deterministic
Finite State Machines},
booktitle = {Proceedings 1991 {IEEE} International Conference on Computer Design:
{VLSI} in Computer {\&} Processors, {ICCD}},
pages = {526--530},
year = {1992},
publisher = {{IEEE} Computer Society},
}
@article{Cer2019,
author = {J. {\v{C}}ern\'y},
title = {A Note on Homogeneous Experiments with Finite Automata},
journal = jalc,
volume = {24},
number = {2-4},
pages = {123--132},
year = {2019},
}
@article{Cer2014,
title = "Covering space in the {W}eyl and {B}esicovitch topologies",
journal = ic,
volume = "239",
number = "0",
pages = "44--54",
year = "2014",
author = "J. Cervelle",}
@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{Ces2002,
author = {M. Cesati},
title = {Perfect Code is {$W[1]$}-complete},
journal =ipl,
volume = {81},
number = {3},
pages = {163--168},
year = {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 = ""
}
@inproceedings{CesMMSVV2018,
author = {M. \v{C}e\v{s}ka Jr. and
J. Maty{\'{a}}s and
V. Mrazek and
L. Sekanina and
Z. Vas{\'{\i}}cek and
T. Vojnar},
title = {{ADAC:} Automated Design of Approximate Circuits},
booktitle = {Computer Aided Verification - 30th International Conference, {CAV}, Proceedings, Part {I}},
pages = {612--620},
year = {2018},
editor = {H. Chockler and
G. Weissenbacher},
series = {LNCS},
volume = {10981},
publisher = {Springer},
}
@inproceedings{CesHHLV2018,
author = {M. \v{C}e\v{s}ka Jr. and
V. Havlena and
L. Hol{\'{\i}}k and
O. Leng{\'{a}}l and
T. Vojnar},
title = {Approximate Reduction of Finite Automata for High-Speed Network Intrusion
Detection},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
- 24th International Conference, {TACAS}, Proceedings, Part {II}},
pages = {155--175},
editor = {D. Beyer and
M. Huisman},
series = {LNCS},
volume = {10806},
publisher = {Springer},
year = {2018},
}
@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{ChaKle78,
author = {S. Chaiken and
D.~J. Kleitman},
title = {Matrix Tree Theorems},
journal = jctha,
volume = {24},
number = {3},
pages = {377--381},
year = {1978},
}
@article{Cha82,
author = {S. Chaiken},
title = {A combinatorial proof of the all minors Matrix Tree Theorem},
journal = {SIAM J. Alg. Disc. Meth.},
volume = {3},
number = {3},
pages = {319--329},
year = {1982},
}
@ARTICLE{Cha65,
AUTHOR = "G. J. Chaitin",
TITLE = "An improvement on a theorem of {E.~F.} {M}oore",
JOURNAL = {IEEE Transactions on Electronic Computers},
YEAR = 1965,
month = "",
volume = 14,
pages = "466--467",
copy = ""
}
@ARTICLE{Cha66,
AUTHOR = "G. J. Chaitin",
TITLE = "On the length of programs for computing finite binary sequences",
JOURNAL = jacm,
YEAR = 1966,
month = "",
volume = 13,
number = "4",
pages = "547--569",
copy = ""
}
@ARTICLE{Cha69,
AUTHOR = "G. J. Chaitin",
TITLE = "On the simplicity and speed of programs for computing
infinite sets of natural numbers",
JOURNAL = jacm,
YEAR = 1969,
month = "",
volume = 16,
number = "3",
pages = "407--422",
copy = ""
}
@ARTICLE{Chaetal81,
AUTHOR = "S. Chaiken and D.~J. Kleitman and M. Saks and J. Shearer",
TITLE = "Covering regions by rectangles",
JOURNAL = {SIAM Journal on Algebraic and Discrete Methods},
YEAR = 1981,
month = "",
volume = 2,
number = "",
pages = "394--410",
copy = ""
}
@article{ChaZel88,
author = {Chajda, I. and Zelinka, B.},
journal = {Czechoslovak Mathematical Journal},
number = {2},
pages = {207-217},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Tolerances and congruences on implication algebras},
volume = {38},
year = {1988},
}
@Article{Cha96,
author = {I. Chajda},
title = {Congruence semimodularity of conservative groupoids},
journal = {Acta Univ. Palacki. Olomuc., Fac. rer. nat., Mathematica},
year = {1996},
volume = {35},
pages = {43--45},
}
@article{ChaFSY2016,
author = {C.~H. Chak and
R. Freivalds and
F. Stephan and
H. Tan Wan Yik},
title = {On block pumpable languages},
journal = tcs,
volume = {609},
pages = {272--285},
year = {2016},
}
@inproceedings{ChaGraKon2010,
author = {D. Chakrabarty and
E. Grant and
J. K{\"{o}}nemann},
title = {On Column-Restricted and Priority Covering Integer Programs},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO}},
pages = {355--368},
year = {2010},
editor = {F. Eisenbrand and
F. B. Shepherd},
series = {LNCS},
volume = {6080},
publisher = {Springer},
year = {2010},
}
@inproceedings{ChaVen2013,
author = {P. Chalermsook and
S. Venkatasubramanian},
title = {Clustering With Center Constraints},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS}},
pages = {401--412},
editor = {A. Seth and
N. K. Vishnoi},
series = {LIPIcs},
volume = {24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2013},
}
@inproceedings{ChaLaeNan2013,
author = {P. Chalermsook and
B. Laekhanukit and
D. Nanongkai},
title = {Independent Set, Induced Matching, and Pricing: Connections and Tight
(Subexponential Time) Approximation Hardnesses},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}},
pages = {370--379},
publisher = {{IEEE} Computer Society},
year = {2013},
}
@inproceedings{ChaLaeNan2013a,
author = {P. Chalermsook and
B. Laekhanukit and
D. Nanongkai},
title = {Graph Products Revisited: Tight Approximation Hardness of Induced
Matching, Poset Dimension and More},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA}},
pages = {1557--1576},
year = {2013},
}
@inproceedings{ChaCKLMNT2017,
author = {P. Chalermsook and
M. Cygan and
G. Kortsarz and
B. Laekhanukit and
P. Manurangsi and
D. Nanongkai and
L. Trevisan},
title = {From {Gap-ETH} to {FPT}-Inapproximability: Clique, Dominating Set, and
More},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}},
pages = {743--754},
year = {2017},
editor = {C. Umans},
doi = {10.1109/FOCS.2017.74},
}
@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},
}
@article{ChaPau2014,
author = {J. Chalopin and
D. Paulusma},
title = {Packing bipartite graphs with covers of complete bipartite graphs},
journal = dam,
year = {2014},
volume = {168},
pages = {40--50},
}
@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{ChaFHMSSW2011,
author={E.~W. Chambers and S.~P. Fekete and H.-F. Hoffmann and D. Marinakis and V. Srinivasan and U. Stege and S. Whitesides},
year={2011},
booktitle={Algorithms and Data Structures, WADS},
volume={6844},
series={LNCS},
editor={Dehne, F. and Iacono, J. and Sack, J.-R.},
title={Connecting a Set of Circles with Minimum Sum of Radii},
publisher={Springer},
pages={183--194},
}
@article{ChaEFLSVSS2017,
author = {E.~W. Chambers and
A. Erickson and
S.~ P. Fekete and
J. Lenchner and
J. Sember and
S. Venkatesh and
U. Stege and
S. Stolpner and
C. Weibel and
S. Whitesides},
title = {Connectivity Graphs of Uncertainty Regions},
journal =alg,
volume = {78},
number = {3},
pages = {990--1019},
year = {2017},
}
@article{ChaFHMMVSW2018,
author={E.~W. Chambers and S.~P. Fekete and H.-F. Hoffmann and D. Marinakis and J. S. B. Mitchell and Srinivasan Venkatesh and U. Stege and S. Whitesides},
title = {Connecting a set of circles with minimum sum of radii},
journal = {Comput. Geom.},
volume = {68},
pages = {62--76},
year = {2018},
}
@INPROCEEDINGS{ChaCou2003,
AUTHOR = "J.-M. Champarnaud and F. Coulon",
TITLE = "{NFA} Reduction Algorithms by Means of Regular Inequalities",
BOOKTITLE = "Developments in Language Theory
7th International Conference, DLT 2003",
YEAR = 2003,
month = "",
volume = "2710",
editor = "Z. \'Esik and Z. {F\"ul\"op}",
series = "LNCS",
chapter = "",
pages = "194--205",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@inproceedings{ChaDubJea2010,
author = {J.{-}M. Champarnaud and
J.{-}P. Dubernard and
H. Jeanne},
title = {Geometricity of Binary Regular Languages},
booktitle = {Language and Automata Theory and Applications, 4th International Conference,
{LATA}},
pages = {178--189},
editor = {A.{-}H. Dediu and
H. Fernau and
C. Mart{\'{\i}}n{-}Vide},
series = {LNCS},
volume = {6031},
publisher = {Springer},
year = {2010},
}
@inproceedings{ChaDubJea1011,
author = {J.{-}M. Champarnaud and
J.{-}P. Dubernard and
H. Jeanne},
title = {Regular Geometrical Languages and Tiling the Plane},
booktitle = {Implementation and Application of Automata - 15th International Conference,
{CIAA} 2010},
pages = {69--78},
editor = {M. Domaratzki and
K. Salomaa},
series = {LNCS},
volume = {6482},
publisher = {Springer},
year = {2011},
}
@inproceedings{ChaDGJ2011,
author = {J.{-}M. Champarnaud and
J.{-}P. Dubernard and
and
F. Guingne and
H. Jeanne},
title = {Geometrical Regular Languages and Linear {D}iophantine Equations},
booktitle = {Descriptional Complexity of Formal Systems - 13th International Workshop,
{DCFS}},
pages = {107--120},
editor = {M. Holzer and
M. Kutrib and
G. Pighizzini},
series = {LNCS},
volume = {6808},
publisher = {Springer},
year = {2011},
}
@article{ChaDGJ2012,
author = {J.{-}M. Champarnaud and
J.{-}P. Dubernard and
and
F. Guingne and
H. Jeanne},
title = {Geometrical regular languages and linear {D}iophantine equations: The
strongly connected case},
journal = tcs,
volume = {449},
pages = {54--63},
year = {2012},
}
@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{Cha88a,
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 = ""
}
@inproceedings{ChaFKKHT2012,
author = {J. Chandlee and
J. Fu and
K. Karydis and
C. Koirala and
J. Heinz and
H.~G. Tanner},
title = {Integrating Grammatical Inference into Robotic Planning},
booktitle = {Proceedings of the Eleventh International Conference on
Grammatical Inference, ICGI},
year = {2012},
pages = {69--83},
editor = {J. Heinz and
C. de la Higuera and
T. Oates},
publisher = {JMLR.org},
series = {JMLR Proceedings},
volume = {21},
}
@article{ChaEyrHei2014,
author = {J. Chandlee and
R. Eyraud and
J. Heinz},
title = {Learning Strictly Local Subsequential Functions},
journal = {Transactions of the Association for Computational Linguistics},
volume = {2},
pages = {491--503},
year = {2014},
}
@inproceedings{ChaJarHei2014,
author = {J. Chandlee and A. Jardine and
J. Heinz},
title = {Learning Repairs for Marked Structures},
booktitle = {Proceedings of the 2014 Annual Meeting on Phonology, AMP},
year = {2014},
pages = {Supplementary Proceedings},
editor = {A. Albright and M.~A. Fullwood},
publisher = {University of Massachusetts Amherst},
}
@article{ChaKarTov99,
author = {B. Chandra and
H.~J. Karloff and
C,~A. Tovey},
title = {New Results on the Old $k$-opt Algorithm for the {T}raveling {S}alesman
{P}roblem},
journal = siam,
year = {1999},
volume = {28},
number = {6},
pages = {1998--2029},
}
@article{ChaMniMoz2020,
author = {K. Chandrasekaran and
M. Mnich and
S. Mozaffari},
title = {Odd Multiway Cut in Directed Acyclic Graphs},
journal = siamdm,
volume = {34},
number = {2},
pages = {1385--1408},
year = {2020},
}
@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{ChaDawBay2011,
author = {R. Chandrasekaran and
M. Dawande and
M. Baysan},
title = {On a labeling problem in graphs},
journal = dam,
volume = {159},
number = {8},
pages = {746--759},
year = {2011},
}
@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 {F}ibonacci {$k$}-ary trees",
JOURNAL = fiq,
YEAR = 1986,
VOLUME = 24,
NUMBER = 3,
PAGES = "258--262",
copy = ""
}
@article{Cha88,
title = "Labeling algorithms for domination problems in sun-free chordal graphs",
journal = dam,
volume = "22",
number = "1",
pages = "21--34",
year = "1988",
note = "",
author = "G.~J. Chang",}
@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{ChaLyu2009,
author = {C.-L. Chang and
Y.-D. Lyuu},
title = {Spreading messages},
journal = tcs,
volume = {410},
number = {27-29},
year = {2009},
pages = {2714--2724},
}
@article{ChaClaHar96,
author = {Chang, T. and Clark, W. and Hare, E.},
year = {1996},
pages = {97--112},
title = {Domination Numbers of Complete Grid Graphs, {I}},
volume = {38},
journal = arscomb,
}
@article{ChaLeu97,
author = {R.~S. Chang and
S.-J. Leu},
title = {The Minimum Labeling Spanning Trees},
journal = ipl,
volume = {63},
number = {5},
year = {1997},
pages = {277--282},
}
@article{ChaJou99,
title = {The number of maximal independent sets in connected triangle-free graphs},
journal = dm,
volume = {197-198},
pages = {169--178},
year = {1999},
author = {G.~J. Chang and M.-J. Jou},
}
@INPROCEEDINGS{ChaMul01,
AUTHOR = "M.-S. Chang and H. M{\"u}ller",
TITLE = "On the tree-degree of graphs",
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 = ""
}
@article{ChaDMR2012,
author = {G.~J. Chang and
P. Dorbec and
M. Montassier and
A. Raspaud},
title = {Generalized power domination of graphs},
journal = dam,
volume = {160},
number = {12},
pages = {1691--1698},
year = {2012},
}
@InProceedings{ChaHunSu2012,
author = {M.-S. Chang and L.-J. Hung and P.-C. Su},
title = {Measure and Conquer:
Analysis of a Branch-and-Reduce Algorithm for the Maximum
Bounded-degree-1 Set Problem},
booktitle = {The 29th Workshop on Combinatorial Mathematics and Computation Theory},
pages = {136--145},
year = {2012},
}
@InProceedings{ChaHun2013,
author = {M.-S. Chang and L.-J. Hung},
title = {Moderately Exponential Time Approximation Algorithms for the Maximum Bounded-degree-1 Set Problem},
booktitle = {The 30th Workshop on Combinatorial Mathematics and Computation Theory},
pages = {23--30},
year = {2013},
}
@InProceedings{ChaCHLRS2014,
author = {M.-S. Chang and Li-H. Chen and L.-J. Hung and Yi-Z. Liu and P. Rossmanith and S. Sikdar},
title = {An {$O^*(1.4658^n)$}-time exact algorithm for the maximum bounded-degree-1 set problem},
booktitle = {The 31st Workshop on Combinatorial Mathematics and Computation Theory},
pages = {9--18},
year = {2014},
}
@article{ChaWuZhu2010,
title = "Rainbow domination on trees",
journal = dam,
volume = "158",
number = "1",
pages = "8--12",
year = "2010",
author = "G.~J. Chang and J. Wu and X. Zhu"
}
@article{ChaCHRS2016,
title = "Fixed-parameter algorithms for vertex cover {$P_3$}",
journal = dopt,
volume = "19",
number = "",
pages = "12--22",
year = "2016",
author = "M.-S. Chang and Li-H. Chen and L.-Ju Hung and P. Rossmanith and P.-C. Su",
}
@article{ChaCheHun2016,
year={2016},
journal=joco,
title={An {$O^{*}(1.4366^n)$}-time exact algorithm for maximum {$P_2$}-packing in cubic graphs},
author={Chang, M.-S. and Chen, L.-H. and Hung, L.-J.},
pages={594--607},
volume = 32,
}
@article{ChaStuSuo2023,
author = {Y.{-}J. Chang and
J. Studen{\'{y}} and
J. Suomela},
title = {Distributed graph problems through an automata-theoretic lens},
journal = tcs,
volume = {951},
pages = {113710},
year = {2023},
ydoi = {10.1016/j.tcs.2023.113710},
}
@article{ChanLPSS2015,
author = {M. Changat and
D. Sindhu Lekha and
I. Peterin and
A. R. Subhamathi and
S. Spacapan},
title = {The median game},
journal = dopt,
volume = {17},
pages = {80--88},
year = {2015},
}
@Article{Chaetal2007a,
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{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{ChaCCKLP2013,
author = {M. Chapelle and
M. Cochefert and
J.{-}F. Couturier and
D. Kratsch and
M. Liedloff and
A. Perez},
title = {Exact Algorithms for Weak {R}oman Domination},
booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA}},
pages = {81--93},
editor = {T. Lecroq and
L. Mouchard},
series = {LNCS},
volume = {8288},
publisher = {Springer},
year = {2013},
}
@article{ChaCKLL2017,
author = {M. Chapelle and
M. Cochefert and
D. Kratsch and
R. Letourneur and
M. Liedloff},
title = {Exact exponential algorithms to find tropical connected sets of minimum
size},
journal = tcs,
volume = {676},
pages = {33--41},
year = {2017},
}
@article{ChaLTV2017,
author = {M. Chapelle and
M. Liedloff and
I. Todinca and
Y. Villanger},
title = {Treewidth and Pathwidth parameterized by the vertex cover number},
journal = dam,
volume = {216},
pages = {114--129},
year = {2017},
}
@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 = arscomb,
volume = {88},
year = {2008},
}
@article{ChaSta2014,
author = {S. Chaplick and
J. Stacho},
title = {The vertex leafage of chordal graphs},
journal = dam,
volume = {168},
pages = {14--25},
year = {2014},
}
@article{ChaGGKL2016,
author = {S. Chaplick and
G. Gu\'spiel and
G. Gutowski and
T. Krawczyk and G. Liotta},
title = {The Partial Visibility Representation Extension
Problem},
journal = {CoRR},
volume = {abs/1512.00174},
year = {2016},
}
@inproceedings{ChaGGKL2016a,
author = {S. Chaplick and
G. Gu\'spiel and
G. Gutowski and
T. Krawczyk and G. Liotta},
title = {The Partial Visibility Representation Extension Problem},
booktitle = {Graph Drawing and Network Visualization - 24th International Symposium,
{GD}},
pages = {266--279},
year = {2016},
editor = {Y. Hu and
M. N{\"{o}}llenburg},
series = {LNCS},
volume = {9801},
publisher = {Springer},
}
@article{ChaLPW2016,
author = {S. Chaplick and
F. Lipp and
J.{-}W. Park and
A. Wolff},
title = {Obstructing Visibilities with One Obstacle},
journal = {CoRR},
volume = {abs/1607.00278},
year = {2016},
}
@inproceedings{ChaLPW2016a,
author = {S. Chaplick and
F. Lipp and
J.{-}W. Park and
A. Wolff},
title = {Obstructing Visibilities with One Obstacle},
booktitle = {Graph Drawing and Network Visualization - 24th International Symposium,
{GD}},
pages = {295--308},
year = {2016},
editor = {Y. Hu and
M. N{\"{o}}llenburg},
series = {LNCS},
volume = {9801},
publisher = {Springer},
}
@article{ChaGGKL2018,
author = {S. Chaplick and
G. Gu\'spiel and
G. Gutowski and
T. Krawczyk and G. Liotta},
title = {The Partial Visibility Representation Extension Problem},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2286--2323},
year = {2018},
}
@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},
}
@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 =ieeetoit,
volume = {51},
number = {7},
year = {2005},
pages = {2554--2576},
}
@inproceedings{ChaNaaWir2016,
author = {M. Charikar and
Y. Naamad and
A. Wirth},
title = {On Approximating Target Set Selection},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM}},
pages = {4:1--4:16},
editor = {K. Jansen and
C. Mathieu and
J.~D.~P. Rolim and
C. Umans},
series = {LIPIcs},
volume = {60},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2016},
}
@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{ChaHudLob2007,
author = {I. Charon and
O. Hudry and
A. Lobstein},
title = {Extremal cardinalities for identifying and locating-dominating
codes in graphs},
journal = dm,
volume = {307},
number = {3-5},
year = {2007},
pages = {356--366},
}
@InProceedings{ChaMor2018,
author ={B. Charron-Bost and S. Moran},
title ={The Firing Squad Problem Revisited},
booktitle ={35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages ={20:1--20:14},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2018},
volume ={96},
editor ={R. Niedermeier and B. Vall{\'e}e},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@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{ChaZha2023,
author = {G. Chartrand and P. Zhang},
title = {A chessboard problem and irregular domination},
journal = {Bulletin of the Institute of Combinatorics and its Applications},
volume = {98},
year = {2023},
pages = {43--59},
}
@article{ChaWol2019,
author = {G. Charwat and
S. Woltran},
title = {Expansion-based {QBF} Solving on Tree Decompositions},
journal = fundinform,
volume = {167},
number = {1-2},
pages = {59--92},
year = {2019},
}
@ARTICLE{ChaVit2007,
AUTHOR = "N. Chater and P. Vit\'anyi",
TITLE = "'{I}deal learning' of natural language: Positive results about learning from positive evidence",
JOURNAL = {Journal of Mathematical Psychology},
YEAR = 2007,
month = "",
volume = 51,
number = "",
pages = "135--163",
copy = ""
}
@inproceedings{ChaDoy2016,
author = {K. Chatterjee and
L. Doyen},
title = {Computation Tree Logic for Synchronization Properties},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP}},
pages = {98:1--98:14},
editor = {I. Chatzigiannakis and
M. Mitzenmacher and
Y. Rabani and
D. Sangiorgi},
series = {LIPIcs},
volume = {55},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
}
@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}
}
@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",
}
@inproceedings{CheLRSTW2014,
author = {S. Chechik and
D.~H. Larkin and
L. Roditty and
G. Schoenebeck and
R.~E. Tarjan and
V.~V. Williams},
title = {Better Approximation Algorithms for the Graph Diameter},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA}},
pages = {1041--1052},
year = {2014},
editor = {C. Chekuri},
publisher = {{SIAM}},
}
@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},
}
@INPROCEEDINGS{CheKanTay91,
AUTHOR = "P. Cheeseman and B. Kanefsky and W. Taylor",
TITLE = "Where the really hard problems are",
BOOKTITLE = "Proc. 12th Intern. Joint Conf. Artificial Intelligence",
YEAR = 1991,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "331--337",
address = "",
organization = "",
copy = ""
}
@ARTICLE{Cheetal2003,
AUTHOR = "J. Cheetham and F. Dehne and A. Rau-Chaplin and U. Stege and P. J. Taillon",
TITLE = "Solving large {FPT} problems on coarse-grained parallel machines",
JOURNAL = jcss,
YEAR = 2003,
month = "",
volume = 67,
number = "",
pages = "691--706",
copy = ""
}
@inproceedings{Cheetal2003a,
AUTHOR = "J. Cheetham and F. Dehne and A. Rau-Chaplin and U. Stege and P. J. Taillon",
title = {A Parallel {FPT} Application For Clusters},
booktitle = {CCGRID},
year = {2003},
pages = {70-77},
crossref = {ccgrid2003},
}
@proceedings{ccgrid2003,
title = {3rd IEEE International Symposium on Cluster Computing and
the Grid CCGrid 2003},
booktitle = {CCGRID},
publisher = {IEEE Computer Society},
year = {2003},
}
@INPROCEEDINGS{CheKha03,
AUTHOR = "C. Chekuri and S. Khanna",
TITLE = "Edge Disjoint Paths Revisited",
BOOKTITLE = "SODA 2003",
YEAR = 2003,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "??",
address = "",
organization = "",
publisher = "",
copy = ""
}
@inproceedings{CheChu2013,
author = {C. Chekuri and
J. Chuzhoy},
editor = {D. Boneh and
T. Roughgarden and
J. Feigenbaum},
title = {Large-treewidth graph decompositions and applications},
booktitle = {Symposium on Theory of Computing Conference, STOC},
pages = {291--300},
publisher = {{ACM}},
year = {2013},
}
@InProceedings{CheChu2014,
author = {C. Chekuri and J. Chuzhoy},
title = {Polynomial Bounds for the Grid-Minor Theorem},
booktitle = {Proc. of the 46th Annual Symposium on the Theory of Computing (STOC)},
OPTcrossref = {},
OPTkey = {},
pages = {60--69},
year = {2014},
}
@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 Mathematica},
year = {2010},
OPTkey = {},
volume = {30},
OPTnumber = {},
pages = {249--254},
}
@Article{CheHayHed2016,
author = {Chellali, M. and Haynes, T.~W. and Hedetniemi, S.~T.},
title = {Lower bounds on the {R}oman and independent {R}oman domination numbers},
journal = {Applicable Analysis and Discrete Mathematics},
year = {2016},
volume = {10},
number = {1},
pages = {65--72},
}
@Article{CheHHHM2016,
author="Chellali, M.
and Haynes, T. W.
and Hedetniemi, S. M.
and Hedetniemi, S. T.
and McRae, A. A.",
title="A {R}oman Domination Chain",
journal="Graphs and Combinatorics",
year="2016",
volume="32",
number="1",
pages="79--92",
}
@article{CheMimSla2010,
AUTHOR = {Chellali, M. and Mimouni, M. and Volkmann,
P.},
TITLE = {On locating-domination in graphs},
JOURNAL = {Discussiones Mathematicae Graph Theory},
VOLUME = {30},
YEAR = {2010},
NUMBER = {2},
PAGES = {223--235},
}
@article{CheHHM2016,
author = {M. Chellali and
T. W. Haynes and
S. T. Hedetniemi and
A. A. McRae},
title = {Roman \{2\}-domination},
journal = dam,
volume = {204},
pages = {22--28},
year = {2016},
}
@article{CheRSV2020,
author = {M. Chellali and N. Jafari Rad and S. M. Sheikholeslami and L. Volkmann},
title = {Varieties of {R}oman domination {II}},
journal = {AKCE International Journal of Graphs and Combinatorics},
volume = {17},
number = {3},
pages = {966--984},
year = {2020},
}
@article{CheDen2009,
title = "On the complexity of {2D} discrete fixed point problem",
journal = tcs,
volume = "410",
number = "44",
pages = "4448--4456",
year = "2009",
author = "X. Chen and X. Deng"
}
@article{ChePVWZ2016,
author = {X. Chen and
M. J. P{\'{e}}rez{-}Jim{\'{e}}nez and
L. Valencia{-}Cabrera and
B. Wang and
X. Zeng},
title = {Computing with viruses},
journal = tcs,
volume = {623},
pages = {146--159},
year = {2016},
}
@inproceedings{Che96,
author = {Z.{-}Z. Chen},
title = {Practical Approximation Schemes for Maximum Induced-Subgraph Problems
on {$K_{3, 3}$}-free or {$K_5$}-free Graphs},
booktitle = {Automata, Languages and Programming, 23rd International Colloquium,
ICALP},
pages = {268--279},
editor = {F. Meyer auf der Heide and
B. Monien},
series = {LNCS},
volume = {1099},
publisher = {Springer},
year = {1996},
}
@article{CheChaCha97,
author = {C. Chen and
C.{-}C. Chang and
G. J. Chang},
title = {Proper interval graphs and the guard problem},
journal = dm,
volume = {170},
number = {1-3},
pages = {223--230},
year = {1997},
}
@article{CheHsuCha2010,
author = {K.{-}Y. Chen and
P.{-}H. Hsu and
K.{-}M. Chao},
title = {Hardness of comparing two run-length encoded strings},
journal = {Journal of Complexity},
volume = {26},
number = {4},
pages = {364--374},
year = {2010},
}
@InProceedings{CheGriPap98,
author = "Z.-Z. Chen and M. Grigni and C. Papadimitriou",
title = "Planar map graphs",
pages = "514--523",
booktitle = "Proceedings of the 30th Annual {ACM} Symposium on
Theory of Computing, {STOC}",
publisher = "ACM Press",
address = "New York",
year = "1998",
}
@article{Che98,
author = {Z.{-}Z. Chen},
title = {Efficient Approximation Schemes for Maximization Problems on {$K_{3, 3}$}-free or {$K_5$}-free Graphs},
journal = jalg,
volume = {26},
number = {1},
pages = {166--187},
year = {1998},
}
@article{CheLinWan2011,
author = {Z.{-}Z. Chen and
G. Lin and
L. Wang},
title = {An Approximation Algorithm for the Minimum Co-Path Set Problem},
journal = alg,
volume = {60},
number = {4},
pages = {969--986},
year = {2011},
}
@inproceedings{CheLLW2013,
author = {D.~Z. Chen and
J. Li and
H. Liang and
H. Wang},
title = {Matroid and Knapsack Center Problems},
booktitle = {Integer Programming and Combinatorial Optimization - 16th International
Conference, {IPCO}},
pages = {110--122},
year = {2013},
editor = {M. X. Goemans and
J. R. Correa},
series = {LNCS},
volume = {7801},
publisher = {Springer},
}
@Article{CheLLW2016,
author = {D.~Z. Chen and
J. Li and
H. Liang and
H. Wang},
title = {Matroid and Knapsack Center Problems},
journal =alg,
year = {2016},
volume = {75},
OPTnumber = {},
pages = {27--52},
}
@article{CheCoxMis91,
author = {J. Chen and
J.Cox and
B. Mishra},
title = {An {NL} Hierarchy},
journal = ipl,
volume = {39},
number = {1},
pages = {21--26},
year = {1991},
}
@article{CheGro93,
author = {J. Chen and
J.~L. Gross},
title = {Kuratowski-Type Theorems for Average Genus},
journal = jcthb,
volume = {57},
number = {1},
pages = {100--121},
year = {1993},
}
@article{CheGroRie94,
author = {J. Chen and
J.~L. Gross and
R.~G. Rieper},
title = {Overlap matrices and total imbedding distributions},
journal = dm,
volume = {128},
number = {1-3},
pages = {73--94},
year = {1994},
}
@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},
}
@article{CheLamShi2009,
author = {Z.-H. Chen and
P. C. B. Lam and
W.-C. Shiu},
title = {Collapsible graphs and reductions of line graphs},
journal = dm,
volume = {309},
number = {10},
year = {2009},
pages = {3173--3184},
}
@Article{CheBanVijSha2006,
author = {Chen, J. and Bangalore, S. and Vijay-Shanker, K.},
title = {Automated extraction of tree-adjoining grammars from treebanks},
journal = {Natural Language Engineering},
year = {2006},
volume = {12},
pages = {251--299},
}
@article{CheMRZ2004,
author = {N. Chen and
J. Meng and
J. Rong and
H. Zhu},
title = {Approximation for Dominating Set Problem with Measure Functions},
journal = caai,
volume = {23},
number = {1},
year = {2004},
pages = {37--49},
}
@ARTICLE{Cheetal2000,
AUTHOR = "J. Chen and L. Liu and W. Jia",
TITLE = "Improvement for {\sc vertex cover} on low-degree graphs",
JOURNAL = {Networks},
YEAR = 2000,
month = "",
volume = 35,
number = "",
pages = "253--259",
copy = ""
}
@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 = ""
}
@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{Cheetal2004,
author = {J. Chen and X. Huang and I. A. Kanj and G. Xia},
title = {Linear {FPT} reductions and computational lower bounds},
booktitle = {Proceedings of the 36th Annual ACM Symposium on Theory of Computing STOC},
year = {2004},
pages = {212--221},
publisher = {ACM Press},
}
@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,
pages = "150--160",
organization = "IEEE",
}
@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 {W}[3] and {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},
}
@article{CheHKX2006,
author = {J. Chen and
X. Huang and
I.~A. Kanj and
Ge Xia},
title = {On the computational hardness based on linear {FPT}-reductions},
journal = joco,
volume = {11},
number = {2},
year = {2006},
pages = {231--247},
}
@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 I.~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},
}
@article{CheHKX2007,
author = {J. Chen and
X. Huang and
I.~A. Kanj and
Ge Xia},
title = {Polynomial time approximation schemes and parameterized
complexity},
journal = dam,
volume = {155},
number = {2},
year = {2007},
pages = {180--193},
}
@incollection{Che2008,
author = {J. Chen},
title = {Vertex Cover Kernelization},
booktitle = {Encyclopedia of Algorithms},
year = {2008},
editor = {M.{-}Y. Kao},
publisher = {Springer}
}
@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{Cheetal2008d,
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},
journal = jacm,
volume = {55},
number = {5},
pages = {21:1--21:19},
year = {2008},
}
@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{CheKanXia2009,
author = {J. Chen and
I. A. Kanj and
Ge Xia},
title = {On parameterized exponential time complexity},
journal = tcs,
year = {2009},
volume = {410},
number = {27-29},
pages = {2641--2648},
}
@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",
}
@article{CheZenLu2012,
author = {L. Chen and
W. Zeng and
C. Lu},
title = {{NP}-completeness and {APX}-completeness of restrained domination in graphs},
journal = tcs,
volume = {448},
pages = {1--8},
year = {2012},
}
@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.~T. Nguyen and
P. Raghavendra and
A. Rudra and
G. Singh},
title = {Improved Approximation Algorithms for the Spanning Star
Forest Problem},
journal = alg,
volume = {65},
number = {3},
year = {2013},
pages = {498--516},
ee = {http://dx.doi.org/10.1007/s00453-011-9607-1},
}
@inproceedings{CheFNT2015,
author = {J. Chen and
P. Faliszewski and
R. Niedermeier and
N. Talmon},
title = {Elections with Few Voters: Candidate Control Can Be Easy},
booktitle = {Proceedings of the Twenty-Ninth {AAAI} Conference on Artificial Intelligence},
pages = {2045--2051},
year = {2015},
editor = {B. Bonet and
S. Koenig},
publisher = {{AAAI} Press},
}
@inproceedings{CheCDFHNPPSWZ2021,
author = {J. Chen and
W. Czerwinski and
Y. Disser and
A. E. Feldmann and
D. Hermelin and
W. Nadara and
M. Pilipczuk and
M. Pilipczuk and
M. Sorge and
B. Wr{\'{o}}blewski and
A. Zych{-}Pawlewicz},
editor = {D. Marx},
title = {Efficient fully dynamic elimination forests with applications to detecting
long paths and cycles},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA}},
pages = {796--809},
publisher = {{SIAM}},
year = {2021},
ydoi = {10.1137/1.9781611976465.50},
}
@article{CheXuWan2017,
author = {J. Chen and
C. Xu and
J. Wang},
title = {Dealing with 4-variables by resolution: An improved {MaxSAT} algorithm},
journal = tcs,
volume = {670},
pages = {33--44},
year = {2017},
}
@article{CheSoh2019,
author = {X.-G. Chen and
M. Y. Sohn},
title = {Strong {R}oman Domination in Grid Graphs},
journal = {Kyungpook Mathematical Journal},
volume = {59},
pages = {515--523},
year = {2019},
}
@article{CheSoh2019a,
author = {X.-G. Chen and
M. Y. Sohn},
title = {Trees with equal strong {R}oman domination number and {R}oman domination number},
journal = {Bull. Korean Math. Soc.},
volume = {56}, number = 1,
pages = {31--44},
year = {2019},
}
@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 = ""
}
@inproceedings{CheFlu2003a,
AUTHOR = "Y. Chen and J. Flum",
title = {Bounded Nondeterminism and Alternation in Parameterized Complexity
Theory},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity, CCC},
pages = {13--29},
publisher = {{IEEE} Computer Society},
year = {2003},
ydoi = {10.1109/CCC.2003.1214407},
}
@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",
}
@article{CheFluGro2005,
AUTHOR = "Y. Chen and J. Flum and
M. Grohe",
title = {Machine-based methods in parameterized complexity theory},
journal = tcs,
volume = {339},
number = {2-3},
year = {2005},
pages = {167--199},
}
@article{CheFlu2006,
author = {Y. Chen and
J. Flum},
title = {On miniaturized problems in parameterized complexity theory},
journal = tcs,
volume = {351},
number = {3},
year = {2006},
pages = {314--336},
}
@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{CheFluGro2007,
AUTHOR = "Y. Chen and J. Flum and
M. Grohe",
title = {An analysis of the {$W^*$}-hierarchy},
journal = {The Journal of Symbolic Logic},
volume = {72},
number = {2},
pages = {513--534},
year = {2007},
ydoi = {10.2178/jsl/1185803622},
}
@inproceedings{CheFlu2007,
author = {Y. Chen and
J. Flum},
title = {On Parameterized Path and Chordless Path Problems},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity, CCC},
pages = {250--263},
publisher = {{IEEE} Computer Society},
year = {2007},
ydoi = {10.1109/CCC.2007.21},
}
@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},
}
@article{CheGro2007,
author = {Y. Chen and
M. Grohe},
title = {An Isomorphism Between Subexponential and Parameterized
Complexity Theory},
journal = siam,
volume = {37},
number = {4},
year = {2007},
pages = {1228--1258},
}
@article{CheFlu2009,
author = {Y. Chen and
J. Flum},
title = {Subexponential Time and Fixed-parameter Tractability: Exploiting
the Miniaturization Mapping},
journal = {J. Log. Comput.},
volume = {19},
number = {1},
year = {2009},
pages = {89--122},
}
@inproceedings{CheFlu2010,
author = {Y. Chen and
J. Flum},
title = {A Logic for {PTIME} and a Parameterized Halting Problem},
booktitle = {Fields of Logic and Computation; Essays Dedicated to Yuri
Gurevich on the Occasion of His 70th Birthday},
year = {2010},
pages = {251--276},
editor = {A. Blass and
N. Dershowitz and
W. Reisig},
publisher = {Springer},
series = {LNCS},
volume = {6300},
}
@article{CheFluMul2011,
author = {Y. Chen and
J. Flum and
M. M{\"u}ller},
title = {Lower Bounds for Kernelizations and Other Preprocessing
Procedures},
journal = tocs,
volume = {48},
number = {4},
year = {2011},
pages = {803--839},
}
@inproceedings{CheFlu2012,
author = {Y. Chen and
J. Flum},
title = {A Parameterized Halting Problem},
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},
}
@article{CheFlu2012a,
author = {Y. Chen and
J. Flum},
title = {From Almost Optimal Algorithms to Logics for Complexity
Classes via Listings and a Halting Problem},
journal = jacm,
volume = {59},
number = {4},
year = {2012},
pages = {17},
}
@inproceedings{CheLin2016,
author = {Y. Chen and
B. Lin},
title = {The Constant Inapproximability of the Parameterized Dominating Set
Problem},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}},
pages = {505--514},
year = {2016},
editor = {I. Dinur},
}
@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},
}
@article{CheLou97,
title = "Necklaces, {MSS} Sequences, and {DNA} Sequences",
journal = "Advances in Applied Mathematics",
volume = "18",
number = "1",
pages = "18--32",
year = "1997",
author = "W.~Y.~C. Chen and J.~D. Louck",
}
@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{Che2006,
author = {Z. Chen},
title = {On integral sum graphs},
journal = dm,
volume = {306},
number = {1},
pages = {19--25},
year = {2006},
}
@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{CheLjuRag2010,
author = {S. Chen and I. Ljubic and S. Raghavan},
title = {The regenerator location problem},
journal = {Networks},
year = {2010},
OPTkey = {},
volume = {55},
number = {3},
pages = {205--220},
}
@inproceedings{CheFCTW2009,
author = {Yu{-}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}},
pages = {31--45},
editor = {S. Kowalewski and
A. Philippou},
series = {LNCS},
volume = {5505},
publisher = {Springer},
year = {2009},
}
@article{CheHuWan2016,
author = {X. Chen and
X.{-}D. Hu and
C. Wang},
title = {Approximation for the minimum cost doubly resolving set problem},
journal = tcs,
volume = {609},
pages = {526--543},
year = {2016}
}
@Article{CheHGW2018,
author="Chen, Z.-Z. and Harada, Y. and Guo, F. and Wang, L.",
title="An approximation algorithm for maximum internal spanning tree",
journal=joco,
year="2018",
volume="35",
number="3",
pages="955--979",
}
@inproceedings{CheWan2012,
author = {Y.{-}F. Chen and
B.{-}Y. Wang},
title = {Learning {B}oolean Functions Incrementally},
booktitle = {Computer Aided Verification - 24th International Conference, {CAV}},
pages = {55--70},
year = {2012},
editor = {P. Madhusudan and
S.~A. Seshia},
series = {LNCS},
volume = {7358},
publisher = {Springer},
}
@inproceedings{CheWan2013,
author = {Y.{-}F. Chen and
B.{-}Y. Wang},
title = {{BULL:} {A} Library for Learning Algorithms of Boolean Functions},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
- 19th International Conference, {TACAS}},
pages = {537--542},
year = {2013},
editor = {N. Piterman and
S.~A. Smolka},
series = {LNCS},
volume = {7795},
publisher = {Springer},
}
@article{CheWu2001,
author = {C. Chen and
K. Wu},
title = {Disproving a conjecture on planar visibility graphs},
journal = tcs,
volume = {255},
number = {1-2},
pages = {659--665},
year = {2001},
}
@article{CheRRV2018,
author = {Li{-}H. Chen and
F. Reidl and
P. Rossmanith and
F. S. Villaamil},
title = {Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming},
journal = {Algorithms},
volume = {11},
number = {7},
pages = {98},
year = {2018},
}
@article{CheYan2019,
title = "A context-free grammar for the {R}amanujan-{S}hor polynomials",
journal = "Advances in Applied Mathematics",
pages = "101908",
year = "2019",
author = "W.~Y.~C. Chen and H.~R.~L. Yang",
doi = {10.1016/j.aam.2019.04.005}
}
@article{CheFSWY2019,
author = {J. Chen and
H. Fernau and
P. Shaw and
J. Wang and
Z. Yang},
title = "Kernels for packing and covering problems",
journal = tcs,
volume = "790",
pages = "152--166",
year = "2019"
}
@article{CheHu2017,
title = "Context-free grammars for permutations and increasing trees",
journal = "Advances in Applied Mathematics",
volume = "82",
pages = "58--82",
year = "2017",
author = "W.~Y.~C. Chen and A.~M. Fu",
}
@inproceedings{CheCRS2023,
author = {J. Chen and
G. Cs{\'{a}}ji and
S. Roy and
S. Simola},
editor = {N. Agmon and
B. An and
A. Ricci and
W. Yeoh},
title = {Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open
Questions and Fine-Grained Complexity},
booktitle = {Proceedings of the 2023 International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS}},
pages = {251--259},
publisher = {{ACM}},
year = {2023},
ydoi = {10.5555/3545946.3598644},
}
@article{CheKLPGS2023,
author = {L. Chen and
R. Kyng and
Y. P. Liu and
R. Peng and
M. Probst Gutenberg and
S. Sachdeva},
title = {Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow},
journal = cacm,
volume = {66},
number = {12},
pages = {85--92},
year = {2023},
}
@inproceedings{Che2023,
title={How Social Media Can Solve the Problem of “Filter Bubbles”
Under the {NewMedia} Algorithm Recommendation Mechanism the Example of {T}ik {T}ok},
author={S. Chen},
year={2023},
booktitle={Proceedings of the 2023 2nd International Conference on Social Sciences and Humanities and Arts (SSHA 2023)},
pages={1284--1288},
ydoi={10.2991/978-2-38476-062-6_165},
publisher={Atlantis Press}
}
@article{Che87,
author = {C.-K. Cheng},
title = {Linear placement algorithm and applications to {VLSI} design},
journal = {Networks},
volume = {17},
number = {4},
year = {1987},
pages = {439--464},
}
@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",
}
@article{CheKLS2012,
author = {S.{-}W. Cheng and
C. Knauer and
S. Langerman and
M. H. M. Smid},
title = {Approximating the average stretch factor of geometric graphs},
journal = {Journal of Computational Geometry},
volume = {3},
number = {1},
pages = {132--153},
year = {2012},
ydoi = {10.20382/jocg.v3i1a7},
}
@article{CheLabRat2021,
author = {V. Chepoi and
A. Labourel and
S. Ratel},
title = {Distance and Routing Labeling Schemes for Cube-Free Median Graphs},
journal = alg,
volume = {83},
number = {1},
pages = {252--296},
year = {2021},
}
@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 = {}
}
@Article{Che2016,
author="Cherlin, G.",
title="On the relational complexity of a finite permutation group",
journal="Journal of Algebraic Combinatorics",
year="2016",
month="Mar",
day="01",
volume="43",
number="2",
pages="339--374",
}
@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 = ""
}
@article{CheCPP2006,
author = {A. Cherubini and
S. Crespi{-}Reghizzi and
M. Pradella and
P. San Pietro},
title = {Picture languages: Tiling systems versus tile rewriting grammars},
journal = tcs,
volume = {356},
number = {1-2},
pages = {90--103},
year = {2006},
}
@inproceedings{CheDonWir2013,
author = {A. Chester and
R. Dondi and
A. Wirth},
title = {Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs},
editor = {T.{-}H. Hubert Chan and
L. C. Lau and
L. Trevisan},
title = {Theory and Applications of Models of Computation, 10th International
Conference, {TAMC}},
series = {LNCS},
volume = {7876},
pages = {260--271},
publisher = {Springer},
year = {2013}
}
@article{CheFHJ90,
author = {G.~A. Cheston and
G. Fricke and
S.~T. Hedetniemi and
D.~P. Jacobs},
title = {On the computational complexity of upper fractional domination},
journal = dam,
volume = {27},
number = {3},
pages = {195--207},
year = {1990},
}
@article{CheHLS2000,
author = {G.~A. Cheston and
S.~T. Hedetniemi and
A.~L. Liestman and
J.~B. Stehman},
title = {The even adjacency split problem for graphs},
journal = dam,
volume = {102},
number = {3},
pages = {175--188},
year = {2000},
}
@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},
}
@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{Che86,
author = {P. Chew},
editor = {A. Aggarwal},
title = {There is a Planar Graph Almost as Good as the Complete Graph},
booktitle = {Proceedings of the Second Annual {ACM} {SIGACT/SIGGRAPH} Symposium
on Computational Geometry, SoCG},
pages = {169--177},
publisher = {{ACM}},
year = {1986},
doi = {10.1145/10515.10534},
}
@article{Che97,
author = {K. H. Chew},
title = {On {V}izing's theorem, adjacency lemma and fan argument generalized
to multigraphs},
journal = dm,
volume = {171},
number = {1-3},
pages = {283--286},
year = {1997},
}
@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{ChiGer98,
author = {Chi, Z. and Geman, S.},
title = {Estimation of Probabilistic Context-free Grammars},
journal = {Computational Linguistics},
volume = {24},
number = {2},
month = jun,
year = {1998},
pages = {299--305},
}
@article{ChiHLWY2013,
author = {C.-Y. Chiang and
L.-H. Huang and
Bo-Jr Li and
J. Wu and
H.-G. Yeh},
title = {Some results on the target set selection problem},
journal = joco,
volume = {25},
number = {4},
year = {2013},
pages = {702--715},
}
@article{ChiJosSea2006,
author = {D. Chiang and
A.~K. Joshi and
D.~B. Searls},
title = {Grammatical Representations of Macromolecular Structure},
journal = {Journal of Computational Biology},
volume = {13},
number = {5},
year = {2006},
pages = {1077--1100},
}
@article{ChiJosDil2006,
author = {D. Chiang and
A.~K. Joshi and
K.~A. Dill},
title = {A Grammatical Theory for the Conformational Changes of Simple
Helix Bundles},
journal = {Journal of Computational Biology},
volume = {13},
number = {1},
year = {2006},
pages = {21--42},
}
@article{Chi2007,
author = {D. Chiang},
title = {Hierarchical Phrase-Based Translation},
journal = {Computational Linguistics},
volume = {33},
number = {2},
year = {2007},
pages = {201--228},
}
@inproceedings{Chi2010,
author = {D. Chiang},
title = {Learning to Translate with Source and Target Syntax},
booktitle = {ACL 2010, Proceedings of the 48th Annual Meeting of the
Association for Computational Linguistics},
year = {2010},
pages = {1443--1452},
editor = {J. Hajic and
S. Carberry and
S. Clark},
publisher = {The Association for Computer Linguistics},
}
@inproceedings{ChiGKPR2010,
author = {D. Chiang and
J. Graehl and
K. Knight and
A. Pauls and
S. Ravi},
title = {Bayesian Inference for Finite-State Transducers},
booktitle = {Human Language Technologies: Conference of the North American
Chapter of the Association of Computational Linguistics, HLT-NAACL},
year = {2010},
pages = {447--455},
publisher = {The Association for Computational Linguistics},
}
@inproceedings{ChiWhaDhi2012,
author = {K.{-}Y. Chiang and
J.~J. Whang and
I.~S. Dhillon},
editor = {X.{-}w. Chen and
G. Lebanon and
H. Wang and
M.~J. Zaki},
title = {Scalable clustering of signed networks using balance normalized cut},
booktitle = {21st {ACM} International Conference on Information and Knowledge Management,
CIKM},
pages = {615--624},
publisher = {{ACM}},
year = {2012},
ydoi = {10.1145/2396761.2396841},
}
@article{ChiHNDT2014,
author = {K.{-}Y. Chiang and
C.{-}J. Hsieh and
N. Natarajan and
I.~S. Dhillon and
A. Tewari},
title = {Prediction and clustering in signed networks: a local to global perspective},
journal = {Journal of Machine Learning Research},
volume = {15},
number = {1},
pages = {1177--1213},
year = {2014},
ydoi = {10.5555/2627435.2638573},
}
@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{ChiKLMPR2009,
author = {Chierichetti, F. and Kumar, R. and Lattanzi, S. and Mitzenmacher, M. and Panconesi, A. and Raghavan, P.},
title = {On Compressing Social Networks},
booktitle = {Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD},
year = {2009},
pages = {219--228},
publisher = {ACM},
}
@article{ChiFazYam2016,
author = {H. Chigahara and
S. Z. Fazekas and
A. Yamamura},
title = {One-Way Jumping Finite Automata},
journal = ijfcs,
volume = {27},
number = {3},
pages = {391},
year = {2016},
}
@INPROCEEDINGS{ChiGutMut2006,
AUTHOR = "M. Chimani and C. Gutwenger and P. Mutzel",
TITLE = "Experiments on exact crossing minimization using column generation",
BOOKTITLE = "Workshop on Experimental Algorithms WEA",
YEAR = 2006,
month = "",
volume = "4007",
editor = "C. \`Alvarez and M. Serna",
series = "LNCS",
chapter = "",
pages = "303--315",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@inproceedings{ChiJunSch2008,
author = {M. Chimani and
M. J{\"{u}}nger and
M. Schulz},
title = {Crossing Minimization meets Simultaneous Drawing},
booktitle = {{IEEE} {VGTC} Pacific Visualization Symposium 2008, PacificVis},
pages = {33--40},
year = {2008},
publisher = {{IEEE} Computer Society},
}
@article{ChiGutMut2009,
AUTHOR = "M. Chimani and C. Gutwenger and P. Mutzel",
title = {Experiments on exact crossing minimization using column
generation},
journal = {ACM Journal of Experimental Algorithmics},
volume = {14}, number={3.4}
}
@inproceedings{ChiZer2012,
author = {M. Chimani and
R. Zeranski},
title = {Upward Planarity Testing via {SAT}},
booktitle = {Graph Drawing --- 20th International Symposium, GD 2012},
pages = {248--259},
editor = {W. Didimo and
M. Patrignani},
publisher = {Springer},
series = {LNCS},
volume = {7704},
year = {2013},
}
@article{ChiHJM2011,
author = {M. Chimani and
P. Hungerl{\"{a}}nder and
M. J{\"{u}}nger and
P. Mutzel},
title = {An {SDP} approach to multi-level crossing minimization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2011},
}
@inproceedings{ChiHli2016,
author = {M. Chimani and
P. Hlinen{\'{y}}},
title = {Inserting Multiple Edges into a Planar Graph},
booktitle = {32nd International Symposium on Computational Geometry, SoCG},
pages = {30:1--30:15},
year = {2016},
editor = {S.~P. Fekete and
A. Lubiw},
series = {LIPIcs},
volume = {51},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
}
@article{ChiHli2017,
author = {M. Chimani and
P. Hlinen{\'{y}}},
title = {A tighter insertion-based approximation of the crossing number},
journal = joco,
volume = {33},
number = {4},
pages = {1183--1225},
year = {2017},
}
@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{ChiDFZ2004,
author = {F.~Y.~L. Chin and
X. Deng and
Q. Fang and
S. Zhu},
title = {Approximate and dynamic rank aggregation},
journal = tcs,
volume = {325},
number = {3},
pages = {409--424},
year = {2004},
}
@article{ChiLeuYiu2013,
author = {F.~Y.~L. Chin and
H.~C.~M. Leung and
S.{-}M. Yiu},
title = {Non-adaptive complex group testing with multiple positive sets},
journal = tcs,
volume = {505},
pages = {11--18},
year = {2013},
}
@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},
}
@article{ChiDIKS2012,
author = {E. Chiniforooshan and
M. Daley and
O.~H. Ibarra and
L. Kari and
S. Seki},
title = {One-reversal counter machines and multihead automata: Revisited},
journal = tcs,
volume = {454},
pages = {81--87},
year = {2012},
}
@article{ChiLiLi2006,
author = {R. Chirkova and
C. Li and
J. Li},
title = {Answering queries using materialized views with minimum
size},
journal = {VLDB Journal},
volume = {15},
number = {3},
year = {2006},
pages = {191--210},
}
@inproceedings{Chi2014,
author = {D. Chistikov},
title = {Notes on Counting with Finite Machines},
booktitle = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS}},
pages = {339--350},
editor = {V. Raman and
S. P. Suresh},
series = {LIPIcs},
volume = {29},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2014},
}
@InProceedings{ChiHaa2016,
author ={D. Chistikov and C. Haase},
title ={The Taming of the Semi-Linear Set},
booktitle ={43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
pages ={128:1--128:13},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2016},
volume ={55},
editor ={I. Chatzigiannakis and M. Mitzenmacher and Y. Rabani and D. Sangiorgi},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@inproceedings{ChiMarShi2016,
author = {D. Chistikov and
P. Martyugin and
M. Shirmohammadi},
title = {Synchronizing Automata over Nested Words},
booktitle = {Foundations of Software Science and Computation Structures - 19th
International Conference, {FOSSACS} 2016, Held as Part of the European
Joint Conferences on Theory and Practice of Software, {ETAPS} 2016},
pages = {252--268},
editor = {B. Jacobs and
C. L{\"{o}}ding},
series = {LNCS},
volume = {9634},
publisher = {Springer},
year = {2016},
}
@article{ChiHaaHal2018,
author = {D. Chistikov and
C. Haase and
S. Halfon},
title = {Context-free commutative grammars with integer counters and resets},
journal = tcs,
volume = {735},
pages = {147--161},
year = {2018},
}
@article{ChiMarShi2019,
author = {D. Chistikov and
P. Martyugin and
M. Shirmohammadi},
title = {Synchronizing Automata over Nested Words},
journal = jalc,
volume = {24},
number = {2-4},
pages = {219--251},
year = {2019},
}
@inproceedings{ChiRos2004,
author = {C. Chitic and
D. Rosu},
title = {On Validation of {XML} Streams Using Finite State Machines},
booktitle = {Proceedings of the Seventh International Workshop on the
Web and Databases, WebDB},
year = {2004},
pages = {85--90},
editor = {S. Amer-Yahia and
L. Gravano},
}
@inproceedings{ChiHajKor2013,
author = {R.~H. Chitnis and
M. Hajiaghayi and
G. Kortsarz},
title = {Fixed-Parameter and Approximation Algorithms: {A} New Look},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC}},
pages = {110--122},
editor = {G. Gutin and
S. Szeider},
series = {LNCS},
volume = {8246},
publisher = {Springer},
year = {2013},
}
@inproceedings{ChiFLMRS2013,
author = {R.~H. Chitnis and
F.~V. Fomin and
D. Lokshtanov and
P. Misra and
M.~S. Ramanujan and
S. Saurabh},
title = {Faster Exact Algorithms for Some Terminal Set Problems},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC}},
pages = {150--162},
editor = {G. Gutin and
S. Szeider},
series = {LNCS},
volume = {8246},
publisher = {Springer},
year = {2013},
}
@inproceedings{ChiFomGol2013,
author = {R.~H. Chitnis and
F.~V. Fomin and
P.~A. Golovach},
title = {Preventing Unraveling in Social Networks Gets Harder},
booktitle = {Proceedings of the Twenty-Seventh AAAI Conference on Artificial
Intelligence, AAAI},
editor = {M. desJardins and
M. L. Littman},
publisher = {AAAI Press},
year = {2013},
}
@article{ChiHajMar2013,
author = {R.~H. Chitnis and
M. Hajiaghayi and
D. Marx},
title = {Fixed-Parameter Tractability of Directed Multiway Cut Parameterized
by the Size of the Cutset},
journal = siam,
volume = {42},
number = {4},
year = {2013},
pages = {1674--1696},
}
@article{ChiCHM2015,
author = {R.~H. Chitnis and
M. Cygan and
M. T. Hajiaghayi and
D. Marx},
title = {Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable},
journal = acmtalg,
volume = {11},
number = {4},
pages = {28},
year = {2015},
}
@inproceedings{ChiCHM2015a,
author = {R.~H. Chitnis and
G. Cormode and
M.~T. Hajiaghayi and
M. Monemizadeh},
title = {Parameterized Streaming: Maximal Matching and Vertex Cover},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA}},
pages = {1234--1251},
year = {2015},
editor = {P. Indyk},
publisher = {{SIAM}},
}
@article{ChiPoo2016,
title = "An Analysis of Overlapping Community Detection Algorithms in Social Networks",
journal = "Procedia Computer Science",
volume = "89",
number = "",
pages = "349--358",
year = "2016",
author = "J. Chitra Devi and E. Poovammal",
}
@article{ChiPoo2016a,
title = "A Survey on Modularity based Overlapping Community
Detection Techniques in Social Networks",
journal = "International Journal of Information Processing",
volume = "10",
number = "3",
pages = "45--54",
year = "2016",
author = "J. Chitra Devi and E. Poovammal",
}
@article{ChiBSP2018,
author = {B. Chitturi and
S. Balachander and
S. Satheesh and
K. Puthiyoppil},
title = {Layered Graphs: Applications and Algorithms},
journal = {Algorithms},
volume = {11},
number = {7},
pages = {93},
year = {2018},
}
@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{ChlChl2006a,
author = {M. Chleb\'i{}k and J. Chleb\'i{}kov\'a},
title = {Complexity of approximating bounded variants of optimization problems},
journal = tcs,
volume = {354},
number = {3},
pages = {320--338},
year = {2006},
}
@article{ChlChl2007,
author = {M. Chleb\'i{}k and J. Chleb\'i{}kov\'a},
title = {Minimum {2SAT}-{DELETION}: Inapproximability results and relations to
Minimum Vertex Cover},
journal = dam,
year = {2007},
volume = {155},
number = {2},
pages = {172--179},
}
@article{ChlJan2007,
title = "The $d$-precoloring problem for $k$-degenerate graphs",
journal = dm,
volume = "307",
number = "16",
pages = "2042--2052",
year = "2007",
author = "J. Chleb\'i{}kov\'a and K. Jansen",
}
@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},
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},
year = {2008},
pages = {1264--1275},
}
@article{ChlChl2008b,
author = {M. Chleb\'i{}k and J. Chleb\'i{}kov\'a},
title = {The {S}teiner tree problem on graphs: Inapproximability results},
journal = tcs,
year = {2008},
volume = {406},
number = {3},
pages = {207--214},
}
@article{ChlCho2017,
author = {J. Chleb{\'{\i}}kov{\'{a}} and
M. Chopin},
title = {The firefighter problem: Further steps in understanding its complexity},
journal = tcs,
volume = {676},
pages = {42--51},
year = {2017},
}
@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 = ""
}
@inproceedings{ChmRom1011,
author = {K. Chmiel and
A. Roman},
title = {{COMPAS} - {A} Computing Package for Synchronization},
booktitle = {Implementation and Application of Automata - 15th International Conference,
{CIAA} 2010},
pages = {79--86},
editor = {M. Domaratzki and
K. Salomaa},
series = {LNCS},
year = {2011},
volume = {6482},
publisher = {Springer},
}
@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 = ""
}
@article{ChoHuy91,
author = {S. Cho and
D.~T. Huynh},
title = {Finite-Automaton Aperiodicity is {PSPACE}-Complete},
journal = tcs,
volume = {88},
number = {1},
pages = {99--116},
year = {1991},
}
@article{ChoHuy92,
author = {S. Cho and
D.~T. Huynh},
title = {The Parallel Complexity of Finite-State Automata Problems},
journal = ic,
volume = {97},
number = {1},
pages = {1--22},
year = {1992},
}
@article{ChoJSP93,
author = {H. Cho and
S.{-}W. Jeong and
F. Somenzi and
C. Pixley},
title = {Synchronizing sequences and symbolic traversal techniques in test
generation},
journal = {J. Electronic Testing},
volume = {4},
number = {1},
pages = {19--31},
year = {1993},
}
@article{ChoGHKPS2017,
author = {D.{-}J. Cho and
D. Goc and
Y.{-}S. Han and
S.{-}K. Ko and
A. Palioudakis and
K. Salomaa},
title = {State complexity of permutation on finite languages over a binary
alphabet},
journal = tcs,
volume = {682},
pages = {67--78},
year = {2017},
}
@inproceedings{ChoHKS2018,
author = {D.{-}J. Cho and
Y.{-}S. Han and
H. Kim and
K. Salomaa},
title = {Site-Directed Deletion},
pages = {219--230},
booktitle = {Developments in Language Theory - 22nd International Conference, {DLT}},
year = {2018},
editor = {M. Hoshi and
S. Seki},
series = {LNCS},
volume = {11088},
publisher = {Springer},
}
@INPROCEEDINGS{ChoKup02,
AUTHOR = "H. Chockler and O. Kupferman",
TITLE = "$\omega$-regular languages are testable with a constant number of queries",
BOOKTITLE = "Randomization and Approximation Techniques;
6th International Workshop, RANDOM 2002",
YEAR = 2002,
month = "",
volume = "2483",
editor = "J.~D.~P. Rolim and S. Vadhan",
series = "LNCS",
chapter = "",
pages = "26--38",
address = "",
organization = "",
publisher = "Springer",
copy = ""
}
@article{ChoCul83,
author = {C. Choffrut and
K. Cul{\'{\i}}k II},
title = {Properties of Finite and Pushdown Transducers},
journal = siam,
volume = {12},
number = {2},
pages = {300--315},
year = {1983},
}
@inproceedings{ChoCul84,
author = {C. Choffrut and
K. Cul{\'{\i}}k II},
editor = {M. Fontet and
K. Mehlhorn},
title = {On Extendibility of Unavoidable Sets},
booktitle = {{STACS}, Symposium of Theoretical Aspects of Computer Science},
series = {LNCS},
volume = {166},
pages = {326--338},
publisher = {Springer},
year = {1984},
}
@article{ChoCul84a,
author = {C. Choffrut and
K. Cul{\'{\i}}k II},
title = {On extendibility of unavoidable sets},
journal = dam,
volume = {9},
number = {2},
pages = {125--137},
year = {1984},
}
@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 = ""
}
@inproceedings{Cho2002,
author = {B. Choi},
editor = {M.~F. Fernandez and
Y. Papakonstantinou},
title = {What are real {DTD}s like?},
booktitle = {Proceedings of the Fifth International Workshop on the Web and Databases,
WebDB, in conjunction
with {ACM} {PODS/SIGMOD}},
pages = {43--48},
year = {2002},
}
@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 = ""
}
@ARTICLE{Cho56,
AUTHOR = "N. Chomsky",
journal={IRE Transactions on Information Theory},
title={Three models for the description of language},
year={1956},
volume={2},
number={3},
pages={113--124},
}
@article{ChoMil58,
AUTHOR = "N. Chomsky and G.~A. Miller",
title = "Finite state languages",
JOURNAL = icalt,
volume = "1",
pages = "91 -112",
year = "1958",
}
@ARTICLE{Cho59,
AUTHOR = "N. Chomsky",
TITLE = "On certain formal properties of grammars",
JOURNAL = icalt,
YEAR = 1959,
VOLUME = 2,
NUMBER = "",
PAGES = "137--167",
}
@article{Cho59a,
AUTHOR = "N. Chomsky",
title = "A note on phrase structure grammars",
journal = icalt,
volume = "2",
pages = "393--395",
year = "1959",
}
@incollection{ChoSch63,
AUTHOR = "N. Chomsky and M. P. Sch{\"u}tzenberger",
title = "The Algebraic Theory of Context-Free Languages",
editor = "P. Braffort and D. Hirschberg",
series = "Studies in Logic and the Foundations of Mathematics",
publisher = "Elsevier",
volume = "35 (Supplement C)",
pages = "118--161",
year = "1963",
booktitle = "Computer Programming and Formal Systems",
}
@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 = ""
}
@inproceedings{ChoNNW2012,
author = {M. Chopin and
A. Nichterlein and
R. Niedermeier and
M. Weller},
title = {Constant Thresholds Can Make Target Set Selection Tractable},
booktitle = {Design and Analysis of Algorithms --- First Mediterranean
Conference on Algorithms, MedAlg},
year = {2012},
pages = {120--133},
editor = {G. Even and
D. Rawitz},
publisher = {Springer},
series = {LNCS},
volume = {7659},
}
@PhdThesis{Cho2013,
author = {M. Chopin},
title = {Optimization problems with propagation in graphs:
Parameterized complexity and approximation},
school = {Universit\'e Paris-Dauphine, France},
year = {2013},
}
@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 = ""
}
@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{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 = ""
}
@inproceedings{ChoLavMos2011,
author = {Md. F. M. Chowdhury and
A. Lavelli and
A. Moschitti},
title = {A study on dependency tree kernels for automatic extraction of
protein-protein interaction},
pages = {124--133},
booktitle = {Proceedings of the
BioNLP 2011 Workshop},
publisher = {The Association for Computer Linguistics},
year = {2011},
}
@inproceedings{ChoLav2012,
author = {Md. F. M. Chowdhury and
A. Lavelli},
title = {Combining Tree Structures, Flat Features and Patterns for
Biomedical Relation Extraction},
pages = {420--429},
booktitle = {EACL 2012, 13th Conference of the European Chapter of the
Association for Computational Linguistics},
editor = {W. Daelemans and
M. Lapata and
L. M{\`a}rquez},
publisher = {The Association for Computer Linguistics},
year = {2012},
}
@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{ChrKnuLar2015,
author = {J. Christensen and
A.~N. Knudsen and
K.~S. Larsen},
title = {Soccer is Harder Than Football},
journal = ijfcs,
volume = {26},
number = {4},
pages = {477--486},
year = {2015},
}
@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 = {}
}
@article{Chr86,
title = "Finite automata and unary languages",
journal = tcs,
volume = "47",
pages = "149--158",
year = "1986",
author = "M. Chrobak",
}
@article{ChrLar91,
author = {M. Chrobak and
L.~L. Larmore},
title = {An Optimal On-Line Algorithm for $k$-Servers on Trees},
journal = siam,
volume = {20},
number = {1},
pages = {144--148},
year = {1991},
}
@inproceedings{ChuWPWZC2016,
author = {Chu, L. and Wang, Z. and Pei, J. and Wang, J. and Zhao, Z. and Chen, E.},
title = {Finding Gangs in War from Signed Networks},
year = {2016},
publisher = {ACM},
ydoi = {10.1145/2939672.2939855},
booktitle = {Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD},
pages = {1505-–1514},
numpages = {10},
}
@INPROCEEDINGS{ChuCLL2012,
author={C.~P. Chuang and G.~X. Chen and Y.~T. Liao and C.~C. Lin},
booktitle={2012 International Symposium on Computer, Consumer and Control},
title={A Lossless Color Image Compression Algorithm with Adaptive Arithmetic Coding Based on Adjacent Data Probability},
year={2012},
pages={141--145},
month={June},
publisher={{IEEE}}
}
@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},
}
@inbook{ChuSey2005,
series={London Mathematical Society Lecture Note Series},
volume = 327,
title={The structure of claw-free graphs},
DOI={10.1017/CBO9780511734885.008},
booktitle={Surveys in Combinatorics 2005},
publisher={Cambridge University Press},
author={Chudnovsky, M. and Seymour, P.},
editor={Webb, B.},
year={2005},
pages={153--172},
collection={London Mathematical Society Lecture Note Series}}
@article{ChuRST2006,
title = "The strong perfect graph theorem",
journal = annmath,
volume = "164",
number = "1",
pages = "51--229",
year = "2006",
author = "M. Chudnovsky and N. Robertson and P. Seymour and R. Thomas",
}
@article{ChuSey2008,
title = "Claw-free graphs. {IV}. {D}ecomposition theorem",
journal = jcthb,
volume = "98",
number = "5",
pages = "839--938",
year = "2008",
author = "M. Chudnovsky and P. Seymour",
}
@article{ChuSey2008a,
title = "Claw-free graphs. {V}. {G}lobal structure",
journal = jcthb,
volume = "98",
number = "6",
pages = "1373--1410",
year = "2008",
author = "M. Chudnovsky and P. Seymour",
}
@article{ChuSey2010,
title = "Claw-free graphs. {VI}. {C}olouring",
journal = jcthb,
volume = "100",
number = "6",
pages = "560--572",
year = "2010",
author = "M. Chudnovsky and P. Seymour",
}
@article{ChuSey2012,
title = "Claw-free graphs. {VII}. {Q}uasi-line graphs",
journal = jcthb,
volume = "102",
number = "6",
pages = "1267--1294",
year = "2012",
author = "M. Chudnovsky and P. Seymour",
}
@article{ChuFisGra80,
author = {F.~R.~K. Chung and
P.~C. Fishburn and
R.~L. Graham},
title = {On Unimodality for Linear Extensions of Partial Orders},
journal = {{SIAM} J. Matrix Analysis Applications},
volume = {1},
number = {4},
pages = {405--410},
year = {1980},
}
@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{ChuLeiRos87,
AUTHOR = "F.~R.~K. Chung and F. T. Leighton and A. L. Rosenberg",
TITLE = "Embedding graphs in books: a layout problem with applications to {VLSI} design",
JOURNAL = {SIAM J. Algebraic Discrete Methods},
YEAR = 1987,
month = "",
volume = 8,
number = "",
pages = "33--58",
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{ChuGTT90,
title = "The maximum number of edges in {$2K_2$}-free graphs of bounded degree",
journal = dm,
volume = "81",
number = "2",
pages = "129--135",
year = "1990",
author = "F.~R.~K. Chung and A. Gy\'arf\'as and Z. Tuza and W.~T. Trotter"
}
@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{Chv79,
author = {V. Chv{\'{a}}tal},
title = {A greedy heuristic for the set-covering problem},
journal = {Mathematics of Operations Research},
volume = {4},
number = {3},
pages = {233--235},
year = {1979},
}
@article{Chv83,
author = {V. Chv{\'{a}}tal},
title = {Mastermind},
journal = {Combinatorica},
volume = {3},
number = {3},
pages = {325--329},
year = {1983},
}
@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},
}
@article{ChvSla93,
title={A note on well-covered graphs},
author={Chv{\'a}tal, V. and Slater, P.~J.},
journal={Annals of Discrete Mathematics},
volume={55},
pages={179--181},
year={1993},
}
@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",
}
@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},
}
@article{CimRov2000,
title = {Conformant Planning via Symbolic Model Checking},
journal = {Journal of Artificial Intelligence Research},
volume = {13},
number = {1},
pages = {305--338},
year = {2000},
author = {A. Cimatti and M. Roveri},
}
@article{CimRovBer2004,
title = {Conformant planning via symbolic model checking and heuristic search},
journal = {Artificial Intelligence},
volume = {159},
number = {1},
pages = {127--206},
year = {2004},
author = {A. Cimatti and M. Roveri and P. Bertoli},
}
@article{CimMum2007,
author = {R.~J. Cimikowski and
B. Mumey},
title = {Approximating the fixed linear crossing number},
journal = dam,
volume = {155},
number = {17},
year = {2007},
pages = {2202--2210},
}
@inproceedings{CiobDieEld2015,
author = {L. Ciobanu and
V. Diekert and
M. Elder},
title = {Solution Sets for Equations over Free Groups are {EDT0L} Languages},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} {II}},
pages = {134--145},
year = {2015},
editor = {M. M. Halld{\'{o}}rsson and
K. Iwama and
N. Kobayashi and
B. Speckmann},
series = {LNCS},
volume = {9135},
publisher = {Springer},
}
@inproceedings{CioLog2021,
author = {L. Ciobanu and
A.~D. Logan},
editor = {N. Moreira and
R. Reis},
title = {Variations on the {P}ost {C}orrespondence {P}roblem for Free Groups},
booktitle = {Developments in Language Theory - 25th International Conference, {DLT}},
series = {LNCS},
volume = {12811},
pages = {90--102},
publisher = {Springer},
year = {2021},}
@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{ClaLap2009,
author = {A. Clark and S. Lappin},
title = {Another look at indirect negative evidence},
booktitle = {Proceedings of the EACL 2009 Workshop on Cognitive Aspects of Computational Language Acquisition},
OPTcrossref = {},
OPTkey = {},
pages = {26--33},
year = {2009},
}
@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 = {2010},
volume = {11},
pages = {2707--2744},
}
@inproceedings{Cla2011,
author = {A. Clark},
title = {A Language Theoretic Approach to Syntactic Structure},
booktitle = {The 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{ClaFloWat2011,
author = {A. Clark and
C. Costa Flor{\^{e}}ncio and
C. Watkins},
title = {Languages as hyperplanes: grammatical inference with string kernels},
journal = {Machine Learning},
volume = {82},
number = {3},
pages = {351--373},
year = {2011},
}
@inproceedings{Cla2012,
author = {A. Clark},
title = {Logical Grammars, Logical Theories},
booktitle = {Logical Aspects of Computational Linguistics - 7th International
Conference, LACL},
year = {2012},
pages = {1--20},
editor = {D. B{\'e}chet and
A. Ja. Dikovsky},
publisher = {Springer},
series = {LNCS},
volume = {7351},
}
@article{Cla2013,
author = {A. Clark},
title = {Learning trees from strings: a strong learning algorithm
for some context-free grammars},
journal = {Journal of Machine Learning Research},
volume = {14},
number = {1},
year = {2013},
pages = {3537--3559},
}
@inproceedings{ClaYos2014,
author = {A. Clark and
R. Yoshinaka},
title = {An Algebraic Approach to Multiple Context-Free Grammars},
booktitle = {Logical Aspects of Computational Linguistics - 8th International
Conference, LACL},
year = {2014},
pages = {57--69},
editor = {N. Asher and
S. Soloviev},
publisher = {Springer},
series = {LNCS},
volume = {8535},
}
@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{CleTea97,
AUTHOR = "Cleary, J.~G. and W.~J. Teahan",
TITLE = "Unbounded Length Contexts for {PPM}",
JOURNAL = {The Computer Journal},
YEAR = 1997,
month = "",
volume = {40},
number = "2-3",
pages = "67--75",
copy = ""
}
@article{CleaJoh2009,
title = "Rotation distance is fixed-parameter tractable",
journal = ipl,
volume = "109",
number = "16",
pages = "918--922",
year = "2009",
author = "S. Cleary and K. St. John",
}
@inproceedings{CleCLP2017,
author = {L. Clemente and
W. Czerwi\'nski and
S. Lasota and
C. Paperman},
title = {Regular Separability of {P}arikh Automata},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP}},
pages = {117:1--117:13},
editor = {I. Chatzigiannakis and
P. Indyk and
F. Kuhn and
A. Muscholl},
series = {LIPIcs},
volume = {80},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"ur Informatik},
year = {2017},
}
@inproceedings{CzeFigHof2020,
author = {W. Czerwinski and
D. Figueira and
P. Hofman},
editor = {I. Konnov and
L. Kov{\'{a}}cs},
title = {Universality Problem for Unambiguous {VASS}},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR}},
series = {LIPIcs},
volume = {171},
pages = {36:1--36:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
}
@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{CliEPR2010,
author = {R. Clifford and
K. Efremenko and
E. Porat and
A. Rothschild},
title = {Pattern matching with don't cares and few errors},
journal = jcss,
volume = {76},
number = {2},
pages = {115--124},
year = {2010},
}
@inproceedings{CliPop2010,
author = {R. Clifford and
A. Popa},
title = {(In)approximability Results for Pattern Matching Problems},
booktitle = {Proceedings of the Prague Stringology Conference},
pages = {52--62},
year = {2010},
editor = {J. Holub and
J. Zd{\'{a}}rek},
publisher = {Prague Stringology Club, Department of Theoretical Computer Science,
Faculty of Information Technology, Czech Technical University in Prague},
}
@InProceedings{CliGLS2018,
author ={R. Clifford and A. Gr\o nlund and K.~G. Larsen and T. Starikovskaya},
title ={Upper and Lower Bounds for Dynamic Data Structures on Strings},
booktitle ={35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages ={22:1--22:14},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
year ={2018},
volume ={96},
editor ={R. Niedermeier and B. Vall{\'e}e},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum f\"ur Informatik},
}
@inproceedings{CobGiaPas2003,
author = {J.~M. Cobleigh and
D. Giannakopoulou and
C.~S. P\u{a}s\u{a}reanu},
editor = {H. Garavel and
J. Hatcliff},
title = {Learning Assumptions for Compositional Verification},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems,
9th International Conference, {TACAS}},
series = {LNCS},
volume = {2619},
pages = {331--346},
publisher = {Springer},
year = {2003},
ydoi = {10.1007/3-540-36577-X\_24},
}
@article{CocCGKP2016,
author = {M. Cochefert and
J.{-}F. Couturier and
P. A. Golovach and
D. Kratsch and
D. Paulusma},
title = {Parameterized Algorithms for Finding Square Roots},
journal = alg,
volume = {74},
number = {2},
pages = {602--629},
year = {2016},
}
@inproceedings{CocCGK2016,
author = {M. Cochefert and
J.{-}F. Couturier and
S. Gaspers and
D. Kratsch},
title = {Faster Algorithms to Enumerate Hypergraph Transversals},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium},
pages = {306--318},
editor = {E. Kranakis and
G. Navarro and
E. Ch{\'{a}}vez},
series = {LNCS},
volume = {9644},
publisher = {Springer},
year = {2016},
}
@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{CocDawHed80,
author = {E.~J. Cockayne and
R.~M. Dawes and
S.~T. Hedetniemi},
title = {Total domination in graphs},
journal = {Networks},
volume = {10},
number = {3},
year = {1980},
pages = {211--219},
}
@article{CocFPT81,
title = "Contributions to the theory of domination, independence and irredundance in graphs",
journal = dm,
volume = "33",
number = "3",
pages = "249--258",
year = "1981",
author = "E.~J. Cockayne and O. Favaron and C. Payan and A.G. Thomason"
}
@article{CocMyn93,
title = "The sequence of upper and lower domination, independence and irredundance numbers of a graph",
journal = dm,
volume = "122",
number = "1â€“3",
pages = "89--102",
year = "1993",
author = "E.~J. Cockayne and C.~M. Mynhardt"
}
@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{CocGamShe85,
AUTHOR = "E.~J. Cockayne and B. Gamble and B. Shepherd",
TITLE = "An upper bound for the $k$-domination number of a graph",
JOURNAL = jgth,
YEAR = 1985,
month = "",
volume = 9,
number = "",
pages = "533--534",
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{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{Coc90,
AUTHOR = "E.~J. Cockayne",
TITLE = "Chessboard domination problems",
JOURNAL = dm,
YEAR = 1990,
month = "",
volume = 86,
number = "",
pages = "13--20",
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{Cocetal97a,
title = "Using maximality and minimality conditions to construct inequality chains",
journal = dm,
volume = "176",
number = "1â€“3",
pages = "43--61",
year = "1997",
author = "E.~J. Cockayne and J.~H. Hattingh and S.~M. Hedetniemi and S.~T. Hedetniemi and A.~A. McRae",}
@article{CocMyn97,
author = {E.~J. Cockayne and
C.~M. Mynhardt},
title = {Irredundance and Maximum Degree in Graphs},
journal = {Combinatorics, Probability {\&} Computing},
volume = {6},
number = {2},
pages = {153--157},
year = {1997}
}
@Article{Cocetal98,
author = {E.~J. Cockayne and O. Favaron and J. Puech and C.~M. Mynhardt},
title = {Packing, perfect neighbourhood, irredundant and {$R$}-annihilated sets in graphs},
journal = {Australasian Journal of Combinatorics},
year = {1998},
volume = {18},
OPTnumber = {},
pages = {253--262},
}
@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{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{CocMin64,
author = {J. Cocke and
M. Minsky},
title = {Universality of Tag Systems with {$P=2$}},
journal = jacm,
volume = {11},
number = {1},
pages = {15--20},
year = {1964},}
@article{CocMar90,
author = {J. Cocke and
V. Markstein},
title = {The Evolution of {RISC} Technology at {IBM}},
journal = ibmjrd,
volume = {34},
number = {1},
pages = {4--11},
year = {1990},}
@article{Cod79,
author = {E.~F. Codd},
title = {Extending the Database Relational Model to Capture More Meaning},
journal = {{ACM} Transactions on Database Systems},
volume = {4},
number = {4},
pages = {397--434},
year = {1979},
}
@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},
}
@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"
}
@article{CohBTT95,
author = {R.~F. Cohen and
G. Di Battista and
R. Tamassia and
I.~G. Tollis},
title = {Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar
{ST}-Digraphs},
journal = siam,
volume = {24},
number = {5},
pages = {970--1001},
year = {1995},
}
@article{CohBlu95,
title = "On the problem of sorting burnt pancakes",
journal = dam,
volume = "61",
number = "2",
pages = "105--120",
year = "1995",
author = "D.~S. Cohen and M. Blum",
}
@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{CohBTTB92,
author = {R.~F. Cohen and
G. Di Battista and
R. Tamassia and
I.~G. Tollis and
P. Bertolazzi},
title = {A Framework for Dynamic Graph Drawing},
booktitle = {Symposium on Computational Geometry},
pages = {261--270},
year = {1992},
}
@article{CohTam95,
author = {R.~F. Cohen and
R. Tamassia},
title = {Dynamic Expression Trees},
journal = alg,
volume = {13},
number = {3},
pages = {245--265},
year = {1995},
}@article{CohTam97,
author = {R.~F. Cohen and
R. Tamassia},
title = {Combine and Conquer},
journal = alg,
volume = {18},
number = {3},
pages = {324--362},
year = {1997},
}
@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{CohKimSag2008,
author = {S. Cohen and
B. Kimelfeld and
Y. Sagiv},
title = {Generating all maximal induced subgraphs for hereditary and connected-hereditary
graph properties},
journal = jcss,
volume = {74},
number = {7},
pages = {1147--1159},
year = {2008},
}
@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 = ""
}
@incollection{CohKimKou2012,
author = {S. Cohen and
B. Kimelfeld and
G. Koutrika},
title = {A Survey on Proximity Measures for Social Networks},
booktitle = {Search Computing - Broadening Web Search},
pages = {191--206},
editor = {S. Ceri and
M. Brambilla},
series = {LNCS},
volume = {7538},
publisher = {Springer},
year = {2012},
}
@article{CohWei2016,
author = {S. Cohen and
Y.~Y. Weiss},
title = {The Complexity of Learning Tree Patterns from Example Graphs},
journal = {{ACM} Trans. Database Syst.},
volume = {41},
number = {2},
pages = {14:1--14:44},
year = {2016},
}
@inproceedings{CohLeeSon2019,
author = {M.~B. Cohen and
Y. T. Lee and
Z. Song},
editor = {M. Charikar and
E. Cohen},
title = {Solving linear programs in the current matrix multiplication time},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC}},
pages = {938--942},
publisher = {{ACM}},
year = {2019},
}
@inproceedings{CojMak2013,
author = {L. Cojocaru and
E. M{\"{a}}kinen},
title = {Searching for Traces of Communication in {S}zilard Languages of Parallel
Communicating Grammar Systems - Complexity Views},
booktitle = {Descriptional Complexity of Formal Systems, {DCFS}},
pages = {42--53},
editor = {H. J{\"{u}}rgensen and
R. Reis},
series = {LNCS},
volume = {8031},
publisher = {Springer},
year = {2013},
}
@PhdThesis{Coj2016,
author = {L. Cojocaru},
title = {Advanced Studies on the Complexity of
Formal Languages},
school = {School of Information Sciences, Computer Science, University of Tampere, Finland},
year = {2016},
}
@article{Col83,
author = {C.~J. Colbourn},
title = {Embedding Partial {S}teiner Triple Systems Is {NP}-Complete},
journal = jctha,
volume = {35},
number = {1},
pages = {100--105},
year = {1983},
}
@article{ColColRos83,
author = {C.~J. Colbourn and
M.~J. Colbourn and
A. Rosa},
title = {Completing small partial triple systems},
journal = dm,
volume = {45},
number = {2-3},
pages = {165--179},
year = {1983},
}
@article{Col84,
author = {C.~J. Colbourn},
title = {The complexity of completing partial {L}atin squares},
journal = dam,
volume = {8},
number = {1},
pages = {25--30},
year = {1984},
}
@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},
}
@Article{ColSlaSte87,
author = {C.~J. Colbourn and P.~J. Slater and L.~K. Stewart},
title = {Locating dominating sets in series parallel networks},
journal = {Congr. Numer.},
year = {1987},
volume = {56},
pages = {135--162},
}
@article{ColXue98,
author = {C.~J. Colbourn and
G. Xue},
title = {A Linear Time Algorithm for Computing the Most Reliable Source on
a Series-Parallel Graph with Unreliable Edges},
journal = tcs,
volume = {209},
number = {1-2},
pages = {331--345},
year = {1998},
}
@inproceedings{Col2011,
author = {T. Colcombet},
title = {Green's Relations and Their Use in Automata Theory},
booktitle = {Language and Automata Theory and Applications - 5th International
Conference},
pages = {1--21},
editor = {A.{-}H. Dediu and
S. Inenaga and
C. Mart{\'{\i}}n{-}Vide},
series = {LNCS},
volume = {6638},
publisher = {Springer},
year = {2011},
}
@article{ColIMSY2005,
author = {R. Cole and C.~S. Iliopoulos and M. Mohamed and W.~F. Smyth and L. Yang},
title = {The Complexity of the Minimum $k$-cover Problem},
journal = jalc,
volume = {10},
number = {5--6},
pages = {641--653},
year = {2005},
ydoi = {10.25596/jalc-2005-641}
}
@article{ColKitLoz2017,
author = {A. Collins and
S. Kitaev and
V.~V. Lozin},
title = {New results on word-representable graphs},
journal = dam,
volume = {216},
pages = {136--141},
year = {2017},
}
@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 = ""
}.
@article{ConMMS2015,
author = {J. Conde and
M. Miller and
J.~M. Miret and
K. Saurav},
title = {On the Nonexistence of Almost {M}oore Digraphs of Degree Four and Five},
journal = {Mathematics in Computer Science},
volume = {9},
number = {2},
pages = {145--149},
year = {2015},
}
@InProceedings{ConDavKal2006,
author = {V. Conitzer and A. Davenport and J. Kalagnanam},
title = {Improved bounds for computing
{K}emeny rankings},
booktitle = {Proc. 21st National Conference on Artificial Intelligence, AAAI},
pages = {620--626},
year = {2006},
publisher = {{AAAI} Press},
}
@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{Con75,
AUTHOR = "W. M. Conner",
TITLE = "The dimension of a formal language",
JOURNAL = icalt,
YEAR = 1975,
VOLUME = 29,
NUMBER = "",
PAGES = "1--10",
copy = ""
}
@MASTERSTHESIS{ConWar2012,
AUTHOR = "J. Connor and N. Ward",
TITLE = "Celtic Knot Theory",
SCHOOL = "The University of Edinburgh",
YEAR = 2012,
month = "",
address = "",
type = "BSc. Thesis",
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 = ""
}
@article{ConFSV2004,
author = {D. Conte and
P. Foggia and
C. Sansone and
M. Vento},
title = {Thirty Years Of Graph Matching In Pattern Recognition},
journal = {International Journal of Pattern Recognition
and Artiï¬cial Intelligence},
volume = {18},
number = {3},
year = {2004},
pages = {265--298},
}
@article{ConFogVen2007,
author = {D. Conte and
P. Foggia and
M. Vento},
title = {Challenging Complexity of Maximum Common Subgraph Detection
Algorithms: A Performance Analysis of Three Algorithms on
a Wide Database of Graphs},
journal = jgaa,
volume = {11},
number = {1},
year = {2007},
pages = {99--143},
}
@inproceedings{ConGMUV2017,
author = {A. Conte and
R. Grossi and
A. Marino and
T. Uno and
L. Versari},
title = {Listing Maximal Independent Sets with Minimal Space and Bounded Delay},
booktitle = {String Processing and Information Retrieval - 24th International Symposium,
{SPIRE}},
pages = {144--160},
year = {2017},
editor = {Gabriele Fici and
Marinella Sciortino and
Rossano Venturini},
series = {LNCS},
volume = {10508},
publisher = {Springer},
}
@inproceedings{ConKMU2019,
author = {A. Conte and
M.~M. Kant{\'{e}} and
A. Marino and
T. Uno},
editor = {C.~J. Colbourn and
R. Grossi and
N. Pisanti},
title = {Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree
Hypergraphs},
booktitle = {Combinatorial Algorithms - 30th International Workshop, {IWOCA}},
series = {LNCS},
volume = {11638},
pages = {148--159},
publisher = {Springer},
year = {2019},
ydoi = {10.1007/978-3-030-25005-8\_13},
}
@article{ConTom2022,
author = {A. Conte and
E. Tomita},
title = {On the overall and delay complexity of the {CLIQUES} and {B}ron-{K}erbosch
algorithms},
journal = tcs,
volume = {899},
pages = {1--24},
year = {2022},
}
@inproceedings{Coo71,
author = {Cook, S.~A.},
title = {The Complexity of Theorem-proving Procedures},
booktitle = {Proceedings of the Third Annual ACM Symposium on Theory of Computing STOC},
year = {1971},
pages = {151--158},
publisher = {ACM},
address = {New York, NY, USA},
}
@InProceedings{CooRos76,
author ="C.~M. Cook and A. Rosenfeld",
title ="Some experiments in grammatical inference",
booktitle ="Proceedings of the NATO Advanced Study Institute of Computer
Oriented Learning Processes",
year ="1976",
editor ="J. C. Simon",
publisher ="Noordhoff",
address ="Leyden, The Netherlands",
}
@ARTICLE{CooRosAro76,
AUTHOR = "C.~M. Cook and A. Rosenfeld and A. R. Aronson",
TITLE = "Grammatical inference by hill climbing",
JOURNAL = infsci,
YEAR = 1976,
month = "",
volume = 10,
number = "",
pages = "59--80",
copy = ""
}
@ARTICLE{CooWan78,
AUTHOR = "C. R. Cook and P. S.-P. Wang",
TITLE = "A {C}homsky hierarchy of
isotonic array grammars and languages",
JOURNAL = cgip,
YEAR = 1978,
month = "",
volume = 8,
number = "",
pages = "144--152",
copy = ""
}
@ARTICLE{Coo81,
AUTHOR = "S.~A. Cook",
TITLE = "Towards a Complexity Theory of Synchronous
Parallel Computation",
JOURNAL = "Enseign. Math.",
YEAR = 1981,
VOLUME = 27,
PAGES = "99--124"}
@article{CooMcK87,
author = {S.~A. Cook and
P. McKenzie},
title = {Problems Complete for Deterministic Logarithmic Space},
journal = {J. Algorithms},
volume = {8},
number = {3},
pages = {385--394},
year = {1987},
}
@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{CooRan95,
author = {S.~R. Coorg and
C. Pandu Rangan},
title = {Feedback vertex set on cocomparability graphs},
journal = {Networks},
volume = {26},
number = {2},
pages = {101--111},
year = {1995},
}
@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{CopGHS2004,
author = {Coppersmith, D. and Gamarnik, D. and Hajiaghayi, M. and Sorkin, G.~B.},
title = {Random {MAX} {SAT}, random {MAX} {CUT}, and their phase transitions},
journal = {Random Structures \& Algorithms},
volume = {24},
number = {4},
pages = {502--545},
year = {2004},
}
@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",
}
@inproceedings{CorGalSpa2012,
author = {D. Cornaz and
L. Galand and
O. Spanjaard},
title = {Bounded Single-Peaked Width and Proportional Representation},
booktitle = {{ECAI} 2012 - 20th European Conference on Artificial Intelligence.
Including Prestigious Applications of Artificial Intelligence {(PAIS-2012)}},
pages = {270--275},
editor = {L. De Raedt and
C. Bessi{\`{e}}re and
D. Dubois and
P. Doherty and
P. Frasconi and
F. Heintz and
P. J. F. Lucas},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {242},
publisher = {{IOS} Press},
year = {2012},
}
@inproceedings{CorGalSpa2013,
author = {D. Cornaz and
L. Galand and
O. Spanjaard},
title = {Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width},
booktitle = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference
on Artificial Intelligence},
editor = {F. Rossi},
publisher = {{IJCAI/AAAI}}, pages = {76--82},
year = {2013},
}
@Article{CorLerBur81,
author = {D.~G. Corneil and
H. Lerchs and
L. Stewart Burlingham},
title = {Complement reducible graphs},
journal = dam,
year = {1981},
volume = {3},
pages = {163--174},
}
@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 Journal on Algebraic and Discrete Methods},
YEAR = 1987,
month = "",
volume = 8,
number = "",
pages = "535--543",
copy = ""
}
@article{CorOlaSte95,
author = {D.~G. Corneil and
S. Olariu and
L. Stewart},
title = {A Linear Time Algorithm to Compute a Dominating Path in an {AT}-Free
Graph},
journal = ipl,
volume = {54},
number = {5},
pages = {253--257},
year = {1995},
}
@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},
}
@INPROCEEDINGS{CorRot01,
AUTHOR = "D.~G. Corneil and U. Rotics",
TITLE = "On the relationship between clique-width and treewidth",
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 = ""
}
@article{Coretal2006,
author = {D.~G. Corneil and
E. K{\"{o}}hler and S. Olariu and L. Stewart},
title = {Linear Orderings of Subfamilies of {AT}-Free Graphs},
journal = siamdm,
volume = {20},
number = {1},
pages = {105--118},
year = {2006},
}
@article{CorHLRR2012,
author = {D.~G. Corneil and
M. Habib and
J.{-}M. Lanlignel and
B.~A. Reed and
U. Rotics},
title = {Polynomial-time recognition of clique-width {\(\leq\)}3 graphs},
journal = dam,
volume = {160},
number = {6},
pages = {834--865},
year = {2012},
}
@ARTICLE{CorSchWag2004,
AUTHOR = "S. Cornelsen and T. Schank and D. Wagner",
TITLE = "Drawing Graphs on Two and Three Lines",
JOURNAL = jgaa,
YEAR = 2004,
month = "",
volume = 8,
number = "",
pages = "161--177",
copy = ""
}
@INPROCEEDINGS{CorSat2006,
author = {Corazza, A. and Satta, G.},
title = {Cross-entropy and estimation of probabilistic context-free grammars},
booktitle = {Proceedings of the main conference on Human Language Technology Conference
of the North American Chapter of the Association of Computational
Linguistics, HLT-NAACL},
year = {2006},
pages = {335--342},
publisher = {Association for Computational Linguistics},
}
@ARTICLE{CorSat2007,
author = {Corazza, A. and Satta, G.},
title = {Probabilistic Context-Free Grammars Estimated from Infinite Distributions},
journal = ieeetopami,
year = {2007},
volume = {29},
pages = {1379--1393},
number = {8},
}
@article{Cor88,
title = "General factors of graphs",
journal = jcthb,
volume = "45",
number = "2",
pages = "185--198",
year = "1988",
author = "G. Cornu\'ejols",
}
@article{CorGue2002,
title = "Ideal clutters",
journal = dam,
volume = "123",
number = "1â€“3",
pages = "303--338",
year = "2002",
author = "G. Cornu{\'e}jols and B. Guenin",
}
@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{CorCarZug2022,
author = {M. Correa, R. Carmo, A. Prusch Z\"uge},
title = {Lexicographic Breadth First-Search and
Branch and Bound Algorithms for the
{M}aximum {C}lique {P}roblem},
journal = {Matemática Contemporânea},
year = {2022},
volume = {48},
pages = {240--252},
}
@Article{CorRos2015,
author = {J.~M. Corson and L. L. Ross},
title = {Automata with Counters that Recognize Word Problems of Free Products},
journal = ijfcs,
year = {2015},
volume = {26},
pages = {79--98},
}
@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},
}
@article{CosPRS2010,
author = {M. Costa Dourado and
F. Protti and
D. Rautenbach and
J. L. Szwarcfiter},
title = {On the Hull Number of Triangle-Free Graphs},
journal = siamdm,
volume = {23},
number = {4},
year = {2010},
pages = {2163--2172},
}
@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},
}
@article{CosFPRS2014,
title = "On defensive alliances and strong global offensive alliances",
journal = dam,
volume = "163, Part 2",
pages = "136--141",
year = "2014",
issn = "0166-218X",
doi = "http://dx.doi.org/10.1016/j.dam.2013.06.029",
author = "M. Costa Dourado and L. Faria and M.~A. Piza{\~{n}}a and D. Rautenbach and J.~L. Szwarcfiter",
}
@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},
}
@article{CosVer2014,
AUTHOR = "Costa Flor{\^e}ncio, C. and S. Verwer",
title = {Regular inference as vertex coloring},
journal = tcs,
volume = {558},
pages = {18--34},
year = {2014},
}
@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{Cos99a,
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},
}
@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{CotLanMos2006,
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 = ""
}
@inproceedings{CotPre2021,
author = {N. Cotumaccio and
N. Prezza},
editor = {D. Marx},
title = {On Indexing and Compressing Finite Automata},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA}},
pages = {2585--2599},
publisher = {{SIAM}},
year = {2021},
}
@article{CouDPRV2007,
author = {D. Coudert and
P. Datta and
S. Perennes and
H. Rivano and
M.-E. Voge},
title = {Shared Risk Resource Group Complexity and Approximability
Issues},
journal = ppl,
volume = {17},
number = {2},
year = {2007},
pages = {169--184},
}
@article{Cou90,
author= "B. Courcelle",
title= "The monadic second-order logic of graphs. {I}.
{R}ecognizable sets of finite graphs",
journal=ic,
volume= "85",
pages= "12--75",
year= "1990",
}
@article{Cou90a,
author = {B. Courcelle},
title = {The Monadic Second-Order Logic of Graphs {IV:} Definability Properties of Equational Graphs},
journal = apal,
volume = {49},
pages = {193--255},
year = {1990},
}
@inproceedings{Cou91,
author= "B. Courcelle",
title = {Graph grammars, monadic second-order logic and the theory of graph
minors},
booktitle = {Graph Structure Theory, Proceedings of a {AMS-IMS-SIAM} Joint Summer
Research Conference on Graph Minors held June 22 to July 5, 1991,
at the University of Washington, Seattle},
pages = {565--590},
editor = {N. Robertson and
P.~D. Seymour},
series = {Contemporary Mathematics},
year = {1993},
volume = {147},
publisher = {American Mathematical Society},
}
@article{Cou91a,
author = {B. Courcelle},
title = {The Monadic Second-Order Logic of Graphs {V:} On Closing the Gap Between
Definability and Recognizability},
journal = tcs,
volume = {80},
number = {2},
pages = {153--202},
year = {1991},
}
@inproceedings{CouMos9192,
author = {B. Courcelle and
M. Mosbah},
title = {Monadic Second-Order Evaluations on Tree-Decomposable Graphs},
booktitle = {17th International Workshop, {WG}'91},
pages = {13--24},
editor = {G. Schmidt and
R. Berghammer},
series = {LNCS},
volume = {570},
publisher = {Springer},
year = {1992},
}
@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},
}
@article{Cou92,
author = {B. Courcelle},
title = {The Monadic Second-Order Logic of Graphs {VII:} Graphs as Relational
Structures},
journal = tcs,
volume = {101},
number = {1},
pages = {3--33},
year = {1992},
}
@article{Cou92a,
author = {B. Courcelle},
title = {The monadic second-order logic of graphs {III}: tree-decompositions,
minor and complexity issues},
journal = rairoita,
volume = {26},
pages = {257--286},
year = {1992},
}
@article{CouEngRoz93,
title = {Handle-rewriting hypergraph grammars},
journal = jcss,
volume = {46},
number = {2},
pages = {218-270},
year = {1993},
ydoi = {https://doi.org/10.1016/0022-0000(93)90004-G},
author = {B. Courcelle and J. Engelfriet and G. Rozenberg},
}
@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{CouKan2009,
author = {B. Courcelle and
M. M. Kant{\'e}},
title = {Graph operations characterizing rank-width},
journal = dam,
volume = {157},
number = {4},
year = {2009},
pages = {627--640},
}
@article{CouHMPR2015,
author = {B. Courcelle and
P. Heggernes and
D. Meister and
C. Papadopoulos and
U. Rotics},
title = {A characterisation of clique-width through nested partitions},
journal = dam,
volume = {187},
pages = {70--81},
year = {2015},
}
@Article{Cou2020,
author = {B. Courcelle},
title = {Betweenness of partial orders},
journal=rairoita,
year="2020",
volume="54",
number="7",
pages="1--10",
doi = {10.1051/ita/2020007}
}
@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},
}
@article{CouGKLP2013,
author = {J.{-}F. Couturier and
P. A. Golovach and
D. Kratsch and
M. Liedloff and
A. V. Pyatkin},
title = {Colorings with few Colors: Counting, Enumeration and Combinatorial
Bounds},
journal = tocs,
volume = {52},
number = {4},
pages = {645--667},
year = {2013},
}
@inproceedings{CouHHK2012,
author = {J.{-}F. Couturier and
P. Heggernes and
P. van 't Hof and
D. Kratsch},
editor = {M. Bielikov{\'{a}} and
G. Friedrich and
G. Gottlob and
S. Katzenbeisser and
G. Tur{\'{a}}n},
title = {Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and
Enumeration},
booktitle = {{SOFSEM} 2012: Theory and Practice of Computer Science - 38th Conference
on Current Trends in Theory and Practice of Computer Science},
series = {LNCS},
volume = {7147},
pages = {202--213},
publisher = {Springer},
year = {2012},
}
@article{CouHHK2013,
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},
journal = tcs,
volume = {487},
pages = {82--94},
year = {2013},
}
@article{CouLetLie2015,
author = {J.{-}F. Couturier and
R. Letourneur and
M. Liedloff},
title = {On the number of minimal dominating sets on some graph classes},
journal = tcs,
volume = {562},
pages = {634--642},
year = {2015},
}
@article{CozKel90,
author = {M.~B. Cozzens and
L.~L. Kelleher},
title = {Dominating cliques in graphs},
journal = dm,
volume = {86},
number = {1-3},
pages = {101--116},
year = {1990},
}
@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 = ""
}
@inproceedings{CraGutWat2016,
author = {J. Crampton and
G. Gutin and
R. Watrigant},
title = {Resiliency Policies in Access Control Revisited},
booktitle = {Proceedings of the 21st {ACM} on Symposium on Access Control Models
and Technologies, {SACMAT}},
pages = {101--111},
editor = {X.~S. Wang and
L. Bauer and
F. Kerschbaum},
publisher = {{ACM}},
year = {2016},
}
@inproceedings{CraGutWat2016a,
author = {J. Crampton and
G. Gutin and
R. Watrigant},
title = {A Multivariate Approach for Checking Resiliency in Access Control},
booktitle = {Algorithmic Aspects in Information and Management - 11th International
Conference, {AAIM}},
pages = {173--184},
editor = {R. Dondi and
G. Fertin and
G. Mauri},
series = {LNCS},
volume = {9778},
publisher = {Springer},
year = {2016},
}
@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{CreHeb97,
author = {N. Creignou and
J.{-}J. H{\'{e}}brard},
title = {On Generating All Solutions of Generalized Satisfiability Problems},
journal = rairoita,
volume = {31},
number = {6},
pages = {499--511},
year = {1997},
}
@article{CreKolZan2008,
author = {N. Creignou and
P.~G. Kolaitis and
B. Zanuttini},
title = {Structure identification of {B}oolean relations and plain bases for
co-clones},
journal = jcss,
volume = {74},
number = {7},
pages = {1103--1115},
year = {2008},
}
@inproceedings{CreOliSch2011,
author = {N. Creignou and
F. Olive and
J. Schmidt},
editor = {K.~A. Sakallah and
L. Simon},
title = {Enumerating All Solutions of a Boolean {CSP} by Non-decreasing Weight},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT}},
series = {LNCS},
volume = {6695},
pages = {120--133},
publisher = {Springer},
year = {2011},
ydoi = {10.1007/978-3-642-21581-0\_11},
}
@article{CreVol2015,
author = {N. Creignou and
H. Vollmer},
title = {Parameterized Complexity of Weighted Satisfiability Problems: Decision,
Enumeration, Counting},
journal = fundinform,
volume = {136},
number = {4},
pages = {297--316},
year = {2015},
}
@article{CreMMSV2017,
author = {N. Creignou and
A. Meier and
J.{-}S. M{\"{u}}ller and
J. Schmidt and
H. Vollmer},
title = {Paradigms for Parameterized Enumeration},
journal = tocs,
volume = {60},
number = {4},
pages = {737--758},
year = {2017},
}
@article{CreKMMOV2019,
author = {N. Creignou and
R. Ktari and
A. Meier and
J.{-}S. M{\"{u}}ller and
F. Olive and
H. Vollmer},
title = {Parameterised Enumeration for Modification Problems},
journal = {Algorithms},
volume = {12},
number = {9},
pages = {189},
year = {2019},
}
@article{CreKPSV2019,
author = {N. Creignou and
M. Kr{\"{o}}ll and
R. Pichler and
S. Skritek and
H. Vollmer},
title = {A complexity theory for hard enumeration problems},
journal = dam,
volume = {268},
pages = {191--209},
year = {2019},
}
@inproceedings{CreDurVol2022,
author = {N. Creignou and
A. Durand and
H. Vollmer},
editor = {S. Szeider and
R. Ganian and
A. Silva},
title = {Enumeration Classes Defined by Circuits},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS}},
series = {LIPIcs},
volume = {241},
pages = {38:1--38:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
}
@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 = ""
}
@inproceedings{Cre97,
author = {P. Crescenzi},
title = {A Short Guide to Approximation Preserving Reductions},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity},
pages = {262--273},
year = {1997},
publisher = {{IEEE} Computer Society},
}
@article{CreTre99,
author = {P. Crescenzi and
L. Trevisan},
title = {{Max NP}-completeness Made Easy},
journal = tcs,
volume = {225},
number = {1-2},
pages = {65--79},
year = {1999},
}
@article{CreRos2002,
title = {On the Hamming distance of constraint satisfaction problems},
journal = tcs,
volume = {288},
number = {1},
pages = {85-100},
year = {2002},
ydoi = {https://doi.org/10.1016/S0304-3975(01)00146-3},
author = {P. Crescenzi and G. Rossi},}
@article{CreLPT2021,
author = {C. Crespelle and
D. Lokshtanov and
T. H. D. Phan and
E. Thierry},
title = {Faster and enhanced inclusion-minimal cograph completion},
journal = dam,
volume = {288},
pages = {138--151},
year = {2021},
}
@INPROCEEDINGS{Cre71a,
AUTHOR = "S. Crespi-Reghizzi",
TITLE = "Reduction of enumeration in grammar acquisition",
BOOKTITLE = "Proc. 2nd Int. Conf. Art. Intell.",
YEAR = 1971,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "546--552",
address = "",
organization = "",
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 = ""
}
@article{CrePat2005,
author = {S. Crespi{-}Reghizzi and
M. Pradella},
title = {Tile rewriting grammars and picture languages},
journal = tcs,
volume = {340},
number = {1},
pages = {257--272},
year = {2005},
}
@article{CrePat2008,
author = {S. Crespi{-}Reghizzi and
M. Pradella},
title = {A {CKY} parser for picture grammars},
journal =ipl,
volume = {105},
number = {6},
pages = {213--217},
year = {2008},
}
@article{CreMan2012,
title = "Operator precedence and the visibly pushdown property",
journal = jcss,
volume = "78",
number = "6",
pages = "1837--1867",
year = "2012",
author = "S. Crespi{-}Reghizzi and D. Mandrioli",}
@inproceedings{CrePie2014,
author = {S. Crespi{-}Reghizzi and
P. San Pietro},
title = {Commutative Languages and their Composition by Consensual Methods},
booktitle = {Proceedings 14th International Conference on Automata and Formal Languages,
{AFL}},
pages = {216--230},
editor = {Z. {\'{E}}sik and
Z. F{\"{u}}l{\"{o}}p},
series = {{EPTCS}},
volume = {151},
year = {2014},
doi = {10.4204/EPTCS.151},
}
@article{CrePie2020,
author = {S. Crespi{-}Reghizzi and
P. San Pietro},
title = {Deque automata, languages, and planar graph representations},
journal = tcs,
volume = {834},
pages = {43--59},
year = {2020},
}
@inproceedings{CreResPie2021,
author = {S. Crespi{-}Reghizzi and
A. Restivo and
P. San Pietro},
editor = {N. Moreira and
R. Reis},
title = {Reducing Local Alphabet Size in Recognizable Picture Languages},
booktitle = {Developments in Language Theory - 25th International Conference, {DLT}},
series = {LNCS},
volume = {12811},
pages = {103--116},
publisher = {Springer},
year = {2021},
}
@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 = ""
}
@article{CreGodRam2014,
author = {C. Creus and
G. Godoy and
L. Ramos},
title = {Excessively duplicating patterns represent non-regular languages},
journal = ipl,
volume = {114},
number = {3},
pages = {85--93},
year = {2014},
}
@article{CreGGR2016,
author = {C. Creus and
A. Gasc{\'{o}}n and
G. Godoy and
L. Ramos},
title = {The {HOM} Problem is {EXPTIME}-Complete},
journal = siam,
volume = {45},
number = {4},
pages = {1230--1260},
year = {2016},
}
@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{CreGHLM2013,
author = {P. Crescenzi and
R. Grossi and
M. Habib and
L. Lanzi and
A. Marino},
title = {On computing the diameter of real-world undirected graphs},
journal = tcs,
volume = {514},
pages = {84--95},
year = {2013},
}
@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},
}
@article{CriEyn80,
author = {R. Crittenden and
C.~V. Eynden},
title = {Completing Partial {L}atin Squares},
journal = jctha,
volume = {28},
number = {2},
pages = {125--129},
year = {1980}
}
@article{CroGarGro2012,
author = {F. Della Croce and
T. Garaix and
A. Grosso},
title = {Iterated local search and very large neighborhoods for the parallel-machines
total tardiness problem},
journal = {Computers {\&} {OR}},
volume = {39},
number = {6},
pages = {1213--1217},
year = {2012},
}
@article{CroPas2014,
author = {F. Della Croce and
V. Th. Paschos},
title = {Efficient algorithms for the max $k$-vertex cover problem},
journal = joco,
volume = {28},
number = {3},
pages = {674--691},
year = {2014},
}
@INPROCEEDINGS{Croetal98,
AUTHOR = "M. Crochemore and F. Mignosi and A. Restivo",
TITLE = "Minimal Forbidden Words and Factor Automata",
BOOKTITLE = "MFCS'98",
YEAR = 1998,
month = "",
volume = "1450",
editor = "L. Brim et al.",
series = "",
chapter = "",
pages = "665--673",
address = "",
organization = "",
copy = ""
}
@TECHREPORT{Croetal98a,
AUTHOR = "M. Crochemore and F. Mignosi and A. Restivo",
TITLE = "Automata and Forbidden Words",
INSTITUTION = "Universit\'e de Marne-la-Vall\'ee, Institut Gaspard-Monge",
YEAR = 1998,
month = "",
number = "IGM-98-5",
address = "",
copy = "",
note = {enhanced version of \cite{Croetal98}, submitted to } #ipl
}
@TECHREPORT{Croetal98b,
AUTHOR = "M. Crochemore and F. Mignosi and A. Restivo and S. Salemi",
TITLE = "Data Compression using Antidictionaries",
INSTITUTION = "Universit\'e de Marne-la-Vall\'ee, Institut Gaspard-Monge",
YEAR = 1998,
month = "",
number = "IGM-98-10",
address = "",
copy = ""
}
@INPROCEEDINGS{Croetal99,
AUTHOR = "M. Crochemore and others",
TITLE = "Text compression using antidictionaries",
BOOKTITLE = "Automata, Languages and Programming 26th ICALP'99",
YEAR = 1999,
month = "",
volume = "1644",
editor = "J. Wiedermann and P. van Emde Boas and M. Nielsen",
series = "LNCS",
chapter = "",
pages = "261--270",
address = "",
organization = "",
copy = ""
}
@article{CroILM2017,
title={The longest common substring problem},
volume={27},
number={2},
journal={Mathematical Structures in Computer Science},
author={Crochemore, M. and Iliopoulos, C.~S. and Langiu, A. and Mignosi, F.},
year={2017},
pages={277â€“295}}
@article{CroSud83,
author = {C. Croitoru and
E. Suditu},
title = {Perfect Stables in Graphs},
journal = ipl,
volume = {17},
number = {1},
year = {1983},
pages = {53--56},
}
@article{CroDEM2022,
author = {A. Cropper and
S. Duman\v{c}i\'c and
R. Evans and
S. H. Muggleton},
title = {Inductive logic programming at 30},
journal = {Machine Learning},
volume = {111},
number = {1},
pages = {147--172},
year = {2022},
}
@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{Cro2008,
author = {P.~R. Cromwell},
title = {The distribution of knot types in Celtic interlaced ornament},
journal = {Journal of Mathematics and the Arts},
volume = {2},
number = {2},
pages = {61--68},
year = {2008},
}
@PhdThesis{Cro2013,
author = {R.~E. Crowston},
title = {Algorithms for Parameterized Constraint
Satisfaction Problems},
school = {Royal Holloway, University of London, UK},
year = {2013},
}
@article{CroFGJKRRTY2014,
author = {R. Crowston and
M. R. Fellows and
G. Gutin and
M. Jones and
E. J. Kim and
F. Rosamond and
I. Z. Ruzsa and
S. Thomass{\'{e}} and
A. Yeo},
title = {Satisfying more than half of a system of linear equations over {GF(2):} {A} multivariate approach},
journal = jcss,
year = {2014},
volume = {80},
number = {4},
pages = {687--696},
}
@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 = ""
}
@INPROCEEDINGS{CruVid2003,
AUTHOR = "P.~P. Cruz-Alc\'azar and E. Vidal-Ruiz",
TITLE = "Modeling Musical Style using Grammatical Inference Techniques: a Tool for
Classifying and Generating Melodies",
BOOKTITLE = "Proceedings of the Third International Conference WEB Delivering of Music (WEDELMUSICâ€™03)",
YEAR = 2003,
month = "",
volume = "",
editor = "",
series = "",
chapter = "",
pages = "",
address = "",
organization = "IEEE",
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{CsaSze2004,
title = {Structure of a large social network},
author = {Cs\'anyi, G. and Szendr\H{o}i, B.},
journal = {Phys. Rev. E},
volume = {69},
issue = {3},
pages = {036131},
numpages = {5},
year = {2004},
month = {Mar},
publisher = {American Physical Society},
}
@article{CsoHurWoe2012,
author = {P. Csorba and
C.~A.~J. Hurkens and
G.~J. Woeginger},
title = {The {A}lcuin Number of a Graph and Its Connections to the
Vertex Cover Number},
journal = {SIAM Review},
volume = {54},
number = {1},
year = {2012},
pages = {141--154},
}
@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{CsuKel91,
author = {E. Csuhaj{-}Varj{\'{u}} and
J. Kelemen},
title = {On the Power of Cooperation: {A} Regular Representation of Recursively
Enumerable Languages},
journal = tcs,
volume = {81},
number = {2},
pages = {305--310},
year = {1991},
}
@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 = ""
}
@article{CsuKel93,
author = {E. Csuhaj{-}Varj{\'{u}} and
A. Kelemenov{\'{a}}},
title = {Descriptional Complexity of Context-Free Grammar Forms},
journal = tcs,
volume = {112},
number = {2},
pages = {277--289},
year = {1993},
}
@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{CsuPauVas2003,
author = {E. Csuhaj{-}Varj{\'{u}} and
Gh. P\u{a}un and
Gy. Vaszil},
title = {{PC} grammar systems with five context-free components generate all
recursively enumerable languages},
journal = tcs,
volume = {299},
number = {1-3},
pages = {785--794},
year = {2003},
}
@Article{CsuMasVas2009,
author = {E. Csuhaj-Varj{\'u} and
T. Masopust and
Gy. Vaszil},
title = {Cooperating Distributed Grammar
Systems with Permitting Grammars
as Components},
journal = {Romanian Journal of Information
Science and Technology},
year = {2009},
OPTkey = {},
volume = {12},
number = {2},
pages = {175--189},
}
@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{Csu2013,
author = {E. Csuhaj{-}Varj{\'{u}}},
title = {P and {dP} Automata: Unconventional versus Classical Automata},
journal = ijfcs,
volume = {24},
number = {7},
pages = {995--1008},
year = {2013},
}
@inproceedings{CucDGT2019,
author = {M. Cucuringu and
P. Davies and
A. Glielmo and
H. Tyagi},
editor = {K. Chaudhuri and
M. Sugiyama},
title = {{SPONGE:} {A} generalized eigenproblem for clustering signed networks},
booktitle = {The 22nd International Conference on Artificial Intelligence and Statistics,
{AISTATS}},
series = {Proceedings of Machine Learning Research},
volume = {89},
pages = {1088--1098},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v89/cucuringu19a.html},
}
@article{CucSST2021,
author = {M. Cucuringu and
A. V. Singh and
D. Sulem and
H. Tyagi},
title = {Regularized spectral methods for clustering signed networks},
journal = {Journal of Machine Learning Research},
volume = {22},
pages = {264:1--264:79},
year = {2021},
url = {http://jmlr.org/papers/v22/20-1289.html},
}
@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 = ""
}
@PHDTHESIS{Cui2011,
AUTHOR = "B. Cui",
TITLE = "Some Single and Combined Operations on Formal
Languages: Algebraic Properties and Complexity",
SCHOOL = "School of Graduate and Postdoctoral Studies
The University of Western Ontario
London, Ontario, Canada",
YEAR = 2011,
month = aug,
}
@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{CulKar86,
AUTHOR = "{\v{C}}ulik, II, K. and J. Karhum{\"a}ki",
title = {Synchronizable Deterministic Pushdown Automata and the Decidability
of their Equivalence},
journal = {Acta Informatica},
volume = {23},
number = {5},
pages = {597--605},
year = {1986},
}
@article{CulKar86a,
AUTHOR = "{\v{C}}ulik, II, K. and J. Karhum{\"a}ki",
title = {The Equivalence of Finite Valued Transducers (On {HDT0L} Languages)
is Decidable},
journal = tcs,
volume = {47},
number = {3},
pages = {71--84},
year = {1986},
}
@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{CulVal97,
author = {K. {Culik {II}} and
V. Valenta},
title = {Finite automata based compression of bi-level and simple color images},
journal = {Comput. Graph.},
volume = {21},
number = {1},
pages = {61--68},
year = {1997},}
@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 = ""
}
@inproceedings{CulKarSal2004,
author = {K. \v{C}ulik, II and
J. Karhum{\"{a}}ki and
P. Salmela},
title = {Fixed Point Approach to Commutation of Languages},
booktitle = {Aspects of Molecular Computing, Essays Dedicated to Tom Head on the
Occasion of His 70th Birthday},
pages = {119--131},
year = {2004},
editor = {N. Jonoska and
Gh. Paun and
G. Rozenberg},
series = {LNCS},
volume = {2950},
publisher = {Springer},
}
@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",
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{CurRam2016,
author = {J.~D. Currie and
N. Rampersad},
title = {Growth rate of binary words avoiding {$xxx^{R}}$},
journal = tcs,
volume = {609},
pages = {456--468},
year = {2016},
}
@phdthesis{Cur2015,
author = {R. Curticapean},
title = {The simple, little and slow things count: on parameterized counting
complexity},
school = {Saarland University, Germany},
year = {2015},
}
@article{CurLonMaj83,
author = {Curzio, M. and Longobardi, P. and Maj, M.},
journal = {Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni},
month = {3},
number = {3},
pages = {136--142},
publisher = {Accademia Nazionale dei Lincei},
title = {Su di un problema combinatorio in teoria dei gruppi},
volume = {74},
year = {1983},
}
@article{CutRad2016,
title = "Counting dominating sets and related structures in graphs",
journal = dm,
volume = "339",
number = "5",
pages = "1593--1599",
year = "2016",
author = "J. Cutler and A. J. Radcliffe",}
@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{CygLPPS2011,
author = {M. Cygan and
D. Lokshtanov and
M. Pilipczuk and
M. Pilipczuk and
S. Saurabh},
title = {On the Hardness of Losing Width},
booktitle = {Parameterized and Exact Computation --- 6th International
Symposium, IPEC 2011},
pages = {159--168},
editor = {D. Marx and
P. Rossmanith},
publisher = {Springer},
series = {LNCS},
volume = {7112},
year = {2012},
}
@inproceedings{CygNPPRW2011,
author = {M. Cygan and
J. Nederlof and
M. Pilipczuk and
M. Pilipczuk and
J. M. M. van Rooij and
J. O. Wojtaszczyk},
title = {Solving Connectivity Problems Parameterized by Treewidth in Single
Exponential Time},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}},
pages = {150--159},
year = {2011},
editor = {R. Ostrovsky},
publisher = {{IEEE} Computer Society},
}
@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},
editor = {B. Rovan and
V. Sassone and
P. Widmayer},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS}},
series = {LNCS},
volume = {7464},
publisher = {Springer},
year = {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{CygPil2012,
author = {M. Cygan and
M. Pilipczuk},
title = {Bandwidth and distortion revisited},
journal = dam,
volume = {160},
number = {4-5},
pages = {494--504},
year = {2012},
}
@article{CygPPW2012,
author = {M. Cygan and
M. Pilipczuk and
M. Pilipczuk and
J.~O. Wojtaszczyk},
title = {An Improved {FPT} Algorithm and a Quadratic Kernel for Pathwidth One
Vertex Deletion},
journal = alg,
volume = {64},
number = {1},
pages = {170--188},
year = {2012},
}
@article{CygPPW2012a,
author = {M. Cygan and
M. Pilipczuk and
M. Pilipczuk and
J.~O. Wojtaszczyk},
title = {Kernelization hardness of connectivity problems in $d$-degenerate graphs},
journal = dam,
volume = {160},
number = {15},
pages = {2131--2141},
year = {2012},
}
@inproceedings{Cyg2013,
author = {M. Cygan},
title = {Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth
Local Search},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}},
pages = {509--518},
year = {2013},
}
@article{CygKorNut2013,
author = {M. Cygan and
G. Kortsarz and
Z. Nutov},
title = {Steiner Forest Orientation Problems},
journal = siamdm,
volume = {27},
number = {3},
year = {2013},
pages = {1503--1513},
}
@inproceedings{CygEGMS2013,
author = {M. Cygan and
M. Englert and
A. Gupta and
M. Mucha and
P. Sankowski},
title = {Catch them if you can: how to serve impatient users},
booktitle = {Innovations in Theoretical Computer Science, {ITCS}},
pages = {485--494},
year = {2013},
editor = {R.~D. Kleinberg},
publisher = {{ACM}},
}
@inproceedings{CygKraNed2013,
author = {M. Cygan and
S. Kratsch and
J. Nederlof},
title = {Fast hamiltonicity checking via bases of perfect matchings},
booktitle = {Symposium on Theory of Computing Conference, STOC'13},
pages = {301--310},
editor = {D. Boneh and
T. Roughgarden and
J. Feigenbaum},
publisher = {{ACM}},
year = {2013},
}
@article{CygLPPS2014,
author = {M. Cygan and
D. Lokshtanov and
M. Pilipczuk and
M. Pilipczuk and
S. Saurabh},
title = {On Cutwidth Parameterized by Vertex Cover},
journal = alg,
volume = {68},
number = {4},
year = {2014},
pages = {940--953},
}
@inproceedings{CygLPPS2014a,
author = {M. Cygan and
D. Lokshtanov and
M. Pilipczuk and
M. Pilipczuk and
S. Saurabh},
title = {Minimum bisection is fixed parameter tractable},
booktitle = {Symposium on Theory of Computing, {STOC}},
pages = {323--332},
year = {2014},
editor = {D. B. Shmoys},
publisher = {{ACM}},
}
@article{CygJezSga2016,
author = {M. Cygan and
\L. Jez and
J. Sgall},
title = {Online Knapsack Revisited},
journal = tocs,
volume = {58},
number = {1},
pages = {153--190},
year = {2016},
}
@article{CygDLMNOPSW2016,
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}},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {3},
pages = {41:1--41:24},
year = {2016},
}
@article{CygGraHer2017,
author = {M. Cygan and
F. Grandoni and
D. Hermelin},
title = {Tight Kernel Bounds for Problems on Graphs with Small Degeneracy},
journal = acmtalg,
volume = {13},
number = {3},
pages = {43:1--43:22},
year = {2017},
}
@article{CygPPLW2017,
author = {M. Cygan and
M. Pilipczuk and
M. Pilipczuk and
E. J. van Leeuwen and
M. Wrochna},
title = {Polynomial Kernelization for Removing Induced Claws and Diamonds},
journal = tocs,
volume = {60},
number = {4},
pages = {615--636},
year = {2017}
}
@Article{Cym2007,
author = {Cyman, J.},
title = {The outer-connected domination number of a graph},
journal = {Australasian Journal of Combinatorics},
year = {2007},
volume = {38},
pages = {35--46},
}
@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 = ""
}
@article{CzaSzeWag2017,
author