A Bibliography of Publications in Theoretical Computer Science: 2015–2019

Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 12 March 2021 Version 1.107

Title word cross-reference 2n − 3 [1262]. 3 [2173, 351, 542, 869, 724, 545, 776, 287, 464, 1509, 2164, 1403, 1092, 799]. 4 [1447, 1990, 1210, 1080]. 7 [1762]. R [621]. ] [1772]. [821]. [2305]. α #SAT [1026, 1616]. ew n [1466, 2146, 1890]. ∗ [1927]. b [1893, 534]. β [315, 1621]. C∞ [89]. C [208]. C [208]. Cb (1 + 1) [2193]. (1 + ) [1953]. (1 + λ) [10]. 8 9 [1498]. D [1120, 707, 383]. D [2413]. ∆ (1,λ) [2186]. (1.408 + ) [529]. (3 + p) [2276]. 4 [2281]. DRH [1463]. (J, K) [360]. (µ, α) [212]. (n, 1) [1296]. (n, 3) F 2 → D|v =1,c≥ 1|C [1214]. F [149]. g [2064]. (n, k) max 4 [1925, 1913, 1238, 1482, 2237, 1924, 1413, [1484, 696, 2394, 1924, 1412, 1133]. (n2 − 1) 2051, 1412, 1133, 799, 361]. H [1702]. (r, l) [1829]. (s, t) [1365]. 1 [1641, 473, [1830, 2174, 1406, 1496, 2342, 694]. H [59]. i 2156, 1572, 2057, 288, 1160, 2312, 96]. 1.5 k [808]. ∞ [854]. K [387, 1153]. 1/3h [725]. 13k [948]. 2 [93, 289, 2218, 2227, 1097, 1126, 752, 2154, [873, 906, 1834, 2081, 2310, 500, 301, 542, 707, 851, 1665, 1170, 344, 623, 1663, 2313, 623, 1155, 724, 1657, 2108, 759, 1421, 609, 400, 797, 1892, 893, 1552, 1110, 1079, 325, 356, 804, 2058, 2360, 854, 1137, 1262, 1517, 1575, 2174, 2320, 1157, 1532, 50, 2239, 470, 165, 1717, 143, 39, 1403, 636, 2062, 2121]. 1689, 636, 1861, 1089, 1858, 1353, 2303]. K5 {2, 3} [695]. 2

1 2

[346]. κ [1463]. L [378, 673, 1922]. L1 1924, 2051, 361, 694]. -Fan-bundle-planar [2240, 337]. λ [506, 661]. λ2 [2170]. λβ [1641]. -forest [2218]. -frame [1079]. -free {b c} [1163]. λβη [1839]. logb(αn + β) n≥0 [208, 1830, 909]. -gapped [1890]. [1512]. log2 N [586]. M [1796, 1619, 2235]. -good-neighbor 2 3 F2 [1258]. R [693]. Z/pZ [2258]. Z [503]. µ [1925, 1913, 1238, 1413, 2051, 1412, 1133, 799]. [1748, 1670, 762, 1562]. N -graph [1829]. -graphs [953]. -group [349]. [1312, 1737, 623, 2033, 452, 861, 1349, 2305, -invariant [149]. -isometric [39, 1403]. 114, 1575, 2174, 2320, 1689, 1994, 799]. N k -kernel [948, 2303]. -kernelization [1764]. [54]. O [1568]. O(n2 log m) [1538]. O(n3) -length [1353]. -level [129]. -Mark [808]. [1989]. P [1444, 563, 1652, 1651, 1650, 1455, -matching [1893, 534]. -maximal [2156]. 1456, 1231, 1649, 1460, 923, 1648, 926, 1647, -MaxSAT [2064]. -Means [289, 851]. 2038, 1859, 1922, 123, 625, 349]. P3 -median [2038, 473, 2312, 1861]. [521, 1486, 134]. P4 [195]. Pk [909]. π -meet-semidistributive [1126]. -neighbor 1 || [672, 787]. Π1 [1017]. Π2 [1502]. P Cmax [1517]. -nested [1097]. -notation [1568]. [2281]. Q [179, 671]. Q8 [2413]. s [619, 638]. -optimal [2170]. -out-of- [1575]. -packing s2 [156]. σ [2186]. st [953]. T [1657]. -partite [2303]. -partition [636]. [129, 1574, 619, 25, 638]. t/k [2289, 1988]. -partitions [873, 906, 1834, 2081, 2310, 625]. P ω Θk [1390]. X [1287]. Z[x] [1914]. -partners [195]. -path [2239, 2164, 1092]. Z4[u]/hu2 − 1i [2046]. -paths [1365]. -permutation [452]. -placement [325]. -planar [96]. -plane -abelian [356, 1110]. -agent [301]. [1572, 1160]. -Player [114]. -protected -algebras [821]. -approval [383]. [759]. -puzzle [1702]. -Quasicontinuous -approximate [1953, 2281]. -ary [156]. -Queens [1737]. -reduction [1163]. [623, 2174, 2320, 1689, 799]. -basis [1120]. -regular [1447]. -relation [1796]. -batch [123]. -binomial [143]. -Bonacci -resolution [179, 671]. -Restricted [2235]. -bound [59]. -Calculus [695, 1157]. -reversible [50]. -SAT [1748, 506, 672, 1670, 1839, 787]. -center [2276, 1089]. -search [360]. -searcher [854]. [1859, 344, 2057, 470, 2062, 93]. -Self-Adaptation [2186]. -server [500]. -clique-colouring [724]. -clustering [797]. -set [1665, 1532]. -sets [1498]. -sink [288]. -Coloring [2360, 351, 1137, 2121]. -spaces [1922]. -spanners [212]. -component [1990]. -composition [1552]. -spectrum [315]. -star -Concave [1466]. -connected [869, 636]. [696, 2394, 1484, 1924, 1412, 1133]. -storage -connectivity [1421, 1406, 1496]. -convex [400]. -sun-free [464]. -terms [661, 1562]. [1170, 2108]. -convexity [1486, 521]. -cube -tetrominoes [1574]. -time [1538]. -trees [2320, 799]. -cubes [623, 2174, 1689, 1994]. [2154, 165]. -unambiguous [1619]. -Uncut -cut-introduction [1502]. -cycles [1858]. -uniform [287]. -variables [1210]. [1717, 1762]. -diagnosability [2289, 1988]. -visibility [2227]. -word [1463]. -words -dimensional [2033, 861, 1349, 2305]. [89]. -disjoint [623, 1262]. -distinct [752]. -domains [673]. -dominating [1155, 1892]. 1 [96]. 11th [2225]. 1st [234]. 1st-order -domination [2313]. -edge [2342]. [234]. -equicontinuous [762]. -equivalence [2146]. -expansions [1621]. -extensions 2015 [1588, 1331]. 2019 [2345, 2386]. 21st [25]. -extra [804, 1509, 1482, 2174, 2237, [323]. 24 [2386]. 24th [732]. 2CNF [1679]. 3

3 [2345, 2028]. 3-SAT [2028]. 34-36 [984]. adversary [2133]. adversary-dependent [2133]. advice [398, 575, 446]. advised 411 [984]. 429 [68]. [676]. aﬃne [1734, 1902]. AG [2305]. against [1998, 634, 676]. agent 524 [474]. 552 [1329]. 557 [1004]. [480, 301, 1475, 401, 2352, 1962]. agents [2331, 578, 1360, 1982, 1047, 710, 1489]. 607 [1486]. 60th [879, 1534, 1416]. 646 aggregate [201]. aggregating [1398]. [1023]. 657 [1354]. 696 [1496]. aggregation [546, 994, 119]. Agreement [1929, 1665, 1811, 55, 2132, 1532, 2357, 613]. 702 [2024]. 70th [2261]. 732 [2417]. 769 ahead [701]. airline [1860]. airspace [276]. [2415]. 770 [2416]. 795 [2418]. 7th [505]. AIXI [1591]. aka [1118]. al [914]. Alberto [1166]. algebra [2172, 763, 2106, 1523, 1176]. 8th [505]. Algebraic [345, 2007, 1240, 904, 2065, 489, 491, 2101, 1678, 1805, 1961, 2111, 1772, 1838, abelian [2272, 908, 2141, 1071, 356, 1110, 1752, 663, 2041]. Algebraic-coalgebraic 130, 455, 456, 1070, 858, 1333, 94]. [489]. algebras [1964, 2258, 73, 821]. Abelian-square-rich [1333]. absolute Algorand [2098]. Algorithm [404]. abstract [1226, 181, 1810]. [1003, 1657, 916, 2258, 1916, 500, 1872, 693, abstraction [825, 1983, 1358]. abstractions 149, 614, 1967, 473, 151, 526, 607, 1210, [1586, 1731, 1746]. abstractor [1776]. AC 1538, 334, 1792, 2156, 1609, 1155, 1892, 444, [2146, 2273]. AC-automata [2273]. 10, 1996, 1788, 1707, 1289, 750, 1860, 1820, Accelerate [2220]. Accelerated [1301]. 200, 1733, 1297, 815, 64, 1893, 1914, 1781, accelerating [969]. acceptors [1819]. 1365, 387, 1063, 461, 355, 779, 1769, 1764, access [1338, 254, 108, 2349, 2026, 1193, 85]. 1419, 330, 1250, 1816, 1074, 1280, 2176, 2053, account [1443]. accounts [547]. 102, 1568, 2013, 2415, 925, 2239, 2164, 599, Accumulating [2308]. accumulation 37, 636, 1861, 1653, 2161, 2067, 362, 638, [2238]. Accurate [1295]. Achieving 2055, 718, 1353, 1065, 494]. Algorithmic [1952, 2169]. achromatic [1937]. across [2189, 1239, 77, 273, 1678, 1857, 1991, 732, [2355]. action [843, 921]. activation 358, 1980, 268]. Algorithmics [525, 2195]. [531, 206]. Active Algorithms [1313, 1968, 1737, 2073, 2143, 1232, 103, 1738]. [1061, 544, 1126, 1846, 936, 1534, 1897, 2231, ACTL [1385]. Acyclic [1180]. ad 610, 1932, 2162, 1416, 2225, 2196, 1639, 600, [666, 254, 545, 656]. ad-hoc [545]. 495, 1508, 1507, 2263, 1677, 1119, 2155, 1797, adaptation [937, 2186]. Adaptive 548, 163, 1012, 1150, 34, 976, 440, 108, 110, [1381, 739, 938, 1590, 342, 334, 1018, 2193, 1873, 2326, 457, 1256, 344, 30, 55, 1026, 1725, 603, 2056, 840]. adaptively [947]. 1669, 1088, 2313, 516, 2131, 1593, 240, 1218, adaptively-secure [947]. adaptivity [56]. 687, 104, 1077, 547, 417, 679, 2222, 1723, addition [1632, 515, 2343]. additive 2187, 239, 38, 1999, 963, 2223, 2221, 49, 224, [2234, 212, 1781, 245]. additivity [780]. 1612, 658, 359, 1364, 1660, 1066, 2408, 552, adjacency [1032]. adjacent 47, 1246, 1547, 2042, 315, 499, 631, 2343, [2321, 2311, 1148, 1762]. adjusting [249]. 1911, 1232, 124, 319, 912, 1084, 350, 1087, admit [1721]. Advancements [166]. 1358, 532, 147, 88, 386, 1815, 446, 1410]. Advances [1169, 1534, 774, 426, 934]. algorithms [2285, 1265, 2019, 534, 1522, adversarial [2339]. adversaries [248]. 1039, 1435, 1086, 265, 1092, 819, 2064, 757, 4

1584, 535, 1030, 2279, 2199, 979]. [2292, 285, 1337, 427, 505, 1043, 2216, 2145, Alignment [167, 2214, 223, 895, 1548, 1425]. 413, 1872, 1062, 1382, 394, 2148, 345, 1760, alignment-free [1425]. aligns [1741]. 2349, 547, 306, 1806, 2133, 539, 1520, 251, all-pairs [1419]. All-to-all [604]. alliances 1551, 2264, 932, 1140, 380, 1854, 1065]. [224]. allocation [802, 28, 306, 319]. Applicative [263]. applied allocations [1901, 803, 393]. almost [672, 1866, 581, 1561, 943, 2186]. Applying [1182, 1514, 307, 13, 1518]. [1370, 1111]. approach [2218, 302, 1269, 427, almost-conﬂuent [307]. alphabet 1294, 1804, 1373, 1963, 1101, 71, 1713, 1925, [1316, 2327, 1179, 1063, 870, 2270]. 629, 253, 382, 1545, 1979, 336, 2322, 2166, alphabet-independent [1063]. alphabetic 977, 1459, 1425, 874, 692, 1981, 169, 37, 663]. [1649]. alphabets [1570]. ALT [732, 1588]. Approaches [1416, 1710]. approval alternans [1985]. Alternating [2168, 383]. Approximability [2375, 1766, 1990, 1673, 2305, 493, 2060, 33]. [2181, 324, 1134, 3, 68, 2069, 2286, 1369, 1824]. Alternating-time [2375]. Alternation Approximate [2280, 281, 1922, 1929, 546, [1748, 2031]. alternative [854]. always 951, 894, 803, 1041, 792, 1436, 1012, 51, 998, [703, 1182]. Ambiguous [35]. Amihood 1953, 1364, 428, 2281, 1304, 1086]. [879]. Amir [879]. among [674]. amortized Approximating [2134, 1989]. ampliﬁers [1933]. analyses [2218, 1156, 2057, 1236, 1089, 855]. [823, 567]. analysing [763]. Analysis Approximation [495, 432, 522, 914, 251, 12, 2186, 817, 262, [523, 628, 1725, 2131, 343, 47, 912, 350, 636, 2267, 1338, 281, 427, 282, 1404, 108, 876, 2175, 819, 1858, 1697, 289, 1508, 1987, 440, 2326, 151, 1629, 253, 750, 23, 2079, 1857, 1515, 435, 384, 55, 1155, 1920, 1759, 775, 545, 2221, 939, 1985, 374, 931, 493, 832, 14, 748, 1185, 1396, 949, 2229, 708, 529, 1659, 697, 2125, 1842, 494, 521, 1486, 1518, 1740, 1568, 1688, 1911, 319, 1074, 532, 1301, 147, 386, 1715, 2241, 1942, 1653, 360, 1881, 2392, 1927]. 1039, 37, 1861, 2067, 1030, 2279, 979, 638]. analytic [481]. Analytical [2179]. approximations [465]. arbitrary Analyzing [2052, 616]. anarchy [2122]. [1607, 1235, 1108, 1327, 1640, 1384]. ancestor [1065]. Ancestors [561]. Anchor arborescenses [744]. Arc [742]. anchored [1037]. Angelic [1917]. [526, 1347, 1235, 911, 1511, 330]. angle [900]. angular [1578]. annihilating arc-consistency [1511]. arcs [1668, 1248]. [211]. annotated [1500]. Annual [2216]. argumentation [2149]. arguments annulus [1656, 1607]. anonymity [1818]. [523, 1939]. arithmetic anonymization [515]. anonymized [2231]. [2398, 1728, 2023, 1472]. arithmetization Anonymous [216, 758, 654, 1181, 1089]. [443]. arrangements [2278]. array [1310]. answering [193, 2118]. answers arrays [437, 1539, 2408, 2409, 1271, 2412]. [2372, 1706]. ant [14]. antenna [250]. arrow [1384]. art [2409]. articulated [776]. antennae [657, 314]. antennas [1479]. anti ary [623, 2174, 2320, 1689, 799]. ASM [1069, 1648]. anti-exponent [1069]. [987, 1918]. ASP [431]. aspects anti-spikes [1648]. antimatter [1456]. ants [1797, 1678, 1991, 1802, 234, 358]. [580]. Antunes [2024]. Any [287]. assembling [1630]. Assembly Aperiodic [972, 1188, 1323]. Apollonian [1459, 614, 562, 1191, 1218, 1800, 1217]. [1473]. Application [2206, 185, 723, 262, assessment [1145]. asset [448]. assignable 2267, 270, 1345, 526, 1540, 1729, 567, 1951, [755]. assignment [1946, 2281, 124, 718]. 102, 1615, 2127, 969, 1962]. Applications assignments [862, 849]. associated [1543]. 5

Associative [127, 1143]. assumptions [718]. backward [2165]. bad [477, 39]. [2344, 2329]. Asymptotic Balance [2397]. Balanced [1418, 2177, 551, 10]. Asymptotically [385, 2288, 1509, 1950, 2117, 1752, 636, 2342]. [1933]. asynchronous Balancedness [2094]. balancing [520]. [16, 1444, 579, 1895, 1636, 1175, 1162, 697, balls [855]. Bandit [995]. bandwidth 1630, 1532, 710, 1489, 2119]. [1524, 532]. barrier [198]. barriers [1932]. asynchronously [1054, 2290]. at-most-one base [1554]. based [1959]. ATL [2375]. atomic [1120, 367, 1338, 302, 887, 1311, 1916, 972, [1531, 1125, 1971]. attached [1530]. attack 1804, 661, 270, 71, 1873, 1642, 850, 1088, [1483, 2073, 1690, 1036]. attackers [2148]. 1609, 2168, 2046, 629, 775, 1422, 2238, 421, attacks [1998, 634, 1952]. attractively 1909, 1550, 2344, 1007, 939, 1673, 179, 931, [1219]. Attractor [429]. attribute 986, 343, 1998, 776, 493, 1840, 841, 1457, [1642, 1197]. attribute-based [1642, 1197]. 1085, 1764, 1939, 1683, 2169, 1434, 1390, attributes [1345, 1193]. auctions 2284, 1924, 366, 754, 1459, 568, 833, 1197, [1821, 145, 131, 1686]. audio [1884]. 932, 698, 692, 2371, 169, 588, 107, 2161, 2035]. auditing [2405]. augmentation bases [1352, 1797, 149, 814, 1754, 2343]. [2230, 2218]. augmented [2033, 1209]. basic [1586, 1603, 317, 736, 58, 466]. basis Automata [1120, 839]. batch [123, 1709, 1159, 207, 124, [2206, 185, 1183, 1803, 1132, 1594, 2383, 752, 237, 1769, 140, 714, 1435]. Batcher [874]. 1169, 71, 407, 187, 1051, 457, 436, 1495, 2159, Batching [681]. battle [1629]. Baum 838, 728, 2209, 193, 1175, 2308, 2104, 86, [2178]. Bayesian [2302]. BC [209]. 1279, 1289, 565, 1230, 762, 1506, 593, 1278, BC-subtrees [209]. BDI [1962]. be 2384, 2273, 188, 1751, 62, 2381, 1203, 1731, [727, 1800, 1717, 96]. Beachcombers’ [577]. 825, 1650, 1766, 190, 1321, 183, 765, 191, Beating [349]. beaver [962]. beeping 329, 920, 1280, 1113, 205, 490, 1809, 106, 92, [2138]. behavior [1286, 1229]. behavioral 2114, 2382, 1324, 2324, 650, 1022, 1894, 2211, [1637]. behaviors [417, 2112, 1113, 1340]. 371, 1378, 612, 2188, 857, 1187, 1189, 1385]. behaviour [1183, 762, 1746]. Behavioural automatic [2290, 2095, 1077, 25, 2315, 991, [1776]. behaviours [1808]. being [129]. 795, 2231, 550, 2160]. automaticity [2315]. Belief [1756, 1886]. benefit [56]. benefits Automaton [1234]. Autonomous [2048]. Bertoni [1169, 1166]. Bertrand [597, 1810]. auxiliary [1827]. [1931]. best [1312, 1769]. Better auxiliary-input [1827]. availability [61]. [2079, 1079, 500, 703, 545, 1821, 1193]. available [704]. Average between [74, 1636, 1728, 1556, 278, 1366, [151, 590, 88, 627, 408, 402, 170, 538, 165]. 87, 804, 1955, 2113, 650, 371, 1435]. Average-case [590, 408, 170]. Avoidability betweenness [1429]. Beyond [1662, 1077, 1323, 455]. Avoidance [2403, 1783, 1226, 728, 1259, 994, 2019]. [1754, 2257, 782, 2268]. Avoiding BFS [270]. BFS-based [270]. BGP [445]. [143, 2093, 621]. aware [1150, 1409]. axiom Bi [1207]. Bi-objective [1207]. biased [637]. axiomatization [2091, 685]. axioms [1074]. bichromatic [2066]. Biclique [1723]. [1225, 1375]. axis [2013, 2415]. bicliques [872]. bicriteria [1396, 229]. axis-parallel [2013, 2415]. bidding [1272]. bidegree [1296]. bidirectional [894]. bifix [1168, 2208, 2210]. B [2024]. Back [559, 2209]. Backbone bifix-free [2208, 2210]. bifurcation [1985]. [208, 545]. backlog [496]. backtracking Big [1416, 965]. Bigraphs [180, 2334]. 6 bijection [1104, 1907]. bilevel [386]. 1415, 1426, 1432, 1440, 1462, 1470, 1477, bilinear [30, 2236]. bimachine [2238]. Bin 1487, 1115, 1116, 1129, 1139, 1147, 1154, [465, 399, 913, 551, 469, 803, 446, 393]. 1161, 1164, 1177, 1184, 1190, 1196, 1202, 1206, Binary 1215, 1224, 1228, 1233, 1243, 1253, 1261, 1268, [1059, 1120, 2030, 1399, 291, 379, 908, 31, 1275, 1288, 1497, 1503, 1739, 1753, 1773]. 2403, 1316, 924, 621, 1318, 1570, 2079, 1490, Board 725, 1768, 690, 1583, 1323, 1064, 1907, 1403]. [1782, 1790, 1801, 1813, 1825, 1837, 1844, binding [2185]. binning [1424]. Binomial 1852, 1862, 1870, 1877, 1504, 1516, 1525, [456, 143, 1956]. bins [2309]. biochemical 1533, 1549, 1560, 1564, 1573, 1580, 1587, [922, 283]. biological [2267, 281, 280, 109]. 1597, 1605, 1613, 1620, 1627, 1634, 1638, Biology [278, 426, 559]. bipancyclicity 1644, 1661, 1889, 1896, 2120, 2128, 2135, [471, 809, 807]. bipartite 2144, 2152, 2163, 2171, 2182, 2194, 2205, [97, 2070, 1400, 625, 1899, 40, 1391, 2020, 2215, 2224, 2233, 2245, 2260, 2274, 2291, 748, 2259, 2015, 88, 1615]. bipartition 2301, 2346, 2368, 2376, 2387, 2400, 1906, [1135]. birecurrent [1894]. bireversible 1915, 1919, 1926, 1934, 1941, 1947, 1954, 1960, [1506]. Birthday 1965, 1976, 1986, 1992, 1993, 2001, 2008, 2014, [1416, 879, 1534, 2261, 1036]. Bisimilar 2025, 2034, 2044, 2054, 2068, 2077, 2088]. [1339]. bisimilarity [74, 1972]. Boltzmann [419]. Bonacci [2235]. Bisimulation [72, 428, 1979, 668, 372]. bondage [2359]. Boneh [1952]. Book bistars [1828]. bit [1909, 1035]. bit-pair [166, 1660]. boolean [992, 963, 146, 88, 1615, [1035]. Bivalent [481]. Bivariate [1518]. 1623, 826, 2172, 2403, 429, 127, 849, 1259, black [399, 502, 104, 595]. black-box [104]. 1957, 2256, 2192, 1322, 233, 1752, 431]. blips [1325]. block Boosting [466]. bootstrap [19, 1517]. [605, 607, 1059, 815, 112, 1140]. Borda [757]. Border [1061]. bordered block-interchange [607]. [1335]. borders [622]. Born [947]. both block-interchanges [1140]. blockers [471]. bottleneck [161]. Bound [1830]. blocking [507, 784]. blood [567]. [2287, 851, 613, 462, 225, 59, 404, 419, 2126, blowing [219]. Blue-split [1369]. Board 447, 1959, 1524, 349, 1952]. [1687, 1695, 1704, 1711, 1726, 1745, 1758, Bound-decreasing [2287]. Boundary 1765, 1654, 1667, 1671, 1675, 1682, 27, 7, 8, [646, 1380, 522, 1636, 189]. Bounded 264, 277, 284, 296, 308, 321, 333, 347, 365, 377, [1826, 76, 310, 1868, 1011, 887, 2029, 223, 391, 405, 410, 424, 433, 449, 459, 475, 484, 492, 1734, 2154, 2083, 311, 780, 1006, 876, 316, 504, 512, 524, 536, 555, 556, 21, 557, 69, 75, 82, 1920, 43, 138, 1142, 816, 2375, 744, 1368, 91, 98, 105, 113, 120, 128, 137, 144, 152, 158, 2229, 1523, 520, 1855, 890, 521, 1486, 1135, 168, 177, 184, 194, 203, 214, 222, 232, 241, 255, 1376, 2378]. bounded-degree [521, 1486]. 582, 583, 846, 856, 865, 875, 878, 897, 905, 918, bounded-retrieval [1142]. Bounding 927, 930, 933, 946, 956, 964, 974, 985, 988]. [51, 220, 396, 477]. Bounds Board [2294, 2031, 1596, 1594, 2134, 703, 653, 1034, [997, 1005, 1014, 1024, 1042, 1050, 1056, 1073, 1026, 869, 2366, 1045, 777, 1616, 1351, 872, 584, 639, 640, 659, 665, 675, 684, 688, 699, 2353, 1072, 1710, 1079, 2059, 1902, 1493, 709, 715, 726, 731, 741, 751, 760, 773, 785, 2042, 20, 765, 941, 2412, 1890, 1199]. box 790, 800, 811, 820, 828, 834, 1081, 1094, 1292, [104, 1680]. boxed [1538]. boxed-mesh 1307, 1326, 1330, 1336, 1343, 1346, 1355, [1538]. bracing [543]. Braids [2105]. brain 1371, 1377, 1383, 1387, 1395, 1402, 1407, [2106, 844]. Branch [600, 1820, 698]. 7 branch-and-merge [1820]. cares [1542]. Carlo [938, 941, 942, 943]. Branch-and-reduce [600]. Branching carpenter [267]. cartesian [150, 644, 370, 668, 372]. branchings [385]. [373, 1372, 604, 1351, 84, 689, 1204]. Brane [282, 1404]. breaches [408]. cascade [2203]. cascaded [2308]. cascades breakdown [960]. breaking [2049]. [353]. cascading [541]. case [600, 302, 394, breakpoint [1717]. bribery 408, 151, 43, 138, 2100, 404, 590, 170, 2269, [1255, 383, 1945]. broadcast 306, 247, 1047, 102, 2027, 1303]. case-based [1642, 604, 2331, 160, 1998, 115, 656]. [302]. cases [267, 1492]. Catalan [2093]. Broadcasting [254, 747, 53]. Brownian catalytic [764]. Catastrophic [541]. catch [1373]. Bruijn [1481, 1789, 1625]. [810, 2293]. Categorial [197]. categorical Brzozowski [2403]. Bubble [1980, 292]. categories [373]. Category [1792, 952, 2130]. Bubble-Flip [1792]. [101, 1961, 1204]. catenation [2403]. bubble-sort [952, 2130]. bubblesort [1211]. caterpillar [1696]. Cauchy [79]. Causal Bucharest [1849]. Büchi [151]. Budget [282, 155, 2003]. causalities [769]. causally [1629, 802, 269, 2221]. Budget-constrained [1501]. Cayley [130]. CCA [2344, 2307]. [1629]. budgets [145]. Buffer CCA2 [914]. CCA2-secure [914]. CDS [298, 1513, 1602, 1246, 1643]. buffering [697]. Celebrity [980]. Cell [772, 2134, 564]. [1246]. bunch [469]. bunched [686]. Cell-like [772]. cell-probe [2134]. cells bundle [1641]. Burning [1835, 2294]. [2181, 1741]. cellular [1132, 838, 1175, 1230, Burnside [1506]. burnt [589, 227]. 762, 196, 498, 920, 205, 1187]. center Burrows [1540, 2162]. Busy [962, 57]. [1507, 1859, 802, 93, 344, 903, 2057, 2087, butterfly [1047]. button [1585]. buyback 2394, 1988, 2226, 470, 2062, 1491]. [2059]. BWT [1422, 1423]. BWT-based centerpoint [693]. central [401, 2189]. [1422]. Byzantine [613, 1531, 1929, 1532]. centrality [1429]. century [323]. certain Byzantine-tolerant [1531]. [2372, 2317, 25, 453, 2124]. certificate [756, 1550, 1955, 324]. certificate-based C [2146, 1772]. cacti [899]. cactus [1550]. certificateless [901]. certificates [1859, 1657, 815]. cadences [1417]. Calculi [1421]. ceteris [1125]. chain [282, 74, 2147, 2007, 182, 1404]. Calculus [871, 1614, 1574, 996]. chains [1748, 506, 686, 508, 77, 1341, 672, 1670, [1632, 1431, 1841]. challenge [139]. change 2366, 1839, 787, 1342, 1376]. call [506]. [740, 12]. changeover [744]. Changing call-by-value [506]. calls [1027]. Can [652]. channel [1717, 727, 2219]. Canadian [1697]. [1381, 2148, 1642, 691, 1909, 428, 1401]. canalizing [1244, 2256]. Cancellation [311]. channels [254, 2349, 867, 931]. Cancellation-free [311]. candidate [1270]. characterisation [257]. characteristic candidate-sequential [1270]. canonical [2090, 1108, 1083, 1297]. characteristics [629, 490]. Canonicity [2099]. Cantor [234]. Characterization [1287, 705]. Cantor-like [705]. capabilities [1260, 291, 1279, 2242, 16, 1100, 116, 2203, [2148]. capability [1942, 2392, 1927]. 248, 417, 1674, 921, 215, 670, 1390, 1568]. capacitated [93, 681]. capacities characterizations [1972, 1836, 1864, 2378]. [164, 2125]. capacity [1414, 844, 573]. characterized [394, 1650]. Characterizing capture [293]. Card [754]. Card-based [259, 370, 1806, 112]. characters [1101]. [754]. cardiac [1985]. cardinalities [1110]. cheapest [679]. cheaters [1247]. cardinality [624, 1511, 1430]. cards [1247]. Chebyshev [2312]. checkability [1530]. 8

Checking [367, 768, 1916, 427, 1974, 876, closure-involution [2100]. closures 1728, 629, 1751, 986, 669, 169, 2060, 2061]. [1797, 648]. cloud [1088, 2405]. chemical [1980, 1979, 832, 2115, 1981]. cloud-based [1088]. clubs [2103, 1714]. Chern [1297]. cherry [1577]. clues [1848]. cluster [439, 1409]. clustered cherry-picking [1577]. chess [939, 940]. [129, 608, 2284]. clustered-level [129]. Chinese [939, 413]. choice [1039]. Clustering cholesterol [567]. choosability [1148]. [1076, 797, 902, 1601, 1781, 447, 632, 1423]. choosing [2168]. chop [1319]. Chord clusters [440]. CNF [1959, 2064]. co [1918]. chordal [1478, 122, 102]. co-comparability [439, 1967, 1817, 724, 2167, 2246, 1478, 175]. [1478, 122]. co-optimization [102]. chordality [816]. chores [352]. chosen Coalgebraic [490, 491, 1809, 489]. [603, 26]. chosen-key [26]. Christoffel coalgebraically [488]. coalitional [706]. [1793, 1106]. Chromar [1982]. chromatic coating [1222]. coboundaries [2094]. [2306, 2341]. chromatin [2269]. COCOA [2216]. code [43, 1849, 181, 566]. Chronnectomics [1545]. chunks [160]. codes [1096, 1604, 341, 1174, 2046, 1201, Church [307, 1465]. CIAA [2206, 185]. 1940, 1579, 863, 2000, 1219]. coding ciliates [562]. ciphertext [702, 336, 2161, 840]. coding-based [2161]. [1642, 603, 1197, 588]. circle codomains [495]. CoFI [1777]. cognition [2066, 1528, 2082]. circles [503]. Circuit [1887]. cognitive [843]. Cograph [1565]. [1472, 1616, 1710, 839]. circuits cographs [2154, 1770]. coherence [1225]. [722, 427, 311, 1026, 644, 2397, 253, 423]. coiling [1713]. Coin [2278]. coincide [2254]. Circular [900, 898, 526, 1149, 1107, 2271, coli [429]. collaboration [1461]. Collatz 1662, 911, 2242, 330]. circular-arc [725, 2]. collection [1434]. collections [911, 330]. circulatory [567]. [1271, 2037]. Collective [2371]. colliding circumference [1136, 2041]. class [1295]. colonies [1652]. colony [1650, 14]. [164, 2142, 294, 1102, 1200, 1297, 298, 1390, color [1656, 971, 2198, 630, 855, 595]. 955, 153, 1039, 1376, 1237, 1596, 96]. classes color-spanning [2198, 630, 855]. colorable [1750, 2251, 1012, 503, 1611, 2, 65, 263, 678, [2040, 2361]. colored 725, 2040, 991, 1650, 1110, 1009, 2124, 1380, [1101, 749, 468, 1541, 2395, 1676]. colorful 1465, 2200, 1783]. Classic [275, 481, 1040]. [1759]. Coloring classic-like [481]. classical [1677, 1930, 2360, 346, 208, 351, 398, 2222, [789, 406, 151, 510, 1189, 1962]. 1180, 1899, 1763, 1137, 2042, 1434, 1510, classification [1757, 2220]. clauses 1524, 6, 1004, 596, 1242, 917, 1762, 2121]. [1679, 2108]. claw [1898]. claw-free [1898]. colorings [2154, 95, 1555, 1815]. colorless cleaners [574]. cleaning [498]. Clifford [1327]. colors [1930]. coloured [393]. [2172, 1822]. clique [304, 2155, 1370, 1724, colouring [2328, 2418, 898, 724, 658]. 724, 170, 519, 2246, 2016, 677, 346, 581]. Colussi [725]. combination [1040]. clique-decomposition [1370]. combinations [1322]. Combinatori [626]. clique-hypergraphs [346]. clique-width Combinatorial [305, 2136, 2216, 90, 131, [304, 2155]. cliques [1724, 724, 2021, 602]. 2351, 608, 341, 2269, 114, 1272, 340]. clones [1348, 2364]. close [295, 1494]. Combinatorics closed [2263, 373, 1204, 1372]. closest [622, 45, 1534, 1309, 1331, 1025, 422, 1670]. [2161, 2199, 435]. Closure [497, 2002, 805, combinatory [1163]. combined [2403]. 1123, 2100, 370, 1770, 276, 190, 2382, 1122]. come [859]. Comer [2258]. comma [1096]. 9 comma-free [1096]. Command [986]. 1279, 724, 590, 170, 441, 1595, 777, 849, Command-based [986]. Comment [725]. 1601, 1368, 356, 1000, 1763, 1955, 1270, 435]. commitment [1909, 348]. committees complexity [2168]. common [1411, 310, 1537, 889, 2365, [1002, 2385, 497, 2212, 791, 1755, 2080, 2381, 229, 124, 2285, 48, 1522, 1304, 1353, 1065]. 2409, 539, 2247, 648, 2111, 550, 247, 592, 1943, communicating [1054, 1495, 1455]. 119, 2020, 632, 805, 705, 1390, 2243, 1212, 852, Communication [651, 576, 242, 2318, 1029, 633, 571, 1157, 1284, 92, 494, 649, 2265, 794, 19, 867, 931, 1558, 1575, 2027, 2153]. 2359, 2390, 1518, 389, 456, 2268, 1146, 2153, communicationless [2308]. 117, 2210, 2318, 383, 1824, 2378, 1945, 1705, communications [1973]. communities 2010, 29, 2303, 1697, 2118, 651, 682, 242]. [682, 1781]. community [2011, 244]. complexity-theoretic [2118]. Component commutative [283, 915, 1563, 784, 1990]. components [1143, 1476, 1735, 43, 138, 54, 127, 1766]. [1759, 2109, 776]. componentwise commutativity [806]. Compact [1698, 2417, 1305]. composable [1041]. [1527, 1064]. compacting [1642]. Composition [2178, 1078, 1552, 1237]. comparability [1478, 122]. comparative Compositional [1867, 2101, 1778]. [2203]. compare [1425]. Comparing compositionality [74, 481]. compound [1980, 2365, 1943]. comparison [1585]. Comprehensive [417]. [1658, 717, 1390, 227, 1237]. comparisons Compressed [1480]. compartment [567]. [594, 1724, 188, 885, 1571, 1066, 895, 1958]. compatibilities [681, 1435]. compatibility compressibility [1251]. compression [4, 474, 237]. Competitive [516, 797, 23, [737, 343]. compressors [1536]. 1246, 1388, 551, 679, 1045, 733, 360]. compromises [306]. Comput compiler [1854]. complement [368]. [2418, 1023, 474, 1329, 2417, 1354, 984, 68, complementary [2201]. Complete 2416, 1496, 1004, 1486, 2415, 2024]. [2203, 921, 1049, 116, 1450, 2070, 786, 1264, Computability [234, 1591]. computable 1297, 1137, 2069, 1559, 683, 274, 637]. [257, 2275, 1240]. Computation completely [1008, 2176]. Completeness [9, 309, 476, 2119, 2225, 1069, 1872, 1294, [824, 1670, 667, 479, 1318, 593, 1581, 1242]. 1062, 270, 2097, 429, 1149, 999, 2308, 2012, Completion 1071, 1083, 32, 487, 2005, 1203, 669, 833, [1581, 238, 755, 2335, 714, 1468]. Complex 2265, 1173, 2414, 218, 18, 2378, 637, 285]. [1951, 842, 79, 382, 329, 1301]. Computational [445, 1175, 426, 592, 1459, Complex-demand [1951]. complexes 1217, 794, 1197, 103, 2073, 682, 1318, 2344, [712, 334]. complexities [2073, 1783]. 2116, 2049, 923, 1647]. computationally Complexity [722, 768, 439, 1903, 975, 2207, [275]. Computations 1655, 256, 1666, 198, 2222, 2208, 1897, 95, [728, 16, 2050, 443, 1300, 1304]. compute 2075, 403, 576, 2000, 641, 2069, 2377, 1127, [1297, 1914, 779, 2162]. Computer 1517, 521, 1486, 798, 172, 817, 1135, 549, [774, 278, 559, 934, 1879]. computers 1411, 1239, 310, 1143, 1868, 1011, 1829, 1152, [999, 831, 1884]. Computing 186, 2310, 1684, 1987, 1734, 1010, 788, 1013, [2372, 891, 1607, 1141, 395, 908, 1481, 2185, 2317, 303, 908, 712, 258, 935, 1623, 480, 515, 31, 770, 862, 624, 2250, 1798, 2341, 423, 1600, 2096, 517, 1586, 2403, 822, 384, 2141, 2226, 1526, 15, 719, 412, 602, 1306, 2258, 99, 445, 1257, 642, 1316, 327, 1698, 2417, 1850, 2227, 548, 693, 149, 1669, 1370, 867, 1707, 1175, 527, 706, 104, 1759, 263, 2190, 259, 83, 987, 1327, 382, 315, 841, 1520, 1816, 754, 10

1157, 2116, 1442, 1743, 698, 1802, 626, 1025]. [912, 1067, 46, 968]. Conspiracy [944]. concatenating [1789]. Concatenation Constant [1953, 1074, 655, 1872, 814, 1920, [1282]. Concatenation-free [1282]. 240, 2018, 746, 631, 907, 588]. constant-size concave [1474, 2204, 1367, 1466]. [588]. constant-sized [631]. constant-time Concentration [1191]. concepts [1093]. [1872, 2018]. Constrained concerning [987, 2255]. Concurrent [542, 367, 1381, 1445, 1834, 2081, 351, 316, [36, 727, 1327, 1386, 511, 1340]. condition 619, 1629, 1134, 1193, 530, 319, 2186, 1700]. [1451, 2058, 2192, 1855, 1305]. Conditional constraint [627, 61, 1472, 1806, 1959, 2286, [1672, 1078, 60, 1237, 807, 2373, 171, 1925, 916, 1561, 511, 2371, 169, 1401, 1093]. 1913, 804, 1007, 1238, 1948, 2289, 1988, 717, constraints [1841, 2325, 269, 1946, 448, 482, 1482, 2237, 1924, 1225, 1412, 799, 618]. 2140, 83, 246, 1798, 1601, 2221, 173, 1511, conditions [1869, 1345, 565, 73, 1582, 96]. 990, 2197, 1266, 890, 1397, 141, 585]. Conference [2216, 732, 2225, 626, 1025]. construct [599]. Constructing confidence [941]. configuration [2045]. [1789, 744, 1543, 219, 1008, 545]. configurations [2185]. confirmer [716]. Construction [2046, 2343, 547, 1142, 1433, Conflict [573, 95, 2063, 1815]. conflict-free 2238, 130, 888, 1615, 2072, 2035]. [95, 1815]. confluence [192]. confluent Constructions [818, 1752, 752, 1234, 32, 35, [307]. conformance [367]. Congest [1876]. 490, 1064, 118, 345]. Constructive [1972]. CONGESTBC [1920]. Congested [581]. constructs [1320]. consumption congestion [1902, 1971]. congruential [1398, 1414]. contact [814, 1622]. [307]. conically [2186]. conjecture containing [2393, 1248]. Contention [2111, 2255, 1619, 39]. Conjectures [1265]. Contention-sensitive [1265]. [390, 2403]. Conjugacy [863, 1693, 1200]. contest [2231]. contests [1629]. Context conjunction [754]. conjunctions [1125]. [1735, 1260, 332, 43, 138, 1674, 786, 646, 192, conjunctive [721, 1179, 720]. Connected 1324, 1285, 904, 736, 1378, 676]. [252, 1859, 270, 517, 1967, 353, 1256, 1492, Context-free [1735, 1260, 43, 138, 1674, 1218, 2300, 869, 1194, 816, 352, 3, 68, 2286, 786, 646, 1285, 904, 736, 1378, 676]. 554, 1741, 1022, 134, 636, 1997]. contexts [1618, 261, 1055, 290]. connectedness [2394, 1691]. Connecting Contextual [1310]. contextuality [1883]. [2071]. connection continuation [1295]. continuity [1230]. [935, 1003, 611, 2058, 554]. Connectivity Continuous [314, 1221, 2230, 121, 2155, 1990, 1145, 1672, [1269, 711, 1916, 1373, 376, 1114, 2035, 1076]. 1492, 327, 250, 657, 83, 1421, 1366, 952, 804, continuous-time [1916]. Continuously 695, 1755, 1020, 1509, 2289, 1988, 2358, 717, [1940]. continuum [442]. contour 853, 2174, 1157, 1406, 1496, 2389, 1928, 2041, [1294, 568]. contour-based [568]. contours 2378, 1569, 361, 694, 915]. [1457]. contractibility [1254]. Contraction connectivity-preserving [1755]. [1830, 954, 518]. control [1310, 1338, 305, consecutive [890, 532]. consensual [1173]. 771, 1867, 1193, 2399, 383, 1499]. consensus [1665, 1586, 248, 1546, 2009]. controllability [2370]. controlled consequences [463]. conservation [1318, 1818]. controller [1203]. Controlling [414, 1446]. conservative [1125]. [664, 1270, 2112]. Convergence Considerations [2045]. considered [553]. [1931, 2, 419, 725, 697, 286]. convergent consist [373]. consistency [955]. conversion [1709]. conversions [1511, 818, 2371, 792]. consistent [2243]. Convex 11

[1685, 625, 544, 1466, 1608, 2252, 784, 1170, [1653]. crossed [777, 1913, 1406, 1496]. 2207, 2108, 1400, 2212, 2354]. convexities crossing [900, 1554, 117]. crossing-free [606]. convexity [438, 521, 1486]. [1554]. crossings [2173]. crossover [1185]. convolution [775]. convolution-based crown [1764]. CRT [2336]. CRT-exponent [775]. cooperating [664]. cooperation [2336]. cryptanalysis [2336]. cryptograms [1461]. cooperative [1267, 1738]. [85]. cryptographic [2402]. cryptography Coordinate [742]. Coordinating [125]. [1760, 595]. cryptoscheme [1035]. coordination [238]. cop [293]. coproducts cryptosystems [1483, 2035]. [1964]. Cops crystallization [945]. CSP [1917]. CSPs [2298, 2297, 527, 1291, 950, 2143]. Core [849, 1259, 1582]. cube [228, 624, 803]. corners [2252]. corrected [171, 2033, 2320, 1406, 1496, 2241, 799, 1997]. [1328]. Correction [2417, 743]. corrections cube-connected [1997]. cubes [623, 1515, [1496]. correctness [1362, 182]. 1913, 695, 2174, 143, 1413, 1209, 1689, 1994]. Correlation [1026, 632]. Correspondence cubic [702, 294, 1948, 2237, 618]. [452, 789, 77]. Corrigendum cumulative [711, 1185]. Curry [789]. [2418, 1023, 474, 1329, 1354, 984, 68, 2416, curvature [1427]. curve [777]. curves 1004, 1486, 2415, 2024]. coset [2258]. [2407]. cut coset-translation [2258]. Cost [163, 619, 552, 2020, 1502, 1621, 981, 610, 638]. [959, 1208, 628, 1905, 28, 468, 744, 538, 2059, cuts [978, 1400, 1002]. cutting [1700]. CVP 2286, 1575, 530, 1485, 533, 206]. [750]. cycle Cost-sharing [959]. Costas [1534]. costs [2306, 2258, 1360, 1030, 2279, 2130]. Cycles [1563, 753, 966, 90, 2281, 531, 1787]. [2311, 967, 468, 1789, 910, 1137, 300, 1717, Counter [1173, 1728, 1730, 806, 2393]. 2211, 1242, 1689, 1643, 1762, 1997]. cyclic counters [1735, 1836]. Counting [1183, 2046, 2028, 612]. cyclically [2303]. [1098, 2138, 2129, 1508, 1404, 1021, 5, 1329, cyclicity [1530]. cycling [652]. cylinder 1328, 849, 949, 146, 2110, 1456, 1721, 1390, [390, 637]. cylindric [1096]. 1212, 1615, 880, 1086, 466]. countings [546]. courteous [272]. Cover [1274, 600, 2280, D [2173, 542, 545, 609, 776, 387, 1153]. D0L 652, 1018, 83, 1241, 2250, 1278, 2385, 1138, [1768, 2242]. D0L-systems [2242]. DAG 2125, 1764, 2063, 2013, 2415, 1615, 1622, [1049]. DAG-width [1049]. dagger [491]. 2164, 2228, 973, 134, 1092, 819, 1030, 2279]. dangerous [655]. dark [939]. Data coverability [1866]. coverage [53, 1882, 903, 1409, 1416, 2372, 1803, 579, [198, 2221, 1659, 172]. covered [1829]. 318, 523, 965, 240, 2405, 221, 2018, 970, Covering 1422, 921, 2087, 2394, 1772, 119, 587, 1988, [1608, 1420, 164, 1681, 2326, 2181, 2244, 748, 1434, 1891, 1265, 2137, 470, 2049]. 2408, 2409, 592, 1932, 2412, 1787, 553, 535]. database [1998, 482, 633, 1376]. Databases coverings [1724]. covers [1576, 623, 519, [1124, 340]. dataﬂow [1088]. dataset [1088]. 2408, 1262, 848, 713, 2086, 599, 33]. covert date [229]. DAWGs [2273]. DCell [931]. crash [1532]. crash-prone [1532]. [1988, 599]. Deadline [2032]. Deadness creation [148, 1603]. Crick [928]. Dealing [1210, 17, 1722]. decay [1495, 2159, 1453]. crisis [1545]. criterion [1, 984]. December [2345, 2386]. [90]. Critical [2117, 1002, 870]. Decentralized [983, 17]. deceptive [2184]. Crochemore [2235]. Cross [1168, 1653]. Decidability Cross-biﬁx-free [1168]. Cross-Entropy [1693, 1010, 406, 1636, 672, 1751, 1864, 190]. 12

Decidable [1865, 153]. deciding [1054]. [641, 92, 805, 2377]. descriptive [1707]. decimation [1295]. Decision [1077, 313, Design 379, 151, 2380, 629, 1875, 994, 2006]. [27, 1223, 493, 432, 279, 1593, 59, 2405, 1398, decisions [2373]. decomposability [1368]. 28, 1718, 1220, 2047, 107, 969, 1041]. decomposable [2079]. decomposed [1717]. designated [716]. Designing [2199, 104]. decomposing [2131]. Decomposition Designs [1581]. destination [2027]. detect [2115, 1167, 1872, 948, 1370, 1174, 1742, [1065]. detectability [1379]. detecting 1764, 150, 668, 2016, 1981]. decompositions [1052]. detection [2300, 672, 2341, 951, 482, 698, 1305]. [80, 522, 244, 654, 2021, 2056, 1358]. decontamination [1047]. decrease deteriorating [207]. determinantal [423]. [1467, 1047, 2024, 2127]. decreasing [2287]. determinants [2278, 25, 2315]. decryption [818]. dedicated [732]. determined [1290, 378]. Determining deduction [789, 1227]. default [80]. defect [2402]. Deterministic [1011]. defensive [2297]. definability [1018, 658, 190, 213, 473, 701, 1278, 949, 247, [2084]. defined [1103, 1344]. defining 2113, 2021, 805, 191, 2324, 2015, 1431, 2239]. [1444]. definite [1123, 1908]. definiteness development [1807]. Developments [256]. [2255]. definition [1109, 35]. definitional DFA [239, 968]. DFAs [186, 1013]. [1198]. degradation [1142]. degrading diagnosabilities [617]. diagnosability [1665]. Degree [1925, 1366, 2087, 1078, 1913, 804, 2305, 1238, [1834, 2081, 310, 1617, 758, 515, 316, 2366, 2289, 1988, 2356, 60, 717, 1482, 2237, 1413, 1194, 1178, 2058, 1770, 1249, 2364, 521, 1486, 227, 2051, 1412, 1237, 1133, 2342, 799, 618]. 1302, 2361, 973, 1135, 2378, 620]. Diagnosis [814, 567, 2284, 1942, 2392, 1927]. degree-anonymous [758]. diagonal [1091]. diagrams [379]. dial degree-bounded [1135, 2378]. [1824]. dial-a-ride [1824]. diameter Degree-constrained [2081]. Degrees [270, 2020, 1393, 1080]. DICE [256, 1610]. [328, 270]. Delay Dichotomy [146, 898, 2168, 403, 2020]. [1688, 2083, 1565, 1240, 690]. delays Dictionary [299, 2273, 188]. different [418, 1905]. delete [2324]. deletes [63]. [2038, 503, 10, 1360, 493]. differential deletion [439, 1817, 1830, 2046, 1318, 150, [45, 2097, 430, 794, 234]. Differentially 2362, 1855, 2217, 1518]. deliveries [124]. [738]. Differentially-private [738]. delivery [238, 755, 61, 140, 714]. demand Diffusion [2175, 281, 246]. digital [145, 1951, 1084]. demands [1156, 2070]. [775, 759, 776, 779, 2179]. digraph [42, 47]. deniability [2169]. Denotational [1450]. digraphs dense [619, 1551, 1714]. density [385, 873, 906, 1834, 1617, 2310, 1576, 1235, [1068, 2249, 2126]. dependencies [922]. 1614, 84, 1136, 1347, 1048, 2303, 2217]. Dependency Dijkstra [487]. Dilemma [2184]. Dilworth [414, 197, 1589, 2180, 633, 671]. dependent [474, 4]. Dimension [1494, 1692, 1199, 1601, [260, 2099, 2133, 348, 740, 1867, 1633, 1787, 815, 1719, 2124, 615, 1987]. dimensional 489, 2352]. deployment [1145]. Depth [1096, 1132, 883, 1882, 344, 738, 2033, 861, [1748, 1467, 311, 1464, 2024, 2127]. 1349, 2305, 2229, 825, 447, 1262, 650, 470, derivated [1791]. derivative [79]. 1306]. dimensionality [739]. dimensions derivatives [1106, 775]. Deriving [1168, 851]. Diophantine [1523, 2084]. [1602, 1925]. Descendants [1700, 561]. Dipole [1219]. Direct [796, 1269, 1297]. description [2179]. Descriptional Directed [1119, 700, 1136, 1128, 1665, 2175, 13

353, 2380, 400, 1045, 1421, 689, 1957, 1158]. [239, 657, 1615, 420]. doubly [628]. down directional [1479, 250, 314]. Disagreement [701]. downscaling [1513]. dozen [1743]. [1593]. disambiguation [1280]. Discovery DP [2361, 1737]. DP-degree [2361]. [1120, 1124, 1542, 247]. discrepancy [1431]. DPDAs [886]. dragons [962]. Drags [2101]. Discrete [774, 1453, 2340, 1286, 495, 2277, Drawing [1578, 1923, 866, 2348, 1028, 528]. 780, 781, 448, 1241, 1983, 783, 2062]. drawings [1641, 2332, 2334, 900]. dreadful discriminating [364]. disentangling [962]. drift [2350, 1740]. driven [2053]. Disjoint [2086, 199, 2325, 1576, 623, [190, 92, 720, 2114, 2382, 1105]. drop [714]. 2321, 2070, 2103, 911, 359, 910, 130, 1262, drop-line [714]. dual 848, 713, 599, 33, 1714]. disjunction [1181]. [2218, 253, 2108, 37, 819]. Duality [1567]. disjunctive [1699]. disk [1241, 134]. Dualization [1121, 1120, 723]. duals [132]. dispersal [756, 324]. Displaying [2355]. due [229, 124]. duo [1023, 958]. duples disprove [928]. dissociation [1092]. [1800]. duplication [2287]. Duration Dissolution [1461]. distance [1757, 887, [1325, 413]. durations [253]. Durfee [1952]. 148, 607, 2046, 998, 2165, 1953, 2214, 2363, during [938]. duty [652]. Dyck 957, 1694, 1063, 1551, 1284, 2114, 1945]. [860, 601, 2113]. Dynamic [2066, 1804, 2370, distances [1535, 1669]. distinct 970, 38, 1194, 549, 2149, 769, 753, 548, 2134, [752, 982, 466]. distinguishability [1856]. 1665, 1831, 2039, 1611, 2232, 381, 244, 1936, Distinguishing 801, 1058, 2273, 288, 514, 235, 884, 355, 912, [225, 1351, 1273, 596, 917, 1148]. 14, 12, 904, 818, 218, 588, 2137, 1843]. Distributed [244, 1920, 499, 1526, 15, 218, dynamical 656, 1872, 2098, 1155, 1327, 196, 947, 251, [1286, 1200, 146, 1453, 1957, 928, 489]. 1425, 18, 388, 466, 2055]. Distributing dynamicity [2169]. dynamics [2404]. Distribution [2162, 837, 1429, 417, [1670, 983, 2330, 1545, 428, 101]. dynamos 2187, 1249, 1738, 973, 620]. distributional [392]. [736]. distributively [947]. diversity [12]. Dividing [352]. division [564, 808]. divisor E. [429]. EA [2193]. Early [193]. ease [643, 1304]. DNA [2169]. easier [501]. easy [266, 949]. [2046, 2190, 1223, 2269, 204, 1457, 833, 566]. eccentricity [1394]. ecological [563]. Eden DNA-based [833]. Do [2288]. DOAMI [1389, 561]. Edge [2055]. Document [864, 2037, 1833]. does [2070, 2190, 1723, 519, 910, 809, 150, 1273, [580, 2106, 1379, 859]. DOL [1779]. Dollar 1928, 1209, 1762, 2170, 2038, 2173, 1631, [1699]. DOM [1961]. domain [262, 1373]. 2325, 1672, 578, 1572, 468, 83, 1180, 518, domain-theoretic [1373]. domains 1899, 1691, 300, 471, 2022, 2416, 1509, 2362, [78, 1961, 373, 498, 794, 673, 1204, 1372]. 2395, 2217, 1157, 534, 2342, 807, 694]. edge- Dominance [1923]. dominating [1672]. edge-bipancyclicity [809, 807]. [570, 1685, 65, 1155, 1892, 2140, 52, 816, Edge-clique [519]. edge-colored 2167, 1000, 359, 2000, 1473, 2286, 2296, 554, [468, 2395]. edge-connectivity 22, 2396, 1263, 2010]. Domination [1509, 1157, 1928, 694]. Edge-disjoint [1263, 2347, 1599, 975, 1685, 2314, 2313, [2070, 910, 2325]. Edge-independent 2297, 2052, 1199, 421, 1991, 2363, 1009, 330, [1209]. edge-isoperimetric [1631]. 1437, 147, 2390, 2019, 813]. Dominator edge-length [2022, 2416]. Edge-outer [1391]. Domineering [340, 945]. Don [2190]. Edge-pancyclicity [809]. [1777]. don’t [1542]. Double edge-recoloring [468]. edge-weighted 14

[578, 534]. edges Efficient [2196, 2234, 1399, 1069, 318, 339, [1160, 1262, 1950, 2228, 807, 1245, 615]. Edit 2253, 976, 344, 30, 1083, 963, 2223, 2221, [2114, 1535, 1063]. Editing [328, 1178, 1266]. 1058, 2273, 1267, 1998, 1547, 1575, 783, 1358, Editor [1705]. Editorial 532, 588, 1522, 1912, 693, 163, 607, 965, [1687, 1695, 1704, 1711, 1726, 1745, 1758, 2098, 1060, 998, 1664, 2238, 1542, 1899, 1009, 1765, 1654, 1667, 1671, 1675, 1682, 1966, 1845, 1063, 1840, 115, 2047, 380, 599, 1353, 1065]. 1598, 411, 425, 558, 761, 829, 835, 919, 1216, Efficiently [855, 1302, 458]. egos [276]. 1308, 1441, 1645, 1736, 1878, 1977, 2183, 242, election [1132, 2262, 749, 20]. elections 1025, 576, 7, 8, 264, 277, 284, 296, 308, 321, [305, 1690, 1270, 1686, 383]. electorates 333, 347, 365, 377, 391, 405, 410, 424, 433, [117]. electromagnetism [925]. 449, 459, 475, 484, 492, 504, 512, 524, 536, 555, electromagnetism-like [925]. electronic 556, 21, 557, 69, 75, 82, 91, 98, 105, 113, 120, [547]. element [226]. elementary [920]. 128, 137, 144, 152, 158, 168, 177, 184, 194, 203, elements [1352, 2322, 107]. elicitation 214, 222, 232, 241, 255, 582, 583, 846, 856]. [1690]. eligibility [141]. elimination [1616]. Editorial [865, 875, 878, 897, 905, 918, 927, ellipsoid [771]. elliptic [2407]. Embedded 930, 933, 946, 956, 964, 974, 985, 988, 997, [1020, 2158]. Embedding 1005, 1014, 1024, 1042, 1050, 1056, 1073, 584, [1031, 1994, 608, 2190, 1660, 300, 166]. 639, 640, 659, 665, 675, 684, 688, 699, 709, embeddings [1922, 653, 1701, 1408, 1409]. 715, 726, 731, 741, 751, 760, 773, 785, 790, embodied [838]. emergent [2189]. 800, 811, 820, 828, 834, 651, 1081, 1094, 1292, Employing [1545]. emptiness [1285]. 1307, 1326, 1330, 1336, 1343, 1346, 1355, encode [2092, 1219]. encoded [1061]. 1371, 1377, 1383, 1387, 1395, 1402, 1407, Encoding [609, 1544, 1511]. encodings 1415, 1426, 1432, 1440, 1462, 1470, 1477, [1033, 1959, 832]. encrypted [867]. 1487, 1115, 1116, 1129, 1139, 1147, 1154, Encryption [2049, 2030, 1642, 1192, 603, 1161, 1164, 1177, 1184, 1190, 1196, 1202]. 204, 1550, 1007, 1998, 2166, 914, 1193, 1939, Editorial 2307, 818, 692, 588, 2304, 139, 1912]. [1206, 1215, 1224, 1228, 1233, 1243, 1253, encryptions [1197]. end [806, 1949]. 1261, 1268, 1275, 1288, 1497, 1503, 1739, 1753, end-markers [806]. End-Nim [1949]. 1773, 1782, 1790, 1801, 1813, 1825, 1837, 1844, endedness [2189]. endgame [340]. ends 1852, 1862, 1870, 1877, 1504, 1516, 1525, 1533, [1201]. Energy [2331, 1664, 320, 1398, 1414]. 1549, 1560, 1564, 1573, 1580, 1587, 1597, 1605, Energy-optimal [2331]. engine [262]. 1613, 1620, 1627, 1634, 1638, 1644, 1661, 1889, enhanced [1271, 1393, 2389, 26]. enough 1896, 2120, 2128, 2135, 2144, 2152, 2163, 2171, [564]. enriched [486]. Entangling [2053]. 2182, 2194, 2205, 2215, 2224, 2233, 2245, 2260, entities [502]. Entropy 2274, 2291, 2301, 2346, 2368, 2376, 2387, 2400, [1653, 1034, 1188, 1788, 1794]. enumerable 1906, 1915, 1919, 1926, 1934, 1941, 1947, 1954, [734, 674, 906]. Enumerating 1960, 1965, 1976, 1986, 1992, 1993, 2001]. [2093, 816, 210, 1996]. Enumeration Editorial [2008, 2014, 2025, 2034, 2044, [1898, 2167, 415, 209, 1849, 2016, 677, 349]. 2054, 2068, 2077, 2088]. Editors’ Enumerations [1439]. enumerators [1439]. [989, 732, 1588, 1780, 159]. education environment [1652, 1052]. environments [1443]. effect [258, 806, 1423, 1185]. [2039, 509, 12]. envy [680]. envy-freeness Effective [837]. effectiveness [1151]. [680]. enzymatic [1647]. Epigenomics Effectivity [1708]. effects [1718]. [2269]. Epileptic [1545]. Epsilon [416]. efficiency [1193, 369, 2116, 103, 1461, 1738]. Epsilon-net [416]. epsilons [491]. Equal 15

[1366, 141]. Equality expanding [498, 2343]. Expansion [1768, 1480, 1212, 719, 2304, 1912]. [179, 226]. Expansion-based [179]. equality-free [719]. equalizer [2238]. expansions [1621]. Expected equation [2264]. equational [1747]. [827, 2189, 249, 1203, 996]. exploited [969]. equations [1399, 2380, 2308, 79, 430, 1091, Exploiting [240]. exploration 729, 1523, 2265, 794, 234]. equicontinuous [2331, 1045, 941]. Explore [502]. Exploring [762]. equidistant [1628]. equilibria [655]. exponent [531, 852, 317, 1688]. equilibrium [1474]. [1069, 1098, 1159, 2336, 2265]. exponential equilogical [1635]. Equivalence [600, 1256, 2031, 1820, 336]. [1198, 1728, 2146, 43, 138, 54, 216, 261, 674, exponential/FPT [600]. exponents [2117]. 1451, 854, 1110, 1067, 1746, 456]. exposure [1952]. expressed [727, 233]. equivalences [2097]. equivalent expressibility [1348]. expressible [2265]. [1339, 1961, 1248, 1163]. Era [1416]. expression [1281]. expressions ergodic [1431]. Erratum [2417, 1496]. [2209, 2219, 805, 1956]. expressive Erratum/Correction [2417]. Error [427, 793, 2374, 80]. Expressiveness [788]. [407, 743, 379]. Error-pruning [407]. expressivity [312, 1772]. extend [1689]. errors [2339, 801]. essential [1749]. Extended Establishing [867]. Estimating [723, 595, 1473, 2069, 2150, 1266, 1376]. [1211, 1798, 1596]. estimation Extending [175, 615, 1943, 2343]. [837, 417, 775, 2187, 740, 380]. extension [2228]. extensions estimation-of-distribution [2187]. [479, 889, 25, 32, 2015, 1372]. extensive estimators [955, 1367]. Eternally [2296]. [670]. externalities [1821]. Extra eukaryotic [2269]. Euler [1899, 1297]. [2305, 1366, 952, 804, 1509, 1988, 717, 1482, Evacuating [1528]. evacuation [2340]. 2174, 2237, 1924, 2389, 2051, 361, 694]. evaluate [965]. evaluation extremal [422]. Extreme [994]. [523, 1019, 2356, 942]. evasion [2143, 1046]. evasive [287]. even [1247, 547, 1365, 874]. F [2024]. facets [1599]. facilitated [150]. even-sized [1365]. event [522, 2056, 1808]. Facility [1076, 1903, 1718, 868, 37, 2067]. events [801]. eventual [215]. Every [300]. factor [135, 529, 314, 1074]. factor- [529]. evidence [1880]. Evolution factorisations [719]. Factorization [2186, 838, 771, 1628]. Evolutionary [817, 2263, 84, 689, 1066, 870, 2115]. [9, 1311, 924, 10]. Evolving [1317, 2184]. factorizations [2074, 2235]. factors Exact [1012, 34, 1706, 1786, 1256, 1589, [1098, 1793, 1068, 2271, 2257, 1290, 1301]. 1092, 757, 2155, 1820, 1364, 552, 147, 1410]. failed [1146]. failures [320, 541]. Fair exactness [74]. examples [1234, 736]. [2248, 544, 28, 35, 26]. fairly [352]. falling except [2254]. Exception [1775]. [810]. false [872]. false-twin-free [872]. exchange [301, 35, 1213, 874, 26]. families [2093, 2404, 2349, 1500, 2407, 2393, exchanged [1406, 1496]. exclusion 1320, 1403]. family [1529, 1874]. Exclusive [1274]. Excuse [1631, 86, 123, 2315, 1721]. Fan [1641, 303]. [272]. execution [2370, 2180, 730]. Fan-planarity [303]. Farey [2351]. Fast executions [1327]. exhaustive [1170]. [2155, 270, 1360, 1071, 689, 1087, 575, 888, existence [1577, 672, 1957, 50]. Existential 18, 2158, 2258, 1872, 2370, 1876, 1593, 2297, [2084, 1523]. exists [2140]. exits [1528]. 775, 1860, 1574, 2021, 1419, 1064]. Faster expandable [1075]. expanded [1698, 2417]. [1066, 1551, 907, 2239, 200, 2137]. Fault 16

[1479, 212, 2087, 1509, 227, 2241, 93, 1672, [766, 1744, 1728, 1649]. Flexible 27, 1361, 300, 1484, 1948, 2356, 319, 1347, [1975, 1884]. Flip [1792]. flipping [589]. 1924, 2320, 1553, 2354, 1928, 1942, 807, 1994, flood [176]. flood-filling [176]. floorplans 1401, 2170, 2392, 2130, 618, 1927]. fault-free [542]. flow [2091, 627, 1150, 822, 229, 1715]. [1994]. Fault-tolerant [1479, 1509, 93, 1672, flow-shops [1715]. flow-time [627]. 27, 1361, 319, 2354, 807, 1401]. Faults flowchart [662]. flows [202, 243, 196, 2065]. [1929, 562, 814, 1970, 471, 2289, 2284]. Flowshop [1214, 1354, 1090]. flowshops faulty [579, 623, 2321, 2266, 1900, 809, 2311, [2202, 2085]. fly [728]. fly-automata [728]. 1262, 58, 807, 1994]. Feasibility [169]. FM [895, 1548]. FM-index [895, 1548]. feature [885]. features [937]. feedback focusing [1386, 1340]. folded [948, 1880, 173, 633, 2028]. few [171, 1672, 300, 471, 809, 2311, 1482, 1553, [299, 2173, 291, 2404, 1510]. fewest [1848]. 2241, 361, 694]. folding [1921]. Follow Fiat [1767]. Fibonacci [1784]. fonts [273]. food [580]. Forbidden [2074, 883, 1200, 1077, 2327, 357]. [1158, 2271, 916, 233]. forcing Fibonacci-automatic [1077]. Field [451, 1724, 1146, 2200]. Forest [817, 2236, 841]. fields [837, 1091]. FIFO [1518, 2218, 55, 2069]. forests [2309]. filling [110, 176]. filtering [1808]. [1677, 2294, 1994]. Foreword [1117, 1771, find [1256, 580, 1657]. Finding 1057, 1416, 1705, 989, 732, 159, 1780]. [1183, 1352, 42, 873, 906, 758, 2011, 199, Forewords [1043]. form [727, 629, 290]. 1312, 1679, 236, 210, 2300, 1480, 870, 1302, Formal [1341, 78, 1864, 641, 2377, 332, 1963, 1714, 310, 1537, 2310, 517, 2236, 2103, 1438, 2100, 2160]. formalisation [2146]. 338, 1400, 1365, 1182, 631, 2176, 1299, 2161]. formalism [1918]. Formalization finds [13]. finishers [1808]. Finite [1499, 478, 1460]. Formalized [2147]. [727, 1446, 190, 1277, 2364, 2383, 1169, 1476, formation [1831, 1600, 1603, 317]. 814, 481, 1171, 1316, 2236, 1748, 1175, 78, formations [2413]. forming [1322]. forms 1279, 983, 1278, 200, 2385, 1091, 2381, 1957, [1227, 1130, 1914]. formula [969]. formulae 1321, 2213, 765, 329, 106, 649, 669, 1442, [2090]. formulas 331, 1189]. Finite-state [727, 1277]. [1123, 2236, 1754, 2219, 1662, 1144, 1589, finite-valued [481]. finitely 1523, 1519, 1615, 1128, 1118, 663, 2064]. [1693, 1151, 1498, 2375]. fire [363]. formulations [1448]. Forward [876]. firefighter [1257, 678]. Firefighting Foundations [826, 1344, 932, 2007]. four [2299, 2157]. firing [2283]. First [1921, 1578, 1063]. Four-Russians [1063]. [404, 2350, 789, 479, 2156, 72, 1053]. Fourier [1034]. FPT [600, 1677, 1085, 2019]. First-hitting [2350]. first-order FPTAS [1354, 1090]. FPTRAS [1721]. [789, 479, 1053]. fission [564]. Fit [404, 921]. fractals [294]. fractional [658, 1499]. fit-preserving [921]. fitness [2048]. five fragment [406, 645]. fragmentable [465]. [2093, 1194]. Fives [1847]. Fixed fragments [1974, 482, 2374]. Fra¨ıssé [1750]. [110, 173, 1791, 233, 1352, 2334, 1198, 1698, frame [1079]. Framework 2417, 1930, 154, 1601, 1703, 2249, 2126, 146, [1274, 1338, 707, 1471, 1822, 384, 2101, 823, 1137, 387, 1832, 2020, 155, 1242]. 1422, 1805, 348, 2335, 102, 412, 1637, 1881]. fixed-density [2249]. fixed-mobile [2334]. Frameworks [1337, 505, 2145, 543]. Fixed-parameter Fréchet [2165]. Free [110, 173, 1930, 387, 1832]. fixed-point [442, 1096, 1352, 1260, 1069, 1168, 311, 208, [1198, 155]. Fixing [1555]. FL [821]. Flat 1735, 43, 138, 1830, 909, 1674, 2208, 1530, 17

786, 95, 1898, 872, 67, 454, 2023, 1327, 646, [1616, 1446]. gates [1822]. Gathering 647, 1554, 1282, 464, 1249, 2217, 1592, 1425, [654, 1970, 53, 710, 1489]. Gaussian [996]. 1285, 1815, 904, 719, 692, 1263, 1624, 736, gene [562, 374]. General 458, 2210, 1378, 1350, 676, 1994, 126, 2392]. [467, 107, 817, 1757, 1895, 707, 148, 1373, freeness [680]. frequencies [12]. 394, 1471, 1446, 1925, 2156, 1400, 1396, 617, frequency [1334, 981]. frequent 2069, 1127, 205, 2127, 2352]. generalised [1, 984, 23]. friend [1166]. friendly [1635, 79, 1455]. Generalization [2407, 1197]. Frobenius [1701]. frontier [1594, 1466, 211, 456]. generalizations [1823, 2113, 1738]. Frontiers [66, 1283, 1725, 455]. Generalized [525, 482, 2195]. Frugal [1255]. fuel [553]. [2148, 1652, 1887, 195, 1201, 1957, 1840, fuel-considered [553]. Full 1067, 329, 683, 2336, 1481, 1483, 481, 2141, [2092, 1192, 2393, 2169]. full-hiding [1192]. 1892, 2102, 2139, 2363, 1914, 336, 1650, 1511, Fully [2030, 1936, 1142, 1335, 947, 1060, 1772, 2259, 2003, 973, 1187, 1093]. 1218, 949, 251, 117, 388]. fully-functional generated [1151, 1315, 2275, 2413]. [1060]. Fun [273, 1845, 265]. functigraphs Generating [2396]. function [375, 458, 1446, 1102, 1405, 1808, 1649, 874]. [2146, 2402, 523, 2391, 2, 1019, 2405, 1699, generation 1490, 2166, 1036, 1027, 725]. [1170, 1191, 1792, 341, 1565, 2264]. function-private [2166]. Functional generator [349]. generator-enumeration [1348, 1060, 78, 633]. functions [349]. generators [972, 676, 118]. Generic [1286, 495, 257, 1623, 1348, 1476, 1102, 345, [486, 364, 823, 178, 2072, 2035]. generics 1760, 10, 154, 2017, 127, 200, 2204, 1812, [1779]. genes [1065]. Genetic 2110, 1219, 2005, 1244, 1134, 550, 1827, 2256, [9, 494, 427, 1609, 104]. genetically [1984]. 942, 369, 155, 1367, 1114, 874, 1485, 2153, genome [614]. genomes [2269, 529]. 1752, 1376, 118]. Functorial [1053]. genomics [1458]. genus [1920]. geodesic functors [1964]. fundamental [1119]. [606, 503, 2247]. geodetic [909, 1816]. Fundamentals [309, 662]. Further Geographic [742]. Geometric [1257, 1455, 2382, 2398]. fusion [1882]. [2333, 1944, 782, 2123, 1584, 1713, 1218, 221, Fuzzy [1460, 1669]. 1996, 1659, 2010]. Geometry [774, 1880, 1176]. Giancarlo [1416]. Girard G [1772]. Gabriel [397]. Galaxies [268]. [661]. girth [1194, 403, 2043]. Give [2253]. Game [1658, 2306, 2328, 2418, 41, 2277, Given [328, 1121, 2402, 2140, 777, 1178, 382, 1828, 148, 66, 1044, 71, 975, 1655, 1500, 28, 1248, 1064, 1303, 2041]. glasses [2217]. 252, 1731, 531, 1718, 1761, 2399, 803, 808, glasses-free [2217]. Global 340, 293, 2121]. game-based [71]. Games [223, 1404, 1996, 1047]. glue [1219]. gluing [591, 1195, 934, 2333, 275, 980, 959, 1916, [1579]. Gong [914]. Good 1828, 753, 1831, 935, 270, 71, 59, 687, 1585, [528, 873, 906, 1925, 1913, 2305, 1238, 1413, 2107, 624, 1699, 176, 983, 827, 1729, 1778, 231, 2051, 1412, 1133, 799]. good-neighbor 1732, 211, 1267, 1603, 1291, 1902, 114, 467, [2305]. goods [220, 306]. Graceful [1142]. 670, 1131, 1949, 1252, 389, 1971, 172, 206]. Gracefully [1665]. graded [1750]. Gap [1814, 1259, 1556, 1640, 890, 803]. grammar [2275, 343, 708, 844]. Gap-planar [1814]. gapped [1640, 1890]. grammar-based [343]. grammars gaps [299, 223, 2031, 867, 1548]. Garden [1310, 332, 1618, 1313, 1345, 1735, 197, 1674, [1389]. gardens [561]. gasket [1624]. Gate 2379, 1179, 235, 2112, 366, 290, 1442, 650, 18

904, 736]. Grammatical [1836]. Graph [149]. Gromov [1370]. Group [2292, 687, 1043, 328, 1178, 1266, 1397, 1338, [2266, 1529, 1274, 337, 436, 1990, 334, 2221, 1829, 213, 655, 45, 1869, 1101, 913, 1873, 1673, 2305, 2322, 1939, 1683, 2169, 349, 33]. 1448, 1345, 438, 5, 1329, 1328, 65, 2101, groups 2190, 591, 1318, 1045, 678, 1567, 1083, 1451, [1352, 1151, 199, 2290, 1785, 1864, 130, 1514]. 2026, 363, 421, 2394, 658, 1763, 1543, 528, Grover [2053]. Growth [621, 429]. Grundy 1673, 2305, 2341, 2180, 776, 1009, 235, 1520, [2391, 1699]. guaranteed [2037]. 366, 1032, 2302, 1835, 1157, 1380, 681, 833, guarantees [381, 48]. guard [1153]. 1717, 1263, 2153, 2357, 1038, 1342, 1435, guarded [1635, 72]. guarding [387, 1153]. 1427, 2378, 1720, 620, 2130, 1697, 2363]. guards [2071, 652]. Guest graph-based [1338, 421, 1673]. graph-bin [651, 576, 242, 989, 1588, 732, 1780, 159, 1705]. [913]. graph-controlled [1318]. Graphical guide [268]. guided [1449]. [205, 1774]. graphs [1254, 2306, 2230, 1507, 2337, 1641, 2173, 97, 2029, 132, 414, 1814, Hadamard [1172, 2209, 2123, 2411]. half 1859, 2251, 1895, 41, 2347, 2081, 1828, 2154, [1134]. half-product [1134]. halfspaces 1631, 163, 148, 1012, 397, 1044, 439, 270, 703, [992]. Halpern [2374]. halting [1141]. 108, 866, 1685, 1447, 1944, 208, 4, 474, 1611, Hamiltonian 1967, 1817, 312, 353, 604, 316, 696, 1492, [472, 745, 1365, 1950, 1689, 1994]. 2313, 437, 244, 1655, 2156, 2070, 135, 1936, Hamiltonicity [58]. Hamming [1535, 887]. 1155, 1920, 1748, 400, 502, 2388, 2348, 1003, Hanabi [1247]. Hankel [25, 2315]. Hanoi 2297, 869, 1578, 1572, 682, 1830, 2057, 195, [1473, 1488, 620]. hard [275, 1247, 758, 381, 862, 909, 136, 978, 953, 1724, 724, 1199, 1422, 1702, 2125, 2248, 1182, 1847, 1721, 1851]. 95, 1555, 52, 1194, 1421, 162, 1400, 816, 911, harder [396]. Hardness 1898, 2167, 744, 1368, 1614, 625, 872, 611]. [266, 1921, 1213, 147, 698, 1492, 176, 2309, 3, graphs [1366, 1953, 403, 518, 952, 617, 804, 68, 1832, 434, 2286, 230, 632, 1858, 1397]. 40, 1991, 815, 292, 1660, 791, 472, 2040, 1391, Harmonious [2042]. Hash 1473, 2246, 951, 1478, 1957, 1505, 745, 1365, [2405, 2404, 1036, 2304]. having 2069, 175, 1770, 2143, 2021, 499, 1127, 130, [4, 474, 724, 2250, 2043]. head [1321]. 1937, 2022, 2416, 112, 464, 977, 2020, 2043, healing [1527]. heap [823]. height 1046, 1488, 1911, 1160, 1238, 1716, 2289, 330, [1021, 1907]. heights [635]. help [2153]. 717, 1250, 122, 2016, 1566, 1510, 1696, 2259, Herbrand [789, 2004]. Hereditary [873]. 1816, 2395, 2063, 847, 1369, 2132, 2124, 1551, Hermite [1914]. Heterogeneous 677, 532, 147, 848, 713, 2086, 521, 1486, 596, [1162, 868, 578, 1603, 1630]. heuristic [962]. 2359, 2390, 1815, 798, 389, 1615, 346, 917, heuristics [1903, 2052]. hidden 1622, 2019, 573, 973, 134, 1148, 2351, 1910, [1590, 2193, 1193, 1637, 2319]. Hider [2295]. 1938, 2200, 1001, 1942, 1135, 1133, 2041, 271, hiding [1192]. Hierarchical 1676, 813, 1015, 33, 615, 96, 1762]. graphs [1593, 724, 1010, 841, 1948, 482, 2237, 520, [2170, 2392, 2010]. Gray 692, 2241, 618, 1468]. hierarchies [954, 963]. [702, 341, 1201, 1579, 1849]. greatest Hierarchy [1748, 392, 1283]. High [729, 1304]. Greedy [1361, 567, 1752]. Higher [2332, 1826, 653, 463, 37, 2079]. Green [202]. [1320, 397, 1198, 2005, 825, 787, 1561, 366]. grid [249, 543, 745, 1365, 1951, 1015]. higher-dimensional [825]. Higher-level grid-like [1015]. grids [1320]. higher-order [53, 654, 2296, 634, 2293, 85]. Gr¨obner [397, 1198, 2005, 787, 1561, 366]. highly 19

[2039, 740, 1767]. hijacking [445]. Hilbert [791, 2000, 1510]. identity [1882]. hip [1800]. HiperTM [1361]. [1007, 1998, 692, 588, 2035]. identity-based history [692, 489]. history-dependent [1007, 1998, 692, 588, 2035]. II [489]. history-free [692]. hit [2013, 2415]. [906, 1077, 1163]. III [2363]. Iliopoulos hitting [2350, 109]. Hoare [1984, 487, 667]. [1534]. image [1457, 595]. Imagery [774]. HOAS [509]. hoc [666, 254, 545, 656]. images [971, 568, 1557]. IMDPs [1733]. HOL4 [1499]. Holant [1822]. hold [448]. immobile [2295]. immunity [1752]. hole [1365]. holes [502, 543, 219]. immutability [1975]. impact [1900, 801]. holonomic [1399, 1102]. Holub [461]. impartial [114]. implement [1586]. homogeneous [1840]. homomorphic Implementation [185, 2206]. [2030, 850, 1701, 603, 914]. homomorphism implementations [722, 1979, 1981]. [403]. homomorphisms [316]. homophyly implementing [2199]. implication [1797]. [358]. homotopy [1295]. honest [1706]. implications [1118]. Implicit [256]. imply Honor [1416, 879, 2261]. Honoring [1534]. [1379]. importance [129, 986]. hop [2138, 691, 2262]. Horn imprimitivity [461]. improper [1555]. [1123, 2108, 1128, 169, 1118]. host [579, 148]. Improved [579, 548, 440, 2326, 1088, 2236, Howard [789]. HS [1974]. HTN [1962]. 1155, 547, 2229, 552, 1493, 124, 1085, 319, HTN-like [1962]. hub [122]. hull 290, 494, 386, 1410, 1890, 2067, 2064, 1030, [1466, 909, 2247]. human [567, 1443]. 301, 1210, 447, 2335, 2201, 941, 925, 118]. humans [2118]. Hybrid improvement [1145, 939]. Improvements [2374, 1942, 2392, 1927, 281, 1010, 763, 1344, [750, 1457]. Improving [59, 718]. In-place 831, 2356, 1842, 928, 1809, 153, 375]. [1364]. Inapproximability [438, 52, 1581]. Hydras [1127, 1128]. Hyper [191]. incentive [1824]. Incidence [6, 1004]. Hyper-optimization [191]. hyperbolic inclined [2202]. including [1439]. [903]. hyperbolicity [1370]. Hypercube Inclusion [2113, 392, 1730]. incomplete [1581, 390, 2284, 1008, 848, 713]. [1639, 2372, 1171, 2365, 1690]. increase hypercube-based [2284]. hypercube-like [916]. increasing [1907]. Incremental [848, 713]. hypercube-variant [1008]. [1235, 2002, 262]. Independence hypercubes [1672, 2321, 300, 471, 809, 2311, [1624, 1693, 482]. Independent 1509, 2358, 853, 1482, 1950, 1393, 6, 1004, [22, 1191, 2203, 1756, 1149, 292, 1063, 1437, 1553, 2389, 2342, 807, 361, 694, 915, 1927]. 1008, 2176, 1624, 1209, 1596]. hyperexcitable [842]. hypergraph Indeterminate [437, 1420, 1543]. Index [1590, 1120, 1312, 1883, 2175]. hypergraphs [2219, 1351, 1542, 894, 895, 1548, 1273, 895]. [1119, 2391, 402, 1996, 689, 211, 287, 631, indexes [364, 1610]. Indexing 2361, 346, 1128]. Hyperopic [2298]. [971, 1571, 892, 230, 1958, 1061]. indicator Hypersequent [1055]. hypervolume [11]. [11]. individual [538]. indivisible [306]. hypothesis [2378]. Induced [501, 911, 1411, 517, 869, 295, 782, 1626, 674, 73, 1490, 463, 1135, 40]. Inducing I/O [163]. IC [866]. IC-planar [866]. [1271]. induction [1591]. inductive ICDCN [1526]. Ideal [1022, 1575]. ideas [735, 990]. Inefficiency [531, 1902]. [1169]. Identical Inequality [2002, 1207, 1610, 1074]. [1633, 440, 238, 755, 530, 1249, 2132, 1715]. infection [606]. inference [302, 735, 990]. Identification [109, 1199, 614, 283]. Inferring [1286, 430]. infinitary [2150]. identifiers [658]. identifying Infinite 20

[1208, 1403, 2272, 972, 1631, 1312, 2398, Intrinsic [2080]. introducing [2093]. 1748, 2327, 2023, 2235, 1046, 2117, 456, 378]. Introduction [1119, 1588, 1502]. Intruder Influence [246, 269, 1968, 1969]. influences [1227]. intuitionistic [77]. invariant [1831]. Information [845, 1294, 149, 1287, 1840]. invariants [651, 576, 242, 476, 2091, 409, 1404, 822, [375]. Inverse [2038, 2312, 1507, 916]. 1876, 1666, 2308, 1961, 673, 840]. inverses [1227, 1806, 2178]. inversion informational [510, 1458]. inhibitor [1668]. [2093, 642, 335, 969, 1065]. inversions [167]. inhibitors [1444]. inhomogeneous [1944]. Investigating [769]. invisible [2228]. inner [1192, 2166]. Input involution [2100]. involving [2403, 1380]. [720, 236, 1827, 190, 92, 2114, 2382, 1105]. Invulnerability [1995]. ion [428]. IoT Input-driven [1973]. Irreducible [1186, 1498, 1072]. [720, 190, 92, 2114, 2382, 1105]. inputs irreducibles [1121]. irredundant [1898]. [667]. Insecurity [1379]. insertion irregular [1614]. irreversible [392]. [1449, 2380, 1318]. insertion-deletion isometric [1685, 39, 1403]. isomorphic [1318]. insertions [1149]. insider [1998]. [2191]. isomorphism insights [1846, 924]. inspired [1881]. [1411, 313, 1448, 501, 1451, 349, 40]. instance [348]. instance-dependent [348]. isoperimetric [1631]. isotactics [1746]. instances [851, 10, 3, 68, 1410]. Issue [1879, 1588, 505, 1897, 2216, 1309, instantiable [1767]. Institutions [1774]. 1331, 1526, 1217, 15, 1416, 2225, 2292, 285, Integer [1011, 817, 778, 236, 1735, 2397, 651, 879, 626, 2206, 2261, 1043, 732, 1863, 200, 1865, 949]. integer-manipulating 242, 1727, 2369, 1705]. issues [1759, 1134]. [1865]. integers [2030, 1701, 729]. integral Item [1272]. items [1, 984, 23, 465, 142]. [1294, 533]. integrality [803]. Integrated iterated [135, 1778, 2184]. iterating [1167]. [61, 140, 74]. integrated-time [74]. iteration [1733, 1520, 46]. iterations [1299]. intellectual [2402]. Intensional [2005, 406]. iterative [1036]. iterativity [1964]. Intensity [526]. Intensity-Modulated [526]. interaction [660]. Interactions jamming [1381]. jigsaw [266]. job [278, 1963, 1900]. Interactive [1006, 704, 237, 48, 1363]. jobs [106, 936, 348, 947]. interchange [607]. [1904, 440, 1392, 1664, 123, 229, 207, 2158, interchanges [1140]. interconnected [429]. 1435, 2202, 2085]. joining [2321, 2086]. joy interconnection [1925, 903, 1928]. [1118]. Jumbled [1061]. jump [281]. Interface [1385, 407]. Interfaces [929]. Jumping [1048, 2383, 1279]. juntas [1786]. interference [1501, 53, 1362, 119, 2055]. justifications [483]. interiors [648]. Interleaving [1746]. intermediate [1088, 219]. Internal Kannan [750]. Kautz [1347]. Kayles [34]. [1632, 1716]. International keeping [1856]. Kelly [1158]. Kelly-width [2216, 732, 2225]. interpolation [72]. [1158]. Kernel [1651, 948, 1085, 2201, 2303]. interpretation [258, 181]. interpretations Kernelization [259]. Intersection [880, 1749, 1297, 2010]. [706, 535, 1684, 1764, 1720, 1084]. Kernels intersections [965, 210, 2179]. Interval [2244, 45, 1135]. key [1668, 1469, 1733, 976, 108, 1974, 351, 2313, [2307, 818, 1035, 1952, 26, 2304, 139, 1912]. 1936, 2297, 81, 591, 1199, 38, 40, 1716, 681, keys [201]. keyword [1998]. KHL [460]. 2086, 1435, 1841]. intervals kidney [301]. Killing [491]. Kinetic [2222, 630, 1524]. intransitive [1501]. [902, 1459]. Kleene [1708, 2406]. Knapsack 21

[2076, 627, 87, 949, 49, 598, 2204, 1430, 1414, 2080, 1710, 571, 1592, 1787, 1596, 1705]. 2399, 386]. Know [1602]. knowledge [1939]. learning-theoretic [1710]. Least known [2295]. Kobayashi [1251]. Kochen [729, 843, 624, 724, 1194, 1087]. least-core [2411]. Kolmogorov [550]. König [2362]. [624]. ledger [2098]. Left [647]. leftmost Kripke [157, 1561]. Kuhn [718]. [1839, 870]. lemma [2278, 2412, 1070, 1180]. Lemmings [274]. Lempel [1571, 2235]. L [2024, 953, 745]. L-shaped [745]. length [477, 2038, 2142, 1061, 249, 395, 2325, L-shapes [953]. label [491, 981]. Labeled 777, 2022, 2416, 350, 1583, 2084, 1031, 955, [978, 632, 44, 271]. labeling [2232, 912]. 1367, 1242, 981, 1353]. length-weighted labelled [1869, 1943]. labels [1875]. laconic [350, 1583]. Leontief [1474]. Lessons [581]. [1439]. Lagrangian [1609]. lambda letter [1290]. level [129, 1320, 37]. levels [1376, 1341, 192]. Lambda-confluence [1379]. leverage [1087]. Lexicalization [192]. landscape [2310]. Language [1674]. lexicographical [341]. liar [147]. [1879, 1124, 2380, 453, 476, 1649, 752, 1495, libraries [1563]. lies [300]. light 781, 1982, 1819, 1772, 2113, 1277, 307, 1700, [1909, 2049]. light-weight [1909]. lights 1376]. Language-theoretic [453]. [597, 211]. lights-out [211]. like Languages [1536, 481, 2126, 467, 705, 848, 713, 923, [1290, 1309, 1809, 2413, 1310, 993, 1260, 1100, 1931, 925, 772, 1015, 1962]. Limit [762, 205]. 1021, 2207, 2096, 1283, 1102, 605, 1315, 1316, limited [1019, 195, 2384, 1144, 1324]. line 43, 138, 1029, 2100, 1107, 1701, 2208, 823, [2230, 2263, 500, 1513, 116, 1471, 2181, 902, 786, 734, 963, 2214, 2133, 2385, 497, 646, 1319, 1558, 1769, 2197, 1718, 1524, 2013, 2415, 714, 1785, 2212, 1819, 2110, 2393, 991, 189, 647, 2055, 500]. Linear 1864, 1650, 648, 335, 2410, 1282, 1561, 1112, [304, 1618, 1062, 614, 1149, 896, 19, 444, 1212, 1322, 1559, 2160, 720, 1285, 1105, 1022, 2384, 224, 461, 2316, 1740, 2013, 2415, 1208, 1621, 2210, 1378, 2318, 1465, 676, 662, 566]. 406, 260, 1967, 2147, 1026, 138, 54, 900, 261, Laplacian [2175, 1080]. Laplacians [1567]. 10, 2018, 2193, 1595, 2026, 911, 1529, 815, 64, Large [1757, 758, 1811, 2073, 1609, 210, 795, 207, 1659, 1565, 951, 1365, 2112, 1298, 1626, 403, 2021, 2296, 2043]. larger 2201, 330, 1250, 720, 1340, 153, 796, 375, [1544, 1033]. larger/smaller [1033]. largest 1700, 1843, 819, 2067, 2064, 2378, 1994, 585]. [310, 1204]. latency [119]. lateness [123]. Linear-size [896, 1026]. Linear-space Latin [1581]. Lattice [850, 2169, 1428, 778, [1618, 2018, 64]. Linear-time 2004, 1490, 1939, 1683, 423]. Lattice-based [1062, 614, 444, 2384, 461, 1365, 330]. [850, 2169, 1939, 1683]. lattice-valued linear/submodular [819]. Linearizing [2004]. Lattices [1797, 1121, 1126, 883, 669]. [477]. linearly [850]. linguistics [1887]. law [52, 973]. laws [1446]. lazy [976]. LBAs link [199, 371, 602]. links [1969]. LinUCB [886]. LCP [1072]. LCS [1891]. LCSk [881]. [943]. lion [1761]. Lipschitz [79]. Leader [1132, 2262, 749, 1900, 20, 1784]. Lipschitzian [1167]. Lipschitzian-type Leaf [1696, 798]. Leakage [1935, 1827, 409, [1167]. list [2154, 1763]. list-colorings 1760, 1142, 1550, 2307, 139, 2035]. [2154]. listing [2037]. lists [1639, 313, 1140]. Leakage-resilient liveness [928]. Load [753, 520]. loading [1935, 1760, 1142, 2307, 2035]. learnability [420]. Local [736]. Learning [522, 1530, 1180, 1109, 1286, 223, 1155, 643, [992, 993, 1123, 1785, 732, 431, 1590, 845, 1875, 658, 498, 325, 1362, 1683, 955, 1367, 1594, 1706, 1786, 738, 734, 938, 1589, 991, 2412, 1380, 1741, 13, 1089, 1245, 1783]. 22 localised [1719]. localities [1454]. Locality 2127, 1435, 206, 1468, 2118]. MacPherson [748, 393, 1409]. Locality-preserving [393]. [1297]. macro [932]. macro-step-based Localization [1783]. Locally [932]. made [949]. magic [547]. [316, 1626, 1510, 1227, 2154, 1967, 2349, 849, Magnifying [867]. Mainly [1118]. 695, 1105, 1413]. Locating maintaining [23]. maintenance [1904]. [1436, 2396, 2000, 2390]. majority [522, 970, 593]. make [396, 63]. Locating-dominating [2396, 2000]. makespan [123, 140, 1715]. malicious [634]. locating-total [2390]. Location malleable [1940]. mammalian [844]. man [1076, 1507, 2038, 1903, 1199, 288, 514, 1236, [1761]. management [381, 298, 1246, 1643]. 1911, 1718, 868, 37, 2067, 540]. Manhattan [1546]. manifolds [738]. location-domination [1199]. Löf manipulating [1865]. manipulation [286, 1017]. log [1140]. log-Lists [1140]. [706, 1666, 1884, 757]. Manipulative [1690]. Logarithmic [1513, 263]. logic [824, 686, many 789, 1803, 1984, 406, 480, 1974, 1198, 728, [1599, 2033, 580, 1519, 848, 713, 2293, 718]. 877, 72, 510, 81, 629, 2219, 1344, 645, 2375, many-to-many [848, 713]. Map 1806, 374, 1561, 1807, 1340, 669, 178, 932, [2043, 990, 912, 685]. mapping [1023, 958]. 483, 1163, 412, 107, 2060, 1374, 2003, 431, mappings [1167, 73]. MapReduce [581]. 2374, 1843, 667, 637, 2061, 1384, 1804, 476]. maps [702, 2236, 79]. Marcus [1442]. Mark Logical [2149, 1337, 505, 2145, 2127, 1467, [808]. marked [1869]. markers [806]. 1972, 1100, 1464, 670, 2024]. logically Market [1474]. Markov [1841, 837, 151, [1339]. logics [1868, 481, 2147, 2004, 370, 1289, 1614, 994, 1574, 1431, 380, 663]. 1344, 1055, 1774, 371]. long [869]. Longest Markovian [74]. MARLEDA [837]. [889, 1537, 2365, 1522, 1353]. Look Marriage [2075]. Martin [286, 1017]. [701, 1247, 5, 1329, 1328, 2366]. Martin-Löf [1017]. martingales [2160]. Look-ahead [701]. lookahead [2083]. mass [414, 921]. mass-action [921]. lookup [1063]. loop [1530]. Loopless Mastermind [396]. match [63]. matches [1849]. loosely [664]. lossy [1760]. Lost [1438]. Matching [171, 1349, 880, 1910, [1741, 1334]. Lovász [1180, 2412]. Low 1938, 1639, 299, 339, 594, 2198, 2096, 882, [221, 653, 738, 1770, 748, 12]. low-stretch 1663, 696, 1538, 2156, 1905, 624, 893, 1078, [653]. Lower 2273, 861, 1552, 188, 1893, 1267, 885, 894, [869, 1045, 765, 851, 2134, 653, 225, 2366, 1182, 2020, 1250, 1721, 1566, 1067, 2259, 1616, 872, 1710, 447, 1493, 1959, 1524]. 2015, 1397, 534, 1237, 1584, 610]. Lowness [1464]. LSFA [505]. Lukasiewicz Matchings [397, 202, 1428, 1016, 295, 1626, [1562]. Lunch [442]. LW E [2329]. Lyndon 1999, 1207, 1473, 1249, 748, 463, 1689, 126]. [1068, 1539, 2102, 2249, 1066, 2270]. LZ78 Mathematical [567, 1185]. matrices [1536, 1066]. LZ78-like [1536]. [1099, 782, 1914, 2123, 2411, 1908, 1300, 228, 1796, 1619]. matrix [1310, 1021, 526, 590, M [2024]. machine 453, 2341, 1939, 1032, 1299, 1305, 969]. [125, 1229, 680, 2012, 61, 1820, 123, 2393, matrix-merging [526]. matrix-vector 229, 207, 704, 960, 2281, 124, 530, 237, 1475, [1939]. matroid [916]. matroids 531, 140, 1633, 2357, 2158, 141, 1363]. [2391, 306, 1901, 423]. matter [1222, 1874]. machines [432, 478, 959, 788, 1006, 238, 755, matters [11]. Max [1930, 148, 682, 2015, 1392, 419, 441, 962, 806, 229, 704, 2213, 1485, 1030, 681, 1410, 1089, 1858]. 1769, 57, 2132, 1173, 412, 764, 107, 714, Max-Batching [681]. max-distance [148]. 23 max-sat [2015]. Maximal [426, 1722, 2340, 1304]. metric [2256, 2285, 1436, 891, 1069, 1098, 1967, [1903, 473, 1450, 81, 1199, 739, 815, 2027, 615]. 2156, 1149, 1003, 1438, 777, 1999, 849, 1898, metrics [1513, 1943]. micro [932]. micro- 2201, 2016, 677, 723, 766, 2265, 1890, 602]. [932]. microarray [1457, 568]. might [396]. maximal-exponent [1098]. maximally migrating [926]. migration [753]. mildly [1928]. maximin [1901]. maximization [1410]. million [1302]. Mim [2363]. [812, 1156, 384, 1969, 1079, 1134, 1388]. Mim-width [2363]. Min maximizing [11]. Maximum [682, 2028, 590, 1485, 1030, 638]. Min-max [295, 1473, 982, 1249, 748, 1183, 606, 1023, [682, 1030]. min-sum [590]. MINCCA 958, 55, 238, 755, 1756, 1657, 123, 609, 2167, [1368]. Minimal [563, 2271, 1248, 1568, 2221, 2367, 292, 1659, 957, 1770, 1716, 1517, 2179, 1325, 968, 891, 976, 65, 1892, 402, 463, 798, 1624, 1680, 714, 534, 1092]. 1996, 816, 2167, 2367, 359, 229, 2302, 1080]. maximum-box [1680]. maximum-duo minimal-interval [976]. minimality [1823]. [1023, 958]. maximum-weight [1756]. Minimax [288, 2062, 1596]. minimaxity MaxSAT [1210, 2064]. may [1047]. MCTS [1784]. minimization [939]. MCTS-based [939]. MDPs [1733]. [457, 239, 1396, 598, 1468]. minimize MDS [1920]. me [2253, 272]. Mealy [1506]. [249, 238, 755, 123, 1505, 2335, 1493, 140, Mean [1732, 841, 1252, 573]. Mean-payoff 714, 2055]. Minimizing [1732]. Means [289, 851, 1299]. measure [627, 2281, 2252, 1150, 538, 533, 1715]. [881, 2073, 336]. measurements [2253]. Minimum [1656, 2230, 1492, 1905, 2058, measures [2091, 887, 297, 1017, 799, 694]. 973, 2071, 1183, 2066, 1607, 1608, 496, 163, Measuring [1973, 1423]. Mechanism 66, 395, 883, 2326, 1256, 628, 619, 1756, [1398, 1718, 301, 401, 1041, 1027]. 1155, 400, 1394, 2018, 2222, 2165, 744, 1805, mechanisms [408, 51, 12]. Mechanizing 1058, 3, 68, 324, 1473, 2246, 697, 1832, 325, [509]. median 2286, 119, 1816, 1628, 165, 1263, 134, 1092, [2038, 802, 236, 473, 2312, 1861]. medians 1245, 1030, 2279, 362, 1152, 1593]. [1418]. meet [1126]. MELL [2006]. minimum-width [1607]. Mining membership [992, 1706, 1786, 963, 1290]. [1038, 723]. minmax [548]. minors [1158]. Membrane mirror [2228]. mirror-edges [2228]. [564, 418, 1744, 1450, 1232, 2116, 1743, 1461]. Misère [389]. mismatch [880]. membranes [1737, 103, 1738]. memory mismatches [1663, 893]. missing [615]. [236, 240, 746, 1361, 396, 1505, 1362, 1442]. Mitigating [931]. Mixed Memoryless [32]. Menger [1305, 1296, 2312, 2062]. mixes [1574]. [1672, 2394, 1691, 1509, 2289]. mixture [286]. MKTP [2319]. MM [1927]. Menger-edge-connectedness [1691]. MM* [1913, 1238]. Mobile Menger-vertex-connectedness [1691]. [1929, 2334, 613, 1531, 577, 2331, 502, 597, merge [1820]. merged [1522]. merging 1970, 578, 1755, 1630, 111, 710, 1489]. [526, 907]. mesh [1538]. Message Modal [115, 248, 247, 656]. messages [1527, 2269]. [929, 480, 77, 1670, 1806, 1055, 2003, 1385]. meta [2147, 771]. meta-theory [2147]. modalities [877, 1386, 1342]. mode Metagenomic [1424]. metaheuristic [221, 1647]. Model [428, 669, 2060, 2061, [1609]. metamorphism [181]. metatheory 768, 1916, 427, 2198, 157, 1635, 1974, 1469, [1341]. method [508, 965, 2236, 1396, 1523, 1876, 876, 850, 2203, 1728, 629, 1142, 1, 984, 1520, 568, 1302, 416, 2343]. Methods 1913, 771, 567, 2305, 986, 119, 1238, 60, 717, 24

901, 2015, 1810, 227, 747, 26, 388, 1086, 667, [2308, 2012]. multi-path [196]. 1237, 656, 637, 1912, 1927, 1459]. Multi-periodic [840]. Multi-player model-checking [1728]. Model-order [2143, 1131, 1949]. multi-queue [298, 1246]. [428]. modeled [562]. modeling [852]. multi-service [1491]. multi-stack [1051]. Modelling multi-stage [1715]. multi-tape [478]. [767, 1883, 763, 563, 2148, 1651, 1459]. multi-target [1697]. multi-type [142]. Models multi-user [547, 2072]. MultiAspect [285, 666, 1183, 1389, 279, 260, 913, 1882, [1001]. multicolorings [532]. 429, 109, 1821, 1865, 1809, 489, 431, 663]. multidimensional [1392, 1719]. modes [1480]. Modification [941, 1032]. multifurcating [55]. Multigames [488]. modifications [2038]. modified [1984, 420]. multigraphs [592]. multigrid [955]. Modular [832, 211, 150]. Modulated [526]. Multilevel [1501]. multimatroids [562]. modulo [1225]. mold [2050]. Molecular multimodal [2048, 1881]. multioperator [831, 432]. molecules [945]. monadic [371]. multipartite [135]. multiparty [728, 487, 1700]. monads [486, 487]. money [1205, 1963]. Multipass [436]. Multiphase [2122, 868, 1824]. Monitoring [1205, 1604]. [663]. Multiple [1674, 514, 254, 1833, 1149, monochromatic [468, 1137, 1242]. Monoid 1528, 220, 740, 1932, 754, 2359, 904, 1303, [1289]. monoids [1693, 453]. monophonic 1039, 2202, 2085, 656, 585]. multiple-choice [606]. monopolies [1194]. monotone [1039]. multiple-message [656]. [1028, 287, 2197, 2028]. monotonic Multiplicative [1623]. multiplicity [654]. [154, 38]. Monotonically [2112]. Monte multiplier [2047]. multiply [1943]. [938, 941, 942, 943]. Monte-Carlo multiply-labelled [1943]. multiprocessor [941, 942]. Moran [1933]. morphic [812, 2284]. multiscale [2179]. multiset [908, 461]. Morphism [1375]. morphisms [2278]. multisets [1320]. Multistate [1244]. [2142, 690, 1791, 1557]. morphogenesis multithreaded [1063]. multivalued [1589]. [839]. Morse [2141, 356]. most [1959, 1907]. Munkr [718]. Mutation [771, 2193, 1185]. Motif [1542]. motion [1373, 1273]. Move Mutual [1692, 1874, 1529]. [1489, 937]. Move-optimal [1489]. Movement [1195, 1012]. moves [293]. NAE [1089]. NAE- [1089]. naming [251]. moving [950]. MSO [370]. MSOL [1254]. Naor [1382]. Natural MSVL [1854, 1027]. MTL [479]. mu [77]. [99, 789, 258, 1277, 1442, 297, 1017]. Nature mu-calculus [77]. Multi [2143, 1131, 1949, [1309]. navigational [1774]. NCL [1850]. 840, 262, 478, 1882, 1642, 1051, 1629, 691, Near [1659, 534, 1295]. near-colliding 398, 2262, 2349, 2308, 2012, 547, 1612, 1985, [1295]. Near-linear [1659]. nearest [1757, 298, 196, 1246, 1321, 115, 1262, 586, 1740, 1922, 1541, 1544, 382, 46, 1303, 572, 337]. 142, 1715, 1491, 1401, 2072, 1697]. multi- nearest-neighbor [337]. Nearly [586]. multi-access [2349]. multi-battle [1028, 1300, 1699]. necessary [1519]. [1629]. multi-broadcast [115]. necklaces [2249, 2126]. needed [2293]. multi-channel [1642, 691, 1401]. neededness [1226]. needs [1443]. multi-coloring [398]. multi-dimensional Negation [1144]. Negation-limited [1144]. [1882, 1262]. multi-domain [262]. negative [1345, 644, 540]. Neighbor multi-head [1321]. multi-hop [2262]. [1148, 1922, 1925, 1913, 2305, 1238, 1517, 596, multi-objective [1612, 1740]. 1413, 572, 337, 917, 2051, 1412, 1133, 799]. multi-parameter [1985]. multi-party neighborhood [1187]. Neighbourhood 25

[1719, 571]. Neighbourhood-preserving [2030, 1570]. non-binomial [1956]. [1719]. neighbourhoods [2114]. nested non-bipartite [2070]. non-constant [240]. [1097, 193, 1244, 2256]. net [1866, 416]. nets Non-deterministic [213, 2113]. [506, 1668, 418, 1804, 1730, 1173]. Network non-dynamic [818]. Non-expandable [1145, 1195, 666, 2295, 1872, 2253, 148, 1181, [1075]. non-interactive [348, 947]. 17, 59, 2103, 2394, 1979, 1603, 1079, 1236, 832, Non-interference [1362, 1501]. 1988, 1924, 1221, 317, 1981, 969, 1997, 1714]. non-iterative [1036]. non-linear [375]. network-decomposition [1872]. Non-local [955, 1367, 1380]. Networking [15]. networks non-malleable [1940]. non-monotonic [1479, 1904, 2189, 164, 1311, 249, 2011, 199, [154]. Non-overlapping 548, 1665, 1205, 1600, 2185, 814, 2370, 1980, [1099, 335, 1075, 167, 1065]. non-pointed 2138, 1990, 2073, 429, 1925, 691, 269, 763, [1372]. Non-recursive [650]. Non-regular 1968, 903, 2262, 27, 225, 578, 326, 749, 2355, [1495]. non-renewable [87]. 657, 1162, 109, 565, 545, 1860, 246, 801, 593, non-semilinear [1444]. non-strict [318]. 921, 2087, 1078, 546, 1691, 243, 288, 514, non-termination [1298]. non-trivial 2007, 861, 1349, 1552, 1673, 374, 1473, 1244, [2211]. non-uniform [320, 966]. 1511, 1781, 1246, 1983, 314, 1211, 1020, 1388, nonadaptive [473]. Nonconvex [267]. 1484, 1249, 1262, 1948, 2356, 586, 2237, 1434, nondeterminism [649]. Nondeterministic 2320, 571, 2302, 1008, 907, 233, 1176, 218, [929, 2212, 2153, 443, 1230, 1278, 490]. none 842, 541, 572, 2371, 227, 1928, 431, 599, [1717]. nonequivalent [982]. nonlinear 2051, 1412, 1995, 1237, 1569, 656, 799, 2373, [1567, 1840]. nonlinearity [1752]. 358, 126, 1401, 2055, 2130]. networks nonmonotone [253]. nonnesting [341]. [618, 60]. Neural [2106, 767, 1315, 763, 100, Nonparametric [740]. nonsimultaneous 1460, 772, 1648, 2119, 969, 840]. neurons [704]. nonstandard [982]. normal [727, [842]. neuropercolation [841]. Neutral 1227, 2177, 1130, 1792, 1914, 779, 1696, 290]. [1108, 924]. Newton [2340, 1302]. Next normalisation [1226]. Normalization [372, 1033]. Next-preserving [372]. [2139, 789, 2099]. normalized [1628]. next/previous [1033]. NFAs [649]. NIC norms [2038, 2312]. notation [1568]. note [348]. Nim [1699, 961, 1949, 1826]. [2254, 67, 1138, 119, 2259, 2265, 2390, 917, Nintendo [275]. Nivat [2111]. NLC [700]. 460]. notion [1151, 661, 1746]. Notions NLC-width [700]. No [442, 266, 1530, 346]. [216, 822, 716]. Novel No-Free-Lunch [442]. Node [1713, 2353, 1390, 1185]. novelty [2184]. NP [1875, 235, 1145, 1541, 1002, 172]. nodes [1851, 1247, 219, 1137, 1832, 434, 1581, 1397, [759, 58]. noise [1909, 1258]. noisy 1242]. NP-complete [1137]. [495, 711, 775, 1142]. Nominal [1749, 2146]. NP-completeness [1581, 1242]. NP-Hard Non [1851, 1247]. NP-hardness [1590, 213, 1075, 1099, 342, 1495, 335, 1362, [1397, 1832, 434]. NP-intermediate [219]. 245, 955, 1367, 650, 1971, 1444, 320, 2030, NPDAs [1836]. nucleolus [624]. 1501, 318, 1234, 167, 966, 2070, 240, 154, nucleosome [2269]. Number 1940, 1570, 87, 348, 2113, 286, 1298, 947, 1380, [817, 1239, 2306, 97, 655, 1037, 2177, 972, 223, 375, 2211, 1956, 818, 1557, 1036, 1372, 1065]. 2074, 258, 4, 474, 1191, 65, 195, 909, 777, 801, non- [286]. Non-adaptive [1590, 342]. 2167, 872, 611, 2126, 2058, 2360, 2341, 2247, Non-additive [245]. Non-atomic [1971]. 1554, 982, 1640, 1937, 554, 122, 1520, 1566, non-automaton [1234]. non-binary 1835, 944, 1263, 1624, 1910, 1938, 1015, 620]. 26 numbers [2189, 1963, 1778, 1775, 297, 1017, 2357, 2060]. [1011, 1229, 2093, 2294, 329, 1305, 2200]. open-endedness [2189]. opening [2344]. numeration [1931]. numeric [1582]. operation [1405, 1172]. Operational [649]. Numerical [2192, 1231, 926, 925, 1647]. operations [778, 2403, 642, 2100, 687, 2381, 350, 783]. O [163]. OBDD [1873]. OBDD-based operator [1339, 2175, 135, 1185, 1122]. [1873]. object [823, 1772, 1688]. operators [1585]. Opinion object-oriented [823, 1772]. objective [1831, 983, 2330]. optima [13]. Optimal [1207, 1612, 1740]. objectives [151]. [1507, 743, 1531, 160, 2026, 538, 1612, 1434, objects [776]. oblivious 634, 1113, 572, 1536, 116, 2236, 2331, 1578, [248, 1575, 111, 533]. obnoxious 2140, 338, 220, 1933, 73, 1028, 2000, 64, [1507, 2038, 1718]. observant [962]. 1203, 247, 1300, 1489, 1752, 534, 293, 2170]. observation [1732]. Observational [182]. Optimality [2353, 2232]. Optimally observations [1286, 1085]. obstacles [543, 976, 2013, 2415]. optimisation [1761]. Obtaining [518, 1751]. Occam [12, 2048]. Optimistic [26, 35]. [1866]. occupancy [2269]. occurrence Optimization [1404]. occurrences [890]. octagon [1428]. [2216, 995, 495, 711, 1811, 924, 123, 2191, 90, octagonal [415]. Octal [1828]. octant [778]. 14, 191, 1369, 102, 13, 925, 420, 1401, 2045]. octilinear [2131]. odd [421, 874, 1752]. optimizations [416]. optimize [1414]. odd-even [874]. odd-variable [1752]. Off Optimizing [802, 1681, 10, 276, 2056, 57]. [2263, 2227]. Off-line [2263]. offensive optimum [2027]. option [245]. oracle [224]. Offline [399]. offs [342, 603, 1953]. oracles [998, 201, 36]. [1571, 1438, 314, 650]. oligopolistic [125]. orbit [2100]. orbits [78]. Order Ollivier [1427]. omega [993]. on-board [892, 737, 893, 1796, 2372, 789, 257, 479, 397, [27]. On-line [2197, 2263, 1769, 1524, 2055]. 1198, 728, 72, 1059, 1053, 547, 486, 428, once [1679, 814, 1519]. One 2005, 787, 1561, 366, 234, 380, 1499]. [1576, 1321, 470, 33, 1923, 2383, 743, 480, order-incomplete [2372]. 2254, 1283, 2138, 345, 344, 607, 516, 1730, Order-preserving [892, 893]. 1179, 447, 1827, 1959, 2323, 864, 1718, 290, order-theoretic [257]. Ordered 1302, 1971, 1907, 293, 118]. one-agent [480]. [1051, 1121, 379, 721, 560, 229, 2324]. one-cop-moves [293]. one-counter [1730]. ordering [1632, 607, 1698, 2417]. orderings One-dimensional [470, 344, 447]. [1540]. orders [477, 871, 795, 585]. ordinal one-facility [1718]. one-hop [2138]. [2275]. ordinary [430]. Ore [359]. one-round [1971]. one-rule [2323]. organization [2269]. organizing [243]. One-Sided [1923, 607, 290]. one-symbol orientation [97, 899, 1607]. orientations [1179]. One-to-one [1576, 33]. [2029, 126]. oriented [823, 403, 1772]. one-unambiguous [1283]. One-way origami [1223]. oritatami [2191, 1220]. [1321, 2383, 743, 345, 516, 1827, 118]. ones orthogonal [2328, 2418]. other [1141, 1717]. [2028]. Online [320, 2083, 381, 398, 253, 469, otter [962]. Out-degree [1617]. outer 2339, 598, 2204, 2082, 1414, 446, 714, 142, [2190]. outerplanar [1003, 2022, 2416, 1816]. 1435, 141, 1643, 360, 995, 1208, 1150, 1006, Outfix [1449]. Outfix-guided [1449]. 551, 2222, 1045, 938, 49, 1612, 960, 447, outlier [80]. outliers [2168]. output 1079, 2335, 1493, 355, 520, 1592, 2015, 534]. [2112, 779]. output-sensitive [779]. only [236]. onset [1545]. open outsourcing [30]. overabundant [2267]. 27

Overdetermined [46]. overlapping Pareto [123]. paribus [1125]. Parikh [1075, 1099, 394, 167, 1781, 335, 1454, 1065]. [228, 1796, 1619, 1465]. Parikh-reducing overlay [3, 68]. OWA [90]. [1465]. parity [687, 173]. Parry [1931, 94]. parsable [1105]. parsimony [957]. parsing P [2024, 1310, 2142, 1315, 2192, 100, 766, [1536, 1281]. Part [1486, 1163]. Partial 103, 764, 772, 2119]. P4s [1510]. packet [734, 1779, 368, 710, 1952, 622, 186, 2154, [1381, 2083, 2339, 1246, 634]. packets [1643]. 1747, 1420, 1666, 1570, 1732, 2080, 2125, 175, packing 1547, 1581, 916, 1489, 234, 1987]. partially [399, 913, 551, 2244, 1657, 910, 465, 56, 2082, [721, 1113]. participants [2026, 2231]. 1721, 803, 446, 393, 979, 1152, 2229]. Particle [2045, 13, 420]. partite [2303]. packings [967, 1037, 195]. page [1660]. Partition [1084, 2124, 1348, 1899, 636]. PageRank [18]. Pages [2345, 2386]. Partitioned [1793, 1660, 166]. partitioning paging [108]. pair [1685, 1035, 2161]. [1239, 544, 1609, 2246, 1160]. partitions pairability [2070]. Paired [1389, 873, 906, 1834, 1617, 2081, 2310, 341, [623, 1262, 848, 330]. paired-domination 1572, 625]. partners [195]. party [330]. pairing [2407]. pairing-friendly [2308, 2012]. Pascal [2126, 1931]. [2407]. pairings [30]. pairs [1294, 1419]. Pascal-like [2126, 1931]. passing [1950]. pairwise [727, 4, 474]. palindrome [1069]. passive [1652, 1291]. Path palindrome-free [1069]. palindromes [2017, 2130, 2306, 249, 2151, 2240, 548, 2294, [67, 1890]. Palindromic 1576, 623, 2300, 1394, 998, 1860, 288, 514, [2142, 781, 2235, 1537]. palletizing [2309]. 196, 1262, 14, 423, 1040, 2116, 848, 713, pancake [227]. pancakes [589]. 2086, 2239, 2164, 599, 1092, 33, 981, 1401]. Pancyclicity [471, 809]. Papers [2225, 505]. path-forests [2294]. path-reporting [998]. paradigm [1382]. Parallel Paths [2395, 199, 503, 2325, 2321, 2070, 869, [1433, 991, 2180, 1363, 2196, 320, 1339, 440, 1235, 468, 911, 1490, 745, 1365, 130, 1950, 1495, 1354, 1090, 1996, 1392, 987, 419, 704, 783, 1551, 161, 2065, 1994, 535, 540]. 1505, 315, 2343, 1488, 530, 1475, 1769, 668, pathway [1981]. pathways [283]. Patricia 57, 2124, 574, 1633, 2013, 2415, 1715]. [635]. Pattern parallel-batch [1769]. parallel-machine [841, 339, 594, 2093, 2096, 1538, 782, 893, [1475]. parallelism [1865, 766]. 1542, 1785, 2111, 2021, 1067, 723]. parallelizable [1664]. Parameter pattern-avoiding [2093]. Pattern-based [1731, 1983, 1811, 110, 1930, 2045, 1985, 173, [841]. patterns 1478, 387, 1832]. parameter-rich [1811]. [1833, 1795, 1707, 501, 1182, 1323, 133, 842]. parameterised [1982]. parameterizations payment [51]. payoﬀ [1732, 1252]. payoﬀs [1411, 2157]. Parameterized [48]. PCF [260]. PCGs [2251, 136]. PD [666, 1639, 1152, 1987, 752, 1023, 958, 1600, [1499]. PDAs [886]. PDL [1339]. peak 517, 55, 2338, 2168, 1759, 1723, 756, 1368, [1505]. penalties [1138, 1861, 819, 2067]. 1763, 435, 1002, 539, 2042, 1911, 1721, 1125, Penalty [530]. perception [1902]. 1815, 2164, 383, 1824, 979, 549, 2196, 1143, perception-parameterized [1902]. 1829, 2310, 121, 594, 2317, 2155, 404, 1722, percolation [1517]. Perennial [2012]. 83, 170, 2076, 552, 2247, 1153, 1902, 632, Perfect [2347, 1428, 1101, 1830, 1905, 724, 2239, 2378, 535]. parameters 2040, 1250, 1625, 1689, 126]. Performance [438, 1763, 219, 47, 1136, 698, 2179, 118]. [2356, 48, 1361, 2037, 102]. Period Parametric [81, 1841]. parentage [204]. [1535, 2288, 907]. periodic 28

[1132, 579, 1621, 840]. Periodicity [1378]. Polygon [2252, 2227, 2277, 1245]. [451, 215, 1067, 2265, 1070]. periods [1064]. polygonal [165]. polygons permutahedron [995]. permutation [2071, 544, 2240, 2131, 1452]. polyhedral [1352, 2402, 1316, 1538, 591, 452, 1199, 40, [1761]. polylogarithms [2406]. 705, 585]. permutations Polymerization [945]. polymorphism [860, 462, 1989, 1795, 1678, 1418, 1583]. [2151]. Polynomial [1476, 1669, 464, 1816, permute [2335]. Permuted [882]. persist 1956, 508, 2156, 2300, 687, 1, 984, 259, 2366, [1602]. persistent [1101]. personal 1083, 200, 949, 382, 1258, 1091, 2229, 1914, [1857, 2223]. personalized [53]. 1716, 423, 1301, 1299, 794, 2316, 1303, 1306]. perspective [608, 1980, 1629, 1809]. Polynomial-time [1669, 687, 1914]. perturbation [748]. pessimistic polynomials [1296, 1840, 2414, 1302, 1303]. [1366, 617]. Pete [683]. Petersen [171]. polyomino [1250]. polyominoes Petri [1668, 418, 1804, 1866, 1173]. Pfaffian [784, 1170, 2108]. polytime [257]. [126]. phase [841]. phylogenetic polytopes [2354]. polytrees [338]. [2355, 957, 1694, 1943, 1427, 585]. Population [1900, 11]. posets [156]. phylogenetic-tree [1943]. phylogeny position [2254, 1700, 2352]. [1101]. physical [119]. picking [1577]. position-dependent [2352]. positions picture [1285, 2318]. pictures [1075, 2092]. [1334]. Positive [644, 2200, 1235, 2107, 1724, piecewise 1908, 2255, 736, 1306, 540]. positivity [616]. [1734, 1474, 1812, 1322, 1559, 796]. possible [2372, 706, 1769]. Post [139, 452]. pigeonhole [174]. Pike [683]. pile Post-challenge [139]. postal [747]. [1389, 961]. pivot [677]. pixels [777]. PKE Posterior [1811]. Postfix [62]. potential [2344]. place [1364]. placement [325]. [2011, 931]. potentialities [508]. Power plaintexts [2030]. plan [2049]. Planar [2314, 336, 80, 2326, 381, 793, 52, 1800, 119, [2334, 363, 1680, 1254, 2230, 1508, 1641, 132, 1456, 455, 2049, 541, 2268, 412, 533, 923, 702, 1814, 1037, 948, 866, 208, 1967, 1155, 573, 973, 2374, 2119, 1647]. powered [2093]. 1748, 869, 1578, 1953, 403, 951, 1554, 2217, powerful [224]. powers [858, 2363]. 521, 1486, 153, 596, 798, 1615, 917, 1148, Practical [388, 2166]. practice 1995, 813, 96, 1762]. Planarity [600, 1302, 2371]. Precise [1351]. precision [2388, 129, 121, 303, 608]. plane [2266, 1572, [1734]. preclusion [171, 696, 861, 1349, 198, 2406, 953, 1400, 779, 1160, 337, 1907]. 1552, 1566, 2259, 1910, 1938]. precondition planes [781]. planning [1962]. plausible [486]. predecessor [1957, 50]. [483]. play [231, 1658]. played [389]. player predecessor-existence [50]. predicate [2143, 1131, 1949, 114]. players [1358]. predict [1545]. Predictors [1744]. [125, 1603, 114]. playing [939]. Playout Preemptive [238]. Preface [937]. playouts [938]. PMC [2292, 285, 1853, 2089, 485, 1165, 1276, 2401, [1913, 2305, 1238, 60, 1927]. point 1978, 569, 1897, 774, 2216, 1095, 513, 732, [1352, 2227, 1037, 1198, 1698, 2417, 154, 162, 1356, 830, 1646, 1606, 1871, 836, 1293, 1082, 2076, 146, 1554, 740, 155, 233]. pointed 537, 1712, 1705]. preferences [1372]. points [2071, 1608, 802, 1681, 693, [2234, 1690, 1125]. Prefix [1314, 1334, 647, 902, 1703, 1791, 1306]. polarization [1461]. 2177, 1062, 2207, 1130, 462, 437, 1792, 1174, polarizations [2119]. polarized [1311]. 863, 1419, 350, 1696, 1284, 1700]. policies [1338, 938]. Policy [1818, 937]. prefix-convex [2207]. Prefix-free [647]. politician [276]. poly [1378]. poly-slender Prefix-suffix [1314]. prefixal [2323]. 29 prefixes [2074]. Preparing [1886]. 1420, 706, 1759, 2397, 679, 1722, 1723, 2076, Presburger [1728]. prescribed 1805, 87, 1396, 49, 514, 1364, 453, 791, 2363, [1201, 1950, 2086, 1994]. presence [2168]. 1864, 219, 173, 2409, 552, 539, 90, 1957, 2069, Presentation [465]. presented [1693]. 1236, 230, 1863, 1911, 56, 1085, 1514, 14, 150, preservation [1023, 958]. preserve [73]. 1721, 2362, 1266, 1213, 847, 1369, 1380, 1040, preserves [1511]. preserving 1220, 521, 1486, 446, 1397, 2211, 553, 393, [1964, 892, 893, 921, 204, 1755, 2307, 1719, 1653, 1092, 819, 2062, 757, 1720, 2352, 1030, 1221, 393, 1038, 372]. pressure [2330]. 979, 1189, 1962, 1043, 1076]. procedure prevention [567]. previous [1033]. price [629, 786]. procedures [824, 251]. process [1513, 680, 1492, 59]. pricing [142]. prima [1357, 74, 763, 1933, 1741, 109]. processes [778]. Primal [37, 2218, 253, 819]. [686, 1373, 151, 672, 994, 996, 664, 50, 1917]. Primal-dual [37, 2218, 253, 819]. prime processing [237, 1457, 520, 1277, 1633, [2090]. primitive [778, 369]. principle 1435, 141, 1643, 2352]. processors [1311]. [843, 174, 2238]. principles [1458]. prints product [604, 1192, 590, 1351, 84, 519, 292, [1619]. prior [1596]. priorities [565]. 1134, 2166, 1910]. production priority [1874]. Prisoner [2184]. Privacy [61, 140, 1231]. products [2257, 689, 1835]. [204, 408, 2073]. Privacy-preserving [204]. Prof. [1534, 2261]. Professor [1416]. private [738, 2166]. Probabilistic Profinite [1289, 1114]. profit [1388]. [2337, 250, 1985, 2284, 736, 1359, 302, 563, Program [261, 1500, 939, 940, 2113, 182]. 1972, 1044, 1883, 2148, 1289, 1203, 1731, 482, programmability [342]. programmable 251, 1093]. probabilities [1141, 1229]. [1222]. programmer [369]. programming probability [1185]. probe [2134, 112]. [1208, 823, 1344, 1561, 511, 904, 1093]. probing [56, 2056]. Problem programs [727, 1339, 1883, 1198, 644, 259, [2075, 1508, 313, 2030, 1227, 1859, 570, 2402, 1865, 183, 1298, 88, 730]. progressions 496, 1799, 1023, 958, 163, 1156, 608, 439, [2398, 2023]. Progressive [940]. projection 1463, 975, 1737, 351, 1967, 1448, 1921, 2283, [629, 2186, 2060, 1304, 637, 2061]. 384, 93, 344, 628, 607, 1725, 1257, 1538, 327, Projections [2150, 2316]. projective 966, 1609, 400, 1698, 2417, 1892, 1701, 1848, [1297]. projects [1272]. proliferation [564]. 326, 1354, 1090, 1394, 448, 2193, 2190, 1, 984, Promise [1189]. promoters [766, 923]. 678, 590, 1241, 1860, 1820, 38, 1866, 272, prone [1532]. Prony [1295]. Proof 1506, 1368, 598, 2204, 1612, 1763, 435, 288, [506, 2149, 1702, 1839, 854, 922, 1242, 2304]. 229, 2246, 1138, 2340, 2059, 1153, 1951, 1430, proofs [479, 174, 644, 2353, 106]. 1832, 1546, 2281, 610, 2009, 1214, 1502, 530, propagation [1756]. Proper [899, 611, 554, 916, 1716, 1419, 22, 632, 1630, 520, 1696, 1628, 2121, 129, 97, 2029, 2207, 2313, 40, 2058]. 50, 147, 2312, 1285, 386, 2027, 798, 48, 1485]. properly [468]. Properties problem [1680, 161, 2186, 2006, 2357, 420, [2383, 303, 873, 906, 279, 2185, 422, 682, 782, 2158, 134, 1039, 1824, 37, 636, 1861, 2067, 2327, 497, 472, 1751, 219, 884, 190, 805, 1918, 1491, 2279, 362, 2199, 360, 981, 638, 1858, 1380, 2382, 181, 736, 94, 2351, 566, 1997]. 718, 29, 2303, 1697, 24, 2172, 577, 452, 2319]. property [2402, 884, 287, 1908, 2170]. Problems Proportional [2059, 1194, 117, 1521]. [2408, 1727, 549, 2196, 164, 1507, 2038, 166, propositional 1693, 1684, 121, 1010, 2198, 2155, 2134, 1012, [174, 629, 1055, 482, 637, 1804]. protected 1903, 1811, 2326, 1448, 2232, 1817, 436, 604, [759]. protects [725]. proteomes [1425]. 2073, 619, 2244, 171, 2313, 2380, 1756, 2338, protocol [1909, 1918]. protocols 30

[666, 409, 216, 1900, 1767, 754]. prototype [1885]. Queens [1737]. Quell [354]. queries [1757]. Provably [1550, 901, 1036, 388]. [992, 1123, 2240, 721, 883, 1706, 1786, 2017, providing [1404]. Proving 609, 64, 1033, 587, 572, 337, 2137]. Query [1918, 1345, 1810]. proxy [1007, 901]. prune [1124, 679, 1742, 1799, 193, 221, 2018, 1953, [1427]. pruning [407]. pseudo [1861]. 1058, 633]. Query-competitive [679]. pseudo-solution [1861]. pseudofractal querying [971]. Question [2118]. [1263, 1624]. Pseudoknot [1405]. questions [1708]. queue [298, 1246, 190]. Pseudoknot-generating [1405]. queues [2309]. quotient [647]. Pseudorandom [676, 118, 972]. pseudostandard [2139]. PSPACE R [500]. R-LINE [500]. R1Q [1799]. [1049, 593, 1264, 683, 2264, 274]. RaceTrack [1846]. Rademacher [1783]. PSPACE-complete [1049, 1264, 683, 274]. radio [53, 691, 2262, 571]. radius PSPACE-completeness [593]. PTAS [270, 1080]. radix [2243]. Raffaele [1416]. [24, 2027, 134]. PTime [1559]. rainbow [1003, 362]. raised [947]. Random PTime-complete [1559]. Ptolemaic [464]. [1229, 297, 837, 1399, 1013, 342, 1944, 1692, Public 1191, 1429, 1722, 759, 603, 611, 211, 1418, [2304, 201, 2307, 1272, 818, 1035, 139, 1912]. 2180, 114, 499, 201, 218, 1431, 85, 1017, 36, public-key [2307, 818, 139]. pullback [368]. 973, 2276, 466]. randomization [408]. pumpable [605]. pure [1118]. purely [764]. Randomized [1508, 1873, 49, 1430, 1532, Pursuit [1046, 2143]. pursuits [2337]. push 533, 500, 409, 1018, 2052, 20, 362]. [1585]. push-the-button [1585]. pushdown Randomness [2160, 1382, 859]. randoms [187, 1051, 2104, 92, 2114, 2382, 857, 2061]. [1494]. Range [587, 1799, 883, 221, 2018, Pushing [1823]. pushout [1779]. puzzle 970, 609, 546, 1058, 1033, 1153]. Rank [1702]. puzzles [266]. PV [730]. [1999, 304, 2341, 748, 1032, 1186]. PV-programs [730]. pyramid [58]. Rank-maximal [1999]. rank-width [304]. Ranked [1833]. Ranking [871, 2249, 2231]. QANIZK [2133]. QBF [179]. QoS rapid [2056]. Rate [298, 1246, 1401]. QPTAS [1554]. Quad [1019, 1467, 429, 621, 419, 2024, 2127, 1596]. [707]. Quad- [707]. quadraginta [778]. Rate-limited [1019]. rates [2193]. ratio quadratic [961, 88]. quadrilaterals [2033]. [1610, 2022, 2416]. rational quadtree [777]. Qualitative [1172, 1703, 497, 1112]. ratios [292]. Rauzy [374, 1291, 2007, 2371]. quality [1398]. [294]. Raw [742]. Razor [1866]. re [1007]. Quantified [721]. quantifiers [72, 1212]. re-encryption [1007]. Reachability Quantifying [409, 1029, 2282]. quantiles [1841, 1860, 211, 1863, 1727, 1734, 71, 1530, [546]. Quantum 565, 827, 1985, 1203, 1842]. [1879, 1169, 1742, 631, 1885, 722, 1888, 1886, reachability-time [827]. Reaching [1461]. 421, 765, 1087, 106, 412, 1884, 1881, 1189]. Reaction [422, 414, 768, 1445, 769, 1980, quantum-inspired [1881]. Quartet [2009]. 561, 1317, 430, 1451, 921, 1979, 832, 2115, Quasi [2290, 2095, 1621, 477, 37]. 413, 1325, 1981, 1186]. reactive [1972, 1807]. Quasi-automatic [2290, 2095]. read [1679, 814, 236, 1519]. read-once quasi-greedy [37]. quasi-orders [477]. [1679, 814, 1519]. read-only [236]. reads Quasi-periodic [1621]. Quasicontinuous [1424]. Real [258, 1299, 270, 2370, 381, 1729, [156, 373]. Quasipolynomial [174]. 329, 932, 1303, 1306]. real-time quaternion [2414]. QUBO [1448]. qudit [2370, 381, 1729, 932]. real-world [270]. 31 realisability [1869]. Realistic [1245, 1584]. [1077, 1389, 2391, 1903, 1611, 1448, 2073, Realizability [260, 1622]. realization 1723, 1134, 1369]. Relating [717]. relation [1696]. reallocation [2234]. really} [708]. [2258, 1366, 1955, 1796, 694]. relational reals [297, 1017]. rearrangements [1583]. [1750]. relations [661, 1172, 1887, 1230, 674, Reasoning [2369, 1804, 482, 1460]. 863, 1939, 1067, 2265, 857]. Relationship rebalancing [753]. receiver [2344]. [804, 1021]. Relative [108, 944]. relaxation reciprocal [529]. Recognition [1609]. Relaxed [1610, 1601, 1907]. relay [2348, 1378, 1618, 749, 464]. recognizable [1145]. relevance [1880]. Reliability [2318, 1700]. recognize [977]. Recognizing [1515, 1924, 694, 1673, 1211]. relocatable [866, 1829, 112, 1894]. recoloring [468]. [198]. remainder [413]. removal [701]. Recombination [562]. recommendations Rendezvous [578, 746, 1895, 1360, 575]. [733]. Recommending [1969]. renewable [87]. rental [245]. Repackable recompression [343]. reconciliation [743]. [586]. repair [502, 633, 2186]. repeats Reconfiguration [2040, 898, 1000, 1763]. [1640, 1890]. repetends [725]. Repetition Reconstructing [1539]. Reconstruction [2257]. repetitions [858]. repetitive [784, 2108]. recovery [2037, 719]. replacement [235]. replica [1535, 1975, 1781, 2201, 1252]. rectangle [1409]. replicas [325]. replication [1738]. [1037]. rectangular [1365]. rectilinear reporter [2190, 1223]. Reporting [2332, 1031, 2312, 1245]. recurrence [211]. [890, 364, 998]. represent [2219]. recursion [1635, 1708, 489]. Recursive representability [200]. Representation [2107, 824, 788, 1865, 2113, 1020, 369, 650, [2369, 1239, 712, 89, 2179, 117, 1521, 44, 380, 58, 1569]. recursively [734, 674]. Red 673, 1884]. representations [1369]. Red/Blue [1369]. Red/Blue-split [2173, 845, 395, 924, 1936, 591, 953, 127, 175, [1369]. redistricting [2248]. reduce [600]. 1122, 1064, 612, 1465]. Representing Reducibilities [674]. reducibility [661]. [1011]. research [1743]. reset [2104]. resets Reducing [1032, 1617, 1465]. Reduction [1735]. resilience [379, 1550]. resiliency [957, 743, 1314, 739, 1839, 428, 1856, 1719, [2338]. resilient 1163, 169, 716]. Reductions [1760, 240, 1142, 1935, 1827, 2307, 2035]. [87, 1490, 2232, 1113]. Reeb [776]. Rees resistant [2407]. resisting [1036]. [1021]. Refined [677, 881]. refinement Resolution [480, 70, 786, 921]. refresh [1940]. [2064, 1679, 1210, 1578, 179, 671]. refutations [1679]. region [2227, 948, 2226]. Resolvability [2354]. resolving [628]. regions [1111]. register resource [262, 1868, 2218, 1946, 247, 319]. [1803, 1531, 1490, 2243, 764]. regraft [1427]. resource-bounded [1868]. resources regression [1087]. regret [711, 548, 288]. [686, 87]. respect [276, 1928, 981, 2170]. Regular [1760, 2109, 1310, 993, 1281, 1100, response [1787]. response-dependent 1631, 1447, 2207, 2096, 1283, 1495, 43, 138, [1787]. responsive [2234]. restart [2324]. 2208, 786, 963, 1366, 2214, 617, 1691, 497, restart-delete [2324]. restarting 646, 189, 648, 2410, 2356, 717, 805, 798, [1324, 857]. restrained [813]. Restricted 1022, 2210, 1465, 1942, 118, 566]. regularity [80, 1946, 695, 1254, 959, 1010, 2057, 419, [1266, 1512]. Regulated [1324]. regulating 1055, 633, 1157, 848, 713, 1363]. [941]. regulatory [109, 374, 1983]. restrictions [467, 1031, 1945]. results rejection [704, 1475, 1363]. Rekeying [2050, 266, 1234, 1492, 438, 2398, 1572, 775, [1274]. relabeling [235]. Related 1930, 1279, 32, 162, 146, 791, 2000, 1455, 1085, 32

1437, 1517, 1213, 2132, 11, 147, 340, 1858]. [14, 495, 826, 11, 1653]. runtimes [10]. retrieval [1879, 579, 1833, 1142, 864]. Russians [1063]. RVCCC [1997]. Rytter return [357]. revenue [1156, 220]. reversal [2261]. [1754, 239, 1418, 647]. reversals [1447, 1556, 1323, 1140]. Reversibility S [1534, 445]. S-BGP [445]. Safe [787]. reversible [196, 1842, 240, 697]. safety [1729, 1810]. [722, 1446, 1321, 50, 2047, 107, 2127, 662]. SAGBI [149]. salesman [847, 1653]. reversibly [2213]. revisited sampled [1418]. Sampling [2283, 1142, 1776, 145, 1730, 2360, 1214, 22, [1428, 183, 1399, 318, 419, 1614, 986, 633, 466]. 1460, 874, 1680, 968, 1258]. Revisiting sand [1389, 86]. Sannella [1777]. sat [1707, 362]. Revocable [692]. revocation [2015, 2028, 1410, 2276, 1089]. satisfaction [1683]. reward [663]. rewards [2107]. [1472]. SATisfiability rewrite [661, 2323, 1637]. rewriting [2172, 2148, 1472, 1259, 821, 539, 1093]. [2101, 2105, 2150, 366, 1225, 368, 192, 1700]. Satisfying [585, 849, 1074, 1615]. saturated RFID [2220]. RGB [2217]. RGB-digraphs [2272]. Saving [1930]. scaffold [110, 1223]. [2217]. Ricci [1427]. Rich scaffolding [384, 1725]. Scalable [691]. [1350, 1811, 1333]. ride [1824]. ridesharing Scale [1592, 1249, 1263, 1624, 126]. [1857, 2223]. Riemann [79]. right Scale-free [1592, 1249, 1263, 1624, 126]. [2383, 900, 1806, 647, 2112, 1907]. scaled [882]. scaling right-angle [900]. Rigorous [11]. ring [812, 1269, 1398, 434, 355, 1719]. scan [634]. [508, 1970, 2046, 28, 1935]. rings Scattered [967, 795]. scattering [1755]. [579, 1476, 200, 111, 710]. risk [199, 852]. scenario [367]. scenario-based [367]. risk-modeling [852]. risks [2048]. RLE scheduled [2193]. Schedulers [1808]. [1423]. RNA [339, 1921]. road [326]. schedules [2180, 2056]. Scheduling robber [527, 2297, 1291, 810, 2143]. [1904, 1392, 704, 1505, 2085, 206, 125, 320, Robbers [2298, 950, 1048]. robots 1381, 959, 202, 680, 2083, 440, 1006, 238, [2039, 577, 1528, 2266, 654, 597, 1970, 831, 755, 1946, 1398, 61, 1664, 2339, 38, 1729, 1755, 498, 1630, 111]. Robust 123, 2122, 87, 207, 960, 1951, 2335, 1493, [71, 2075, 1876, 1259, 1842]. robustness 2281, 119, 124, 530, 237, 1475, 1769, 531, [279, 1430]. role [121, 862]. Roman [2347]. 140, 2197, 2132, 401, 1040, 1633, 446, 48, roofs [1245]. root [1299]. root-finding 714, 2158, 1435, 2202, 141, 2352, 1363, 1468]. [1299]. rooted [1427]. Roots schema [1185]. scheme [522, 551, 603, 204, [2414, 1068, 1301, 1302]. Rosser [307, 1465]. 949, 2113, 1575, 1683, 901, 1715, 573, 460]. rotating [2209]. rotation [1752]. Rouen schemes [737, 19, 2026, 1007, 1935, 1659, [1059]. round [1078, 1971]. rounding [88]. 348, 115, 818, 671, 2329]. schools [1016]. rounds [2136]. routing Schwartz [1297]. Sci [1527, 253, 2286, 742, 533, 553, 2055]. rows [2418, 1023, 474, 1329, 2417, 1354, 984, 68, [2404]. RQL [1124]. RSA [1483, 2336, 1952]. 2416, 1496, 1004, 1486, 2415, 2024]. Science Rule [1124, 366, 1220, 2323, 996, 1459]. [278, 559, 1879]. scientist [1166]. scores Rule-based [366, 1459]. rulers [267]. rules [1087, 944]. SDNs [1530]. Search [2370, 957, 1055, 366, 589, 1648]. Ruleset [2295, 954, 1922, 966, 2266, 2136, 2052, 1821, [2191]. rulesets [1585]. Ruling [1677]. run 2079, 1612, 1998, 493, 2123, 941, 943, 2053, [1061]. run-length [1061]. runs 944, 1163, 1089, 360, 1697, 938, 942]. [1436, 1071]. Runtime search-based [493]. Search-space [954]. 33 searcher [854]. searches [493]. Searching [522, 198]. sentiment [1881]. Separability [2292, 116, 1043, 133, 213, 1208, 1471, 577, [1559, 786]. separable [416]. Separating 1626, 2176]. searchlight [326]. second [1604, 1670, 1182, 2066, 2317, 877, 1556]. [5, 1329, 1328, 728]. second-order [728]. separation [824, 270]. separations [735]. secondary [339]. Secret separator [2367]. Sequence [1686, 2026, 421, 595]. section [2377]. [887, 880, 2267, 223, 523, 1149, 1577, 1178, Secure [999, 30, 2098, 1019, 2308, 2012, 357, 1546, 2178, 1038, 217]. Sequences 1550, 2344, 2322, 914, 947, 901, 1036, 1035, [1103, 477, 1097, 2093, 1481, 1692, 2365, 388, 2072, 2329]. securely [754]. Security 2141, 1077, 25, 1789, 2079, 1494, 1768, 2315, [1379, 1973, 822, 603, 1007, 2307, 460, 716, 1391, 705, 1522]. sequent [2147]. 1015]. seeds [1424, 1547]. SEF [1855]. Sequential [201, 1585, 1270, 1709, 315, 841, SEFE [166]. segmentation [776, 1457]. 107, 2282, 1647]. Serbanuta [1619]. serial Segmenting [568]. segments [160, 140]. serializability [832]. series [2129, 2181, 2013, 2415, 2228]. segregation [1612, 1505, 740, 2124]. series-parallel [298]. Select [2335]. Selected [505, 2225]. [1505]. server [500]. service [1398, 1491]. selection [1469, 70, 473, 1511, 677, 401]. session [1205, 1636]. Set selective [2344]. selectors [2349]. Self [880, 553, 1037, 570, 743, 1681, 693, 1665, [249, 2039, 1181, 243, 325, 1193, 1531, 1527, 948, 628, 341, 1756, 1155, 1892, 2219, 679, 1191, 2156, 797, 1892, 1218, 359, 1800, 1893, 2140, 1657, 52, 1000, 292, 173, 2408, 1554, 697, 111, 1741, 1217, 2186]. Self-adjusting 1454, 2286, 22, 1816, 1532, 1220, 2264, 1248, [249]. self-assembly 1064, 2013, 2415, 698, 1092, 535, 2010]. sets [1191, 1218, 1800, 1217]. self-healing [1527]. [1444, 1075, 2092, 1121, 1608, 1168, 971, Self-organizing [243]. self-stabilization 1332, 157, 395, 721, 1446, 1171, 1256, 965, [111, 1741]. Self-stabilizing [2039, 1181, 65, 54, 1107, 1108, 1498, 1595, 816, 1898, 325, 1531, 2156, 797, 1892, 359, 1893, 697]. 2167, 359, 226, 497, 646, 1768, 2040, 729, Self-updatable [1193]. Selfish 1473, 1182, 554, 2411, 205, 2396, 2086, 2028, [1291, 2143, 1392]. sell [448]. selling [220]. 1894, 1263, 1624, 297, 1017]. setting Semantic [1337, 505, 2145]. semantically [1827, 1784, 2072]. several [1722, 230, 1040]. [1035]. semantics [1879, 1668, 1281, 976, shadows [1035]. Shamir [1767]. shaped 1883, 481, 1198, 1450, 1053, 1500, 2375, 486, [745]. shapes [953]. Shapley [59]. share 1983, 1561, 668, 1779, 1125, 833, 76]. Semi [1901]. Shared [1688, 199, 1382, 547]. [1006, 960, 520, 138, 54, 765, 1908, 2255, 1625]. Shared-object [1688]. shares [947]. semi-definite [1908]. semi-definiteness sharing [2255]. semi-linear [138, 54]. Semi-online [959, 1344, 2026, 421, 2048, 180, 1824, 961]. [1006, 960, 520]. semi-perfect [1625]. sharp [1156]. Shift [1287, 1794]. semi-quantum [765]. semicomplete Shift-invariant [1287]. Shifts [1097, 601]. [1834]. semidefinite [2200]. Shinohara [1707]. Shoham [2374]. shop semidistributive [1126]. semigroups [229, 1040, 2357]. shops [1715]. Short [2095, 1021, 1234]. semilinear [1444]. [2322, 2288, 67, 201, 947, 670, 1197]. semiregular [1239]. semiring [73]. Shorter [443]. Shortest semiring-induced [73]. semirings [1766]. [630, 2240, 1235, 1394, 1438, 1860, 1364, 64, semitotal [1991]. sensitive [666, 779, 1265]. 1547, 130, 14, 1551, 1040, 2065]. should sensitivity [2031, 1052, 1955, 2256]. sensor [1443]. shuffles [454]. sibling [944]. side [657, 546, 314, 1434, 572, 2055]. sensors [2148]. side-channel [2148]. Sided 34

[1923, 332, 607, 290, 534]. Sierpiński snap-stabilization [1359, 793]. SNC [1293]. [1263, 1624]. Sieve [817]. sight [670]. Signal Snowflake [945]. Snowman [1264]. Social [1454]. signaling [431]. signals [775, 1884]. [2330, 1831, 1600, 1968, 246, 243, 1388, 1714]. signature [1935, 1683, 901, 1112, 36, 2329]. Sofic [601]. software [493]. solo [1327]. signatures [850, 1142, 2322, 201, 947, 2169, Solomon [1442]. Solomonoff [286, 1591]. 388, 716, 2072]. signed [1937]. signing Solution [39, 1295, 116, 2232, 1798, 247, [2322]. silent [1181, 1892]. Sillke [1104]. 2264, 796, 2158, 1861, 1093]. solutions Silver [1699]. similar [895, 1522]. [73, 949, 2000, 729, 2281, 88, 1615, 2276, 1962]. Similarity [2162, 887, 881, 1908]. Simple solvable [248, 616]. solved [1189]. Solving [711, 1060, 1498, 16, 2071, 1269, 2240, 2277, [1737, 2232, 1258, 1091, 1562, 1716, 718, 179, 2370, 1967, 1655, 1702, 2104, 2018, 64, 708, 610, 794, 420]. Some 498, 1085, 2373, 494]. Simpler [2251, 860, 2398, 1930, 162, 96, 291, 2253, [1660, 1232, 2201]. simplicial [157, 712]. 2198, 2155, 65, 195, 1699, 501, 1366, 617, simplicity [920]. simplification [2252]. 1911, 1085, 1114, 455, 1465, 1030, 2121]. Simplified [1159, 987]. simulating [764]. Sørensen [1610]. sort [952, 2130]. Simulation [2344]. Simulation-based sortedness [1397]. Sorting [2344]. Simultaneous [953, 1033, 2349]. [1447, 1989, 1583, 462, 529, 350, 1140]. Simultaneously [950]. Single sound [1767]. Soundness [671]. source [207, 237, 1903, 691, 1235, 61, 1820, 1290, [1235, 1236, 2086, 2027]. 960, 124, 117, 2158]. single-crossing [117]. source-destination [2027]. sources single-hop [691]. Single-machine [2317, 1880, 1905]. Souto [2024]. Space [207, 237, 124, 2158]. single-source [1235]. [693, 653, 998, 1438, 2238, 1899, 380, 817, single-swap [1903]. singleton [2371]. 2227, 1618, 954, 1571, 1882, 2232, 19, 221, singleton-based [2371]. sink 2018, 1798, 1529, 1287, 64, 1063, 1983, 2378, [288, 514, 2086]. sinks [548]. SINR 1353]. Space-efficient [573, 656]. SINR-capacity [573]. Site [693, 998, 2238, 1899, 380, 1063]. [2380]. Site-directed [2380]. six [270, 2026]. Space-time [1438]. spaced [1424]. spaces size [1757, 1922, 1635, 1450, 1885, 730]. spanner [1608, 954, 174, 1256, 1026, 619, 896, 724, [2333, 1832]. spanners [1479, 212]. 1601, 1616, 1137, 765, 1856, 2270, 11, 588]. spanning [1656, 2198, 66, 1967, 1756, 1805, size-constrained [619]. sized [1365, 631]. 528, 630, 855, 1716, 1520, 165, 1008, 2176, sizes [886, 1006, 27, 1318, 2412]. skeleton 2027, 798, 1485, 1209, 1569, 620, 2069]. [84]. ski [245]. Skolem [1472]. Sparse Skolemization [2004]. skyline [2222]. [1167, 775, 1421, 2030, 341, 2016, 1410, 2019]. slack [2253]. sleep [434, 355]. slender sparsity [2031]. spatial [1806, 922]. [1378]. slenderness [2110]. slicing [1052]. Special [1879, 651, 879, 626, 2206, 1588, sliding [444]. slime [2050]. slopes [1578]. 2261, 505, 1897, 2216, 2377, 1863, 1309, 1331, SLP [1066]. Small 242, 1727, 1526, 1217, 15, 1416, 2369, 2225, [1444, 764, 992, 1352, 1026, 1315, 2300, 2250, 2292, 285, 1012, 3, 68, 732, 1705, 1043]. 1159, 2021, 100, 2336, 907]. small-width Specializations [66]. specialized [523]. [2300]. smaller [45, 1789, 1033, 2201]. specifications [367, 332, 1776]. specified smallest [708, 2270]. smart [1951, 634]. [1113]. Specker [2411]. spectral smartphones [1414]. Smoothed [635]. [2175, 1781, 1080]. spectrum [315]. SMT [1798]. snake [1850]. snap [1359, 793]. Specular [1332]. speed 35

[812, 1269, 1398, 434, 355]. speed-scaling stores [2379]. story [322]. Stoughton [812]. speeds [1360]. sphere [778, 2082]. [1341]. straight [2230]. straight-line [2230]. spherical [503]. spiders [2294]. spikes strand [2190, 833]. strands [1223]. [1648]. Spiking Strategies [574, 1729, 771, 1430, 488, 2184]. [1648, 767, 1315, 100, 1460, 772, 2119]. Strategy [1252, 961, 498, 1784, 1700, 2186]. Spiral [268]. splay [2078]. splicing stream [826, 259, 1602, 23]. streamed [1107, 1649]. split [2154, 862, 1940, 239, 518, [2388]. streaming [1469, 1, 984]. streams 464, 977, 1369, 1720, 60]. Split-Star [60]. [318, 5, 1329, 1328, 193, 602, 466]. strength split-state [1940]. splitting [2306, 251]. [771, 939, 2412]. stretch sponsored [1821]. Sprague [2391, 1699]. [653, 1493, 314, 165]. stretching [469]. Spread [269]. spreading [1876, 1968]. Strict [1225, 318]. strictly [155]. String Sprouts [936]. Spy [1655]. Spy-game [1417, 435, 2263, 1436, 1684, 1023, 958, 1663, [1655]. squad [2283]. Square 1539, 1540, 1543, 2112, 1546, 894, 230, 2323, [454, 1607, 1428, 1314, 547, 1333, 67, 2023, 2084, 1271, 719, 2199]. Strings [1534, 1416, 1800, 458, 1350, 24, 1061]. Square-free 1061, 1535, 2280, 1069, 1062, 31, 167, 437, [454, 67, 2023, 458, 1350]. squarefree [2398]. 1420, 1530, 1545, 335, 1182, 1583, 63, 895]. squares [291, 1681, 394, 1009, 982, 464, 977, Strip [652, 1241, 2201, 1152, 2229]. Strong 1087, 143, 2013, 2415]. stability [289, 59]. [696, 657, 861, 1552, 1770, 1566, 789, 1672, stabilization [1359, 793, 1267, 111, 1741]. 135, 84, 1509, 2289, 60, 1015]. strong-factor stabilizing [1531, 2039, 2156, 797, 1181, [135]. Strongly 1892, 359, 1893, 196, 697, 325]. Stable [1192, 2394, 1691, 353, 1022, 1619]. [1016, 2075, 1639, 1227, 2185, 1213, 1204]. Structural [576, 1797, 2157, 651, 242]. Stack [2243, 1051, 1751]. Stackelberg Structure [1009, 2358, 853, 2307, 2320, [66, 2399]. stage 1553, 2258, 1632, 491, 2018, 1999, 550, 1808, [755, 1354, 1090, 1715, 2202, 2085]. staged 317, 1891, 612, 2137]. [1218]. stages [2176]. Standard Structure-preserving [2307]. Structured [457, 560, 479, 850, 1106, 2344, 1511, 901, [1521, 1300]. structures 1557, 388, 667, 1912, 2049]. Star [1879, 1750, 339, 523, 240, 221, 560, 970, [2069, 199, 1021, 696, 2394, 952, 1236, 1484, 1422, 674, 2026, 324, 1240, 1554, 2410, 1885, 1238, 2289, 1924, 1412, 1133, 60]. 1774, 1956, 85, 2354, 1265, 1038, 2003]. star-height [1021]. stars Studies [331]. Study [1828, 2406, 910, 535]. State [2096, 2403, [2075, 600, 491, 402, 78, 1040, 2078, 1093]. 642, 1316, 2379, 2381, 1284, 2378, 727, 186, Sturmian 788, 1013, 1940, 1742, 994, 2409, 648, 434, [1793, 457, 858, 1791, 331, 1557, 217]. sub 355, 2213, 1867, 1277, 1113, 649, 1442, 1176]. [631, 2378]. sub-hypergraphs [631]. state-dependent [1867]. states [1445, 416]. sub-linear [2378]. subclass [1127]. static [282, 1404, 2056]. statistic [1087]. subclasses [439, 2212, 175, 813]. subcubic statistical [427, 986]. statistics [2220]. [1578]. subdirectly [1498]. subdivided Steady [1445]. steganography [1379]. [1828]. subdivision [42, 346]. Steiner [2071, 1031]. step [932]. steps Subexponential [511, 539]. [1257]. stepwise [1807, 48]. Stern [217]. subexponential-time [539]. stick [2348]. Stochastic [1653, 1916, 279, subexponentials [1386]. Subgraph 1373, 2052, 2107, 1731, 1784, 56, 1252]. [40, 1411, 619, 501, 362]. subgraphs storage [1088, 400, 2405]. store [1819]. [758, 517, 1248]. Subgroup [2319]. 36

Sublinear [20, 473]. sublinear-time [473]. Synchronization [2211, 1357]. Submodular [1787, 1138, 819]. synchronized [1029]. Synchronizing submodularity [2203]. subnetworks [233]. [690, 1171, 1514, 1022]. synchronous subsequence [1531, 822]. Syntactic [2410, 2210]. [1537, 2365, 2197, 2285, 1522, 1353]. Subset Synthesis [1274, 2295, 2030, 2193, 173, 2329]. [1563, 376, 1203, 1731, 1840, 1867]. Subset-Cover [1274]. subshifts Synthesising [1729]. synthetic [685]. [1151, 2111]. substantially [501]. System [279, 1286, 2287, 1886, 1200, 2284, substitution [1341]. substring 46, 1688, 1186, 1818, 489, 2304, 637]. [891, 1364, 64, 1067, 890, 1891]. Systems [426, 2002, 641, 1286, 1310, 1444, substring-substring [1891]. substrings 418, 767, 281, 2149, 414, 768, 1445, 563, 769, [1438, 1353]. substructure [2358, 853]. 1744, 1054, 1295, 1734, 753, 1010, 1972, 1797, subsumption [2282]. subsystem [1211]. 2094, 1869, 491, 1679, 1737, 280, 1495, 1315, subtraction [226, 1131, 808]. subtree 1669, 1450, 1728, 561, 422, 1317, 430, 1318, [310, 1427]. subtrees [209]. subtyping 1162, 1451, 1651, 1806, 831, 2191, 1961, 146, [1636]. Subword [2268, 1021]. subwords 1453, 1258, 2220, 1091, 1998, 336, 1957, 1454, [648]. successive [160]. Successor [589]. 2242, 1455, 2323, 742, 1456, 2192, 1807, 1838, Succinct [364, 44, 2137, 1060, 1433, 1729]. 1842, 1532, 928, 100, 1386, 922, 1220, 192, Succinctness [1122]. Sufficient 766, 1231, 1649, 1460, 153, 796, 375, 932, [1869, 565, 96]. suffix 413, 1325, 378, 103, 923, 764, 1931, 169, [1314, 896, 884, 1419, 350, 1271, 380]. 1186, 2060, 1461, 1738, 772, 673, 1306, 1648, suffixes [891]. suitable [1109]. sum 2119, 616, 926, 1647, 1499]. systems [2030, 871, 590, 1072, 596, 917, 1148, 2329]. [2061, 1962, 2377]. summands [1519]. Sums [1519, 1149, 1699, 336]. sun [464]. Super table [1062, 1063]. tableaux [481]. tables [2276, 1569]. superbubble [614]. [1120]. tailor [2188]. take [580, 1443]. tame supercomputing [17]. supergrid [472]. [962]. tape [478]. tardiness [1820]. tardy superwords [648]. supply [1084]. [229]. target [2317, 2112, 1697]. Tarski supported [1498]. supporting [2349]. [2417, 1698, 1523]. task [1505]. tasks suprema [996]. surely [13]. surfaces [80, 320, 2231, 1596]. Taxi [1824]. [1761]. surveillance [252]. Survey Taxi-sharing [1824]. TCS [1277, 1119, 1797, 1540, 643, 2409, 1118]. [323, 1309, 1331, 322, 1217, 1293]. teacher survivable [1236]. survival [1185]. [1706]. teachers [1016]. teaching [1595]. survivor [2293]. Survivors [1044]. SVM Team [1630, 1600]. technique [2353]. swap [1903]. Swapping [271, 1676]. [1642, 643, 2016, 819]. techniques swaps [63]. Swarm [2045, 13, 420]. Sweet [1289, 469]. technology [1277]. [2178]. switch [27, 1585, 1614]. switches Temperature [1150]. tempering [419]. [298, 1079, 1246]. switching template [1840]. template-based [1840]. [281, 2109, 1867]. symbol [1179]. Symbolic temporal [2097, 1203, 2094, 1500, 1545, 101]. symbols [279, 1974, 2370, 81, 629, 2219, 2375, 374, 847, [2146, 1313, 1921]. Symmetric 922, 932, 2060, 1374, 2373, 637, 2061, 2369]. [507, 1479, 225, 804, 1752]. symmetries Ten [1443]. tensor [519]. Term [2406]. synapses [1648]. synchronised [821, 178, 2105, 1700]. Term-generic [178]. [987]. synchronizability [1054]. Terminal [2070, 1408]. 37

Terminal-pairability [2070]. Termination 1669, 1989, 1538, 269, 1149, 900, 444, 2300, [661, 135, 1183, 1298]. terms 687, 2018, 259, 827, 376, 441, 1438, 1860, 246, [661, 1562, 233]. ternary 1729, 911, 2375, 1953, 2384, 949, 224, 1612, [2139, 1185, 1994, 585]. terrain [1153]. 1529, 961, 815, 64, 1755, 704, 1659, 1914, terrains [387, 1584]. Test 1203, 951, 539, 1365, 740, 2335, 461, 464, 115, [70, 1018, 204, 1159, 2304, 1912]. testability 237, 1716, 330, 1517, 57, 1816, 494, 1633, [1109]. testable [1322, 1559]. Testing 932, 2013, 2415, 714, 969, 293, 2352, 1468]. [1812, 566, 2129, 334, 1651, 200, 1660, 493, time-constrained [367]. time-dependent 461, 1093, 429]. tetrominoes [1574]. text [1633]. time-optimal [64]. time-sensitive [1542, 1066, 1958]. theatregoer [272]. their [666]. Time-space [1571, 2227]. [722, 2267, 132, 1247, 258, 1021, 1760, 1106, time-varying [312, 969]. Timed 402, 1540, 547, 1556, 2133, 1244, 1791, 1140, [788, 1183, 1100, 71, 1162, 1203, 1731, 103]. 2374]. Theor [2418, 2417, 2415, 2024]. times [755, 2350, 520, 1633, 141]. tissue Theorem [1310, 1454, 923]. tissue-like [923]. TNFS [1345, 789, 898, 1708, 154, 777, 359, 1839, 413]. [2407]. tokens [655, 444, 271, 1676]. theorems [442, 2004, 1259, 233]. Theoret tolerable [2342]. tolerance [1023, 474, 1329, 1354, 984, 68, 2416, 1496, [1484, 1948, 1347, 2320, 1553, 227, 1928, 1004, 1486]. theoretic 2241, 2170, 2130, 618]. tolerant [257, 1373, 453, 336, 1710, 922, 2118]. [1479, 1531, 212, 93, 1672, 27, 1361, 300, Theoretical [1416, 1802]. theoretically 1509, 319, 2354, 807, 1401]. Tomographic [2308]. theories [80, 1227, 1747, 263, 1637]. [2108]. tomography [780]. toolbox [1232]. Theory tools [1223, 2318]. top [701]. top-down [2292, 1043, 660, 309, 732, 1309, 2414, 2371, [701]. topic [3, 68]. topics [1743]. 2188, 1447, 2147, 2099, 1561, 1520, 155, 1838, Topological 1105, 101, 2065, 489, 340, 1705, 285, 685]. [735, 838, 825, 503, 1297, 1794, 1997]. Therapy [526]. there [2033]. topologies [1655, 1287, 1114]. Topology thermodynamic [2185]. thesis [987]. [749, 1558]. toroidal [2293]. torus theta [703]. theta-graphs [703]. thin [390, 861, 1349, 1262]. Total [2349, 781]. think [2106]. Three [1431, 1468, 2313, 701, 1820, 1493, 1520, 596, [394, 961, 100, 814, 2073, 226, 592, 2176, 389]. 2390, 917, 1148]. tournaments [2184]. three-element [226]. Three-pile [961]. Tower [1849, 1473, 620]. Trace three-vertex [592]. Threes [1847]. [1730, 876, 1315]. traces [70, 1109]. Track threshold [1526]. tracking [1775, 546]. Tractability [1611, 250, 624, 1083, 947, 818, 85, 588]. [176, 1709, 1582, 2362, 1023, 958, 2103, 1930, thresholds [1194, 1231]. throttling [2314]. 173, 1832, 1122]. tractable Throughput [812, 1079, 1688]. Thue [1974, 1492, 131, 1242]. trade [2141, 356, 231]. ties [1639]. Tight [2227, 1571, 1438, 314, 650]. trade-off [851, 613, 777, 872, 2125, 1902, 703, 225, 404]. [2227]. trade-offs [1571, 1438, 314, 650]. Tighter [462, 1072, 2353, 1955]. Tightly tradeoff [74]. Trading [320, 516]. traffic [2329, 2322, 2072]. tile [1191, 1459]. Tiling [1604, 445, 1810]. trails [2395]. Trainyard [24, 1574]. tilings [1188, 1452, 415]. TIME [1851]. transactional [1361, 1362]. [2369, 1571, 1193, 1374, 666, 2189, 367, 1183, Transducers [1311, 1103, 701, 2115]. 1916, 2227, 1872, 1062, 1734, 606, 627, 74, Transducing [2213]. transductions [1703]. 1150, 614, 2370, 1967, 312, 473, 381, 238, 755, transfer [1575, 1523, 840]. transform 38

[1540, 1059]. transformation [366]. 540, 1132, 1168, 851, 4, 474, 1006, 1198, 167, transformations [792]. transformers 1103, 1528, 2136, 2355, 1354, 1090, 1905, [1221]. transforming [1637]. transition 1007, 1660, 567, 229, 2229, 2311, 245, 1514, [1286, 1869, 1669]. transitions [841]. 2132, 1008, 2176, 650, 2013, 2415, 1242, 534, transitive [1501, 370]. translation [2258]. 2200, 37, 2202, 2085, 1995, 1584, 1468]. translations [182]. translocations Two-agent [1475, 2352]. two-coloring [167, 529]. transmissions [2349]. [1242]. two-compartment [567]. transmitting [1643]. transport [567]. Two-dimensional [1096, 1132, 650]. Transposing [1772]. transpositions two-level [37]. Two-machine [2357, 229]. [462, 1989, 1140]. transversals two-option [245]. two-page [1660]. [1492, 402, 1996]. trapdoor [345]. traveler Two-process [1357]. Two-sided [332, 534]. [1697]. Traveling [847, 1653, 29]. Two-stage [755, 1354, 1090, 2202, 2085]. treatment [1778, 567]. Tree two-stages [2176]. two-tree [1995]. [938, 795, 1856, 942, 1794, 548, 66, 1967, 966, two-way [1103]. type 1756, 2331, 1108, 701, 1674, 2250, 1541, 127, [1167, 1483, 509, 2099, 1561, 142, 1689]. 2079, 1805, 2214, 324, 951, 884, 1943, 1716, Typed [2151]. types [1749, 1205, 814, 1772]. 941, 1434, 191, 943, 2176, 669, 2027, 798, typography [273]. 1485, 371, 1700, 1995, 535, 540]. Tree-automatic [795]. tree-based [1434]. UDGs [697]. ultimate [292, 616]. tree-searching [2176]. trees Ultrafilters [645]. umpire [29]. [304, 2038, 213, 2029, 313, 1399, 2154, 707, Unambiguous [1179, 1283, 2381, 92, 1619]. 889, 712, 1527, 55, 1060, 2299, 654, 444, 2355, Unary [2159, 1795, 1399, 1495, 649]. 1429, 2036, 176, 759, 1433, 370, 1194, 538, unary-binary [1399]. Unavoidable [1107]. 1490, 224, 1028, 528, 552, 957, 1694, 1127, unaware [574]. unbalanced [638]. 1943, 1084, 1520, 1031, 888, 2270, 165, 1008, Unbiasedness [2187]. unbounded 2176, 2312, 2078, 1489, 747, 44, 2137, 380, [311, 516, 794, 714]. uncertain 1907, 1209, 209, 1080, 620, 2121, 792, 585]. [2129, 90, 587, 470]. uncertainty Treewidth [1694, 2029, 121, 316, 744]. [2370, 679, 2373]. unconstrained [1134]. trellis [1378]. triadic [1770]. Triangle Uncut [1858]. Undecidability [2217, 1207, 1610, 1074, 1622, 2392]. [1285, 1636, 1384]. undecidable triangle-free [2392]. triangles [2113, 2364]. undependable [17]. [5, 1329, 1328, 2033, 1931, 1148]. understanding [1257]. undirected triangulations [2302]. trie [1542]. tries [163, 437, 1850, 59]. unexpected [896, 635]. trigger [2189]. Triggering [353]. [1751, 960]. unfolding [1983]. Trimming [187, 1579]. trios [2393]. trivial unidirectional [867, 710]. unification [2211]. tropical [1256]. true [322]. [1143]. unified [382, 977, 1637]. Uniform truncated [380]. Truthful [145, 51, 1041]. [479, 1230, 320, 395, 908, 1006, 966, 72, 690, TSP [2032, 1074]. Turing 287, 119, 1769, 111, 1861, 206, 1468]. [478, 2012, 441, 412, 2127]. turn [1208]. uniformization [1916]. turns [190]. turnstile [318]. Tutte [423]. uniformization-based [1916]. uniformly Tversky [1610]. twin [872]. twisted [1114]. union [466]. Unique [1515, 695, 2358, 1413]. Two [2000, 668, 672, 1438, 658, 1364, 64]. [1357, 1096, 332, 2050, 883, 2325, 755, 1747, uniqueness [1975]. unit 2002, 1475, 401, 463, 1064, 2357, 1086, 2352, [1241, 145, 447, 134]. unit-demand [145]. 39 univariate [1301]. Universal Verifying [1500, 441, 1979, 1981]. version [1222, 1570, 1958, 2012, 1789, 286, 100, 2067]. [1044, 2278, 461, 2150, 389]. versus universality [103]. unknown [1609, 1018, 239, 179, 564]. Vertex [655, 1528, 253, 2112, 1414]. unordered [1817, 2321, 1137, 2063, 600, 1507, 948, 515, [870]. Unpaired [713]. unpredictable 83, 2250, 1691, 1138, 2125, 592, 300, 471, [1909]. unranking [2249]. Unraveling 130, 1764, 2028, 698, 534, 2164, 973, 134, [920]. unrelated [125, 959, 704]. unreliable 1092, 819, 1876]. Vertex-Congest [1876]. [522]. unsharp [412]. unshuffling [1678]. Vertex-disjoint [2321, 130]. unsigned [529, 2047]. Unsupervised [845]. vertex-fault-tolerant [300]. until [663]. Unveiling [181]. unweighted vertex-weighted [534]. Vertical [89]. [163, 757]. Unwinding [280]. updatable vertices [1312, 2321, 2311, 807]. via [1193]. update [990, 1384]. updates [1530]. [418, 1399, 1922, 1295, 523, 1635, 948, 2365, updating [538]. UPGMA [1628]. 2052, 2105, 771, 2341, 343, 2408, 841, 832, Upgrading [1485]. Upper [1034, 2412, 2343, 1719, 1423, 2160, 1917, 218, 692, 234, 1599, 462, 869, 1045, 1616, 2042, 941, 1890]. 2228, 37, 1861, 2304]. view Upward [132]. urban [1810]. useful [1478]. [510, 2076, 632, 369, 1855, 922, 2118]. views user [547, 1344, 2072]. user-defined [1344]. [225, 1053]. violations [633]. virtual Using [942, 63, 1841, 279, 562, 1737, 1882, [1713, 253, 1409, 545, 742]. viruses [770]. 2232, 429, 1492, 1450, 763, 1341, 2331, 502, Visibility 1500, 953, 259, 2108, 1052, 204, 2309, 428, [2129, 2228, 1508, 2173, 2227, 527, 953, 162]. 2341, 1731, 1511, 1246, 894, 1918, 1459, 423, visible [1637]. Visibly [1843, 187, 1051]. 2412, 2048, 568, 1035, 420, 819]. utilities Visual [85, 595]. Vitányi [2024]. Volume [1474]. Utilizing [1880]. UTP [1917]. [1152, 1798]. Volumetric [526]. Voronoi [41, 2277]. Vortex [2045]. vote [522]. voter Vaccinate [2036]. valid [2074]. valuation [305]. votes [2168]. voting [706, 1255, 1666]. [73, 371]. valuations [1313, 852]. value VPDAs [1836]. vulnerability [1393]. [506, 823, 1602, 1033, 88]. valued [1623, 481, 2004]. values [448, 1544, 1072]. wait [1327]. wait-free [1327]. wake Vandermonde [2316]. variability [1269]. [570, 691]. wake-up [691]. WALCOM Variable [2225]. Walking [577]. Walks [1304, 164, 27, 229, 493, 2412, 1752]. [1452, 211, 1418, 218, 1431, 1971]. Wallace Variables [2002, 1210, 1323, 754, 926]. [2047]. Watson [1495, 2159, 1453]. variance [325]. variant [1008]. variants Watson-Crick [1495]. wavelet [888]. way [1850, 756, 2226, 1324]. variation [1431]. [2383, 743, 345, 516, 1103, 1827, 1321, 118]. variational [1997]. Variations Weak [1751, 161, 2178]. varieties [1297]. various [1961, 1923, 74, 1685, 509, 421, 668, 1796]. [1411, 219, 1485]. varying [312, 969]. VC weakest [486]. weakly [1239, 270, 724, 287]. [1987, 1596, 1783]. vector web [1263, 1624, 1888]. Weierstrass [46]. [1623, 327, 2322, 779, 1939]. vectors weight [885, 2161]. Vegas [743]. vehicle [553]. [2230, 1756, 1909, 2367, 2059, 916, 2399, 134]. vehicles [1857, 2223]. verifiable [1686]. Weighted Verification [1677, 2029, 1803, 2154, 2104, 2165, 857, 813, [418, 666, 767, 826, 1651, 1159, 131, 832]. 767, 1594, 1062, 1428, 1312, 2313, 269, 2209, verifier [1683]. verifier-local [1683]. 578, 370, 224, 2246, 2335, 1766, 350, 1583, REFERENCES 40

1437, 2395, 1280, 2027, 747, 534, 757, 2009]. matrix [1021]. zero-visibility [527]. Zhang weights [992, 1235, 540]. Well [969]. Zimin [133]. Ziv [1571, 2235]. zom- [1632, 477, 1829]. well-covered [1829]. bies [2293, 1044]. zoom [560]. Well-ordering [1632]. Wheeler [1540, 1422, 2162]. whether [2402]. Which [1974, 2254, 248, 307]. white [399, 595]. who References [1247]. whole [1425]. Wide [1888]. width Feigenblat:2010:FIP [1656, 304, 1049, 1757, 1607, 2155, 2300, 700, 2363, 2229, 1478, 47, 1136, 1158, 698]. [1] Guy Feigenblat, Ofra Itzhaki, and Ely widths [250]. wild [1281]. wildcard [864]. Porat. The frequent items problem, un- Wildcards [435]. Window der polynomial decay, in the streaming [2343, 246, 124, 1374]. windows [1860]. model. Theoretical Computer Science, winner [706]. winning [961]. wirelength 411(34–36):3048–3054, July 17, 2010. [390]. wireless [164, 1381, 545, 546, 1558, CODEN TCSCDI. ISSN 0304-3975 314, 1434, 656, 1401, 2055]. within [1241]. (print), 1879-2294 (electronic). See cor- within-strip [1241]. without rigendum [984]. [2030, 654, 999, 2122, 603, 1240, 1137, 2021, 201, 2211, 868, 1242, 36, 58, 1148, 1245, 1762]. Colussi:2011:CCC Witness [1298, 1306]. witnesses [2043]. [2] Livio Colussi. The convergence classes WK [58, 1569]. WK-recursive [58, 1569]. of Collatz function. Theoretical Wojciech [2261]. WoLLIC [476]. Word Computer Science, 412(39):5409–5419, [1864, 622, 186, 1463, 436, 193, 1788, 2327, September 9, 2011. CODEN TC- 356, 982, 2265, 2264]. Words SCDI. ISSN 0304-3975 (print), 1879- [450, 1331, 2267, 2142, 2272, 1803, 291, 1098, 2294 (electronic). See comment [725]. 2177, 972, 860, 364, 395, 908, 2288, 2254, 1130, 1793, 457, 1103, 1747, 1792, 1420, 621, Hosoda:2012:AHM 2398, 1106, 451, 2102, 1077, 1556, 89, 858, 1333, 2271, 2139, 645, 1570, 1109, 67, 454, [3] Jun Hosoda, Juraj Hromkovic, Taisuke 2023, 2249, 1335, 357, 2235, 1791, 1547, 1696, Izumi, Hirotaka Ono, Monika Steinová, 2117, 1625, 331, 456, 1064, 1557, 458, 378, and Koichi Wada. On the ap- 228, 94, 1350, 39, 1403, 566, 217, 792]. work proximability and hardness of min- [1047]. workers [17]. Working [725, 1647]. imum topic connected overlay and Workshops [2225, 505]. world its special instances. Theoreti- [270, 1775, 1888]. Worst cal Computer Science, 429(1):144– [408, 306, 247, 1488, 102]. Worst- [408]. 154, April 20, 2012. CODEN TC- worst-case [247, 102]. WSTS [876]. SCDI. ISSN 0304-3975 (print), Wythoff [467]. Wythoff-like [467]. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ XML [193]. XPath [193]. xxx [621]. article/pii/S0304397511009996. See corrigendum [68]. Yung [1382]. Calamoneri:2014:PCG

Zero [1939, 1021, 527, 1724, 382, 1303, 1146, [4] T. Calamoneri and R. Petreschi. On 2200]. Zero-knowledge [1939]. zero- pairwise compatibility graphs hav- REFERENCES 41

ing Dilworth number two. The- Anonymous:2015:EBb oretical Computer Science, 524(??): 34–40, March 6, 2014. CODEN [8] Anonymous. Editorial Board. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 561 (part B) 1879-2294 (electronic). URL http: (??):iii–ix, January 4, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397513009274. See 1879-2294 (electronic). URL http: corrigendum [474]. //www.sciencedirect.com/science/ article/pii/S0304397514009189. Cormode:2014:SLC Friedrich:2015:GEC

[5] Graham Cormode and Hossein Jowhari. [9] Tobias Friedrich, Jun He, Thomas A second look at counting trian- Jansen, and Alberto Moraglio. Genetic gles in graph streams. Theoreti- and evolutionary computation. The- cal Computer Science, 552(??):44– oretical Computer Science, 561 (part 51, October 2, 2014. CODEN A)(??):1–2, January 4, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514005945. See article/pii/S0304397514009116. corrigendum [1329]. Doerr:2015:OLF Pai:2014:ICH [10] Benjamin Doerr and Marvin K¨unnemann. [6] Kung-Jui Pai, Jou-Ming Chang, Jinn- Optimizing linear functions with the Shyong Yang, and Ro-Yu Wu. Inci- (1 + λ) evolutionary algorithm — dif- dence coloring on hypercubes. The- ferent asymptotic runtimes for dif- oretical Computer Science, 557(??): ferent instances. Theoretical Com- 59–65, November 6, 2014. CODEN puter Science, 561 (part A)(??):3– TCSCDI. ISSN 0304-3975 (print), 23, January 4, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397514006380. See //www.sciencedirect.com/science/ corrigendum [1004]. article/pii/S0304397514002060. Nguyen:2015:PSM Anonymous:2015:EBa [11] Anh Quang Nguyen, Andrew M. Sut- [7] Anonymous. Editorial Board. Theo- ton, and Frank Neumann. Popu- retical Computer Science, 561 (part A) lation size matters: Rigorous run- (??):iii–ix, January 4, 2015. CODEN time results for maximizing the hy- TCSCDI. ISSN 0304-3975 (print), pervolume indicator. Theoretical 1879-2294 (electronic). URL http: Computer Science, 561 (part A)(??): //www.sciencedirect.com/science/ 24–36, January 4, 2015. CODEN article/pii/S0304397514009049. TCSCDI. ISSN 0304-3975 (print), REFERENCES 42

1879-2294 (electronic). URL http: cal Computer Science, 561 (part B) //www.sciencedirect.com/science/ (??):87, January 4, 2015. CODEN article/pii/S0304397514004599. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Oliveto:2015:ADM //www.sciencedirect.com/science/ [12] Pietro S. Oliveto and Christine Zarges. article/pii/S0304397514009256. Analysis of diversity mechanisms for Afek:2015:SCA optimisation in dynamic environments with low frequencies of change. Theo- [16] Yehuda Afek and Eli Gafni. A sim- retical Computer Science, 561 (part A) ple characterization of asynchronous (??):37–56, January 4, 2015. CODEN computations. Theoretical Com- TCSCDI. ISSN 0304-3975 (print), puter Science, 561 (part B)(??):88– 1879-2294 (electronic). URL http: 95, January 4, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397514008202. 1879-2294 (electronic). URL http: Schmitt:2015:PSO //www.sciencedirect.com/science/ article/pii/S0304397514005659. [13] Manuel Schmitt and Rolf Wanka. Particle swarm optimization almost Davtyan:2015:DUW surely ﬁnds local optima. Theoreti- cal Computer Science, 561 (part A) [17] Seda Davtyan, Kishori M. Konwar, (??):57–72, January 4, 2015. CODEN Alexander Russell, and Alexander A. TCSCDI. ISSN 0304-3975 (print), Shvartsman. Dealing with undepend- 1879-2294 (electronic). URL http: able workers in decentralized net- //www.sciencedirect.com/science/ work supercomputing. Theoretical article/pii/S0304397514004150. Computer Science, 561 (part B)(??): 96–112, January 4, 2015. CODEN Lissovoi:2015:RAA TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL [14] Andrei Lissovoi and Carsten Witt. http: Runtime analysis of ant colony op- //www.sciencedirect.com/science/ . timization on dynamic shortest path article/pii/S0304397514007774 problems. Theoretical Computer Sarma:2015:FDP Science, 561 (part A)(??):73–85, January 4, 2015. CODEN TC- [18] Atish Das Sarma, Anisur Rahaman SCDI. ISSN 0304-3975 (print), Molla, Gopal Pandurangan, and Eli 1879-2294 (electronic). URL http: Upfal. Fast distributed PageR- //www.sciencedirect.com/science/ ank computation. Theoretical Com- article/pii/S0304397514004952. puter Science, 561 (part B)(??):113– Raynal:2015:SID 121, January 4, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [15] Michel Raynal and Franck Petit. 1879-2294 (electronic). URL http: Special issue on distributed com- //www.sciencedirect.com/science/ puting and networking. Theoreti- article/pii/S0304397514002709. REFERENCES 43

Delporte-Gallet:2015:LSB Giannakopoulos:2015:CAM

[19] Carole Delporte-Gallet, Hugues Fau- [23] Yiannis Giannakopoulos and Elias connier, Eli Gafni, and Sergio Rajs- Koutsoupias. Competitive analysis of baum. Linear space bootstrap com- maintaining frequent items of a stream. munication schemes. Theoretical Com- Theoretical Computer Science, 562(??): puter Science, 561 (part B)(??):122– 23–32, January 11, 2015. CODEN 133, January 4, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514006768. article/pii/S0304397514007750. Amir:2015:PST Kutten:2015:SBR [24] Amihood Amir, Alberto Apostolico, [20] Shay Kutten, Gopal Pandurangan, Gad M. Landau, Ely Porat, and David Peleg, Peter Robinson, and Oren Sar Shalom. A PTAS for Amitabh Trehan. Sublinear bounds for the Square Tiling Problem. The- randomized leader election. Theoretical oretical Computer Science, 562(??): Computer Science, 561 (part B)(??): 33–45, January 11, 2015. CODEN 134–143, January 4, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751400677X. article/pii/S0304397514001029. Fu:2015:EHD Anonymous:2015:EBc [21] Anonymous. Editorial Board. The- [25] Hao Fu and Guo-Niu Han. On t- oretical Computer Science, 562(??): extensions of the Hankel determinants iii–ix, January 11, 2015. CODEN of certain automatic sequences. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 562(??): 1879-2294 (electronic). URL http: 46–56, January 11, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751400930X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Liu:2015:IDS article/pii/S0304397514007105. [22] Ching-Hao Liu, Sheung-Hung Poon, Wang:2015:OFE and Jin-Yong Lin. Independent dominating set problem revisited. The- [26] Yang Wang, Man Ho Au, and Willy oretical Computer Science, 562(??): Susilo. Optimistic fair exchange in 1–22, January 11, 2015. CODEN the enhanced chosen-key model. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 562(??): 1879-2294 (electronic). URL http: 57–74, January 11, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397514006537. 1879-2294 (electronic). URL http: REFERENCES 44

//www.sciencedirect.com/science/ ing of bilinear pairings. Theoreti- article/pii/S0304397514007117. cal Computer Science, 562(??):112– 121, January 11, 2015. CODEN Delmas:2015:DFT TCSCDI. ISSN 0304-3975 (print), [27] O. Delmas, F. Havet, M. Mon- 1879-2294 (electronic). URL http: tassier, and S. P´erennes. Design //www.sciencedirect.com/science/ of fault-tolerant on-board networks article/pii/S0304397514007282. with variable switch sizes. The- oretical Computer Science, 562(??): Bu:2015:CBS 75–89, January 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [31] Tian-Ming Bu, Chen Yuan, and Peng 1879-2294 (electronic). URL http: Zhang. Computing on binary strings. //www.sciencedirect.com/science/ Theoretical Computer Science, 562(??): article/pii/S0304397514007129. 122–128, January 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Fanelli:2015:RDG 1879-2294 (electronic). URL http: [28] Angelo Fanelli, Dariusz Leniowski, Gi- //www.sciencedirect.com/science/ anpiero Monaco, and Piotr Sankowski. article/pii/S0304397514007294. The ring design game with fair cost allocation. Theoretical Com- Gadouleau:2015:MCN puter Science, 562(??):90–100, Jan- uary 11, 2015. CODEN TC- [32] Maximilien Gadouleau and Søren Riis. SCDI. ISSN 0304-3975 (print), Memoryless computation: New results, 1879-2294 (electronic). URL http: constructions, and extensions. The- //www.sciencedirect.com/science/ oretical Computer Science, 562(??): article/pii/S0304397514007130. 129–145, January 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), deOliveira:2015:CTU 1879-2294 (electronic). URL http: [29] Lucas de Oliveira, Cid C. de Souza, //www.sciencedirect.com/science/ and Tallys Yunes. On the complex- article/pii/S0304397514007300. ity of the traveling umpire problem. Theoretical Computer Science, 562(??): You:2015:OOD 101–111, January 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [33] Lantao You, Jianxi Fan, Yuejuan 1879-2294 (electronic). URL http: Han, and Xiaohua Jia. One-to- //www.sciencedirect.com/science/ one disjoint path covers on alter- article/pii/S0304397514007270. nating group graphs. Theoreti- Chen:2015:EAS cal Computer Science, 562(??):146– 164, January 11, 2015. CODEN [30] Xiaofeng Chen, Willy Susilo, Jin Li, TCSCDI. ISSN 0304-3975 (print), Duncan S. Wong, Jianfeng Ma, Shao- 1879-2294 (electronic). URL http: hua Tang, and Qiang Tang. Eﬃ- //www.sciencedirect.com/science/ cient algorithms for secure outsourc- article/pii/S0304397514007312. REFERENCES 45

Bodlaender:2015:EAK TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [34] Hans L. Bodlaender, Dieter Kratsch, //www.sciencedirect.com/science/ and Sjoerd T. Timmer. Exact article/pii/S030439751400735X. algorithms for Kayles. Theoreti- cal Computer Science, 562(??):165– Gavruskin:2015:DAM 176, January 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [38] Alexander Gavruskin, Bakhadyr Khous- 1879-2294 (electronic). URL http: sainov, Mikhail Kokho, and Jiamou //www.sciencedirect.com/science/ Liu. Dynamic algorithms for mono- article/pii/S0304397514007324. tonic interval scheduling problem. The- Huang:2015:AOF oretical Computer Science, 562(??): 227–242, January 11, 2015. CODEN [35] Qiong Huang, Guomin Yang, Dun- TCSCDI. ISSN 0304-3975 (print), can S. Wong, and Willy Susilo. Am- 1879-2294 (electronic). URL http: biguous optimistic fair exchange: Def- //www.sciencedirect.com/science/ inition and constructions. Theoret- article/pii/S0304397514007361. ical Computer Science, 562(??):177– 193, January 11, 2015. CODEN Wei:2015:SCW TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [39] Jianxin Wei and Heping Zhang. So- //www.sciencedirect.com/science/ lution to a conjecture on words that . article/pii/S0304397514007336 are bad and 2-isometric. Theoret- Tan:2015:CSR ical Computer Science, 562(??):243– 251, January 11, 2015. CODEN [36] Xiao Tan, Qiong Huang, and Dun- TCSCDI. ISSN 0304-3975 (print), can S. Wong. Concurrent signature 1879-2294 (electronic). URL http: without random oracles. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 562(??):194– article/pii/S0304397514007634. 212, January 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Heggernes:2015:ISI 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [40] Pinar Heggernes, Pim van ’t Hof, article/pii/S0304397514007348. Daniel Meister, and Yngve Vil- Wu:2015:PDA langer. Induced Subgraph Isomor- phism on proper interval and bipar- [37] Chenchen Wu, Donglei Du, and tite permutation graphs. Theoreti- Dachuan Xu. Primal-dual approx- cal Computer Science, 562(??):252– imation algorithm for the two-level 269, January 11, 2015. CODEN facility location problem via a dual TCSCDI. ISSN 0304-3975 (print), quasi-greedy approach. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 562(??):213– //www.sciencedirect.com/science/ 226, January 11, 2015. CODEN article/pii/S0304397514007646. REFERENCES 46

Bandyapadhyay:2015:VGG Bermudo:2015:CSK [41] Sayan Bandyapadhyay, Aritra Banik, [45] Sergio Bermudo and Henning Fer- Sandip Das, and Hirak Sarkar. nau. Combinatorics for smaller ker- Voronoi game on graphs. Theoret- nels: the differential of a graph. The- ical Computer Science, 562(??):270– oretical Computer Science, 562(??): 282, January 11, 2015. CODEN 330–345, January 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514007658. article/pii/S0304397514007695. Bang-Jensen:2015:FSD Ruatta:2015:OWI [42] Jørgen Bang-Jensen, Frédéric Havet, [46] Olivier Ruatta, Mark Sciabica, and and A. Karolinna Maia. Finding a Agnes Szanto. Overdetermined subdivision of a digraph. Theoret- Weierstrass iteration and the near- ical Computer Science, 562(??):283– est consistent system. Theoreti- 303, January 11, 2015. CODEN cal Computer Science, 562(??):346– TCSCDI. ISSN 0304-3975 (print), 364, January 11, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751400766X. //www.sciencedirect.com/science/ article/pii/S0304397514007701. DAlessandro:2015:CEBa Kintali:2015:AAD [43] Flavio D’Alessandro and Benedetto In- trigila. On the commutative equiva- [47] Shiva Kintali, Nishad Kothari, and lence of bounded context-free and reg- Akash Kumar. Approximation algo- ular languages: the code case. The- rithms for digraph width parameters. oretical Computer Science, 562(??): Theoretical Computer Science, 562(??): 304–319, January 11, 2015. CODEN 365–376, January 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514007671. article/pii/S0304397514007713. Tsur:2015:SRL Seddik:2015:PGS [44] Dekel Tsur. Succinct representa- [48] Yasmina Seddik, Christophe Gonza- tion of labeled trees. Theoreti- les, and Safia Kedad-Sidhoum. Per- cal Computer Science, 562(??):320– formance guarantees for a schedul- 329, January 11, 2015. CODEN ing problem with common step- TCSCDI. ISSN 0304-3975 (print), wise job payoffs. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 562(??):377–394, Jan- //www.sciencedirect.com/science/ uary 11, 2015. CODEN TC- article/pii/S0304397514007683. SCDI. ISSN 0304-3975 (print), REFERENCES 47

1879-2294 (electronic). URL http: 436–452, January 11, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397514007725. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Han:2015:RAO article/pii/S030439751400783X. [49] Xin Han, Yasushi Kawase, and Kazuhisa Makino. Randomized algo- Bermond:2015:DGP rithms for online knapsack problems. Theoretical Computer Science, 562(??): [53] Jean-Claude Bermond, Bi Li, Nico- 395–405, January 11, 2015. CODEN las Nisse, Herv´e Rivano, and Min- TCSCDI. ISSN 0304-3975 (print), Li Yu. Data gathering and per- 1879-2294 (electronic). URL http: sonalized broadcasting in radio grids //www.sciencedirect.com/science/ with interference. Theoretical Com- article/pii/S0304397514007798. puter Science, 562(??):453–475, Jan- uary 11, 2015. CODEN TC- Oliveira:2015:PEP SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [50] Leonardo I. L. Oliveira, Valmir C. //www.sciencedirect.com/science/ Barbosa, and F´abio Protti. The article/pii/S0304397514008214. predecessor-existence problem for k- reversible processes. Theoretical DAlessandro:2015:CES Computer Science, 562(??):406–418, January 11, 2015. CODEN TC- [54] Flavio D’Alessandro and Benedetto In- SCDI. ISSN 0304-3975 (print), trigila. On the commutative equiva- 1879-2294 (electronic). URL http: lence of semi-linear sets of N k. The- //www.sciencedirect.com/science/ oretical Computer Science, 562(??): article/pii/S0304397514007804. 476–495, January 11, 2015. CODEN Calinescu:2015:BPA TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [51] Gruia Calinescu. Bounding the //www.sciencedirect.com/science/ payment of approximate truthful article/pii/S0304397514008226. mechanisms. Theoretical Com- puter Science, 562(??):419–435, Jan- Chen:2015:PAA uary 11, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), [55] Jianer Chen, Jia-Hao Fan, and Sing- 1879-2294 (electronic). URL http: Hoi Sze. Parameterized and approxi- //www.sciencedirect.com/science/ mation algorithms for maximum agree- article/pii/S0304397514007816. ment forest in multifurcating trees. Gast:2015:IDS Theoretical Computer Science, 562(??): 496–512, January 11, 2015. CODEN [52] Mikael Gast, Mathias Hauptmann, and TCSCDI. ISSN 0304-3975 (print), Marek Karpinski. Inapproximability of 1879-2294 (electronic). URL http: dominating set on power law graphs. //www.sciencedirect.com/science/ Theoretical Computer Science, 562(??): article/pii/S0304397514008238. REFERENCES 48

Levin:2015:BAS 557–564, January 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [56] Asaf Levin and Aleksander Vainer. 1879-2294 (electronic). URL http: The benefit of adaptivity in stochas- //www.sciencedirect.com/science/ tic packing problems with probing. article/pii/S0304397514008299. Theoretical Computer Science, 562(??): 513–523, January 11, 2015. CODEN Lin:2015:CDS TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [60] Limei Lin, Li Xu, and Shuming Zhou. //www.sciencedirect.com/science/ Conditional diagnosability and strong article/pii/S030439751400824X. diagnosability of Split-Star Networks Mertzios:2015:OBT under the PMC model. Theoreti- cal Computer Science, 562(??):565– [57] George B. Mertzios, Mordechai Shalom, 580, January 11, 2015. CODEN Ariella Voloshin, Prudence W. H. TCSCDI. ISSN 0304-3975 (print), Wong, and Shmuel Zaks. Optimiz- 1879-2294 (electronic). URL http: ing busy time on parallel machines. //www.sciencedirect.com/science/ Theoretical Computer Science, 562(??): article/pii/S030439751400838X. 524–541, January 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Fan:2015:ISP 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [61] Jing Fan, Xiwen Lu, and Peihai . article/pii/S0304397514008251 Liu. Integrated scheduling of pro- Wang:2015:HBW duction and delivery on a single machine with availability constraint. The- [58] Yi-Chun Wang and Justie Su-Tzu oretical Computer Science, 562(??): Juan. Hamiltonicity of the ba- 581–589, January 11, 2015. CODEN sic WK-recursive pyramid with and TCSCDI. ISSN 0304-3975 (print), without faulty nodes. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 562(??):542– //www.sciencedirect.com/science/ 556, January 11, 2015. CODEN article/pii/S0304397514008391. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Jing:2015:PA //www.sciencedirect.com/science/ article/pii/S0304397514008263. [62] Maohua Jing, Yixian Yang, Ning Disser:2015:IBP Lu, Wenbo Shi, and Changyong Yu. Postfix automata. Theoreti- [59] Yann Disser, Andreas Emil Feld- cal Computer Science, 562(??):590– mann, Max Klimm, and Matús Mi- 605, January 11, 2015. CODEN halák. Improving the Hk-bound on TCSCDI. ISSN 0304-3975 (print), the price of stability in undirected 1879-2294 (electronic). URL http: Shapley network design games. The- //www.sciencedirect.com/science/ oretical Computer Science, 562(??): article/pii/S0304397514008421. REFERENCES 49

Meister:2015:USD 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [63] Daniel Meister. Using swaps and article/pii/S0304397514008524. deletes to make strings match. The- oretical Computer Science, 562(??): Harju:2015:NSP 606–620, January 11, 2015. CODEN [67] Tero Harju and Mike Müller. A note on TCSCDI. ISSN 0304-3975 (print), short palindromes in square-free words. 1879-2294 (electronic). URL http: Theoretical Computer Science, 562(??): //www.sciencedirect.com/science/ 658–659, January 11, 2015. CODEN article/pii/S0304397514008457. TCSCDI. ISSN 0304-3975 (print), Ileri:2015:SYT 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [64] Atalay Mert Ileri, M. Oguzhan Külekci, article/pii/S0304397514008329. and Bojian Xu. A simple yet time- optimal and linear-space algorithm for Hosoda:2015:CAH shortest unique substring queries. The- [68] Jun Hosoda, Juraj Hromkovic, Taisuke oretical Computer Science, 562(??): Izumi, Hirotaka Ono, Monika Steinová, 621–633, January 11, 2015. CODEN and Koichi Wada. Corrigendum to TCSCDI. ISSN 0304-3975 (print), “On the approximability and hard- 1879-2294 (electronic). URL http: ness of minimum topic connected over- //www.sciencedirect.com/science/ lay and its special instances” [Theo- article/pii/S0304397514008470. ret. Comput. Sci. 429 (2012) 144–154]. Couturier:2015:NMD Theoretical Computer Science, 562(??): 660–661, January 11, 2015. CODEN [65] Jean-Fran¸cois Couturier, Romain Le- TCSCDI. ISSN 0304-3975 (print), tourneur, and Mathieu Liedloff. On 1879-2294 (electronic). URL http: the number of minimal dominating //www.sciencedirect.com/science/ sets on some graph classes. The- article/pii/S0304397514008445. See oretical Computer Science, 562(??): [3]. 634–642, January 11, 2015. CODEN Anonymous:2015:EBd TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [69] Anonymous. Editorial Board. The- //www.sciencedirect.com/science/ oretical Computer Science, 563(??): article/pii/S0304397514008494. iii–ix, January 19, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Bilo:2015:SGS 1879-2294 (electronic). URL http: [66] Davide Bilò, Luciano Gualà, Stefano //www.sciencedirect.com/science/ Leucci, and Guido Proietti. Specializa- article/pii/S0304397514009621. tions and generalizations of the Stack- Cavalcanti:2015:TST elberg minimum spanning tree game. Theoretical Computer Science, 562(??): [70] Ana Cavalcanti and Marie-Claude 643–657, January 11, 2015. CODEN Gaudel. Test selection for traces TCSCDI. ISSN 0304-3975 (print), refinement. Theoretical Computer REFERENCES 50

Science, 563(??):1–42, January 19, Bernardo:2015:TBC 2015. CODEN TCSCDI. ISSN 0304- 3975 (print), 1879-2294 (electronic). [74] Marco Bernardo. On the tradeoff be- URL http://www.sciencedirect. tween compositionality and exactness com/science/article/pii/S0304397514006331in. weak bisimilarity for integrated- time Markovian process calculi. The- Bouyer:2015:RRT oretical Computer Science, 563(??): 99–143, January 19, 2015. CODEN [71] Patricia Bouyer, Nicolas Markey, and TCSCDI. ISSN 0304-3975 (print), Ocan Sankur. Robust reachabil- 1879-2294 (electronic). URL http: ity in timed automata and games: //www.sciencedirect.com/science/ a game-based approach. Theoret- article/pii/S0304397514008172. ical Computer Science, 563(??):43– 74, January 19, 2015. CODEN Anonymous:2015:EBe TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [75] Anonymous. Editorial Board. The- //www.sciencedirect.com/science/ oretical Computer Science, 564(??): article/pii/S0304397514006355. iii–ix, January 26, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), DAgostino:2015:BQU 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [72] Giovanna D’Agostino and Giacomo article/pii/S0304397514009748. Lenzi. Bisimulation quantifiers and Zhang:2015:BS uniform interpolation for guarded first order logic. Theoretical Com- [76] Wenhui Zhang. Bounded semantics. puter Science, 563(??):75–85, Jan- Theoretical Computer Science, 564(??): uary 19, 2015. CODEN TC- 1–29, January 26, 2015. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514006367. article/pii/S0304397514008184.

Guan:2015:CMP Conradie:2015:ACI

[73] Xuechong Guan and Yongming Li. [77] Willem Conradie, Yves Fomatati, On conditions for mappings to pre- Alessandra Palmigiano, and Sumit serve optimal solutions of semiring- Sourabh. Algorithmic correspondence induced valuation algebras. The- for intuitionistic modal mu-calculus. oretical Computer Science, 563(??): Theoretical Computer Science, 564(??): 86–98, January 19, 2015. CODEN 30–62, January 26, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514007786. article/pii/S0304397514008196. REFERENCES 51

Dufourd:2015:FSF Anonymous:2015:EBf [78] Jean-Fran¸cois Dufourd. Formal study [82] Anonymous. Editorial Board. The- of functional orbits in ﬁnite domains. oretical Computer Science, 565(??): Theoretical Computer Science, 564(??): iii–ix, February 2, 2015. CODEN 63–88, January 26, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751400989X. article/pii/S0304397514008330. Fernau:2015:PCV Edalat:2015:DCL [83] Henning Fernau, Fedor V. Fomin, Gee- [79] Abbas Edalat. A derivative for com- varghese Philip, and Saket Saurabh. plex Lipschitz maps with generalised On the parameterized complexity of Cauchy–Riemann equations. Theo- vertex cover and edge cover with retical Computer Science, 564(??):89– connectivity constraints. Theoret- 106, January 26, 2015. CODEN ical Computer Science, 565(??):1– TCSCDI. ISSN 0304-3975 (print), 15, February 2, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397514008469. //www.sciencedirect.com/science/ article/pii/S0304397514008275. Angiulli:2015:RDT Hellmuth:2015:CSF [80] Fabrizio Angiulli, Rachel Ben-Eliyahu- Zohary, and Luigi Palopoli. Restricted [84] Marc Hellmuth and Tilen Marc. On the default theories: Expressive power Cartesian skeleton and the factoriza- and outlier detection tasks. The- tion of the strong product of digraphs. oretical Computer Science, 564(??): Theoretical Computer Science, 565(??): 107–130, January 26, 2015. CODEN 16–29, February 2, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514008536. article/pii/S0304397514008378. DiGiampaolo:2015:PMI Shyu:2015:VCR [81] Barbara Di Giampaolo, Salvatore La [85] Shyong Jian Shyu. Visual cryp- Torre, and Margherita Napoli. Para- tograms of random grids for thresh- metric metric interval temporal logic. old access structures. Theoreti- Theoretical Computer Science, 564(??): cal Computer Science, 565(??):30– 131–148, January 26, 2015. CODEN 49, February 2, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514008627. article/pii/S0304397514008408. REFERENCES 52

Faulkner:2015:FSA //www.sciencedirect.com/science/ article/pii/S0304397514008548. [86] Nicholas Faulkner and Reem Yassawi. A family of sand automata. The- Kasperski:2015:COP oretical Computer Science, 565(??): [90] Adam Kasperski and Pawel Zieliński. 50–62, February 2, 2015. CODEN Combinatorial optimization problems TCSCDI. ISSN 0304-3975 (print), with uncertain costs and the OWA 1879-2294 (electronic). URL http: criterion. Theoretical Computer Sci- //www.sciencedirect.com/science/ ence, 565(??):102–112, February 2, article/pii/S0304397514008482. 2015. CODEN TCSCDI. ISSN 0304- Gyorgyi:2015:RBS 3975 (print), 1879-2294 (electronic). URL http://www.sciencedirect. [87] Péter Györgyi and Tamás Kis. Re- com/science/article/pii/S0304397514008561. ductions between scheduling problems with non-renewable resources Anonymous:2015:EBg and knapsack problems. Theoret- [91] Anonymous. Editorial Board. The- ical Computer Science, 565(??):63– oretical Computer Science, 566(??): 76, February 2, 2015. CODEN iii–ix, February 9, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514008500. article/pii/S0304397514010020. Punnen:2015:AVS Okhotin:2015:DCU [88] Abraham P. Punnen, Piyashat Sripratak, [92] Alexander Okhotin and Kai Salomaa. and Daniel Karapetyan. Aver- Descriptional complexity of unambigu- age value of solutions for the bi- ous input-driven pushdown automata. partite boolean quadratic programs Theoretical Computer Science, 566(??): and rounding algorithms. Theoret- 1–11, February 9, 2015. CODEN ical Computer Science, 565(??):77– TCSCDI. ISSN 0304-3975 (print), 89, February 2, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397514008585. //www.sciencedirect.com/science/ article/pii/S0304397514008512. Chechik:2015:FTC Fedou:2015:VRW [93] Shiri Chechik and David Peleg. The fault-tolerant capacitated K-center [89] Jean-Marc Fédou and Gabriele Fici. problem. Theoretical Computer Sci- Vertical representation of C ∞-words. ence, 566(??):12–25, February 9, 2015. Theoretical Computer Science, 565(??): CODEN TCSCDI. ISSN 0304- 90–101, February 2, 2015. CODEN 3975 (print), 1879-2294 (electronic). TCSCDI. ISSN 0304-3975 (print), URL http://www.sciencedirect. 1879-2294 (electronic). URL http: com/science/article/pii/S0304397514008603. REFERENCES 53

Turek:2015:APP Anonymous:2015:EBh

[94] Ondrej Turek. Abelian proper- [98] Anonymous. Editorial Board. The- ties of Parry words. Theoreti- oretical Computer Science, 567(??): cal Computer Science, 566(??):26– iii–ix, ???? 2015. CODEN TC- 38, February 9, 2015. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514010202. article/pii/S0304397514009384. Anonymous:2015:NC Gargano:2015:CCF [99] Anonymous. Natural computing. Theoretical Computer Science, 567 [95] Luisa Gargano and Adele A. Rescigno. (??):1, ???? 2015. CODEN TC- Complexity of conflict-free colorings SCDI. ISSN 0304-3975 (print), of graphs. Theoretical Computer 1879-2294 (electronic). URL http: Science, 566(??):39–49, February 9, //www.sciencedirect.com/science/ 2015. CODEN TCSCDI. ISSN 0304- article/pii/S0304397514010275. 3975 (print), 1879-2294 (electronic). URL http://www.sciencedirect. Neary:2015:TSU com/science/article/pii/S0304397514009463. [100] Turlough Neary. Three small univer- Zhang:2015:SSC sal spiking neural P systems. The- oretical Computer Science, 567(??): [96] Wenwen Zhang and Jian-Liang Wu. 2–20, ???? 2015. CODEN TC- Some sufficient conditions for 1-planar SCDI. ISSN 0304-3975 (print), graphs to be Class 1. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 566(??):50– //www.sciencedirect.com/science/ 58, February 9, 2015. CODEN article/pii/S0304397514006719. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Salo:2015:CTS //www.sciencedirect.com/science/ [101] Ville Salo and Ilkka Törmä. Cat- article/pii/S0304397514009499. egory theory of symbolic dynamics. Araujo:2015:PON Theoretical Computer Science, 567 (??):21–45, ???? 2015. CODEN [97] Julio Araujo, Nathann Cohen, Su- TCSCDI. ISSN 0304-3975 (print), sanna F. de Rezende, Frédéric Havet, 1879-2294 (electronic). URL http: and Phablo F. S. Moura. On the proper //www.sciencedirect.com/science/ orientation number of bipartite graphs. article/pii/S0304397514008020. Theoretical Computer Science, 566(??): Popovici:2015:FCO 59–75, February 9, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [102] Elena Popovici and Ezra Winston. 1879-2294 (electronic). URL http: A framework for co-optimization al- //www.sciencedirect.com/science/ gorithm performance and its appli- article/pii/S0304397514009554. cation to worst-case optimization. REFERENCES 54

Theoretical Computer Science, 567 18, February 23, 2015. CODEN (??):46–73, ???? 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514009487. article/pii/S0304397514008305. Tang:2015:GDR Song:2015:CEU [107] Ming-Xiao Tang, Jia Lee, and Kenichi [103] Bosheng Song and Linqiang Pan. Com- Morita. General design of reversible putational eﬃciency and universality sequential machines based on re- of timed P systems with active mem- versible logic elements. Theoreti- branes. Theoretical Computer Science, cal Computer Science, 568(??):19– 567(??):74–86, ???? 2015. CODEN 27, February 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514008433. article/pii/S0304397514009505. Doerr:2015:BBC Boyar:2015:RIA [104] Benjamin Doerr, Carola Doerr, and Franziska Ebel. From black-box com- [108] Joan Boyar, Sushmita Gupta, and plexity to designing new genetic algo- Kim S. Larsen. Relative inter- rithms. Theoretical Computer Science, val analysis of paging algorithms on 567(??):87–104, ???? 2015. CODEN access graphs. Theoretical Com- TCSCDI. ISSN 0304-3975 (print), puter Science, 568(??):28–48, Febru- 1879-2294 (electronic). URL http: ary 23, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397514009451. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Anonymous:2015:EBi article/pii/S0304397514009530.

[105] Anonymous. Editorial Board. The- Folschette:2015:IBR oretical Computer Science, 568(??): iii–ix, February 23, 2015. CODEN [109] Maxime Folschette, Lo¨ıc Paulevé, Kat- TCSCDI. ISSN 0304-3975 (print), sumi Inoue, Morgan Magnin, and 1879-2294 (electronic). URL http: Olivier Roux. Identification of bi- //www.sciencedirect.com/science/ ological regulatory networks from article/pii/S0304397515000067. Process Hitting models. Theoret- Nishimura:2015:IPQ ical Computer Science, 568(??):49– 71, February 23, 2015. CODEN [106] Harumichi Nishimura and Tomoyuki TCSCDI. ISSN 0304-3975 (print), Yamakami. Interactive proofs with 1879-2294 (electronic). URL http: quantum finite automata. Theo- //www.sciencedirect.com/science/ retical Computer Science, 568(??):1– article/pii/S0304397514009578. REFERENCES 55

Bulteau:2015:FPA Krawec:2015:PIC

[110] Laurent Bulteau, Anna Paola Carrieri, [114] Walter O. Krawec. n-Player impar- and Riccardo Dondi. Fixed-parameter tial combinatorial games with random algorithms for scaffold filling. The- players. Theoretical Computer Science, oretical Computer Science, 568(??): 569(??):1–12, March 2, 2015. CODEN 72–83, February 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514009694. article/pii/S0304397514009827. Levin:2015:MTE Ooshita:2015:SSM [115] Liron Levin, Dariusz R. Kowalski, and Michael Segal. Message and time effi- [111] Fukuhito Ooshita and Sébastien cient multi-broadcast schemes. The- Tixeuil. On the self-stabilization of mo- oretical Computer Science, 569(??): bile oblivious robots in uniform rings. 13–23, March 2, 2015. CODEN Theoretical Computer Science, 568(??): TCSCDI. ISSN 0304-3975 (print), 84–96, February 23, 2015. CODEN 1879-2294 (electronic). URL TCSCDI. ISSN 0304-3975 (print), http: //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397514009839. //www.sciencedirect.com/science/ article/pii/S0304397514009967. Bose:2015:SLC

Le:2015:CRP [116] Prosenjit Bose, Jean-Lou De Carufel, and Stephane Durocher. Searching [112] Van Bang Le and Sheng-Lung on a line: a complete characteriza- Peng. Characterizing and recogniz- tion of the optimal solution. The- ing probe block graphs. Theoret- oretical Computer Science, 569(??): ical Computer Science, 568(??):97– 24–42, March 2, 2015. CODEN 102, February 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514009840. article/pii/S0304397514010135. Skowron:2015:CFP Anonymous:2015:EBj [117] Piotr Skowron, Lan Yu, Piotr Fal- [113] Anonymous. Editorial Board. The- iszewski, and Edith Elkind. The com- oretical Computer Science, 569(??): plexity of fully proportional represen- iii–ix, March 2, 2015. CODEN tation for single-crossing electorates. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 569 1879-2294 (electronic). URL http: (??):43–57, March 2, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515000225. 1879-2294 (electronic). URL http: REFERENCES 56

//www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397514010111. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Yu:2015:PGR article/pii/S0304397514010093. [118] Yu Yu, Xiangxue Li, and Jian Weng. Pseudorandom generators from regu- Liu:2015:HNC lar one-way functions: New constructions with improved parameters. The- [122] Jia-Jie Liu, Cindy Tzu-Hsin Wang, oretical Computer Science, 569(??): Yue-Li Wang, and William Chung- 58–69, March 2, 2015. CODEN Kung Yen. The hub number of TCSCDI. ISSN 0304-3975 (print), co-comparability graphs. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 570(??):15– //www.sciencedirect.com/science/ 21, March 9, 2015. CODEN TC- article/pii/S0304397514010123. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Lam:2015:NCM //www.sciencedirect.com/science/ [119] Nhat X. Lam, Tien Tran, Min Kyung article/pii/S030439751401010X. An, and Dung T. Huynh. A note on the complexity of minimum latency Geng:2015:POS data aggregation scheduling with uniform power in physical interference [123] Zhichao Geng and Jinjiang Yuan. model. Theoretical Computer Science, Pareto optimization scheduling of fam- 569(??):70–73, March 2, 2015. CODEN ily jobs on a p-batch machine to min- TCSCDI. ISSN 0304-3975 (print), imize makespan and maximum late- 1879-2294 (electronic). URL http: ness. Theoretical Computer Science, //www.sciencedirect.com/science/ 570(??):22–29, March 9, 2015. CODEN article/pii/S0304397514009529. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL Anonymous:2015:EBk http: //www.sciencedirect.com/science/ [120] Anonymous. Editorial Board. The- article/pii/S0304397514010329. oretical Computer Science, 570(??): iii–ix, March 9, 2015. CODEN Li:2015:IAS TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [124] Chung-Lun Li. Improved algo- //www.sciencedirect.com/science/ rithms for single-machine common article/pii/S0304397515000559. due window assignment and schedul- Baste:2015:RPC ing with batch deliveries. Theo- retical Computer Science, 570(??): [121] Julien Baste and Ignasi Sau. The 30–39, March 9, 2015. CODEN role of planarity in connectivity prob- TCSCDI. ISSN 0304-3975 (print), lems parameterized by treewidth. The- 1879-2294 (electronic). URL http: oretical Computer Science, 570(??): //www.sciencedirect.com/science/ 1–14, March 9, 2015. CODEN article/pii/S0304397514010330. REFERENCES 57

Abed:2015:COP Angelini:2015:IBP

[125] Fidaa Abed and Chien-Chung Huang. [129] Patrizio Angelini, Giordano Da Lozzo, Coordinating oligopolistic players in Giuseppe Di Battista, Fabrizio Frati, unrelated machine scheduling. The- and Vincenzo Roselli. The impor- oretical Computer Science, 570(??): tance of being proper: (in clustered- 40–54, March 9, 2015. CODEN level planarity and T -level planarity). TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 571 1879-2294 (electronic). URL http: (??):1–9, March 16, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515000134. 1879-2294 (electronic). URL http: Zhang:2015:POP //www.sciencedirect.com/science/ article/pii/S0304397514010317. [126] Zhongzhi Zhang and Bin Wu. Pfaf- fian orientations and perfect match- Lai:2015:CAS ings of scale-free networks. The- [130] Cheng-Nan Lai. On the construction oretical Computer Science, 570(??): of all shortest vertex-disjoint paths 55–69, March 9, 2015. CODEN in Cayley graphs of abelian groups. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 571(??): 1879-2294 (electronic). URL http: 10–20, March 16, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515000158. 1879-2294 (electronic). URL http: Genitrini:2015:ACT //www.sciencedirect.com/science/ article/pii/S0304397515000146. [127] Antoine Genitrini, Bernhard Gitten- berger, Veronika Kraus, and Cécile Krysta:2015:CAV Mailler. Associative and commutative tree representations for [131] Piotr Krysta and Carmine Ven- Boolean functions. Theoretical tre. Combinatorial auctions with Computer Science, 570(??):70–101, verification are tractable. Theo- March 9, 2015. CODEN TC- retical Computer Science, 571(??): SCDI. ISSN 0304-3975 (print), 21–35, March 16, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751500016X. //www.sciencedirect.com/science/ article/pii/S0304397515000171. Anonymous:2015:EBl Auer:2015:UPG [128] Anonymous. Editorial Board. The- oretical Computer Science, 571(??): [132] Christopher Auer, Christian Bach- iii–ix, March 16, 2015. CODEN maier, Franz J. Brandenburg, An- TCSCDI. ISSN 0304-3975 (print), dreas Gleißner, and Kathrin Hanauer. 1879-2294 (electronic). URL http: Upward planar graphs and their du- //www.sciencedirect.com/science/ als. Theoretical Computer Science, 571 article/pii/S0304397515000821. (??):36–49, March 16, 2015. CODEN REFERENCES 58

TCSCDI. ISSN 0304-3975 (print), graphs that are not PCGs. The- 1879-2294 (electronic). URL http: oretical Computer Science, 571(??): //www.sciencedirect.com/science/ 78–87, March 16, 2015. CODEN article/pii/S0304397515000304. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Rytter:2015:SZP //www.sciencedirect.com/science/ [133] Wojciech Rytter and Arseny M. Shur. article/pii/S0304397515000389. Searching for Zimin patterns. The- Anonymous:2015:EBm oretical Computer Science, 571(??): 50–57, March 16, 2015. CODEN [137] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 572(??): 1879-2294 (electronic). URL http: iii–ix, March 23, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515000316. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Wang:2015:PMW article/pii/S0304397515001231. [134] Limin Wang, Xiaoyan Zhang, Zhao DAlessandro:2015:CEBb Zhang, and Hajo Broersma. A PTAS for the minimum weight con- [138] Flavio D’Alessandro and Benedetto In- nected vertex cover P3 problem trigila. On the commutative equiva- on unit disk graphs. Theoreti- lence of bounded context-free and reg- cal Computer Science, 571(??):58– ular languages: the semi-linear case. 66, March 16, 2015. CODEN TC- Theoretical Computer Science, 572 SCDI. ISSN 0304-3975 (print), (??):1–24, March 23, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515000328. //www.sciencedirect.com/science/ article/pii/S0304397515000353. Crespelle:2015:TIS Zhang:2015:PCL [135] Christophe Crespelle, Thi Ha Duong Phan, and The Hung Tran. Termina- [139] Zongyang Zhang, Sherman S. M. tion of the iterated strong-factor op- Chow, and Zhenfu Cao. Post-challenge erator on multipartite graphs. The- leakage in public-key encryption. The- oretical Computer Science, 571(??): oretical Computer Science, 572(??): 67–77, March 16, 2015. CODEN 25–49, March 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515000365. article/pii/S0304397515000377. Durocher:2015:GP Lu:2015:IPD [136] Stephane Durocher, Debajyoti Mon- [140] Lingfa Lu, Liqi Zhang, and Long dal, and Md. Saidur Rahman. On Wan. Integrated production and de- REFERENCES 59

livery scheduling on a serial batch ma- Anonymous:2015:EBn chine to minimize the makespan. The- oretical Computer Science, 572(??): [144] Anonymous. Editorial Board. The- 50–57, March 23, 2015. CODEN oretical Computer Science, 573(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, March 30, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515000419. //www.sciencedirect.com/science/ article/pii/S0304397515001346. Xu:2015:OSE Henzinger:2015:TUD [145] Monika Henzinger and Veronika [141] Jia Xu and Zhaohui Liu. Online Loitzenbauer. Truthful unit-demand scheduling with equal processing times auctions with budgets revisited. The- and machine eligibility constraints. oretical Computer Science, 573(??): Theoretical Computer Science, 572(??): 1–15, March 30, 2015. CODEN 58–65, March 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515000699. article/pii/S0304397515000420. Homan:2015:DRF Ting:2015:OPM [146] Christopher M. Homan and Sven Kosub. Dichotomy results for [142] H. F. Ting and Xiangzhong Xiang. On- ﬁxed point counting in boolean line pricing for multi-type of items. dynamical systems. Theoretical Theoretical Computer Science, 572(??): Computer Science, 573(??):16–25, 66–82, March 23, 2015. CODEN March 30, 2015. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515000432. article/pii/S0304397515000766.

Rao:2015:ABS Panda:2015:HRA [147] B. S. Panda, S. Paul, and D. Prad- [143] Micha¨el Rao, Michel Rigo, and han. Hardness results, approxima- Pavel Salimov. Avoiding 2-binomial tion and exact algorithms for liar’s squares and cubes. Theoretical domination problem in graphs. The- Computer Science, 572(??):83–91, oretical Computer Science, 573(??): March 23, 2015. CODEN TC- 26–42, March 30, 2015. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515000651. article/pii/S0304397515000778. REFERENCES 60

Bilo:2015:MDN Science, 573(??):71–89, March 30, 2015. CODEN TCSCDI. ISSN 0304- [148] Davide Bilò, Luciano Gualà, Ste- 3975 (print), 1879-2294 (electronic). fano Leucci, and Guido Proietti. URL http://www.sciencedirect. The max-distance network creation com/science/article/pii/S0304397515000973. game on general host graphs. The- oretical Computer Science, 573(??): Anonymous:2015:EBo 43–53, March 30, 2015. CODEN [152] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 574(??): 1879-2294 (electronic). URL http: iii–ix, April 6, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515000912. 1879-2294 (electronic). URL http: Boroujeni:2015:IAC //www.sciencedirect.com/science/ article/pii/S0304397515001437. [149] Marziyeh Boroujeni, Abdolali Basiri, Prabhakar:2015:DCP Sajjad Rahmany, and Annick Vali- bouze. F4-invariant algorithm for com- [153] Pavithra Prabhakar, Vladimeros Vladimerou, puting SAGBI–Gröbner bases. The- Mahesh Viswanathan, and Geir oretical Computer Science, 573(??): Dullerud. A decidable class of pla- 54–62, March 30, 2015. CODEN nar linear hybrid systems. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 574(??):1– 1879-2294 (electronic). URL http: 17, April 6, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515000924. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Liu:2015:EDP article/pii/S0304397514008615. [150] Yunlong Liu, Jianxin Wang, Jie You, Esik:2015:FPT Jianer Chen, and Yixin Cao. Edge deletion problems: Branching facili- [154] Zoltán Esik´ and Panos Rondogian- tated by modular decomposition. The- nis. A fixed point theorem for oretical Computer Science, 573(??): non-monotonic functions. Theoret- 63–70, March 30, 2015. CODEN ical Computer Science, 574(??):18– TCSCDI. ISSN 0304-3975 (print), 38, April 6, 2015. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515000961. //www.sciencedirect.com/science/ article/pii/S0304397515000687. Chatterjee:2015:ACA Matsikoudis:2015:FPT [151] Krishnendu Chatterjee, Manas Joglekar, and Nisarg Shah. Average case anal- [155] Eleftherios Matsikoudis and Edward A. ysis of the classical algorithm for Lee. The fixed-point theory of Markov decision processes with Büchi strictly causal functions. Theoret- objectives. Theoretical Computer ical Computer Science, 574(??):39– REFERENCES 61

77, April 6, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515001887. 1879-2294 (electronic). URL http: Fujita:2015:OSB //www.sciencedirect.com/science/ article/pii/S0304397515000729. [160] Satoshi Fujita. Optimal serial broadcast of successive chunks. Theo- Zhang:2015:QP retical Computer Science, 575(??):3– [156] Wenfeng Zhang and Xiaoquan Xu. 9, April 13, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), s2-quasicontinuous posets. Theoret- ical Computer Science, 574(??):78– 1879-2294 (electronic). URL http: 85, April 6, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397514009517. 1879-2294 (electronic). URL http: Shinn:2015:VBP //www.sciencedirect.com/science/ article/pii/S0304397515000730. [161] Tong-Wook Shinn and Tadao Takaoka. Variations on the bottleneck paths Bezem:2015:KMS problem. Theoretical Computer Sci- ence, 575(??):10–16, April 13, 2015. [157] Marc Bezem and Thierry Coquand. CODEN TCSCDI. ISSN 0304- A Kripke model for simplicial sets. 3975 (print), 1879-2294 (electronic). Theoretical Computer Science, 574 URL http://www.sciencedirect. (??):86–91, April 6, 2015. CODEN com/science/article/pii/S030439751400841X. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Ghosh:2015:SRP //www.sciencedirect.com/science/ article/pii/S0304397515000717. [162] Subir Kumar Ghosh and Bodhayan Roy. Some results on point visibility Anonymous:2015:EBp graphs. Theoretical Computer Science, 575(??):17–32, April 13, 2015. CODEN [158] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 575(??): 1879-2294 (electronic). URL http: iii–ix, April 13, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397514008342. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Bhushan:2015:EAM article/pii/S0304397515001814. [163] Alka Bhushan and G. Sajith. I/O Pal:2015:GEF eﬃcient algorithms for the minimum cut problem on unweighted undirected [159] Sudebkumar Prasant Pal and Kuni- graphs. Theoretical Computer Science, hiko Sadakane. Guest Editors’ fore- 575(??):33–41, April 13, 2015. CODEN word. Theoretical Computer Science, TCSCDI. ISSN 0304-3975 (print), 575(??):1–2, April 13, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397514008354. REFERENCES 62

Akl:2015:CCP 101, April 13, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), [164] Selim Akl, Robert Benkoczi, Daya Ram 1879-2294 (electronic). URL http: Gaur, Hossam Hassanein, Shahadat //www.sciencedirect.com/science/ Hossain, and Mark Thom. On a article/pii/S0304397514008287. class of covering problems with variable capacities in wireless networks. Anonymous:2015:EBq Theoretical Computer Science, 575 [168] Anonymous. Editorial Board. The- (??):42–55, April 13, 2015. CODEN oretical Computer Science, 576(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, April 20, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397514008366. //www.sciencedirect.com/science/ Narayanaswamy:2015:MAS article/pii/S0304397515002066.

[165] N. S. Narayanaswamy and G. Ra- Subramani:2015:FCH makrishna. On minimum average [169] K. Subramani and James Worthington. stretch spanning trees in polygonal 2- Feasibility checking in Horn constraint trees. Theoretical Computer Science, systems through a reduction based ap- 575(??):56–70, April 13, 2015. CODEN proach. Theoretical Computer Science, TCSCDI. ISSN 0304-3975 (print), 576(??):1–17, April 20, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397514009566. //www.sciencedirect.com/science/ Angelini:2015:ASP article/pii/S0304397514010159. Fountoulakis:2015:ACC [166] Patrizio Angelini, Giordano Da Lozzo, and Daniel Neuwirth. Advance- [170] Nikolaos Fountoulakis, Tobias Friedrich, ments on SEFE and Partitioned and Danny Hermelin. On the average- Book Embedding problems. The- case complexity of parameterized oretical Computer Science, 575(??): clique. Theoretical Computer Science, 71–89, April 13, 2015. CODEN 576(??):18–29, April 20, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514008597. article/pii/S0304397515000894. Cho:2015:ANO Cheng:2015:MPC [167] Da-Jung Cho, Yo-Sub Han, and [171] Eddie Cheng, Robert Connolly, and Hwee Kim. Alignment with non- Christoper Melekian. Matching preclu- overlapping inversions and translo- sion and conditional matching preclu- cations on two strings. Theoret- sion problems for the folded Petersen ical Computer Science, 575(??):90– cube. Theoretical Computer Science, REFERENCES 63

576(??):30–44, April 20, 2015. CODEN classes of chordal graphs. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 576(??): 1879-2294 (electronic). URL http: 85–101, April 20, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515000936. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Wang:2015:CNC article/pii/S0304397515001048. [172] Farn Wang, Sven Schewe, and Fellows:2015:THF Jung-Hsuan Wu. Complexity of node coverage games. Theoreti- [176] Michael R. Fellows, Uéverton dos cal Computer Science, 576(??):45– Santos Souza, Fábio Protti, and 60, April 20, 2015. CODEN TC- Maise Dantas da Silva. Tractability and SCDI. ISSN 0304-3975 (print), hardness of flood-filling games on trees. 1879-2294 (electronic). URL http: Theoretical Computer Science, 576(??): //www.sciencedirect.com/science/ 102–116, April 20, 2015. CODEN article/pii/S0304397515000997. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Kakimura:2015:FPT //www.sciencedirect.com/science/ [173] Naonori Kakimura and Ken ichi article/pii/S030439751500105X. Kawarabayashi. Fixed-parameter Anonymous:2015:EBr tractability for subset feedback set problems with parity constraints. The- [177] Anonymous. Editorial Board. The- oretical Computer Science, 576(??): oretical Computer Science, 577(??): 61–76, April 20, 2015. CODEN iii–ix, April 27, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515001012. article/pii/S0304397515002303. Buss:2015:QSP Popescu:2015:TGL [174] Sam Buss. Quasipolynomial size proofs [178] Andrei Popescu and Grigore Rosu. of the propositional pigeonhole princi- Term-generic logic. Theoretical Com- ple. Theoretical Computer Science, 576 puter Science, 577(??):1–24, April 27, (??):77–84, April 20, 2015. CODEN 2015. CODEN TCSCDI. ISSN 0304- TCSCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397515000948. article/pii/S0304397515001024. Janota:2015:EBQ Klavik:2015:EPR [179] Mikolás Janota and Joao Marques- [175] Pavel Klav´ık, Jan Kratochv´ıl, Yota Silva. Expansion-based QBF solv- Otachi, and Toshiki Saitoh. Ex- ing versus Q-resolution. Theoret- tending partial representations of sub- ical Computer Science, 577(??):25– REFERENCES 64

42, April 27, 2015. CODEN TC- retical Computer Science, 577(??): SCDI. ISSN 0304-3975 (print), 125–140, April 27, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751500095X. //www.sciencedirect.com/science/ article/pii/S0304397515002169. Sevegnani:2015:BS Anonymous:2015:EBs [180] Michele Sevegnani and Muﬀy Calder. Bigraphs with sharing. Theoreti- [184] Anonymous. Editorial Board. The- cal Computer Science, 577(??):43– oretical Computer Science, 578(??): 73, April 27, 2015. CODEN TC- iii–ix, May 3, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515001085. article/pii/S0304397515002522. Preda:2015:UMA Konstantinidis:2015:IAA [181] Mila Dalla Preda, Roberto Gia- [185] Stavros Konstantinidis. Imple- cobazzi, and Saumya Debray. Un- mentation and application of au- veiling metamorphism by abstract in- tomata (CIAA 2013). Theoret- terpretation of code properties. The- ical Computer Science, 578(??): oretical Computer Science, 577(??): 1, May 3, 2015. CODEN TC- 74–97, April 27, 2015. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515002595. article/pii/S0304397515001541. Balkanski:2015:SCP Schmidt-Schauss:2015:OPC [186] Eric Balkanski, F. Blanchet-Sadri, [182] Manfred Schmidt-Schauß, David Sabel, Matthew Kilgore, and B. J. Wyatt. On Joachim Niehren, and Jan Schwing- the state complexity of partial word hammer. Observational program cal- DFAs. Theoretical Computer Science, culi and the correctness of translations. 578(??):2–12, May 3, 2015. CODEN Theoretical Computer Science, 577(??): TCSCDI. ISSN 0304-3975 (print), 98–124, April 27, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515000481. //www.sciencedirect.com/science/ Caralp:2015:TVP article/pii/S0304397515001577. Li:2015:SAP [187] Mathieu Caralp, Pierre-Alain Reynier, and Jean-Marc Talbot. Trimming [183] Qin Li and Zhe Dang. Sampling visibly pushdown automata. The- automata and programs. Theo- oretical Computer Science, 578(??): REFERENCES 65

13–29, May 3, 2015. CODEN Maletti:2015:HOD TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [191] Andreas Maletti. Hyper-optimization //www.sciencedirect.com/science/ for deterministic tree automata. The- article/pii/S0304397515000456. oretical Computer Science, 578(??): 72–87, May 3, 2015. CODEN I:2015:CAD TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [188] Tomohiro I., Takaaki Nishimoto, Shun- //www.sciencedirect.com/science/ suke Inenaga, Hideo Bannai, and article/pii/S030439751500047X. Masayuki Takeda. Compressed au- Otto:2015:LCC tomata for dictionary matching. The- oretical Computer Science, 578(??): [192] Friedrich Otto and Frantisek Mr´az. 30–41, May 3, 2015. CODEN Lambda-conﬂuence for context rewrit- TCSCDI. ISSN 0304-3975 (print), ing systems. Theoretical Computer 1879-2294 (electronic). URL http: Science, 578(??):88–99, May 3, 2015. //www.sciencedirect.com/science/ CODEN TCSCDI. ISSN 0304- article/pii/S0304397515000468. 3975 (print), 1879-2294 (electronic). URL http://www.sciencedirect. Jirasek:2015:BRL com/science/article/pii/S0304397515000407.

[189] Jozef Jirásek and Galina Jirásková. Debarbieux:2015:ENW On the boundary of regular languages. Theoretical Computer Science, 578 [193] Denis Debarbieux, Olivier Gauwin, (??):42–57, May 3, 2015. CODEN Joachim Niehren, Tom Sebastian, and TCSCDI. ISSN 0304-3975 (print), Mohamed Zergaoui. Early nested 1879-2294 (electronic). URL http: word automata for XPath query an- //www.sciencedirect.com/science/ swering on XML streams. The- article/pii/S0304397515000493. oretical Computer Science, 578(??): 100–125, May 3, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Kutrib:2015:DID 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [190] Martin Kutrib, Andreas Malcher, article/pii/S0304397515000444. Carlo Mereghetti, Beatrice Palano, and Matthias Wendlandt. Deterministic Anonymous:2015:EBt input-driven queue automata: Finite turns, decidability, and closure prop- [194] Anonymous. Editorial Board. The- erties. Theoretical Computer Science, oretical Computer Science, 579(??): 578(??):58–71, May 3, 2015. CODEN iii–ix, May 10, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515000390. article/pii/S030439751500273X. REFERENCES 66

Dobson:2015:GLP plane. Theoretical Computer Science, 579(??):64–73, May 10, 2015. CODEN [195] M. P. Dobson, E. Hinrichsen, and TCSCDI. ISSN 0304-3975 (print), V. Leoni. Generalized limited pack- 1879-2294 (electronic). URL http: ings of some graphs with a lim- //www.sciencedirect.com/science/ ited number of P4-partners. The- article/pii/S0304397515001036. oretical Computer Science, 579(??): 1–8, May 10, 2015. CODEN TC- Bermond:2015:FDP SCDI. ISSN 0304-3975 (print), [199] Jean-Claude Bermond, David Coud- 1879-2294 (electronic). URL http: ert, Gianlorenzo D’Angelo, and Fa- //www.sciencedirect.com/science/ tima Zahra Moataz. Finding dis- article/pii/S0304397514008573. joint paths in networks with star Johnson:2015:SSD shared risk link groups. Theoret- ical Computer Science, 579(??):74– [196] Taylor T. Johnson and Sayan Mi- 87, May 10, 2015. CODEN TC- tra. Safe and stabilizing distributed SCDI. ISSN 0304-3975 (print), multi-path cellular ﬂows. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 579(??):9– //www.sciencedirect.com/science/ 32, May 10, 2015. CODEN TC- article/pii/S0304397515001097. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Guha:2015:FAT //www.sciencedirect.com/science/ [200] Ashwin Guha and Ambedkar Dukkipati. . article/pii/S030439751500050X A faster algorithm for testing poly- Dekhtyar:2015:CDG nomial representability of functions over ﬁnite integer rings. Theoret- [197] Michael Dekhtyar, Alexander Dikovsky, ical Computer Science, 579(??):88– and Boris Karlov. Categorial de- 99, May 10, 2015. CODEN TC- pendency grammars. Theoreti- SCDI. ISSN 0304-3975 (print), cal Computer Science, 579(??):33– 1879-2294 (electronic). URL http: 63, May 10, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515001103. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Lee:2015:SAS article/pii/S0304397515000900. [201] Kwangsu Lee, Dong Hoon Lee, and Dobrev:2015:CBC Moti Yung. Sequential aggregate signatures with short public keys [198] Stefan Dobrev, Stephane Durocher, without random oracles. Theoreti- Mohsen Eftekhari, Konstantinos Geor- cal Computer Science, 579(??):100– giou, Evangelos Kranakis, Danny Kri- 125, May 10, 2015. CODEN TC- zanc, Lata Narayanan, Jaroslav Opa- SCDI. ISSN 0304-3975 (print), trny, Sunil Shende, and Jorge Ur- 1879-2294 (electronic). URL http: rutia. Complexity of barrier cover- //www.sciencedirect.com/science/ age with relocatable sensors in the article/pii/S0304397515001164. REFERENCES 67

Bampis:2015:GSF Xie:2015:SGU

[202] Evripidis Bampis, Dimitrios Letsios, [206] Fang Xie, Zhe Xu, Yuzhong Zhang, and Giorgio Lucarelli. Green schedul- and Qingguo Bai. Scheduling games ing, ﬂows and matchings. The- on uniform machines with activation oretical Computer Science, 579(??): cost. Theoretical Computer Science, 126–136, May 10, 2015. CODEN 580(??):28–35, May 17, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515001176. article/pii/S030439751500153X. Anonymous:2015:EBu Ji:2015:SMB

[203] Anonymous. Editorial Board. The- [207] Min Ji, Qinyun Yang, Danli Yao, oretical Computer Science, 580(??): and T. C. E. Cheng. Single-machine iii–ix, May 17, 2015. CODEN batch scheduling of linear deteriorating TCSCDI. ISSN 0304-3975 (print), jobs. Theoretical Computer Science, 1879-2294 (electronic). URL http: 580(??):36–49, May 17, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515002844. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Gritti:2015:PPE article/pii/S0304397515001553. [204] Cl´ementine Gritti, Willy Susilo, Bu:2015:BCP Thomas Plantard, and Khin Than Win. Privacy-preserving encryption [208] Yuehua Bu and Xudong Bao. Backbone scheme using DNA parentage test. coloring of planar graphs for C8-free or Theoretical Computer Science, 580 C9-free. Theoretical Computer Science, (??):1–13, May 17, 2015. CODEN 580(??):50–58, May 17, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515001188. article/pii/S0304397515001565. Muller:2015:GLS Yang:2015:EBS

[205] Johannes M¨uller and Hengrui Jiang. [209] Yu Yang, Hongbo Liu, Hua Wang, Graphical limit sets for general and Scott Makeig. Enumeration cellular automata. Theoretical of BC-subtrees of trees. Theoret- Computer Science, 580(??):14–27, ical Computer Science, 580(??):59– May 17, 2015. CODEN TC- 74, May 17, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515001528. article/pii/S0304397515001589. REFERENCES 68

Damaschke:2015:FEL Anonymous:2015:EBv [210] Peter Damaschke. Finding and enu- [214] Anonymous. Editorial Board. The- merating large intersections. The- oretical Computer Science, 581(??): oretical Computer Science, 580(??): iii–ix, May 24, 2015. CODEN 75–82, May 17, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515002996. article/pii/S030439751500170X. Kamae:2015:CEP Istrate:2015:RRM [215] Teturo Kamae and Dong Han Kim. [211] Gabriel Istrate. Reachability and A characterization of eventual period- recurrence in a modular generaliza- icity. Theoretical Computer Science, tion of annihilating random walks 581(??):1–8, May 24, 2015. CODEN (and lights-out games) to hypergraphs. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 580 1879-2294 (electronic). URL http: (??):83–93, May 17, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515001759. 1879-2294 (electronic). URL http: DArco:2015:APN //www.sciencedirect.com/science/ article/pii/S0304397515001711. [216] Paolo D’Arco and Alfredo De San- tis. Anonymous protocols: No- Braunschvig:2015:FTA tions and equivalence. Theoret- [212] Gilad Braunschvig, Shiri Chechik, ical Computer Science, 581(??):9– David Peleg, and Adam Sealfon. Fault 25, May 24, 2015. CODEN TC- tolerant additive and (µ, α)-spanners. SCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 580 1879-2294 (electronic). URL http: (??):94–100, May 17, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515001917. 1879-2294 (electronic). URL http: deLuca:2015:SWS //www.sciencedirect.com/science/ article/pii/S0304397515001723. [217] Aldo de Luca and Alessandro De Luca. Sturmian words and the Stern se- Amini:2015:NDG quence. Theoretical Computer Science, [213] Omid Amini, David Coudert, and 581(??):26–44, May 24, 2015. CODEN Nicolas Nisse. Non-deterministic TCSCDI. ISSN 0304-3975 (print), graph searching in trees. Theo- 1879-2294 (electronic). URL http: retical Computer Science, 580(??): //www.sciencedirect.com/science/ 101–121, May 17, 2015. CODEN article/pii/S0304397515001929. TCSCDI. ISSN 0304-3975 (print), Sarma:2015:DCD 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [218] Atish Das Sarma, Anisur Rahaman article/pii/S0304397515001747. Molla, and Gopal Pandurangan. Dis- REFERENCES 69

tributed computation in dynamic net- Anonymous:2015:EBw works via random walks. Theo- retical Computer Science, 581(??): [222] Anonymous. Editorial Board. The- 45–66, May 24, 2015. CODEN oretical Computer Science, 582(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, May 31, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515001930. //www.sciencedirect.com/science/ article/pii/S0304397515003321. Jonsson:2015:CNI Barton:2015:GLS [219] Peter Jonsson, Victor Lagerkvist, and [223] Carl Barton, Tom´as Flouri, Costas S. Gustav Nordh. Constructing NP- Iliopoulos, and Solon P. Pissis. Global intermediate problems by blowing holes and local sequence alignment with with parameters of various proper- a bounded number of gaps. The- ties. Theoretical Computer Science, 581 oretical Computer Science, 582(??): (??):67–82, May 24, 2015. CODEN 1–16, May 31, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515002133. article/pii/S0304397515002200. Giannakopoulos:2015:BOR Harutyunyan:2015:LTA

[220] Yiannis Giannakopoulos. Bounding [224] Ararat Harutyunyan and Sylvain the optimal revenue of selling multiple Legay. Linear time algorithms goods. Theoretical Computer Science, for weighted oﬀensive and power- 581(??):83–96, May 24, 2015. CODEN ful alliances in trees. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 582(??):17– 1879-2294 (electronic). URL http: 26, May 31, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515002145. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Durocher:2015:LSD article/pii/S0304397515002236. [221] Stephane Durocher, Hicham El-Zein, Dereniowski:2015:DVS J. Ian Munro, and Sharma V. Thankachan. Low space data struc- [225] Dariusz Dereniowski, Adrian Kosowski, tures for geometric range mode query. and Dominik Pajak. Distinguish- Theoretical Computer Science, 581 ing views in symmetric networks: (??):97–101, May 24, 2015. CODEN a tight lower bound. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 582(??):27– 1879-2294 (electronic). URL http: 34, May 31, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515002157. 1879-2294 (electronic). URL http: REFERENCES 70

//www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515002248. //www.sciencedirect.com/science/ article/pii/S030439751500239X. Ho:2015:ETE Larsen:2015:HSS [226] Nhan Bao Ho. On the expansion of three-element subtraction sets. The- [230] Kasper Green Larsen, J. Ian Munro, oretical Computer Science, 582(??): Jesper Sindahl Nielsen, and Sharma V. 35–47, May 31, 2015. CODEN Thankachan. On hardness of sev- TCSCDI. ISSN 0304-3975 (print), eral string indexing problems. The- 1879-2294 (electronic). URL http: oretical Computer Science, 582(??): //www.sciencedirect.com/science/ 74–82, May 31, 2015. CODEN article/pii/S0304397515002418. TCSCDI. ISSN 0304-3975 (print), Song:2015:FTD 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [227] Sulin Song, Xiaoyan Li, Shuming Zhou, article/pii/S030439751500242X. and Mi Chen. Fault tolerance and diagnosability of burnt pancake net- Grytczuk:2015:HPT works under the comparison model. [231] Jaroslaw Grytczuk, Karol Kosiński, Theoretical Computer Science, 582 and Michal Zmarz. How to play Thue (??):48–59, May 31, 2015. CODEN games. Theoretical Computer Science, TCSCDI. ISSN 0304-3975 (print), 582(??):83–88, May 31, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515002431. //www.sciencedirect.com/science/ Teh:2015:CWP article/pii/S0304397515002637. [228] Wen Chean Teh and Kiam Heong Anonymous:2015:EBx Kwa. Core words and Parikh matrices. Theoretical Computer Science, 582 [232] Anonymous. Editorial Board. The- (??):60–69, May 31, 2015. CODEN oretical Computer Science, ??(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, ???? 2015. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515002649. //www.sciencedirect.com/science/ article/pii/S030439751500345X. Ilic:2015:VCD Richard:2015:FPT [229] Aleksandar Ilić. On the variable common due date, minimal tardy jobs bi- [233] Adrien Richard. Fixed point theo- criteria two-machine flow shop prob- rems for Boolean networks expressed lem with ordered machines. The- in terms of forbidden subnetworks. oretical Computer Science, 582(??): Theoretical Computer Science, 583 70–73, May 31, 2015. CODEN (??):1–26, ???? 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), REFERENCES 71

1879-2294 (electronic). URL http: 57–66, ???? 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515002650. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Sun:2015:CAO article/pii/S030439751500290X. [234] Shu-Ming Sun and Ning Zhong. Com- Chen:2015:PSI putability aspects for 1st-order partial differential equations via characteris- [238] Youjun Chen, Lingfa Lu, and Jin- tics. Theoretical Computer Science, jiang Yuan. Preemptive schedul- 583(??):27–39, ???? 2015. CODEN ing on identical machines with de- TCSCDI. ISSN 0304-3975 (print), livery coordination to minimize the 1879-2294 (electronic). URL http: maximum delivery completion time. //www.sciencedirect.com/science/ Theoretical Computer Science, 583 . article/pii/S0304397515002662 (??):67–77, ???? 2015. CODEN Kim:2015:NRG TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [235] Changwook Kim and Mahiro Ando. //www.sciencedirect.com/science/ Node replacement graph grammars article/pii/S0304397515002935. with dynamic node relabeling. The- oretical Computer Science, 583(??): Garcia:2015:DMD 40–50, ???? 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), [239] Pedro Garc´ıa, Damián López, and 1879-2294 (electronic). URL http: Manuel Vázquez de Parga. DFA //www.sciencedirect.com/science/ minimization: Double reversal ver- article/pii/S0304397515002674. sus split minimization algorithms. Theoretical Computer Science, 583 Chan:2015:FMR (??):78–85, ???? 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [236] Timothy M. Chan, J. Ian Munro, and 1879-2294 (electronic). URL Venkatesh Raman. Finding median http: in read-only memory on integer in- //www.sciencedirect.com/science/ . put. Theoretical Computer Science, article/pii/S0304397515003084 583(??):51–56, ???? 2015. CODEN DeStefani:2015:ENC TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [240] Lorenzo De Stefani and Francesco //www.sciencedirect.com/science/ Silvestri. Exploiting non-constant article/pii/S0304397515002893. safe memory in resilient algorithms Li:2015:SMB and data structures. Theoreti- cal Computer Science, 583(??):86– [237] Shisheng Li, T. C. E. Cheng, C. T. 97, ???? 2015. CODEN TC- Ng, and Jinjiang Yuan. Single- SCDI. ISSN 0304-3975 (print), machine batch scheduling with job 1879-2294 (electronic). URL http: processing time compatibility. The- //www.sciencedirect.com/science/ oretical Computer Science, 583(??): article/pii/S0304397515003096. REFERENCES 72

Anonymous:2015:EBy Levi:2015:NAT

[241] Anonymous. Editorial Board. The- [245] Amir Levi and Boaz Patt-Shamir. Non- oretical Computer Science, 584(??): additive two-option ski rental. The- iii–ix, June 13, 2015. CODEN oretical Computer Science, 584(??): TCSCDI. ISSN 0304-3975 (print), 42–52, June 13, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515003606. //www.sciencedirect.com/science/ Moscibroda:2015:GES article/pii/S0304397515000742. [242] Thomas Moscibroda and Adele A. Gargano:2015:IDS Rescigno. Guest editorial: Spe- [246] Luisa Gargano, Pavol Hell, Joseph G. cial issue on Structural Informa- Peters, and Ugo Vaccaro. Influ- tion and Communication Complex- ence diffusion in social networks un- ity. Theoretical Computer Science, der time window constraints. The- 584(??):1–2, June 13, 2015. CODEN oretical Computer Science, 584(??): TCSCDI. ISSN 0304-3975 (print), 53–66, June 13, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515003667. //www.sciencedirect.com/science/ Hegde:2015:SOF article/pii/S0304397515001127. [243] Nidhi Hegde, Laurent Massoulié, and Kniesburges:2015:DWC Laurent Viennot. Self-organizing flows in social networks. Theo- [247] Sebastian Kniesburges, Andreas Kout- retical Computer Science, 584(??): sopoulos, and Christian Scheideler. 3–18, June 13, 2015. CODEN A deterministic worst-case mes- TCSCDI. ISSN 0304-3975 (print), sage complexity optimal solution for resource discovery. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 584(??):67– //www.sciencedirect.com/science/ 79, June 13, 2015. CODEN TC- article/pii/S0304397515001152. SCDI. ISSN 0304-3975 (print), Clementi:2015:DCD 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [244] Andrea Clementi, Miriam Di Ianni, article/pii/S0304397514009414. Giorgio Gambosi, Emanuele Natale, and Riccardo Silvestri. Distributed Coulouma:2015:COM community detection in dynamic graphs. Theoretical Computer Science, [248] Etienne´ Coulouma, Emmanuel Go- 584(??):19–41, June 13, 2015. CODEN dard, and Joseph Peters. A char- TCSCDI. ISSN 0304-3975 (print), acterization of oblivious message ad- 1879-2294 (electronic). URL http: versaries for which consensus is solv- //www.sciencedirect.com/science/ able. Theoretical Computer Science, article/pii/S0304397514009402. 584(??):80–90, June 13, 2015. CODEN REFERENCES 73

TCSCDI. ISSN 0304-3975 (print), Giroire:2015:CSG 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [252] F. Giroire, I. Lamprou, D. Mazauric, article/pii/S0304397515000602. N. Nisse, S. P´erennes, and R. Soares. Connected surveillance game. The- Avin:2015:SAG oretical Computer Science, 584(??): 131–143, June 13, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [249] Chen Avin, Michael Borokhovich, 1879-2294 (electronic). URL http: Bernhard Haeupler, and Zvi Lotker. //www.sciencedirect.com/science/ Self-adjusting grid networks to min- article/pii/S0304397514009396. imize expected path length. The- oretical Computer Science, 584(??): Even:2015:NAP 91–102, June 13, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [253] Guy Even and Moti Medina. A non- 1879-2294 (electronic). URL http: monotone analysis with the primal- //www.sciencedirect.com/science/ dual approach: Online routing of vir- article/pii/S0304397514009542. tual circuits with unknown durations. Theoretical Computer Science, 584(??): Daltrophe:2015:PCT 144–154, June 13, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL [250] Hadassa Daltrophe, Shlomi Dolev, http: and Zvi Lotker. Probabilistic //www.sciencedirect.com/science/ . connectivity threshold for direc- article/pii/S0304397514007841 tional antenna widths. Theoreti- Anantharamu:2015:BAH cal Computer Science, 584(??):103– 114, June 13, 2015. CODEN TC- [254] Lakshmi Anantharamu and Bogdan S. SCDI. ISSN 0304-3975 (print), Chlebus. Broadcasting in ad hoc 1879-2294 (electronic). URL http: multiple access channels. Theo- //www.sciencedirect.com/science/ retical Computer Science, 584(??): article/pii/S0304397515002443. 155–176, June 13, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Metivier:2015:AFD 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [251] Y. M´etivier, J. M. Robson, and article/pii/S0304397515002613. A. Zemmari. Analysis of fully dis- Anonymous:2015:EBz tributed splitting and naming probabilistic procedures and applications. [255] Anonymous. Editorial Board. The- Theoretical Computer Science, 584(??): oretical Computer Science, 585(??): 115–130, June 13, 2015. CODEN iii–ix, June 20, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515001139. article/pii/S0304397515003825. REFERENCES 74

DalLago:2015:DIC June 20, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), [256] Ugo Dal Lago and Guillaume Bon- 1879-2294 (electronic). URL http: fante. Developments in Implicit //www.sciencedirect.com/science/ Complexity (DICE 2012). Theo- article/pii/S0304397515002017. retical Computer Science, 585(??):1– 2, June 20, 2015. CODEN TC- Brunel:2015:RML SCDI. ISSN 0304-3975 (print), [260] Alo¨ıs Brunel and Marco Gaboardi. 1879-2294 (electronic). URL http: Realizability models for a linear de- //www.sciencedirect.com/science/ pendent PCF. Theoretical Com- article/pii/S0304397515001942. puter Science, 585(??):55–70, June 20, Avanzini:2015:NOT 2015. CODEN TCSCDI. ISSN 0304- 3975 (print), 1879-2294 (electronic). [257] Martin Avanzini, Naohi Eguchi, URL http://www.sciencedirect. and Georg Moser. A new order- com/science/article/pii/S030439751500198X. theoretic characterisation of the polytime computable functions. The- Deng:2015:PEL oretical Computer Science, 585(??): [261] Yuxin Deng and Yu Zhang. Pro- 3–24, June 20, 2015. CODEN gram equivalence in linear contexts. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 585 1879-2294 (electronic). URL http: (??):71–90, June 20, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515001966. 1879-2294 (electronic). URL http: Bonfante:2015:RNN //www.sciencedirect.com/science/ article/pii/S0304397515001991. [258] Guillaume Bonfante, Florian De- Albert:2015:MDI loup, and Antoine Henrot. Real or natural number interpretation and [262] Elvira Albert, Jesús Correas, Germán their effect on complexity. The- Puebla, and Guillermo Román-D´ıez. oretical Computer Science, 585(??): A multi-domain incremental analy- 25–40, June 20, 2015. CODEN sis engine and its application to in- TCSCDI. ISSN 0304-3975 (print), cremental resource analysis. The- 1879-2294 (electronic). URL http: oretical Computer Science, 585(??): //www.sciencedirect.com/science/ 91–114, June 20, 2015. CODEN article/pii/S0304397515001978. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Feree:2015:CPT //www.sciencedirect.com/science/ [259] Hugo Férée, Emmanuel Hainry, Math- article/pii/S0304397515001954. ieu Hoyrup, and Romain Péchoux. Eberhard:2015:ATL Characterizing polynomial time complexity of stream programs us- [263] Sebastian Eberhard. Applicative theo- ing interpretations. Theoretical ries for logarithmic complexity classes. Computer Science, 585(??):41–54, Theoretical Computer Science, 585(??): REFERENCES 75

115–135, June 20, 2015. CODEN Fertin:2015:TAG TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [268] Guillaume Fertin, Shahrad Jamshidi, //www.sciencedirect.com/science/ and Christian Komusiewicz. Towards article/pii/S0304397515002005. an algorithmic guide to spiral galaxies. Theoretical Computer Science, 586 Anonymous:2015:EBba (??):26–39, June 27, 2015. CODEN [264] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 586(??): 1879-2294 (electronic). URL http: iii–ix, June 27, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515001620. 1879-2294 (electronic). URL http: Cicalese:2015:SIW //www.sciencedirect.com/science/ article/pii/S0304397515004041. [269] Ferdinando Cicalese, Gennaro Cor- dasco, Luisa Gargano, Martin Mi- Widmayer:2015:FA lanic, Joseph Peters, and Ugo Vac- [265] Peter Widmayer. FUN with algo- caro. Spread of inﬂuence in weighted rithms. Theoretical Computer Science, networks under time and budget con- 586(??):1, June 27, 2015. CODEN straints. Theoretical Computer Science, TCSCDI. ISSN 0304-3975 (print), 586(??):40–58, June 27, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515004119. //www.sciencedirect.com/science/ article/pii/S0304397515001632. Brand:2015:NEP Borassi:2015:FDR [266] Michael Brand. No easy puzzles: Hardness results for jigsaw puzzles. [270] Michele Borassi, Pierluigi Crescenzi, Theoretical Computer Science, 586 Michel Habib, Walter A. Kosters, An- (??):2–11, June 27, 2015. CODEN drea Marino, and Frank W. Takes. TCSCDI. ISSN 0304-3975 (print), Fast diameter and radius BFS-based 1879-2294 (electronic). URL http: computation in (weakly connected) //www.sciencedirect.com/science/ real-world graphs: With an applica- article/pii/S0304397515001607. tion to the six degrees of separation games. Theoretical Computer Science, Chen:2015:NCC 586(??):59–80, June 27, 2015. CODEN [267] Ke Chen and Adrian Dumitrescu. Non- TCSCDI. ISSN 0304-3975 (print), convex cases for carpenter’s rulers. 1879-2294 (electronic). URL http: Theoretical Computer Science, 586 //www.sciencedirect.com/science/ (??):12–25, June 27, 2015. CODEN article/pii/S0304397515001644. TCSCDI. ISSN 0304-3975 (print), Yamanaka:2015:SLT 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [271] Katsuhisa Yamanaka, Erik D. De- article/pii/S0304397515001619. maine, Takehiro Ito, Jun Kawahara, REFERENCES 76

Masashi Kiyomi, Yoshio Okamoto, Aloupis:2015:CNG Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno. Swap- [275] Greg Aloupis, Erik D. Demaine, ping labeled tokens on graphs. The- Alan Guo, and Giovanni Vigli- oretical Computer Science, 586(??): etta. Classic Nintendo games are 81–94, June 27, 2015. CODEN (computationally) hard. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 586(??):135– 1879-2294 (electronic). URL http: 160, June 27, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515001656. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Georgiou:2015:EMC article/pii/S0304397515001735. [272] Konstantinos Georgiou, Evangelos Kostitsyna:2015:OAC Kranakis, and Danny Krizanc. Ex- [276] Irina Kostitsyna, Maarten L¨oﬄer, cuse me! or the courteous the- and Valentin Polishchuk. Opti- atregoers’ problem. Theoretical mizing airspace closure with re- Computer Science, 586(??):95–110, spect to politicians’ egos. Theo- June 27, 2015. CODEN TC- retical Computer Science, 586(??): SCDI. ISSN 0304-3975 (print), 161–175, June 27, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515001668. //www.sciencedirect.com/science/ Demaine:2015:FFA article/pii/S0304397515003217.

[273] Erik D. Demaine and Martin L. Anonymous:2015:EBbb Demaine. Fun with fonts: Al- [277] Anonymous. Editorial Board. The- gorithmic typography. Theoreti- oretical Computer Science, 587(??): cal Computer Science, 586(??):111– iii–ix, July 4, 2015. CODEN TC- 119, June 27, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515004326. article/pii/S030439751500167X. Giannini:2015:IBC Viglietta:2015:LPC [278] Paola Giannini, Emanuela Merelli, [274] Giovanni Viglietta. Lemmings and Angelo Troina. Interactions be- is PSPACE-complete. Theoreti- tween computer science and biology. cal Computer Science, 586(??):120– Theoretical Computer Science, 587 134, June 27, 2015. CODEN TC- (??):1–2, July 4, 2015. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515001681. article/pii/S0304397515004399. REFERENCES 77

Bartocci:2015:SDS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [279] Ezio Bartocci, Luca Bortolussi, Laura article/pii/S0304397515002182. Nenzi, and Guido Sanguinetti. Sys- tem design of stochastic models us- Pardini:2015:CIB ing robustness of temporal properties. Theoretical Computer Science, [283] Giovanni Pardini, Paolo Milazzo, and 587(??):3–25, July 4, 2015. CODEN Andrea Maggiolo-Schettini. Compo- TCSCDI. ISSN 0304-3975 (print), nent identiﬁcation in biochemical path- 1879-2294 (electronic). URL http: ways. Theoretical Computer Science, //www.sciencedirect.com/science/ 587(??):104–124, July 4, 2015. CODEN article/pii/S0304397515002224. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Casagrande:2015:UBS //www.sciencedirect.com/science/ article/pii/S0304397515002170. [280] Alberto Casagrande and Carla Pi- azza. Unwinding biological systems. Anonymous:2015:EBbc Theoretical Computer Science, 587 (??):26–48, July 4, 2015. CODEN [284] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 588(??): 1879-2294 (electronic). URL http: iii–ix, July 11, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515002212. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Angius:2015:AAB article/pii/S0304397515004466.

[281] Alessio Angius, Gianfranco Balbo, Anonymous:2015:PSI Marco Beccuti, Enrico Bibbona, An- dras Horvath, and Roberta Sirovich. [285] Anonymous. Preface for the spe- Approximate analysis of biological sys- cial issue on Theory and Appli- tems by hybrid switching jump diﬀu- cations of Models of Computation. sion. Theoretical Computer Science, Theoretical Computer Science, 588 587(??):49–72, July 4, 2015. CODEN (??):1, July 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515002194. article/pii/S030439751500448X. Bodei:2015:CSA Lattimore:2015:MLN

[282] Chiara Bodei, Roberta Gori, and [286] Tor Lattimore and Marcus Hutter. Francesca Levi. Causal static anal- On Martin–L¨of (non-)convergence of ysis for brane calculi. Theoreti- Solomonoﬀ’s universal mixture. The- cal Computer Science, 587(??):73– oretical Computer Science, 588(??): 103, July 4, 2015. CODEN TC- 2–15, July 11, 2015. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), REFERENCES 78

1879-2294 (electronic). URL http: 588(??):52–72, July 11, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397514009815. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Kulkarni:2015:MPU article/pii/S0304397515002686. [287] Raghav Kulkarni, Youming Qiao, and Xiaoming Sun. Any monotone prop- Badkobeh:2015:CSB erty of 3-uniform hypergraphs is weakly evasive. Theoretical Computer Science, [291] Golnaz Badkobeh and Pascal Ochem. 588(??):16–23, July 11, 2015. CODEN Characterization of some binary TCSCDI. ISSN 0304-3975 (print), words with few squares. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 588(??):73– //www.sciencedirect.com/science/ 80, July 11, 2015. CODEN TC- article/pii/S030439751400855X. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Higashikawa:2015:MRS //www.sciencedirect.com/science/ [288] Yuya Higashikawa, John Augustine, article/pii/S0304397515002911. Siu-Wing Cheng, Mordecai J. Golin, Naoki Katoh, Guanqun Ni, Bing Su, Hon:2015:MIS and Yinfeng Xu. Minimax regret 1-sink location problem in dynamic path net- [292] Wing-Kai Hon, Ton Kloks, Ching-Hao works. Theoretical Computer Science, Liu, Hsiang-Hsuan Liu, Sheung-Hung 588(??):24–36, July 11, 2015. CODEN Poon, and Yue-Li Wang. On maximum TCSCDI. ISSN 0304-3975 (print), independent set of categorical prod- 1879-2294 (electronic). URL http: uct and ultimate categorical ratios of //www.sciencedirect.com/science/ graphs. Theoretical Computer Science, article/pii/S0304397514001030. 588(??):81–95, July 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Agarwal:2015:MUA 1879-2294 (electronic). URL http: [289] Manu Agarwal, Ragesh Jaiswal, and //www.sciencedirect.com/science/ Arindam Pal. k-means++ under article/pii/S0304397515002923. approximation stability. Theoreti- cal Computer Science, 588(??):37– Yang:2015:OCT 51, July 11, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), [293] Boting Yang and William Hamil- 1879-2294 (electronic). URL http: ton. The optimal capture time //www.sciencedirect.com/science/ of the one-cop-moves game. The- article/pii/S0304397515003734. oretical Computer Science, 588(??): Okhotin:2015:INF 96–113, July 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [290] Alexander Okhotin. Improved normal 1879-2294 (electronic). URL http: form for grammars with one-sided con- //www.sciencedirect.com/science/ texts. Theoretical Computer Science, article/pii/S0304397515003126. REFERENCES 79

Bastos:2015:CCR Itoh:2015:BMM

[294] J. Bastos, A. Messaoudi, T. Ro- [298] Toshiya Itoh and Seiji Yoshimoto. drigues, and D. Smania. A class Buﬀer management of multi-queue of cubic Rauzy fractals. Theo- QoS switches with class segregation. retical Computer Science, 588(??): Theoretical Computer Science, 589 114–130, July 11, 2015. CODEN (??):24–33, July 19, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751500314X. article/pii/S0304397515003175. Duarte:2015:MIM Amir:2015:DMF

[295] M´arcio A. Duarte, Felix Joos, Lu- [299] Amihood Amir, Avivit Levy, Ely cia D. Penso, Dieter Rautenbach, Porat, and B. Riva Shalom. Dic- and U´everton S. Souza. Maxi- tionary matching with a few gaps. mum induced matchings close to Theoretical Computer Science, 589 maximum matchings. Theoreti- (??):34–46, July 19, 2015. CODEN cal Computer Science, 588(??):131– TCSCDI. ISSN 0304-3975 (print), 137, July 11, 2015. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515003187. //www.sciencedirect.com/science/ article/pii/S0304397515003072. Kuo:2015:EEL Anonymous:2015:EBbd [300] Che-Nan Kuo. Every edge lies on cycles embedding in folded hyper- [296] Anonymous. Editorial Board. The- cubes with vertex-fault-tolerant. The- oretical Computer Science, 589(??): oretical Computer Science, 589(??): iii–ix, July 19, 2015. CODEN 47–52, July 19, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515004600. article/pii/S0304397515003199. Sureson:2015:RRM Caragiannis:2015:IAK

[297] Claude Sureson. Random reals as [301] Ioannis Caragiannis, Aris Filos- measures of natural open sets. The- Ratsikas, and Ariel D. Procac- oretical Computer Science, 589(??): cia. An improved 2-agent kid- 1–23, July 19, 2015. CODEN ney exchange mechanism. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 589(??): 1879-2294 (electronic). URL http: 53–60, July 19, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515003163. 1879-2294 (electronic). URL http: REFERENCES 80

//www.sciencedirect.com/science/ 99–120, July 19, 2015. CODEN article/pii/S0304397515003205. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Anthony:2015:PAC //www.sciencedirect.com/science/ [302] Martin Anthony and Joel Ratsaby. A article/pii/S0304397515003540. probabilistic approach to case-based in- Gourves:2015:WCC ference. Theoretical Computer Science, 589(??):61–75, July 19, 2015. CODEN [306] Laurent Gourvès, Jérôme Monnot, and TCSCDI. ISSN 0304-3975 (print), Lydia Tlilane. Worst case compro- 1879-2294 (electronic). URL http: mises in matroids with applications //www.sciencedirect.com/science/ to the allocation of indivisible goods. article/pii/S0304397515003230. Theoretical Computer Science, 589(??): 121–140, July 19, 2015. CODEN Binucci:2015:FPP TCSCDI. ISSN 0304-3975 (print), [303] Carla Binucci, Emilio Di Giacomo, 1879-2294 (electronic). URL http: Walter Didimo, Fabrizio Montecchi- //www.sciencedirect.com/science/ ani, Maurizio Patrignani, Antonios article/pii/S0304397515003722. Symvonis, and Ioannis G. Tollis. Fan- ODunlaing:2015:ACC planarity: Properties and complexity. Theoretical Computer Science, 589 [307] Colm OD´´ unlaing. An almost-confluent (??):76–86, July 19, 2015. CODEN congruential language which is not TCSCDI. ISSN 0304-3975 (print), Church–Rosser congruential. The- 1879-2294 (electronic). URL http: oretical Computer Science, 589(??): //www.sciencedirect.com/science/ 141–146, July 19, 2015. CODEN article/pii/S0304397515003515. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Adler:2015:LRW //www.sciencedirect.com/science/ [304] Isolde Adler and Mamadou Moustapha article/pii/S0304397515003254. Kanté. Linear rank-width and lin- Anonymous:2015:EBbe ear clique-width of trees. Theo- retical Computer Science, 589(??): [308] Anonymous. Editorial Board. The- 87–98, July 19, 2015. CODEN oretical Computer Science, 590(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, July 26, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515003527. //www.sciencedirect.com/science/ article/pii/S0304397515004867. Bulteau:2015:CVC Gasieniec:2015:FCT [305] Laurent Bulteau, Jiehua Chen, Pi- otr Faliszewski, Rolf Niedermeier, [309] Leszek Gasieniec, Russell Martin, and Nimrod Talmon. Combinato- Frank Wolter, and Prudence W. H. rial voter control in elections. The- Wong. Fundamentals of computation oretical Computer Science, 589(??): theory. Theoretical Computer Science, REFERENCES 81

590(??):1, July 26, 2015. CODEN Arvind:2015:IPD TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [313] V. Arvind, Johannes Köbler, Sebas- //www.sciencedirect.com/science/ tian Kuhnert, Gaurav Rattan, and article/pii/S0304397515004934. Yadu Vasudev. On the isomorphism problem for decision trees and decision lists. , Akutsu:2015:CFL Theoretical Computer Science 590(??):38–54, July 26, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [310] Tatsuya Akutsu, Takeyuki Tamura, 1879-2294 (electronic). URL http: Avraham A. Melkman, and Atsuhiro //www.sciencedirect.com/science/ Takasu. On the complexity of finding article/pii/S0304397515000614. a largest common subtree of bounded degree. Theoretical Computer Science, Kranakis:2015:CSF 590(??):2–16, July 26, 2015. CODEN [314] Evangelos Kranakis, Fraser MacQuar- TCSCDI. ISSN 0304-3975 (print), rie, and Oscar Morales Ponce. Con- 1879-2294 (electronic). URL http: nectivity and stretch factor trade- //www.sciencedirect.com/science/ offs in wireless sensor networks article/pii/S0304397514007749. with directional antennae. Theo- retical Computer Science, 590(??): Boyar:2015:CFC 55–72, July 26, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [311] Joan Boyar and Magnus Gausdal 1879-2294 (electronic). URL http: Find. Cancellation-free circuits in un- //www.sciencedirect.com/science/ bounded and bounded depth. The- article/pii/S0304397515003916. oretical Computer Science, 590(??): 17–26, July 26, 2015. CODEN Kowaluk:2015:NSP TCSCDI. ISSN 0304-3975 (print), [315] Miroslaw Kowaluk and Gabriela Ma- 1879-2294 (electronic). URL http: jewska. New sequential and paral- //www.sciencedirect.com/science/ lel algorithms for computing the β- article/pii/S0304397514007762. spectrum. Theoretical Computer Sci- ence, 590(??):73–85, July 26, 2015. Casteigts:2015:ETV CODEN TCSCDI. ISSN 0304- 3975 (print), 1879-2294 (electronic). [312] Arnaud Casteigts, Paola Flocchini, URL http://www.sciencedirect. Emmanuel Godard, Nicola Santoro, com/science/article/pii/S0304397515002601. and Masafumi Yamashita. On the Chaplick:2015:LCH expressivity of time-varying graphs. Theoretical Computer Science, 590 [316] Steven Chaplick, Jir´ı Fiala, Pim van ’t (??):27–37, July 26, 2015. CODEN Hof, Daniël Paulusma, and Marek TCSCDI. ISSN 0304-3975 (print), Tesar. Locally constrained homo- 1879-2294 (electronic). URL http: morphisms on graphs of bounded //www.sciencedirect.com/science/ treewidth and bounded degree. The- article/pii/S0304397515003102. oretical Computer Science, 590(??): REFERENCES 82

86–95, July 26, 2015. CODEN Anta:2015:OPS TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [320] Antonio Fern´andez Anta, Chryssis //www.sciencedirect.com/science/ Georgiou, Dariusz R. Kowalski, and article/pii/S030439751500064X. Elli Zavou. Online parallel scheduling of non-uniform tasks: Trad- Nikoletseas:2015:SEB ing failures for energy. Theoreti- cal Computer Science, 590(??):129– [317] S. Nikoletseas, P. Panagopoulou, 146, July 26, 2015. CODEN TC- C. Raptopoulos, and P. G. Spi- SCDI. ISSN 0304-3975 (print), rakis. On the structure of equilib- 1879-2294 (electronic). URL http: ria in basic network formation. The- //www.sciencedirect.com/science/ oretical Computer Science, 590(??): article/pii/S0304397515000638. 96–105, July 26, 2015. CODEN Anonymous:2015:EBbf TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [321] Anonymous. Editorial Board. The- //www.sciencedirect.com/science/ oretical Computer Science, 591(??): article/pii/S0304397515002455. iii–ix, August 2, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Barkay:2015:ESN 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [318] Neta Barkay, Ely Porat, and Bar article/pii/S0304397515005733. Shalem. Eﬃcient sampling of non- strict turnstile data streams. The- Nivat:2015:TST oretical Computer Science, 590(??): 106–117, July 26, 2015. CODEN [322] Maurice Nivat. The true story of TCSCDI. ISSN 0304-3975 (print), TCS. Theoretical Computer Science, 1879-2294 (electronic). URL http: 591(??):1–2, August 2, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515000626. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ article/pii/S0304397515004260. Liao:2015:IAA Ausiello:2015:TC [319] Kewen Liao, Hong Shen, and Longkun Guo. Improved approximation algo- [323] Giorgio Ausiello, Lila Kari, Grze- rithms for constrained fault-tolerant gorz Rozenberg, and Donald San- resource allocation. Theoretical nella. TCS in the 21st century. Computer Science, 590(??):118–128, Theoretical Computer Science, 591 July 26, 2015. CODEN TC- (??):3–4, August 2, 2015. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515001590. article/pii/S0304397515004272. REFERENCES 83

Izumi:2015:AMC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [324] Taisuke Izumi, Tomoko Izumi, Hiro- article/pii/S0304397515003758. taka Ono, and Koichi Wada. Ap- proximability of minimum certiﬁcate Golovach:2015:EGG dispersal with tree structures. The- oretical Computer Science, 591(??): [328] Petr A. Golovach. Editing to a 5–14, August 2, 2015. CODEN graph of given degrees. Theoret- TCSCDI. ISSN 0304-3975 (print), ical Computer Science, 591(??):72– 1879-2294 (electronic). URL http: 84, August 2, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515000341. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Kohler:2015:SSL article/pii/S0304397515003771.

[325] S. K¨ohler and V. Turau. Self- Meer:2015:GFA stabilizing local k-placement of replicas with local minimum variance. The- [329] Klaus Meer and Ameen Naif. Gen- oretical Computer Science, 591(??): eralized ﬁnite automata over real 15–27, August 2, 2015. CODEN and complex numbers. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 591(??):85– 1879-2294 (electronic). URL http: 98, August 2, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515003503. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Dereniowski:2015:SPR article/pii/S0304397515003928.

[326] Dariusz Dereniowski, Hirotaka Ono, Lin:2015:LTA Ichiro Suzuki,Lukasz Wrona, Masa- fumi Yamashita, and Pawel Zyli´nski. [330] Ching-Chi Lin and Hai-Lun Tu. The searchlight problem for road net- A linear-time algorithm for paired- works. Theoretical Computer Sci- domination on circular-arc graphs. ence, 591(??):28–59, August 2, 2015. Theoretical Computer Science, 591(??): CODEN TCSCDI. ISSN 0304- 99–105, August 2, 2015. CODEN 3975 (print), 1879-2294 (electronic). TCSCDI. ISSN 0304-3975 (print), URL http://www.sciencedirect. 1879-2294 (electronic). URL http: com/science/article/pii/S0304397515003692//www.sciencedirect.com/science/. article/pii/S030439751500393X. Cicalese:2015:CVC Reutenauer:2015:SFS [327] Ferdinando Cicalese, Martin Milanic, and Romeo Rizzi. On the complex- [331] Christophe Reutenauer. Studies on ity of the vector connectivity problem. ﬁnite Sturmian words. Theoreti- Theoretical Computer Science, 591(??): cal Computer Science, 591(??):106– 60–71, August 2, 2015. CODEN 133, August 2, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), REFERENCES 84

1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515003941. article/pii/S0304397515003990.

Barash:2015:TSC Kamiya:2015:PES

[332] Mikhail Barash and Alexander Okhotin. [336] Yuichi Kamiya, Tatsuya Okada, Two-sided context speciﬁcations in Takeshi Sekiguchi, and Yasunobu Sh- formal grammars. Theoretical Com- iota. Power and exponential sums puter Science, 591(??):134–153, Au- for generalized coding systems by a gust 2, 2015. CODEN TC- measure theoretic approach. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 592(??): 1879-2294 (electronic). URL http: 23–38, August 9, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515003953. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Anonymous:2015:EBbg article/pii/S0304397515004144.

[333] Anonymous. Editorial Board. The- Son:2015:GNN oretical Computer Science, 592(??): [337] Wanbin Son, Sang Won Bae, and Hee- iii–ix, August 9, 2015. CODEN Kap Ahn. Group nearest-neighbor TCSCDI. ISSN 0304-3975 (print), queries in the L plane. Theo- 1879-2294 (electronic). URL http: 1 retical Computer Science, 592(??): //www.sciencedirect.com/science/ 39–48, August 9, 2015. CODEN article/pii/S0304397515005952. TCSCDI. ISSN 0304-3975 (print), Chodoriwsky:2015:AAG 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [334] Jacob Chodoriwsky and Lucia Moura. article/pii/S0304397515004156. An adaptive algorithm for group Gaspers:2015:FOP testing for complexes. Theoret- ical Computer Science, 592(??):1– [338] Serge Gaspers, Mikko Koivisto, Math- 8, August 9, 2015. CODEN TC- ieu Liedloff, Sebastian Ordyniak, SCDI. ISSN 0304-3975 (print), and Stefan Szeider. On find- 1879-2294 (electronic). URL http: ing optimal polytrees. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 592(??):49– article/pii/S0304397515003965. 58, August 9, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), Kim:2015:NOI 1879-2294 (electronic). URL http: [335] Hwee Kim and Yo-Sub Han. Non- //www.sciencedirect.com/science/ overlapping inversion on strings article/pii/S0304397515004168. and languages. Theoretical Com- Beal:2015:EPM puter Science, 592(??):9–22, Au- gust 9, 2015. CODEN TC- [339] Richard Beal and Donald Adjeroh. SCDI. ISSN 0304-3975 (print), Efficient pattern matching for RNA REFERENCES 85

secondary structures. Theoreti- Jez:2015:AGB cal Computer Science, 592(??):59– 71, August 9, 2015. CODEN TC- [343] Artur Jez. Approximation of grammar- SCDI. ISSN 0304-3975 (print), based compression via recompression. 1879-2294 (electronic). URL http: Theoretical Computer Science, 592(??): //www.sciencedirect.com/science/ 115–134, August 9, 2015. CODEN article/pii/S030439751500420X. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Uiterwijk:2015:NRD //www.sciencedirect.com/science/ article/pii/S0304397515004685. [340] Jos W. H. M. Uiterwijk and Michael Barton. New results for domineer- Chen:2015:EAO ing from combinatorial game the- [344] Danny Z. Chen, Jian Li, and Haitao ory endgame databases. Theoret- Wang. Eﬃcient algorithms for the one- ical Computer Science, 592(??):72– dimensional k-center problem. The- 86, August 9, 2015. CODEN TC- oretical Computer Science, 592(??): SCDI. ISSN 0304-3975 (print), 135–142, August 9, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515004211. //www.sciencedirect.com/science/ Conﬂitti:2015:GCL article/pii/S0304397515004697.

[341] Alessandro Conﬂitti and Ricardo Catalano:2015:ATO Mamede. Gray codes and lexi- [345] Dario Catalano, Dario Fiore, Rosario cographical combinatorial generation Gennaro, and Konstantinos Vamvourel- for nonnesting and sparse nonnest- lis. Algebraic (trapdoor) one-way func- ing set partitions. Theoretical Com- tions: Constructions and applications. puter Science, 592(??):87–96, Au- Theoretical Computer Science, 592(??): gust 9, 2015. CODEN TC- 143–165, August 9, 2015. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515004259. article/pii/S0304397515004703. Bhattacharyya:2015:NAP Shan:2015:CCH [342] Rishiraj Bhattacharyya and Pratyay [346] Erfang Shan and Liying Kang. Col- Mukherjee. Non-adaptive programma- oring clique-hypergraphs of graphs bility of random oracle. Theoret- with no subdivision of K5. The- ical Computer Science, 592(??):97– oretical Computer Science, 592(??): 114, August 9, 2015. CODEN 166–175, August 9, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515004673. article/pii/S0304397515004715. REFERENCES 86

Anonymous:2015:EBbh Byrka:2015:ICC

[347] Anonymous. Editorial Board. The- [351] Jaroslaw Byrka, Andreas Karrenbauer, oretical Computer Science, 593(??): and Laura Sanit`a. The interval con- iii–ix, August 16, 2015. CODEN strained 3-coloring problem. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 593(??): 1879-2294 (electronic). URL http: 42–50, August 16, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515006064. 1879-2294 (electronic). URL http: Kapron:2015:FNI //www.sciencedirect.com/science/ article/pii/S0304397515004946. [348] Bruce Kapron, Lior Malka, and Venkatesh Srinivasan. A framework Heydrich:2015:DCC for non-interactive instance-dependent commitment schemes (NIC). The- [352] Sandy Heydrich and Rob van Stee. Di- oretical Computer Science, 593(??): viding connected chores fairly. The- 1–15, August 16, 2015. CODEN oretical Computer Science, 593(??): TCSCDI. ISSN 0304-3975 (print), 51–61, August 16, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515004727. //www.sciencedirect.com/science/ article/pii/S0304397515004958. Rosenbaum:2015:BGE Chang:2015:TCS [349] David J. Rosenbaum and Fabian Wagner. Beating the generator- [353] Ching-Lueh Chang and Yuh-Dauh enumeration bound for p-group iso- Lyuu. Triggering cascades on strongly morphism. Theoretical Computer connected directed graphs. The- Science, 593(??):16–25, August 16, oretical Computer Science, 593(??): 2015. CODEN TCSCDI. ISSN 0304- 62–69, August 16, 2015. CODEN 3975 (print), 1879-2294 (electronic). TCSCDI. ISSN 0304-3975 (print), URL http://www.sciencedirect. 1879-2294 (electronic). URL http: com/science/article/pii/S0304397515004776. //www.sciencedirect.com/science/ Lintzmayer:2015:AAS article/pii/S0304397515004971.

[350] Carla Negri Lintzmayer, Guillaume Jiang:2015:Q Fertin, and Zanoni Dias. Approxima- tion algorithms for sorting by length- [354] Minghui Jiang, Pedro J. Tejada, weighted preﬁx and suﬃx operations. and Haitao Wang. Quell. The- Theoretical Computer Science, 593(??): oretical Computer Science, 593(??): 26–41, August 16, 2015. CODEN 70–78, August 16, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515004818. article/pii/S0304397515004983. REFERENCES 87

Kumar:2015:NOA Hedetniemi:2015:TOS

[355] Gunjan Kumar and Saswata Shanni- [359] Stephen T. Hedetniemi, David P. Ja- grahi. New online algorithm for dy- cobs, and K. E. Kennedy. A theorem namic speed scaling with sleep state. of Ore and self-stabilizing algorithms Theoretical Computer Science, 593(??): for disjoint minimal dominating sets. 79–87, August 16, 2015. CODEN Theoretical Computer Science, 593(??): TCSCDI. ISSN 0304-3975 (print), 132–138, August 16, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515004995. //www.sciencedirect.com/science/ article/pii/S030439751500506X. Greinecker:2015:ACT Zhang:2015:OSP [356] Florian Greinecker. On the 2-abelian [360] Wenming Zhang, E. Zhang, and Feifeng complexity of the Thue–Morse word. Zheng. Online (J, K)-search problem Theoretical Computer Science, 593(??): and its competitive analysis. The- 88–105, August 16, 2015. CODEN oretical Computer Science, 593(??): TCSCDI. ISSN 0304-3975 (print), 139–145, August 16, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515005010. //www.sciencedirect.com/science/ Huang:2015:SRW article/pii/S0304397515005071.

[357] Yuke Huang and Zhiying Wen. The Zhang:2015:ECF sequence of return words of the Fi- [361] Mi-Mi Zhang and Jin-Xin Zhou. On bonacci sequence. Theoretical Com- g-extra connectivity of folded hyper- puter Science, 593(??):106–116, Au- cubes. Theoretical Computer Sci- gust 16, 2015. CODEN TC- ence, 593(??):146–153, August 16, SCDI. ISSN 0304-3975 (print), 2015. CODEN TCSCDI. ISSN 0304- 1879-2294 (electronic). URL http: 3975 (print), 1879-2294 (electronic). //www.sciencedirect.com/science/ URL http://www.sciencedirect. article/pii/S0304397515005022. com/science/article/pii/S0304397515005101. Zhang:2015:AAH Yuan:2015:RRA [358] Peng Zhang and Angsheng Li. Al- [362] Chen Yuan and Haibin Kan. Revis- gorithmic aspects of homophyly iting a randomized algorithm for the of networks. Theoretical Com- minimum rainbow subgraph problem. puter Science, 593(??):117–131, Au- Theoretical Computer Science, 593(??): gust 16, 2015. CODEN TC- 154–159, August 16, 2015. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515005058. article/pii/S030439751500496X. REFERENCES 88

Gordinowicz:2015:PGF Akshay:2015:CCT

[363] Przemys law Gordinowicz. Planar [367] S. Akshay, Paul Gastin, Mad- graph is on fire. Theoretical Com- havan Mukund, and K. Narayan puter Science, 593(??):160–164, Au- Kumar. Checking conformance gust 16, 2015. CODEN TC- for time-constrained scenario-based SCDI. ISSN 0304-3975 (print), specifications. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 594(??):24–43, Au- //www.sciencedirect.com/science/ gust 23, 2015. CODEN TC- article/pii/S0304397515005046. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Biswas:2015:SIR //www.sciencedirect.com/science/ [364] Sudip Biswas, Manish Patil, Rahul article/pii/S0304397515002467. Shah, and Sharma V. Thankachan. Nasab:2015:PPC Succinct indexes for reporting discriminating and generic words. The- [368] A. R. Shir Ali Nasab and S. N. oretical Computer Science, 593(??): Hosseini. Partial pullback comple- 165–173, August 16, 2015. CODEN ment rewriting. Theoretical Com- TCSCDI. ISSN 0304-3975 (print), puter Science, 594(??):44–64, Au- 1879-2294 (electronic). URL http: gust 23, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515005095. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Anonymous:2015:EBbi article/pii/S0304397515003138. [365] Anonymous. Editorial Board. The- Matos:2015:EPR oretical Computer Science, 594(??): iii–ix, August 23, 2015. CODEN [369] Armando B. Matos. The effi- TCSCDI. ISSN 0304-3975 (print), ciency of primitive recursive func- 1879-2294 (electronic). URL http: tions: a programmer’s view. The- //www.sciencedirect.com/science/ oretical Computer Science, 594(??): article/pii/S0304397515006180. 65–81, August 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Machado:2015:RBT 1879-2294 (electronic). URL http: [366] Rodrigo Machado, Leila Ribeiro, and //www.sciencedirect.com/science/ Reiko Heckel. Rule-based transfor- article/pii/S0304397515003539. mation of graph rewriting rules: To- Fulop:2015:CWM wards higher-order graph grammars. Theoretical Computer Science, 594(??): [370] Zoltán Fülöp and Heiko Vogler. Char- 1–23, August 23, 2015. CODEN acterizing weighted MSO for trees TCSCDI. ISSN 0304-3975 (print), by branching transitive closure logics. 1879-2294 (electronic). URL http: Theoretical Computer Science, 594(??): //www.sciencedirect.com/science/ 82–105, August 23, 2015. CODEN article/pii/S0304397515000705. TCSCDI. ISSN 0304-3975 (print), REFERENCES 89

1879-2294 (electronic). URL http: itative analysis of gene regulatory //www.sciencedirect.com/science/ networks by temporal logic. The- article/pii/S0304397515003552. oretical Computer Science, 594(??): 151–179, August 23, 2015. CODEN Teichmann:2015:LBM TCSCDI. ISSN 0304-3975 (print), [371] Markus Teichmann and Johannes Os- 1879-2294 (electronic). URL http: terholzer. A link between mul- //www.sciencedirect.com/science/ tioperator and tree valuation au- article/pii/S0304397515005277. tomata and logics. Theoretical Rebiha:2015:GIN Computer Science, 594(??):106–119, August 23, 2015. CODEN TC- [375] Rachid Rebiha, Arnaldo V. Moura, SCDI. ISSN 0304-3975 (print), and Nadir Matringe. Generating in- 1879-2294 (electronic). URL http: variants for non-linear hybrid systems. //www.sciencedirect.com/science/ Theoretical Computer Science, 594(??): article/pii/S030439751500376X. 180–200, August 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Yatapanage:2015:NPB 1879-2294 (electronic). URL http: [372] Nisansala Yatapanage and Kirsten //www.sciencedirect.com/science/ Winter. Next-preserving branch- article/pii/S0304397515005289. ing bisimulation. Theoretical Com- French:2015:SCT puter Science, 594(??):120–142, Au- gust 23, 2015. CODEN TC- [376] Tim French, John McCabe-Dansted, SCDI. ISSN 0304-3975 (print), and Mark Reynolds. Synthesis 1879-2294 (electronic). URL http: for continuous time. Theoretical //www.sciencedirect.com/science/ Computer Science, 594(??):201–222, article/pii/S030439751500417X. August 23, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), Jia:2015:ACC 1879-2294 (electronic). URL http: [373] Xiaodong Jia, Achim Jung, Hui Kou, //www.sciencedirect.com/science/ Qingguo Li, and Haoran Zhao. All article/pii/S0304397515005423. cartesian closed categories of quasicon- Anonymous:2015:EBbj tinuous domains consist of domains. Theoretical Computer Science, 594(??): [377] Anonymous. Editorial Board. The- 143–150, August 23, 2015. CODEN oretical Computer Science, 595(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, August 30, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515004181. //www.sciencedirect.com/science/ article/pii/S0304397515006519. Ito:2015:QAG Smith:2015:IWD [374] Sohei Ito, Takuma Ichinose, Masaya Shimakawa, Naoko Izumi, Shigeki Hag- [378] Tim Smith. On inﬁnite words de- ihara, and Naoki Yonezaki. Qual- termined by L systems. Theo- REFERENCES 90

retical Computer Science, 595(??): Hu:2015:UAC 1–10, August 30, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [382] Wenyu Hu, Xingjun Luo, and Zhongx- 1879-2294 (electronic). URL http: uan Luo. A unified approach to //www.sciencedirect.com/science/ computing the nearest complex poly- article/pii/S0304397515005137. nomial with a given zero. The- oretical Computer Science, 595(??): Bernasconi:2015:ERO 65–81, August 30, 2015. CODEN [379] Anna Bernasconi, Valentina Ciriani, TCSCDI. ISSN 0304-3975 (print), and Lorenzo Lago. On the er- 1879-2294 (electronic). URL http: ror resilience of ordered binary de- //www.sciencedirect.com/science/ . cision diagrams. Theoretical Com- article/pii/S0304397515005253 puter Science, 595(??):11–33, Au- Wang:2015:PCC gust 30, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), [383] Jianxin Wang, Weimin Su, Min Yang, 1879-2294 (electronic). URL http: Jiong Guo, Qilong Feng, Feng Shi, //www.sciencedirect.com/science/ and Jianer Chen. Parameterized article/pii/S0304397515005149. complexity of control and bribery for d-approval elections. Theoret- Vitale:2015:SER ical Computer Science, 595(??):82– 91, August 30, 2015. CODEN [380] Luciana Vitale, Alvaro´ Mart´ın, and TCSCDI. ISSN 0304-3975 (print), Gadiel Seroussi. Space-efficient rep- 1879-2294 (electronic). URL http: resentation of truncated suffix trees, //www.sciencedirect.com/science/ with applications to Markov or- article/pii/S0304397515005265. der estimation. Theoretical Com- puter Science, 595(??):34–45, Au- Chateau:2015:CAF gust 30, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), [384] A. Chateau and R. Giroudeau. A 1879-2294 (electronic). URL http: complexity and approximation frame- //www.sciencedirect.com/science/ work for the maximization scaffold- article/pii/S030439751500523X. ing problem. Theoretical Com- puter Science, 595(??):92–106, Au- Chen:2015:ODP gust 30, 2015. CODEN TC- [381] Jian-Jia Chen, Mong-Jen Kao, D. T. SCDI. ISSN 0304-3975 (print), Lee, Ignaz Rutter, and Dorothea Wag- 1879-2294 (electronic). URL http: ner. Online dynamic power manage- //www.sciencedirect.com/science/ ment with hard real-time guarantees. article/pii/S0304397515005332. Theoretical Computer Science, 595(??): Bang-Jensen:2015:BBD 46–64, August 30, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [385] J. Bang-Jensen and A. Yeo. Bal- 1879-2294 (electronic). URL http: anced branchings in digraphs. The- //www.sciencedirect.com/science/ oretical Computer Science, 595(??): article/pii/S0304397515005241. 107–119, August 30, 2015. CODEN REFERENCES 91

TCSCDI. ISSN 0304-3975 (print), Renault:2015:CMV 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [389] Gabriel Renault and Simon Schmidt. article/pii/S0304397515005368. On the complexity of the Mis`ere version of three games played on graphs. Qiu:2015:IAA Theoretical Computer Science, 595(??): 159–167, August 30, 2015. CODEN [386] Xian Qiu and Walter Kern. Im- TCSCDI. ISSN 0304-3975 (print), proved approximation algorithms for 1879-2294 (electronic). URL http: a bilevel knapsack problem. The- //www.sciencedirect.com/science/ oretical Computer Science, 595(??): article/pii/S0304397515005447. 120–129, August 30, 2015. CODEN Arockiaraj:2015:CWH TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [390] Micheal Arockiaraj and Arul Jeya //www.sciencedirect.com/science/ Shalini. Conjectures on wirelength article/pii/S030439751500537X. of hypercube into cylinder and torus. Theoretical Computer Science, 595(??): Khodakarami:2015:FPA 168–171, August 30, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [387] Farnoosh Khodakarami, Farzad Dide- 1879-2294 (electronic). URL http: hvar, and Ali Mohades. A ﬁxed- //www.sciencedirect.com/science/ parameter algorithm for guarding article/pii/S0304397515005216. 1.5D terrains. Theoretical Com- puter Science, 595(??):130–142, Au- Anonymous:2015:EBbk gust 30, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), [391] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 596(??): //www.sciencedirect.com/science/ iii–ix, September 6, 2015. CODEN article/pii/S0304397515005381. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Wang:2015:PFD article/pii/S0304397515006738.

[388] Yujue Wang, Duncan S. Wong, Qian- Brunetti:2015:IHI hong Wu, Sherman S. M. Chow, Bo Qin, Jianwei Liu, and Yong Ding. [392] S. Brunetti, E. Lodi, and W. Quat- Practical (fully) distributed signatures trociocchi. An inclusion hierarchy provably secure in the standard model. of irreversible dynamos. Theoret- Theoretical Computer Science, 595(??): ical Computer Science, 596(??):1– 143–158, August 30, 2015. CODEN 11, September 6, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515005393. article/pii/S0304397515005459. REFERENCES 92

Twigg:2015:LPA Biniaz:2015:MHO

[393] Andrew Twigg and Eduardo C. Xavier. [397] Ahmad Biniaz, Anil Maheshwari, Locality-preserving allocations prob- and Michiel Smid. Matchings in lems and coloured bin packing. The- higher-order Gabriel graphs. The- oretical Computer Science, 596(??): oretical Computer Science, 596(??): 12–22, September 6, 2015. CODEN 67–78, September 6, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515005460. article/pii/S0304397515005502. Bland:2015:TOS Christ:2015:OMC [394] Widmer Bland and W. F. Smyth. [398] Marie G. Christ, Lene M. Favrholdt, Three overlapping squares: the gen- and Kim S. Larsen. Online multi- eral case characterized & applications. coloring with advice. Theoreti- Theoretical Computer Science, 596(??): cal Computer Science, 596(??):79– 23–40, September 6, 2015. CODEN 91, September 6, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515005472. article/pii/S030439751500554X. Blanchet-Sadri:2015:CML Balogh:2015:OBW [395] F. Blanchet-Sadri and Andrew Lohr. Computing minimum length repre- [399] János Balogh, József Békési, György sentations of sets of words of uni- Dósa, Leah Epstein, Hans Kellerer, form length. Theoretical Computer Asaf Levin, and Zsolt Tuza. Offline Science, 596(??):41–54, September 6, black and white bin packing. Theo- 2015. CODEN TCSCDI. ISSN 0304- retical Computer Science, 596(??):92– 3975 (print), 1879-2294 (electronic). 101, September 6, 2015. CODEN URL http://www.sciencedirect. TCSCDI. ISSN 0304-3975 (print), com/science/article/pii/S03043975150054841879-2294. (electronic). URL http: //www.sciencedirect.com/science/ Jager:2015:BMM article/pii/S0304397515005551. [396] Gerold Jäger and Marcin Peczarski. DAngelo:2015:MSP Bounding memory for Mastermind might not make it harder. Theo- [400] Gianlorenzo D’Angelo, Daniele Dio- retical Computer Science, 596(??):55– dati, Alfredo Navarra, and Cristina M. 66, September 6, 2015. CODEN Pinotti. The minimum k-storage prob- TCSCDI. ISSN 0304-3975 (print), lem on directed graphs. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 596(??):102– //www.sciencedirect.com/science/ 108, September 6, 2015. CODEN article/pii/S0304397515005496. TCSCDI. ISSN 0304-3975 (print), REFERENCES 93

1879-2294 (electronic). URL http: September 6, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515005599. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Nicosia:2015:TAS article/pii/S0304397515005563. [401] Gaia Nicosia, Andrea Paciﬁci, and Ul- Anonymous:2015:EBbl rich Pferschy. Two agent scheduling with a central selection mechanism. [405] Anonymous. Editorial Board. The- Theoretical Computer Science, 596(??): oretical Computer Science, 597(??): 109–123, September 6, 2015. CODEN iii–ix, September 13, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515005617. article/pii/S0304397515006994.

David:2015:ASH Bimbo:2015:DIF [402] Julien David, Lo¨ıck Lhote, Arnaud [406] Katalin Bimbó. The decidabil- Mary, and Fran¸cois Rioult. An ity of the intensional fragment of average study of hypergraphs and classical linear logic. Theoreti- their minimal transversals. Theoret- cal Computer Science, 597(??):1– ical Computer Science, 596(??):124– 17, September 13, 2015. CODEN 141, September 6, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515005290. article/pii/S0304397515005629. Guegan:2015:CDO Bujtor:2015:EPI [403] Guillaume Guégan and Pascal Ochem. [407] Ferenc Bujtor and Walter Vogler. Complexity dichotomy for oriented ho- Error-pruning in interface automata. momorphism of planar graphs with Theoretical Computer Science, 597(??): large girth. Theoretical Computer Sci- 18–39, September 13, 2015. CODEN ence, 596(??):142–148, September 6, TCSCDI. ISSN 0304-3975 (print), 2015. CODEN TCSCDI. ISSN 0304- 1879-2294 (electronic). URL http: 3975 (print), 1879-2294 (electronic). //www.sciencedirect.com/science/ URL http://www.sciencedirect. article/pii/S0304397515005575. com/science/article/pii/S0304397515005514. Boreale:2015:WAC Dosa:2015:TAB [408] Michele Boreale and Michela Paolini. [404] Gyorgy Dosa. The tight ab- Worst- and average-case privacy solute bound of first fit in the breaches in randomization mecha- parameterized case. Theoretical nisms. Theoretical Computer Sci- Computer Science, 596(??):149–154, ence, 597(??):40–61, September 13, REFERENCES 94

2015. CODEN TCSCDI. ISSN 0304- 1879-2294 (electronic). URL http: 3975 (print), 1879-2294 (electronic). //www.sciencedirect.com/science/ URL http://www.sciencedirect. article/pii/S0304397514010147. com/science/article/pii/S0304397515006313. Salomaa:2015:ACR Biondi:2015:QIL [413] Arto Salomaa. Applications of the [409] Fabrizio Biondi, Axel Legay, Pasquale Chinese remainder theorem to reac- Malacaria, and Andrzej Wasowski. tion systems with duration. Theo- Quantifying information leakage of retical Computer Science, 598(??):15– randomized protocols. Theoreti- 22, September 20, 2015. CODEN cal Computer Science, 597(??):62– TCSCDI. ISSN 0304-3975 (print), 87, September 13, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397514010305. //www.sciencedirect.com/science/ Azimi:2015:DGM article/pii/S0304397515006684. Anonymous:2015:EBbm [414] Sepinoud Azimi, Cristian Gratie, Sergiu Ivanov, and Ion Petre. De- [410] Anonymous. Editorial Board. The- pendency graphs and mass conser- oretical Computer Science, 598(??): vation in reaction systems. Theo- iii–ix, September 20, 2015. CODEN retical Computer Science, 598(??):23– TCSCDI. ISSN 0304-3975 (print), 39, September 20, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515007355. //www.sciencedirect.com/science/ article/pii/S0304397515001115. Kari:2015:Ea Hutchinson:2015:EOT [411] Lila Kari. Editorial. Theoret- ical Computer Science, 598(??):1, [415] M. Hutchinson and M. Widom. Enu- September 20, 2015. CODEN TC- meration of octagonal tilings. Theo- SCDI. ISSN 0304-3975 (print), retical Computer Science, 598(??):40– 1879-2294 (electronic). URL http: 50, September 20, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515007422. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Shang:2015:CPT article/pii/S030439751500225X. [412] Yun Shang, Xian Lu, and Ruqian Shi:2015:ENM Lu. Computing power of Tur- ing machines in the framework of [416] Yaoyun Shi and Xiaodi Wu. Epsilon- unsharp quantum logic. Theoret- net method for optimizations over ical Computer Science, 598(??):2– separable states. Theoretical Com- 14, September 20, 2015. CODEN puter Science, 598(??):51–63, Septem- TCSCDI. ISSN 0304-3975 (print), ber 20, 2015. CODEN TC- REFERENCES 95

SCDI. ISSN 0304-3975 (print), Tlili:2015:SDL 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [420] Takwa Tlili and Saoussen Krichen. article/pii/S0304397515002479. On solving the double loading problem using a modified particle swarm optimization. Echegoyen:2015:CCB Theoretical Computer Science, 598(??):118–128, Septem- ber 20, 2015. CODEN TC- [417] Carlos Echegoyen, Roberto Santana, SCDI. ISSN 0304-3975 (print), Alexander Mendiburu, and Jose A. 1879-2294 (electronic). URL http: Lozano. Comprehensive character- //www.sciencedirect.com/science/ ization of the behaviors of estima- article/pii/S0304397515004788. tion of distribution algorithms. Theo- retical Computer Science, 598(??):64– Gravier:2015:WOD 86, September 20, 2015. CODEN [421] Sylvain Gravier, Jérôme Javelle, Mehdi TCSCDI. ISSN 0304-3975 (print), Mhalla, and Simon Perdrix. On 1879-2294 (electronic). URL http: weak odd domination and graph-based //www.sciencedirect.com/science/ quantum secret sharing. Theoreti- article/pii/S0304397515003229. cal Computer Science, 598(??):129– 137, September 20, 2015. CODEN Aman:2015:VMS TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [418] Bogdan Aman and Gabriel Ciobanu. //www.sciencedirect.com/science/ Verification of membrane systems with article/pii/S0304397515004806. delays via Petri nets with delays. The- oretical Computer Science, 598(??):87– Dennunzio:2015:RSE 101, September 20, 2015. CODEN [422] Alberto Dennunzio, Enrico Formenti, TCSCDI. ISSN 0304-3975 (print), and Luca Manzoni. Reaction systems 1879-2294 (electronic). URL http: and extremal combinatorics properties. //www.sciencedirect.com/science/ Theoretical Computer Science, 598(??): article/pii/S0304397515003278. 138–149, September 20, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Fischer:2015:BCR 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [419] Asja Fischer and Christian Igel. A article/pii/S0304397515005034. bound for the convergence rate of Morton:2015:CTP parallel tempering for sampling restricted Boltzmann machines. Theo- [423] Jason Morton and Jacob Turner. retical Computer Science, 598(??):102– Computing the Tutte polynomial 117, September 20, 2015. CODEN of lattice path matroids using de- TCSCDI. ISSN 0304-3975 (print), terminantal circuits. Theoretical 1879-2294 (electronic). URL http: Computer Science, 598(??):150–156, //www.sciencedirect.com/science/ September 20, 2015. CODEN TC- article/pii/S0304397515004235. SCDI. ISSN 0304-3975 (print), REFERENCES 96

1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515004223. article/pii/S0304397515006878. Islam:2015:MOR Anonymous:2015:EBbn [428] Md. Ariful Islam, Abhishek Murthy, [424] Anonymous. Editorial Board. The- Ezio Bartocci, Elizabeth M. Cherry, oretical Computer Science, 599(??): Flavio H. Fenton, James Glimm, iii–ix, September 27, 2015. CODEN Scott A. Smolka, and Radu Grosu. TCSCDI. ISSN 0304-3975 (print), Model-order reduction of ion chan- 1879-2294 (electronic). URL http: nel dynamics using approximate //www.sciencedirect.com/science/ bisimulation. Theoretical Com- article/pii/S0304397515007501. puter Science, 599(??):34–46, Septem- Kari:2015:Eb ber 27, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), [425] Lila Kari. Editorial. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 599(??):1, //www.sciencedirect.com/science/ September 27, 2015. CODEN TC- article/pii/S0304397514002205. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Chaves:2015:ACU //www.sciencedirect.com/science/ article/pii/S0304397515007434. [429] Madalena Chaves and Alfonso Carta. Attractor computation using inter- Gilbert:2015:ACM connected Boolean networks: Testing growth rate models in E. coli. Theo- [426] David Gilbert and Monika Heiner. retical Computer Science, 599(??):47– Advances in computational meth- 63, September 27, 2015. CODEN ods in systems biology. Theoret- TCSCDI. ISSN 0304-3975 (print), ical Computer Science, 599(??):2– 1879-2294 (electronic). URL http: 3, September 27, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397514004575. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Fages:2015:IRS article/pii/S0304397515007446.

Ballarini:2015:AES [430] Fran¸cois Fages, Steven Gay, and Sylvain Soliman. Inferring reac- [427] Paolo Ballarini and Marie Duﬂot. Ap- tion systems from ordinary diﬀer- plications of an expressive statisti- ential equations. Theoretical Com- cal model checking approach to the puter Science, 599(??):64–78, Septem- analysis of genetic circuits. Theo- ber 27, 2015. CODEN TC- retical Computer Science, 599(??):4– SCDI. ISSN 0304-3975 (print), 33, September 27, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397514006197. REFERENCES 97

Videla:2015:LBL //www.sciencedirect.com/science/ article/pii/S0304397515005228. [431] Santiago Videla, Carito Guziolowski, Federica Eduati, Sven Thiele, Martin Hermelin:2015:PCA Gebser, Jacques Nicolas, Julio Saez- [435] Danny Hermelin and Liat Rozen- Rodriguez, Torsten Schaub, and Anne berg. Parameterized complexity analy- Siegel. Learning Boolean logic mod- sis for the Closest String with Wild- els of signaling networks with ASP. cards problem. Theoretical Com- Theoretical Computer Science, 599(??): puter Science, 600(??):11–18, Oc- 79–101, September 27, 2015. CODEN tober 4, 2015. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397514004587. article/pii/S0304397515005538. Angione:2015:ADM Ceccherini-Silberstein:2015:MAG [432] C. Angione, J. Costanza, G. Cara- [436] Tullio Ceccherini-Silberstein, Michel pezza, P. Li´o, and G. Nicosia. Anal- Coornaert, Francesca Fiorenzi, Paul E. ysis and design of molecular machines. Schupp, and Nicholas W. M. Touikan. Theoretical Computer Science, 599(??): Multipass automata and group word 102–117, September 27, 2015. CODEN problems. Theoretical Computer TCSCDI. ISSN 0304-3975 (print), Science, 600(??):19–33, October 4, 1879-2294 (electronic). URL http: 2015. CODEN TCSCDI. ISSN 0304- //www.sciencedirect.com/science/ 3975 (print), 1879-2294 (electronic). article/pii/S0304397515000663. URL http://www.sciencedirect. Anonymous:2015:EBbo com/science/article/pii/S0304397515005642. Christodoulakis:2015:ISP [433] Anonymous. Editorial Board. The- oretical Computer Science, 600(??): [437] Manolis Christodoulakis, P. J. Ryan, iii–ix, October 4, 2015. CODEN W. F. Smyth, and Shu Wang. In- TCSCDI. ISSN 0304-3975 (print), determinate strings, preﬁx arrays 1879-2294 (electronic). URL http: & undirected graphs. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 600(??):34– article/pii/S0304397515007999. 48, October 4, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Kumar:2015:NHS 1879-2294 (electronic). URL http: [434] Gunjan Kumar and Saswata Shan- //www.sciencedirect.com/science/ nigrahi. On the NP-hardness of article/pii/S0304397515005666. speed scaling with sleep state. The- Coelho:2015:IRG oretical Computer Science, 600(??): 1–10, October 4, 2015. CODEN [438] Erika M. M. Coelho, Mitre C. TCSCDI. ISSN 0304-3975 (print), Dourado, and Rudini M. Sampaio. 1879-2294 (electronic). URL http: Inapproximability results for graph REFERENCES 98

convexity parameters. Theoreti- Alabert:2015:NFL cal Computer Science, 600(??):49– 58, October 4, 2015. CODEN [442] Aureli Alabert, Alessandro Berti, TCSCDI. ISSN 0304-3975 (print), Ricard Caballero, and Marco Fer- 1879-2294 (electronic). URL http: rante. No-free-lunch theorems in //www.sciencedirect.com/science/ the continuum. Theoretical Com- article/pii/S0304397515005794. puter Science, 600(??):98–106, Oc- tober 4, 2015. CODEN TC- Bonomo:2015:CCD SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [439] Flavia Bonomo, Guillermo Dur´an, and //www.sciencedirect.com/science/ Mario Valencia-Pabon. Complexity article/pii/S0304397515006635. of the cluster deletion problem on subclasses of chordal graphs. The- Chiesa:2015:SAN oretical Computer Science, 600(??): [443] Alessandro Chiesa and Zeyuan Allen 59–69, October 4, 2015. CODEN Zhu. Shorter arithmetization of non- TCSCDI. ISSN 0304-3975 (print), deterministic computations. The- 1879-2294 (electronic). URL http: oretical Computer Science, 600(??): //www.sciencedirect.com/science/ 107–131, October 4, 2015. CODEN article/pii/S0304397515005800. TCSCDI. ISSN 0304-3975 (print), Bougeret:2015:IAA 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [440] Marin Bougeret, Pierre-Fran¸cois Du- article/pii/S0304397515006647. tot, Denis Trystram, Klaus Jansen, and Demaine:2015:LTA Christina Robenek. Improved approximation algorithms for scheduling par- [444] Erik D. Demaine, Martin L. De- allel jobs on identical clusters. The- maine, Eli Fox-Epstein, Duc A. Hoang, oretical Computer Science, 600(??): Takehiro Ito, Hirotaka Ono, Yota 70–85, October 4, 2015. CODEN Otachi, Ryuhei Uehara, and Takeshi TCSCDI. ISSN 0304-3975 (print), Yamada. Linear-time algorithm for 1879-2294 (electronic). URL http: sliding tokens on trees. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 600(??):132– article/pii/S0304397515006246. 142, October 4, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Gajser:2015:VTC 1879-2294 (electronic). URL http: [441] David Gajser. Verifying time com- //www.sciencedirect.com/science/ plexity of Turing machines. The- article/pii/S0304397515006829. oretical Computer Science, 600(??): Chiesa:2015:CCT 86–97, October 4, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [445] Marco Chiesa, Giuseppe Di Bat- 1879-2294 (electronic). URL http: tista, Thomas Erlebach, and Mau- //www.sciencedirect.com/science/ rizio Patrignani. Computational article/pii/S0304397515006623. complexity of traﬃc hijacking un- REFERENCES 99

der BGP and S-BGP. Theoreti- Anonymous:2015:EBbp cal Computer Science, 600(??):143– 154, October 4, 2015. CODEN [449] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 601(??): 1879-2294 (electronic). URL http: iii–ix, October 11, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515006830. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ . Renault:2015:OAA article/pii/S0304397515008166 Karhumaki:2015:W [446] Marc P. Renault, Adi Ros´en, and [450] J. Karhum¨aki and L. Zamboni. Words Rob van Stee. Online algorithms 2013. Theoretical Computer Science, with advice for bin packing and 601(??):1, October 11, 2015. CODEN scheduling problems. Theoretical TCSCDI. ISSN 0304-3975 (print), Computer Science, 600(??):155–170, 1879-2294 (electronic). URL http: October 4, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515008233. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Day:2015:PFW article/pii/S0304397515007069. [451] Joel D. Day, Daniel Reidenbach, and Johannes C. Schneider. Pe- Kawahara:2015:ILB riodicity forcing words. Theoret- ical Computer Science, 601(??):2– [447] Jun Kawahara and Koji M. Kobaya- 14, October 11, 2015. CODEN shi. An improved lower bound for TCSCDI. ISSN 0304-3975 (print), one-dimensional online unit clustering. 1879-2294 (electronic). URL http: Theoretical Computer Science, 600(??): //www.sciencedirect.com/science/ 171–173, October 4, 2015. CODEN article/pii/S030439751500780X. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Ernvall:2015:PPC //www.sciencedirect.com/science/ [452] Mari Ernvall, Vesa Halava, and Tero article/pii/S0304397515005654. Harju. On the n-permutation Post Correspondence Problem. Theoret- Du:2015:DSH ical Computer Science, 601(??):15– 20, October 11, 2015. CODEN [448] Ye Du. The discrete sell or hold prob- TCSCDI. ISSN 0304-3975 (print), lem with constraints on asset values. 1879-2294 (electronic). URL http: Theoretical Computer Science, 600(??): //www.sciencedirect.com/science/ 174–179, October 4, 2015. CODEN article/pii/S0304397515006428. TCSCDI. ISSN 0304-3975 (print), Honkala:2015:LTP 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [453] Juha Honkala. Language-theoretic article/pii/S0304397515006659. problems in certain matrix monoids. REFERENCES 100

Theoretical Computer Science, 601(??): 66, October 11, 2015. CODEN 21–28, October 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515006441. article/pii/S030439751500643X. Shur:2015:GSF Harju:2015:SFS [458] Arseny M. Shur. Generating square- [454] Tero Harju and Mike Müller. Square- free words efficiently. Theoreti- free shuffles of words. Theoreti- cal Computer Science, 601(??):67– cal Computer Science, 601(??):29– 72, October 11, 2015. CODEN 38, October 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515006489. article/pii/S0304397515006453. Anonymous:2015:EBbq Rao:2015:SGA [459] Anonymous. Editorial Board. The- [455] Michaël Rao. On some generalizations oretical Computer Science, 602(??): of abelian power avoidability. The- iii–ix, October 18, 2015. CODEN oretical Computer Science, 601(??): TCSCDI. ISSN 0304-3975 (print), 39–46, October 11, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515008348. //www.sciencedirect.com/science/ Weng:2015:NSK article/pii/S0304397515006477. Rigo:2015:AGA [460] Jian Weng, Yunlei Zhao, Robert H. Deng, Shengli Liu, Yanjiang Yang, [456] M. Rigo and P. Salimov. Another gen- and Kouichi Sakurai. A note on eralization of abelian equivalence: Bi- the security of KHL scheme. The- nomial complexity of infinite words. oretical Computer Science, 602(??): Theoretical Computer Science, 601(??): 1–6, October 18, 2015. CODEN 47–57, October 11, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515007070. article/pii/S0304397515006465. Kociumaka:2015:LTV Castiglione:2015:SSW [461] T. Kociumaka, J. Radoszewski, [457] G. Castiglione and M. Sciortino. Stan- W. Rytter, and T. Waleń. Linear- dard Sturmian words and automata time version of Holub’s algorithm for minimization algorithms. Theoret- morphic imprimitivity testing. The- ical Computer Science, 601(??):58– oretical Computer Science, 602(??): REFERENCES 101

7–21, October 18, 2015. CODEN Weisser. Bin packing with frag- TCSCDI. ISSN 0304-3975 (print), mentable items: Presentation and 1879-2294 (electronic). URL http: approximations. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 602(??):50–59, Oc- article/pii/S0304397515007112. tober 18, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), Chitturi:2015:TUB 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [462] Bhadrachalam Chitturi. Tighter up- article/pii/S0304397515007240. per bound for sorting permutations with prefix transpositions. Theoret- Xu:2015:BDR ical Computer Science, 602(??):22– 31, October 18, 2015. CODEN [466] Bojian Xu. Boosting distinct ran- TCSCDI. ISSN 0304-3975 (print), dom sampling for basic counting on 1879-2294 (electronic). URL http: the union of distributed streams. The- //www.sciencedirect.com/science/ oretical Computer Science, 602(??): article/pii/S030439751500715X. 60–79, October 18, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Rautenbach:2015:TGC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [463] Dieter Rautenbach. Two greedy article/pii/S0304397515007586. consequences for maximum induced matchings. Theoretical Computer Liu:2015:GRW Science, 602(??):32–38, October 18, 2015. CODEN TCSCDI. ISSN 0304- [467] Wen An Liu and Meile Zhao. Gen- 3975 (print), 1879-2294 (electronic). eral restrictions of Wythoff-like games. URL http://www.sciencedirect. Theoretical Computer Science, 602(??): com/science/article/pii/S030439751500717380–88,. October 18, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Le:2015:PTR 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [464] Van Bang Le, Andrea Oversberg, and article/pii/S0304397515007616. Oliver Schaudt. Polynomial time recognition of squares of Ptolemaic graphs Faria:2015:ERC and 3-sun-free split graphs. The- [468] Luerbio Faria, Laurent Gourvès, Car- oretical Computer Science, 602(??): los A. Martinhon, and Jérôme Mon- 39–49, October 18, 2015. CODEN not. The edge-recoloring cost of TCSCDI. ISSN 0304-3975 (print), monochromatic and properly edge- 1879-2294 (electronic). URL http: colored paths and cycles. Theoret- //www.sciencedirect.com/science/ ical Computer Science, 602(??):89– article/pii/S0304397515007185. 102, October 18, 2015. CODEN LeCun:2015:PFI TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [465] Bertrand LeCun, Thierry Mautor, //www.sciencedirect.com/science/ Franck Quessette, and Marc-Antoine article/pii/S0304397515007628. REFERENCES 102

Gabay:2015:OSB Chang:2015:DST

[469] Micha¨el Gabay, Vladimir Kotov, and [473] Ching-Lueh Chang. A deterministic Nadia Brauner. Online bin stretch- sublinear-time nonadaptive algorithm ing with bunch techniques. Theoret- for metric 1-median selection. The- ical Computer Science, 602(??):103– oretical Computer Science, 602(??): 113, October 18, 2015. CODEN 149–157, October 18, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751500763X. article/pii/S0304397515007148. Wang:2015:ODC Calamoneri:2015:CPC [470] Haitao Wang and Jingru Zhang. [474] T. Calamoneri and R. Petreschi. Cor- One-dimensional k-center on un- rigendum to “On pairwise compati- certain data. Theoretical Com- bility graphs having Dilworth num- puter Science, 602(??):114–124, Oc- ber two” [Theoret. Comput. Sci. 524 tober 18, 2015. CODEN TC- (2014) 34–40]. Theoretical Com- SCDI. ISSN 0304-3975 (print), puter Science, 602(??):158–159, Oc- 1879-2294 (electronic). URL http: tober 18, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), . article/pii/S0304397515007641 1879-2294 (electronic). URL http: Kuo:2015:PBF //www.sciencedirect.com/science/ article/pii/S0304397515007677. See [471] Che-Nan Kuo. Pancyclicity and bi- [4]. pancyclicity of folded hypercubes with both vertex and edge faults. The- Anonymous:2015:EBbr oretical Computer Science, 602(??): 125–131, October 18, 2015. CODEN [475] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 603(??): 1879-2294 (electronic). URL http: iii–ix, October 25, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515007653. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Hung:2015:HPS article/pii/S0304397515008610. [472] Ruo-Wei Hung, Chih-Chia Yao, and Ong:2015:LLI Shang-Ju Chan. The Hamiltonian properties of supergrid graphs. The- [476] Luke Ong and Ruy J. G. B. de Queiroz. oretical Computer Science, 602(??): Logic, Language, Information and 132–148, October 18, 2015. CODEN Computation (WoLLIC 2012). The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 603(??): 1879-2294 (electronic). URL http: 1–2, October 25, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515007719. 1879-2294 (electronic). URL http: REFERENCES 103

//www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515006325. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Abriola:2015:LWQ article/pii/S0304397515006362. [477] Sergio Abriola, Santiago Figueira, and Gabriel Senno. Linearizing Caleiro:2015:BSG well quasi-orders and bounding the length of bad sequences. Theo- [481] Carlos Caleiro, João Marcos, and retical Computer Science, 603(??): Marco Volpe. Bivalent semantics, 3–22, October 25, 2015. CODEN generalized compositionality and an- TCSCDI. ISSN 0304-3975 (print), alytic classic-like tableaux for finite- 1879-2294 (electronic). URL http: valued logics. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 603(??):84–110, Oc- article/pii/S0304397515006337. tober 25, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), Asperti:2015:FMT 1879-2294 (electronic). URL http: [478] Andrea Asperti and Wilmer Ric- //www.sciencedirect.com/science/ ciotti. A formalization of multi- article/pii/S0304397515006374. tape Turing machines. Theoreti- cal Computer Science, 603(??):23– Link:2015:FPR 42, October 25, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [482] Sebastian Link. Frontiers for propo- 1879-2294 (electronic). URL http: sitional reasoning about fragments //www.sciencedirect.com/science/ of probabilistic conditional indepen- article/pii/S0304397515006349. dence and hierarchical database decompositions. Theoretical Com- Baldi:2015:UPS puter Science, 603(??):111–131, Oc- [479] Paolo Baldi and Agata Ciabattoni. tober 25, 2015. CODEN TC- Uniform proofs of standard complete- SCDI. ISSN 0304-3975 (print), ness for extensions of first-order MTL. 1879-2294 (electronic). URL http: Theoretical Computer Science, 603(??): //www.sciencedirect.com/science/ 43–57, October 25, 2015. CODEN article/pii/S0304397515006386. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Schechter:2015:LPJ //www.sciencedirect.com/science/ article/pii/S0304397515006350. [483] L. Menasché Schechter. A logic Bozzelli:2015:COA of plausible justifications. Theoret- ical Computer Science, 603(??):132– [480] Laura Bozzelli, Hans van Ditmarsch, 145, October 25, 2015. CODEN and Sophie Pinchinat. The complex- TCSCDI. ISSN 0304-3975 (print), ity of one-agent refinement modal logic. 1879-2294 (electronic). URL http: Theoretical Computer Science, 603(??): //www.sciencedirect.com/science/ 58–83, October 25, 2015. CODEN article/pii/S0304397515006398. REFERENCES 104

Anonymous:2015:EBbs ical Computer Science, 604(??):46– 62, November 2, 2015. CODEN [484] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 604(??): 1879-2294 (electronic). URL http: iii–ix, November 2, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515006416. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ TranconyWidemann:2015:ACR article/pii/S0304397515008865. [489] B. Tranc´on y Widemann and M. Hauhs. Bonsangue:2015:P Algebraic-coalgebraic recursion theory of history-dependent dynami- [485] Marcello Bonsangue. Preface. The- cal system models. Theoretical oretical Computer Science, 604(??): Computer Science, 604(??):63–80, 1, November 2, 2015. CODEN November 2, 2015. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515006842. article/pii/S030439751500568X. Hasuo:2015:GWP Myers:2015:CCC

[486] Ichiro Hasuo. Generic weakest [490] Robert S. R. Myers, Jir´ı Ad´amek, precondition semantics from mon- Stefan Milius, and Henning Urbat. ads enriched with order. Theo- Coalgebraic constructions of canoni- retical Computer Science, 604(??):2– cal nondeterministic automata. The- 29, November 2, 2015. CODEN oretical Computer Science, 604(??): TCSCDI. ISSN 0304-3975 (print), 81–101, November 2, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515002947. //www.sciencedirect.com/science/ Jacobs:2015:DHM article/pii/S0304397515002625.

[487] Bart Jacobs. Dijkstra and Hoare mon- Bonchi:2015:KED ads in monadic computation. The- [491] Filippo Bonchi, Stefan Milius, Alexan- oretical Computer Science, 604(??): dra Silva, and Fabio Zanasi. Killing 30–45, November 2, 2015. CODEN epsilons with a dagger: a coal- TCSCDI. ISSN 0304-3975 (print), gebraic study of systems with al- 1879-2294 (electronic). URL http: gebraic label structure. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 604(??):102– article/pii/S0304397515002364. 126, November 2, 2015. CODEN Lenisa:2015:MSC TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [488] Marina Lenisa. Multigames and //www.sciencedirect.com/science/ strategies, coalgebraically. Theoret- article/pii/S0304397515002406. REFERENCES 105

Anonymous:2015:EBbt //www.sciencedirect.com/science/ article/pii/S0304397515003151. [492] Anonymous. Editorial Board. The- oretical Computer Science, 605(??): Bender:2015:MBP iii–ix, November 9, 2015. CODEN [496] Michael A. Bender, Sándor P. Fekete, TCSCDI. ISSN 0304-3975 (print), Alexander Kröller, Vincenzo Libera- 1879-2294 (electronic). URL http: tore, Joseph S. B. Mitchell, Valentin //www.sciencedirect.com/science/ Polishchuk, and Jukka Suomela. The article/pii/S0304397515009056. minimum backlog problem. The- Kempka:2015:DAD oretical Computer Science, 605(??): 51–61, November 9, 2015. CODEN [493] Joseph Kempka, Phil McMinn, and TCSCDI. ISSN 0304-3975 (print), Dirk Sudholt. Design and analysis of 1879-2294 (electronic). URL http: different alternating variable searches //www.sciencedirect.com/science/ for search-based software testing. The- article/pii/S0304397515007744. oretical Computer Science, 605(??): 1–20, November 9, 2015. CODEN Holzer:2015:CPC TCSCDI. ISSN 0304-3975 (print), [497] Andreas Holzer, Christian Schallhart, 1879-2294 (electronic). URL http: Michael Tautschnig, and Helmut Veith. //www.sciencedirect.com/science/ Closure properties and complexity of article/pii/S0304397514009979. rational sets of regular languages. The- Oliveto:2015:ITC oretical Computer Science, 605(??): 62–79, November 9, 2015. CODEN [494] Pietro S. Oliveto and Carsten Witt. TCSCDI. ISSN 0304-3975 (print), Improved time complexity analysis of 1879-2294 (electronic). URL http: the Simple Genetic Algorithm. The- //www.sciencedirect.com/science/ oretical Computer Science, 605(??): article/pii/S0304397515007823. 21–41, November 9, 2015. CODEN Klein:2015:LSC TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [498] Rolf Klein, David Kriesel, and El- //www.sciencedirect.com/science/ mar Langetepe. A local strategy article/pii/S0304397515000298. for cleaning expanding cellular domains by simple robots. Theoret- Akimoto:2015:ARO ical Computer Science, 605(??):80– [495] Youhei Akimoto, Sandra Astete- 94, November 9, 2015. CODEN Morales, and Olivier Teytaud. Anal- TCSCDI. ISSN 0304-3975 (print), ysis of runtime of optimization al- 1879-2294 (electronic). URL http: gorithms for noisy functions over //www.sciencedirect.com/science/ discrete codomains. Theoretical article/pii/S0304397515007835. Computer Science, 605(??):42–50, Krzywdzinski:2015:DAR November 9, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), [499] K. Krzywdziński and K. Rybarczyk. 1879-2294 (electronic). URL http: Distributed algorithms for random REFERENCES 106

graphs. Theoretical Computer Sci- Biswas:2015:DTC ence, 605(??):95–105, November 9, 2015. CODEN TCSCDI. ISSN 0304- [503] Ranita Biswas and Partha Bhowmick. 3975 (print), 1879-2294 (electronic). On diﬀerent topological classes of URL http://www.sciencedirect. spherical geodesic paths and circles com/science/article/pii/S0304397515007847in. Z3. Theoretical Computer Sci- ence, 605(??):146–163, November 9, Bang:2015:RLB 2015. CODEN TCSCDI. ISSN 0304- [500] Lucas Bang, Wolfgang Bein, and 3975 (print), 1879-2294 (electronic). Lawrence L. Larmore. R-LINE: URL http://www.sciencedirect. a better randomized 2-server al- com/science/article/pii/S0304397515007938. gorithm on the line. Theoreti- Anonymous:2015:EBbu cal Computer Science, 605(??):106– 118, November 9, 2015. CODEN [504] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 606(??): 1879-2294 (electronic). URL http: iii–ix, November 16, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515007902. 1879-2294 (electronic). URL http: Floderus:2015:ISI //www.sciencedirect.com/science/ article/pii/S0304397515009251. [501] Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, and Eva-Marta Lun- Finger:2015:SIS dell. Induced subgraph isomorphism: Are some patterns substan- [505] Marcelo Finger and Delia Kesner. Spe- tially easier than others? Theoret- cial issue: Selected papers of the 7th ical Computer Science, 605(??):119– and 8th workshops on Logical and Se- 128, November 9, 2015. CODEN mantic Frameworks with Applications TCSCDI. ISSN 0304-3975 (print), (LSFA). Theoretical Computer Science, 1879-2294 (electronic). URL http: 606(??):1, November 16, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515007914. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ DEmidio:2015:ERG article/pii/S0304397515009329.

[502] Mattia D’Emidio, Daniele Frigioni, Accattoli:2015:PNC and Alfredo Navarra. Explore and repair graphs with black holes us- [506] Beniamino Accattoli. Proof nets and ing mobile entities. Theoretical the call-by-value λ-calculus. Theo- Computer Science, 605(??):129–145, retical Computer Science, 606(??):2– November 9, 2015. CODEN TC- 24, November 16, 2015. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515007926. article/pii/S0304397515007264. REFERENCES 107

Areces:2015:SB Olarte:2015:SCC

[507] Carlos Areces and Ezequiel Orbe. [511] Carlos Olarte, Elaine Pimentel, and Symmetric blocking. Theoretical Vivek Nigam. Subexponential concur- Computer Science, 606(??):25–41, rent constraint programming. Theo- November 16, 2015. CODEN TC- retical Computer Science, 606(??):98– SCDI. ISSN 0304-3975 (print), 120, November 16, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515005307. //www.sciencedirect.com/science/ article/pii/S0304397515005411. Carnielli:2015:MPR Anonymous:2015:EBbv [508] Walter Carnielli and Mariana Mat- ulovic. The method of polynomial ring [512] Anonymous. Editorial Board. Theoreti- calculus and its potentialities. The- cal Computer Science, 607 (part 1)(??): oretical Computer Science, 606(??): iii–ix, November 23, 2015. CODEN 42–56, November 16, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515009548. article/pii/S0304397515004193. Gu:2015:P Ciaﬀaglione:2015:MTE [513] Qianping Gu, Pavol Hell, and Bot- [509] Alberto Ciaﬀaglione and Ivan Scagnetto. ing Yang. Preface. Theoretical Mechanizing type environments in Computer Science, 607 (part 1)(??): weak HOAS. Theoretical Com- 1, November 23, 2015. CODEN puter Science, 606(??):57–78, Novem- TCSCDI. ISSN 0304-3975 (print), ber 16, 2015. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515009615. //www.sciencedirect.com/science/ article/pii/S0304397515006404. Higashikawa:2015:MSL

DAgostino:2015:IVC [514] Yuya Higashikawa, Mordecai J. Golin, and Naoki Katoh. Multi- [510] Marcello D’Agostino. An informa- ple sink location problems in dy- tional view of classical logic. The- namic path networks. Theoretical oretical Computer Science, 606(??): Computer Science, 607 (part 1)(??): 79–97, November 16, 2015. CODEN 2–15, November 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515005678. article/pii/S0304397515005186. REFERENCES 108

Bredereck:2015:CDA traction. Theoretical Computer Sci- ence, 607 (part 1)(??):60–67, Novem- [515] Robert Bredereck, Vincent Froese, ber 23, 2015. CODEN TC- Sepp Hartung, André Nichterlein, Rolf SCDI. ISSN 0304-3975 (print), Niedermeier, and Nimrod Talmon. The 1879-2294 (electronic). URL http: complexity of degree anonymization //www.sciencedirect.com/science/ by vertex addition. Theoretical Com- article/pii/S0304397515001693. puter Science, 607 (part 1)(??):16– 34, November 23, 2015. CODEN Hon:2015:ECC TCSCDI. ISSN 0304-3975 (print), [519] Wing-Kai Hon, Ton Kloks, Hsiang- 1879-2294 (electronic). URL http: Hsuan Liu, and Yue-Li Wang. Edge- //www.sciencedirect.com/science/ clique covers of the tensor prod- article/pii/S0304397515006258. uct. Theoretical Computer Sci- Chin:2015:CAU ence, 607 (part 1)(??):68–74, Novem- ber 23, 2015. CODEN TC- [516] Francis Y. L. Chin, Bin Fu, Jiuling SCDI. ISSN 0304-3975 (print), Guo, Shuguang Han, Jueliang Hu, 1879-2294 (electronic). URL http: Minghui Jiang, Guohui Lin, Hing- //www.sciencedirect.com/science/ Fung Ting, Luping Zhang, Yong article/pii/S0304397515005320. Zhang, and Diwei Zhou. Com- petitive algorithms for unbounded Luo:2015:SOH one-way trading. Theoretical Com- [520] Taibo Luo and Yinfeng Xu. Semi- puter Science, 607 (part 1)(??):35– online hierarchical load balancing 48, November 23, 2015. CODEN problem with bounded processing TCSCDI. ISSN 0304-3975 (print), times. Theoretical Computer Sci- 1879-2294 (electronic). URL http: ence, 607 (part 1)(??):75–82, Novem- //www.sciencedirect.com/science/ ber 23, 2015. CODEN TC- . article/pii/S0304397515004752 SCDI. ISSN 0304-3975 (print), Cai:2015:PCF 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [517] Leizhen Cai and Junjie Ye. Param- article/pii/S0304397515003266. eterized complexity of finding connected induced subgraphs. Theoreti- Penso:2015:CAC cal Computer Science, 607 (part 1)(??): [521] Lucia Draque Penso, Fábio Protti, Di- 49–59, November 23, 2015. CODEN eter Rautenbach, and Uéverton dos TCSCDI. ISSN 0304-3975 (print), Santos Souza. Complexity analysis 1879-2294 (electronic). URL http: of P3-convexity problems on bounded- //www.sciencedirect.com/science/ degree and planar graphs. Theoreti- article/pii/S0304397515004247. cal Computer Science, 607 (part 1)(??): Guo:2015:OSG 83–95, November 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [518] Chengwei Guo and Leizhen Cai. Ob- 1879-2294 (electronic). URL http: taining split graphs by edge con- //www.sciencedirect.com/science/ REFERENCES 109

article/pii/S0304397515008749. See 1879-2294 (electronic). URL http: corrigendum [1486]. //www.sciencedirect.com/science/ article/pii/S0304397515009755. Brass:2015:LEB Chen:2015:CMM [522] Peter Brass, Hyeon-Suk Na, and Chan- Su Shin. Local event boundary detec- [526] Danny Z. Chen, David Craft, and tion with unreliable sensors: Analysis Lin Yang. A circular matrix- of the majority vote scheme. Theoreti- merging algorithm with application cal Computer Science, 607 (part 1)(??): in Volumetric Intensity-Modulated 96–112, November 23, 2015. CODEN Arc Therapy. Theoretical Com- TCSCDI. ISSN 0304-3975 (print), puter Science, 607 (part 2)(??):126– 1879-2294 (electronic). URL http: 134, November 23, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751500626X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Biswas:2015:AFE article/pii/S0304397515003710.

[523] Tamal T. Biswas and Kenneth W. Re- Dereniowski:2015:CZV gan. Approximation of function evalu- [527] Dariusz Dereniowski, Danny Dyer, ation over sequence arguments via spe- Ryan M. Tifenbach, and Boting cialized data structures. Theoretical Yang. The complexity of zero-visibility Computer Science, 607 (part 1)(??): cops and robber. Theoretical Com- 113–123, November 23, 2015. CODEN puter Science, 607 (part 2)(??):135– TCSCDI. ISSN 0304-3975 (print), 148, November 23, 2015. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515003114. //www.sciencedirect.com/science/ Anonymous:2015:EBbw article/pii/S0304397515002388. Hossain:2015:GST [524] Anonymous. Editorial Board. Theoreti- cal Computer Science, 607 (part 2)(??): [528] Md. Iqbal Hossain and Md. Saidur iii–ix, November 23, 2015. CODEN Rahman. Good spanning trees in TCSCDI. ISSN 0304-3975 (print), graph drawing. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 607 (part 2)(??):149– //www.sciencedirect.com/science/ 165, November 23, 2015. CODEN article/pii/S0304397515009688. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Chen:2015:FA //www.sciencedirect.com/science/ [525] Jianer Chen and John E. Hopcroft. article/pii/S030439751500794X. Frontiers of algorithmics. Theoretical Jiang:2015:FAS Computer Science, 607 (part 2)(??): 125, November 23, 2015. CODEN [529] Haitao Jiang, Lusheng Wang, Binhai TCSCDI. ISSN 0304-3975 (print), Zhu, and Daming Zhu. A factor- REFERENCES 110

(1.408 + ) approximation for sort- //www.sciencedirect.com/science/ ing unsigned genomes by recipro- article/pii/S0304397515007082. cal translocations. Theoretical Com- Shi:2015:ROI puter Science, 607 (part 2)(??):166– 180, November 23, 2015. CODEN [533] Yangguang Shi, Fa Zhang, Jie Wu, TCSCDI. ISSN 0304-3975 (print), and Zhiyong Liu. Randomized obliv- 1879-2294 (electronic). URL http: ious integral routing for minimiz- //www.sciencedirect.com/science/ ing power cost. Theoretical Com- article/pii/S030439751500479X. puter Science, 607 (part 2)(??):221– Li:2015:PCC 246, November 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [530] Weidong Li, Jianping Li, Xuejie Zhang, 1879-2294 (electronic). URL http: and Zhibin Chen. Penalty cost con- //www.sciencedirect.com/science/ strained identical parallel machine article/pii/S0304397515006283. scheduling problem. Theoretical Com- Ting:2015:NOA puter Science, 607 (part 2)(??):181– 192, November 23, 2015. CODEN [534] H. F. Ting and Xiangzhong Xiang. TCSCDI. ISSN 0304-3975 (print), Near optimal algorithms for online 1879-2294 (electronic). URL http: maximum edge-weighted b-matching //www.sciencedirect.com/science/ and two-sided vertex-weighted b- article/pii/S0304397515008786. matching. Theoretical Computer Science, 607 (part 2)(??):247–256, Lin:2015:IES November 23, 2015. CODEN TC- [531] Ling Lin, Xiaochen Xian, Yujie Yan, SCDI. ISSN 0304-3975 (print), Xing He, and Zhiyi Tan. Ineﬃciency 1879-2294 (electronic). URL http: of equilibria for scheduling game with //www.sciencedirect.com/science/ machine activation costs. Theoretical article/pii/S0304397515004739. , 607 (part 2)(??): Computer Science You:2015:KPA 193–207, November 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [535] Jie You, Jianxin Wang, Qilong Feng, 1879-2294 (electronic). URL http: and Feng Shi. Kernelization and pa- //www.sciencedirect.com/science/ rameterized algorithms for covering a article/pii/S0304397515004764. tree by a set of stars or paths. Theoreti- cal Computer Science, 607 (part 2)(??): Obata:2015:EAA 257–270, November 23, 2015. CODEN [532] Yuji Obata and Takao Nishizeki. Ef- TCSCDI. ISSN 0304-3975 (print), ﬁcient approximation algorithms for 1879-2294 (electronic). URL http: bandwidth consecutive multicolor- //www.sciencedirect.com/science/ ings of graphs. Theoretical Com- article/pii/S030439751500540X. puter Science, 607 (part 2)(??):208– Anonymous:2015:EBbx 220, November 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [536] Anonymous. Editorial Board. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 607 (part 3)(??): REFERENCES 111

iii–ix, November 23, 2015. CODEN positive or negative weights. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 607 (part 3)(??): 1879-2294 (electronic). URL http: 296–305, November 23, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751500986X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Zhang:2015:P article/pii/S0304397515007720. [537] Zhao Zhang, Lidong Wu, and Ding- Seo:2015:CCF Zhu Du. Preface. Theoretical Computer Science, 607 (part 3)(??): [541] Jungtaek Seo, Subhankar Mishra, Xi- 271, November 23, 2015. CODEN ang Li, and My T. Thai. Catas- TCSCDI. ISSN 0304-3975 (print), trophic cascading failures in power 1879-2294 (electronic). URL http: networks. Theoretical Computer //www.sciencedirect.com/science/ Science, 607 (part 3)(??):306–319, article/pii/S0304397515009937. November 23, 2015. CODEN TC- SCDI. ISSN 0304-3975 (print), Guo:2015:OTM 1879-2294 (electronic). URL http: [538] Sicen Guo, Minming Li, and Yingchao //www.sciencedirect.com/science/ Zhao. Optimal trees for min- article/pii/S0304397515007689. imizing average individual updat- Chang:2015:CF ing cost. Theoretical Computer Science, 607 (part 3)(??):272–281, [542] Yi-Jun Chang and Hsu-Chun Yen. November 23, 2015. CODEN TC- Constrained ﬂoorplans in 2D and SCDI. ISSN 0304-3975 (print), 3D. Theoretical Computer Science, 1879-2294 (electronic). URL http: 607 (part 3)(??):320–336, Novem- //www.sciencedirect.com/science/ ber 23, 2015. CODEN TC- article/pii/S030439751500777X. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL Kanj:2015:PST http: //www.sciencedirect.com/science/ [539] Iyad Kanj and Stefan Szeider. Pa- article/pii/S0304397515007227. rameterized and subexponential-time Ito:2015:OBG complexity of satisﬁability problems and applications. Theoretical Com- [543] Yoshihiko Ito, Yuki Kobayashi, Yuya puter Science, 607 (part 3)(??):282– Higashikawa, Naoki Katoh, Sheung- 295, November 23, 2015. CODEN Hung Poon, and Maria Saumell. TCSCDI. ISSN 0304-3975 (print), Optimally bracing grid frameworks 1879-2294 (electronic). URL http: with holes. Theoretical Computer //www.sciencedirect.com/science/ Science, 607 (part 3)(??):337–350, article/pii/S0304397515007768. November 23, 2015. CODEN TC- Zhou:2015:TPL SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [540] Jianjie Zhou, Liying Kang, and Erfang //www.sciencedirect.com/science/ Shan. Two paths location of a tree with article/pii/S0304397515007215. REFERENCES 112

Armaselu:2015:AFP puter Science, 607 (part 3)(??):391– 410, November 23, 2015. CODEN [544] Bogdan Armaselu and Ovidiu Daescu. TCSCDI. ISSN 0304-3975 (print), Algorithms for fair partitioning of 1879-2294 (electronic). URL http: convex polygons. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 607 (part 3)(??):351– article/pii/S0304397515007094. 362, November 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Bhattacharya:2015:IAC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [548] Binay Bhattacharya and Tsunehiko article/pii/S0304397515007203. Kameda. Improved algorithms for computing minmax regret sinks on dynamic Gao:2015:BAC path and tree networks. Theoretical Computer Science, 607 (part 3)(??): [545] Xiaofeng Gao, Jun Li, and Guihai 411–425, November 23, 2015. CODEN Chen. A better approximation for con- TCSCDI. ISSN 0304-3975 (print), structing virtual backbone in 3D wire- 1879-2294 (electronic). URL http: less ad-hoc networks. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 607 (part 3)(??):363– article/pii/S0304397515006301. 380, November 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Abu-Khzam:2015:PCD 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [549] Faisal N. Abu-Khzam, Judith Egan, article/pii/S0304397515007197. Michael R. Fellows, Frances A. Rosa- mond, and Peter Shaw. On the pa- He:2015:AAT rameterized complexity of dynamic [546] Zaobo He, Zhipeng Cai, Siyao Cheng, problems. Theoretical Computer and Xiaoming Wang. Approxi- Science, 607 (part 3)(??):426–434, mate aggregation for tracking quan- November 23, 2015. CODEN TC- tiles and range countings in wireless SCDI. ISSN 0304-3975 (print), sensor networks. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 607 (part 3)(??):381– //www.sciencedirect.com/science/ 390, November 23, 2015. CODEN article/pii/S0304397515005630. TCSCDI. ISSN 0304-3975 (print), Kjos-Hanssen:2015:KSF 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [550] Bjørn Kjos-Hanssen. Kolmogorov article/pii/S0304397515007124. structure functions for automatic Duan:2015:IEO complexity. Theoretical Computer Science, 607 (part 3)(??):435–445, [547] Zhenhua Duan, Jin Liu, Jie Li, and November 23, 2015. CODEN TC- Cong Tian. Improved even order magic SCDI. ISSN 0304-3975 (print), square construction algorithms and 1879-2294 (electronic). URL http: their applications in multi-user shared //www.sciencedirect.com/science/ electronic accounts. Theoretical Com- article/pii/S0304397515005174. REFERENCES 113

Chen:2015:ACS Computer Science, 607 (part 3)(??): 480–487, November 23, 2015. CODEN [551] Lin Chen, Deshi Ye, and Guochuan TCSCDI. ISSN 0304-3975 (print), Zhang. An asymptotic competi- 1879-2294 (electronic). URL http: tive scheme for online bin pack- //www.sciencedirect.com/science/ ing. Theoretical Computer Science, article/pii/S0304397515005083. 607 (part 3)(??):446–454, Novem- ber 23, 2015. CODEN TC- Anonymous:2015:EBby SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [555] Anonymous. Editorial Board. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 608 (part 1)(??): article/pii/S0304397515005150. iii–ix, December 10, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Kanj:2015:IPE 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [552] Iyad Kanj, Guohui Lin, Tian Liu, article/pii/S0304397515009986. Weitian Tong, Ge Xia, Jinhui Xu, Bot- ing Yang, Fenghui Zhang, Peng Zhang, Anonymous:2015:EBbz and Binhai Zhu. Improved parameterized and exact algorithms for cut [556] Anonymous. Editorial Board. Theoreti- problems on trees. Theoretical Com- cal Computer Science, 608 (part 2)(??): puter Science, 607 (part 3)(??):455– iii–ix, December 10, 2015. CODEN 470, November 23, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515010221. article/pii/S0304397515005125. Anonymous:2015:EBca Song:2015:SCF [557] Anonymous. Editorial Board. Theoreti- [553] Liang Song, Haibin Chen, Hao Gu, cal Computer Science, 608 (part 3)(??): Hejiao Huang, and Hongwei Du. Set iii–ix, December 10, 2015. CODEN covering in fuel-considered vehicle TCSCDI. ISSN 0304-3975 (print), routing problems. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 607 (part 3)(??):471– //www.sciencedirect.com/science/ 479, November 23, 2015. CODEN article/pii/S030439751501035X. TCSCDI. ISSN 0304-3975 (print), Kari:2015:Ec 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [558] Lila Kari. Editorial. Theoretical article/pii/S0304397515005113. Computer Science, 608 (part 1)(??): Li:2015:PCN 1, December 10, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [554] Xueliang Li, Meiqin Wei, and Jun Yue. 1879-2294 (electronic). URL http: Proper connection number and con- //www.sciencedirect.com/science/ nected dominating sets. Theoretical article/pii/S0304397515010063. REFERENCES 114

Merelli:2015:CSB 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [559] Emanuela Merelli and Ion Petre. article/pii/S0304397515007859. From computer science to biology and back. Theoretical Computer Barbuti:2015:MPS Science, 608 (part 1)(??):2–3, De- cember 10, 2015. CODEN TC- [563] Roberto Barbuti, Pasquale Bove, Paolo SCDI. ISSN 0304-3975 (print), Milazzo, and Giovanni Pardini. Mini- 1879-2294 (electronic). URL http: mal probabilistic P systems for mod- //www.sciencedirect.com/science/ elling ecological systems. Theoretical article/pii/S0304397515010051. Computer Science, 608 (part 1)(??): 36–56, December 10, 2015. CODEN Ehrenfeucht:2015:SOZ TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [560] Andrzej Ehrenfeucht and Grzegorz //www.sciencedirect.com/science/ Rozenberg. Standard and ordered article/pii/S0304397515006805. zoom structures. Theoretical Com- puter Science, 608 (part 1)(??):4– Macias-Ramos:2015:MFV 15, December 10, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), [564] Luis F. Mac´ıas-Ramos, Mario J. 1879-2294 (electronic). URL http: Pérez-Jiménez, Agust´ın Riscos-Núñez, //www.sciencedirect.com/science/ and Luis Valencia-Cabrera. Mem- article/pii/S0304397515006854. brane fission versus cell division: When membrane proliferation is not Dennunzio:2015:ADG enough. Theoretical Computer Sci- [561] Alberto Dennunzio, Enrico Formenti, ence, 608 (part 1)(??):57–65, De- Luca Manzoni, and Antonio E. Por- cember 10, 2015. CODEN TC- reca. Ancestors, descendants, and SCDI. ISSN 0304-3975 (print), gardens of Eden in reaction sys- 1879-2294 (electronic). URL http: tems. Theoretical Computer Sci- //www.sciencedirect.com/science/ ence, 608 (part 1)(??):16–26, De- article/pii/S0304397515005356. cember 10, 2015. CODEN TC- Folschette:2015:SCR SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [565] Maxime Folschette, Lo¨ıc Paulevé, //www.sciencedirect.com/science/ Morgan Magnin, and Olivier Roux. article/pii/S0304397515005009. Sufficient conditions for reachabil- Brijder:2015:RFG ity in automata networks with priorities. Theoretical Computer Sci- [562] Robert Brijder. Recombination faults ence, 608 (part 1)(??):66–83, De- in gene assembly in ciliates modeled cember 10, 2015. CODEN TC- using multimatroids. Theoretical Com- SCDI. ISSN 0304-3975 (print), puter Science, 608 (part 1)(??):27– 1879-2294 (electronic). URL http: 35, December 10, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515007872. REFERENCES 115

Zaccagnino:2015:TDC ence, 608 (part 2)(??):119, De- cember 10, 2015. CODEN TC- [566] Rocco Zaccagnino, Rosalba Zizza, SCDI. ISSN 0304-3975 (print), and Carlo Zottoli. Testing DNA 1879-2294 (electronic). URL http: code words properties of regular lan- //www.sciencedirect.com/science/ guages. Theoretical Computer Sci- article/pii/S0304397515008531. ence, 608 (part 1)(??):84–97, De- cember 10, 2015. CODEN TC- Bannoura:2015:WDS SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [570] Amir Bannoura, Christian Ortolf, article/pii/S0304397515007811. Leonhard Reindl, and Christian Schin- delhauer. The wake up dominat- Hrydziuszko:2015:MAT ing set problem. Theoretical Com- puter Science, 608 (part 2)(??):120– [567] Olga Hrydziuszko, Joanna Balbus, 134, December 10, 2015. CODEN Magdalena Zulpo, Artur Wrona, and TCSCDI. ISSN 0304-3975 (print), Krystian Kubica. Mathematical anal- 1879-2294 (electronic). URL http: yses of two-compartment model of hu- //www.sciencedirect.com/science/ man cholesterol circulatory transport article/pii/S030439751500033X. in application to high blood cholesterol prevention, diagnosis and treatment. Theoretical Computer Sci- Miller:2015:CNL ence, 608 (part 1)(??):98–107, De- cember 10, 2015. CODEN TC- [571] Avery Miller. On the complex- SCDI. ISSN 0304-3975 (print), ity of neighbourhood learning in ra- 1879-2294 (electronic). URL http: dio networks. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 608 (part 2)(??):135– article/pii/S0304397515007136. 145, December 10, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Paun:2015:SMI 1879-2294 (electronic). URL http: [568] Mihaela Paun, Yang Li, Yuan Cheng, //www.sciencedirect.com/science/ Iris Tusa, and Andrei Paun. Seg- article/pii/S0304397515003709. menting microarray images using a contour-based method. Theoretical Sharma:2015:ONN Computer Science, 608 (part 1)(??): 108–118, December 10, 2015. CODEN [572] Gokarna Sharma and Costas Busch. TCSCDI. ISSN 0304-3975 (print), Optimal nearest neighbor queries in 1879-2294 (electronic). URL http: sensor networks. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 608 (part 2)(??):146– article/pii/S0304397515006817. 165, December 10, 2015. CODEN TCSCDI. ISSN 0304-3975 (print), Flocchini:2015:P 1879-2294 (electronic). URL http: [569] Paola Flocchini and Jie Gao. Pref- //www.sciencedirect.com/science/ ace. Theoretical Computer Sci- article/pii/S0304397515003977. REFERENCES 116

Tonoyan:2015:CGS Czyzowicz:2015:BPW

[573] Tigran Tonoyan. Conflict graphs [577] Jurek Czyzowicz, Leszek Gasieniec, and the SINR-capacity of the mean Konstantinos Georgiou, Evangelos power scheme. Theoretical Com- Kranakis, and Fraser MacQuarrie. The puter Science, 608 (part 2)(??):166– Beachcombers’ Problem: Walking and 177, December 10, 2015. CODEN searching with mobile robots. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 608 (part 3)(??): 1879-2294 (electronic). URL http: 201–218, December 10, 2015. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515000675. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Ortolf:2015:SPU article/pii/S0304397515008269. [574] Christian Ortolf and Christian Schin- Dereniowski:2015:RHM delhauer. Strategies for parallel un- [578] Dariusz Dereniowski, Ralf Klasing, aware cleaners. Theoretical Com- Adrian Kosowski, andLukasz Kuszner. puter Science, 608 (part 2)(??):178– Rendezvous of heterogeneous mo- 189, December 10, 2015. CODEN bile agents in edge-weighted net- TCSCDI. ISSN 0304-3975 (print), works. Theoretical Computer Sci- 1879-2294 (electronic). URL http: ence, 608 (part 3)(??):219–230, De- //www.sciencedirect.com/science/ cember 10, 2015. CODEN TC- article/pii/S0304397515008555. SCDI. ISSN 0304-3975 (print), Miller:2015:FRA 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [575] Avery Miller and Andrzej Pelc. Fast article/pii/S0304397515005204. rendezvous with advice. Theoretical Computer Science, 608 (part 2)(??): Bampas:2015:IPD 190–198, December 10, 2015. CODEN [579] Evangelos Bampas, Nikos Leonardos, TCSCDI. ISSN 0304-3975 (print), Euripides Markou, Aris Pagourtzis, 1879-2294 (electronic). URL http: and Matoula Petrolia. Improved pe- //www.sciencedirect.com/science/ riodic data retrieval in asynchronous article/pii/S0304397515008543. rings with a faulty host. Theoretical Halldorsson:2015:GES Computer Science, 608 (part 3)(??): 231–254, December 10, 2015. CODEN [576] Magnús M. Halldórsson. Guest edito- TCSCDI. ISSN 0304-3975 (print), rial: Structural information and com- 1879-2294 (electronic). URL http: munication complexity. Theoretical //www.sciencedirect.com/science/ Computer Science, 608 (part 3)(??): article/pii/S0304397515008488. 199–200, December 10, 2015. CODEN Emek:2015:HMA TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [580] Yuval Emek, Tobias Langner, David //www.sciencedirect.com/science/ Stolz, Jara Uitto, and Roger Watten- article/pii/S0304397515010373. hofer. How many ants does it take REFERENCES 117

to find the food? Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 608 (part 3)(??):255– //www.sciencedirect.com/science/ 267, December 10, 2015. CODEN article/pii/S0304397515010701. TCSCDI. ISSN 0304-3975 (print), vanIersel:2016:STP 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [585] Leo van Iersel, Steven Kelk, Nela article/pii/S0304397515005198. Lekić, and Simone Linz. Satisfy- Hegeman:2015:LCC ing ternary permutation constraints by multiple linear orders or phy- [581] James W. Hegeman and Sriram V. logenetic trees. Theoretical Com- Pemmaraju. Lessons from the Con- puter Science, 609 (part 1)(??):1– gested Clique applied to MapRe- 21, January 4, 2016. CODEN duce. Theoretical Computer Sci- TCSCDI. ISSN 0304-3975 (print), ence, 608 (part 3)(??):268–281, De- 1879-2294 (electronic). URL http: cember 10, 2015. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397515005319. 1879-2294 (electronic). URL http: Lin:2016:RMN //www.sciencedirect.com/science/ article/pii/S0304397515008695. [586] Bey-Chi Lin and Chin-Tau Lea. Anonymous:2016:EBa Repackable multi-log2 N networks. Theoretical Computer Science, 609 [582] Anonymous. Editorial Board. Theo- (part 1)(??):22–31, January 4, 2016. retical Computer Science, 609 (part 1) CODEN TCSCDI. ISSN 0304- (??):iii–ix, January 4, 2016. CODEN 3975 (print), 1879-2294 (electronic). TCSCDI. ISSN 0304-3975 (print), URL http://www.sciencedirect. 1879-2294 (electronic). URL http: com/science/article/pii/S0304397515007732. //www.sciencedirect.com/science/ Li:2016:RQU article/pii/S0304397515010488. Anonymous:2016:EBb [587] Jian Li and Haitao Wang. Range queries on uncertain data. Theoret- [583] Anonymous. Editorial Board. Theo- ical Computer Science, 609 (part 1) retical Computer Science, 609 (part 2) (??):32–48, January 4, 2016. CODEN (??):iii–ix, January 4, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515008075. article/pii/S0304397515010592. Susilo:2016:EDT Anonymous:2016:EBc [588] Willy Susilo, Fuchun Guo, and [584] Anonymous. Editorial Board. Theo- Yi Mu. Efficient dynamic thresh- retical Computer Science, 609 (part 3) old identity-based encryption with (??):iii–ix, January 4, 2016. CODEN constant-size ciphertext. Theoretical TCSCDI. ISSN 0304-3975 (print), Computer Science, 609 (part 1)(??): REFERENCES 118

49–59, January 4, 2016. CODEN complexity of covering three-vertex TCSCDI. ISSN 0304-3975 (print), multigraphs. Theoretical Computer 1879-2294 (electronic). URL http: Science, 609 (part 1)(??):104–117, //www.sciencedirect.com/science/ January 4, 2016. CODEN TC- article/pii/S0304397515008087. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Sawada:2016:SRF //www.sciencedirect.com/science/ [589] J. Sawada and A. Williams. Suc- article/pii/S0304397515008282. cessor rules for flipping pancakes and Goles:2016:PCM burnt pancakes. Theoretical Com- puter Science, 609 (part 1)(??):60– [593] Eric Goles, Pedro Montealegre, Ville 75, January 4, 2016. CODEN Salo, and Ilkka Törmä. PSPACE- TCSCDI. ISSN 0304-3975 (print), completeness of majority automata 1879-2294 (electronic). URL http: networks. Theoretical Computer //www.sciencedirect.com/science/ Science, 609 (part 1)(??):118–128, article/pii/S0304397515008099. January 4, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), Fong:2016:ACC 1879-2294 (electronic). URL http: [590] Ken C. K. Fong, Minming Li, Hongyu //www.sciencedirect.com/science/ Liang, Linji Yang, and Hao Yuan. article/pii/S0304397515008294. Average-case complexity of the min- Beal:2016:CPP sum matrix product problem. Theo- retical Computer Science, 609 (part 1) [594] Richard Beal and Donald Adjeroh. (??):76–86, January 4, 2016. CODEN Compressed parameterized pattern TCSCDI. ISSN 0304-3975 (print), matching. Theoretical Computer 1879-2294 (electronic). URL http: Science, 609 (part 1)(??):129–142, //www.sciencedirect.com/science/ January 4, 2016. CODEN TC- article/pii/S0304397515008105. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL Enright:2016:GIP http: //www.sciencedirect.com/science/ [591] Jessica Enright and Lorna Stewart. article/pii/S0304397515008440. Games on interval and permutation Yang:2016:ECV graph representations. Theoretical Computer Science, 609 (part 1)(??): [595] Ching-Nung Yang, Li-Zhe Sun, and 87–103, January 4, 2016. CODEN Song-Ruei Cai. Extended color vi- TCSCDI. ISSN 0304-3975 (print), sual cryptography for black and white 1879-2294 (electronic). URL http: secret image. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 609 (part 1)(??):143– article/pii/S0304397515008117. 161, January 4, 2016. CODEN Kratochvil:2016:CCC TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [592] Jan Kratochv´ıl, Jan Arne Telle, //www.sciencedirect.com/science/ and Marek Tesar. Computational article/pii/S0304397515008452. REFERENCES 119

Qu:2016:NSD 197–210, January 4, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [596] Cunquan Qu, Guanghui Wang, Jian- 1879-2294 (electronic). URL http: liang Wu, and Xiaowei Yu. On the //www.sciencedirect.com/science/ neighbor sum distinguishing total col- article/pii/S0304397515008518. oring of planar graphs. Theoretical Computer Science, 609 (part 1)(??): Akiba:2016:BRE 162–170, January 4, 2016. CODEN [600] Takuya Akiba and Yoichi Iwata. TCSCDI. ISSN 0304-3975 (print), Branch-and-reduce exponential/FPT 1879-2294 (electronic). URL http: algorithms in practice: a case study //www.sciencedirect.com/science/ of vertex cover. Theoretical Com- article/pii/S0304397515008464. puter Science, 609 (part 1)(??):211– Das:2016:AMR 225, January 4, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [597] Shantanu Das, Paola Flocchini, 1879-2294 (electronic). URL http: Giuseppe Prencipe, Nicola San- //www.sciencedirect.com/science/ toro, and Masafumi Yamashita. article/pii/S030439751500852X. Autonomous mobile robots with lights. Theoretical Computer Sci- Beal:2016:SDS ence, 609 (part 1)(??):171–184, Jan- [601] Marie-Pierre Béal, Michel Block- uary 4, 2016. CODEN TC- elet, and C˘at˘alin Dima. Sofic– SCDI. ISSN 0304-3975 (print), Dyck shifts. Theoretical Computer 1879-2294 (electronic). URL http: Science, 609 (part 1)(??):226–244, //www.sciencedirect.com/science/ January 4, 2016. CODEN TC- article/pii/S0304397515008476. SCDI. ISSN 0304-3975 (print), Han:2016:OMK 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [598] Xin Han and Kazuhisa Makino. On- article/pii/S0304397515008567. line minimization knapsack prob- Viard:2016:CMC lem. Theoretical Computer Sci- ence, 609 (part 1)(??):185–196, Jan- [602] Jordan Viard, Matthieu Latapy, and uary 4, 2016. CODEN TC- Clémence Magnien. Computing maxi- SCDI. ISSN 0304-3975 (print), mal cliques in link streams. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 609 (part 1)(??): //www.sciencedirect.com/science/ 245–252, January 4, 2016. CODEN article/pii/S0304397515008506. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Wang:2016:EAC //www.sciencedirect.com/science/ [599] Xi Wang, Jianxi Fan, Xiaohua Jia, and article/pii/S0304397515008701. Cheng-Kuan Lin. An efficient algo- Gong:2016:HES rithm to construct disjoint path covers of DCell networks. Theoretical [603] Linming Gong, Shundong Li, Qing Computer Science, 609 (part 1)(??): Mao, Daoshun Wang, and Jiawei REFERENCES 120

Dou. A homomorphic encryption 287–295, January 4, 2016. CODEN scheme with adaptive chosen ci- TCSCDI. ISSN 0304-3975 (print), phertext security but without ran- 1879-2294 (electronic). URL http: dom oracle. Theoretical Computer //www.sciencedirect.com/science/ Science, 609 (part 1)(??):253–261, article/pii/S0304397515008816. January 4, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), Chen:2016:EAO 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [607] Kun-Tze Chen, Chi-Long Li, Hsien- article/pii/S0304397515008725. Tai Chiu, and Chin Lung Lu. An eﬃcient algorithm for one-sided Chang:2016:AAB block ordering problem under block- interchange distance. Theoretical Com- [604] Fei-Huang Chang, Ma-Lian Chia, puter Science, 609 (part 2)(??):296– David Kuo, Sheng-Chyang Liaw, and 305, January 4, 2016. CODEN Jen-Chun Ling. All-to-all broad- TCSCDI. ISSN 0304-3975 (print), cast problems on Cartesian prod- 1879-2294 (electronic). URL http: uct graphs. Theoretical Computer //www.sciencedirect.com/science/ Science, 609 (part 1)(??):262–271, article/pii/S0304397515008932. January 4, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), Blasius:2016:NPC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [608] Thomas Bl¨asius and Ignaz Rutter. article/pii/S0304397515008737. A new perspective on clustered planarity as a combinatorial embed- Chak:2016:BPL ding problem. Theoretical Com- [605] Christopher Hanrui Chak, Rusins puter Science, 609 (part 2)(??):306– Freivalds, Frank Stephan, and Hen- 315, January 4, 2016. CODEN rietta Tan Wan Yik. On block TCSCDI. ISSN 0304-3975 (print), pumpable languages. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 609 (part 1)(??):272– //www.sciencedirect.com/science/ 285, January 4, 2016. CODEN article/pii/S0304397515008944. TCSCDI. ISSN 0304-3975 (print), Golin:2016:ERM 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [609] Mordecai Golin, John Iacono, Danny article/pii/S0304397515008798. Krizanc, Rajeev Raman, Srinivasa Rao Benevides:2016:MIT Satti, and Sunil Shende. Encoding 2D range maximum queries. Theoretical [606] Fabr´ıcio Benevides, Victor Campos, Computer Science, 609 (part 2)(??): Mitre C. Dourado, Rudini M. Sam- 316–327, January 4, 2016. CODEN paio, and Ana Silva. The maximum TCSCDI. ISSN 0304-3975 (print), infection time in the geodesic and 1879-2294 (electronic). URL http: monophonic convexities. Theoretical //www.sciencedirect.com/science/ Computer Science, 609 (part 2)(??): article/pii/S0304397515008956. REFERENCES 121

Kratsch:2016:ASM //www.sciencedirect.com/science/ article/pii/S0304397515009123. [610] Dieter Kratsch and Van Bang Le. Algorithms solving the Matching Brankovic:2016:LTS Cut problem. Theoretical Com- puter Science, 609 (part 2)(??):328– [614] Ljiljana Brankovic, Costas S. Il- 335, January 4, 2016. CODEN iopoulos, Ritu Kundu, Manal Mo- TCSCDI. ISSN 0304-3975 (print), hamed, Solon P. Pissis, and Fa- 1879-2294 (electronic). URL http: tima Vayani. Linear-time super- //www.sciencedirect.com/science/ bubble identification algorithm for article/pii/S0304397515008993. genome assembly. Theoretical Com- Gu:2016:PCN puter Science, 609 (part 2)(??):374– 383, January 4, 2016. CODEN [611] Ran Gu, Xueliang Li, and Zhong- TCSCDI. ISSN 0304-3975 (print), mei Qin. Proper connection num- 1879-2294 (electronic). URL http: ber of random graphs. Theoretical //www.sciencedirect.com/science/ Computer Science, 609 (part 2)(??): article/pii/S0304397515009147. 336–343, January 4, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Zejnilovic:2016:EMD 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [615] Sabina Zejnilović, Dieter Mitsche, João . article/pii/S0304397515009007 Gomes, and Bruno Sinopoli. Extend- Tian:2016:SRC ing the metric dimension to graphs with missing edges. Theoretical Com- [612] Jing Tian, Xianzhong Zhao, and Yong puter Science, 609 (part 2)(??):384– Shao. On structure and representa- 394, January 4, 2016. CODEN tions of cyclic automata. Theoretical TCSCDI. ISSN 0304-3975 (print), Computer Science, 609 (part 2)(??): 1879-2294 (electronic). URL http: 344–360, January 4, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515009159. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Xu:2016:AUP article/pii/S0304397515009111. Bonnet:2016:TBM [616] Ming Xu, Cheng-Chao Huang, Zhi- Bin Li, and Zhenbing Zeng. An- [613] Fran¸cois Bonnet, Xavier Défago, alyzing ultimate positivity for solv- Thanh Dang Nguyen, and Maria able systems. Theoretical Com- Potop-Butucaru. Tight bound on mo- puter Science, 609 (part 2)(??):395– bile Byzantine Agreement. Theoreti- 412, January 4, 2016. CODEN cal Computer Science, 609 (part 2)(??): TCSCDI. ISSN 0304-3975 (print), 361–373, January 4, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515009160. REFERENCES 122

Hao:2016:PDS number and degree distribution of spanning trees in the Tower of [617] Rong-Xia Hao, Mei-Mei Gu, and Yan- Hanoi graph. Theoretical Com- Quan Feng. The pessimistic di- puter Science, 609 (part 2)(??):443– agnosabilities of some general reg- 455, January 4, 2016. CODEN ular graphs. Theoretical Computer TCSCDI. ISSN 0304-3975 (print), Science, 609 (part 2)(??):413–420, 1879-2294 (electronic). URL http: January 4, 2016. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S030439751500938X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Currie:2016:GRB article/pii/S0304397515009184. [621] James Currie and Narad Ramper- Zhou:2016:CFT sad. Growth rate of binary words avoiding xxxR. Theoretical Com- [618] Shuming Zhou, Sulin Song, Xi- puter Science, 609 (part 2)(??):456– aoxue Yang, and Lanxiang Chen. 468, January 4, 2016. CODEN On conditional fault tolerance and TCSCDI. ISSN 0304-3975 (print), diagnosability of hierarchical cubic 1879-2294 (electronic). URL http: networks. Theoretical Computer //www.sciencedirect.com/science/ Science, 609 (part 2)(??):421–433, article/pii/S0304397515009780. January 4, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), Allen:2016:CPW 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [622] Emily Allen, F. Blanchet-Sadri, article/pii/S0304397515009366. Michelle Bodnar, Brian Bowers, Joe Hidakatsu, and John Lens- Chen:2016:SCM mire. Combinatorics on partial [619] Wenbin Chen, Nagiza F. Samatova, word borders. Theoretical Com- Matthias F. Stallmann, William Hen- puter Science, 609 (part 2)(??):469– drix, and Weiqin Ying. On size- 493, January 4, 2016. CODEN constrained minimum s–t cut prob- TCSCDI. ISSN 0304-3975 (print), lems and size-constrained dense sub- 1879-2294 (electronic). URL http: graph problems. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 609 (part 2)(??):434– article/pii/S0304397515009809. 442, January 4, 2016. CODEN Chen:2016:PDP TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [623] Xie-Bin Chen. Paired 2-disjoint //www.sciencedirect.com/science/ path covers of faulty k-ary n- article/pii/S0304397515009378. cubes. Theoretical Computer Sci- Zhang:2016:NDD ence, 609 (part 2)(??):494–499, Jan- uary 4, 2016. CODEN TC- [620] Zhongzhi Zhang, Shunqi Wu, Mingyun SCDI. ISSN 0304-3975 (print), Li, and Francesc Comellas. The 1879-2294 (electronic). URL http: REFERENCES 123

//www.sciencedirect.com/science/ constraint. Theoretical Computer article/pii/S0304397515009810. Science, 609 (part 3)(??):516–525, January 4, 2016. CODEN TC- Fang:2016:CLC SCDI. ISSN 0304-3975 (print), [624] Qizhi Fang, Bo Li, Xiaoming Sun, 1879-2294 (electronic). URL http: Jia Zhang, and Jialin Zhang. Com- //www.sciencedirect.com/science/ puting the least-core and nucleo- article/pii/S0304397515003746. lus for threshold cardinality match- Chen:2016:AMC ing games. Theoretical Computer Science, 609 (part 2)(??):500–510, [628] Xujin Chen, Xiaodong Hu, and January 4, 2016. CODEN TC- Changjun Wang. Approximation for SCDI. ISSN 0304-3975 (print), the minimum cost doubly resolv- 1879-2294 (electronic). URL http: ing set problem. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 609 (part 3)(??):526– . article/pii/S0304397515010129 543, January 4, 2016. CODEN Grippo:2016:CPB TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [625] Luciano N. Grippo, Mart´ın Mata- //www.sciencedirect.com/science/ mala, Mart´ın D. Safe, and Maya J. article/pii/S0304397515003060. Stein. Convex p-partitions of bipartite graphs. Theoretical Com- Duan:2016:CFB puter Science, 609 (part 2)(??):511– 514, January 4, 2016. CODEN [629] Zhenhua Duan, Cong Tian, and Nan TCSCDI. ISSN 0304-3975 (print), Zhang. A canonical form based de- 1879-2294 (electronic). URL http: cision procedure and model check- //www.sciencedirect.com/science/ ing approach for propositional pro- article/pii/S0304397515010117. jection temporal logic. Theoretical Computer Science, 609 (part 3)(??): Cai:2016:SIC 544–560, January 4, 2016. CODEN [626] Zhipeng Cai and Alexander Zelikovsky. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL Special issue on Computing and Com- http: binatori’s Conference. Theoretical //www.sciencedirect.com/science/ Computer Science, 609 (part 3)(??): article/pii/S0304397515007860. 515, January 4, 2016. CODEN Jiang:2016:SCS TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [630] Minghui Jiang and Haitao Wang. //www.sciencedirect.com/science/ Shortest color-spanning intervals. The- article/pii/S0304397515010798. oretical Computer Science, 609 (part Bera:2016:MAF 3)(??):561–568, January 4, 2016. CODEN TCSCDI. ISSN 0304- [627] Suman K. Bera, Syamantak Das, 3975 (print), 1879-2294 (electronic). and Amit Kumar. Minimizing URL http://www.sciencedirect. average ﬂow-time under knapsack com/science/article/pii/S0304397515000754. REFERENCES 124

LeGall:2016:QAF 606–619, January 4, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [631] Fran¸cois Le Gall, Harumichi Nishimura, 1879-2294 (electronic). URL http: and Seiichiro Tani. Quantum al- //www.sciencedirect.com/science/ gorithms for ﬁnding constant-sized article/pii/S0304397515007100. sub-hypergraphs. Theoretical Com- puter Science, 609 (part 3)(??):569– Tong:2016:SHT 582, January 4, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [635] Weitian Tong, Randy Goebel, and 1879-2294 (electronic). URL http: Guohui Lin. Smoothed heights of //www.sciencedirect.com/science/ tries and Patricia tries. Theoretical article/pii/S0304397515008774. Computer Science, 609 (part 3)(??): Liu:2016:HLC 620–626, January 4, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [632] Xianmin Liu, Jianzhong Li, and Hong 1879-2294 (electronic). URL http: Gao. On the hardness of labeled cor- //www.sciencedirect.com/science/ relation clustering problem: a param- article/pii/S0304397515001061. eterized complexity view. Theoretical Computer Science, 609 (part 3)(??): Wu:2016:AAB 583–593, January 4, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [636] Di Wu, Zhao Zhang, and Weili 1879-2294 (electronic). URL http: Wu. Approximation algorithm for //www.sciencedirect.com/science/ the balanced 2-connected k-partition article/pii/S0304397515002376. problem. Theoretical Computer Miao:2016:CSQ Science, 609 (part 3)(??):627–638, January 4, 2016. CODEN TC- [633] Dongjing Miao, Xianmin Liu, and SCDI. ISSN 0304-3975 (print), Jianzhong Li. On the complexity 1879-2294 (electronic). URL http: of sampling query feedback restricted //www.sciencedirect.com/science/ database repair of functional depen- article/pii/S0304397515000985. dency violations. Theoretical Com- puter Science, 609 (part 3)(??):594– Zhang:2016:CAS 605, January 4, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [637] Nan Zhang, Zhenhua Duan, and 1879-2294 (electronic). URL http: Cong Tian. A complete axiom //www.sciencedirect.com/science/ system for propositional projection article/pii/S0304397515001073. temporal logic with cylinder computation model. Mishra:2016:OPS Theoretical Com- puter Science, 609 (part 3)(??):639– [634] Subhankar Mishra, Thang N. Dinh, 657, January 4, 2016. CODEN My T. Thai, Jungtaek Seo, and Incheol TCSCDI. ISSN 0304-3975 (print), Shin. Optimal packet scan against ma- 1879-2294 (electronic). URL http: licious attacks in smart grids. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 609 (part 3)(??): article/pii/S0304397515003989. REFERENCES 125

Zhang:2016:NAA ity of inversion operations. Theoret- ical Computer Science, 610 (part A) [638] Peng Zhang. A new approxima- (??):2–12, January 11, 2016. CODEN tion algorithm for the unbalanced TCSCDI. ISSN 0304-3975 (print), Min s–t Cut problem. Theoretical 1879-2294 (electronic). URL http: Computer Science, 609 (part 3)(??): //www.sciencedirect.com/science/ 658–665, January 4, 2016. CODEN article/pii/S0304397515003242. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Diekert:2016:SLD //www.sciencedirect.com/science/ article/pii/S0304397515001760. [643] Volker Diekert and Manfred Kuﬂeit- Anonymous:2016:EBd ner. A survey on the local divisor technique. Theoretical Com- [639] Anonymous. Editorial Board. Theo- puter Science, 610 (part A)(??):13– retical Computer Science, 610 (part B) 23, January 11, 2016. CODEN (??):iii–ix, January 11, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515006295. article/pii/S0304397515011068. Anonymous:2016:EBe Dorzweiler:2016:PNP

[640] Anonymous. Editorial Board. Theo- [644] Olga Dorzweiler, Thomas Flamm, An- retical Computer Science, 610 (part A) dreas Krebs, and Michael Ludwig. Pos- (??):iii–ix, January 11, 2016. CODEN itive and negative proofs for circuits TCSCDI. ISSN 0304-3975 (print), and branching programs. Theoretical 1879-2294 (electronic). URL http: Computer Science, 610 (part A)(??): //www.sciencedirect.com/science/ 24–36, January 11, 2016. CODEN article/pii/S0304397515010920. TCSCDI. ISSN 0304-3975 (print), Jurgensen:2016:DCF 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [641] Helmut Jürgensen, Juhani Karhumäki, article/pii/S0304397515007884. and Alexander Okhotin. Descriptional complexity of formal systems. The- Gehrke:2016:UWF oretical Computer Science, 610 (part A)(??):1, January 11, 2016. CODEN [645] Mai Gehrke, Andreas Krebs, and TCSCDI. ISSN 0304-3975 (print), Jean-Eric´ Pin. Ultrafilters on words 1879-2294 (electronic). URL http: for a fragment of logic. Theoretical //www.sciencedirect.com/science/ Computer Science, 610 (part A)(??): article/pii/S0304397515010956. 37–58, January 11, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Cho:2016:SCI 1879-2294 (electronic). URL http: [642] Da-Jung Cho, Yo-Sub Han, Sang-Ki //www.sciencedirect.com/science/ Ko, and Kai Salomaa. State complex- article/pii/S0304397515007276. REFERENCES 126

Holzer:2016:BSR TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [646] Markus Holzer and Sebastian Jakobi. //www.sciencedirect.com/science/ Boundary sets of regular and context- article/pii/S0304397515006271. free languages. Theoretical Com- puter Science, 610 (part A)(??):59– Prusa:2016:NRT 77, January 11, 2016. CODEN [650] Daniel Prusa. Non-recursive trade- TCSCDI. ISSN 0304-3975 (print), offs between two-dimensional automata 1879-2294 (electronic). URL http: and grammars. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 610 (part A)(??):121– article/pii/S0304397515006660. 132, January 11, 2016. CODEN Jirasek:2016:PFL TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [647] Jozef Jirásek, Galina Jirásková, Monika //www.sciencedirect.com/science/ Krausová, Peter Mlynárcik, and Juraj article/pii/S0304397515004740. Sebej. Prefix-free languages: Left and right quotient and reversal. Theoret- Anonymous:2016:GES ical Computer Science, 610 (part A) (??):78–90, January 11, 2016. CODEN [651] Anonymous. Guest Editorial: Spe- TCSCDI. ISSN 0304-3975 (print), cial issue on Structural Informa- 1879-2294 (electronic). URL http: tion and Communication Complex- //www.sciencedirect.com/science/ ity. Theoretical Computer Sci- article/pii/S0304397515007781. ence, 610 (part B)(??):133–134, Jan- uary 11, 2016. CODEN TC- Karandikar:2016:SCC SCDI. ISSN 0304-3975 (print), [648] P. Karandikar, M. Niewerth, and 1879-2294 (electronic). URL http: Ph. Schnoebelen. On the state //www.sciencedirect.com/science/ complexity of closures and interiors article/pii/S0304397515011317. of regular languages with subwords Bar-Noy:2016:CGS and superwords. Theoretical Com- puter Science, 610 (part A)(??):91– [652] Amotz Bar-Noy, Ben Baumer, and 107, January 11, 2016. CODEN Dror Rawitz. Changing of the TCSCDI. ISSN 0304-3975 (print), guards: Strip cover with duty cy- 1879-2294 (electronic). URL http: cling. Theoretical Computer Sci- //www.sciencedirect.com/science/ ence, 610 (part B)(??):135–148, Jan- article/pii/S0304397515008683. uary 11, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), Palioudakis:2016:OSC 1879-2294 (electronic). URL http: [649] Alexandros Palioudakis, Kai Salomaa, //www.sciencedirect.com/science/ and Selim G. Akl. Operational state article/pii/S0304397514006549. complexity of unary NFAs with fi- Caragiannis:2016:SLB nite nondeterminism. Theoretical Com- puter Science, 610 (part A)(??):108– [653] Ioannis Caragiannis and Christos 120, January 11, 2016. CODEN Kalaitzis. Space lower bounds for low- REFERENCES 127

stretch greedy embeddings. Theoretical 1879-2294 (electronic). URL http: Computer Science, 610 (part B)(??): //www.sciencedirect.com/science/ 149–157, January 11, 2016. CODEN article/pii/S0304397514005106. TCSCDI. ISSN 0304-3975 (print), Eftekhari:2016:SCS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [657] Mohsen Eftekhari, Evangelos Kranakis, article/pii/S0304397515001000. Fraser MacQuarrie, Oscar Morales- DAngelo:2016:GRA Ponce, and Lata Narayanan. Strong connectivity of sensor networks with [654] Gianlorenzo D’Angelo, Gabriele Di double antennae. Theoretical Com- Stefano, Ralf Klasing, and Alfredo puter Science, 610 (part B)(??):192– Navarra. Gathering of robots on anony- 203, January 11, 2016. CODEN mous grids and trees without multi- TCSCDI. ISSN 0304-3975 (print), plicity detection. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 610 (part B)(??):158– //www.sciencedirect.com/science/ 168, January 11, 2016. CODEN article/pii/S0304397515001140. TCSCDI. ISSN 0304-3975 (print), Hasemann:2016:DLA 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [658] Henning Hasemann, Juho Hirvonen, article/pii/S0304397514005131. Joel Rybicki, and Jukka Suomela. De- terministic local algorithms, unique Balamohan:2016:EUD identiﬁers, and fractional graph colour- [655] B. Balamohan, S. Dobrev, P. Floc- ing. Theoretical Computer Sci- chini, and N. Santoro. Exploring an ence, 610 (part B)(??):204–217, Jan- unknown dangerous graph with a con- uary 11, 2016. CODEN TC- stant number of tokens. Theoretical SCDI. ISSN 0304-3975 (print), Computer Science, 610 (part B)(??): 1879-2294 (electronic). URL http: 169–181, January 11, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751400512X. 1879-2294 (electronic). URL http: Anonymous:2016:EBf //www.sciencedirect.com/science/ article/pii/S030439751400543X. [659] Anonymous. Editorial Board. The- oretical Computer Science, 611(??): Yu:2016:DMM iii–ix, January 18, 2016. CODEN [656] Dongxiao Yu, Qiang-Sheng Hua, TCSCDI. ISSN 0304-3975 (print), Yuexuan Wang, Haisheng Tan, and 1879-2294 (electronic). URL http: Francis C. M. Lau. Distributed //www.sciencedirect.com/science/ multiple-message broadcast in wire- article/pii/S0304397515011512. less ad hoc networks under the Fu:2016:TI SINR model. Theoretical Com- puter Science, 610 (part B)(??):182– [660] Yuxi Fu. Theory of interaction. The- 191, January 11, 2016. CODEN oretical Computer Science, 611(??): TCSCDI. ISSN 0304-3975 (print), 1–49, January 18, 2016. CODEN REFERENCES 128

TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 611(??): 1879-2294 (electronic). URL http: 136–141, January 18, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751500688X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Blanqui:2016:TRR article/pii/S0304397515006891. [661] Frédéric Blanqui. Termination of Anonymous:2016:EBg rewrite relations on λ-terms based on Girard’s notion of reducibility. The- [665] Anonymous. Editorial Board. The- oretical Computer Science, 611(??): oretical Computer Science, 612(??): 50–86, January 18, 2016. CODEN iii–ix, January 25, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515006908. article/pii/S0304397515011627. Yokoyama:2016:FRF Abdulla:2016:PVT [662] Tetsuo Yokoyama, Holger Bock Ax- [666] Parosh Aziz Abdulla, Giorgio Delzanno, elsen, and Robert Glück. Fundamen- Othmane Rezine, Arnaud Sangnier, tals of reversible flowchart languages. and Riccardo Traverso. Parameter- Theoretical Computer Science, 611(??): ized verification of time-sensitive mod- 87–115, January 18, 2016. CODEN els of ad hoc network protocols. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 612(??): 1879-2294 (electronic). URL http: 1–22, January 25, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751500691X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Xu:2016:MUF article/pii/S0304397515006933. [663] Ming Xu, Lijun Zhang, David N. Xu:2016:CHL Jansen, Huibiao Zhu, and Zongyuan Yang. Multiphase until formu- [667] Zhaowei Xu, Yuefei Sui, and Wenhui las over Markov reward models: Zhang. Completeness of Hoare logic an algebraic approach. Theoreti- with inputs over the standard model. cal Computer Science, 611(??):116– Theoretical Computer Science, 612(??): 135, January 18, 2016. CODEN 23–28, January 25, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515006921. article/pii/S0304397515007239. Muscholl:2016:CLC Luttik:2016:UPD [664] Anca Muscholl and Sven Schewe. Con- [668] Bas Luttik. Unique parallel de- trolling loosely cooperating processes. composition in branching and weak REFERENCES 129

bisimulation semantics. Theoreti- Dreier:2016:EDU cal Computer Science, 612(??):29– 44, January 25, 2016. CODEN [672] Jannik Dreier, Cristian Ene, Pascal TCSCDI. ISSN 0304-3975 (print), Lafourcade, and Yassine Lakhnech. 1879-2294 (electronic). URL http: On the existence and decidability of //www.sciencedirect.com/science/ unique decompositions of processes article/pii/S0304397515008968. in the applied π-calculus. Theoret- ical Computer Science, 612(??):102– Pan:2016:MCC 125, January 25, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [669] Haiyu Pan, Yongming Li, Yongzhi Cao, 1879-2294 (electronic). URL http: and Zhanyou Ma. Model checking com- //www.sciencedirect.com/science/ putation tree logic over ﬁnite lattices. article/pii/S0304397515011196. Theoretical Computer Science, 612(??): Wu:2016:RDI 45–62, January 25, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [673] Mingyuan Wu, Lankun Guo, and Qing- 1879-2294 (electronic). URL http: guo Li. A representation of L-domains //www.sciencedirect.com/science/ by information systems. Theoreti- article/pii/S030439751500897X. cal Computer Science, 612(??):126– 136, January 25, 2016. CODEN Liu:2016:LCE TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [670] Chanjuan Liu, Fenrong Liu, Kaile //www.sciencedirect.com/science/ Su, and Enqiang Zhu. A log- article/pii/S0304397515011238. ical characterization of extensive games with short sight. Theoret- Gavryushkin:2016:RAE ical Computer Science, 612(??):63– 82, January 25, 2016. CODEN [674] Alex Gavryushkin, Bakhadyr Khous- TCSCDI. ISSN 0304-3975 (print), sainov, and Frank Stephan. Re- 1879-2294 (electronic). URL http: ducibilities among equivalence rela- //www.sciencedirect.com/science/ tions induced by recursively enumer- article/pii/S0304397515008981. able structures. Theoretical Com- puter Science, 612(??):137–152, Jan- Slivovsky:2016:SRD uary 25, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), [671] Friedrich Slivovsky and Stefan Szei- 1879-2294 (electronic). URL http: der. Soundness of Q-resolution //www.sciencedirect.com/science/ with dependency schemes. Theoret- article/pii/S0304397515011287. ical Computer Science, 612(??):83– Anonymous:2016:EBh 101, January 25, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [675] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 613(??): //www.sciencedirect.com/science/ iii–ix, February 1, 2016. CODEN article/pii/S0304397515009135. TCSCDI. ISSN 0304-3975 (print), REFERENCES 130

1879-2294 (electronic). URL http: 51–64, February 1, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515011925. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Yamakami:2016:PGA article/pii/S0304397515010865. [676] Tomoyuki Yamakami. Pseudo- Bilo:2016:PEF random generators against advised context-free languages. Theoreti- [680] Vittorio Bilò, Angelo Fanelli, Michele cal Computer Science, 613(??):1–27, Flammini, Gianpiero Monaco, and February 1, 2016. CODEN TC- Luca Moscardelli. The price of envy- SCDI. ISSN 0304-3975 (print), freeness in machine scheduling. The- 1879-2294 (electronic). URL http: oretical Computer Science, 613(??): //www.sciencedirect.com/science/ 65–78, February 1, 2016. CODEN article/pii/S0304397515009196. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Naude:2016:RPS //www.sciencedirect.com/science/ [677] Kevin A. Naudé. Refined pivot article/pii/S0304397515011123. selection for maximal clique enu- Nonner:2016:CMB meration in graphs. Theoreti- cal Computer Science, 613(??):28– [681] Tim Nonner. Capacitated Max- 37, February 1, 2016. CODEN Batching with interval graph com- TCSCDI. ISSN 0304-3975 (print), patibilities. Theoretical Computer 1879-2294 (electronic). URL http: Science, 613(??):79–93, February 1, //www.sciencedirect.com/science/ 2016. CODEN TCSCDI. ISSN 0304- article/pii/S0304397515010130. 3975 (print), 1879-2294 (electronic). URL http://www.sciencedirect. Fomin:2016:FPG com/science/article/pii/S0304397515011147. [678] Fedor V. Fomin, Pinar Heggernes, and DiIanni:2016:MMC Erik Jan van Leeuwen. The Fire- fighter problem on graph classes. The- [682] Miriam Di Ianni, Giorgio Gambosi, Gi- oretical Computer Science, 613(??): anluca Rossi, and Paola Vocca. Min- 38–50, February 1, 2016. CODEN max communities in graphs: Com- TCSCDI. ISSN 0304-3975 (print), plexity and computational properties. 1879-2294 (electronic). URL http: Theoretical Computer Science, 613(??): //www.sciencedirect.com/science/ 94–114, February 1, 2016. CODEN article/pii/S0304397515010853. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Erlebach:2016:QCA //www.sciencedirect.com/science/ [679] Thomas Erlebach, Michael Hoff- article/pii/S0304397515011202. mann, and Frank Kammer. Query- Meyer:2016:GPP competitive algorithms for cheapest set problems under uncertainty. The- [683] Bernd Meyer. Generalized Pete’s oretical Computer Science, 613(??): Pike is PSPACE-complete. Theoret- REFERENCES 131

ical Computer Science, 613(??):115– 108, February 8, 2016. CODEN 125, February 1, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515011305. article/pii/S0304397515011226. Anonymous:2016:EBj Anonymous:2016:EBi [688] Anonymous. Editorial Board. The- [684] Anonymous. Editorial Board. The- oretical Computer Science, 615(??): oretical Computer Science, 614(??): iii–ix, February 15, 2016. CODEN iii–ix, February 8, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515012268. article/pii/S0304397515012128. Hellmuth:2016:FFC Berline:2016:SAM [689] Marc Hellmuth and Florian Lehner. [685] Chantal Berline and Klaus Grue. A Fast factorization of Cartesian prod- synthetic axiomatization of Map The- ucts of (directed) hypergraphs. The- ory. Theoretical Computer Science, 614 oretical Computer Science, 615(??): (??):1–62, February 8, 2016. CODEN 1–11, February 15, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515011135. article/pii/S030439751501124X. Anderson:2016:CLB Klouda:2016:SDB [686] Gabrielle Anderson and David Pym. [690] Karel Klouda and Katerina Med- A calculus and logic of bunched re- kov´a. Synchronizing delay for bi- sources and processes. Theoreti- nary uniform morphisms. Theoret- cal Computer Science, 614(??):63– ical Computer Science, 615(??):12– 96, February 8, 2016. CODEN 22, February 15, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515011214. article/pii/S0304397515011299. Dittmann:2016:GOP Chlebus:2016:SWM [687] Christoph Dittmann, Stephan Kreutzer, [691] Bogdan S. Chlebus, Gianluca De and Alexandru I. Tomescu. Graph Marco, and Dariusz R. Kowalski. operations on parity games and Scalable wake-up of multi-channel polynomial-time algorithms. Theo- single-hop radio networks. Theoret- retical Computer Science, 614(??):97– ical Computer Science, 615(??):23– REFERENCES 132

44, February 15, 2016. CODEN Hsieh:2016:RCL TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [695] Sun-Yuan Hsieh, Hong-Wen Huang, //www.sciencedirect.com/science/ and Chia-Wei Lee. {2, 3}-restricted article/pii/S0304397515011342. connectivity of locally twisted cubes. Theoretical Computer Science, 615(??): Seo:2016:RHI 78–90, February 15, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [692] Jae Hong Seo and Keita Emura. Re- //www.sciencedirect.com/science/ vocable hierarchical identity-based en- article/pii/S030439751501138X. cryption via history-free approach. Theoretical Computer Science, 615(??): Cheng:2016:SMP 45–60, February 15, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [696] Eddie Cheng, Justin Kelm, and Joseph 1879-2294 (electronic). URL http: Renzi. Strong matching preclu- //www.sciencedirect.com/science/ sion of (n, k)-star graphs. Theoret- article/pii/S0304397515011354. ical Computer Science, 615(??):91– 101, February 15, 2016. CODEN Bhattacharya:2016:SEA TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [693] Binay K. Bhattacharya, Subhas C. //www.sciencedirect.com/science/ . Nandy, and Sasanka Roy. Space- article/pii/S0304397515011391 eﬃcient algorithm for computing a Kamei:2016:ASS centerpoint of a set of points in R2. Theoretical Computer Science, 615(??): [697] Sayaka Kamei, Tomoko Izumi, and 61–70, February 15, 2016. CODEN Yukiko Yamauchi. An asynchronous TCSCDI. ISSN 0304-3975 (print), self-stabilizing approximation for the 1879-2294 (electronic). URL http: minimum CDS with safe conver- //www.sciencedirect.com/science/ gence in UDGs. Theoretical Com- article/pii/S0304397515011366. puter Science, 615(??):102–119, Febru- ary 15, 2016. CODEN TC- Zhang:2016:RMR SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [694] Mingzu Zhang, Lianzhu Zhang, and //www.sciencedirect.com/science/ Xing Feng. Reliability measures in re- article/pii/S0304397515011408. lation to the h-extra edge-connectivity Saether:2016:HCW of folded hypercubes. Theoreti- cal Computer Science, 615(??):71– [698] Sigve Hortemo Sæther and Martin Vat- 77, February 15, 2016. CODEN shelle. Hardness of computing width TCSCDI. ISSN 0304-3975 (print), parameters based on branch decom- 1879-2294 (electronic). URL http: positions over the vertex set. The- //www.sciencedirect.com/science/ oretical Computer Science, 615(??): article/pii/S0304397515011378. 120–125, February 15, 2016. CODEN REFERENCES 133

TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515011743. article/pii/S0304397515011251. Bose:2016:TTB Anonymous:2016:EBk

[699] Anonymous. Editorial Board. The- [703] Prosenjit Bose, Jean-Lou De Carufel, oretical Computer Science, 616(??): Pat Morin, Andr´e van Renssen, iii–ix, ???? 2016. CODEN TC- and Sander Verdonschot. Towards SCDI. ISSN 0304-3975 (print), tight bounds on theta-graphs: More 1879-2294 (electronic). URL http: is not always better. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 616(??):70– article/pii/S0304397516000104. 93, ???? 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), Gurski:2016:DNW 1879-2294 (electronic). URL http: [700] Frank Gurski, Egon Wanke, and //www.sciencedirect.com/science/ Eda Yilmaz. Directed NLC-width. article/pii/S0304397515011780. Theoretical Computer Science, 616 (??):1–17, ???? 2016. CODEN Jiang:2016:SJR TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [704] Dakui Jiang and Jiayin Tan. Schedul- //www.sciencedirect.com/science/ ing with job rejection and nonsimul- article/pii/S0304397515009779. taneous machine available time on unrelated parallel machines. The- Engelfriet:2016:LAR oretical Computer Science, 616(??): [701] Joost Engelfriet, Sebastian Maneth, 94–99, ???? 2016. CODEN TC- and Helmut Seidl. Look-ahead re- SCDI. ISSN 0304-3975 (print), moval for total deterministic top- 1879-2294 (electronic). URL http: down tree transducers. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 616(??):18– article/pii/S0304397515011810. 58, ???? 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), Lu:2016:PCC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [705] Xiao-Tao L¨u, Jin Chen, Ying-Jun article/pii/S0304397515011445. Guo, and Zhi-Xiong Wen. On Avgustinovich:2016:GCC the permutation complexity of the Cantor-like sequences. Theoreti- [702] Sergey Avgustinovich, Sergey Kitaev, cal Computer Science, 616(??):100– Vladimir N. Potapov, and Vincent Va- 110, ???? 2016. CODEN TC- jnovszki. Gray coding cubic planar SCDI. ISSN 0304-3975 (print), maps. Theoretical Computer Science, 1879-2294 (electronic). URL http: 616(??):59–69, ???? 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515011834. REFERENCES 134

Dey:2016:KCP Shibata:2016:PGM

[706] Palash Dey, Neeldhara Misra, and [710] Masahiro Shibata, Shinji Kawai, Y. Narahari. Kernelization com- Fukuhito Ooshita, Hirotsugu Kaku- plexity of possible winner and coali- gawa, and Toshimitsu Masuzawa. Par- tional manipulation problems in vot- tial gathering of mobile agents in asyn- ing. Theoretical Computer Science, 616 chronous unidirectional rings. The- (??):111–125, ???? 2016. CODEN oretical Computer Science, 617(??): TCSCDI. ISSN 0304-3975 (print), 1–11, February 29, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515011846. //www.sciencedirect.com/science/ article/pii/S0304397515008270. Bereczky:2016:QTG Astete-Morales:2016:SCR [707] Nikolett Bereczky, Amalia Duch, Kriszti´an N´emeth, and Salvador Roura. [711] Sandra Astete-Morales, Marie-Liesse Quad-kdtrees: a general frame- Cauwet, Jialin Liu, and Olivier Tey- work for kdtrees and quad trees. taud. Simple and cumulative regret for Theoretical Computer Science, 616 continuous noisy optimization. The- (??):126–140, ???? 2016. CODEN oretical Computer Science, 617(??): TCSCDI. ISSN 0304-3975 (print), 12–27, February 29, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515012001. //www.sciencedirect.com/science/ article/pii/S0304397515008804. Jez:2016:RSA Boissonnat:2016:CRS [708] Artur Jez. A really simple approximation of smallest grammar. The- [712] Jean-Daniel Boissonnat and Do- oretical Computer Science, 616(??): rian Mazauric. On the complex- 141–150, ???? 2016. CODEN ity of the representation of simpli- TCSCDI. ISSN 0304-3975 (print), cial complexes by trees. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 617(??):28– //www.sciencedirect.com/science/ 44, February 29, 2016. CODEN article/pii/S0304397515012025. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Anonymous:2016:EBl //www.sciencedirect.com/science/ [709] Anonymous. Editorial Board. The- article/pii/S0304397515012049. oretical Computer Science, 617(??): Park:2016:UMM iii–ix, February 29, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [713] Jung-Heum Park. Unpaired many- 1879-2294 (electronic). URL http: to-many disjoint path covers in re- //www.sciencedirect.com/science/ stricted hypercube-like graphs. The- article/pii/S0304397516000347. oretical Computer Science, 617(??): REFERENCES 135

45–64, February 29, 2016. CODEN the conditional diagnosability of regu- TCSCDI. ISSN 0304-3975 (print), lar graphs under the comparison model. 1879-2294 (electronic). URL http: Theoretical Computer Science, 618 //www.sciencedirect.com/science/ (??):21–29, March 7, 2016. CODEN article/pii/S0304397515012062. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Tian:2016:OSU //www.sciencedirect.com/science/ article/pii/S0304397515012013. [714] Ji Tian, Qian Wang, Ruyan Fu, and Jinjiang Yuan. Online scheduling Zhu:2016:SMM on the unbounded drop-line batch machines to minimize the maximum [718] Haibin Zhu, Dongning Liu, Siqin delivery completion time. Theoret- Zhang, Yu Zhu, Luyao Teng, and ical Computer Science, 617(??):65– Shaohua Teng. Solving the Many 68, February 29, 2016. CODEN to Many assignment problem by TCSCDI. ISSN 0304-3975 (print), improving the Kuhn–Munkr’s algo- 1879-2294 (electronic). URL http: rithm with backtracking. Theo- //www.sciencedirect.com/science/ retical Computer Science, 618(??): article/pii/S0304397516000025. 30–41, March 7, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Anonymous:2016:EBm 1879-2294 (electronic). URL http: [715] Anonymous. Editorial Board. The- //www.sciencedirect.com/science/ oretical Computer Science, 618(??): article/pii/S0304397516000037. iii–ix, March 7, 2016. CODEN Schmid:2016:CEF TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [719] Markus L. Schmid. Computing //www.sciencedirect.com/science/ equality-free and repetitive string fac- article/pii/S0304397516000761. torisations. Theoretical Computer Xia:2016:RSN Science, 618(??):42–51, March 7, 2016. CODEN TCSCDI. ISSN 0304- [716] Yingjie Xia, Xuejiao Liu, Fubiao Xia, 3975 (print), 1879-2294 (electronic). and Guilin Wang. A reduction of secu- URL http://www.sciencedirect. rity notions in designated conﬁrmer sig- com/science/article/pii/S0304397516000177. natures. Theoretical Computer Science, 618(??):1–20, March 7, 2016. CODEN Okhotin:2016:IDL TCSCDI. ISSN 0304-3975 (print), [720] Alexander Okhotin. Input-driven lan- 1879-2294 (electronic). URL http: guages are linear conjunctive. The- //www.sciencedirect.com/science/ oretical Computer Science, 618(??): article/pii/S030439751501186X. 52–71, March 7, 2016. CODEN Lin:2016:REC TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [717] Limei Lin, Li Xu, and Shuming Zhou. //www.sciencedirect.com/science/ Relating the extra connectivity and article/pii/S0304397516000189. REFERENCES 136

Bova:2016:QCQ 122–134, March 7, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [721] Simone Bova, Robert Ganian, and 1879-2294 (electronic). URL http: Stefan Szeider. Quantified conjunc- //www.sciencedirect.com/science/ tive queries on partially ordered sets. article/pii/S0304397516000517. Theoretical Computer Science, 618 (??):72–84, March 7, 2016. CODEN Hew:2016:WBP TCSCDI. ISSN 0304-3975 (print), [725] Patrick Chisan Hew. Working in bi- 1879-2294 (electronic). URL http: h //www.sciencedirect.com/science/ nary protects the repetends of 1/3 : article/pii/S0304397516000219. Comment on Colussi’s ‘The convergence classes of Collatz function’. The- Abdessaied:2016:CRC oretical Computer Science, 618(??): 135–141, March 7, 2016. CODEN [722] Nabila Abdessaied, Matthew Amy, TCSCDI. ISSN 0304-3975 (print), Rolf Drechsler, and Mathias Soeken. 1879-2294 (electronic). URL http: Complexity of reversible circuits and //www.sciencedirect.com/science/ their quantum implementations. The- article/pii/S0304397515012037. See oretical Computer Science, 618(??): [2]. 85–106, March 7, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Anonymous:2016:EBn 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [726] Anonymous. Editorial Board. The- article/pii/S0304397516000220. oretical Computer Science, 619(??): iii–ix, March 14, 2016. CODEN Nourine:2016:EDA TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [723] Lhouari Nourine and Jean-Marc Pe- //www.sciencedirect.com/science/ tit. Extended dualization: Applica- article/pii/S0304397516000670. tion to maximal pattern mining. The- oretical Computer Science, 618(??): Attie:2016:FSC 107–121, March 7, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [727] Paul C. Attie. Finite-state con- 1879-2294 (electronic). URL http: current programs can be expressed //www.sciencedirect.com/science/ in pairwise normal form. Theo- article/pii/S030439751600044X. retical Computer Science, 619(??): 1–31, March 14, 2016. CODEN Filho:2016:HCC TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [724] Hélio B. Macêdo Filho, Raphael //www.sciencedirect.com/science/ C. S. Machado, and Celina M. H. article/pii/S0304397515011184. de Figueiredo. Hierarchical complexity of 2-clique-colouring weakly Courcelle:2016:CFA chordal graphs and perfect graphs having cliques of size at least 3. The- [728] Bruno Courcelle and Irène Durand. oretical Computer Science, 618(??): Computations by fly-automata beyond REFERENCES 137

monadic second-order logic. The- International Conference on Algorith- oretical Computer Science, 619(??): mic Learning Theory (ALT 2013)]. 32–67, March 14, 2016. CODEN Theoretical Computer Science, 620 TCSCDI. ISSN 0304-3975 (print), (??):1–3, March 21, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515011871. //www.sciencedirect.com/science/ article/pii/S0304397515009391. Held Jez:2016:LGS at the National University of Singa- [729] Artur Jez and Alexander Okhotin. pore, Singapore, October 6–9, 2013. Least and greatest solutions of equations over sets of integers. The- Uitto:2016:CR oretical Computer Science, 619(??): 68–86, March 14, 2016. CODEN [733] Jara Uitto and Roger Wattenhofer. On TCSCDI. ISSN 0304-3975 (print), competitive recommendations. The- 1879-2294 (electronic). URL http: oretical Computer Science, 620(??): //www.sciencedirect.com/science/ 4–14, March 21, 2016. CODEN article/pii/S0304397516000244. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Ziemianski:2016:ESP //www.sciencedirect.com/science/ article/pii/S0304397515009408. [730] Krzysztof Ziemiański. On execution spaces of PV-programs. The- Gao:2016:PLR oretical Computer Science, 619(??): 87–98, March 14, 2016. CODEN [734] Ziyuan Gao, Frank Stephan, and San- TCSCDI. ISSN 0304-3975 (print), dra Zilles. Partial learning of recur- 1879-2294 (electronic). URL http: sively enumerable languages. The- //www.sciencedirect.com/science/ oretical Computer Science, 620(??): article/pii/S0304397516000293. 15–32, March 21, 2016. CODEN Anonymous:2016:EBo TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [731] Anonymous. Editorial Board. The- //www.sciencedirect.com/science/ oretical Computer Science, 620(??): article/pii/S030439751500941X. iii–ix, March 21, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Case:2016:TSI 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [735] John Case and Timo Kötzing. Topolog- article/pii/S0304397516001067. ical separations in inductive inference. Jain:2016:GEF Theoretical Computer Science, 620(??): 33–45, March 21, 2016. CODEN [732] Sanjay Jain, Rémi Munos, Frank TCSCDI. ISSN 0304-3975 (print), Stephan, and Thomas Zeugmann. 1879-2294 (electronic). URL http: Guest Editors’ foreword [preface to //www.sciencedirect.com/science/ the special issue dedicated to the 24th article/pii/S0304397515009421. REFERENCES 138

Shibata:2016:PLC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [736] Chihiro Shibata and Ryo Yoshinaka. article/pii/S0304397515009469. Probabilistic learnability of context- free grammars with basic distributional Khaleghi:2016:NMC properties from positive examples. Theoretical Computer Science, 620(??): [740] Azadeh Khaleghi and Daniil Ryabko. 46–72, March 21, 2016. CODEN Nonparametric multiple change point TCSCDI. ISSN 0304-3975 (print), estimation in highly dependent time se- 1879-2294 (electronic). URL http: ries. Theoretical Computer Science, 620 //www.sciencedirect.com/science/ (??):119–133, March 21, 2016. CODEN article/pii/S0304397515009433. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Darnstadt:2016:OCS //www.sciencedirect.com/science/ article/pii/S0304397515009470. [737] Malte Darnst¨adt, Thorsten Kiss, Hans Ulrich Simon, and Sandra Zilles. Anonymous:2016:EBp Order compression schemes. The- oretical Computer Science, 620(??): [741] Anonymous. Editorial Board. The- 73–90, March 21, 2016. CODEN oretical Computer Science, 621(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, ???? 2016. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515009445. //www.sciencedirect.com/science/ article/pii/S0304397516001237. Choromanska:2016:DPL Leone:2016:GRV [738] Anna Choromanska, Krzysztof Choro- manski, Geetha Jagannathan, and [742] Pierre Leone and Kasun Samaras- Claire Monteleoni. Diﬀerentially- inghe. Geographic routing on Vir- private learning of low dimensional tual Raw Anchor Coordinate sys- manifolds. Theoretical Computer tems. Theoretical Computer Science, Science, 620(??):91–104, March 21, 621(??):1–13, ???? 2016. CODEN 2016. CODEN TCSCDI. ISSN 0304- TCSCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397515009457article/pii/S0304397515011998. . Gottlieb:2016:AMD Belazzougui:2016:OVR

[739] Lee-Ad Gottlieb, Aryeh Kontorovich, [743] Djamal Belazzougui. Optimal Las Ve- and Robert Krauthgamer. Adaptive gas reduction from one-way set rec- metric dimensionality reduction. The- onciliation to error correction. The- oretical Computer Science, 620(??): oretical Computer Science, 621(??): 105–118, March 21, 2016. CODEN 14–21, ???? 2016. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), REFERENCES 139

1879-2294 (electronic). URL http: 73–81, ???? 2016. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397516000438. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Gozupek:2016:CMC article/pii/S0304397516000554. [744] Didem G¨oz¨upek, Hadas Shachnai, Liu:2016:MBM Mordechai Shalom, and Shmuel Zaks. Constructing minimum changeover [748] Xingwu Liu and Shang-Hua Teng. cost arborescenses in bounded treewidth Maximum bipartite matchings with graphs. Theoretical Computer Science, low rank data: Locality and pertur- 621(??):22–36, ???? 2016. CODEN bation analysis. Theoretical Com- TCSCDI. ISSN 0304-3975 (print), puter Science, 621(??):82–91, ???? 1879-2294 (electronic). URL http: 2016. CODEN TCSCDI. ISSN 0304- //www.sciencedirect.com/science/ 3975 (print), 1879-2294 (electronic). article/pii/S0304397516000463. URL http://www.sciencedirect. com/science/article/pii/S0304397516000578. Keshavarz-Kohjerdi:2016:HPS Dereniowski:2016:TRL [745] Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri. Hamiltonian paths [749] Dariusz Dereniowski and Andrzej Pelc. in L-shaped grid graphs. Theoret- Topology recognition and leader elec- ical Computer Science, 621(??):37– tion in colored networks. Theoret- 56, ???? 2016. CODEN TC- ical Computer Science, 621(??):92– SCDI. ISSN 0304-3975 (print), 102, ???? 2016. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516000487. //www.sciencedirect.com/science/ article/pii/S030439751600061X. Flocchini:2016:RCM Fu:2016:IAK [746] P. Flocchini, N. Santoro, G. Vigli- etta, and M. Yamashita. Ren- [750] Lianzhi Fu. Improvements in the dezvous with constant memory. The- analysis of Kannan’s CVP algorithm. oretical Computer Science, 621(??): Theoretical Computer Science, 621 57–72, ???? 2016. CODEN TC- (??):103–112, ???? 2016. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516000499. article/pii/S0304397516000621. Su:2016:BWT Anonymous:2016:EBq [747] Yu-Hsuan Su, Ching-Chi Lin, and [751] Anonymous. Editorial Board. The- D. T. Lee. Broadcasting in weighted oretical Computer Science, 622(??): trees under the postal model. The- iii–ix, April 4, 2016. CODEN oretical Computer Science, 621(??): TCSCDI. ISSN 0304-3975 (print), REFERENCES 140

1879-2294 (electronic). URL http: oretical Computer Science, 622(??): //www.sciencedirect.com/science/ 45–65, April 4, 2016. CODEN article/pii/S0304397516001493. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Ben-Basat:2016:DLP //www.sciencedirect.com/science/ [752] Ran Ben-Basat, Ariel Gabizon, and article/pii/S0304397516000888. Meirav Zehavi. The k-distinct lan- Garnero:2016:PCD guage: Parameterized automata constructions. Theoretical Computer Sci- [756] Valentin Garnero and Mathias Weller. ence, 622(??):1–15, April 4, 2016. Parameterized certificate dispersal CODEN TCSCDI. ISSN 0304- and its variants. Theoretical Com- 3975 (print), 1879-2294 (electronic). puter Science, 622(??):66–78, April 4, URL http://www.sciencedirect. 2016. CODEN TCSCDI. ISSN 0304- com/science/article/pii/S03043975160005303975. (print), 1879-2294 (electronic). URL http://www.sciencedirect. Belikovetsky:2016:LRG com/science/article/pii/S0304397516000906. [753] Sofia Belikovetsky and Tami Tamir. Yang:2016:EAW Load rebalancing games in dynamic systems with migration costs. The- [757] Yongjie Yang and Jiong Guo. Ex- oretical Computer Science, 622(??): act algorithms for weighted and un- 16–33, April 4, 2016. CODEN weighted Borda manipulation prob- TCSCDI. ISSN 0304-3975 (print), lems. Theoretical Computer Science, 1879-2294 (electronic). URL http: 622(??):79–89, April 4, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516000542. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Mizuki:2016:CBP article/pii/S0304397516001134. [754] Takaaki Mizuki. Card-based proto- Bazgan:2016:FLD cols for securely computing the conjunction of multiple variables. The- [758] Cristina Bazgan, Robert Bredereck, oretical Computer Science, 622(??): Sepp Hartung, André Nichterlein, and 34–44, April 4, 2016. CODEN Gerhard J. Woeginger. Finding large TCSCDI. ISSN 0304-3975 (print), degree-anonymous subgraphs is hard. 1879-2294 (electronic). URL http: Theoretical Computer Science, 622 //www.sciencedirect.com/science/ (??):90–110, April 4, 2016. CODEN article/pii/S0304397516000839. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Chen:2016:TSS //www.sciencedirect.com/science/ [755] Youjun Chen, Lingfa Lu, and Jin- article/pii/S0304397516001146. jiang Yuan. Two-stage scheduling on Fuchs:2016:PNR identical machines with assignable delivery times to minimize the maxi- [759] M. Fuchs, C.-K. Lee, and G.- mum delivery completion time. The- R. Yu. On 2-protected nodes in REFERENCES 141

random digital trees. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 622(??):111– //www.sciencedirect.com/science/ 122, April 4, 2016. CODEN TC- article/pii/S0304397515007665. SCDI. ISSN 0304-3975 (print), Sosik:2016:SPC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [764] Petr Sos´ık and Miroslav Langer. Small article/pii/S0304397516001171. (purely) catalytic P systems sim- Anonymous:2016:EBr ulating register machines. Theo- retical Computer Science, 623(??): [760] Anonymous. Editorial Board. The- 65–74, April 11, 2016. CODEN oretical Computer Science, 623(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, April 11, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751500849X. //www.sciencedirect.com/science/ Li:2016:LBS article/pii/S0304397516001675. Kari:2016:Ea [765] Lvzhou Li and Daowen Qiu. Lower bounds on the size of semi-quantum [761] Lila Kari. Editorial. Theoret- ﬁnite automata. Theoretical Com- ical Computer Science, 623(??):1, puter Science, 623(??):75–82, April 11, April 11, 2016. CODEN TC- 2016. CODEN TCSCDI. ISSN 0304- SCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397515008713. article/pii/S0304397516001742. Pan:2016:FMP Garcia-Ramos:2016:LBE [766] Linqiang Pan, Gheorghe Paun, and [762] Felipe Garc´ıa-Ramos. Limit behaviour Bosheng Song. Flat maximal par- of µ-equicontinuous cellular automata. allelism in P systems with promot- Theoretical Computer Science, 623 ers. Theoretical Computer Science, 623 (??):2–14, April 11, 2016. CODEN (??):83–91, April 11, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515007306. article/pii/S0304397515009202. Colvin:2016:MAN Aman:2016:MVW [763] Robert J. Colvin. Modelling and [767] Bogdan Aman and Gabriel Ciobanu. analysing neural networks using a Modelling and veriﬁcation of weighted hybrid process algebra. Theoret- spiking neural systems. Theoret- ical Computer Science, 623(??):15– ical Computer Science, 623(??):92– 64, April 11, 2016. CODEN TC- 102, April 11, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), REFERENCES 142

1879-2294 (electronic). URL http: on the ellipsoid model. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 623(??):160– article/pii/S0304397515009792. 179, April 11, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), Azimi:2016:CMC 1879-2294 (electronic). URL http: [768] Sepinoud Azimi, Cristian Gratie, //www.sciencedirect.com/science/ Sergiu Ivanov, Luca Manzoni, Ion Pe- article/pii/S030439751501172X. tre, and Antonio E. Porreca. Com- Wu:2016:CLS plexity of model checking for reaction systems. Theoretical Computer [772] Tingfang Wu, Zhiqiang Zhang, Gheo- Science, 623(??):103–113, April 11, rghe Paun, and Linqiang Pan. Cell- 2016. CODEN TCSCDI. ISSN 0304- like spiking neural P systems. The- 3975 (print), 1879-2294 (electronic). oretical Computer Science, 623(??): URL http://www.sciencedirect. 180–189, April 11, 2016. CODEN com/science/article/pii/S0304397515011263TCSCDI.. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Barbuti:2016:IDC //www.sciencedirect.com/science/ [769] Roberto Barbuti, Roberta Gori, article/pii/S0304397515012190. Francesca Levi, and Paolo Mi- Anonymous:2016:EBs lazzo. Investigating dynamic causalities in reaction systems. Theo- [773] Anonymous. Editorial Board. The- retical Computer Science, 623(??): oretical Computer Science, 624(??): 114–145, April 11, 2016. CODEN iii–ix, April 18, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515011275. article/pii/S0304397516001870. Chen:2016:CV Frosini:2016:ADG [770] Xu Chen, Mario J. Pérez-Jiménez, [774] Andrea Frosini and Simone Rinaldi. Luis Valencia-Cabrera, Beizhan Wang, Advances in discrete geometry for and Xiangxiang Zeng. Computing computer imagery: Preface. The- with viruses. Theoretical Computer oretical Computer Science, 624(??): Science, 623(??):146–159, April 11, 1, April 18, 2016. CODEN TC- 2016. CODEN TCSCDI. ISSN 0304- SCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397515011457article/pii/S0304397516001948. . Hellwig:2016:MSC Esbelin:2016:SCB [771] Michael Hellwig and Hans-Georg [775] Henri-Alex Esbelin and Rémy Malgo- Beyer. Mutation strength con- uyres. Sparse convolution-based dig- trol via meta evolution strategies ital derivatives, fast estimation for REFERENCES 143

noisy signals and approximation re- //www.sciencedirect.com/science/ sults. Theoretical Computer Science, article/pii/S0304397515010178. 624(??):2–24, April 18, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Lachaud:2016:OSA 1879-2294 (electronic). URL http: [779] Jacques-Olivier Lachaud, Xavier Proven¸cal, //www.sciencedirect.com/science/ and Tristan Roussillon. An output- article/pii/S0304397515011792. sensitive algorithm to compute the normal vector of a digital plane. The- Karmakar:2016:RGB oretical Computer Science, 624(??): [776] Nilanjana Karmakar, Arindam Biswas, 73–88, April 18, 2016. CODEN and Partha Bhowmick. Reeb graph TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL based segmentation of articulated com- http: ponents of 3D digital objects. The- //www.sciencedirect.com/science/ . oretical Computer Science, 624(??): article/pii/S0304397515010828 25–40, April 18, 2016. CODEN Brunetti:2016:BAD TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [780] S. Brunetti, P. Dulio, and C. Peri. //www.sciencedirect.com/science/ On bounded additivity in discrete article/pii/S0304397515010105. tomography. Theoretical Computer Science, 624(??):89–100, April 18, Gerard:2016:TBQ 2016. CODEN TCSCDI. ISSN 0304- 3975 (print), 1879-2294 (electronic). [777] Yan Gerard, Antoine Vacavant, and URL http://www.sciencedirect. Jean-Marie Favreau. Tight bounds com/science/article/pii/S030439751501083X. in the quadtree complexity theorem and the maximal number of pixels Domenjoud:2016:PLT crossed by a curve of given length. [781] Eric Domenjoud, Xavier Proven¸cal, Theoretical Computer Science, 624 and Laurent Vuillon. Palindromic lan- (??):41–55, April 18, 2016. CODEN guage of thin discrete planes. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 624(??): 1879-2294 (electronic). URL http: 101–108, April 18, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), . article/pii/S0304397515011767 1879-2294 (electronic). URL http: Biswas:2016:PQO //www.sciencedirect.com/science/ article/pii/S0304397515010841. [778] Ranita Biswas and Partha Bhowmick. Frosini:2016:GPM From prima quadraginta octant to lattice sphere through primi- [782] Andrea Frosini, Veronica Guerrini, tive integer operations. Theoret- and Simone Rinaldi. Geomet- ical Computer Science, 624(??):56– ric properties of matrices induced 72, April 18, 2016. CODEN TC- by pattern avoidance. Theoreti- SCDI. ISSN 0304-3975 (print), cal Computer Science, 624(??):109– 1879-2294 (electronic). URL http: 120, April 18, 2016. CODEN TC- REFERENCES 144

SCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 625 1879-2294 (electronic). URL http: (??):1–24, April 25, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515010099. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Masse:2016:EOD article/pii/S0304397516000505. [783] Alexandre Blondin Massé, Srecko Br- lek, and Hugo Tremblay. Efficient Lanese:2016:RHO operations on discrete paths. The- oretical Computer Science, 624(??): [787] Ivan Lanese, Claudio Antares Mezzina, 121–135, April 18, 2016. CODEN and Jean-Bernard Stefani. Reversibil- TCSCDI. ISSN 0304-3975 (print), ity in the higher-order π-calculus. The- 1879-2294 (electronic). URL http: oretical Computer Science, 625(??): //www.sciencedirect.com/science/ 25–84, April 25, 2016. CODEN article/pii/S0304397515006672. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Brocchi:2016:RCP //www.sciencedirect.com/science/ article/pii/S0304397516001419. [784] Stefano Brocchi, Paolo Dulio, and Silvia M. C. Pagani. Reconstruc- Benerecetti:2016:TRS tion of convex polyominoes with a blocking component. Theoreti- [788] Massimo Benerecetti and Adriano cal Computer Science, 624(??):136– Peron. Timed recursive state ma- 146, April 18, 2016. CODEN TC- chines: Expressiveness and complex- SCDI. ISSN 0304-3975 (print), ity. Theoretical Computer Science, 625 1879-2294 (electronic). URL http: (??):85–124, April 25, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515011779. 1879-2294 (electronic). URL http: Anonymous:2016:EBt //www.sciencedirect.com/science/ article/pii/S0304397516001432. [785] Anonymous. Editorial Board. The- oretical Computer Science, 625(??): Aschieri:2016:NDC iii–ix, April 25, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [789] Federico Aschieri and Margherita 1879-2294 (electronic). URL http: Zorzi. On natural deduction in clas- //www.sciencedirect.com/science/ sical first-order logic: Curry–Howard article/pii/S0304397516002140. correspondence, strong normalization Gange:2016:CRP and Herbrand’s theorem. Theo- retical Computer Science, 625(??): [786] Graeme Gange, Jorge A. Navas, Pe- 125–146, April 25, 2016. CODEN ter Schachte, Harald Søndergaard, and TCSCDI. ISSN 0304-3975 (print), Peter J. Stuckey. A complete re- 1879-2294 (electronic). URL http: finement procedure for regular sep- //www.sciencedirect.com/science/ arability of context-free languages. article/pii/S0304397516001596. REFERENCES 145

Anonymous:2016:EBu Pouly:2016:CCS

[790] Anonymous. Editorial Board. The- [794] Amaury Pouly and Daniel S. Gra¸ca. oretical Computer Science, 626(??): Computational complexity of solv- iii–ix, May 2, 2016. CODEN TC- ing polynomial differential equations SCDI. ISSN 0304-3975 (print), over unbounded domains. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 626(??):67– //www.sciencedirect.com/science/ 82, May 2, 2016. CODEN TC- article/pii/S0304397516002280. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Hudry:2016:MRC //www.sciencedirect.com/science/ [791] Olivier Hudry and Antoine Lob- article/pii/S0304397516000918. stein. More results on the complex- Jain:2016:TAS ity of identifying problems in graphs. Theoretical Computer Science, 626 [795] Sanjay Jain, Bakhadyr Khoussainov, (??):1–12, May 2, 2016. CODEN Philipp Schlicht, and Frank Stephan. TCSCDI. ISSN 0304-3975 (print), Tree-automatic scattered linear or- 1879-2294 (electronic). URL http: ders. Theoretical Computer Science, //www.sciencedirect.com/science/ 626(??):83–96, May 2, 2016. CODEN article/pii/S0304397516000451. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: deRougemont:2016:ACT //www.sciencedirect.com/science/ [792] Michel de Rougemont and Adrien Vieil- article/pii/S0304397516001183. leribière. Approximate consistency for Radons:2016:DSP transformations on words and trees. Theoretical Computer Science, 626 [796] Manuel Radons. Direct solution (??):13–39, May 2, 2016. CODEN of piecewise linear systems. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 626(??): 1879-2294 (electronic). URL http: 97–109, May 2, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516000566. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Cournier:2016:EPS article/pii/S0304397516001304. [793] Alain Cournier, Ajoy K. Datta, Datta:2016:CSS Stéphane Devismes, Franck Petit, and Vincent Villain. The expres- [797] Ajoy K. Datta, Stéphane Devismes, sive power of snap-stabilization. The- Karel Heurtefeux, Lawrence L. Lar- oretical Computer Science, 626(??): more, and Yvan Rivierre. Competi- 40–66, May 2, 2016. CODEN tive self-stabilizing k-clustering. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 626(??): 1879-2294 (electronic). URL http: 110–133, May 2, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516000608. 1879-2294 (electronic). URL http: REFERENCES 146

//www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516001316. //www.sciencedirect.com/science/ article/pii/S0304397516001341. Reich:2016:CML Ben-Moshe:2016:OBA [798] Alexander Reich. Complexity of the maximum leaf spanning tree problem [802] Boaz Ben-Moshe, Michael Elkin, Lee- on planar and regular graphs. The- Ad Gottlieb, and Eran Omri. Op- oretical Computer Science, 626(??): timizing budget allocation for cen- 134–143, May 2, 2016. CODEN ter and median points. Theoret- TCSCDI. ISSN 0304-3975 (print), ical Computer Science, 627(??):13– 1879-2294 (electronic). URL http: 25, May 9, 2016. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397516001328. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Yuan:2016:GNC article/pii/S0304397516001353.

[799] Jun Yuan, Aixia Liu, Xiao Qin, Jifu Qiu:2016:ACA Zhang, and Jing Li. g-Good-neighbor [803] Xian Qiu and Walter Kern. Approx- conditional diagnosability measures imate core allocations and integral- for 3-ary n-cube networks. The- ity gap for the bin packing game. oretical Computer Science, 626(??): Theoretical Computer Science, 627 144–162, May 2, 2016. CODEN (??):26–35, May 9, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751600133X. article/pii/S0304397516001407. Anonymous:2016:EBv Hao:2016:RBC [800] Anonymous. Editorial Board. The- [804] Rong-Xia Hao, Zeng-Xian Tian, and oretical Computer Science, 627(??): Jun-Ming Xu. Relationship between iii–ix, May 9, 2016. CODEN TC- conditional diagnosability and 2-extra SCDI. ISSN 0304-3975 (print), connectivity of symmetric graphs. 1879-2294 (electronic). URL http: Theoretical Computer Science, 627 //www.sciencedirect.com/science/ (??):36–53, May 9, 2016. CODEN article/pii/S0304397516300056. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Glacet:2016:IDE //www.sciencedirect.com/science/ [801] Christian Glacet, Nicolas Hanusse, and article/pii/S0304397516001559. David Ilcinkas. The impact of dynamic Losemann:2016:CPD events on the number of errors in networks. Theoretical Computer Science, [805] Katja Losemann, Wim Martens, and 627(??):1–12, May 9, 2016. CODEN Matthias Niewerth. Closure prop- TCSCDI. ISSN 0304-3975 (print), erties and descriptional complexity REFERENCES 147

of deterministic regular expressions. bipancyclicity of faulty folded hyper- Theoretical Computer Science, 627 cubes. Theoretical Computer Science, (??):54–70, May 9, 2016. CODEN 627(??):102–106, May 9, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516001584. article/pii/S0304397516001602. Ibarra:2016:EEM Kinnersley:2016:CFR [806] Oscar H. Ibarra and Ian McQuil- [810] William B. Kinnersley, Pawel Pralat, lan. The eﬀect of end-markers on and Douglas B. West. To catch a falling counter machines and commutativ- robber. Theoretical Computer Science, ity. Theoretical Computer Science, 627 627(??):107–111, May 9, 2016. CODEN (??):71–81, May 9, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516001614. article/pii/S0304397516001766. Anonymous:2016:EBw Yang:2016:CFT [811] Anonymous. Editorial Board. The- [807] Da-Wei Yang and Mei-Mei Gu. Condi- oretical Computer Science, 630(??): tional fault-tolerant edge-bipancyclicity iii–ix, May 30, 2016. CODEN of hypercubes with faulty vertices and TCSCDI. ISSN 0304-3975 (print), edges. Theoretical Computer Science, 1879-2294 (electronic). URL http: 627(??):82–89, May 9, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516300767. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Angel:2016:TMM article/pii/S0304397516001791. [812] Eric Angel, Evripidis Bampis, Vin- Sopena:2016:MNS cent Chau, and Nguyen Kim Thang. Throughput maximization in mul- [808] Eric´ Sopena. i-Mark: a new sub- tiprocessor speed-scaling. Theoret- traction division game. Theoreti- ical Computer Science, 630(??):1– cal Computer Science, 627(??):90– 12, May 30, 2016. CODEN TC- 101, May 9, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751600222X. article/pii/S0304397516001808. Yen:2016:WRD Kuo:2016:EPE [813] William Chung-Kung Yen. Weighted [809] Che-Nan Kuo and Iain A. Stew- restrained domination in subclasses art. Edge-pancyclicity and edge- of planar graphs. Theoretical REFERENCES 148

Computer Science, 630(??):13–25, Wang:2016:SCA May 30, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), [817] Qi Wang, Xiubin Fan, Hongyan Zang, 1879-2294 (electronic). URL http: and Yu Wang. The space com- //www.sciencedirect.com/science/ plexity analysis in the general num- article/pii/S0304397516002334. ber field sieve integer factorization. Theoretical Computer Science, 630 Busbait:2016:DTT (??):76–94, May 30, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [814] Monther Busbait and Mikhail Moshkov. 1879-2294 (electronic). URL http: Diagnosis of three types of con- //www.sciencedirect.com/science/ stant faults in read-once contact net- article/pii/S0304397516300172. works over finite bases. Theoret- Sakai:2016:CDN ical Computer Science, 630(??):26– 42, May 30, 2016. CODEN TC- [818] Yusuke Sakai, Keita Emura, Jacob SCDI. ISSN 0304-3975 (print), C. N. Schuldt, Goichiro Hanaoka, 1879-2294 (electronic). URL http: and Kazuo Ohta. Constructions of //www.sciencedirect.com/science/ dynamic and non-dynamic thresh- article/pii/S0304397516002346. old public-key encryption schemes with decryption consistency. The- Hoffmann:2016:LTA oretical Computer Science, 630(??): 95–116, May 30, 2016. CODEN [815] Stefan Hoffmann, Alina Elterman, and TCSCDI. ISSN 0304-3975 (print), Egon Wanke. A linear time algorithm 1879-2294 (electronic). URL http: for metric dimension of cactus block //www.sciencedirect.com/science/ graphs. Theoretical Computer Science, article/pii/S0304397516300317. 630(??):43–62, May 30, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Xu:2016:AAS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [819] Dachuan Xu, Fengmin Wang, Donglei article/pii/S0304397516002358. Du, and Chenchen Wu. Approxima- tion algorithms for submodular vertex Golovach:2016:EMC cover problems with linear/submodular penalties using primal-dual technique. [816] Petr A. Golovach, Pinar Heggernes, Theoretical Computer Science, 630(??): and Dieter Kratsch. Enumerating 117–125, May 30, 2016. CODEN minimal connected dominating sets in TCSCDI. ISSN 0304-3975 (print), graphs of bounded chordality. The- 1879-2294 (electronic). URL http: oretical Computer Science, 630(??): //www.sciencedirect.com/science/ 63–75, May 30, 2016. CODEN article/pii/S0304397516300330. TCSCDI. ISSN 0304-3975 (print), Anonymous:2016:EBx 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [820] Anonymous. Editorial Board. The- article/pii/S0304397516300159. oretical Computer Science, 631(??): REFERENCES 149

iii–ix, June 6, 2016. CODEN TC- Theoretical Computer Science, 631 SCDI. ISSN 0304-3975 (print), (??):73–96, June 6, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516300858. //www.sciencedirect.com/science/ article/pii/S0304397516300329. Hanikova:2016:TSF Kahl:2016:TAH [821] Zuzana Haniková and Petr Savický. Term satisfiability in FLew-algebras. [825] Thomas Kahl. Topological abstrac- Theoretical Computer Science, 631 tion of higher-dimensional automata. (??):1–15, June 6, 2016. CODEN Theoretical Computer Science, 631 TCSCDI. ISSN 0304-3975 (print), (??):97–117, June 6, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516001997. //www.sciencedirect.com/science/ article/pii/S0304397516300573. Cassez:2016:CSN Bozzelli:2016:FBS [822] Franck Cassez, Ron van der Mey- den, and Chenyi Zhang. The com- [826] Laura Bozzelli and César Sánchez. plexity of synchronous notions of in- Foundations of Boolean stream run- formation flow security. Theoret- time verification. Theoretical Com- ical Computer Science, 631(??):16– puter Science, 631(??):118–138, June 6, 42, June 6, 2016. CODEN TC- 2016. CODEN TCSCDI. ISSN 0304- SCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397516300585. article/pii/S0304397516002048. Forejt:2016:ERT Ferrara:2016:GFH [827] Vojtech Forejt, Marta Kwiatkowska, [823] Pietro Ferrara. A generic frame- Gethin Norman, and Ashutosh Trivedi. work for heap and value analyses Expected reachability-time games. of object-oriented programming lan- Theoretical Computer Science, 631(??): guages. Theoretical Computer Science, 139–160, June 6, 2016. CODEN 631(??):43–72, June 6, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516300603. article/pii/S0304397516300299. Anonymous:2016:EBy AlAmeen:2016:CRP [828] Anonymous. Editorial Board. The- [824] Mahmudul Faisal Al Ameen and oretical Computer Science, 632(??): Makoto Tatsuta. Completeness for re- iii–ix, June 13, 2016. CODEN cursive procedures in separation logic. TCSCDI. ISSN 0304-3975 (print), REFERENCES 150

1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516300986. article/pii/S0304397515005435.

Kari:2016:Eb Petersen:2016:SGS

[829] Lila Kari. Editorial. Theoret- [833] Rasmus L. Petersen, Matthew R. ical Computer Science, 632(??):1, Lakin, and Andrew Phillips. A June 13, 2016. CODEN TC- strand graph semantics for DNA- SCDI. ISSN 0304-3975 (print), based computation. Theoretical 1879-2294 (electronic). URL http: Computer Science, 632(??):43–73, //www.sciencedirect.com/science/ June 13, 2016. CODEN TC- article/pii/S0304397516301001. SCDI. ISSN 0304-3975 (print), Kwiatkowska:2016:P 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [830] Marta Kwiatkowska, Andrew Phillips, article/pii/S0304397515006866. and Chris Thachuk. Preface. The- oretical Computer Science, 632(??): Anonymous:2016:EBz 2–3, June 13, 2016. CODEN TC- [834] Anonymous. Editorial Board. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 633(??): 1879-2294 (electronic). URL http: iii–ix, June 20, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516301013. 1879-2294 (electronic). URL http: Hagiya:2016:MCM //www.sciencedirect.com/science/ article/pii/S0304397516301293. [831] Masami Hagiya, Nathanael Aubert- Kato, Shaoyu Wang, and Satoshi Ko- Kari:2016:Ec bayashi. Molecular computers for molecular robots as hybrid systems. [835] Lila Kari. Editorial. Theoret- Theoretical Computer Science, 632 ical Computer Science, 633(??):1, (??):4–20, June 13, 2016. CODEN June 20, 2016. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515009767. article/pii/S0304397516301323. Lakin:2016:MVC Siegelmann:2016:P [832] Matthew R. Lakin, Darko Stefanovic, [836] Hava T. Siegelmann. Preface. The- and Andrew Phillips. Modular veri- oretical Computer Science, 633(??): ﬁcation of chemical reaction network 2–3, June 20, 2016. CODEN TC- encodings via serializability analysis. SCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 632 1879-2294 (electronic). URL http: (??):21–42, June 13, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516301311. REFERENCES 151

Alden:2016:MED Kozma:2016:PBC [837] Matthew Alden and Risto Mi- [841] Robert Kozma and Marko Puljic. ikkulainen. MARLEDA: Effec- Pattern-based computing via sequen- tive distribution estimation through tial phase transitions in hierarchical Markov random fields. Theoret- mean field neuropercolation. The- ical Computer Science, 633(??):4– oretical Computer Science, 633(??): 18, June 20, 2016. CODEN TC- 54–70, June 20, 2016. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515006945. article/pii/S0304397515007252. Cheney:2016:TEE Schindewolf:2016:CPN [838] Nick Cheney and Hod Lipson. Topolog- [842] Craig Schindewolf, Dongwook Kim, ical evolution for embodied cellular au- Andrea Bel, and Horacio G. Rot- tomata. Theoretical Computer Science, stein. Complex patterns in net- 633(??):19–27, June 20, 2016. CODEN works of hyperexcitable neurons. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 633(??): 1879-2294 (electronic). URL http: 71–82, June 20, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515005344. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Harrington:2016:CBM article/pii/S0304397515005162. [839] Kyle I. S. Harrington. A circuit Betti:2016:PLC basis for morphogenesis. Theoret- ical Computer Science, 633(??):28– [843] Alessandro Betti and Marco Gori. 36, June 20, 2016. CODEN TC- The principle of least cognitive ac- SCDI. ISSN 0304-3975 (print), tion. Theoretical Computer Science, 1879-2294 (electronic). URL http: 633(??):83–99, June 20, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515006234. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Yo o:2016:MPN article/pii/S0304397515005526. [840] Yongseok Yoo, O. Ozan Koyluoglu, Rodriguez:2016:GMB Sriram Vishwanath, and Ila Fiete. Multi-periodic neural coding for adap- [844] A. Rodriguez and R. Granger. The tive information transfer. Theo- grammar of mammalian brain capac- retical Computer Science, 633(??): ity. Theoretical Computer Science, 633 37–53, June 20, 2016. CODEN (??):100–111, June 20, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516001572. article/pii/S0304397516002231. REFERENCES 152

Anselmi:2016:ULI Goldberg:2016:CCL

[845] Fabio Anselmi, Joel Z. Leibo, Lorenzo [849] Leslie Ann Goldberg and Mark Jer- Rosasco, Jim Mutch, Andrea Tac- rum. The complexity of count- chetti, and Tomaso Poggio. Un- ing locally maximal satisfying as- supervised learning of invariant rep- signments of Boolean CSPs. The- resentations. Theoretical Computer oretical Computer Science, 634(??): Science, 633(??):112–121, June 20, 35–46, June 27, 2016. CODEN 2016. CODEN TCSCDI. ISSN 0304- TCSCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397515005587article/pii/S0304397516300366. . Anonymous:2016:EBba Chen:2016:LBL

[846] Anonymous. Editorial Board. The- [850] Wenbin Chen, Hao Lei, and Ke Qi. oretical Computer Science, 634(??): Lattice-based linearly homomorphic iii–ix, June 27, 2016. CODEN signatures in the standard model. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 634(??): 1879-2294 (electronic). URL http: 47–54, June 27, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516301505. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Michail:2016:TSP article/pii/S0304397516300378. [847] Othon Michail and Paul G. Spi- Bhattacharya:2016:TLB rakis. Traveling salesman problems in temporal graphs. Theo- [851] Anup Bhattacharya, Ragesh Jaiswal, retical Computer Science, 634(??): and Nir Ailon. Tight lower bound in- 1–23, June 27, 2016. CODEN stances for k-means++ in two dimen- TCSCDI. ISSN 0304-3975 (print), sions. Theoretical Computer Science, 1879-2294 (electronic). URL http: 634(??):55–66, June 27, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516300342. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Park:2016:PMM article/pii/S0304397516300512. [848] Jung-Heum Park. Paired many- Mavronicolas:2016:CER to-many disjoint path covers in restricted hypercube-like graphs. The- [852] Marios Mavronicolas and Burkhard oretical Computer Science, 634(??): Monien. The complexity of equilib- 24–34, June 27, 2016. CODEN ria for risk-modeling valuations. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 634(??): 1879-2294 (electronic). URL http: 67–96, June 27, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516300354. 1879-2294 (electronic). URL http: REFERENCES 153

//www.sciencedirect.com/science/ iii–ix, July 4, 2016. CODEN TC- article/pii/S0304397516300524. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Lin:2016:SCS //www.sciencedirect.com/science/ article/pii/S0304397516301712. [853] Cheng-Kuan Lin, Lili Zhang, Jianxi Fan, and Dajin Wang. Structure Wang:2016:WRA connectivity and substructure connectivity of hypercubes. Theoret- [857] Qichao Wang and Friedrich Otto. ical Computer Science, 634(??):97– Weighted restarting automata and 107, June 27, 2016. CODEN TC- pushdown relations. Theoretical Com- SCDI. ISSN 0304-3975 (print), puter Science, 635(??):1–15, July 4, 1879-2294 (electronic). URL http: 2016. CODEN TCSCDI. ISSN 0304- //www.sciencedirect.com/science/ 3975 (print), 1879-2294 (electronic). article/pii/S0304397516300536. URL http://www.sciencedirect. com/science/article/pii/S0304397516301116. Kameda:2016:APE Fici:2016:APR [854] Tsunehiko Kameda, Ichiro Suzuki, [858] Gabriele Fici, Alessio Langiu, Thierry and Masafumi Yamashita. An al- Lecroq, Arnaud Lefebvre, Filippo ternative proof for the equivalence Mignosi, Jarkko Peltom¨aki, and Elise´ of ∞-searcher and 2-searcher. The- Prieur-Gaston. Abelian powers and oretical Computer Science, 634(??): repetitions in Sturmian words. The- 108–119, June 27, 2016. CODEN oretical Computer Science, 635(??): TCSCDI. ISSN 0304-3975 (print), 16–34, July 4, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751630055X. //www.sciencedirect.com/science/ Khanteimouri:2016:EAC article/pii/S0304397516301128.

[855] Payam Khanteimouri, Ali Mohades, Rute:2016:WDR Mohammad Ali Abam, and Moham- [859] Jason Rute. When does random- mad Reza Kazemi. Eﬃciently approx- ness come from randomness? The- imating color-spanning balls. The- oretical Computer Science, 635(??): oretical Computer Science, 634(??): 35–50, July 4, 2016. CODEN 120–126, June 27, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516301141. article/pii/S0304397516300615. Barnabei:2016:SPD Anonymous:2016:EBbb [860] Marilena Barnabei, Flavio Bonetti, [856] Anonymous. Editorial Board. The- Niccol`o Castronuovo, and Robert Cori. oretical Computer Science, 635(??): Some permutations on Dyck words. REFERENCES 154

Theoretical Computer Science, 635 with one wildcard. Theoreti- (??):51–63, July 4, 2016. CODEN cal Computer Science, 635(??):94– TCSCDI. ISSN 0304-3975 (print), 101, July 4, 2016. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516301207. //www.sciencedirect.com/science/ article/pii/S0304397516301608. Hu:2016:SMP Anonymous:2016:EBbc [861] Xiaomin Hu, Yingzhi Tian, Xi- aodong Liang, and Jixiang Meng. [865] Anonymous. Editorial Board. The- Strong matching preclusion for n- oretical Computer Science, 636(??): dimensional torus networks. The- iii–ix, July 11, 2016. CODEN oretical Computer Science, 635(??): TCSCDI. ISSN 0304-3975 (print), 64–73, July 4, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516301906. //www.sciencedirect.com/science/ article/pii/S0304397516301219. Brandenburg:2016:RDI Dourado:2016:CRA [866] Franz J. Brandenburg, Walter Didimo, [862] Mitre Costa Dourado. Comput- William S. Evans, Philipp Kinder- ing role assignments of split graphs. mann, Giuseppe Liotta, and Fab- Theoretical Computer Science, 635 rizio Montecchiani. Recognizing and (??):74–84, July 4, 2016. CODEN drawing IC-planar graphs. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 636(??):1– 1879-2294 (electronic). URL http: 16, July 11, 2016. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397516301244. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ He:2016:CRP article/pii/S0304397516300652.

[863] Yong He, Zhenhe Cui, and Zihan Dolev:2016:MCG Yuan. Conjugacy relations of preﬁx codes. Theoretical Computer Science, [867] Shlomi Dolev, Ephraim Korach, Xim- 635(??):85–93, July 4, 2016. CODEN ing Li, Yin Li, and Galit Uzan. TCSCDI. ISSN 0304-3975 (print), Magnifying computing gaps: Es- 1879-2294 (electronic). URL http: tablishing encrypted communication //www.sciencedirect.com/science/ over unidirectional channels. The- article/pii/S0304397516301578. oretical Computer Science, 636(??): Lewenstein:2016:DRO 17–26, July 11, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [864] Moshe Lewenstein, J. Ian Munro, 1879-2294 (electronic). URL http: Yakov Nekrich, and Sharma V. //www.sciencedirect.com/science/ Thankachan. Document retrieval article/pii/S0304397516300718. REFERENCES 155

Seraﬁno:2016:HFL Groshaus:2016:TLB

[868] Paolo Serafino and Carmine Ventre. [872] Marina Groshaus and Leandro Mon- Heterogeneous facility location without tero. Tight lower bounds on the money. Theoretical Computer Science, number of bicliques in false-twin-free 636(??):27–46, July 11, 2016. CODEN graphs. Theoretical Computer Science, TCSCDI. ISSN 0304-3975 (print), 636(??):77–84, July 11, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516300925. //www.sciencedirect.com/science/ article/pii/S0304397516301633. DiGiacomo:2016:LUB Bang-Jensen:2016:FGPa [869] Emilio Di Giacomo, Giuseppe Li- otta, and Tamara Mchedlidze. Lower [873] J. Bang-Jensen and Frédéric Havet. and upper bounds for long induced Finding good 2-partitions of digraphs paths in 3-connected planar graphs. I. Hereditary properties. Theoret- Theoretical Computer Science, 636 ical Computer Science, 636(??):85– (??):47–55, July 11, 2016. CODEN 94, July 11, 2016. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516300937. article/pii/S0304397516301657. Kosolobov:2016:FLC Prodinger:2016:BOE [870] Dmitry Kosolobov. Finding the leftmost critical factorization on [874] Helmut Prodinger. Batcher’s odd- unordered alphabet. Theoreti- even exchange revisited: a gener- cal Computer Science, 636(??):56– ating functions approach. Theo- 65, July 11, 2016. CODEN TC- retical Computer Science, 636(??): SCDI. ISSN 0304-3975 (print), 95–100, July 11, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516301104. //www.sciencedirect.com/science/ article/pii/S0304397516301414. Brandenburg:2016:RCS Anonymous:2016:EBbd [871] Franz J. Brandenburg and Andreas Gleißner. Ranking chain sum or- [875] Anonymous. Editorial Board. The- ders. Theoretical Computer Science, oretical Computer Science, 637(??): 636(??):66–76, July 11, 2016. CODEN iii–ix, July 18, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516301621. article/pii/S0304397516302031. REFERENCES 156

Chambart:2016:FAM Shiftan:2016:SIS

[876] Pierre Chambart, Alain Finkel, and [880] Ariel Shiftan and Ely Porat. Set Sylvain Schmitz. Forward analysis intersection and sequence matching and model checking for trace bounded with mismatch counting. Theoret- WSTS. Theoretical Computer Science, ical Computer Science, 638(??):3– 637(??):1–29, July 18, 2016. CODEN 10, July 25, 2016. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516300597. article/pii/S0304397516000049. Courtault:2016:LSM Benson:2016:LRS [881] G. Benson, A. Levy, S. Maimoni, [877] Jean-Ren´e Courtault, Didier Galmiche, D. Noifeld, and B. R. Shalom. LCSk: and David Pym. A logic of a reﬁned similarity measure. The- separating modalities. Theoreti- oretical Computer Science, 638(??): cal Computer Science, 637(??):30– 11–26, July 25, 2016. CODEN 58, July 18, 2016. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397515010877. article/pii/S030439751630113X. Butman:2016:PSM Anonymous:2016:EBbe [882] Ayelet Butman, Noa Lewenstein, and [878] Anonymous. Editorial Board. The- J. Ian Munro. Permuted scaled match- oretical Computer Science, 638(??): ing. Theoretical Computer Science, 638 iii–ix, July 25, 2016. CODEN (??):27–32, July 25, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516302122. article/pii/S030439751600178X. Benson:2016:SIH Brodal:2016:TDR [879] Gary Benson, Martin Farach-Colton, [883] Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, and Ely Porat. Moshe Lewenstein, Rajeev Raman, and Special issue in honor of the 60th Srinivasa Rao Satti. Two dimensional birthday of Amihood Amir. The- range minimum queries and Fibonacci oretical Computer Science, 638(??): lattices. Theoretical Computer Science, 1–2, July 25, 2016. CODEN TC- 638(??):33–43, July 25, 2016. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516302195. article/pii/S0304397516001389. REFERENCES 157

Kopelowitz:2016:PST Munro:2016:FCW

[884] Tsvi Kopelowitz. The property suffix [888] J. Ian Munro, Yakov Nekrich, and tree with dynamic properties. The- Jeffrey S. Vitter. Fast construc- oretical Computer Science, 638(??): tion of wavelet trees. Theoreti- 44–51, July 25, 2016. CODEN cal Computer Science, 638(??):91– TCSCDI. ISSN 0304-3975 (print), 97, July 25, 2016. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516001754. //www.sciencedirect.com/science/ article/pii/S0304397515010087. Klein:2016:CMF Bille:2016:LCE [885] Shmuel T. Klein and Dana Shapira. [889] Philip Bille, Pawel Gawrychowski, Compressed matching for feature vec- Inge Li Gørtz, Gad M. Landau, tors. Theoretical Computer Science, and Oren Weimann. Longest com- 638(??):52–62, July 25, 2016. CODEN mon extensions in trees. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 638(??): 1879-2294 (electronic). URL http: 98–107, July 25, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515011822. 1879-2294 (electronic). URL http: Beigel:2016:SDP //www.sciencedirect.com/science/ article/pii/S030439751500729X. [886] Richard Beigel and William Gasarch. Navarro:2016:RCS On the sizes of DPDAs, PDAs, LBAs. Theoretical Computer Science, 638 [890] Gonzalo Navarro and Sharma V. (??):63–75, July 25, 2016. CODEN Thankachan. Reporting consec- TCSCDI. ISSN 0304-3975 (print), utive substring occurrences under 1879-2294 (electronic). URL http: bounded gap constraints. Theo- //www.sciencedirect.com/science/ retical Computer Science, 638(??): article/pii/S0304397515007756. 108–111, July 25, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Apostolico:2016:SSM 1879-2294 (electronic). URL http: [887] Alberto Apostolico, Concettina Guerra, //www.sciencedirect.com/science/ Gad M. Landau, and Cinzia Pizzi. Se- article/pii/S0304397516001158. quence similarity measures based on Babenko:2016:CMM bounded Hamming distance. The- oretical Computer Science, 638(??): [891] Maxim Babenko, Pawel Gawrychowski, 76–90, July 25, 2016. CODEN Tomasz Kociumaka, Ignat Kolesnichenko, TCSCDI. ISSN 0304-3975 (print), and Tatiana Starikovskaya. Com- 1879-2294 (electronic). URL http: puting minimal and maximal suf- //www.sciencedirect.com/science/ fixes of a substring. Theoreti- article/pii/S0304397516000475. cal Computer Science, 638(??):112– REFERENCES 158

121, July 25, 2016. CODEN TC- Na:2016:FIA SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [895] Joong Chae Na, Hyunjoon Kim, Hee- //www.sciencedirect.com/science/ jin Park, Thierry Lecroq, Martine article/pii/S0304397515007707. Léonard, Laurent Mouchard, and Kun- soo Park. FM-index of alignment: a Crochemore:2016:OPI compressed index for similar strings. Theoretical Computer Science, 638(??): [892] Maxime Crochemore, Costas S. Il- 159–170, July 25, 2016. CODEN iopoulos, Tomasz Kociumaka, Marcin TCSCDI. ISSN 0304-3975 (print), Kubica, Alessio Langiu, Solon P. 1879-2294 (electronic). URL http: Pissis, Jakub Radoszewski, Woj- //www.sciencedirect.com/science/ ciech Rytter, and Tomasz Waleń. article/pii/S0304397515007288. Order-preserving indexing. Theo- Crochemore:2016:LSS retical Computer Science, 638(??): 122–135, July 25, 2016. CODEN [896] Maxime Crochemore, Chiara Epi- TCSCDI. ISSN 0304-3975 (print), fanio, Roberto Grossi, and Filippo 1879-2294 (electronic). URL http: Mignosi. Linear-size suffix tries. The- //www.sciencedirect.com/science/ oretical Computer Science, 638(??): article/pii/S0304397515005605. 171–178, July 25, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Gawrychowski:2016:OPP 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [893] Pawe l Gawrychowski and Przemys law article/pii/S0304397516300305. Uznański. Order-preserving pattern matching with k mismatches. The- Anonymous:2016:EBbf oretical Computer Science, 638(??): 136–144, July 25, 2016. CODEN [897] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 639(??): 1879-2294 (electronic). URL http: iii–ix, August 1, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515007690. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Kucherov:2016:ASM article/pii/S0304397516302626. Brewster:2016:DTC [894] Gregory Kucherov, Kamil Salikhov, and Dekel Tsur. Approximate string [898] Richard C. Brewster, Sean McGuin- matching using a bidirectional index. ness, Benjamin Moore, and Jonathan A. Theoretical Computer Science, 638(??): Noel. A dichotomy theorem for cir- 145–158, July 25, 2016. CODEN cular colouring reconfiguration. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 639(??): 1879-2294 (electronic). URL http: 1–13, August 1, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515009494. 1879-2294 (electronic). URL http: REFERENCES 159

//www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516301426. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Araujo:2016:POC article/pii/S0304397516301566. [899] Julio Araujo, Frédéric Havet, Clau- Coudert:2016:DCI dia Linhares Sales, and Ana Silva. Proper orientation of cacti. The- [903] David Coudert and Guillaume Ducoffe. oretical Computer Science, 639(??): Data center interconnection net- 14–25, August 1, 2016. CODEN works are not hyperbolic. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 639(??): 1879-2294 (electronic). URL http: 72–90, August 1, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516301438. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Dehkordi:2016:CRA article/pii/S030439751630161X. [900] Hooman Reisi Dehkordi, Peter Eades, Riechert:2016:ADP Seok-Hee Hong, and Quan Nguyen. Circular right-angle crossing draw- [904] Maik Riechert, Christian Höner ings in linear time. Theoreti- zu Siederdissen, and Peter F. Stadler. cal Computer Science, 639(??):26– Algebraic dynamic programming for 41, August 1, 2016. CODEN TC- multiple context-free grammars. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 639(??): 1879-2294 (electronic). URL http: 91–109, August 1, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751630144X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Lu:2016:PSC article/pii/S0304397516301797. [901] Yang Lu and Jiguo Li. Provably Anonymous:2016:EBbg secure certificateless proxy signature scheme in the standard model. The- [905] Anonymous. Editorial Board. The- oretical Computer Science, 639(??): oretical Computer Science, 640(??): 42–59, August 1, 2016. CODEN iii–ix, August 9, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516301554. article/pii/S0304397516302857. Fernandes:2016:KCP Bang-Jensen:2016:FGPb [902] Cristina G. Fernandes and Mar- [906] J. Bang-Jensen, Nathann Cohen, and cio T. I. Oshiro. Kinetic cluster- Frédéric Havet. Finding good 2- ing of points on the line. The- partitions of digraphs II. Enumer- oretical Computer Science, 639(??): able properties. Theoretical Com- 60–71, August 1, 2016. CODEN puter Science, 640(??):1–19, Au- REFERENCES 160

gust 9, 2016. CODEN TC- stars and cycles. Theoretical Com- SCDI. ISSN 0304-3975 (print), puter Science, 640(??):61–69, Au- 1879-2294 (electronic). URL http: gust 9, 2016. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397516301815. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Piotrow:2016:FMN article/pii/S0304397516302377.

[907] Marek Piotrów. Faster merging net- Golovach:2016:IDP works with a small constant period. Theoretical Computer Science, 640(??): [911] Petr A. Golovach, Daniël Paulusma, 20–40, August 9, 2016. CODEN and Erik Jan van Leeuwen. In- TCSCDI. ISSN 0304-3975 (print), duced disjoint paths in circular-arc 1879-2294 (electronic). URL http: graphs in linear time. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 640(??):70– article/pii/S0304397516301852. 83, August 9, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), Blanchet-Sadri:2016:CAC 1879-2294 (electronic). URL http: [908] F. Blanchet-Sadri, Daniel Seita, and //www.sciencedirect.com/science/ David Wise. Computing abelian article/pii/S0304397516302390. complexity of binary uniform mor- Liao:2016:AAC phic words. Theoretical Com- puter Science, 640(??):41–51, Au- [912] Chung-Shou Liao, Chih-Wei Liang, gust 9, 2016. CODEN TC- and Sheung Hung Poon. Ap- SCDI. ISSN 0304-3975 (print), proximation algorithms on consis- 1879-2294 (electronic). URL http: tent dynamic map labeling. The- //www.sciencedirect.com/science/ oretical Computer Science, 640(??): article/pii/S030439751630233X. 84–93, August 9, 2016. CODEN Dourado:2016:GHN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [909] Mitre C. Dourado, Lucia D. Penso, and //www.sciencedirect.com/science/ Dieter Rautenbach. On the geodetic article/pii/S0304397516302420. hull number of Pk-free graphs. The- oretical Computer Science, 640(??): Bujtas:2016:NMG 52–60, August 9, 2016. CODEN [913] Cs. Bujtás, Gy. Dósa, Cs. Imreh, TCSCDI. ISSN 0304-3975 (print), J. Nagy-György, and Zs. Tuza. New 1879-2294 (electronic). URL http: models of graph-bin packing. The- //www.sciencedirect.com/science/ oretical Computer Science, 640(??): article/pii/S0304397516302341. 94–103, August 9, 2016. CODEN Jiang:2016:EDP TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [910] Minghui Jiang, Ge Xia, and Yong //www.sciencedirect.com/science/ Zhang. Edge-disjoint packing of article/pii/S0304397516302444. REFERENCES 161

Lee:2016:AGA TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [914] Hyung Tae Lee, San Ling, and //www.sciencedirect.com/science/ Huaxiong Wang. Analysis of article/pii/S0304397516302432. Gong et al.’s CCA2-secure homomorphic encryption. Theoretical Anonymous:2016:EBbh Computer Science, 640(??):104–114, August 9, 2016. CODEN TC- [918] Anonymous. Editorial Board. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 641(??): iii–ix, August 16, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL article/pii/S030439751630250X. http: //www.sciencedirect.com/science/ Zhao:2016:CCH article/pii/S0304397516303061.

[915] Shuli Zhao, Weihua Yang, and Kari:2016:Ed Shurong Zhang. Component connectivity of hypercubes. Theoreti- [919] Lila Kari. Editorial. Theoret- cal Computer Science, 640(??):115– ical Computer Science, 641(??):1, 118, August 9, 2016. CODEN August 16, 2016. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516301827. article/pii/S0304397516303139. Li:2016:ACP Meunier:2016:USE

[916] Shuangshuang Li, Zhao Zhang, and [920] Pierre-Etienne´ Meunier. Unravel- Hong-Jian Lai. Algorithm for con- ing simplicity in elementary cellu- straint partial inverse matroid prob- lar automata. Theoretical Com- lem with weight increase forbidden. puter Science, 641(??):2–10, Au- Theoretical Computer Science, 640(??): gust 16, 2016. CODEN TC- 119–124, August 9, 2016. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516000050. article/pii/S0304397516302389. Gratie:2016:CCF Song:2016:NNS [921] Cristian Gratie and Ion Petre. Com- [917] Hong Jie Song, Wen Hua Pan, Xi- plete characterization for the ﬁt- ang Nan Gong, and Chang Qing Xu. A preserving data reﬁnement of mass- note on the neighbor sum distinguish- action reaction networks. Theoret- ing total coloring of planar graphs. ical Computer Science, 641(??):11– Theoretical Computer Science, 640(??): 24, August 16, 2016. CODEN 125–129, August 9, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), REFERENCES 162

1879-2294 (electronic). URL http: numerical optimization. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 641(??):75– article/pii/S0304397516300160. 84, August 16, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Olarte:2016:PTV 1879-2294 (electronic). URL http: [922] C. Olarte, D. Chiarugi, M. Falaschi, //www.sciencedirect.com/science/ and D. Hermith. A proof theoretic article/pii/S0304397516302328. view of spatial and temporal depen- Zhang:2016:NSM dencies in biochemical systems. The- oretical Computer Science, 641(??): [926] Zhiqiang Zhang, Tingfang Wu, Andrei 25–42, August 16, 2016. CODEN Paun, and Linqiang Pan. Numerical TCSCDI. ISSN 0304-3975 (print), P systems with migrating variables. 1879-2294 (electronic). URL http: Theoretical Computer Science, 641(??): //www.sciencedirect.com/science/ 85–108, August 16, 2016. CODEN article/pii/S0304397516300184. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Song:2016:CPT //www.sciencedirect.com/science/ [923] Bosheng Song and Linqiang Pan. article/pii/S0304397516302407. The computational power of tissue- Anonymous:2016:EBbi like P systems with promoters. The- oretical Computer Science, 641(??): [927] Anonymous. Editorial Board. The- 43–52, August 16, 2016. CODEN oretical Computer Science, 642(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, August 23, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751630158X. //www.sciencedirect.com/science/ article/pii/S0304397516303309. Correia:2016:NIN Navarro-Lopez:2016:DHD [924] Marisol B. Correia. New insights on neutral binary representations for [928] Eva M. Navarro-L´opez and Rebekah evolutionary optimization. Theo- Carter. Deadness and how to disprove retical Computer Science, 641(??): liveness in hybrid dynamical systems. 53–74, August 16, 2016. CODEN Theoretical Computer Science, 642(??): TCSCDI. ISSN 0304-3975 (print), 1–23, August 23, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516301803. //www.sciencedirect.com/science/ article/pii/S0304397516302456. Tan:2016:IEL Bujtor:2016:NMI [925] Jian-Ding Tan, Mahidzal Dahari, Siaw-Paw Koh, Ying-Ying Koay, and [929] Ferenc Bujtor, Sascha Fendrich, Ger- Issa-Ahmed Abed. An improved ald L¨uttgen, and Walter Vogler. Non- electromagnetism-like algorithm for deterministic modal interfaces. The- REFERENCES 163

oretical Computer Science, 642(??): iii–ix, September 6, 2016. CODEN 24–53, August 23, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516303644. article/pii/S030439751630247X. vandenHerik:2016:RAC Anonymous:2016:EBbj [934] H. Jaap van den Herik, Walter A. [930] Anonymous. Editorial Board. The- Kosters, and Aske Plaat. Recent oretical Computer Science, 643(??): advances in computer games. The- iii–ix, August 30, 2016. CODEN oretical Computer Science, 644(??): TCSCDI. ISSN 0304-3975 (print), 1, September 6, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516303425. //www.sciencedirect.com/science/ article/pii/S0304397516303693. Jaskolka:2016:MCC Bonnet:2016:CCG [931] Jason Jaskolka and Ridha Khedri. Mit- igating covert channels based on analy- [935] Edouard´ Bonnet, Florian Jamain, and sis of the potential for communication. Abdallah Saﬃdine. On the com- Theoretical Computer Science, 643(??): plexity of connection games. The- 1–37, August 30, 2016. CODEN oretical Computer Science, 644(??): TCSCDI. ISSN 0304-3975 (print), 2–28, September 6, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516302675. //www.sciencedirect.com/science/ article/pii/S030439751630278X. Rossi:2016:TLM Browne:2016:AIS [932] Matteo Rossi, Dino Mandrioli, An- gelo Morzenti, and Luca Ferrucci. A [936] Cameron Browne. Algorithms for temporal logic for micro- and macro- interactive Sprouts. Theoretical step-based real-time systems: Foun- Computer Science, 644(??):29–42, dations and applications. Theoret- September 6, 2016. CODEN TC- ical Computer Science, 643(??):38– SCDI. ISSN 0304-3975 (print), 64, August 30, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516302778. //www.sciencedirect.com/science/ article/pii/S0304397516302985. Cazenave:2016:PPA Anonymous:2016:EBbk [937] Tristan Cazenave. Playout policy adaptation with move features. The- [933] Anonymous. Editorial Board. The- oretical Computer Science, 644(??): oretical Computer Science, 644(??): 43–52, September 6, 2016. CODEN REFERENCES 164

TCSCDI. ISSN 0304-3975 (print), exploration in Monte-Carlo tree search. 1879-2294 (electronic). URL http: Theoretical Computer Science, 644(??): //www.sciencedirect.com/science/ 92–105, September 6, 2016. CODEN article/pii/S0304397516302699. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Graf:2016:APO //www.sciencedirect.com/science/ [938] Tobias Graf and Marco Platzner. article/pii/S0304397516302791. Adaptive playouts for online learn- Lorentz:2016:UEF ing of policies during Monte Carlo Tree Search. Theoretical Computer [942] Richard Lorentz. Using evaluation Science, 644(??):53–62, September 6, functions in Monte-Carlo Tree Search. 2016. CODEN TCSCDI. ISSN 0304- Theoretical Computer Science, 644(??): 3975 (print), 1879-2294 (electronic). 106–113, September 6, 2016. CODEN URL http://www.sciencedirect. TCSCDI. ISSN 0304-3975 (print), com/science/article/pii/S03043975163027421879-2294. (electronic). URL http: Hsueh:2016:ASI //www.sciencedirect.com/science/ article/pii/S0304397516302717. [939] Chu-Hsuan Hsueh, I-Chen Wu, Wen- Jie Tseng, Shi-Jim Yen, and Jr-Chang Mandai:2016:LAM Chen. An analysis for strength im- [943] Yusaku Mandai and Tomoyuki Kaneko. provement of an MCTS-based pro- LinUCB applied to Monte Carlo tree gram playing Chinese dark chess. The- search. Theoretical Computer Sci- oretical Computer Science, 644(??): ence, 644(??):114–126, September 6, 63–75, September 6, 2016. CODEN 2016. CODEN TCSCDI. ISSN 0304- TCSCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397516302808. article/pii/S0304397516302705. Janko:2016:PPC Pawlewicz:2016:CNS [940] Vito Janko and Matej Guid. A pro- [944] Jakub Pawlewicz and Ryan B. Hay- gram for Progressive chess. The- ward. Conspiracy number search oretical Computer Science, 644(??): with relative sibling scores. Theoret- 76–91, September 6, 2016. CODEN ical Computer Science, 644(??):127– TCSCDI. ISSN 0304-3975 (print), 142, September 6, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516302730. //www.sciencedirect.com/science/ article/pii/S0304397516302729. Liu:2016:MIU Uiterwijk:2016:PCS [941] Yun-Ching Liu and Yoshimasa Tsu- ruoka. Modification of improved up- [945] Jos W. H. M. Uiterwijk. Polymeriza- per confidence bounds for regulating tion and crystallization of Snowflake REFERENCES 165

molecules in Domineering. Theoret- Halman:2016:DFP ical Computer Science, 644(??):143– 158, September 6, 2016. CODEN [949] Nir Halman. A deterministic TCSCDI. ISSN 0304-3975 (print), fully polynomial time approximation 1879-2294 (electronic). URL http: scheme for counting integer knap- //www.sciencedirect.com/science/ sack solutions made easy. Theoret- article/pii/S0304397516302754. ical Computer Science, 645(??):41– 47, September 13, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Anonymous:2016:EBbl 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [946] Anonymous. Editorial Board. The- article/pii/S0304397516302511. oretical Computer Science, 645(??): iii–ix, September 13, 2016. CODEN Konstantinidis:2016:SMC TCSCDI. ISSN 0304-3975 (print), [950] G. Konstantinidis and Ath. Keha- 1879-2294 (electronic). URL http: gias. Simultaneously moving cops //www.sciencedirect.com/science/ and robbers. Theoretical Com- article/pii/S0304397516304005. puter Science, 645(??):48–59, Septem- ber 13, 2016. CODEN TC- Libert:2016:BRD SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [947] Benoˆıt Libert, Marc Joye, and //www.sciencedirect.com/science/ Moti Yung. Born and raised dis- article/pii/S030439751630295X. tributively: Fully distributed non- interactive adaptively-secure threshold Kammer:2016:ATD signatures with short shares. Theo- [951] Frank Kammer and Torsten Tholey. retical Computer Science, 645(??):1– Approximate tree decompositions of 24, September 13, 2016. CODEN planar graphs in linear time. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 645(??):60– 1879-2294 (electronic). URL http: 90, September 13, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516001626. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Bonamy:2016:KPF article/pii/S0304397516302961. Guo:2016:ECB [948] Marthe Bonamy andLukasz Kowa- lik. A 13k-kernel for planar feedback [952] Jia Guo and Mei Lu. The extra con- vertex set via region decomposition. nectivity of bubble-sort star graphs. Theoretical Computer Science, 645(??): Theoretical Computer Science, 645(??): 25–40, September 13, 2016. CODEN 91–99, September 13, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516301785. article/pii/S0304397516302997. REFERENCES 166

Evans:2016:SVR Kelk:2016:RRM

[953] William S. Evans, Giuseppe Liotta, [957] Steven Kelk, Mareike Fischer, Vin- and Fabrizio Montecchiani. Simultane- cent Moulton, and Taoyang Wu. Re- ous visibility representations of plane duction rules for the maximum parsi- st-graphs using L-shapes. Theoret- mony distance on phylogenetic trees. ical Computer Science, 645(??):100– Theoretical Computer Science, 646(??): 111, September 13, 2016. CODEN 1–15, September 20, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516303012. article/pii/S0304397516303243. Bauer:2016:SSS Beretta:2016:PTM [954] Reinhard Bauer, Tobias Columbus, [958] Stefano Beretta, Mauro Castelli, Ignaz Rutter, and Dorothea Wag- and Riccardo Dondi. Parameter- ner. Search-space size in con- ized tractability of the maximum-duo traction hierarchies. Theoretical preservation string mapping problem. Computer Science, 645(??):112–127, Theoretical Computer Science, 646(??): September 13, 2016. CODEN TC- 16–25, September 20, 2016. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516303176. article/pii/S0304397516303255. See Mazo:2016:NLE corrigendum [1023].

[955] Lo¨ıc Mazo and Etienne´ Baudrier. Non- Avni:2016:CSS local estimators: a new class of multigrid convergent length estimators. The- [959] Guy Avni and Tami Tamir. Cost- oretical Computer Science, 645(??): sharing scheduling games on re- 128–146, September 13, 2016. CODEN stricted unrelated machines. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 646(??):26– 1879-2294 (electronic). URL http: 39, September 20, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516303218. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Anonymous:2016:EBbm article/pii/S0304397516303358. [956] Anonymous. Editorial Board. The- Kacem:2016:SOS oretical Computer Science, 646(??): iii–ix, September 20, 2016. CODEN [960] Imed Kacem and Hans Kellerer. Semi- TCSCDI. ISSN 0304-3975 (print), online scheduling on a single machine 1879-2294 (electronic). URL http: with unexpected breakdown. Theo- //www.sciencedirect.com/science/ retical Computer Science, 646(??):40– article/pii/S0304397516304133. 48, September 20, 2016. CODEN REFERENCES 167

TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516303371. article/pii/S0304397516304297. Ho:2016:TPS Chen:2016:EME [961] Nhan Bao Ho. Three-pile Sharing [965] Yangjun Chen and Weixin Shen. An Nim and the quadratic time win- efficient method to evaluate inter- ning strategy. Theoretical Com- sections on big data sets. Theo- puter Science, 646(??):49–60, Septem- retical Computer Science, 647(??):1– ber 20, 2016. CODEN TC- 21, September 27, 2016. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516303498. article/pii/S0304397516303528. Harland:2016:BBM Cicalese:2016:TSP [962] James Harland. Busy beaver machines [966] Ferdinando Cicalese, Balázs Keszegh, and the observant otter heuristic (or Bernard Lidický, Dömötör Pálvölgyi, how to tame dreadful dragons). Theo- and Tomás Valla. On the tree search retical Computer Science, 646(??):61– problem with non-uniform costs. The- 85, September 20, 2016. CODEN oretical Computer Science, 647(??):22– TCSCDI. ISSN 0304-3975 (print), 32, September 27, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516303504. //www.sciencedirect.com/science/ article/pii/S030439751630353X. Glasser:2016:EAM Atminas:2016:SPC [963] Christian Glaßer, Heinz Schmitz, and Victor Selivanov. Efficient algorithms [967] Aistis Atminas, Marcin Kamiński, for membership in boolean hierar- and Jean-Florent Raymond. Scat- chies of regular languages. Theo- tered packings of cycles. Theoret- retical Computer Science, 646(??):86– ical Computer Science, 647(??):33– 108, September 20, 2016. CODEN 42, September 27, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516303516. article/pii/S0304397516303553. Anonymous:2016:EBbn deParga:2016:MCD [964] Anonymous. Editorial Board. The- [968] Manuel Vázquez de Parga, Pedro oretical Computer Science, 647(??): Garc´ıa, and Damián López. Mini- iii–ix, September 27, 2016. CODEN mal consistent DFA revisited. Theo- REFERENCES 168

retical Computer Science, 647(??):43– Balkova:2016:APN 49, September 27, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [972] L’ubom´ıra Balková, Michelangelo 1879-2294 (electronic). URL http: Bucci, Alessandro De Luca, Jiˇr´ı //www.sciencedirect.com/science/ Hladký, and Svetlana Puzynina. Ape- article/pii/S0304397516303577. riodic pseudorandom number generators based on infinite words. Theo- Xiao:2016:NDF retical Computer Science, 647(??):85– 100, September 27, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [969] Lin Xiao. A new design formula ex- 1879-2294 (electronic). URL http: ploited for accelerating Zhang neural //www.sciencedirect.com/science/ network and its application to time- article/pii/S0304397516303875. varying matrix inversion. Theoret- ical Computer Science, 647(??):50– Vignatti:2016:MVC 58, September 27, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [973] André L. Vignatti and Murilo V. G. 1879-2294 (electronic). URL http: da Silva. Minimum vertex cover in //www.sciencedirect.com/science/ generalized random graphs with power article/pii/S0304397516303589. law degree distribution. Theoreti- cal Computer Science, 647(??):101– Elmasry:2016:DRM 111, September 27, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL [970] Amr Elmasry, Meng He, J. Ian Munro, http: and Patrick K. Nicholson. Dynamic //www.sciencedirect.com/science/ . range majority data structures. Theo- article/pii/S0304397516303899 retical Computer Science, 647(??):59– Anonymous:2016:EBbo 73, September 27, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [974] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 648(??): //www.sciencedirect.com/science/ iii–ix, October 4, 2016. CODEN article/pii/S030439751630384X. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Belazzougui:2016:IQC //www.sciencedirect.com/science/ article/pii/S0304397516304509. [971] Djamal Belazzougui, Roman Kolpakov, Bresar:2016:CGD and Mathieu Raffinot. Indexing and querying color sets of images. Theo- [975] Bostjan Bresar, Paul Dorbec, Sandi retical Computer Science, 647(??):74– Klavzar, Gasper Kosmrlj, and Gabriel 84, September 27, 2016. CODEN Renault. Complexity of the game TCSCDI. ISSN 0304-3975 (print), domination problem. Theoretical 1879-2294 (electronic). URL http: Computer Science, 648(??):1–7, Oc- //www.sciencedirect.com/science/ tober 4, 2016. CODEN TC- article/pii/S0304397516303863. SCDI. ISSN 0304-3975 (print), REFERENCES 169

1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516303590. //www.sciencedirect.com/science/ article/pii/S0304397516303917. Boldi:2016:EOL Alvarez:2016:CG [976] Paolo Boldi and Sebastiano Vigna. Efficient optimally lazy algorithms [980] Carme Alvarez,` Maria J. Blesa, Amalia for minimal-interval semantics. The- Duch, Arnau Messegué, and Maria oretical Computer Science, 648(??): Serna. Celebrity games. Theo- 8–25, October 4, 2016. CODEN retical Computer Science, 648(??): TCSCDI. ISSN 0304-3975 (print), 56–71, October 4, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516303814. //www.sciencedirect.com/science/ article/pii/S0304397516303929. Le:2016:UAR Zhang:2016:LCP [977] Van Bang Le, Andrea Oversberg, and Oliver Schaudt. A unified approach [981] Peng Zhang and Bin Fu. The la- to recognize squares of split graphs. bel cut problem with respect to path Theoretical Computer Science, 648(??): length and label frequency. The- 26–33, October 4, 2016. CODEN oretical Computer Science, 648(??): TCSCDI. ISSN 0304-3975 (print), 72–83, October 4, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516303826. //www.sciencedirect.com/science/ article/pii/S0304397516303930. Dutta:2016:LCG Kociumaka:2016:MND [978] Tridib Dutta, Lenwood S. Heath, V. S. Anil Kumar, and Madhav V. [982] Tomasz Kociumaka, Jakub Ra- Marathe. Labeled cuts in graphs. The- doszewski, Wojciech Rytter, and oretical Computer Science, 648(??): Tomasz Waleń. Maximum number 34–39, October 4, 2016. CODEN of distinct and nonequivalent non- TCSCDI. ISSN 0304-3975 (print), standard squares in a word. The- 1879-2294 (electronic). URL http: oretical Computer Science, 648(??): //www.sciencedirect.com/science/ 84–95, October 4, 2016. CODEN article/pii/S0304397516303851. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Zehavi:2016:PAA //www.sciencedirect.com/science/ [979] Meirav Zehavi. Parameterized ap- article/pii/S0304397516304066. proximation algorithms for pack- Ferraioli:2016:DDF ing problems. Theoretical Com- puter Science, 648(??):40–55, Oc- [983] Diodato Ferraioli, Paul W. Goldberg, tober 4, 2016. CODEN TC- and Carmine Ventre. Decentralized dy- REFERENCES 170

namics for finite opinion games. The- Ferrarotti:2016:NTC oretical Computer Science, 648(??): 96–115, October 4, 2016. CODEN [987] Flavio Ferrarotti, Klaus-Dieter Schewe, TCSCDI. ISSN 0304-3975 (print), Loredana Tec, and Qing Wang. 1879-2294 (electronic). URL http: A new thesis concerning synchro- //www.sciencedirect.com/science/ nised parallel computing — simpli- article/pii/S0304397516304078. fied parallel ASM thesis. Theoret- ical Computer Science, 649(??):25– Feigenblat:2016:CFI 53, October 11, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [984] Guy Feigenblat, Ofra Itzhaki, and Ely 1879-2294 (electronic). URL http: Porat. Corrigendum to “The frequent //www.sciencedirect.com/science/ items problem, under polynomial de- article/pii/S0304397516304212. cay, in the streaming model” [Theoret. Anonymous:2016:EBbq Comput. Sci. 411(34-36) (2010) 3048– 3054]. Theoretical Computer Science, [988] Anonymous. Editorial Board. The- 648(??):116, October 4, 2016. CODEN oretical Computer Science, 650(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, October 18, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751630456X. See //www.sciencedirect.com/science/ [1]. article/pii/S0304397516304728. Anonymous:2016:EBbp Auer:2016:GEF [989] Peter Auer, Alexander Clark, and [985] Anonymous. Editorial Board. The- Thomas Zeugmann. Guest Edi- oretical Computer Science, 649(??): tors’ foreword. Theoretical Com- iii–ix, October 11, 2016. CODEN puter Science, 650(??):1–3, Octo- TCSCDI. ISSN 0304-3975 (print), ber 18, 2016. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516304613. //www.sciencedirect.com/science/ Jegourel:2016:CBI article/pii/S0304397516303723. Kotzing:2016:MUC [986] Cyrille Jegourel, Axel Legay, and Sean Sedwards. Command-based [990] Timo Kötzing and Raphaela Pa- importance sampling for statistical lenta. A map of update con- model checking. Theoretical Com- straints in inductive inference. The- puter Science, 649(??):1–24, Oc- oretical Computer Science, 650(??): tober 11, 2016. CODEN TC- 4–24, October 18, 2016. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516303966. article/pii/S0304397516303735. REFERENCES 171

Jain:2016:PLA Ailon:2016:BOO

[991] Sanjay Jain and Eﬁm Kinber. Par- [995] Nir Ailon, Kohei Hatano, and Eiji allel learning of automatic classes Takimoto. Bandit online optimiza- of languages. Theoretical Com- tion over the permutahedron. The- puter Science, 650(??):25–44, Oc- oretical Computer Science, 650(??): tober 18, 2016. CODEN TC- 92–108, October 18, 2016. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516303747. article/pii/S0304397516303784. Abasi:2016:LBH Maurer:2016:CRE

[992] Hasan Abasi, Ali Z. Abdi, and [996] Andreas Maurer. A chain rule Nader H. Bshouty. Learning boolean for the expected suprema of Gaus- halfspaces with small weights from sian processes. Theoretical Com- membership queries. Theoretical Com- puter Science, 650(??):109–122, Oc- puter Science, 650(??):45–56, Oc- tober 18, 2016. CODEN TC- tober 18, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516303796. article/pii/S0304397516303759. Anonymous:2016:EBbr Angluin:2016:LRO [997] Anonymous. Editorial Board. The- [993] Dana Angluin and Dana Fisman. oretical Computer Science, 651(??): Learning regular omega languages. iii–ix, October 25, 2016. CODEN Theoretical Computer Science, 650(??): TCSCDI. ISSN 0304-3975 (print), 57–72, October 18, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516304947. //www.sciencedirect.com/science/ article/pii/S0304397516303760. Elkin:2016:SEP Hutter:2016:ESA [998] Michael Elkin, Ofer Neiman, and Christian Wulﬀ-Nilsen. Space- [994] Marcus Hutter. Extreme state aggrega- eﬃcient path-reporting approximate tion beyond Markov decision processes. distance oracles. Theoretical Com- Theoretical Computer Science, 650(??): puter Science, 651(??):1–10, Oc- 73–91, October 18, 2016. CODEN tober 25, 2016. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516303772. article/pii/S0304397516303838. REFERENCES 172

DArco:2016:SCC //www.sciencedirect.com/science/ article/pii/S0304397516304364. [999] Paolo D’Arco and Roberto De Prisco. Secure computation without comput- Deng:2016:ARC ers. Theoretical Computer Science, 651 [1003] Xingchao Deng, Hengzhe Li, and Guiy- (??):11–36, October 25, 2016. CODEN ing Yan. Algorithm on rainbow connec- TCSCDI. ISSN 0304-3975 (print), tion for maximal outerplanar graphs. 1879-2294 (electronic). URL http: Theoretical Computer Science, 651(??): //www.sciencedirect.com/science/ 76–86, October 25, 2016. CODEN article/pii/S0304397516303905. TCSCDI. ISSN 0304-3975 (print), Haddadan:2016:CDS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1000] Arash Haddadan, Takehiro Ito, article/pii/S0304397516304388. Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, and Pai:2016:CIC Youcef Tebbal. The complexity of [1004] Kung-Jui Pai, Jou-Ming Chang, Jinn- dominating set reconﬁguration. The- Shyong Yang, and Ro-Yu Wu. Cor- oretical Computer Science, 651(??): rigendum to “Incidence coloring on 37–49, October 25, 2016. CODEN hypercubes” [Theoret. Comput. Sci. TCSCDI. ISSN 0304-3975 (print), 557 (2014) 59–65]. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 651(??):87–88, Oc- //www.sciencedirect.com/science/ tober 25, 2016. CODEN TC- article/pii/S0304397516304248. SCDI. ISSN 0304-3975 (print), Wehmuth:2016:MG 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1001] Klaus Wehmuth, Eric´ Fleury, and Ar- article/pii/S0304397516303887. See tur Ziviani. On MultiAspect graphs. [6]. Theoretical Computer Science, 651(??): Anonymous:2016:EBbs 50–61, October 25, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [1005] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 652(??): //www.sciencedirect.com/science/ iii–ix, November 1, 2016. CODEN article/pii/S0304397516304352. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Hermelin:2016:PCC //www.sciencedirect.com/science/ [1002] Danny Hermelin, Moshe Kaspi, Chris- article/pii/S0304397516305254. tian Komusiewicz, and Barak Navon. Cao:2016:SOS Parameterized complexity of critical node cuts. Theoretical Com- [1006] Qian Cao and Zhaohui Liu. Semi- puter Science, 651(??):62–75, Oc- online scheduling with bounded job tober 25, 2016. CODEN TC- sizes on two uniform machines. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 652(??): 1879-2294 (electronic). URL http: 1–17, November 1, 2016. CODEN REFERENCES 173

TCSCDI. ISSN 0304-3975 (print), hierarchical hybrid systems. The- 1879-2294 (electronic). URL http: oretical Computer Science, 652(??): //www.sciencedirect.com/science/ 47–63, November 1, 2016. CODEN article/pii/S0304397516304406. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: He:2016:STI //www.sciencedirect.com/science/ [1007] Kai He, Jian Weng, Robert H. Deng, article/pii/S0304397516304674. and Joseph K. Liu. On the secu- Altman:2016:ICR rity of two identity-based conditional proxy re-encryption schemes. The- [1011] Harry Altman. Integer complex- oretical Computer Science, 652(??): ity: Representing numbers of bounded 18–27, November 1, 2016. CODEN defect. Theoretical Computer Sci- TCSCDI. ISSN 0304-3975 (print), ence, 652(??):64–85, November 1, 1879-2294 (electronic). URL http: 2016. CODEN TCSCDI. ISSN 0304- //www.sciencedirect.com/science/ 3975 (print), 1879-2294 (electronic). article/pii/S0304397516304443. URL http://www.sciencedirect. com/science/article/pii/S0304397516304789. Pai:2016:CTC Bilo:2016:EAA [1008] Kung-Jui Pai and Jou-Ming Chang. Constructing two completely indepen- [1012] Davide Bilò, Luciano Gualà, Stefano dent spanning trees in hypercube- Leucci, and Guido Proietti. Exact and variant networks. Theoretical Com- approximate algorithms for movement puter Science, 652(??):28–37, Novem- problems on (special classes of) graphs. ber 1, 2016. CODEN TCSCDI. Theoretical Computer Science, 652(??): ISSN 0304-3975 (print), 1879-2294 86–101, November 1, 2016. CODEN (electronic). URL http://www. TCSCDI. ISSN 0304-3975 (print), sciencedirect.com/science/article/ 1879-2294 (electronic). URL http: pii/S0304397516304455. //www.sciencedirect.com/science/ article/pii/S0304397516304807. Karthick:2016:SSE Berend:2016:SCR [1009] T. Karthick. Structure of squares and efficient domination in graph classes. [1013] Daniel Berend and Aryeh Kontorovich. Theoretical Computer Science, 652(??): The state complexity of random DFAs. 38–46, November 1, 2016. CODEN Theoretical Computer Science, 652(??): TCSCDI. ISSN 0304-3975 (print), 102–108, November 1, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516304662. //www.sciencedirect.com/science/ article/pii/S0304397516304881. Bell:2016:DCP Anonymous:2016:EBbt [1010] Paul C. Bell, Shang Chen, and Lisa Jackson. On the decidability and [1014] Anonymous. Editorial Board. The- complexity of problems for restricted oretical Computer Science, 653(??): REFERENCES 174

iii–ix, November 15, 2016. CODEN 42–52, November 15, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516305370. article/pii/S0304397516305060. Yero:2016:SNS Dagdelen:2016:RLS

[1015] Ismael González Yero, Marko Jako- [1019] Ozg¨¨ ur Dagdelen, Payman Mohassel, vac, and Dorota Kuziak. The secu- and Daniele Venturi. Rate-limited rity number of strong grid-like graphs. secure function evaluation. Theoret- Theoretical Computer Science, 653(??): ical Computer Science, 653(??):53– 1–14, November 15, 2016. CODEN 78, November 15, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516304893. article/pii/S0304397516305072. Cechlarova:2016:SMT Li:2016:ECR [1016] Katar´ına Cechlárová, Tamás Fleiner, [1020] Xiang-Jun Li, Qi-Qi Dong, Zheng Yan, David F. Manlove, and Iain McBride. and Jun-Ming Xu. Embedded con- Stable matchings of teachers to schools. nectivity of recursive networks. The- Theoretical Computer Science, 653(??): oretical Computer Science, 653(??): 15–25, November 15, 2016. CODEN 79–86, November 15, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516305011. article/pii/S0304397516305096. Sureson:2016:MLR Bourne:2016:SHS

1 [1017] Claude Sureson. Π1–Martin-L¨of ran- [1021] Tom Bourne and Nik Ruskuc. On dom reals as measures of natu- the star-height of subword counting ral open sets. Theoretical Com- languages and their relationship to puter Science, 653(??):26–41, Novem- Rees zero-matrix semigroups. The- ber 15, 2016. CODEN TC- oretical Computer Science, 653(??): SCDI. ISSN 0304-3975 (print), 87–96, November 15, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516305059. //www.sciencedirect.com/science/ article/pii/S0304397516305114. Damaschke:2016:DVR Reis:2016:IRL [1018] Peter Damaschke. Deterministic versus randomized adaptive test cover. [1022] Rog´erio Reis and Emanuele Rodaro. Theoretical Computer Science, 653(??): Ideal regular languages and strongly REFERENCES 175

connected synchronizing automata. Chen:2016:CBS Theoretical Computer Science, 653(??): 97–107, November 15, 2016. CODEN [1026] Ruiwen Chen and Valentine Kabanets. TCSCDI. ISSN 0304-3975 (print), Correlation bounds and #SAT algo- 1879-2294 (electronic). URL http: rithms for small linear-size circuits. //www.sciencedirect.com/science/ Theoretical Computer Science, 654(??): article/pii/S0304397516305138. 2–10, November 22, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Beretta:2016:CPT 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1023] Stefano Beretta, Mauro Castelli, article/pii/S0304397516301189. and Riccardo Dondi. Corrigen- Zhang:2016:MFC dum to “Parameterized tractability of the maximum-duo preservation string [1027] Nan Zhang, Zhenhua Duan, and mapping problem” [Theoret. Comput. Cong Tian. A mechanism of func- Sci. 646 (2016) 16–25]. Theoreti- tion calls in MSVL. Theoreti- cal Computer Science, 653(??):108– cal Computer Science, 654(??):11– 110, November 15, 2016. CODEN 25, November 22, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516305023. See article/pii/S030439751600181X. [958]. He:2016:NOM Anonymous:2016:EBbu [1028] Dayu He and Xin He. Nearly optimal monotone drawing of trees. The- [1024] Anonymous. Editorial Board. The- oretical Computer Science, 654(??): oretical Computer Science, 654(??): 26–32, November 22, 2016. CODEN iii–ix, November 22, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516000207. article/pii/S0304397516305588. Dang:2016:QCS Xu:2016:ECC [1029] Zhe Dang, Thomas R. Fischer, [1025] Dachuan Xu, Donglei Du, and Ding- William J. Hutton III, Oscar H. Ibarra, Zhu Du. Editorial for Computing and Qin Li. Quantifying communica- and Combinatorics Conference. The- tion in synchronized languages. The- oretical Computer Science, 654(??): oretical Computer Science, 654(??): 1, November 22, 2016. CODEN 33–44, November 22, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516305643. article/pii/S0304397516000864. REFERENCES 176

Yu:2016:IAA 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1030] Wei Yu and Zhaohui Liu. Im- article/pii/S0304397516000876. proved approximation algorithms for some min-max and minimum cy- Chakraborty:2016:UBF cle cover problems. Theoretical [1034] Sourav Chakraborty, Raghav Kulka- Computer Science, 654(??):45–58, rni, Satyanarayana V. Lokam, and November 22, 2016. CODEN TC- Nitin Saurabh. Upper bounds SCDI. ISSN 0304-3975 (print), on Fourier entropy. Theoretical 1879-2294 (electronic). URL http: Computer Science, 654(??):92–112, //www.sciencedirect.com/science/ November 22, 2016. CODEN TC- article/pii/S0304397516000852. SCDI. ISSN 0304-3975 (print), Massberg:2016:ERS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1031] Jens Maßberg. Embedding rectilinear article/pii/S0304397516301190. Steiner trees with length restrictions. Theoretical Computer Science, 654(??): Su:2016:SSP 59–69, November 22, 2016. CODEN [1035] Shenghui Su, Shuwang Lü, Maozhi TCSCDI. ISSN 0304-3975 (print), Xu, and Tao Xie. A semanti- 1879-2294 (electronic). URL http: cally secure public key cryptoscheme //www.sciencedirect.com/science/ using bit-pair shadows. Theoreti- article/pii/S0304397516302547. cal Computer Science, 654(??):113– Meesum:2016:RRA 127, November 22, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [1032] S. M. Meesum, Pranabendu Misra, 1879-2294 (electronic). URL http: and Saket Saurabh. Reducing //www.sciencedirect.com/science/ rank of the adjacency matrix by article/pii/S0304397516300561. graph modification. Theoretical Su:2016:PSN Computer Science, 654(??):70–79, November 22, 2016. CODEN TC- [1036] Shenghui Su, Tao Xie, and Shuwang SCDI. ISSN 0304-3975 (print), Lü. A provably secure non-iterative 1879-2294 (electronic). URL http: hash function resisting birthday attack. //www.sciencedirect.com/science/ Theoretical Computer Science, 654(??): article/pii/S0304397516001420. 128–142, November 22, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), Jo:2016:SER 1879-2294 (electronic). URL http: [1033] Seungbum Jo and Srinivasa Rao //www.sciencedirect.com/science/ Satti. Simultaneous encodings for article/pii/S0304397516001547. range and next/previous larger/smaller Balas:2016:NAR value queries. Theoretical Com- puter Science, 654(??):80–91, Novem- [1037] Kevin Balas and Csaba D. Tóth. On ber 22, 2016. CODEN TC- the number of anchored rectangle pack- SCDI. ISSN 0304-3975 (print), ings for a planar point set. Theoret- REFERENCES 177

ical Computer Science, 654(??):143– Ye:2016:ACT 154, November 22, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [1041] Deshi Ye and Guochuan Zhang. Ap- 1879-2294 (electronic). URL http: proximate composable truthful mech- //www.sciencedirect.com/science/ anism design. Theoretical Computer article/pii/S0304397516001973. Science, 654(??):188–198, Novem- ber 22, 2016. CODEN TC- Uno:2016:MPS SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1038] Takeaki Uno and Yushi Uno. Min- article/pii/S0304397516001560. ing preserving structures in a graph sequence. Theoretical Computer Anonymous:2016:EBbv Science, 654(??):155–163, Novem- ber 22, 2016. CODEN TC- [1042] Anonymous. Editorial Board. Theo- SCDI. ISSN 0304-3975 (print), retical Computer Science, 655 (part A) 1879-2294 (electronic). URL http: (??):iii–ix, December 6, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515011469. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Wang:2016:AAC article/pii/S0304397516305746. Fomin:2016:FSI [1039] Yin Wang and Yinfeng Xu. The approximation algorithms for a class [1043] Fedor V. Fomin, Pierre Fraigniaud, of multiple-choice problem. Theoret- Nicolas Nisse, and Dimitrios M. ical Computer Science, 654(??):164– Thilikos. Forewords: Special is- 174, November 22, 2016. CODEN sue on Theory and Applications of TCSCDI. ISSN 0304-3975 (print), Graph Searching Problems. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 655 (part A) //www.sciencedirect.com/science/ (??):1, December 6, 2016. CODEN article/pii/S0304397516302948. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Nip:2016:SSC //www.sciencedirect.com/science/ article/pii/S0304397516305813. [1040] Kameng Nip, Zhenbo Wang, and Bonato:2016:PVG Wenxun Xing. A study on several combination problems of classic shop [1044] Anthony Bonato, Dieter Mitsche, scheduling and shortest path. Theo- Xavier P´erez-Gim´enez, and Pawe l retical Computer Science, 654(??):175– Pralat. A probabilistic version 187, November 22, 2016. CODEN of the game of Zombies and Sur- TCSCDI. ISSN 0304-3975 (print), vivors on graphs. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 655 (part A)(??):2– //www.sciencedirect.com/science/ 14, December 6, 2016. CODEN article/pii/S0304397515011883. TCSCDI. ISSN 0304-3975 (print), REFERENCES 178

1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515011731. //www.sciencedirect.com/science/ article/pii/S0304397516305035. Fo erster:2016:LUC Amiri:2016:DWP [1045] Klaus-Tycho Foerster and Roger Wat- tenhofer. Lower and upper com- [1049] Saeed Akhoondian Amiri, Stephan petitive bounds for online directed Kreutzer, and Roman Rabinovich. graph exploration. Theoretical Com- DAG-width is PSPACE-complete. puter Science, 655 (part A)(??):15– Theoretical Computer Science, 655 29, December 6, 2016. CODEN (part A)(??):78–89, December 6, 2016. TCSCDI. ISSN 0304-3975 (print), CODEN TCSCDI. ISSN 0304- 1879-2294 (electronic). URL http: 3975 (print), 1879-2294 (electronic). //www.sciencedirect.com/science/ URL http://www.sciencedirect. article/pii/S0304397515010166. com/science/article/pii/S030439751630487X. Lehner:2016:PEI Anonymous:2016:EBbw [1046] Florian Lehner. Pursuit evasion on [1050] Anonymous. Editorial Board. The- inﬁnite graphs. Theoretical Com- oretical Computer Science, 656 (part puter Science, 655 (part A)(??):30– A)(??):iii–ix, December 20, 2016. 40, December 6, 2016. CODEN CODEN TCSCDI. ISSN 0304- TCSCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397516305862. article/pii/S0304397516300639. Carotenuto:2016:OMS Luccio:2016:MAM [1051] Dario Carotenuto, Aniello Murano, [1047] Fabrizio Luccio and Linda Pagli. and Adriano Peron. Ordered More agents may decrease global multi-stack visibly pushdown au- work: a case in butterﬂy decontam- tomata. Theoretical Computer Sci- ination. Theoretical Computer Sci- ence, 656 (part A)(??):1–26, De- ence, 655 (part A)(??):41–57, De- cember 20, 2016. CODEN TC- cember 6, 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516304200. article/pii/S0304397516305151. Fu:2016:DES Puchala:2016:JRD [1052] Xiang Fu. On detecting environment [1048] Bernd Puchala and Roman Rabinovich. sensitivity using slicing. Theoretical Jumping robbers in digraphs. Theo- Computer Science, 656 (part A)(??): retical Computer Science, 655 (part A) 27–45, December 20, 2016. CODEN (??):58–77, December 6, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), REFERENCES 179

1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397516306296. article/pii/S0304397516304686. Iliopoulos:2016:F Diaconescu:2016:FSF [1057] Costas S. Iliopoulos and Simon J. [1053] Razvan Diaconescu. Functorial seman- Pugisi. Foreword. Theoretical Com- tics of first-order views. Theoretical puter Science, 656 (Part B)(??): Computer Science, 656 (part A)(??): 107, December 20, 2016. CODEN 46–59, December 20, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516306880. article/pii/S0304397516304844. Heliou:2016:EDR Basu:2016:DSA [1058] A. Heliou, M. Léonard, L. Mouchard, [1054] Samik Basu and Tevfik Bultan. and M. Salson. Efficient dynamic range On deciding synchronizability for minimum query. Theoretical Com- asynchronously communicating sys- puter Science, 656 (Part B)(??):108– tems. Theoretical Computer Sci- 117, December 20, 2016. CODEN ence, 656 (part A)(??):60–75, De- TCSCDI. ISSN 0304-3975 (print), cember 20, 2016. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516303164. //www.sciencedirect.com/science/ Daykin:2016:BBO article/pii/S0304397516305102. Lellmann:2016:HRR [1059] Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Ar- [1055] Björn Lellmann. Hypersequent rules naud Lefebvre, Martine Léonard, and with restricted contexts for proposi- Elise´ Prieur-Gaston. Binary block tional modal logics. Theoretical Com- order Rouen Transform. Theoretical puter Science, 656 (part A)(??):76– Computer Science, 656 (Part B)(??): 105, December 20, 2016. CODEN 118–134, December 20, 2016. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516305187. article/pii/S0304397516301645. Anonymous:2016:EBbx Cordova:2016:SEF [1056] Anonymous. Editorial Board. The- [1060] Joshimar Cordova and Gonzalo Navarro. oretical Computer Science, 656 (Part Simple and efficient fully-functional B)(??):iii–ix, December 20, 2016. succinct trees. Theoretical Com- CODEN TCSCDI. ISSN 0304- puter Science, 656 (Part B)(??):135– 3975 (print), 1879-2294 (electronic). 145, December 20, 2016. CODEN REFERENCES 180

TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516300676. //www.sciencedirect.com/science/ article/pii/S0304397516300706. Rytter:2016:TFC

Amir:2016:AJI [1064] Wojciech Rytter. Two fast construc- [1061] Amihood Amir, Alberto Apostolico, tions of compact representations of Tirza Hirst, Gad M. Landau, Noa binary words with given set of pe- Lewenstein, and Liat Rozenberg. Al- riods. Theoretical Computer Sci- gorithms for Jumbled Indexing, Jum- ence, 656 (Part B)(??):180–187, De- bled Border and Jumbled Square on cember 20, 2016. CODEN TC- run-length encoded strings. Theoretical SCDI. ISSN 0304-3975 (print), Computer Science, 656 (Part B)(??): 1879-2294 (electronic). URL http: 146–159, December 20, 2016. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516300664. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Zohora:2016:EAD article/pii/S030439751630069X. [1065] Fatema Tuz Zohora and M. So- Barton:2016:LTC hel Rahman. An efficient algorithm to detect common ancestor [1062] Carl Barton, Chang Liu, and Solon P. genes for non-overlapping inversion Pissis. Linear-time computation and applications. Theoretical Com- of prefix table for weighted strings puter Science, 656 (Part B)(??):188– & applications. Theoretical Com- 214, December 20, 2016. CODEN puter Science, 656 (Part B)(??):160– TCSCDI. ISSN 0304-3975 (print), 172, December 20, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516001961. //www.sciencedirect.com/science/ article/pii/S0304397516300688. I:2016:FLF Kim:2016:SEA [1066] Tomohiro I., Yuto Nakashima, Shun- [1063] Youngho Kim, Joong Chae Na, Heejin suke Inenaga, Hideo Bannai, and Park, and Jeong Seop Sim. A space- Masayuki Takeda. Faster Lyndon fac- efficient alphabet-independent Four- torization algorithms for SLP and LZ78 Russians’ lookup table and a mul- compressed text. Theoretical Com- tithreaded Four-Russians’ edit dis- puter Science, 656 (Part B)(??):215– tance algorithm. Theoretical Com- 224, December 20, 2016. CODEN puter Science, 656 (Part B)(??):173– TCSCDI. ISSN 0304-3975 (print), 179, December 20, 2016. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751600195X. REFERENCES 181

Matsuoka:2016:GPM TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1067] Yoshiaki Matsuoka, Takahiro Aoki, //www.sciencedirect.com/science/ Shunsuke Inenaga, Hideo Bannai, article/pii/S0304397515011755. and Masayuki Takeda. General- ized pattern matching and periodic- Fici:2016:FCA ity under substring consistent equivalence relations. Theoretical Com- [1071] Gabriele Fici, Tomasz Kociumaka, puter Science, 656 (Part B)(??):225– Thierry Lecroq, Arnaud Lefebvre, and ´ 233, December 20, 2016. CODEN Elise Prieur-Gaston. Fast computa- TCSCDI. ISSN 0304-3975 (print), tion of abelian runs. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 656 (Part B)(??):256– //www.sciencedirect.com/science/ 264, December 20, 2016. CODEN article/pii/S0304397516001390. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Crochemore:2016:DLR //www.sciencedirect.com/science/ [1068] Maxime Crochemore and Robert Mer- article/pii/S0304397515011718. cas. On the density of Lyndon Karkkainen:2016:TBS roots in factors. Theoretical Com- puter Science, 656 (Part B)(??):234– [1072] Juha Kärkkäinen, Dominik Kempa, 240, December 20, 2016. CODEN and Marcin Pi¸atkowski. Tighter TCSCDI. ISSN 0304-3975 (print), bounds for the sum of irreducible 1879-2294 (electronic). URL http: LCP values. Theoretical Computer //www.sciencedirect.com/science/ Science, 656 (Part B)(??):265–278, article/pii/S0304397516001377. December 20, 2016. CODEN TC- Badkobeh:2016:ECM SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1069] Golnaz Badkobeh, Maxime Crochemore, //www.sciencedirect.com/science/ Manal Mohamed, and Chalita Toop- article/pii/S0304397515011706. suwan. Efficient computation of maximal anti-exponent in palindrome-free Anonymous:2016:EBby strings. Theoretical Computer Sci- ence, 656 (Part B)(??):241–248, De- [1073] Anonymous. Editorial Board. The- cember 20, 2016. CODEN TC- oretical Computer Science, 657 (Part SCDI. ISSN 0304-3975 (print), B)(??):iii–ix, ???? 2016. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL //www.sciencedirect.com/science/ http: article/pii/S0304397516001365. //www.sciencedirect.com/science/ article/pii/S0304397516306454. Simpson:2016:APL Mohan:2016:CFA [1070] Jamie Simpson. An abelian periodicity lemma. Theoretical Com- [1074] Usha Mohan, Sivaramakrishnan Ra- puter Science, 656 (Part B)(??):249– mani, and Sounaka Mishra. Con- 255, December 20, 2016. CODEN stant factor approximation algorithm REFERENCES 182

for TSP satisfying a biased trian- //www.sciencedirect.com/science/ gle inequality. Theoretical Com- article/pii/S0304397516305199. puter Science, 657 (Part B)(??):111– 126, ???? 2016. CODEN TC- Guo:2016:CDR SCDI. ISSN 0304-3975 (print), [1078] Jia Guo and Mei Lu. Conditional 1879-2294 (electronic). URL http: diagnosability of the round match- //www.sciencedirect.com/science/ ing composition networks. Theoreti- article/pii/S0304397516305047. cal Computer Science, 657 (Part B) Anselmo:2016:NEN (??):163–172, ???? 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [1075] Marcella Anselmo, Dora Giammarresi, 1879-2294 (electronic). URL http: and Maria Madonia. Non-expandable //www.sciencedirect.com/science/ non-overlapping sets of pictures. The- article/pii/S030439751630531X. oretical Computer Science, 657 (Part Kawahara:2016:BBO B)(??):127–136, ???? 2016. CODEN TCSCDI. ISSN 0304-3975 (print), [1079] Jun Kawahara, Koji M. Kobayashi, 1879-2294 (electronic). URL http: and Shuichi Miyazaki. Better bounds //www.sciencedirect.com/science/ for online k-frame throughput maxi- article/pii/S0304397516305126. mization in network switches. The- oretical Computer Science, 657 (Part Meira:2016:CTC B)(??):173–190, ???? 2016. CODEN [1076] Luis A. A. Meira, Fl´avio K. Miyazawa, TCSCDI. ISSN 0304-3975 (print), and Lehilton L. C. Pedrosa. Cluster- 1879-2294 (electronic). URL http: ing through Continuous Facility Lo- //www.sciencedirect.com/science/ cation Problems. Theoretical Com- article/pii/S0304397516305321. puter Science, 657 (Part B)(??):137– Zhang:2016:MLS 145, ???? 2016. CODEN TC- SCDI. ISSN 0304-3975 (print), [1080] Haixia Zhang and Yi Wang. The 1879-2294 (electronic). URL http: minimal Laplacian spectral radius of //www.sciencedirect.com/science/ trees with diameter 4. Theoreti- article/pii/S030439751630514X. cal Computer Science, 657 (Part B) (??):191–195, ???? 2016. CODEN Du:2016:DAF TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1077] Chen Fei Du, Hamoon Mousavi, Eric //www.sciencedirect.com/science/ Rowland, Luke Schaeﬀer, and Jef- article/pii/S0304397516305163. frey Shallit. Decision algorithms for Fibonacci-automatic words, II: Related Anonymous:2017:EBa sequences and avoidability. Theoret- ical Computer Science, 657 (Part B) [1081] Anonymous. Editorial Board. Theo- (??):146–162, ???? 2016. CODEN retical Computer Science, 657 (part A) TCSCDI. ISSN 0304-3975 (print), (??):iii–ix, January 2, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), REFERENCES 183

1879-2294 (electronic). URL http: 20–27, January 2, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516306375. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Wang:2017:P article/pii/S0304397516302481. [1082] Jianxin Wang and Chee K. Yap. Preface. Theoretical Computer Sci- Wang:2017:TAA ence, 657 (part A)(??):1–2, Jan- uary 2, 2017. CODEN TC- [1086] Jinyan Wang, Minghao Yin, and SCDI. ISSN 0304-3975 (print), Jingli Wu. Two approximate algo- 1879-2294 (electronic). URL http: rithms for model counting. Theoret- //www.sciencedirect.com/science/ ical Computer Science, 657 (part A) article/pii/S0304397516306867. (??):28–37, January 2, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Furer:2017:ECC 1879-2294 (electronic). URL http: [1083] Martin Fürer. Efficient computa- //www.sciencedirect.com/science/ tion of the characteristic polynomial article/pii/S0304397516302316. of a threshold graph. Theoretical Computer Science, 657 (part A)(??): Liu:2017:FQA 3–10, January 2, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1087] Yang Liu and Shengyu Zhang. 1879-2294 (electronic). URL http: Fast quantum algorithms for least //www.sciencedirect.com/science/ squares regression and statistic lever- article/pii/S030439751630336X. age scores. Theoretical Computer , 657 (part A)(??):38–47, Lin:2017:PTS Science January 2, 2017. CODEN TC- [1084] Mugang Lin, Qilong Feng, Jianer Chen, SCDI. ISSN 0304-3975 (print), and Wenjun Li. Partition on trees 1879-2294 (electronic). URL http: with supply and demand: Kernel- //www.sciencedirect.com/science/ ization and algorithms. Theoretical article/pii/S0304397516302304. Computer Science, 657 (part A)(??): 11–19, January 2, 2017. CODEN Cheng:2017:IAI TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1088] Jie Cheng, Daming Zhu, and Bin- //www.sciencedirect.com/science/ hai Zhu. Improved algorithms for article/pii/S0304397516303000. intermediate dataset storage in a Li:2017:IKR cloud-based dataflow. Theoretical Computer Science, 657 (part A)(??): [1085] Wenjun Li, Qilong Feng, Jianer Chen, 48–53, January 2, 2017. CODEN and Shuai Hu. Improved kernel re- TCSCDI. ISSN 0304-3975 (print), sults for some FPT problems based 1879-2294 (electronic). URL http: on simple observations. Theoretical //www.sciencedirect.com/science/ Computer Science, 657 (part A)(??): article/pii/S0304397516302286. REFERENCES 184

Xian:2017:AMN Computer Science, 657 (part A)(??): 86–97, January 2, 2017. CODEN [1089] Aiyong Xian, Kaiyuan Zhu, Daming TCSCDI. ISSN 0304-3975 (print), Zhu, Lianrong Pu, and Hong Liu. 1879-2294 (electronic). URL http: Approximating Max NAE-k-SAT by //www.sciencedirect.com/science/ anonymous local search. Theoreti- article/pii/S0304397516302225. cal Computer Science, 657 (part A) (??):54–63, January 2, 2017. CODEN Zhang:2017:PSG TCSCDI. ISSN 0304-3975 (print), [1093] Peng Zhang and Yong Gao. A prob- 1879-2294 (electronic). URL http: abilistic study of generalized solution //www.sciencedirect.com/science/ concepts in satisfiability testing and article/pii/S0304397516302262. constraint programming. Theoretical Dong:2017:FPT Computer Science, 657 (part A)(??): 98–110, January 2, 2017. CODEN [1090] Jianming Dong, Weitian Tong, Taibo TCSCDI. ISSN 0304-3975 (print), Luo, Xueshi Wang, Jueliang Hu, Yin- 1879-2294 (electronic). URL http: feng Xu, and Guohui Lin. An FP- //www.sciencedirect.com/science/ TAS for the parallel two-stage flow- article/pii/S0304397516302201. shop problem. Theoretical Com- puter Science, 657 (part A)(??):64– Anonymous:2017:EBb 72, January 2, 2017. CODEN [1094] Anonymous. Editorial Board. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 658 (part A) 1879-2294 (electronic). URL http: (??):iii–ix, January 7, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516302250. See 1879-2294 (electronic). URL http: corrigendum [1354]. //www.sciencedirect.com/science/ Ivanyos:2017:SSD article/pii/S0304397516306612. Giammarresi:2017:P [1091] Gábor Ivanyos and Miklos Santha. Solving systems of diagonal polynomial [1095] Dora Giammarresi, Sabrina Mantaci, equations over finite fields. Theoret- Marinella Sciortino, and Filippo ical Computer Science, 657 (part A) Mignosi. Preface. Theoretical Com- (??):73–85, January 2, 2017. CODEN puter Science, 658 (part A)(??):1– TCSCDI. ISSN 0304-3975 (print), 3, January 7, 2017. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516302249. //www.sciencedirect.com/science/ article/pii/S0304397516306958. Xiao:2017:EAM Anselmo:2017:TDC [1092] Mingyu Xiao and Shaowei Kou. Ex- act algorithms for the maximum dis- [1096] Marcella Anselmo and Maria Mado- sociation set and minimum 3-path nia. Two-dimensional comma-free vertex cover problems. Theoretical and cylindric codes. Theoretical REFERENCES 185

Computer Science, 658 (part A)(??): ular languages. Theoretical Com- 4–17, January 7, 2017. CODEN puter Science, 658 (part A)(??):46– TCSCDI. ISSN 0304-3975 (print), 59, January 7, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516302523. //www.sciencedirect.com/science/ article/pii/S0304397516303541. Beal:2017:SNS [1097] Marie-Pierre Béal and Pavel Heller. Bonizzoni:2017:CGA Shifts of k-nested sequences. Theoret- ical Computer Science, 658 (part A) [1101] Paola Bonizzoni, Anna Paola Carri- (??):18–26, January 7, 2017. CODEN eri, Gianluca Della Vedova, Raffaella TCSCDI. ISSN 0304-3975 (print), Rizzi, and Gabriella Trucco. A colored 1879-2294 (electronic). URL http: graph approach to perfect phylogeny //www.sciencedirect.com/science/ with persistent characters. Theoret- article/pii/S0304397516302973. ical Computer Science, 658 (part A) (??):60–73, January 7, 2017. CODEN Badkobeh:2017:CME TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1098] Golnaz Badkobeh, Maxime Crochemore, //www.sciencedirect.com/science/ and Robert Mercas. Counting article/pii/S0304397516304236. maximal-exponent factors in words. Theoretical Computer Science, 658 Castiglione:2017:CLH (part A)(??):27–35, January 7, 2017. CODEN TCSCDI. ISSN 0304- [1102] Giusi Castiglione and Paolo Massazza. 3975 (print), 1879-2294 (electronic). On a class of languages with holo- URL http://www.sciencedirect. nomic generating functions. Theoret- com/science/article/pii/S0304397516001778. ical Computer Science, 658 (part A) Barcucci:2017:NOM (??):74–84, January 7, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1099] Elena Barcucci, Antonio Bernini, Ste- 1879-2294 (electronic). URL http: fano Bilotta, and Renzo Pinzani. Non- //www.sciencedirect.com/science/ overlapping matrices. Theoretical article/pii/S0304397516303565. Computer Science, 658 (part A)(??): 36–45, January 7, 2017. CODEN Choffrut:2017:SWD TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1103] Christian Choffrut. Sequences of words //www.sciencedirect.com/science/ defined by two-way transducers. Theo- article/pii/S0304397516301220. retical Computer Science, 658 (part A) Bersani:2017:LCT (??):85–96, January 7, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1100] Marcello M. Bersani, Matteo Rossi, 1879-2294 (electronic). URL http: and Pierluigi San Pietro. A log- //www.sciencedirect.com/science/ ical characterization of timed reg- article/pii/S0304397516301177. REFERENCES 186

Cori:2017:SB 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1104] R. Cori and C. Reutenauer. On article/pii/S0304397516304819. Sillke’s bijection. Theoretical Com- puter Science, 658 (part A)(??):97– Dolce:2017:NTS 104, January 7, 2017. CODEN [1108] Francesco Dolce and Dominique Per- TCSCDI. ISSN 0304-3975 (print), rin. Neutral and tree sets of ar- 1879-2294 (electronic). URL http: bitrary characteristic. Theoretical //www.sciencedirect.com/science/ Computer Science, 658 (part A)(??): article/pii/S0304397516300548. 159–174, January 7, 2017. CODEN Reghizzi:2017:TTI TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1105] Stefano Crespi Reghizzi, Violetta //www.sciencedirect.com/science/ Lonati, Dino Mandrioli, and Mat- article/pii/S0304397516000190. teo Pradella. Toward a theory of input-driven locally parsable lan- Guaiana:2017:LTW guages. Theoretical Computer Sci- ence, 658 (part A)(??):105–121, Jan- [1109] Giovanna Guaiana. Local testabil- uary 7, 2017. CODEN TC- ity from words to traces, a suit- SCDI. ISSN 0304-3975 (print), able definition. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 658 (part A)(??):175– //www.sciencedirect.com/science/ 189, January 7, 2017. CODEN article/pii/S0304397516301165. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: DAniello:2017:CSW //www.sciencedirect.com/science/ [1106] Alma D’Aniello, Aldo de Luca, and article/pii/S0304397516302687. Alessandro De Luca. On Christof- Karhumaki:2017:CAE fel and standard words and their derivatives. Theoretical Computer [1110] Juhani Karhumäki, Svetlana Puzyn- Science, 658 (part A)(??):122–147, ina, Michaël Rao, and Markus A. January 7, 2017. CODEN TC- Whiteland. On cardinalities of k- SCDI. ISSN 0304-3975 (print), abelian equivalence classes. Theoretical 1879-2294 (electronic). URL http: Computer Science, 658 (part A)(??): //www.sciencedirect.com/science/ 190–204, January 7, 2017. CODEN article/pii/S0304397516301232. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: DeFelice:2017:USC //www.sciencedirect.com/science/ [1107] Clelia De Felice, Rocco Zaccagnino, article/pii/S0304397516302468. and Rosalba Zizza. Unavoid- Kleijn:2017:AR able sets and circular splicing languages. Theoretical Computer Sci- [1111] Jetty Kleijn, Maciej Koutny, Marta ence, 658 (part A)(??):148–158, Jan- Pietkiewicz-Koutny, and Grzegorz uary 7, 2017. CODEN TC- Rozenberg. Applying regions. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 658 (part REFERENCES 187

A)(??):205–215, January 7, 2017. TCSCDI. ISSN 0304-3975 (print), CODEN TCSCDI. ISSN 0304- 1879-2294 (electronic). URL http: 3975 (print), 1879-2294 (electronic). //www.sciencedirect.com/science/ URL http://www.sciencedirect. article/pii/S0304397516306697. com/science/article/pii/S0304397516000840. Anonymous:2017:EBd Marsault:2017:SRL [1116] Anonymous. Editorial Board. Theo- [1112] Victor Marsault and Jacques Sakarovitch. retical Computer Science, 658 (part B) The signature of rational languages. (??):iii–ix, January 7, 2017. CODEN Theoretical Computer Science, 658 TCSCDI. ISSN 0304-3975 (print), (part A)(??):216–234, January 7, 1879-2294 (electronic). URL http: 2017. CODEN TCSCDI. ISSN 0304- //www.sciencedirect.com/science/ 3975 (print), 1879-2294 (electronic). article/pii/S0304397516306697. URL http://www.sciencedirect. com/science/article/pii/S0304397516300627. Adaricheva:2017:F

Moreira:2017:OSR [1117] Kira Adaricheva, Giuseppe F. Ital- iano, Hans Kleine Büning, and György [1113] Nelma Moreira, Giovanni Pighizzini, and Rogério Reis. Optimal state re- Turán. Foreword. Theoretical Com- puter Science, 658 (Part B)(??): ductions of automata with partially 263, January 7, 2017. CODEN specified behaviors. Theoretical Com- puter Science, 658 (part A)(??):235– TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL 245, January 7, 2017. CODEN http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ article/pii/S0304397516306934. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Wild:2017:JIA article/pii/S0304397516301153. [1118] Marcel Wild. The joy of impli- Pin:2017:UCF cations, aka pure Horn formulas: [1114] Jean-Eric´ Pin and Pedro V. Silva. Mainly a survey. Theoretical Com- On uniformly continuous functions for puter Science, 658 (Part B)(??):264– some profinite topologies. Theoretical 292, January 7, 2017. CODEN Computer Science, 658 (part A)(??): TCSCDI. ISSN 0304-3975 (print), 246–262, January 7, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516002206. //www.sciencedirect.com/science/ Ausiello:2017:DHI article/pii/S0304397516302493. Anonymous:2017:EBc [1119] Giorgio Ausiello and Luigi Laura. Directed hypergraphs: Introduc- [1115] Anonymous. Editorial Board. Theo- tion and fundamental algorithms — retical Computer Science, 658 (Part B) a survey. Theoretical Computer (??):iii–ix, January 7, 2017. CODEN Science, 658 (Part B)(??):293–306, REFERENCES 188

January 7, 2017. CODEN TC- Arias:2017:LDH SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1123] Marta Arias, José L. Balcázar, //www.sciencedirect.com/science/ and Cristina Tˆırnauca. Learning article/pii/S0304397516002097. definite Horn formulas from closure queries. Theoretical Computer Adaricheva:2017:DBB Science, 658 (Part B)(??):346–356, January 7, 2017. CODEN TC- SCDI. ISSN 0304-3975 (print), [1120] K. Adaricheva and J. B. Nation. 1879-2294 (electronic). URL http: Discovery of the D-basis in bi- //www.sciencedirect.com/science/ nary tables based on hypergraph article/pii/S0304397515011809. dualization. Theoretical Computer Science, 658 (Part B)(??):307–315, Chardin:2017:RQL January 7, 2017. CODEN TC- SCDI. ISSN 0304-3975 (print), [1124] Brice Chardin, Emmanuel Coquery, 1879-2294 (electronic). URL http: Marie Pailloux, and Jean-Marc Pe- //www.sciencedirect.com/science/ tit. RQL: a query language for rule article/pii/S0304397515011172. discovery in databases. Theoretical Computer Science, 658 (Part B)(??): Babin:2017:DLG 357–374, January 7, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL [1121] Mikhail A. Babin and Sergei O. http: Kuznetsov. Dualization in lat- //www.sciencedirect.com/science/ . tices given by ordered sets of ir- article/pii/S0304397516305941 reducibles. Theoretical Computer Obiedkov:2017:PCP Science, 658 (Part B)(??):316–326, January 7, 2017. CODEN TC- [1125] Sergei Obiedkov. Parameterized ce- SCDI. ISSN 0304-3975 (print), teris paribus preferences over atomic 1879-2294 (electronic). URL http: conjunctions under conservative se- //www.sciencedirect.com/science/ mantics. Theoretical Computer article/pii/S0304397516000165. Science, 658 (Part B)(??):375–390, January 7, 2017. CODEN TC- Rudolph:2017:STC SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1122] Sebastian Rudolph. Succinctness //www.sciencedirect.com/science/ and tractability of closure operator article/pii/S0304397516000591. representations. Theoretical Com- Beaudou:2017:AMS puter Science, 658 (Part B)(??):327– 345, January 7, 2017. CODEN [1126] Laurent Beaudou, Arnaud Mary, and TCSCDI. ISSN 0304-3975 (print), Lhouari Nourine. Algorithms for k- 1879-2294 (electronic). URL http: meet-semidistributive lattices. Theo- //www.sciencedirect.com/science/ retical Computer Science, 658 (Part article/pii/S0304397515011986. B)(??):391–398, January 7, 2017. REFERENCES 189

CODEN TCSCDI. ISSN 0304- 1–13, January 10, 2017. CODEN 3975 (print), 1879-2294 (electronic). TCSCDI. ISSN 0304-3975 (print), URL http://www.sciencedirect. 1879-2294 (electronic). URL http: com/science/article/pii/S0304397515009354//www.sciencedirect.com/science/. article/pii/S0304397516305680. Kucera:2017:HCG Liu:2017:MPS [1127] Petr Kucera. Hydras: Complex- ity on general graphs and a sub- [1131] Wen An Liu and Ming Yue Wang. class of trees. Theoretical Com- Multi-player subtraction games. The- puter Science, 658 (Part B)(??):399– oretical Computer Science, 659(??): 416, January 7, 2017. CODEN 14–35, January 10, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516301840. article/pii/S0304397516305692. Sloan:2017:HDH Bacquey:2017:LET [1128] Robert H. Sloan, Despina Stasi, [1132] Nicolas Bacquey. Leader election and György Turán. Hydras: Di- on two-dimensional periodic cellu- rected hypergraphs and Horn for- lar automata. Theoretical Com- mulas. Theoretical Computer Sci- puter Science, 659(??):36–52, Jan- ence, 658 (Part B)(??):417–428, uary 10, 2017. CODEN TC- January 7, 2017. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516305990. article/pii/S0304397516301839. Xu:2017:GND Anonymous:2017:EBe [1133] Xiang Xu, Xiaowang Li, Shuming [1129] Anonymous. Editorial Board. The- Zhou, Rong-Xia Hao, and Mei-Mei oretical Computer Science, 659(??): Gu. The g-good-neighbor diagnos- iii–ix, January 10, 2017. CODEN ability of (n, k)-star graphs. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 659(??): 1879-2294 (electronic). URL http: 53–63, January 10, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516307241. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Burcsi:2017:PNW article/pii/S0304397516306028. [1130] Péter Burcsi, Gabriele Fici, Zsuzsanna Kellerer:2017:AIU Lipták, Frank Ruskey, and Joe Sawada. On prefix normal words [1134] Hans Kellerer, Rebecca Sarto Basso, and prefix normal forms. Theo- and Vitaly A. Strusevich. Approx- retical Computer Science, 659(??): imability issues for unconstrained and REFERENCES 190

constrained maximization of half- Kamiyama:2017:NSV product related functions. Theoret- ical Computer Science, 659(??):64– [1138] Naoyuki Kamiyama. A note on 71, January 10, 2017. CODEN the submodular vertex cover prob- TCSCDI. ISSN 0304-3975 (print), lem with submodular penalties. The- 1879-2294 (electronic). URL http: oretical Computer Science, 659(??): //www.sciencedirect.com/science/ 95–97, January 10, 2017. CODEN article/pii/S0304397516306041. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Xiao:2017:CKB //www.sciencedirect.com/science/ article/pii/S0304397516305928. [1135] Mingyu Xiao and Hiroshi Nagamochi. Anonymous:2017:EBf Complexity and kernels for bipartition into degree-bounded induced graphs. [1139] Anonymous. Editorial Board. The- Theoretical Computer Science, 659(??): oretical Computer Science, 660(??): 72–82, January 10, 2017. CODEN iii–ix, January 17, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516306065. article/pii/S0304397516307344.

Kintali:2017:DWP Rusu:2017:LLT

[1136] Shiva Kintali. Directed width param- [1140] Irena Rusu. log-Lists and their appli- eters and circumference of digraphs. cations to sorting by transpositions, re- Theoretical Computer Science, 659(??): versals and block-interchanges. The- 83–87, January 10, 2017. CODEN oretical Computer Science, 660(??): TCSCDI. ISSN 0304-3975 (print), 1–15, January 17, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516305436. //www.sciencedirect.com/science/ article/pii/S0304397516306077.

Karpinski:2017:VCM Barmpalias:2017:CHP

[1137] Michal Karpi´nski. Vertex 2-coloring [1141] George Barmpalias and Andrew Lewis- without monochromatic cycles of Pye. Computing halting probabili- ﬁxed size is NP-complete. The- ties from other halting probabilities. oretical Computer Science, 659(??): Theoretical Computer Science, 660(??): 88–94, January 10, 2017. CODEN 16–22, January 17, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516305448. article/pii/S0304397516306089. REFERENCES 191

Faonio:2017:FLR TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1142] Antonio Faonio, Jesper Buus Nielsen, //www.sciencedirect.com/science/ and Daniele Venturi. Fully leakage- article/pii/S0304397516306922. resilient signatures revisited: Grace- ful degradation, noisy leakage, and Shitov:2017:CFZ construction in the bounded-retrieval [1146] Yaroslav Shitov. On the complex- model. Theoretical Computer Sci- ity of failed zero forcing. Theoret- ence, 660(??):23–56, January 17, ical Computer Science, 660(??):102– 2017. CODEN TCSCDI. ISSN 0304- 104, January 17, 2017. CODEN 3975 (print), 1879-2294 (electronic). TCSCDI. ISSN 0304-3975 (print), URL http://www.sciencedirect. 1879-2294 (electronic). URL http: com/science/article/pii/S0304397516306119//www.sciencedirect.com/science/. Akutsu:2017:PCA article/pii/S0304397516306971.

[1143] Tatsuya Akutsu, Jesper Jansson, At- Anonymous:2017:EBg suhiro Takasu, and Takeyuki Tamura. [1147] Anonymous. Editorial Board. The- On the parameterized complexity of as- oretical Computer Science, 661(??): sociative and commutative uniﬁcation. iii–ix, January 24, 2017. CODEN Theoretical Computer Science, 660(??): TCSCDI. ISSN 0304-3975 (print), 57–74, January 17, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517300178. //www.sciencedirect.com/science/ article/pii/S0304397516306892. Wang:2017:NSD Guo:2017:NLF [1148] Jihui Wang, Jiansheng Cai, and Bao- jian Qiu. Neighbor sum distinguish- [1144] Siyao Guo and Ilan Komargodski. ing total choosability of planar graphs Negation-limited formulas. Theoret- without adjacent triangles. The- ical Computer Science, 660(??):75– oretical Computer Science, 661(??): 85, January 17, 2017. CODEN 1–7, January 24, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516306909. article/pii/S030439751630593X. Cheng:2017:NCA Correa:2017:LTC [1145] Maggie X. Cheng, Yi Ling, and [1149] Ricardo C. Corrˆea and Pablo M. S. Brian M. Sadler. Network connec- Farias. Linear time computation tivity assessment and improvement of the maximal linear and circu- through relay node deployment. The- lar sums of multiple independent in- oretical Computer Science, 660(??): sertions into a sequence. Theo- 86–101, January 17, 2017. CODEN retical Computer Science, 661(??): REFERENCES 192

8–17, January 24, 2017. CODEN Khodakarami:2017:TGP TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1153] Farnoosh Khodakarami, Farzad Dide- //www.sciencedirect.com/science/ hvar, and Ali Mohades. 1.5D ter- article/pii/S0304397516305953. rain guarding problem parameterized by guard range. Theoreti- Birks:2017:TAO cal Computer Science, 661(??):65– 69, January 24, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1150] Martin Birks and Stanley P. Y. Fung. 1879-2294 (electronic). URL http: Temperature aware online algorithms //www.sciencedirect.com/science/ for minimizing flow time. Theoret- article/pii/S0304397516306107. ical Computer Science, 661(??):18– 34, January 24, 2017. CODEN Anonymous:2017:EBh TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1154] Anonymous. Editorial Board. The- //www.sciencedirect.com/science/ oretical Computer Science, 662(??): article/pii/S0304397516306004. iii–ix, February 1, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Aubrun:2017:NES 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ . [1151] Nathalie Aubrun, Sebastián Barbi- article/pii/S0304397517300270 eri, and Mathieu Sablik. A no- Czygrinow:2017:IDL tion of effectiveness for subshifts on finitely generated groups. Theoret- [1155] A. Czygrinow, M. Hanćkowiak, E. Szymańska, ical Computer Science, 661(??):35– W. Wawrzyniak, and M. Witkowski. 55, January 24, 2017. CODEN Improved distributed local approx- TCSCDI. ISSN 0304-3975 (print), imation algorithm for minimum 2- 1879-2294 (electronic). URL http: dominating set in planar graphs. The- //www.sciencedirect.com/science/ oretical Computer Science, 662(??): article/pii/S0304397516306983. 1–8, February 1, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Ashok:2017:PCS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1152] Pradeesha Ashok, Sudeshna Kolay, article/pii/S0304397516307071. S. M. Meesum, and Saket Saurabh. Pa- Bilo:2017:ARM rameterized complexity of Strip Pack- ing and Minimum Volume Packing. [1156] Vittorio Bilò, Michele Flammini, and Theoretical Computer Science, 661(??): Gianpiero Monaco. Approximat- 56–64, January 24, 2017. CODEN ing the revenue maximization prob- TCSCDI. ISSN 0304-3975 (print), lem with sharp demands. Theo- 1879-2294 (electronic). URL http: retical Computer Science, 662(??): //www.sciencedirect.com/science/ 9–30, February 1, 2017. CODEN article/pii/S0304397516307022. TCSCDI. ISSN 0304-3975 (print), REFERENCES 193

1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516307083. //www.sciencedirect.com/science/ article/pii/S0304397516307101. Montejano:2017:CCR Anonymous:2017:EBi [1157] Luis Pedro Montejano and Ignasi Sau. On the complexity of computing the k- [1161] Anonymous. Editorial Board. The- restricted edge-connectivity of a graph. oretical Computer Science, 663(??): Theoretical Computer Science, 662(??): iii–ix, ???? 2017. CODEN TC- 31–39, February 1, 2017. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517300452. article/pii/S0304397516307125. Fiadeiro:2017:HAN Kintali:2017:FDM [1162] José L. Fiadeiro and Antónia Lopes. [1158] Shiva Kintali and Qiuyi Zhang. Forbid- Heterogeneous and asynchronous net- den directed minors and Kelly-width. works of timed systems. Theo- Theoretical Computer Science, 662(??): retical Computer Science, 663(??): 40–47, February 1, 2017. CODEN 1–33, ???? 2017. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516307149. article/pii/S0304397516307423. Hwang:2017:SSE Seldin:2017:SRC [1159] Jung Yeon Hwang, Boyeon Song, Dae- seon Choi, Seung-Hun Jin, Hyun Sook [1163] Jonathan P. Seldin. The search Cho, and Mun-Kyu Lee. Simpli- for a reduction in combinatory logic fied small exponent test for batch equivalent to λβ-reduction, Part II. verification. Theoretical Computer Theoretical Computer Science, 663 Science, 662(??):48–58, February 1, (??):34–58, ???? 2017. CODEN 2017. CODEN TCSCDI. ISSN 0304- TCSCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397516307459article/pii/S0304397516307447. . Lenhart:2017:PEP Anonymous:2017:EBj [1160] William J. Lenhart, Giuseppe Liotta, [1164] Anonymous. Editorial Board. The- and Fabrizio Montecchiani. On par- oretical Computer Science, 664(??): titioning the edges of 1-plane graphs. iii–ix, February 15, 2017. CODEN Theoretical Computer Science, 662(??): TCSCDI. ISSN 0304-3975 (print), 59–65, February 1, 2017. CODEN 1879-2294 (electronic). URL http: REFERENCES 194

//www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517300580. //www.sciencedirect.com/science/ article/pii/S0304397515007793. Campadelli:2017:P Bianchi:2017:QFA [1165] Paola Campadelli, Giovanni Pighizzini, and Massimiliano Goldwurm. Pref- [1169] Maria Paola Bianchi, Carlo Mereghetti, ace. Theoretical Computer Science, 664 and Beatrice Palano. Quantum fi- (??):1, February 15, 2017. CODEN nite automata: Advances on Bertoni’s TCSCDI. ISSN 0304-3975 (print), ideas. Theoretical Computer Sci- 1879-2294 (electronic). URL http: ence, 664(??):39–53, February 15, //www.sciencedirect.com/science/ 2017. CODEN TCSCDI. ISSN 0304- article/pii/S0304397517300129. 3975 (print), 1879-2294 (electronic). Campadelli:2017:ABS URL http://www.sciencedirect. com/science/article/pii/S030439751600089X. [1166] Paola Campadelli, Massimiliano Gold- wurm, and Giovanni Pighizzini. Al- Brocchi:2017:EGC berto Bertoni: a scientist and a friend. [1170] Stefano Brocchi, Giusi Castiglione, and Theoretical Computer Science, 664(??): Paolo Massazza. On the exhaustive 2–11, February 15, 2017. CODEN generation of k-convex polyominoes. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 664(??): 1879-2294 (electronic). URL http: 54–66, February 15, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517300336. 1879-2294 (electronic). URL http: Adamo:2017:SDI //www.sciencedirect.com/science/ article/pii/S030439751600116X. [1167] Alessandro Adamo, Giuliano Grossi, Raffaella Lanzarotti, and Jianyi Lin. Carpi:2017:ISF Sparse decomposition by iterating Lipschitzian-type mappings. Theo- [1171] Arturo Carpi and Flavio D’Alessandro. retical Computer Science, 664(??):12– On incomplete and synchronizing fi- 28, February 15, 2017. CODEN nite sets. Theoretical Computer Sci- TCSCDI. ISSN 0304-3975 (print), ence, 664(??):67–77, February 15, 1879-2294 (electronic). URL http: 2017. CODEN TCSCDI. ISSN 0304- //www.sciencedirect.com/science/ 3975 (print), 1879-2294 (electronic). article/pii/S0304397516300640. URL http://www.sciencedirect. com/science/article/pii/S0304397515007896. Barcucci:2017:CBF Choffrut:2017:HOR [1168] Elena Barcucci, Antonio Bernini, Ste- fano Bilotta, and Renzo Pinzani. [1172] Christian Choffrut. An Hadamard op- Cross-bifix-free sets in two dimensions. eration on rational relations. The- Theoretical Computer Science, 664(??): oretical Computer Science, 664(??): 29–38, February 15, 2017. CODEN 78–90, February 15, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), REFERENCES 195

1879-2294 (electronic). URL http: oretical Computer Science, 664(??): //www.sciencedirect.com/science/ 144–163, February 15, 2017. CODEN article/pii/S0304397515009482. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Reghizzi:2017:CMP //www.sciencedirect.com/science/ [1173] Stefano Crespi Reghizzi and Pierluigi article/pii/S0304397516000529. San Pietro. Counter machines, Petri Anonymous:2017:EBk Nets, and consensual computation. Theoretical Computer Science, 664(??): [1177] Anonymous. Editorial Board. The- 91–116, February 15, 2017. CODEN oretical Computer Science, 665(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, ???? 2017. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515011433. //www.sciencedirect.com/science/ article/pii/S0304397517300762. DeFelice:2017:DPC Golovach:2017:GEG [1174] Clelia De Felice, Sabrina Mantaci, and Antonio Restivo. On the de- [1178] Petr A. Golovach and George B. composition of prefix codes. Theoret- Mertzios. Graph editing to a ical Computer Science, 664(??):117– given degree sequence. Theoret- 130, February 15, 2017. CODEN ical Computer Science, 665(??):1– TCSCDI. ISSN 0304-3975 (print), 12, ???? 2017. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751501141X. //www.sciencedirect.com/science/ article/pii/S0304397516307137. Dennunzio:2017:CCF Jez:2017:UCG [1175] Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Giancarlo Mauri, [1179] Artur Jez and Alexander Okhotin. and Antonio E. Porreca. Compu- Unambiguous conjunctive grammars tational complexity of finite asyn- over a one-symbol alphabet. The- chronous cellular automata. Theoret- oretical Computer Science, 665(??): ical Computer Science, 664(??):131– 13–39, ???? 2017. CODEN TC- 143, February 15, 2017. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516307150. article/pii/S0304397515011421. Giotis:2017:AEC Sabadini:2017:GAN [1180] Ioannis Giotis, Lefteris Kirousis, [1176] N. Sabadini, F. Schiavio, and R. F. C. Kostas I. Psaromiligkos, and Dim- Walters. On the geometry and al- itrios M. Thilikos. Acyclic edge color- gebra of networks with state. The- ing through the Lovász Local Lemma. REFERENCES 196

Theoretical Computer Science, 665 Anonymous:2017:EBl (??):40–50, ???? 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1184] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 666(??): //www.sciencedirect.com/science/ iii–ix, ???? 2017. CODEN TC- article/pii/S0304397516307174. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Datta:2017:SSS //www.sciencedirect.com/science/ article/pii/S0304397517300932. [1181] Ajoy K. Datta, Stéphane Devismes, and Lawrence L. Larmore. Self- Mishra:2017:MAC stabilizing silent disjunction in an [1185] Apoorva Mishra and Anupam Shukla. anonymous network. Theoreti- Mathematical analysis of the cumula- cal Computer Science, 665(??):51– tive effect of novel ternary crossover 72, ???? 2017. CODEN TC- operator and mutation on probabil- SCDI. ISSN 0304-3975 (print), ity of survival of a schema. The- 1879-2294 (electronic). URL http: oretical Computer Science, 666(??): //www.sciencedirect.com/science/ 1–11, ???? 2017. CODEN TC- article/pii/S0304397516307186. SCDI. ISSN 0304-3975 (print), Lancia:2017:SSS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1182] Giuseppe Lancia, Luke Mathieson, article/pii/S0304397516303802. and Pablo Moscato. Separating sets Teh:2017:IRS of strings by finding matching patterns is almost always hard. The- [1186] Wen Chean Teh and Adrian Atana- oretical Computer Science, 665(??): siu. Irreducible reaction systems 73–86, ???? 2017. CODEN TC- and reaction system rank. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 666(??): 1879-2294 (electronic). URL http: 12–20, ???? 2017. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397516307460. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Al-Bataineh:2017:FMM article/pii/S030439751630439X. [1183] Omar Al-Bataineh, Mark Reynolds, Zaitsev:2017:GNC and Tim French. Finding minimum and maximum termination time of [1187] Dmitry A. Zaitsev. A generalized timed automata models with cyclic be- neighborhood for cellular automata. haviour. Theoretical Computer Science, Theoretical Computer Science, 666 665(??):87–104, ???? 2017. CODEN (??):21–35, ???? 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516307484. article/pii/S0304397516305916. REFERENCES 197

Durand:2017:ATE Datta:2017:SFH [1188] Bruno Durand, Guilhem Gamard, and [1192] Pratish Datta, Ratna Dutta, and Anaël Grandjean. Aperiodic tilings and Sourav Mukhopadhyay. Strongly full- entropy. Theoretical Computer Science, hiding inner product encryption. The- 666(??):36–47, ???? 2017. CODEN oretical Computer Science, 667(??): TCSCDI. ISSN 0304-3975 (print), 16–50, March 8, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516307198. //www.sciencedirect.com/science/ article/pii/S0304397516307526. Zheng:2017:PPS Lee:2017:SUE [1189] Shenggen Zheng, Lvzhou Li, Daowen Qiu, and Jozef Gruska. Promise [1193] Kwangsu Lee, Seung Geol Choi, problems solved by quantum and Dong Hoon Lee, Jong Hwan Park, and classical finite automata. Theoret- Moti Yung. Self-updatable encryp- ical Computer Science, 666(??):48– tion: Time constrained access control 64, ???? 2017. CODEN TC- with hidden attributes and better effi- SCDI. ISSN 0304-3975 (print), ciency. Theoretical Computer Science, 1879-2294 (electronic). URL http: 667(??):51–92, March 8, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516307538. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Anonymous:2017:EBm article/pii/S0304397516307551. [1190] Anonymous. Editorial Board. The- Gentner:2017:DMD oretical Computer Science, 667(??): iii–ix, March 8, 2017. CODEN [1194] Michael Gentner and Dieter Rauten- TCSCDI. ISSN 0304-3975 (print), bach. Dynamic monopolies for degree 1879-2294 (electronic). URL http: proportional thresholds in connected //www.sciencedirect.com/science/ graphs of girth at least five and trees. article/pii/S0304397517301147. Theoretical Computer Science, 667(??): 93–100, March 8, 2017. CODEN Chalk:2017:CIR TCSCDI. ISSN 0304-3975 (print), [1191] Cameron T. Chalk, Bin Fu, Eric 1879-2294 (electronic). URL http: Martinez, Robert Schweller, and //www.sciencedirect.com/science/ Tim Wylie. Concentration inde- article/pii/S0304397516307563. pendent random number genera- Flammini:2017:NMG tion in tile self-assembly. Theo- retical Computer Science, 667(??): [1195] M. Flammini, V. Gallotti, G. Melideo, 1–15, March 8, 2017. CODEN G. Monaco, and L. Moscardelli. Net- TCSCDI. ISSN 0304-3975 (print), work movement games. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 667(??):101– //www.sciencedirect.com/science/ 118, March 8, 2017. CODEN TC- article/pii/S0304397516307496. SCDI. ISSN 0304-3975 (print), REFERENCES 198

1879-2294 (electronic). URL http: Science, 668(??):43–58, March 15, //www.sciencedirect.com/science/ 2017. CODEN TCSCDI. ISSN 0304- article/pii/S0304397516307575. 3975 (print), 1879-2294 (electronic). URL http://www.sciencedirect. Anonymous:2017:EBn com/science/article/pii/S0304397517300385. [1196] Anonymous. Editorial Board. The- Dekking:2017:CCF oretical Computer Science, 668(??): iii–ix, March 15, 2017. CODEN [1200] F. Michel Dekking and Michael S. TCSCDI. ISSN 0304-3975 (print), Keane. On the conjugacy class of 1879-2294 (electronic). URL http: the Fibonacci dynamical system. The- //www.sciencedirect.com/science/ oretical Computer Science, 668(??): article/pii/S0304397517301445. 59–69, March 15, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Rao:2017:CFA 1879-2294 (electronic). URL http: [1197] Y. Sreenivasa Rao and Ratna Dutta. //www.sciencedirect.com/science/ Computational friendly attribute- article/pii/S0304397517300506. based encryptions with short cipher- Dvorak:2017:GGC text. Theoretical Computer Science, 668(??):1–26, March 15, 2017. CODEN [1201] Tomás Dvorák, Petr Gregor, and TCSCDI. ISSN 0304-3975 (print), Václav Koubek. Generalized Gray 1879-2294 (electronic). URL http: codes with prescribed ends. The- //www.sciencedirect.com/science/ oretical Computer Science, 668(??): article/pii/S0304397516307587. 70–94, March 15, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Charalambidis:2017:ETF 1879-2294 (electronic). URL http: [1198] Angelos Charalambidis, Panos Ron- //www.sciencedirect.com/science/ dogiannis, and Ioanna Symeonidou. article/pii/S0304397517300518. Equivalence of two fixed-point se- Anonymous:2017:EBo mantics for definitional higher-order logic programs. Theoretical Computer [1202] Anonymous. Editorial Board. The- Science, 668(??):27–42, March 15, oretical Computer Science, 669(??): 2017. CODEN TCSCDI. ISSN 0304- iii–ix, March 22, 2017. CODEN 3975 (print), 1879-2294 (electronic). TCSCDI. ISSN 0304-3975 (print), URL http://www.sciencedirect. 1879-2294 (electronic). URL http: com/science/article/pii/S0304397517300373//www.sciencedirect.com/science/. article/pii/S0304397517301718. Foucaud:2017:ILD Jovanovic:2017:SOE [1199] Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, and [1203] Aleksandra Jovanović, Marta Kwiatkowska, Petru Valicov. Identification, location- Gethin Norman, and Quentin Peyras. domination and metric dimension Symbolic optimal expected time reach- on interval and permutation graphs. ability computation and controller syn- I. Bounds. Theoretical Computer thesis for probabilistic timed automata. REFERENCES 199

Theoretical Computer Science, 669 with the triangle inequality. The- (??):1–21, March 22, 2017. CODEN oretical Computer Science, 670(??): TCSCDI. ISSN 0304-3975 (print), 1–10, March 29, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517300646. //www.sciencedirect.com/science/ article/pii/S0304397517300531. Xi:2017:LCC [1204] Xiaoyong Xi, Qingyu He, and Lingyun Angelopoulos:2017:ILP Yang. On the largest Cartesian closed category of stable domains. The- [1208] Spyros Angelopoulos, Diogo Arsénio, oretical Computer Science, 669(??): and Christoph Dürr. Infinite lin- 22–32, March 22, 2017. CODEN ear programming and online search- TCSCDI. ISSN 0304-3975 (print), ing with turn cost. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 670(??):11– //www.sciencedirect.com/science/ 22, March 29, 2017. CODEN TC- article/pii/S0304397517301007. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Bocchi:2017:MNT //www.sciencedirect.com/science/ article/pii/S0304397517300622. [1205] Laura Bocchi, Tzu-Chun Chen, Ro- main Demangeon, Kohei Honda, and Wang:2017:EIS Nobuko Yoshida. Monitoring networks through multiparty session types. The- [1209] Yan Wang, Hong Shen, and Jianxi oretical Computer Science, 669(??): Fan. Edge-independent spanning 33–58, March 22, 2017. CODEN trees in augmented cubes. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 670(??): 1879-2294 (electronic). URL http: 23–32, March 29, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517301263. 1879-2294 (electronic). URL http: Anonymous:2017:EBp //www.sciencedirect.com/science/ article/pii/S0304397517300658. [1206] Anonymous. Editorial Board. The- oretical Computer Science, 670(??): Chen:2017:DVR iii–ix, March 29, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1210] Jianer Chen, Chao Xu, and Jianxin 1879-2294 (electronic). URL http: Wang. Dealing with 4-variables by //www.sciencedirect.com/science/ resolution: an improved MaxSAT article/pii/S0304397517301809. algorithm. Theoretical Computer Gourves:2017:BOM Science, 670(??):33–44, March 29, 2017. CODEN TCSCDI. ISSN 0304- [1207] Laurent Gourvès, Jérôme Monnot, 3975 (print), 1879-2294 (electronic). Fanny Pascual, and Daniel Van- URL http://www.sciencedirect. derpooten. Bi-objective matchings com/science/article/pii/S0304397517300695. REFERENCES 200

Kung:2017:ESR //www.sciencedirect.com/science/ article/pii/S0304397517300671. [1211] Tzu-Liang Kung and Chun-Nan Hung. Estimating the subsystem reliabil- Anonymous:2017:EBq ity of bubblesort networks. The- oretical Computer Science, 670(??): [1215] Anonymous. Editorial Board. The- 45–55, March 29, 2017. CODEN oretical Computer Science, 671(??): TCSCDI. ISSN 0304-3975 (print), iii–ix, April 6, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517300701. //www.sciencedirect.com/science/ article/pii/S0304397517301949. Martin:2017:CCQ Kari:2017:Ea [1212] Barnaby Martin, András Pongrácz, and Michal Wrona. The com- [1216] Lila Kari. Editorial. Theo- plexity of counting quantifiers on retical Computer Science, 671(??): equality languages. Theoretical 1, April 6, 2017. CODEN TC- Computer Science, 670(??):56–67, SCDI. ISSN 0304-3975 (print), March 29, 2017. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517303122. //www.sciencedirect.com/science/ Patitz:2017:TSI article/pii/S0304397517300713. Meszaros-Karkus:2017:HRS [1217] Matthew J. Patitz. TCS Special Is- sue on Computational Self-Assembly. [1213] Zsuzsa Mészáros-Karkus. Hardness Theoretical Computer Science, 671 results for stable exchange problems. (??):2–3, April 6, 2017. CODEN Theoretical Computer Science, 670(??): TCSCDI. ISSN 0304-3975 (print), 68–78, March 29, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517302232. //www.sciencedirect.com/science/ Demaine:2017:NGA article/pii/S0304397517300993. Lan:2017:FPR [1218] Erik D. Demaine, Sándor P. Fekete, Christian Scheffer, and Arne Schmidt. [1214] Yan Lan, Xin Han, Yinling Wang, New geometric algorithms for fully Min Ge, He Guo, and Xin Chen. connected staged self-assembly. The- Flowshop problem F 2 → D|v = oretical Computer Science, 671(??): 1,c ≥ 1|Cmax revisited. Theo- 4–18, April 6, 2017. CODEN TC- retical Computer Science, 670(??): SCDI. ISSN 0304-3975 (print), 79–85, March 29, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751630679X. REFERENCES 201

Ipparthi:2017:DCA Ellis-Monaghan:2017:DTR

[1219] Dhananjay Ipparthi, Massimo Mas- [1223] Joanna A. Ellis-Monaghan, Greta trangeli, and Andrew Winslow. Dipole Pangborn, Nadrian C. Seeman, Sam codes attractively encode glue func- Blakeley, Conor Disher, Mary Falcigno, tions. Theoretical Computer Science, Brianna Healy, Ada Morse, Bharti 671(??):19–25, April 6, 2017. CODEN Singh, and Melissa Westland. De- TCSCDI. ISSN 0304-3975 (print), sign tools for reporter strands and 1879-2294 (electronic). URL http: DNA origami scaffold strands. The- //www.sciencedirect.com/science/ oretical Computer Science, 671(??): article/pii/S0304397516002000. 69–78, April 6, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Ota:2017:RSD 1879-2294 (electronic). URL http: [1220] Makoto Ota and Shinnosuke Seki. Rule //www.sciencedirect.com/science/ set design problems for oritatami sys- article/pii/S0304397516305308. tems. Theoretical Computer Science, Anonymous:2017:EBr 671(??):26–35, April 6, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1224] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 672(??): //www.sciencedirect.com/science/ iii–ix, April 11, 2017. CODEN article/pii/S0304397516304868. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Michail:2017:CPN //www.sciencedirect.com/science/ [1221] Othon Michail and Paul G. Spirakis. article/pii/S0304397517302141. Connectivity preserving network trans- Meseguer:2017:SCC formers. Theoretical Computer Science, 671(??):36–55, April 6, 2017. CODEN [1225] José Meseguer. Strict coherence of TCSCDI. ISSN 0304-3975 (print), conditional rewriting modulo axioms. 1879-2294 (electronic). URL http: Theoretical Computer Science, 672 //www.sciencedirect.com/science/ (??):1–35, April 11, 2017. CODEN article/pii/S0304397516002024. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Derakhshandeh:2017:UCP //www.sciencedirect.com/science/ [1222] Zahra Derakhshandeh, Robert Gmyr, article/pii/S030439751630754X. Andréa W. Richa, Christian Schei- Bonelli:2017:ANB deler, and Thim Strothmann. Uni- versal coating for programmable mat- [1226] Eduardo Bonelli, Delia Kesner, Car- ter. Theoretical Computer Science, 671 los Lombardi, and Alejandro R´ıos. On (??):56–68, April 6, 2017. CODEN abstract normalisation beyond needed- TCSCDI. ISSN 0304-3975 (print), ness. Theoretical Computer Science, 1879-2294 (electronic). URL http: 672(??):36–63, April 11, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516002012. 1879-2294 (electronic). URL http: REFERENCES 202

//www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517301019. //www.sciencedirect.com/science/ article/pii/S0304397517301068. Ayala-Rincon:2017:IDP Pan:2017:NSP [1227] Mauricio Ayala-Rinc´on, Maribel Fern´andez, and Daniele Nantes-Sobrinho. In- [1231] Linqiang Pan, Zhiqiang Zhang, Tingfang truder deduction problem for lo- Wu, and Jinbang Xu. Numerical cally stable theories with normal P systems with production thresh- forms and inverses. Theoretical olds. Theoretical Computer Science, Computer Science, 672(??):64–100, 673(??):30–41, April 18, 2017. CODEN April 11, 2017. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517301597. article/pii/S0304397517301214. Leporati:2017:TSA Anonymous:2017:EBs [1232] Alberto Leporati, Luca Manzoni, Gi- [1228] Anonymous. Editorial Board. The- ancarlo Mauri, Antonio E. Porreca, oretical Computer Science, 673(??): and Claudio Zandron. A toolbox for iii–ix, April 18, 2017. CODEN simpler active membrane algorithms. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 673 1879-2294 (electronic). URL http: (??):42–57, April 18, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517302402. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Barmpalias:2017:RNP article/pii/S0304397517302098. [1229] George Barmpalias, Douglas Cenzer, Anonymous:2017:EBt and Christopher P. Porter. Random numbers as probabilities of machine be- [1233] Anonymous. Editorial Board. The- havior. Theoretical Computer Science, oretical Computer Science, 674(??): 673(??):1–18, April 18, 2017. CODEN iii–ix, April 25, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517301032. article/pii/S0304397517302682. Furusawa:2017:UCR Brough:2017:ASN [1230] Hitoshi Furusawa. Uniform con- [1234] Tara Brough and Alan J. Cain. tinuity of relations and nondeter- Automaton semigroups: New con- ministic cellular automata. The- structions results and examples of oretical Computer Science, 673(??): non-automaton semigroups. The- 19–29, April 18, 2017. CODEN oretical Computer Science, 674(??): TCSCDI. ISSN 0304-3975 (print), 1–15, April 25, 2017. CODEN REFERENCES 203

TCSCDI. ISSN 0304-3975 (print), model. Theoretical Computer Science, 1879-2294 (electronic). URL http: 674(??):53–59, April 25, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517301056. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Ding:2017:ISS article/pii/S0304397517301287. [1235] Wei Ding and Ke Qiu. Incremental single-source shortest paths in digraphs Ahadi:2017:ACW with arbitrary positive arc weights. Theoretical Computer Science, 674 [1239] Arash Ahadi, Ali Dehghan, and (??):16–31, April 25, 2017. CODEN Mohsen Mollahajiaghaei. Algorithmic TCSCDI. ISSN 0304-3975 (print), complexity of weakly semiregular par- 1879-2294 (electronic). URL http: titioning and the representation num- //www.sciencedirect.com/science/ ber. Theoretical Computer Science, 674 article/pii/S0304397517301093. (??):60–72, April 25, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Kortsarz:2017:ASL 1879-2294 (electronic). URL http: [1236] Guy Kortsarz and Zeev Nutov. Ap- //www.sciencedirect.com/science/ proximating source location and star article/pii/S0304397517301305. survivable network problems. The- oretical Computer Science, 674(??): Kalimullin:2017:ASC 32–42, April 25, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1240] Iskander Kalimullin, Alexander Mel- 1879-2294 (electronic). URL http: nikov, and Keng Meng Ng. Alge- //www.sciencedirect.com/science/ braic structures computable without article/pii/S0304397517301251. delay. Theoretical Computer Science, 674(??):73–98, April 25, 2017. CODEN Xu:2017:CDC TCSCDI. ISSN 0304-3975 (print), [1237] Min Xu, Krishnaiyan Thulasiraman, 1879-2294 (electronic). URL http: and Qiang Zhu. Conditional diagnos- //www.sciencedirect.com/science/ ability of a class of matching compo- article/pii/S0304397517301317. sition networks under the comparison model. Theoretical Computer Science, Fraser:2017:WSD 674(??):43–52, April 25, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1241] Robert Fraser and Alejandro L´opez- 1879-2294 (electronic). URL http: Ortiz. The within-strip discrete //www.sciencedirect.com/science/ unit disk cover problem. Theo- article/pii/S0304397517301275. retical Computer Science, 674(??): Li:2017:GNC 99–115, April 25, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1238] Desai Li and Mei Lu. The g-good- 1879-2294 (electronic). URL http: neighbor conditional diagnosability of //www.sciencedirect.com/science/ star graphs under the PMC and MM* article/pii/S0304397517301329. REFERENCES 204

Shitov:2017:TNC //www.sciencedirect.com/science/ article/pii/S0304397517301378. [1242] Yaroslav Shitov. A tractable NP- completeness proof for the two- Kobayashi:2017:CBM coloring without monochromatic cycles of fixed length. Theoreti- [1246] Koji M. Kobayashi, Shuichi Miyazaki, cal Computer Science, 674(??):116– and Yasuo Okabe. Competitive 118, April 25, 2017. CODEN TC- buffer management for multi-queue SCDI. ISSN 0304-3975 (print), switches in QoS networks using 1879-2294 (electronic). URL http: packet buffering algorithms. The- //www.sciencedirect.com/science/ oretical Computer Science, 675(??): article/pii/S030439751730107X. 27–42, May 2, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Anonymous:2017:EBu 1879-2294 (electronic). URL http: [1243] Anonymous. Editorial Board. The- //www.sciencedirect.com/science/ oretical Computer Science, 675(??): article/pii/S030439751730138X. iii–ix, May 2, 2017. CODEN TC- SCDI. ISSN 0304-3975 (print), Baffier:2017:HNH 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1247] Jean-Fran¸cois Baffier, Man-Kwun article/pii/S0304397517303018. Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Kadelka:2017:MNC Marcel Roeloffzen, and Yushi Uno. Hanabi is NP-hard, even for cheaters [1244] Claus Kadelka, Yuan Li, Jack Kuipers, who look at their cards. Theoret- John O. Adeyeye, and Reinhard ical Computer Science, 675(??):43– Laubenbacher. Multistate nested 55, May 2, 2017. CODEN TC- canalizing functions and their net- SCDI. ISSN 0304-3975 (print), works. Theoretical Computer Science, 1879-2294 (electronic). URL http: 675(??):1–14, May 2, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517301573. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Reimers:2017:MES article/pii/S0304397517301330. Yo on:2017:RRL [1248] Arne C. Reimers, Alexandra-M. Reimers, and Yaron Goldstein. Min- [1245] Sang Duk Yoon, Hee-Kap Ahn, and imal equivalent subgraphs contain- Jessica Sherette. Realistic roofs ing a given set of arcs. Theoret- without local minimum edges over ical Computer Science, 675(??):56– a rectilinear polygon. Theoreti- 63, May 2, 2017. CODEN TC- cal Computer Science, 675(??):15– SCDI. ISSN 0304-3975 (print), 26, May 2, 2017. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517301585. REFERENCES 205

Li:2017:MMS Anonymous:2017:EBv

[1249] Huan Li and Zhongzhi Zhang. Max- [1253] Anonymous. Editorial Board. The- imum matchings in scale-free net- oretical Computer Science, 676(??): works with identical degree distribu- iii–ix, May 9, 2017. CODEN TC- tion. Theoretical Computer Science, SCDI. ISSN 0304-3975 (print), 675(??):64–81, May 2, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517303213. //www.sciencedirect.com/science/ Abello:2017:MRC article/pii/S0304397517301603. [1254] James Abello, Pavel Klav´ık, Jan Kra- Lin:2017:LAP tochv´ıl, and Tomás Vyskocil. MSOL restricted contractibility to planar [1250] Yuqing Lin and Fuji Zhang. A lin- graphs. Theoretical Computer Science, ear algorithm for a perfect match- 676(??):1–14, May 9, 2017. CODEN ing in polyomino graphs. Theoret- TCSCDI. ISSN 0304-3975 (print), ical Computer Science, 675(??):82– 1879-2294 (electronic). URL 88, May 2, 2017. CODEN TC- http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ article/pii/S0304397517301652. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Dey:2017:FBV article/pii/S0304397517301615. [1255] Palash Dey, Neeldhara Misra, and Barmpalias:2017:KC Y. Narahari. Frugal bribery in voting. Theoretical Computer Science, [1251] George Barmpalias and Rodney G. 676(??):15–32, May 9, 2017. CODEN Downey. Kobayashi compressibility. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 675 1879-2294 (electronic). URL http: (??):89–100, May 2, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517301664. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Chapelle:2017:EEA article/pii/S0304397517301640. [1256] Mathieu Chapelle, Manfred Cochefert, Mamino:2017:SRS Dieter Kratsch, Romain Letourneur, and Mathieu Liedloff. Exact ex- [1252] Marcello Mamino. Strategy recov- ponential algorithms to find tropi- ery for stochastic mean payoff games. cal connected sets of minimum size. Theoretical Computer Science, 675 Theoretical Computer Science, 676 (??):101–104, May 2, 2017. CODEN (??):33–41, May 9, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517301391. article/pii/S0304397517301883. REFERENCES 206

Chlebikova:2017:FPF Anonymous:2017:EBw

[1257] Janka Chleb´ıková and Morgan Chopin. [1261] Anonymous. Editorial Board. The- The firefighter problem: Further oretical Computer Science, 677(??): steps in understanding its complex- iii–ix, May 16, 2017. CODEN ity. Theoretical Computer Science, 676 TCSCDI. ISSN 0304-3975 (print), (??):42–51, May 9, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517303365. //www.sciencedirect.com/science/ Li:2017:PDP article/pii/S0304397517301895. [1262] Jing Li, Guoren Wang, and Lichao Huang:2017:SPS Chen. Paired 2-disjoint path covers of multi-dimensional torus net- [1258] Zhenyu Huang and Dongdai Lin. Solv- works with 2n − 3 faulty edges. ing polynomial systems with noise Theoretical Computer Science, 677 over F : Revisited. Theoreti- 2 (??):1–11, May 16, 2017. CODEN cal Computer Science, 676(??):52– TCSCDI. ISSN 0304-3975 (print), 68, May 9, 2017. CODEN TC- 1879-2294 (electronic). URL SCDI. ISSN 0304-3975 (print), http: //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517302025. //www.sciencedirect.com/science/ article/pii/S0304397517301998. Shan:2017:DNM

Ham:2017:GTR [1263] Liren Shan, Huan Li, and Zhongzhi Zhang. Domination number and min- [1259] Lucy Ham. Gap theorems for robust imum dominating sets in pseudofrac- satisﬁability: Boolean CSPs and be- tal scale-free web and Sierpi´nski graph. yond. Theoretical Computer Science, Theoretical Computer Science, 677 676(??):69–91, May 9, 2017. CODEN (??):12–30, May 16, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517302001. article/pii/S0304397517302037. Badano:2017:CCF He:2017:SPC

[1260] M. Badano and D. Vaggione. Char- [1264] Weihua He, Ziwen Liu, and Chao acterization of context-free languages. Yang. Snowman is PSPACE-complete. Theoretical Computer Science, 676 Theoretical Computer Science, 677 (??):92–96, May 9, 2017. CODEN (??):31–40, May 16, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517301871. article/pii/S0304397517302050. REFERENCES 207

Taubenfeld:2017:CSD Antoniadis:2017:CSS

[1265] Gadi Taubenfeld. Contention-sensitive [1269] Antonios Antoniadis, Peter Kling, Se- data structures and algorithms. The- bastian Ott, and Sören Riechers. Con- oretical Computer Science, 677(??): tinuous speed scaling with variabil- 41–55, May 16, 2017. CODEN ity: a simple and direct approach. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 678 1879-2294 (electronic). URL http: (??):1–13, May 23, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751730230X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Mathieson:2017:GEP article/pii/S0304397517302347. Hemaspaandra:2017:CCC [1266] Luke Mathieson. Graph editing problems with extended regularity con- [1270] Edith Hemaspaandra, Lane A. Hemas- straints. Theoretical Computer Science, paandra, and Jörg Rothe. The 677(??):56–68, May 16, 2017. CODEN complexity of controlling candidate- TCSCDI. ISSN 0304-3975 (print), sequential elections. Theoretical 1879-2294 (electronic). URL http: Computer Science, 678(??):14–21, //www.sciencedirect.com/science/ May 23, 2017. CODEN TC- article/pii/S0304397517302323. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Ito:2017:ESC //www.sciencedirect.com/science/ article/pii/S0304397517302608. [1267] Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobaya- Louza:2017:IES shi, and Yoshio Okamoto. Efficient [1271] Felipe A. Louza, Simon Gog, and stabilization of cooperative matching Guilherme P. Telles. Inducing en- games. Theoretical Computer Science, hanced suffix arrays for string collec- 677(??):69–82, May 16, 2017. CODEN tions. Theoretical Computer Science, TCSCDI. ISSN 0304-3975 (print), 678(??):22–39, May 23, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517302335. //www.sciencedirect.com/science/ Anonymous:2017:EBx article/pii/S0304397517302621. Markakis:2017:IBC [1268] Anonymous. Editorial Board. The- oretical Computer Science, 678(??): [1272] Evangelos Markakis and Orestis iii–ix, May 23, 2017. CODEN Telelis. Item bidding for combi- TCSCDI. ISSN 0304-3975 (print), natorial public projects. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 678(??):40– //www.sciencedirect.com/science/ 55, May 23, 2017. CODEN TC- article/pii/S030439751730347X. SCDI. ISSN 0304-3975 (print), REFERENCES 208

1879-2294 (electronic). URL http: Maletti:2017:SFS //www.sciencedirect.com/science/ article/pii/S0304397517302724. [1277] Andreas Maletti. Survey: Finite-state technology in natural language pro- Pilsniak:2017:EMD cessing. Theoretical Computer Science, 679(??):2–17, May 30, 2017. CODEN [1273] Monika Pil´sniak. Edge motion and TCSCDI. ISSN 0304-3975 (print), the distinguishing index. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 678(??):56– //www.sciencedirect.com/science/ 62, May 23, 2017. CODEN TC- article/pii/S0304397516301669. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Gruber:2017:MDN //www.sciencedirect.com/science/ article/pii/S0304397517302736. [1278] Hermann Gruber, Markus Holzer, and Sebastian Jakobi. More on de- Liu:2017:GRE terministic and nondeterministic ﬁ- nite cover automata. Theoreti- [1274] Jing Liu, Minmin Liu, Changji Wang, cal Computer Science, 679(??):18– and Shaowen Yao. Group rekeying 30, May 30, 2017. CODEN TC- in the exclusive subset-cover frame- SCDI. ISSN 0304-3975 (print), work. Theoretical Computer Science, 1879-2294 (electronic). URL http: 678(??):63–77, May 23, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516305205. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Fernau:2017:CCR article/pii/S0304397517302852. [1279] Henning Fernau, Meenakshi Parama- Anonymous:2017:EBy sivan, Markus L. Schmid, and Vo- jtech Vorel. Characterization and com- [1275] Anonymous. Editorial Board. The- plexity results on jumping ﬁnite au- oretical Computer Science, 679(??): tomata. Theoretical Computer Science, iii–ix, May 30, 2017. CODEN 679(??):31–52, May 30, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517303584. article/pii/S0304397516303206. Drewes:2017:P Mohri:2017:DAW

[1276] Frank Drewes. Preface. Theo- [1280] Mehryar Mohri and Michael D. Ri- retical Computer Science, 679(??): ley. A disambiguation algorithm 1, May 30, 2017. CODEN TC- for weighted automata. Theoret- SCDI. ISSN 0304-3975 (print), ical Computer Science, 679(??):53– 1879-2294 (electronic). URL http: 68, May 30, 2017. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397517303845. 1879-2294 (electronic). URL http: REFERENCES 209

//www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516304376. //www.sciencedirect.com/science/ article/pii/S0304397516301451. Berglund:2017:SRE Prusa:2017:UEP [1281] Martin Berglund and Brink van der Merwe. On the semantics of reg- [1285] Daniel Prusa and Klaus Reinhardt. ular expression parsing in the wild. Undecidability of the emptiness prob- Theoretical Computer Science, 679 lem for context-free picture languages. (??):69–82, May 30, 2017. CODEN Theoretical Computer Science, 679(??): TCSCDI. ISSN 0304-3975 (print), 118–125, May 30, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516304790. //www.sciencedirect.com/science/ article/pii/S0304397516300147. Kutrib:2017:CFL Adiga:2017:ILT [1282] Martin Kutrib and Matthias Wend- landt. Concatenation-free languages. [1286] Abhijin Adiga, Chris J. Kuhlman, Theoretical Computer Science, 679 Madhav V. Marathe, S. S. Ravi, (??):83–94, May 30, 2017. CODEN Daniel J. Rosenkrantz, and Richard E. TCSCDI. ISSN 0304-3975 (print), Stearns. Inferring local transition func- 1879-2294 (electronic). URL http: tions of discrete dynamical systems //www.sciencedirect.com/science/ from observations of system behav- article/pii/S0304397516304224. ior. Theoretical Computer Science, 679 (??):126–144, May 30, 2017. CODEN Caron:2017:HGO TCSCDI. ISSN 0304-3975 (print), [1283] Pascal Caron, Ludovic Mignot, and 1879-2294 (electronic). URL http: Clément Miklarz. On the hi- //www.sciencedirect.com/science/ erarchy of generalizations of one- article/pii/S030439751630322X. unambiguous regular languages. The- Hoffmann:2017:SIT oretical Computer Science, 679(??): 95–106, May 30, 2017. CODEN [1287] Stefan Hoffmann, Sibylle Schwarz, and TCSCDI. ISSN 0304-3975 (print), Ludwig Staiger. Shift-invariant topolo- 1879-2294 (electronic). URL http: gies for the Cantor space X ω. The- //www.sciencedirect.com/science/ oretical Computer Science, 679(??): article/pii/S0304397516303188. 145–161, May 30, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Ng:2017:SCP 1879-2294 (electronic). URL http: [1284] Timothy Ng, David Rappaport, //www.sciencedirect.com/science/ and Kai Salomaa. State complex- article/pii/S0304397516305175. ity of prefix distance. Theoreti- Anonymous:2017:EBz cal Computer Science, 679(??):107– 117, May 30, 2017. CODEN TC- [1288] Anonymous. Editorial Board. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 680(??): REFERENCES 210

iii–ix, June 5, 2017. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517303808. article/pii/S0304397517303705. Verschelde:2017:TSP Fijalkow:2017:PTP [1293] Jan Verschelde, Stephen M. Watt, [1289] Nathanaël Fijalkow. Profinite tech- and Lihong Zhi. TCS SNC pref- niques for probabilistic automata and ace. Theoretical Computer Science, the Markov Monoid algorithm. The- 681(??):1–2, June 12, 2017. CODEN oretical Computer Science, 680(??): TCSCDI. ISSN 0304-3975 (print), 1–14, June 5, 2017. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517302451. //www.sciencedirect.com/science/ Barkatou:2017:CIA article/pii/S030439751730316X. Higgins:2017:LMD [1294] Moulay Barkatou, Paola Boito, and Esteban Segura Ugalde. A con- [1290] Peter M. Higgins and Suhear Al- tour integral approach to the com- wan. Languages with membership putation of invariant pairs. The- determined by single letter factors. oretical Computer Science, 681(??): Theoretical Computer Science, 680 3–26, June 12, 2017. CODEN (??):15–24, June 5, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517302463. article/pii/S0304397517303158. Batenkov:2017:ASN Kehagias:2017:SCP [1295] Dmitry Batenkov. Accurate solution [1291] Ath. Kehagias and G. Konstantini- of near-colliding Prony systems via dis. Selfish cops and passive rob- decimation and homotopy continua- ber: Qualitative games. Theoret- tion. Theoretical Computer Science, ical Computer Science, 680(??):25– 681(??):27–40, June 12, 2017. CODEN 35, June 5, 2017. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517302487. article/pii/S0304397517303146. Elkadi:2017:MPB Anonymous:2017:EBba [1296] Mohamed Elkadi and André Galligo. [1292] Anonymous. Editorial Board. The- On mixed polynomials of bidegree oretical Computer Science, 681(??): (n, 1). Theoretical Computer Science, iii–ix, June 12, 2017. CODEN 681(??):41–53, June 12, 2017. CODEN REFERENCES 211

TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 681(??): 1879-2294 (electronic). URL http: 117–137, June 12, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517302499. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Helmer:2017:DAC article/pii/S0304397517302530. [1297] Martin Helmer. A direct algorithm to compute the topological Euler Pan:2017:AAC characteristic and Chern–Schwartz– MacPherson class of projective com- [1301] Victor Y. Pan and Elias Tsigari- plete intersection varieties. The- das. Accelerated approximation of oretical Computer Science, 681(??): the complex roots and factors of 54–74, June 12, 2017. CODEN a univariate polynomial. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 681(??):138– 1879-2294 (electronic). URL http: 145, June 12, 2017. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397517302517. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Li:2017:WNT article/pii/S0304397517302529. [1298] Yi Li. Witness to non-termination Schleicher:2017:NMP of linear programs. Theoretical Computer Science, 681(??):75–100, [1302] Dierk Schleicher and Robin Stoll. June 12, 2017. CODEN TC- Newton’s method in practice: Find- SCDI. ISSN 0304-3975 (print), ing all roots of polynomials of de- 1879-2294 (electronic). URL http: gree one million eﬃciently. The- //www.sciencedirect.com/science/ oretical Computer Science, 681(??): article/pii/S0304397517302591. 146–166, June 12, 2017. CODEN Pan:2017:RPR TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1299] Victor Y. Pan and Liang Zhao. Real //www.sciencedirect.com/science/ polynomial root-ﬁnding by means of article/pii/S0304397517302475. matrix and polynomial iterations. The- oretical Computer Science, 681(??): Sekigawa:2017:NPM 101–116, June 12, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1303] Hiroshi Sekigawa. The nearest poly- 1879-2294 (electronic). URL http: nomial to multiple given polynomials //www.sciencedirect.com/science/ with a given zero in the real case. article/pii/S0304397517302554. Theoretical Computer Science, 681(??): Pan:2017:NOC 167–175, June 12, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1300] Victor Y. Pan and Elias P. Tsi- 1879-2294 (electronic). URL http: garidas. Nearly optimal computa- //www.sciencedirect.com/science/ tions with structured matrices. The- article/pii/S0304397517302566. REFERENCES 212

Usevich:2017:VPM Kari:2017:Eb

[1304] Konstantin Usevich and Ivan Markovsky. [1308] Lila Kari. Editorial. Theoret- Variable projection methods for ap- ical Computer Science, 682(??):1, proximate (greatest) common di- June 19, 2017. CODEN TC- visor computations. Theoretical SCDI. ISSN 0304-3975 (print), Computer Science, 681(??):176–198, 1879-2294 (electronic). URL http: June 12, 2017. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397517304139. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Manea:2017:TSIa article/pii/S0304397517302505. [1309] Florin Manea, Bianca Truthe, and Wang:2017:MCC Gy¨orgy Vaszil. TCS Special Is- sue on Languages and Combinatorics [1305] Wei guo Wang and Yimin Wei. Mixed in Theory and Nature. Theoret- and componentwise condition num- ical Computer Science, 682(??):2– bers for matrix decompositions. The- 4, June 19, 2017. CODEN TC- oretical Computer Science, 681(??): SCDI. ISSN 0304-3975 (print), 199–216, June 12, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517304127. //www.sciencedirect.com/science/ article/pii/S0304397517302578. Alhazov:2017:CAG

Wu:2017:CRW [1310] Artiom Alhazov, Henning Fernau, [1306] Wenyuan Wu, Greg Reid, and Rudolf Freund, Sergiu Ivanov, Rani Yong Feng. Computing real wit- Siromoney, and K. G. Subramanian. ness points of positive dimensional Contextual array grammars with ma- polynomial systems. Theoretical trix control, regular control languages, Computer Science, 681(??):217–231, and tissue P systems control. The- June 12, 2017. CODEN TC- oretical Computer Science, 682(??): SCDI. ISSN 0304-3975 (print), 5–21, June 19, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751730258X. //www.sciencedirect.com/science/ article/pii/S0304397517302062. Anonymous:2017:EBbb Arroyo:2017:TBN [1307] Anonymous. Editorial Board. The- oretical Computer Science, 682(??): [1311] Fernando Arroyo, Sandra Gómez- iii–ix, June 19, 2017. CODEN Canaval, Victor Mitrana, and José Ramón TCSCDI. ISSN 0304-3975 (print), Sánchez-Couso. Transducers based on 1879-2294 (electronic). URL http: networks of polarized evolutionary pro- //www.sciencedirect.com/science/ cessors. Theoretical Computer Science, article/pii/S0304397517303894. 682(??):22–29, June 19, 2017. CODEN REFERENCES 213

Bjorklund:2017:FBV Cho:2017:SCP [1312] Johanna Björklund, Frank Drewes, and Anna Jonsson. Finding the N best [1316] Da-Jung Cho, Daniel Goc, Yo- vertices in an infinite weighted hyper- Sub Han, Sang-Ki Ko, Alexandros graph. Theoretical Computer Science, Palioudakis, and Kai Salomaa. State 682(??):30–41, June 19, 2017. CODEN complexity of permutation on finite TCSCDI. ISSN 0304-3975 (print), languages over a binary alphabet. 1879-2294 (electronic). URL http: Theoretical Computer Science, 682 //www.sciencedirect.com/science/ (??):67–78, June 19, 2017. CODEN article/pii/S0304397517302049. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Bordihn:2017:ASG //www.sciencedirect.com/science/ article/pii/S0304397517302013. [1313] Henning Bordihn. Active symbols in grammars with valuations. The- Ehrenfeucht:2017:ERS oretical Computer Science, 682(??): 42–48, June 19, 2017. CODEN [1317] Andrzej Ehrenfeucht, Jetty Kleijn, Ma- TCSCDI. ISSN 0304-3975 (print), ciej Koutny, and Grzegorz Rozen- 1879-2294 (electronic). URL http: berg. Evolving reaction systems. The- //www.sciencedirect.com/science/ oretical Computer Science, 682(??): article/pii/S030439751630603X. 79–99, June 19, 2017. CODEN Bottoni:2017:PSS TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1314] Paolo Bottoni, Anna Labella, and Vic- //www.sciencedirect.com/science/ tor Mitrana. Prefix-suffix square re- article/pii/S030439751730035X. duction. Theoretical Computer Science, 682(??):49–56, June 19, 2017. CODEN Fernau:2017:CCG TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1318] Henning Fernau, Lakshmanan Kup- //www.sciencedirect.com/science/ pusamy, and Indhumathi Raman. article/pii/S0304397516307113. On the computational completeness Chen:2017:TLG of graph-controlled insertion-deletion systems with binary sizes. The- [1315] Haiming Chen, Mihai Ionescu, An- oretical Computer Science, 682(??): drei Paun, and Gheorghe Paun. On 100–121, June 19, 2017. CODEN trace languages generated by (small) TCSCDI. ISSN 0304-3975 (print), spiking neural P systems. Theo- 1879-2294 (electronic). URL http: retical Computer Science, 682(??): //www.sciencedirect.com/science/ 57–66, June 19, 2017. CODEN article/pii/S0304397517300683. REFERENCES 214

Holzer:2017:CL Mercas:2017:AAB

[1319] Markus Holzer, Sebastian Jakobi, and [1323] Robert Mercas. On the aperi- Martin Kutrib. The chop of languages. odic avoidability of binary patterns Theoretical Computer Science, 682(??): with variables and reversals. The- 122–137, June 19, 2017. CODEN oretical Computer Science, 682(??): TCSCDI. ISSN 0304-3975 (print), 180–189, June 19, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517301044. //www.sciencedirect.com/science/ article/pii/S0304397516307502. Jurgensen:2017:HLC Otto:2017:RVL [1320] Helmut J¨urgensen. Higher-level constructs for families and multisets. The- [1324] Friedrich Otto and Frantisek Mr´az. oretical Computer Science, 682(??): Regulated variants of limited con- 138–148, June 19, 2017. CODEN text restarting automata. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 682(??): 1879-2294 (electronic). URL http: 190–207, June 19, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517301366. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Kutrib:2017:OWR article/pii/S0304397516307162.

[1321] Martin Kutrib and Andreas Malcher. Salomaa:2017:MRS One-way reversible multi-head ﬁnite automata. Theoretical Computer [1325] Arto Salomaa. Minimal reaction sys- Science, 682(??):149–164, June 19, tems: Duration and blips. The- 2017. CODEN TCSCDI. ISSN 0304- oretical Computer Science, 682(??): 3975 (print), 1879-2294 (electronic). 208–216, June 19, 2017. CODEN URL http://www.sciencedirect. TCSCDI. ISSN 0304-3975 (print), com/science/article/pii/S03043975163060161879-2294. (electronic). URL http: //www.sciencedirect.com/science/ Masopust:2017:BCF article/pii/S0304397517301342.

[1322] Tom´as Masopust and Micha¨el Thomazo. Anonymous:2017:EBbc On Boolean combinations forming piecewise testable languages. The- [1326] Anonymous. Editorial Board. The- oretical Computer Science, 682(??): oretical Computer Science, 683(??): 165–179, June 19, 2017. CODEN iii–ix, June 30, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751730066X. article/pii/S0304397517304012. REFERENCES 215

Herlihy:2017:WFA //www.sciencedirect.com/science/ article/pii/S0304397517304279. [1327] Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, and Julien Stainer. Manea:2017:TSIb From wait-free to arbitrary con- [1331] Florin Manea and Dirk Nowotka. current solo executions in color- TCS Special Issue: Combinatorics less distributed computing. The- on Words — WORDS 2015. The- oretical Computer Science, 683(??): oretical Computer Science, 684(??): 1–21, June 30, 2017. CODEN 1–2, July 7, 2017. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517303298. article/pii/S0304397517304693. Cormode:2017:SLC Berthe:2017:SS [1328] Graham Cormode and Hossein Jowhari. [1332] Valérie Berthé, Clelia De Felice, A second look at counting triangles Vincent Delecroix, Francesco Dolce, in graph streams (corrected). The- Julien Leroy, Dominique Perrin, oretical Computer Science, 683(??): Christophe Reutenauer, and Giusep- 22–30, June 30, 2017. CODEN pina Rindone. Specular sets. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 684(??): 1879-2294 (electronic). URL http: 3–28, July 7, 2017. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397516302560. 1879-2294 (electronic). URL http: Cormode:2017:CSL //www.sciencedirect.com/science/ article/pii/S030439751730186X. [1329] Graham Cormode and Hossein Jowhari. Fici:2017:ASR Corrigendum to “A second look at counting triangles in graph streams” [1333] Gabriele Fici, Filippo Mignosi, and [Theoret. Comput. Sci. 552 (2014) 44– Jeffrey Shallit. Abelian-square-rich 51]. Theoretical Computer Science, 683 words. Theoretical Computer Science, (??):31–32, June 30, 2017. CODEN 684(??):29–42, July 7, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516302924. article/pii/S0304397517301299. Anonymous:2017:EBbd Holub:2017:PFL [1330] Anonymous. Editorial Board. The- [1334] Stepán Holub. Prefix frequency of oretical Computer Science, 684(??): lost positions. Theoretical Com- iii–ix, July 7, 2017. CODEN TC- puter Science, 684(??):43–52, July 7, SCDI. ISSN 0304-3975 (print), 2017. CODEN TCSCDI. ISSN 0304- 1879-2294 (electronic). URL http: 3975 (print), 1879-2294 (electronic). REFERENCES 216

URL http://www.sciencedirect. Benevides:2017:BLE com/science/article/pii/S0304397517301020. [1339] Mario Benevides. Bisimilar and log- Holub:2017:FBW ically equivalent programs in PDL [1335] Step´an Holub and Mike M¨uller. with parallel operator. Theoreti- Fully bordered words. Theoreti- cal Computer Science, 685(??):23– cal Computer Science, 684(??):53– 45, July 15, 2017. CODEN TC- 58, July 7, 2017. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517302785. article/pii/S0304397516305989. Olarte:2017:CBF

Anonymous:2017:EBbe [1340] Carlos Olarte and Elaine Pimentel. [1336] Anonymous. Editorial Board. The- On concurrent behaviors and fo- oretical Computer Science, 685(??): cusing in linear logic. Theoreti- iii–ix, July 15, 2017. CODEN cal Computer Science, 685(??):46– TCSCDI. ISSN 0304-3975 (print), 64, July 15, 2017. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517304413. //www.sciencedirect.com/science/ article/pii/S0304397516304832. Ayala-Rincon:2017:LSF Copello:2017:FML [1337] Mauricio Ayala-Rinc´on, Ian Mackie, and Ugo Montanari. Logical and se- [1341] Ernesto Copello, Nora Szasz, and mantic frameworks with applications. Alvaro´ Tasistro. Formal metathe- Theoretical Computer Science, 685 ory of the Lambda calculus using (??):1–2, July 15, 2017. CODEN Stoughton’s substitution. Theoret- TCSCDI. ISSN 0304-3975 (print), ical Computer Science, 685(??):65– 1879-2294 (electronic). URL http: 82, July 15, 2017. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397517304711. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Alves:2017:GBF article/pii/S0304397516304820. [1338] Sandra Alves and Maribel Fern´andez. Veloso:2017:GCM A graph-based framework for the analysis of access control policies. [1342] Paulo A. S. Veloso, Sheila R. M. Veloso, Theoretical Computer Science, 685 and Mario R. F. Benevides. On a (??):3–22, July 15, 2017. CODEN graph calculus for modalities. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 685(??): 1879-2294 (electronic). URL http: 83–103, July 15, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516305965. 1879-2294 (electronic). URL http: REFERENCES 217

//www.sciencedirect.com/science/ Lin:2017:AFT article/pii/S0304397517301238. [1347] Shangwei Lin, Chanchan Zhou, and Anonymous:2017:EBbf Chunfang Li. Arc fault toler- [1343] Anonymous. Editorial Board. The- ance of Kautz digraphs. Theoret- oretical Computer Science, 686(??): ical Computer Science, 687(??):1– iii–ix, July 22, 2017. CODEN 10, July 29, 2017. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517304504. article/pii/S0304397517303420. Gaina:2017:FLP Bulatov:2017:FCE [1344] Daniel Gaina. Foundations of [1348] Andrei Bulatov, Leslie Ann Goldberg, logic programming in hybrid logics Mark Jerrum, David Richerby, and with user-defined sharing. Theo- Stanislav Zivný. Functional clones retical Computer Science, 686(??):1– and expressibility of partition func- 24, July 22, 2017. CODEN TC- tions. Theoretical Computer Science, SCDI. ISSN 0304-3975 (print), 687(??):11–39, July 29, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517303316. //www.sciencedirect.com/science/ article/pii/S0304397517303535. Cavalheiro:2017:TPG Hu:2017:MPD [1345] Simone André da Costa Cavalheiro, Luciana Foss, and Leila Ribeiro. The- [1349] Xiaomin Hu, Yingzhi Tian, Xiaodong orem proving graph grammars with at- Liang, and Jixiang Meng. Matching tributes and negative application con- preclusion for n-dimensional torus net- ditions. Theoretical Computer Science, works. Theoretical Computer Science, 686(??):25–77, July 22, 2017. CODEN 687(??):40–47, July 29, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517303419. article/pii/S030439751730364X. Anonymous:2017:EBbg Vesti:2017:RSF [1346] Anonymous. Editorial Board. The- [1350] Jetro Vesti. Rich square-free words. oretical Computer Science, 687(??): Theoretical Computer Science, 687 iii–ix, July 29, 2017. CODEN (??):48–61, July 29, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517304929. article/pii/S0304397517303651. REFERENCES 218

Gorzkowska:2017:PBD 93–94, July 29, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1351] Aleksandra Gorzkowska and Monika 1879-2294 (electronic). URL http: Pil´sniak. Precise bounds for the distin- //www.sciencedirect.com/science/ guishing index of the Cartesian prod- article/pii/S0304397517304218. See uct. Theoretical Computer Science, 687 [1090]. (??):62–69, July 29, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Anonymous:2017:EBbh 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1355] Anonymous. Editorial Board. The- article/pii/S0304397517303821. oretical Computer Science, 688(??): iii–ix, August 6, 2017. CODEN Arvind:2017:FFP TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1352] V. Arvind. Finding fixed point free el- //www.sciencedirect.com/science/ ements and small bases in permutation article/pii/S0304397517305017. groups. Theoretical Computer Science, 687(??):70–78, July 29, 2017. CODEN Kothapalli:2017:P TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1356] Kishore Kothapalli and Sergio Ra- //www.sciencedirect.com/science/ jsbaum. Preface. Theoretical article/pii/S0304397517303948. Computer Science, 688(??):1, Au- gust 6, 2017. CODEN TC- Zhu:2017:SEA SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1353] Daxin Zhu, Lei Wang, Tinran Wang, //www.sciencedirect.com/science/ and Xiaodong Wang. A space effi- article/pii/S0304397517305157. cient algorithm for the longest common subsequence in k-length sub- Abraham:2017:TPS strings. Theoretical Computer Science, 687(??):79–92, July 29, 2017. CODEN [1357] Uri Abraham and Gal Amram. Two- TCSCDI. ISSN 0304-3975 (print), process synchronization. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 688(??):2– //www.sciencedirect.com/science/ 23, August 6, 2017. CODEN TC- article/pii/S0304397517304206. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Dong:2017:CFP //www.sciencedirect.com/science/ article/pii/S0304397516300500. [1354] Jianming Dong, Jueliang Hu, Mikhail Y. Kovalyov, Guohui Lin, Taibo Luo, Natarajan:2017:EAA Weitian Tong, Xueshi Wang, and Yinfeng Xu. Corrigendum to “An [1358] Aravind Natarajan, Himanshu Chauhan, FPTAS for the parallel two-stage Neeraj Mittal, and Vijay K. Garg. flowshop problem” [Theoret. Com- Efficient abstraction algorithms for put. Sci. 657 (2017) 64–72]. The- predicate detection. Theoretical oretical Computer Science, 687(??): Computer Science, 688(??):24–48, REFERENCES 219

August 6, 2017. CODEN TC- ness in transactional memory. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 688(??): 1879-2294 (electronic). URL http: 103–116, August 6, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397515012074. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Altisen:2017:PSS article/pii/S0304397516302572. [1359] Karine Altisen and Stéphane Devismes. Zhong:2017:PMS On probabilistic snap-stabilization. Theoretical Computer Science, 688(??): [1363] Xueling Zhong and Jinwen Ou. Par- 49–76, August 6, 2017. CODEN allel machine scheduling with re- TCSCDI. ISSN 0304-3975 (print), stricted job rejection. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 690(??):1–11, //www.sciencedirect.com/science/ August 22, 2017. CODEN TC- article/pii/S0304397515007161. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Feinerman:2017:FRC //www.sciencedirect.com/science/ [1360] Ofer Feinerman, Amos Korman, Shay article/pii/S0304397517304772. Kutten, and Yoav Rodeh. Fast Hon:2017:PAE rendezvous on a cycle by agents with different speeds. Theoreti- [1364] Wing-Kai Hon, Sharma V. Thankachan, cal Computer Science, 688(??):77– and Bojian Xu. In-place algorithms 85, August 6, 2017. CODEN TC- for exact and approximate shortest SCDI. ISSN 0304-3975 (print), unique substring problems. The- 1879-2294 (electronic). URL http: oretical Computer Science, 690(??): //www.sciencedirect.com/science/ 12–25, August 22, 2017. CODEN article/pii/S0304397515012050. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL Hirve:2017:HHP http: //www.sciencedirect.com/science/ [1361] Sachin Hirve, Roberto Palmieri, and article/pii/S0304397517304760. Binoy Ravindran. HiperTM: High Keshavarz-Kohjerdi:2017:LTA performance, fault-tolerant transactional memory. Theoretical Com- [1365] Fatemeh Keshavarz-Kohjerdi and puter Science, 688(??):86–102, Au- Alireza Bagheri. A linear-time algo- gust 6, 2017. CODEN TC- rithm for finding Hamiltonian (s, t)- SCDI. ISSN 0304-3975 (print), paths in even-sized rectangular grid 1879-2294 (electronic). URL http: graphs with a rectangular hole. The- //www.sciencedirect.com/science/ oretical Computer Science, 690(??): article/pii/S0304397516301591. 26–58, August 22, 2017. CODEN Kuznetsov:2017:NIL TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1362] Petr Kuznetsov and Sathya Peri. //www.sciencedirect.com/science/ Non-interference and local correct- article/pii/S0304397517304759. REFERENCES 220

Gu:2017:ERB oretical Computer Science, 690(??): 104–113, August 22, 2017. CODEN [1366] Mei-Mei Gu, Rong-Xia Hao, Jun- TCSCDI. ISSN 0304-3975 (print), Ming Xu, and Yan-Quan Feng. Equal 1879-2294 (electronic). URL http: relation between the extra connec- //www.sciencedirect.com/science/ tivity and pessimistic diagnosabil- article/pii/S0304397517305200. ity for some regular graphs. The- oretical Computer Science, 690(??): Cohen:2017:ACD 59–72, August 22, 2017. CODEN [1370] Nathann Cohen, David Coudert, Guil- TCSCDI. ISSN 0304-3975 (print), laume Ducoffe, and Aurélien Lancin. 1879-2294 (electronic). URL http: Applying clique-decomposition for //www.sciencedirect.com/science/ computing Gromov hyperbolicity. The- . article/pii/S0304397517304802 oretical Computer Science, 690(??): Mazo:2017:NLL 114–139, August 22, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1367] Lo¨ıc Mazo and Etienne´ Baudrier. 1879-2294 (electronic). URL http: Non-local length estimators and con- //www.sciencedirect.com/science/ cave functions. Theoretical Com- article/pii/S030439751730508X. puter Science, 690(??):73–90, Au- Anonymous:2017:EBbi gust 22, 2017. CODEN TC- SCDI. ISSN 0304-3975 (print), [1371] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 690(??): //www.sciencedirect.com/science/ ifc, August 22, 2017. CODEN article/pii/S0304397517305121. TCSCDI. ISSN 0304-3975 (print), Gozupek:2017:PCM 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1368] Didem Gözüpek, Sibel Ozkan,¨ Christophe article/pii/S0304397517305881. Paul, Ignasi Sau, and Mordechai Zhang:2017:CCE Shalom. Parameterized complexity of the MINCCA problem on graphs [1372] Zhongxi Zhang and Qingguo Li. of bounded decomposability. The- On cartesian closed extensions of oretical Computer Science, 690(??): non-pointed domains. Theoreti- 91–103, August 22, 2017. CODEN cal Computer Science, 691(??):1–9, TCSCDI. ISSN 0304-3975 (print), August 29, 2017. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751730525X. //www.sciencedirect.com/science/ article/pii/S0304397517305558. Mishra:2017:AOP Bilokon:2017:DTA [1369] Sounaka Mishra, Shijin Rajakrishnan, and Saket Saurabh. On approxima- [1373] Paul Bilokon and Abbas Edalat. A bility of optimization problems re- domain-theoretic approach to Brow- lated to Red/Blue-split graphs. The- nian motion and general continu- REFERENCES 221

ous stochastic processes. Theoret- TCSCDI. ISSN 0304-3975 (print), ical Computer Science, 691(??):10– 1879-2294 (electronic). URL http: 26, August 29, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517306047. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Terrier:2017:RPS article/pii/S0304397517305546. [1378] Véronique Terrier. Recognition of Vasile:2017:TWT poly-slender context-free languages by trellis automata. Theoreti- [1374] Cristian-Ioan Vasile, Derya Aksaray, cal Computer Science, 692(??):1–24, and Calin Belta. Time window September 5, 2017. CODEN TC- temporal logic. Theoretical Com- SCDI. ISSN 0304-3975 (print), puter Science, 691(??):27–54, Au- 1879-2294 (electronic). URL http: gust 29, 2017. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397517304875. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Liskiewicz:2017:SLS article/pii/S0304397517305509. [1379] Maciej Li´skiewicz, Rüdiger Reischuk, Rabe:2017:MA and Ulrich Wölfel. Security levels in steganography — insecurity [1375] Florian Rabe. Morphism axioms. The- does not imply detectability. The- oretical Computer Science, 691(??): oretical Computer Science, 692(??): 55–80, August 29, 2017. CODEN 25–45, September 5, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517305443. article/pii/S0304397517305194. Xu:2017:CBF Munaro:2017:BCG [1376] Kevin H. Xu. A class of bounded functions, a database language and [1380] Andrea Munaro. Boundary classes an extended lambda calculus. The- for graph problems involving non- oretical Computer Science, 691(??): local properties. Theoretical Computer 81–106, August 29, 2017. CODEN Science, 692(??):46–71, September 5, TCSCDI. ISSN 0304-3975 (print), 2017. CODEN TCSCDI. ISSN 0304- 1879-2294 (electronic). URL http: 3975 (print), 1879-2294 (electronic). //www.sciencedirect.com/science/ URL http://www.sciencedirect. article/pii/S0304397517305406. com/science/article/pii/S0304397517305248. Anonymous:2017:EBbj Anta:2017:APS [1377] Anonymous. Editorial Board. The- [1381] Antonio Fernández Anta, Chrys- oretical Computer Science, 691(??): sis Georgiou, Dariusz R. Kowalski, ifc, August 29, 2017. CODEN and Elli Zavou. Adaptive packet REFERENCES 222

scheduling over a wireless channel un- Bujtor:2017:AMI der constrained jamming. Theoret- ical Computer Science, 692(??):72– [1385] Ferenc Bujtor and Walter Vogler. 89, September 5, 2017. CODEN ACTL for Modal Interface Automata. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 693(??): 1879-2294 (electronic). URL http: 13–34, September 12, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517305327. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Biagioni:2017:NYP article/pii/S0304397517305236. Nigam:2017:SFM [1382] Silvio Biagioni, Daniel Masny, and Daniele Venturi. Naor–Yung paradigm [1386] Vivek Nigam, Carlos Olarte, and with shared randomness and appli- Elaine Pimentel. On subexpo- cations. Theoretical Computer Sci- nentials, focusing and modalities ence, 692(??):90–113, September 5, in concurrent systems. Theoreti- 2017. CODEN TCSCDI. ISSN 0304- cal Computer Science, 693(??):35– 3975 (print), 1879-2294 (electronic). 58, September 12, 2017. CODEN URL http://www.sciencedirect. TCSCDI. ISSN 0304-3975 (print), com/science/article/pii/S03043975173053151879-2294. (electronic). URL http: //www.sciencedirect.com/science/ Anonymous:2017:EBbk article/pii/S0304397517305212. Anonymous:2017:EBbl [1383] Anonymous. Editorial Board. The- oretical Computer Science, 692(??): [1387] Anonymous. Editorial Board. The- ifc, September 5, 2017. CODEN oretical Computer Science, 693(??): TCSCDI. ISSN 0304-3975 (print), ifc, September 12, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751730614X. //www.sciencedirect.com/science/ article/pii/S0304397517306321. vanDitmarsch:2017:UAA Li:2017:CPM

[1384] Hans van Ditmarsch, Wiebe van der [1388] Weian Li, Wenjing Liu, Tiantian Hoek, and Louwe B. Kuijer. The Chen, Xiaoying Qu, Qizhi Fang, and undecidability of arbitrary arrow Ker-I Ko. Competitive proﬁt max- update logic. Theoretical Com- imization in social networks. The- puter Science, 693(??):1–12, Septem- oretical Computer Science, 694(??): ber 12, 2017. CODEN TC- 1–9, September 19, 2017. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751730556X. article/pii/S0304397517305388. REFERENCES 223

Anderson:2017:GEP 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1389] Jaclyn Anderson, Kristina C. Gar- article/pii/S0304397517305303. rett, and Brian Hopkins. Gar- den of Eden partitions in the sand Ma:2017:VDE pile and related models. Theoret- [1393] Meijie Ma, Douglas B. West, and Jun- ical Computer Science, 694(??):10– Ming Xu. The vulnerability of the di- 20, September 19, 2017. CODEN ameter of the enhanced hypercubes. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 694(??): 1879-2294 (electronic). URL http: 60–65, September 19, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517305364. 1879-2294 (electronic). URL http: Lukasiewicz:2017:NCC //www.sciencedirect.com/science/ article/pii/S0304397517305431. [1390] Thomas Lukasiewicz and Enrico Mal- izia. A novel characterization of Dragan:2017:MES P the complexity class Θk based on [1394] Feodor F. Dragan and Arne Leit- counting and comparison. Theoret- ert. On the minimum eccentric- ical Computer Science, 694(??):21– ity shortest path problem. Theo- 33, September 19, 2017. CODEN retical Computer Science, 694(??):66– TCSCDI. ISSN 0304-3975 (print), 78, September 19, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517305352. //www.sciencedirect.com/science/ Jayaram:2017:DSB article/pii/S030439751730542X. Anonymous:2017:EBbm [1391] B. Jayaram, S. Arumugam, and K. Thulasiraman. Dominator se- [1395] Anonymous. Editorial Board. The- quences in bipartite graphs. Theo- oretical Computer Science, 694(??): retical Computer Science, 694(??):34– ifc, September 19, 2017. CODEN 41, September 19, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517306412. article/pii/S0304397517305340. Halffmann:2017:GAM Epstein:2017:SSJ [1396] Pascal Halffmann, Stefan Ruzika, [1392] Leah Epstein and Elena Kleiman. Clemens Thielen, and David Willems. Scheduling selfish jobs on multidi- A general approximation method for mensional parallel machines. Theo- bicriteria minimization problems. The- retical Computer Science, 694(??):42– oretical Computer Science, 695(??):1– 59, September 19, 2017. CODEN 15, September 26, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), REFERENCES 224

1879-2294 (electronic). URL http: eral, bipartite and plane graphs. Theo- //www.sciencedirect.com/science/ retical Computer Science, 695(??):54– article/pii/S0304397517305418. 73, September 26, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Rusu:2017:GMP 1879-2294 (electronic). URL http: [1397] Irena Rusu. Graph matching prob- //www.sciencedirect.com/science/ lems and the NP-hardness of sorted- article/pii/S0304397517305741. ness constraints. Theoretical Com- Zhang:2017:FTP puter Science, 695(??):16–27, Septem- ber 26, 2017. CODEN TC- [1401] Shurong Zhang, Lin Chen, and Wei- SCDI. ISSN 0304-3975 (print), hua Yang. On fault-tolerant path op- 1879-2294 (electronic). URL http: timization under QoS constraint in //www.sciencedirect.com/science/ multi-channel wireless networks. Theo- article/pii/S0304397517305674. retical Computer Science, 695(??):74– 82, September 26, 2017. CODEN Durr:2017:MDA TCSCDI. ISSN 0304-3975 (print), [1398] Christoph Dürr,Lukasz Je˙z, and 1879-2294 (electronic). URL http: Oscar´ C. Vásquez. Mechanism de- //www.sciencedirect.com/science/ sign for aggregating energy con- article/pii/S0304397517305753. sumption and quality of service in Anonymous:2017:EBbn speed scaling scheduling. Theoret- ical Computer Science, 695(??):28– [1402] Anonymous. Editorial Board. The- 41, September 26, 2017. CODEN oretical Computer Science, 695(??): TCSCDI. ISSN 0304-3975 (print), ifc, September 26, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517305686. //www.sciencedirect.com/science/ article/pii/S0304397517306540. Bacher:2017:ERS Wei:2017:IFI [1399] Axel Bacher, Olivier Bodini, and Al- ice Jacquot. Efficient random sam- [1403] Jianxin Wei, Yujun Yang, and Guangfu pling of binary and unary-binary trees Wang. Infinite families of 2-isometric via holonomic equations. Theoret- and not 3-isometric binary words. The- ical Computer Science, 695(??):42– oretical Computer Science, 696(??): 53, September 26, 2017. CODEN 1–10, October 5, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517305479. article/pii/S0304397517305765. Glantz:2017:FCC Bodei:2017:SAB [1400] Roland Glantz and Henning Meyer- [1404] C. Bodei, L. Brodo, R. Gori, F. Levi, henke. On finding convex cuts in gen- A. Bernini, and D. Hermith. A REFERENCES 225

static analysis for Brane Calculi Elkin:2017:TE providing global occurrence counting information. Theoretical Com- [1408] Michael Elkin, Arnold Filtser, and Ofer puter Science, 696(??):11–51, Oc- Neiman. Terminal embeddings. The- tober 5, 2017. CODEN TC- oretical Computer Science, 697(??): SCDI. ISSN 0304-3975 (print), 1–36, October 12, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517305467. //www.sciencedirect.com/science/ article/pii/S0304397517305339. Cho:2017:PGO Fuerst:2017:DLR

[1405] Da-Jung Cho, Yo-Sub Han, Timothy [1409] Carlo Fuerst, Maciej Pacut, and Ste- Ng, and Kai Salomaa. Pseudoknot- fan Schmid. Data locality and replica generating operation. Theoreti- aware virtual cluster embeddings. The- cal Computer Science, 696(??):52– oretical Computer Science, 697(??): 64, October 5, 2017. CODEN 37–57, October 12, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751730539X. article/pii/S0304397517305376. Sakai:2017:IEA Ning:2017:CEC [1410] Takayuki Sakai, Kazuhisa Seto, Sug- [1406] Wantao Ning. The h-connectivity uru Tamaki, and Junichi Teruyama. of exchanged crossed cube. The- Improved exact algorithms for mildly oretical Computer Science, 696(??): sparse instances of Max SAT. The- 65–68, October 5, 2017. CODEN oretical Computer Science, 697(??): TCSCDI. ISSN 0304-3975 (print), 58–68, October 12, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517305716. See //www.sciencedirect.com/science/ erratum [1496]. article/pii/S0304397517305492. Abu-Khzam:2017:CVP Anonymous:2017:EBbo [1411] Faisal N. Abu-Khzam, Edouard´ Bon- [1407] Anonymous. Editorial Board. The- net, and Florian Sikora. On the oretical Computer Science, 696(??): complexity of various parameteri- ifc, October 5, 2017. CODEN zations of common induced sub- TCSCDI. ISSN 0304-3975 (print), graph isomorphism. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 697(??):69–78, Oc- //www.sciencedirect.com/science/ tober 12, 2017. CODEN TC- article/pii/S0304397517306680. SCDI. ISSN 0304-3975 (print), REFERENCES 226

1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517305480. article/pii/S0304397517306928. Wei:2017:GNC Rombo:2017:FAS [1412] Yulong Wei and Min Xu. On g- good-neighbor conditional diagnosabil- [1416] Simona E. Rombo and Filippo Utro. ity of (n, k)-star networks. The- Foreword: Algorithms, strings and oretical Computer Science, 697(??): theoretical approaches in the big 79–90, October 12, 2017. CODEN data era — special issue in honor TCSCDI. ISSN 0304-3975 (print), of the 60th birthday of Profes- 1879-2294 (electronic). URL http: sor Raﬀaele Giancarlo. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 698(??):1–3, article/pii/S0304397517305790. October 25, 2017. CODEN TC- SCDI. ISSN 0304-3975 (print), Ren:2017:GND 1879-2294 (electronic). URL http: [1413] Yunxia Ren and Shiying Wang. //www.sciencedirect.com/science/ The g-good-neighbor diagnosability article/pii/S0304397517307661. of locally twisted cubes. Theoret- ical Computer Science, 697(??):91– Amir:2017:SC 97, October 12, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1417] Amihood Amir, Alberto Apostolico, 1879-2294 (electronic). URL http: Travis Gagie, and Gad M. Lan- //www.sciencedirect.com/science/ dau. String cadences. Theoreti- article/pii/S0304397517305789. cal Computer Science, 698(??):4–8, October 25, 2017. CODEN TC- Navarra:2017:OKU SCDI. ISSN 0304-3975 (print), [1414] Alfredo Navarra and Cristina M. 1879-2294 (electronic). URL http: Pinotti. Online knapsack of unknown //www.sciencedirect.com/science/ capacity: How to optimize energy article/pii/S030439751730467X. consumption in smartphones. The- oretical Computer Science, 697(??): Jamshidpey:2017:AMR 98–109, October 12, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1418] Arash Jamshidpey and David Sankoﬀ. 1879-2294 (electronic). URL http: Asymptotic medians of random per- //www.sciencedirect.com/science/ mutations sampled from reversal article/pii/S0304397517305777. random walks. Theoretical Com- Anonymous:2017:EBbp puter Science, 698(??):9–13, Oc- tober 25, 2017. CODEN TC- [1415] Anonymous. Editorial Board. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 697(??): 1879-2294 (electronic). URL http: ifc, October 12, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517305261. REFERENCES 227

Lim:2017:FAA Theoretical Computer Science, 698(??): 67–78, October 25, 2017. CODEN [1419] Jihyuk Lim and Kunsoo Park. A TCSCDI. ISSN 0304-3975 (print), fast algorithm for the all-pairs suffix– 1879-2294 (electronic). URL http: prefix problem. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 698(??):14–24, Oc- article/pii/S0304397517305285. tober 25, 2017. CODEN TC- SCDI. ISSN 0304-3975 (print), Mantaci:2017:MCE 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1423] Sabrina Mantaci, Antonio Restivo, article/pii/S0304397517305510. Giovanna Rosone, Marinella Sciortino, and Luca Versari. Measuring the clus- Crochemore:2017:CPP tering effect of BWT via RLE. The- [1420] Maxime Crochemore, Costas S. Il- oretical Computer Science, 698(??): iopoulos, Tomasz Kociumaka, Jakub 79–87, October 25, 2017. CODEN Radoszewski, Wojciech Rytter, and TCSCDI. ISSN 0304-3975 (print), Tomasz Waleń. Covering problems 1879-2294 (electronic). URL http: for partial words and for indeter- //www.sciencedirect.com/science/ minate strings. Theoretical Com- article/pii/S0304397517305534. puter Science, 698(??):25–39, Oc- tober 25, 2017. CODEN TC- Girotto:2017:MRB SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1424] Samuele Girotto, Matteo Comin, and //www.sciencedirect.com/science/ Cinzia Pizzi. Metagenomic reads article/pii/S0304397517304681. binning with spaced seeds. The- oretical Computer Science, 698(??): Georgiadis:2017:SCC 88–99, October 25, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1421] Loukas Georgiadis, Giuseppe F. Ital- 1879-2294 (electronic). URL http: iano, Aikaterini Karanasiou, Charis //www.sciencedirect.com/science/ Papadopoulos, and Nikos Parot- article/pii/S0304397517304632. sidis. Sparse certificates for 2- connectivity in directed graphs. The- Petrillo:2017:NDA oretical Computer Science, 698(??): 40–66, October 25, 2017. CODEN [1425] Umberto Ferraro Petrillo, Concettina TCSCDI. ISSN 0304-3975 (print), Guerra, and Cinzia Pizzi. A new dis- 1879-2294 (electronic). URL http: tributed alignment-free approach to //www.sciencedirect.com/science/ compare whole proteomes. Theoret- article/pii/S0304397517305273. ical Computer Science, 698(??):100– Gagie:2017:WGF 112, October 25, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1422] Travis Gagie, Giovanni Manzini, and 1879-2294 (electronic). URL http: Jouni Sirén. Wheeler graphs: a frame- //www.sciencedirect.com/science/ work for BWT-based data structures. article/pii/S0304397517305297. REFERENCES 228

Anonymous:2017:EBbq Kobayashi:2017:RSC

[1426] Anonymous. Editorial Board. The- [1430] Yusuke Kobayashi and Kenjiro Takazawa. oretical Computer Science, 698(??): Randomized strategies for cardinality ifc, October 25, 2017. CODEN robustness in the knapsack problem. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 699(??): 1879-2294 (electronic). URL http: 53–62, November 7, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517307120. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Whidden:2017:ROC article/pii/S0304397516307472. [1427] Chris Whidden and Frederick A. Shiraga:2017:TVD Matsen IV. Ricci–Ollivier cur- [1431] Takeharu Shiraga, Yukiko Yamauchi, vature of the rooted phylogenetic Shuji Kijima, and Masafumi Ya- subtree–prune–regraft graph. The- mashita. Total variation discrep- oretical Computer Science, 699(??): ancy of deterministic random walks 1–20, November 7, 2017. CODEN for ergodic Markov chains. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 699(??): 1879-2294 (electronic). URL http: 63–74, November 7, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517301081. 1879-2294 (electronic). URL http: Bhakta:2017:SWP //www.sciencedirect.com/science/ article/pii/S0304397516306120. [1428] Prateek Bhakta and Dana Randall. Sampling weighted perfect matchings Anonymous:2017:EBbr on the square–octagon lattice. The- [1432] Anonymous. Editorial Board. The- oretical Computer Science, 699(??): oretical Computer Science, 699(??): 21–32, November 7, 2017. CODEN ifc, November 7, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517300634. article/pii/S0304397517307223. Durant:2017:DBC Fuentes-Sepulveda:2017:PCS [1429] Kevin Durant and Stephan Wagner. [1433] Jos´e Fuentes-Sep´ulveda, Leo Ferres, On the distribution of betweenness Meng He, and Norbert Zeh. Parallel centrality in random trees. The- construction of succinct trees. The- oretical Computer Science, 699(??): oretical Computer Science, 700(??): 33–52, November 7, 2017. CODEN 1–22, November 14, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516307514. article/pii/S030439751730573X. REFERENCES 229

Lo:2017:OCD ical Computer Science, 700(??):63– 74, November 14, 2017. CODEN [1434] Shih-Ming Lo, Wu-Hsiung Lin, Chi- TCSCDI. ISSN 0304-3975 (print), uyuan Chen, and Yu-Chee Tseng. Op- 1879-2294 (electronic). URL http: timal coloring for data collection in //www.sciencedirect.com/science/ tree-based wireless sensor networks. article/pii/S0304397517306023. Theoretical Computer Science, 700(??): 23–36, November 14, 2017. CODEN Ganguly:2017:STT TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1438] Arnab Ganguly, Wing-Kai Hon, Rahul //www.sciencedirect.com/science/ Shah, and Sharma V. Thankachan. article/pii/S0304397517305728. Space-time trade-oﬀs for ﬁnding shortest unique substrings and maxi- Wang:2017:OAS mal unique matches. Theoreti- cal Computer Science, 700(??):75– [1435] Qian Wang, Ji Tian, Ruyan Fu, and 88, November 14, 2017. CODEN Xiangjuan Yao. Online algorithms TCSCDI. ISSN 0304-3975 (print), for scheduling on batch processing 1879-2294 (electronic). URL http: machines with interval graph com- //www.sciencedirect.com/science/ patibilities between jobs. Theoret- article/pii/S0304397517305832. ical Computer Science, 700(??):37– 44, November 14, 2017. CODEN Jain:2017:EIL TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1439] Sanjay Jain and Jason Teutsch. Enu- //www.sciencedirect.com/science/ merations including laconic enumer- article/pii/S0304397517305704. ators. Theoretical Computer Sci- ence, 700(??):89–95, November 14, Amit:2017:LMA 2017. CODEN TCSCDI. ISSN 0304- 3975 (print), 1879-2294 (electronic). [1436] Mika Amit, Maxime Crochemore, URL http://www.sciencedirect. Gad M. Landau, and Dina Sokol. com/science/article/pii/S0304397517305819. Locating maximal approximate runs in a string. Theoretical Com- Anonymous:2017:EBbs puter Science, 700(??):45–62, Novem- ber 14, 2017. CODEN TC- [1440] Anonymous. Editorial Board. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 700(??): 1879-2294 (electronic). URL http: ifc, November 14, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517305698. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Lozin:2017:MRW article/pii/S0304397517307296.

[1437] Vadim Lozin, Dmitriy Malyshev, Kari:2017:Ec Raﬀaele Mosca, and Viktor Zama- raev. More results on weighted [1441] Lila Kari. Editorial. Theoret- independent domination. Theoret- ical Computer Science, 701(??):1, REFERENCES 230

November 21, 2017. CODEN TC- Azimi:2017:SSC SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1445] Sepinoud Azimi. Steady states of //www.sciencedirect.com/science/ constrained reaction systems. The- article/pii/S0304397517307594. oretical Computer Science, 701(??): 20–26, November 21, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Paun:2017:FSG 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1442] Gheorghe Paun, Ion Petre, Grzegorz article/pii/S0304397517302864. Rozenberg, and Arto Salomaa. From ﬁnite state grammars to natural com- Boykett:2017:FGS puting — in memory of Solomon Mar- [1446] Tim Boykett, Jarkko Kari, and cus. Theoretical Computer Science, 701 Ville Salo. Finite generating sets (??):2–7, November 21, 2017. CODEN for reversible gate sets under gen- TCSCDI. ISSN 0304-3975 (print), eral conservation laws. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 701(??):27– //www.sciencedirect.com/science/ 39, November 21, 2017. CODEN article/pii/S0304397517307570. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Marcus:2017:THN //www.sciencedirect.com/science/ article/pii/S0304397517301226. [1443] Solomon Marcus. Ten human needs that education should take Brijder:2017:SRT into account. Theoretical Com- [1447] Robert Brijder. Sorting by reversals puter Science, 701(??):8–11, Novem- and the theory of 4-regular graphs. ber 21, 2017. CODEN TC- Theoretical Computer Science, 701(??): SCDI. ISSN 0304-3975 (print), 40–53, November 21, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517307582. //www.sciencedirect.com/science/ article/pii/S0304397517302748. Alhazov:2017:SAS Calude:2017:QFG [1444] Artiom Alhazov and Svetlana Cojo- [1448] Cristian S. Calude, Michael J. Din- caru. Small asynchronous P sys- neen, and Richard Hua. QUBO for- tems with inhibitors deﬁning non- mulations for the graph isomorphism semilinear sets. Theoretical Com- problem and related problems. The- puter Science, 701(??):12–19, Novem- oretical Computer Science, 701(??): ber 21, 2017. CODEN TC- 54–69, November 21, 2017. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517306667. article/pii/S0304397517304590. REFERENCES 231

Cho:2017:OGI //www.sciencedirect.com/science/ article/pii/S030439751730275X. [1449] Da-Jung Cho, Yo-Sub Han, Timo- thy Ng, and Kai Salomaa. Outﬁx- Honkala:2017:DWC guided insertion. Theoretical Com- [1453] Juha Honkala. Discrete Watson– puter Science, 701(??):70–84, Novem- Crick dynamical systems. Theoret- ber 21, 2017. CODEN TC- ical Computer Science, 701(??):125– SCDI. ISSN 0304-3975 (print), 131, November 21, 2017. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517302797. //www.sciencedirect.com/science/ Ciobanu:2017:DSM article/pii/S030439751730124X.

[1450] Gabriel Ciobanu and Eneia Nico- Kleijn:2017:SST lae Todoran. Denotational seman- [1454] Jetty Kleijn, Maciej Koutny, and tics of membrane systems by using Marta Pietkiewicz-Koutny. Sig- complete metric spaces. Theoret- nal set tissue systems and overlap- ical Computer Science, 701(??):85– ping localities. Theoretical Computer 108, November 21, 2017. CODEN Science, 701(??):132–145, Novem- TCSCDI. ISSN 0304-3975 (print), ber 21, 2017. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517306382. //www.sciencedirect.com/science/ Genova:2017:GIC article/pii/S0304397517302773. Krishna:2017:FRG [1451] Daniela Genova, Hendrik Jan Hooge- boom, and Natasa Jonoska. A graph [1455] Shankara Narayanan Krishna, Marian isomorphism condition and equiva- Gheorghe, Florentin Ipate, Erzs´ebet lence of reaction systems. Theoret- Csuhaj-Varj´u, and Rodica Ceterchi. ical Computer Science, 701(??):109– Further results on generalised com- 119, November 21, 2017. CODEN municating P systems. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 701(??):146– 1879-2294 (electronic). URL http: 160, November 21, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517304541. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Halava:2017:WTP article/pii/S0304397517304553. [1452] Vesa Halava and Tero Harju. Walks Leporati:2017:CPS on tilings of polygons. Theoreti- cal Computer Science, 701(??):120– [1456] Alberto Leporati, Luca Manzoni, Gi- 124, November 21, 2017. CODEN ancarlo Mauri, Antonio E. Porreca, TCSCDI. ISSN 0304-3975 (print), and Claudio Zandron. The counting 1879-2294 (electronic). URL http: power of P systems with antimatter. REFERENCES 232

Theoretical Computer Science, 701(??): Perez-Jimenez:2017:FRS 161–173, November 21, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1460] Mario J. Pérez-Jiménez, Carmen 1879-2294 (electronic). URL http: Graciani, David Orellana-Mart´ın, //www.sciencedirect.com/science/ Agust´ın Riscos-Núñez, Alvaro´ Romero- article/pii/S0304397517302840. Jiménez, and Luis Valencia-Cabrera. Fuzzy reasoning spiking neural P sys- Li:2017:ICB tems revisited: a formalization. Theo- retical Computer Science, 701(??):216– [1457] Yang Li, Andrei Paun, and Mi- 225, November 21, 2017. CODEN haela Paun. Improvements on con- TCSCDI. ISSN 0304-3975 (print), tours based segmentation for DNA mi- 1879-2294 (electronic). URL http: croarray image processing. Theoret- //www.sciencedirect.com/science/ ical Computer Science, 701(??):174– article/pii/S0304397517304577. 189, November 21, 2017. CODEN Valencia-Cabrera:2017:RET TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1461] Luis Valencia-Cabrera, David Orellana- //www.sciencedirect.com/science/ Mart´ın, Miguel A. Mart´ınez del article/pii/S0304397517304565. Amor, Agust´ın Riscos-Núñez, and Mario J. Pérez-Jiménez. Reaching effi- Manca:2017:PIG ciency through collaboration in membrane systems: Dissolution, polar- [1458] Vincenzo Manca. The principles of ization and cooperation. Theoreti- informational genomics. Theoreti- cal Computer Science, 701(??):226– cal Computer Science, 701(??):190– 234, November 21, 2017. CODEN 202, November 21, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517304589. article/pii/S0304397517302761. Anonymous:2017:EBbt Mohammed:2017:CMK [1462] Anonymous. Editorial Board. The- [1459] Abdulmelik Mohammed, Elena Czei- oretical Computer Science, 701(??): zler, and Eugen Czeizler. Com- ifc, November 21, 2017. CODEN putational modelling of the ki- TCSCDI. ISSN 0304-3975 (print), netic Tile Assembly Model using 1879-2294 (electronic). URL http: a rule-based approach. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 701(??):203– article/pii/S030439751730751X. 215, November 21, 2017. CODEN Borlido:2017:WP TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1463] Célia Borlido. The κ-word prob- //www.sciencedirect.com/science/ lem over DRH. Theoretical Com- article/pii/S0304397517305522. puter Science, 702(??):1–22, Novem- REFERENCES 233

ber 30, 2017. CODEN TC- decrease in logical depth. Theoret- SCDI. ISSN 0304-3975 (print), ical Computer Science, 702(??):60– 1879-2294 (electronic). URL http: 64, November 30, 2017. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517306102. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Downey:2017:LLD article/pii/S0304397517306217. See corrigendum [2024]. [1464] Rod Downey, Michael McInerney, and Keng Meng Ng. Lowness and logical depth. Theoretical Com- Zhou:2017:TCT puter Science, 702(??):23–33, Novem- ber 30, 2017. CODEN TC- [1468] Hao Zhou, Yiwei Jiang, Ping Zhou, SCDI. ISSN 0304-3975 (print), Min Ji, and Yun Zhao. Total com- 1879-2294 (electronic). URL http: pletion time minimization scheduling //www.sciencedirect.com/science/ on two hierarchical uniform machines. article/pii/S0304397517306126. Theoretical Computer Science, 702(??): 65–76, November 30, 2017. CODEN Walter:2017:PRC TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1465] Tobias Walter. Parikh-reducing //www.sciencedirect.com/science/ Church–Rosser representations for article/pii/S0304397517306254. some classes of regular languages. The- oretical Computer Science, 702(??): Cabello:2017:ISS 34–47, November 30, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1469] Sergio Cabello and Pablo P´erez- //www.sciencedirect.com/science/ Lantero. Interval selection in article/pii/S0304397517306114. the streaming model. Theoreti- cal Computer Science, 702(??):77– Asaeedi:2017:CHG 96, November 30, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1466] Saeed Asaeedi, Farzad Didehvar, and 1879-2294 (electronic). URL http: Ali Mohades. α-Concave hull, a gen- //www.sciencedirect.com/science/ eralization of convex hull. Theoret- article/pii/S0304397517306242. ical Computer Science, 702(??):48– 59, November 30, 2017. CODEN Anonymous:2017:EBbu TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1470] Anonymous. Editorial Board. The- //www.sciencedirect.com/science/ oretical Computer Science, 702(??): article/pii/S0304397517306230. ifc, November 30, 2017. CODEN Antunes:2017:RDL TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1467] L. F. Antunes, A. Souto, and //www.sciencedirect.com/science/ P. M. B. Vit´anyi. On the rate of article/pii/S0304397517307818. REFERENCES 234

Bose:2017:GFS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1471] Prosenjit Bose and Jean-Lou De article/pii/S0304397517306497. Carufel. A general framework for searching on a line. Theoretical Li:2017:TAP Computer Science, 703(??):1–17, De- [1475] Dawei Li and Xiwen Lu. Two- cember 5, 2017. CODEN TC- agent parallel-machine scheduling SCDI. ISSN 0304-3975 (print), with rejection. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 703(??):66–75, De- //www.sciencedirect.com/science/ cember 5, 2017. CODEN TC- article/pii/S0304397517306394. SCDI. ISSN 0304-3975 (print), Glasser:2017:CSC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1472] Christian Glaßer, Peter Jonsson, and article/pii/S0304397517306527. Barnaby Martin. Circuit satisfiability and constraint satisfaction Bulyovszky:2017:PFF around Skolem Arithmetic. The- [1476] Balázs Bulyovszky and Gábor Horváth. oretical Computer Science, 703(??): Polynomial functions over finite com- 18–36, December 5, 2017. CODEN mutative rings. Theoretical Com- TCSCDI. ISSN 0304-3975 (print), puter Science, 703(??):76–86, De- 1879-2294 (electronic). URL http: cember 5, 2017. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397517306485. 1879-2294 (electronic). URL http: Jin:2017:MMM //www.sciencedirect.com/science/ article/pii/S0304397517306503. [1473] Yujia Jin, Huan Li, and Zhongzhi Anonymous:2017:EBbv Zhang. Maximum matchings and minimum dominating sets in Apol- [1477] Anonymous. Editorial Board. The- lonian networks and extended Tower oretical Computer Science, 703(??): of Hanoi graphs. Theoretical Com- ifc, December 5, 2017. CODEN puter Science, 703(??):37–54, De- TCSCDI. ISSN 0304-3975 (print), cember 5, 2017. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517307880. //www.sciencedirect.com/science/ article/pii/S0304397517306473. Kang:2017:WPU Garg:2017:MEU [1478] Dong Yeap Kang, O joung Kwon, Torstein J. F. Strømme, and Jan Arne [1474] Jugal Garg. Market equilibrium un- Telle. A width parameter useful for der piecewise Leontief concave utilities. chordal and co-comparability graphs. Theoretical Computer Science, 703(??): Theoretical Computer Science, 704(??): 55–65, December 5, 2017. CODEN 1–17, December 15, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), REFERENCES 235

1879-2294 (electronic). URL http: and folded hypercubes. Theoret- //www.sciencedirect.com/science/ ical Computer Science, 704(??):62– article/pii/S0304397517306618. 73, December 15, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), Abam:2017:FTS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1479] M. A. Abam, F. Baharifard, M. S. article/pii/S0304397517306989. Borouny, and H. Zarrabi-Zadeh. Fault- tolerant spanners in networks with Bunder:2017:GAR symmetric directional antennas. The- oretical Computer Science, 704(??): [1483] Martin Bunder, Abderrahmane Ni- 18–27, December 15, 2017. CODEN taj, Willy Susilo, and Joseph Tonien. TCSCDI. ISSN 0304-3975 (print), A generalized attack on RSA type 1879-2294 (electronic). URL http: cryptosystems. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 704(??):74–81, De- article/pii/S0304397517306606. cember 15, 2017. CODEN TC- SCDI. ISSN 0304-3975 (print), Jayapaul:2017:FME 1879-2294 (electronic). URL http: [1480] Varukumar Jayapaul, J. Ian Munro, //www.sciencedirect.com/science/ Venkatesh Raman, and Srinivas Rao article/pii/S0304397517306643. Satti. Finding modes with equal- Li:2017:FTS ity comparisons. Theoretical Com- puter Science, 704(??):28–41, De- [1484] Xiang-Jun Li, Yong-Ni Guan, Zheng cember 15, 2017. CODEN TC- Yan, and Jun-Ming Xu. On fault tol- SCDI. ISSN 0304-3975 (print), erance of (n, k)-star networks. The- 1879-2294 (electronic). URL http: oretical Computer Science, 704(??): //www.sciencedirect.com/science/ 82–86, December 15, 2017. CODEN article/pii/S030439751730662X. TCSCDI. ISSN 0304-3975 (print), Blanchet-Sadri:2017:CGB 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1481] F. Blanchet-Sadri and Sinziana Munteanu. article/pii/S0304397517305984. Computing generalized de Bruijn sequences. Theoretical Computer Sci- Sepasian:2017:UMM ence, 704(??):42–61, December 15, [1485] Ali Reza Sepasian and Ehsan Mon- 2017. CODEN TCSCDI. ISSN 0304- abbati. Upgrading min–max span- 3975 (print), 1879-2294 (electronic). ning tree problem under various URL http://www.sciencedirect. cost functions. Theoretical Com- com/science/article/pii/S0304397517306655. puter Science, 704(??):87–91, De- Liu:2017:ECD cember 15, 2017. CODEN TC- SCDI. ISSN 0304-3975 (print), [1482] Aixia Liu, Shiying Wang, Jun Yuan, 1879-2294 (electronic). URL http: and Jing Li. On g-extra condi- //www.sciencedirect.com/science/ tional diagnosability of hypercubes article/pii/S0304397517306011. REFERENCES 236

Penso:2017:CCA January 1, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), [1486] Lucia Draque Penso, Fábio Protti, Di- 1879-2294 (electronic). URL http: eter Rautenbach, and Uéverton dos //www.sciencedirect.com/science/ Santos Souza. Corrigendum to “Com- article/pii/S0304397517306783. plexity analysis of P3-convexity problems on bounded-degree and pla- Hackl:2018:RBT nar graphs” [Theoret. Comput. Sci. 607 Part 1 (2015) 83–95]. Theo- [1490] Benjamin Hackl, Clemens Heuberger, retical Computer Science, 704(??):92– and Helmut Prodinger. Reductions 93, December 15, 2017. CODEN of binary trees and lattice paths in- TCSCDI. ISSN 0304-3975 (print), duced by the register function. The- 1879-2294 (electronic). URL http: oretical Computer Science, 705(??): //www.sciencedirect.com/science/ 31–57, January 1, 2018. CODEN article/pii/S0304397517306229. See TCSCDI. ISSN 0304-3975 (print), [521]. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Anonymous:2017:EBbw article/pii/S0304397517306771. [1487] Anonymous. Editorial Board. The- oretical Computer Science, 704(??): Yu:2018:MSC ifc, December 15, 2017. CODEN TCSCDI. ISSN 0304-3975 (print), [1491] Hung-I Yu, Cheng-Chung Li, and D. T. 1879-2294 (electronic). URL http: Lee. The multi-service center problem. //www.sciencedirect.com/science/ Theoretical Computer Science, 705(??): article/pii/S0304397517307995. 58–74, January 1, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Leiss:2018:WPH 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1488] Ernst L. Leiss and Isaac Mackey. The article/pii/S0304397517307028. worst parallel Hanoi graphs. The- oretical Computer Science, 705(??): Chiarelli:2018:MCT 1–8, January 1, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1492] Nina Chiarelli, Tatiana R. Hartinger, 1879-2294 (electronic). URL http: Matthew Johnson, Martin Milanic, and //www.sciencedirect.com/science/ Daniël Paulusma. Minimum connected article/pii/S0304397517306746. transversals in graphs: New hard- Shibata:2018:MOP ness results and tractable cases using the price of connectivity. The- [1489] Masahiro Shibata, Fukuhito Ooshita, oretical Computer Science, 705(??): Hirotsugu Kakugawa, and Toshim- 75–83, January 1, 2018. CODEN itsu Masuzawa. Move-optimal par- TCSCDI. ISSN 0304-3975 (print), tial gathering of mobile agents 1879-2294 (electronic). URL http: in asynchronous trees. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 705(??):9–30, article/pii/S0304397517307016. REFERENCES 237

Kobayashi:2018:ILB TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1493] Koji M. Kobayashi. Improved //www.sciencedirect.com/science/ lower bounds for online scheduling article/pii/S030439751730703X. See to minimize total stretch. Theo- [1406]. retical Computer Science, 705(??): 84–98, January 1, 2018. CODEN Anonymous:2018:EBa TCSCDI. ISSN 0304-3975 (print), [1497] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 705(??): //www.sciencedirect.com/science/ ifc, January 1, 2018. CODEN article/pii/S0304397517307004. TCSCDI. ISSN 0304-3975 (print), Greenberg:2018:DSC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1494] Noam Greenberg, Joseph S. Miller, article/pii/S0304397517308101. Alexander Shen, and Linda Brown Westrick. Dimension 1 sequences Ebrahimi:2018:SSI are close to randoms. Theoreti- [1498] M. M. Ebrahimi, Kh. Keshvardoost, cal Computer Science, 705(??):99– and M. Mahmoudi. Simple and 112, January 1, 2018. CODEN subdirectly irreducible ﬁnitely sup- TCSCDI. ISSN 0304-3975 (print), ported Cb-sets. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 706(??):1–21, Jan- //www.sciencedirect.com/science/ uary 6, 2018. CODEN TC- article/pii/S0304397517306990. SCDI. ISSN 0304-3975 (print), Chatterjee:2018:NRU 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1495] Kingshuk Chatterjee and Kumar Sankar article/pii/S0304397517305844. Ray. Non-regular unary language Zhao:2018:FFO and parallel communicating Watson- Crick automata systems. Theoret- [1499] Chunna Zhao and Shanshan Li. For- ical Computer Science, 705(??):113– malization of fractional order PD 117, January 1, 2018. CODEN control systems in HOL4. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 706(??): 1879-2294 (electronic). URL http: 22–34, January 6, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517306631. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Ning:2018:ECC article/pii/S0304397517306205. [1496] Wantao Ning. Erratum and correc- Dimovski:2018:VAP tions to “The h-connectivity of exchanged crossed cube” [Theoret. Com- [1500] Aleksandar S. Dimovski. Verify- put. Sci. 696 (2017) 65–68]. The- ing annotated program families us- oretical Computer Science, 705(??): ing symbolic game semantics. The- 118–121, January 1, 2018. CODEN oretical Computer Science, 706(??): REFERENCES 238

35–53, January 6, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517308745. //www.sciencedirect.com/science/ Kayaaslan:2018:SSP article/pii/S0304397517306977. [1505] Enver Kayaaslan, Thomas Lam- Baldan:2018:MTI bert, Loris Marchal, and Bora U¸car. [1501] Paolo Baldan and Alessandro Beg- Scheduling series-parallel task graphs giato. Multilevel transitive and intran- to minimize peak memory. The- sitive non-interference, causally. The- oretical Computer Science, 707(??): oretical Computer Science, 706(??): 1–23, January 10, 2018. CODEN 54–82, January 6, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517307053. article/pii/S0304397517307090. Godin:2018:BMA Leitsch:2018:PCI [1506] Thibault Godin and Ines Klimann. On bireversible Mealy automata and [1502] Alexander Leitsch and Michael Lett- the Burnside problem. Theoreti- mann. The problem of Π -cut- 2 cal Computer Science, 707(??):24– introduction. Theoretical Com- 35, January 10, 2018. CODEN puter Science, 706(??):83–116, Jan- TCSCDI. ISSN 0304-3975 (print), uary 6, 2018. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517307107. //www.sciencedirect.com/science/ article/pii/S0304397517307089. Alizadeh:2018:OAI Anonymous:2018:EBb [1507] Behrooz Alizadeh and Roghayeh Etemad. Optimal algorithms for in- [1503] Anonymous. Editorial Board. The- verse vertex obnoxious center loca- oretical Computer Science, 706(??): tion problems on graphs. Theoret- ifc, January 6, 2018. CODEN ical Computer Science, 707(??):36– TCSCDI. ISSN 0304-3975 (print), 45, January 10, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517308216. //www.sciencedirect.com/science/ article/pii/S0304397517307065. Anonymous:2018:EBc Alipour:2018:RAA [1504] Anonymous. Editorial Board. The- oretical Computer Science, 707(??): [1508] Sharareh Alipour, Mohammad Gh- ii, January 10, 2018. CODEN odsi, and Amir Jafari. Random- TCSCDI. ISSN 0304-3975 (print), ized approximation algorithms for pla- REFERENCES 239

nar visibility counting problem. The- Zhang:2018:R oretical Computer Science, 707(??): 46–55, January 10, 2018. CODEN [1512] Jie-Meng Zhang, Ying-Jun Guo, and TCSCDI. ISSN 0304-3975 (print), Zhi-Xiong Wen. On the regular- {b c} 1879-2294 (electronic). URL http: ity of logb(αn + β) n≥0. The- //www.sciencedirect.com/science/ oretical Computer Science, 707(??): article/pii/S0304397517307375. 82–88, January 10, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Li:2018:FTS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1509] Pingshan Li and Min Xu. Fault- article/pii/S0304397517307387. tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity Bienkowski:2018:LPB of balanced hypercubes. Theoret- [1513] Marcin Bienkowski, Martin Böhm, ical Computer Science, 707(??):56– Lukasz Je˙z, Pawe l Lasko´s-Grabowski, 68, January 10, 2018. CODEN Jan Marcinkowski, Jir´ı Sgall, Alek- TCSCDI. ISSN 0304-3975 (print), sandra Spyra, and Pavel Veselý. 1879-2294 (electronic). URL http: Logarithmic price of buffer down- //www.sciencedirect.com/science/ scaling on line metrics. Theoret- article/pii/S0304397517307454. ical Computer Science, 707(??):89– Martins:2018:LIC 93, January 10, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1510] Nicolas Martins and Rudini Sam- 1879-2294 (electronic). URL http: paio. Locally identifying coloring //www.sciencedirect.com/science/ of graphs with few P4s. Theoret- article/pii/S0304397517307363. ical Computer Science, 707(??):69– Li:2018:TPA 76, January 10, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1514] Wangwei Li and Xianhua Li. On 1879-2294 (electronic). URL http: two problems of almost synchro- //www.sciencedirect.com/science/ nizing groups. Theoretical Com- article/pii/S0304397517307430. puter Science, 707(??):94–95, Jan- uary 10, 2018. CODEN TC- Karpinski:2018:ECC SCDI. ISSN 0304-3975 (print), [1511] Michal Karpiński. Encoding cardi- 1879-2294 (electronic). URL http: nality constraints using standard en- //www.sciencedirect.com/science/ coding of generalized selection net- article/pii/S0304397517307351. works preserves arc-consistency. The- Guo:2018:RAT oretical Computer Science, 707(??): 77–81, January 10, 2018. CODEN [1515] Litao Guo. Reliability analysis of TCSCDI. ISSN 0304-3975 (print), twisted cubes. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 707(??):96–101, Jan- //www.sciencedirect.com/science/ uary 10, 2018. CODEN TC- article/pii/S0304397517307041. SCDI. ISSN 0304-3975 (print), REFERENCES 240

1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517307442. article/pii/S0304397517307478.

Anonymous:2018:EBd Ma:2018:IMC

[1516] Anonymous. Editorial Board. The- [1520] Fei Ma and Bing Yao. An itera- oretical Computer Science, 708(??): tion method for computing the to- ii, January 17, 2018. CODEN tal number of spanning trees and its TCSCDI. ISSN 0304-3975 (print), applications in graph theory. The- 1879-2294 (electronic). URL http: oretical Computer Science, 708(??): //www.sciencedirect.com/science/ 46–57, January 17, 2018. CODEN article/pii/S0304397517308836. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Marcilon:2018:MTN //www.sciencedirect.com/science/ article/pii/S030439751730779X. [1517] Thiago Marcilon and Rudini Sampaio. The maximum time of 2-neighbor boot- Talmon:2018:SPR strap percolation: Complexity results. [1521] Nimrod Talmon. Structured pro- Theoretical Computer Science, 708(??): portional representation. Theoret- 1–17, January 17, 2018. CODEN ical Computer Science, 708(??):58– TCSCDI. ISSN 0304-3975 (print), 74, January 17, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517307429. //www.sciencedirect.com/science/ Rai:2018:BCA article/pii/S0304397517307776.

[1518] Ashutosh Rai and Saket Saurabh. Tseng:2018:EML Bivariate complexity analysis of Al- [1522] Kuo-Tsung Tseng, De-Sheng Chan, most Forest Deletion. Theoreti- Chang-Biau Yang, and Shou-Fu cal Computer Science, 708(??):18– Lo. Eﬃcient merged longest com- 33, January 17, 2018. CODEN mon subsequence algorithms for sim- TCSCDI. ISSN 0304-3975 (print), ilar sequences. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 708(??):75–90, Jan- //www.sciencedirect.com/science/ uary 17, 2018. CODEN TC- article/pii/S0304397517307491. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Mahajan:2018:SRO //www.sciencedirect.com/science/ [1519] Meena Mahajan and Anuj Tawari. article/pii/S0304397517307764. Sums of read-once formulas: How Litow:2018:TMB many summands are necessary? The- oretical Computer Science, 708(??): [1523] B. Litow. A transfer method from 34–45, January 17, 2018. CODEN bounded existential Diophantine equa- TCSCDI. ISSN 0304-3975 (print), tions to Tarski algebra formulas. The- REFERENCES 241

oretical Computer Science, 708(??): 2–19, January 24, 2018. CODEN 91–95, January 17, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516306818. article/pii/S0304397517307417. Czyzowicz:2018:ETR Mikos:2018:NLB [1528] Jurek Czyzowicz, Stefan Dobrev, [1524] Patryk Mikos. A new lower bound Konstantinos Georgiou, Evangelos for the on-line coloring of inter- Kranakis, and Fraser MacQuarrie. vals with bandwidth. Theoreti- Evacuating two robots from multi- cal Computer Science, 708(??):96– ple unknown exits in a circle. The- 100, January 17, 2018. CODEN oretical Computer Science, 709(??): TCSCDI. ISSN 0304-3975 (print), 20–30, January 24, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517307788. //www.sciencedirect.com/science/ Anonymous:2018:EBe article/pii/S0304397516306788. [1525] Anonymous. Editorial Board. The- He:2018:GME oretical Computer Science, 709(??): ii, January 24, 2018. CODEN [1529] Yuan He, K. Gopalakrishnan, and TCSCDI. ISSN 0304-3975 (print), Eli Gafni. Group mutual exclu- 1879-2294 (electronic). URL http: sion in linear time and space. The- //www.sciencedirect.com/science/ oretical Computer Science, 709(??): article/pii/S0304397517308952. 31–47, January 24, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Pandurangan:2018:SII 1879-2294 (electronic). URL http: [1526] Gopal Pandurangan and Peter Robin- //www.sciencedirect.com/science/ son. Special issue of ICDCN 2016 article/pii/S0304397517304747. (Distributed Computing Track). The- Fo erster:2018:LCN oretical Computer Science, 709(??): 1, January 24, 2018. CODEN [1530] Klaus-Tycho Foerster, Thomas Luedi, TCSCDI. ISSN 0304-3975 (print), Jochen Seidel, and Roger Watten- 1879-2294 (electronic). URL http: hofer. Local checkability, no strings //www.sciencedirect.com/science/ attached: (a)cyclicity, reachability, article/pii/S0304397517308988. loop free updates in SDNs. The- Castaneda:2018:CRM oretical Computer Science, 709(??): 48–63, January 24, 2018. CODEN [1527] Armando Casta˜neda, Danny Dolev, TCSCDI. ISSN 0304-3975 (print), and Amitabh Trehan. Compact rout- 1879-2294 (electronic). URL http: ing messages in self-healing trees. The- //www.sciencedirect.com/science/ oretical Computer Science, 709(??): article/pii/S0304397516306776. REFERENCES 242

Bonomi:2018:OSS //www.sciencedirect.com/science/ article/pii/S0304397518300069. [1531] Silvia Bonomi, Antonella Del Pozzo, and Maria Potop-Butucaru. Opti- Amir:2018:PRS mal self-stabilizing synchronous mo- [1535] Amihood Amir, Mika Amit, Gad M. bile Byzantine-tolerant atomic regis- Landau, and Dina Sokol. Period ter. Theoretical Computer Science, 709 recovery of strings over the Ham- (??):64–79, January 24, 2018. CODEN ming and edit distances. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 710(??): 1879-2294 (electronic). URL http: 2–18, February 1, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517306291. 1879-2294 (electronic). URL http: Mostefaoui:2018:RSA //www.sciencedirect.com/science/ article/pii/S0304397517307752. [1532] Achour Most´efaoui, Hamouma Moumen, and Michel Raynal. Randomized k-set Aronica:2018:OPL agreement in crash-prone and Byzan- [1536] Salvatore Aronica, Alessio Langiu, tine asynchronous systems. The- Francesca Marzi, Salvatore Mazzola, oretical Computer Science, 709(??): and Filippo Mignosi. On optimal pars- 80–97, January 24, 2018. CODEN ing for LZ78-like compressors. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 710(??): 1879-2294 (electronic). URL http: 19–28, February 1, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517302311. 1879-2294 (electronic). URL http: Anonymous:2018:EBf //www.sciencedirect.com/science/ article/pii/S0304397517301524. [1533] Anonymous. Editorial Board. The- Bae:2018:FLC oretical Computer Science, 710(??): ii, February 1, 2018. CODEN [1537] Sang Won Bae and Inbok Lee. On TCSCDI. ISSN 0304-3975 (print), ﬁnding a longest common palin- 1879-2294 (electronic). URL http: dromic subsequence. Theoretical //www.sciencedirect.com/science/ Computer Science, 710(??):29–34, article/pii/S0304397518300100. February 1, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), Crochemore:2018:AAC 1879-2294 (electronic). URL http: [1534] Maxime Crochemore and Solon P. Pis- //www.sciencedirect.com/science/ sis. Advances in algorithms & com- article/pii/S0304397517301512. binatorics on strings (honoring 60th Cho:2018:TAB birthday for Prof. Costas S. Iliopou- los). Theoretical Computer Science, [1538] Sukhyeun Cho, Joong Chae Na, and 710(??):1, February 1, 2018. CODEN Jeong Seop Sim. An O(n2 log m)-time TCSCDI. ISSN 0304-3975 (print), algorithm for the boxed-mesh permu- 1879-2294 (electronic). URL http: tation pattern matching problem. The- REFERENCES 243

oretical Computer Science, 710(??): Grossi:2018:MTE 35–43, February 1, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1542] Roberto Grossi, Giulia Menconi, Na- 1879-2294 (electronic). URL http: dia Pisanti, Roberto Trani, and Søren //www.sciencedirect.com/science/ Vind. Motif trie: an efficient text index article/pii/S030439751730155X. for pattern discovery with don’t cares. Theoretical Computer Science, 710(??): Daykin:2018:RSL 74–87, February 1, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1539] Jacqueline W. Daykin, Frantisek 1879-2294 (electronic). URL http: Franek, Jan Holub, A. S. M. Sohidull //www.sciencedirect.com/science/ Islam, and W. F. Smyth. Reconstruct- article/pii/S0304397517303523. ing a string from its Lyndon arrays. Theoretical Computer Science, 710(??): Helling:2018:CIS 44–51, February 1, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1543] Joel Helling, P. J. Ryan, W. F. 1879-2294 (electronic). URL http: Smyth, and Michael Soltys. Con- //www.sciencedirect.com/science/ structing an indeterminate string article/pii/S0304397517303304. from its associated graph. The- oretical Computer Science, 710(??): Daykin:2018:SSO 88–96, February 1, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1540] Jacqueline W. Daykin, Richard Groult, 1879-2294 (electronic). URL Yannick Guesnet, Thierry Lecroq, Ar- http: naud Lefebvre, Martine Léonard, and //www.sciencedirect.com/science/ . Elise´ Prieur-Gaston. A survey of string article/pii/S0304397517301494 orderings and their application to the Hoffmann:2018:ENL Burrows–Wheeler transform. The- oretical Computer Science, 710(??): [1544] Michael Hoffmann, John Iacono, 52–65, February 1, 2018. CODEN Patrick K. Nicholson, and Rajeev Ra- TCSCDI. ISSN 0304-3975 (print), man. Encoding nearest larger values. 1879-2294 (electronic). URL http: Theoretical Computer Science, 710(??): //www.sciencedirect.com/science/ 97–115, February 1, 2018. CODEN article/pii/S0304397517301548. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Gawrychowski:2018:NCN //www.sciencedirect.com/science/ [1541] Pawe l Gawrychowski, Gad M. Lan- article/pii/S0304397517301500. dau, Shay Mozes, and Oren Weimann. Iakovidou:2018:SDA The nearest colored node in a tree. Theoretical Computer Science, 710(??): [1545] Nantia D. Iakovidou, Nikos A. Laskaris, 66–73, February 1, 2018. CODEN Costas Tsichlas, Yannis Manolopou- TCSCDI. ISSN 0304-3975 (print), los, Manolis Christodoulakis, Eleft- 1879-2294 (electronic). URL http: herios S. Papathanasiou, Savvas S. //www.sciencedirect.com/science/ Papacostas, and Georgios D. Mit- article/pii/S0304397517306308. sis. A symbolic dynamics approach to REFERENCES 244

Epileptic Chronnectomics: Employing TCSCDI. ISSN 0304-3975 (print), strings to predict crisis onset. The- 1879-2294 (electronic). URL http: oretical Computer Science, 710(??): //www.sciencedirect.com/science/ 116–125, February 1, 2018. CODEN article/pii/S0304397517301536. TCSCDI. ISSN 0304-3975 (print), Anonymous:2018:EBg 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1549] Anonymous. Editorial Board. The- article/pii/S0304397517301561. oretical Computer Science, 711(??): Kociumaka:2018:SCP ii, February 8, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1546] Tomasz Kociumaka, Jakub W. Pa- 1879-2294 (electronic). URL http: chocki, Jakub Radoszewski, Wojciech //www.sciencedirect.com/science/ Rytter, and Tomasz Waleń. On the article/pii/S0304397518300239. string consensus problem and the Man- Guo:2018:PSC hattan sequence consensus problem. Theoretical Computer Science, 710(??): [1550] Yuyan Guo, Jiguo Li, Yang Lu, Yichen 126–138, February 1, 2018. CODEN Zhang, and Futai Zhang. Prov- TCSCDI. ISSN 0304-3975 (print), ably secure certificate-based encryp- 1879-2294 (electronic). URL http: tion with leakage resilience. The- //www.sciencedirect.com/science/ oretical Computer Science, 711(??): article/pii/S0304397517302359. 1–10, February 8, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Kociumaka:2018:EAS 1879-2294 (electronic). URL http: [1547] Tomasz Kociumaka, Solon P. Pis- //www.sciencedirect.com/science/ sis, Jakub Radoszewski, Wojciech article/pii/S030439751730748X. Rytter, and Tomasz Waleń. Ef- Mozes:2018:FSP ficient algorithms for shortest partial seeds in words. Theoretical [1551] Shay Mozes, Yahav Nussbaum, and Computer Science, 710(??):139–147, Oren Weimann. Faster shortest paths February 1, 2018. CODEN TC- in dense distance graphs, with ap- SCDI. ISSN 0304-3975 (print), plications. Theoretical Computer 1879-2294 (electronic). URL http: Science, 711(??):11–35, February 8, //www.sciencedirect.com/science/ 2018. CODEN TCSCDI. ISSN 0304- article/pii/S0304397516307034. 3975 (print), 1879-2294 (electronic). URL http://www.sciencedirect. Na:2018:FIA com/science/article/pii/S0304397517307971. [1548] Joong Chae Na, Hyunjoon Kim, Se- Hu:2018:SMP unghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent [1552] Xiaomin Hu, Yingzhi Tian, Xi- Mouchard, and Kunsoo Park. FM- aodong Liang, and Jixiang Meng. index of alignment with gaps. The- Strong matching preclusion for k- oretical Computer Science, 710(??): composition networks. Theoreti- 148–157, February 1, 2018. CODEN cal Computer Science, 711(??):36– REFERENCES 245

43, February 8, 2018. CODEN Ebrahimnejad:2018:GBS TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1556] Farzam Ebrahimnejad. On the gap //www.sciencedirect.com/science/ between separating words and sep- article/pii/S030439751730796X. arating their reversals. Theoreti- cal Computer Science, 711(??):79– Sabir:2018:SFT 91, February 8, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1553] Eminjan Sabir and Jixiang Meng. //www.sciencedirect.com/science/ Structure fault tolerance of hyper- article/pii/S0304397517308423. cubes and folded hypercubes. The- oretical Computer Science, 711(??): Seebold:2018:SIN 44–55, February 8, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1557] Patrice Séébold. Sturmian im- 1879-2294 (electronic). URL http: ages of non Sturmian words and //www.sciencedirect.com/science/ standard morphisms. Theoretical article/pii/S0304397517307958. Computer Science, 711(??):92–104, February 8, 2018. CODEN TC- Karpinski:2018:QBN SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1554] Marek Karpinski, Andrzej Lingas, and //www.sciencedirect.com/science/ . Dzmitry Sledneu. A QPTAS for the article/pii/S0304397517308411 base of the number of crossing-free Kantor:2018:TWC structures on a planar point set. The- oretical Computer Science, 711(??): [1558] Erez Kantor, Zvi Lotker, Merav Parter, 56–65, February 8, 2018. CODEN and David Peleg. The topology of wire- TCSCDI. ISSN 0304-3975 (print), less communication on a line. The- 1879-2294 (electronic). URL http: oretical Computer Science, 711(??): //www.sciencedirect.com/science/ 105–108, February 8, 2018. CODEN article/pii/S0304397517308307. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Garnero:2018:FIC //www.sciencedirect.com/science/ article/pii/S0304397517307077. [1555] Valentin Garnero, Konstanty Junosza- Masopust:2018:SPT Szaniawski, Mathieu Liedloff, Pedro Montealegre, and PawelRz¸ a˙zewski. [1559] Tomáˇs Masopust. Separability by Fixing improper colorings of graphs. piecewise testable languages is PTime- Theoretical Computer Science, 711(??): complete. Theoretical Computer Sci- 66–78, February 8, 2018. CODEN ence, 711(??):109–114, February 8, TCSCDI. ISSN 0304-3975 (print), 2018. CODEN TCSCDI. ISSN 0304- 1879-2294 (electronic). URL http: 3975 (print), 1879-2294 (electronic). //www.sciencedirect.com/science/ URL http://www.sciencedirect. article/pii/S0304397517308435. com/science/article/pii/S0304397517308319. REFERENCES 246

Anonymous:2018:EBh Anonymous:2018:EBi

[1560] Anonymous. Editorial Board. The- [1564] Anonymous. Editorial Board. The- oretical Computer Science, 712(??): oretical Computer Science, 713(??): ii, February 15, 2018. CODEN ii, February 22, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518300367. article/pii/S0304397518300471.

Lipton:2018:KSH Jones:2018:CGL ´ [1561] James Lipton and Susana Nieva. [1565] Atila A. Jones, F´abio Protti, and Kripke semantics for higher-order type Renata R. Del-Vecchio. Cograph theory applied to constraint logic generation with linear delay. The- programming languages. Theoret- oretical Computer Science, 713(??): ical Computer Science, 712(??):1– 1–10, February 22, 2018. CODEN 37, February 15, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518300033. article/pii/S0304397517308356. Mao:2018:SMP

Kalorkoti:2018:SLT [1566] Yaping Mao, Zhao Wang, Eddie Cheng, and Christopher Melekian. Strong [1562] K. Kalorkoti. SolvingLukasiewicz matching preclusion number of graphs. µ-terms. Theoretical Computer Sci- Theoretical Computer Science, 713(??): ence, 712(??):38–49, February 15, 11–20, February 22, 2018. CODEN 2018. CODEN TCSCDI. ISSN 0304- TCSCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397517308289article/pii/S030439751830001X. .

Avni:2018:SCL Friedman:2018:DNG

[1563] Guy Avni and Orna Kupferman. [1567] Eric J. Friedman and Adam S. Synthesis from component libraries Landsberg. Duality and nonlin- with costs. Theoretical Com- ear graph Laplacians. Theoreti- puter Science, 712(??):50–72, Febru- cal Computer Science, 713(??):21– ary 15, 2018. CODEN TC- 30, February 22, 2018. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517308277. article/pii/S0304397517309295. REFERENCES 247

Rutanen:2018:MCN 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1568] Kalle Rutanen. Minimal characteriza- article/pii/S0304397517309167. tion of O-notation in algorithm analysis. Theoretical Computer Science, 713 DiGiacomo:2018:NRE (??):31–41, February 22, 2018. CODEN [1572] Emilio Di Giacomo, Walter Didimo, TCSCDI. ISSN 0304-3975 (print), William S. Evans, Giuseppe Liotta, 1879-2294 (electronic). URL http: Henk Meijer, Fabrizio Montecchiani, //www.sciencedirect.com/science/ and Stephen K. Wismath. New results article/pii/S0304397517309210. on edge partitions of 1-plane graphs. You:2018:SSC Theoretical Computer Science, 713(??): 78–84, February 22, 2018. CODEN [1569] Lantao You, Jianxi Fan, and Yue- TCSCDI. ISSN 0304-3975 (print), juan Han. Super spanning connectiv- 1879-2294 (electronic). URL http: ity on WK-recursive networks. The- //www.sciencedirect.com/science/ oretical Computer Science, 713(??): article/pii/S0304397517309192. 42–55, February 22, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Anonymous:2018:EBj 1879-2294 (electronic). URL http: [1573] Anonymous. Editorial Board. The- //www.sciencedirect.com/science/ oretical Computer Science, 714(??): article/pii/S0304397517309180. ii, March 1, 2018. CODEN TC- Goeckner:2018:UPW SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1570] Bennet Goeckner, Corbin Groothuis, //www.sciencedirect.com/science/ Cyrus Hettle, Brian Kell, Pamela article/pii/S0304397518300562. Kirkpatrick, Rachel Kirsch, and Ryan Kayibi:2018:TTM Solava. Universal partial words over non-binary alphabets. Theoret- [1574] K. K. Kayibi and S. Pirzada. T - ical Computer Science, 713(??):56– tetrominoes tiling’s Markov chain 65, February 22, 2018. CODEN mixes fast. Theoretical Computer Sci- TCSCDI. ISSN 0304-3975 (print), ence, 714(??):1–14, March 1, 2018. 1879-2294 (electronic). URL http: CODEN TCSCDI. ISSN 0304- //www.sciencedirect.com/science/ 3975 (print), 1879-2294 (electronic). article/pii/S0304397517309179. URL http://www.sciencedirect. com/science/article/pii/S0304397517309155. Bille:2018:TST Lai:2018:EOT [1571] Philip Bille, Mikko Berggren Etti- enne, Inge Li Gørtz, and Hjalte Wedel [1575] Jianchang Lai, Yi Mu, Fuchun Guo, Vildhøj. Time-space trade-oﬀs for Rongmao Chen, and Sha Ma. Ef- Lempel–Ziv compressed indexing. The- ﬁcient k-out-of-n oblivious transfer oretical Computer Science, 713(??): scheme with the ideal communication 66–77, February 22, 2018. CODEN cost. Theoretical Computer Science, TCSCDI. ISSN 0304-3975 (print), 714(??):15–26, March 1, 2018. CODEN REFERENCES 248

TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517309143. article/pii/S0304397517308678. Cao:2018:OOD Anonymous:2018:EBk [1576] Huabin Cao, Bicheng Zhang, and [1580] Anonymous. Editorial Board. The- Zhiheng Zhou. One-to-one disjoint oretical Computer Science, 715(??): path covers in digraphs. Theo- ii, March 8, 2018. CODEN TC- retical Computer Science, 714(??): SCDI. ISSN 0304-3975 (print), 27–35, March 1, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518300732. //www.sciencedirect.com/science/ LeGuiban:2018:CPL article/pii/S0304397517308708. Docker:2018:ECP [1581] Kaourintin Le Guiban, Arpad Rim- mel, Marc-Antoine Weisser, and [1577] Janosch D¨ocker and Simone Linz. On Joanna Tomasik. Completion of par- the existence of a cherry-picking se- tial latin hypercube designs: NP- quence. Theoretical Computer Science, completeness and inapproximability. 714(??):36–50, March 1, 2018. CODEN Theoretical Computer Science, 715 TCSCDI. ISSN 0304-3975 (print), (??):1–20, March 8, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517308691. //www.sciencedirect.com/science/ article/pii/S0304397518300409. DiGiacomo:2018:DSP Jonsson:2018:TCN [1578] Emilio Di Giacomo, Giuseppe Liotta, and Fabrizio Montecchiani. Draw- [1582] Peter Jonsson and Johan Thapper. ing subcubic planar graphs with four Tractability conditions for numeric slopes and optimal angular resolu- CSPs. Theoretical Computer Science, tion. Theoretical Computer Science, 715(??):21–34, March 8, 2018. CODEN 714(??):51–73, March 1, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518300392. article/pii/S030439751730868X. Lintzmayer:2018:SPB Gregor:2018:TGG [1583] Carla Negri Lintzmayer, Guillaume [1579] Petr Gregor and Torsten M¨utze. Trim- Fertin, and Zanoni Dias. Sorting ming and gluing Gray codes. The- permutations and binary strings by oretical Computer Science, 714(??): length-weighted rearrangements. The- 74–95, March 1, 2018. CODEN oretical Computer Science, 715(??): REFERENCES 249

35–59, March 8, 2018. CODEN Anonymous:2018:EBl TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1587] Anonymous. Editorial Board. The- //www.sciencedirect.com/science/ oretical Computer Science, 716(??): article/pii/S030439751830032X. ii, ???? 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), Yo on:2018:GMA 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1584] Sang Duk Yoon, Min-Gyu Kim, article/pii/S0304397518300902. Wanbin Son, and Hee-Kap Ahn. Geometric matching algorithms for Chaudhuri:2018:SIA two realistic terrains. Theoreti- cal Computer Science, 715(??):60– [1588] Kamalika Chaudhuri and Claudio Gen- 70, March 8, 2018. CODEN TC- tile. Special issue on ALT 2015: SCDI. ISSN 0304-3975 (print), Guest Editors’ introduction. The- 1879-2294 (electronic). URL http: oretical Computer Science, 716(??): //www.sciencedirect.com/science/ 1–3, ???? 2018. CODEN TC- article/pii/S0304397518300318. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Duchene:2018:SOP //www.sciencedirect.com/science/ article/pii/S0304397518300860.

[1585] Eric Duchˆene, Marc Heinrich, Urban Hermo:2018:ELM Larsson, and Aline Parreau. The switch operators and push-the-button [1589] Montserrat Hermo and Ana Ozaki. games: A sequential compound over Exact learning of multivalued depen- rulesets. Theoretical Computer Science, dency formulas. Theoretical Com- 715(??):71–85, March 8, 2018. CODEN puter Science, 716(??):4–14, ???? TCSCDI. ISSN 0304-3975 (print), 2018. CODEN TCSCDI. ISSN 0304- 1879-2294 (electronic). URL http: 3975 (print), 1879-2294 (electronic). //www.sciencedirect.com/science/ URL http://www.sciencedirect. article/pii/S0304397518300148. com/science/article/pii/S0304397517308484.

Capdevielle:2018:CBA Abasi:2018:NAL

[1586] Claire Capdevielle, Colette Johnen, [1590] Hasan Abasi, Nader H. Bshouty, and and Alessia Milani. On the complexity Hanna Mazzawi. Non-adaptive learn- of basic abstractions to implement con- ing of a hidden hypergraph. The- sensus. Theoretical Computer Science, oretical Computer Science, 716(??): 715(??):86–96, March 8, 2018. CODEN 15–27, ???? 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518300057. article/pii/S0304397517308496. REFERENCES 250

Leike:2018:CSI Gao:2018:TCL

[1591] Jan Leike and Marcus Hutter. On [1595] Ziyuan Gao, Hans Ulrich Simon, the computability of Solomonoﬀ and Sandra Zilles. On the teach- induction and AIXI. Theoreti- ing complexity of linear sets. The- cal Computer Science, 716(??):28– oretical Computer Science, 716(??): 49, ???? 2018. CODEN TC- 107–123, ???? 2018. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517308502. article/pii/S030439751730854X.

Orabona:2018:SFO Yang:2018:BMR [1592] Francesco Orabona and Dávid Pál. [1596] Liu Yang, Steve Hanneke, and Jaime Scale-free online learning. Theoret- Carbonell. Bounds on the minimax ical Computer Science, 716(??):50– rate for estimating a prior over a 69, ???? 2018. CODEN TC- VC class from independent learning SCDI. ISSN 0304-3975 (print), tasks. Theoretical Computer Science, 1879-2294 (electronic). URL http: 716(??):124–140, ???? 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517308514. 1879-2294 (electronic). URL http: Darnstadt:2018:HDF //www.sciencedirect.com/science/ article/pii/S0304397517308551. [1593] Malte Darnstädt, Christoph Ries, and Hans Ulrich Simon. Hierarchical design Anonymous:2018:EBm of fast Minimum Disagreement algorithms. Theoretical Computer Science, [1597] Anonymous. Editorial Board. The- 716(??):70–88, ???? 2018. CODEN oretical Computer Science, 717(??): TCSCDI. ISSN 0304-3975 (print), ii, ???? 2018. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517308526. //www.sciencedirect.com/science/ article/pii/S0304397518301051. Balle:2018:GBL Dondi:2018:E [1594] Borja Balle and Mehryar Mohri. Generalization bounds for learn- [1598] Riccardo Dondi, Guillaume Fertin, ing weighted automata. Theoret- and Giancarlo Mauri. Editorial. ical Computer Science, 716(??):89– Theoretical Computer Science, 717 106, ???? 2018. CODEN TC- (??):1, ???? 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517308538. article/pii/S0304397518301014. REFERENCES 251

Bazgan:2018:MFU Theoretical Computer Science, 717 (??):47–61, ???? 2018. CODEN [1599] Cristina Bazgan, Ljiljana Brankovic, TCSCDI. ISSN 0304-3975 (print), Katrin Casel, Henning Fernau, Klaus 1879-2294 (electronic). URL http: Jansen, Kim-Manuel Klein, Michael //www.sciencedirect.com/science/ Lampis, Mathieu Liedloff, Jérôme article/pii/S0304397517304607. Monnot, and Vangelis Th. Paschos. The many facets of upper domina- Kaklamanis:2018:NFG tion. Theoretical Computer Science, [1603] Christos Kaklamanis, Panagiotis Kanel- 717(??):2–25, ???? 2018. CODEN lopoulos, and Sophia Tsokana. On TCSCDI. ISSN 0304-3975 (print), network formation games with het- 1879-2294 (electronic). URL http: erogeneous players and basic net- //www.sciencedirect.com/science/ work creation games. Theoreti- article/pii/S0304397517305145. cal Computer Science, 717(??):62– Bredereck:2018:PCT 72, ???? 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), [1600] Robert Bredereck, Jiehua Chen, Falk 1879-2294 (electronic). URL http: Hüffner, and Stefan Kratsch. Pa- //www.sciencedirect.com/science/ rameterized complexity of team for- article/pii/S0304397517302803. mation in social networks. The- oretical Computer Science, 717(??): Bellitto:2018:SCT 26–36, ???? 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), [1604] Thomas Bellitto. Separating codes 1879-2294 (electronic). URL http: and traffic monitoring. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 717(??):73– article/pii/S0304397517304644. 85, ???? 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), Goldwurm:2018:CCR 1879-2294 (electronic). URL http: [1601] Massimiliano Goldwurm, Jianyi Lin, //www.sciencedirect.com/science/ and Francesco Saccà. On the com- article/pii/S0304397517302839. plexity of clustering with relaxed Anonymous:2018:EBn size constraints in fixed dimension. Theoretical Computer Science, 717 [1605] Anonymous. Editorial Board. The- (??):37–46, ???? 2018. CODEN oretical Computer Science, 718(??): TCSCDI. ISSN 0304-3975 (print), ii, March 29, 2018. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517304619. //www.sciencedirect.com/science/ article/pii/S0304397518301129. Georgiou:2018:KWP Petreschi:2018:P [1602] Konstantinos Georgiou, George Karakostas, Evangelos Kranakis, and Danny Kri- [1606] Rossella Petreschi and Mohammad zanc. Know when to persist: De- Kaykobad. Preface. Theoret- riving value from a stream buffer. ical Computer Science, 718(??):1, REFERENCES 252

March 29, 2018. CODEN TC- Gragera:2018:RTI SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1610] Alonso Gragera and Vorapong Sup- //www.sciencedirect.com/science/ pakitpaisarn. Relaxed triangle in- article/pii/S0304397518301154. equality ratio of the Sørensen–Dice and Tversky indexes. Theoreti- Bae:2018:CMW cal Computer Science, 718(??):37– 45, March 29, 2018. CODEN TC- [1607] Sang Won Bae. Computing a SCDI. ISSN 0304-3975 (print), minimum-width square annulus in 1879-2294 (electronic). URL http: arbitrary orientation. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 718(??):2–13, article/pii/S0304397517300361. March 29, 2018. CODEN TC- Calamoneri:2018:DTG SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1611] Tiziana Calamoneri, Angelo Monti, //www.sciencedirect.com/science/ and Rossella Petreschi. On dynamic article/pii/S0304397516306053. threshold graphs and related classes. Theoretical Computer Science, 718(??): Bae:2018:CPC 46–57, March 29, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1608] Sang Won Bae, Hwan-Gue Cho, 1879-2294 (electronic). URL http: William Evans, Noushin Saeedi, and //www.sciencedirect.com/science/ Chan-Su Shin. Covering points with article/pii/S0304397517300397. convex sets of minimum size. The- oretical Computer Science, 718(??): Hasegawa:2018:OOA 14–23, March 29, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1612] Shun Hasegawa and Toshiya Itoh. Op- 1879-2294 (electronic). URL http: timal online algorithms for the multi- //www.sciencedirect.com/science/ objective time series search problem. article/pii/S0304397516306090. Theoretical Computer Science, 718(??): 58–66, March 29, 2018. CODEN Czibula:2018:LRV TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1609] Oliver G. Czibula, Hanyu Gu, and //www.sciencedirect.com/science/ Yakov Zinder. Lagrangian re- article/pii/S0304397517300403. laxation versus genetic algorithm Anonymous:2018:EBo based metaheuristic for a large partitioning problem. Theoreti- [1613] Anonymous. Editorial Board. The- cal Computer Science, 718(??):24– oretical Computer Science, 719(??): 36, March 29, 2018. CODEN TC- ii, April 6, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517300348. article/pii/S030439751830135X. REFERENCES 253

Greenhill:2018:SMC TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1614] Catherine Greenhill and Matteo Sfra- //www.sciencedirect.com/science/ gara. The switch Markov chain for sam- article/pii/S030439751730837X. pling irregular graphs and digraphs. Theoretical Computer Science, 719 Barash:2018:LSR (??):1–20, April 6, 2018. CODEN [1618] Mikhail Barash and Alexander Okhotin. TCSCDI. ISSN 0304-3975 (print), Linear-space recognition for gram- 1879-2294 (electronic). URL http: mars with contexts. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 719(??):73– article/pii/S030439751730840X. 85, April 6, 2018. CODEN TC- Schridde:2018:CGP SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1615] Christian Schridde. On the construc- //www.sciencedirect.com/science/ tion of graphs with a planar bipar- article/pii/S0304397517308368. tite double cover from boolean formulas and its application to count- Teh:2018:SUP ing satisfying solutions. Theoret- [1619] Wen Chean Teh, Adrian Atanasiu, ical Computer Science, 719(??):21– and Ghajendran Poovanandran. On 45, April 6, 2018. CODEN TC- strongly M-unambiguous prints and SCDI. ISSN 0304-3975 (print), Serb˘anut˘a’s conjecture for Parikh ma- 1879-2294 (electronic). URL http: trices. Theoretical Computer Science, //www.sciencedirect.com/science/ 719(??):86–93, April 6, 2018. CODEN article/pii/S0304397517308393. TCSCDI. ISSN 0304-3975 (print), Golovnev:2018:GEC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1616] Alexander Golovnev, Alexander S. Ku- article/pii/S0304397517308460. likov, Alexander V. Smal, and Sug- Anonymous:2018:EBp uru Tamaki. Gate elimination: Cir- cuit size lower bounds and #SAT upper [1620] Anonymous. Editorial Board. The- bounds. Theoretical Computer Science, oretical Computer Science, 720(??): 719(??):46–63, April 6, 2018. CODEN ii, April 11, 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517308381. article/pii/S0304397518301518. Bang-Jensen:2018:DRP Sima:2018:QPE [1617] J. Bang-Jensen, S. Bessy, F. Havet, [1621] Jir´ıS´ıma and Petr Savick´y. Quasi- and A. Yeo. Out-degree reduc- periodic β-expansions and cut lan- ing partitions of digraphs. The- guages. Theoretical Computer Science, oretical Computer Science, 719(??): 720(??):1–23, April 11, 2018. CODEN 64–72, April 6, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), REFERENCES 254

1879-2294 (electronic). URL http: (??):55–63, April 11, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518301257. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Sultana:2018:RGT article/pii/S0304397518300859. [1622] Shaheena Sultana and Md. Saidur Rah- Furst:2018:LSL man. Realizability of graphs as triangle cover contact graphs. The- [1626] Maximilian F¨urst, Marilena Leichter, oretical Computer Science, 720(??): and Dieter Rautenbach. Locally search- 24–35, April 11, 2018. CODEN ing for large induced matchings. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 720(??): 1879-2294 (electronic). URL http: 64–72, April 11, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518301245. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Boyar:2018:MCV article/pii/S0304397518300835. [1623] Joan Boyar and Magnus Gausdal Anonymous:2018:EBq Find. Multiplicative complexity of vector valued Boolean functions. The- [1627] Anonymous. Editorial Board. The- oretical Computer Science, 720(??): oretical Computer Science, 721(??): 36–46, April 11, 2018. CODEN ii, April 18, 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518301208. article/pii/S0304397518301579. Shan:2018:INN Moulton:2018:UNE [1624] Liren Shan, Huan Li, and Zhongzhi [1628] Vincent Moulton, Andreas Spill- Zhang. Independence number and ner, and Taoyang Wu. UPGMA the number of maximum indepen- and the normalized equidistant min- dent sets in pseudofractal scale-free imum evolution problem. Theo- web and Sierpi´nski gasket. The- retical Computer Science, 721(??): oretical Computer Science, 720(??): 1–15, April 18, 2018. CODEN 47–54, April 11, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518300690. article/pii/S0304397518301191. Cheng:2018:BCM Repke:2018:SPB [1629] Chu-Han Cheng, Po-An Chen, and [1625] Damian Repke and Wojciech Ryt- Wing-Kai Hon. Budget-constrained ter. On semi-perfect de Bruijn words. multi-battle contests: A new per- Theoretical Computer Science, 720 spective and analysis. Theoreti- REFERENCES 255

cal Computer Science, 721(??):16– with time-dependent processing times. 26, April 18, 2018. CODEN TC- Theoretical Computer Science, 721 SCDI. ISSN 0304-3975 (print), (??):70–77, April 18, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518300653. //www.sciencedirect.com/science/ article/pii/S0304397517308654. Liu:2018:TAP Anonymous:2018:EBr [1630] Zhiqiang Liu, Yukiko Yamauchi, Shuji Kijima, and Masafumi Yamashita. [1634] Anonymous. Editorial Board. The- Team assembling problem for asyn- oretical Computer Science, 722(??): chronous heterogeneous mobile robots. ii, April 25, 2018. CODEN TC- Theoretical Computer Science, 721 SCDI. ISSN 0304-3975 (print), (??):27–41, April 18, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518301634. //www.sciencedirect.com/science/ Bizjak:2018:MGR article/pii/S030439751830029X. Bezrukov:2018:NIF [1635] Ales Bizjak and Lars Birkedal. A model of guarded recursion via gen- [1631] Sergei Bezrukov, Pavle Bulatovic, and eralised equilogical spaces. Theo- Nikola Kuzmanovski. New inﬁnite retical Computer Science, 722(??): family of regular edge-isoperimetric 1–18, April 25, 2018. CODEN graphs. Theoretical Computer Science, TCSCDI. ISSN 0304-3975 (print), 721(??):42–53, April 18, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518300951. //www.sciencedirect.com/science/ Bravetti:2018:BBD article/pii/S0304397518300021. Altman:2018:ISA [1636] Mario Bravetti, Marco Carbone, and Gianluigi Zavattaro. On the bound- [1632] Harry Altman. Internal structure of ary between decidability and undecid- addition chains: Well-ordering. The- ability of asynchronous session subtyp- oretical Computer Science, 721(??): ing. Theoretical Computer Science, 722 54–69, April 18, 2018. CODEN (??):19–51, April 25, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517308666. article/pii/S0304397518300938. Ouazene:2018:IPM Zhang:2018:HVU [1633] Yassine Ouazene and Farouk Yalaoui. [1637] Min Zhang and Kazuhiro Ogata. From Identical parallel machine scheduling hidden to visible: A uniﬁed frame- REFERENCES 256

work for transforming behavioral the- Angelini:2018:FBP ories into rewrite theories. The- oretical Computer Science, 722(??): [1641] Patrizio Angelini, Michael A. Bekos, 52–75, April 25, 2018. CODEN Michael Kaufmann, Philipp Kinder- TCSCDI. ISSN 0304-3975 (print), mann, and Thomas Schneck. 1- 1879-2294 (electronic). URL http: fan-bundle-planar drawings of graphs. //www.sciencedirect.com/science/ Theoretical Computer Science, 723 article/pii/S0304397518300173. (??):23–50, May 2, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Anonymous:2018:EBs 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ article/pii/S0304397518301440. [1638] Anonymous. Editorial Board. The- oretical Computer Science, 723(??): Canard:2018:NTC ii, May 2, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), [1642] S. Canard, D. H. Phan, D. Pointcheval, 1879-2294 (electronic). URL http: and V. C. Trinh. A new tech- //www.sciencedirect.com/science/ nique for compacting ciphertext in article/pii/S0304397518301877. multi-channel broadcast encryption and attribute-based encryption. The- Adil:2018:PAS oretical Computer Science, 723(??): 51–72, May 2, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1639] Deeksha Adil, Sushmita Gupta, San- 1879-2294 (electronic). URL jukta Roy, Saket Saurabh, and http: Meirav Zehavi. Parameterized al- //www.sciencedirect.com/science/ . gorithms for stable matching with article/pii/S0304397518301427 ties and incomplete lists. Theo- Yang:2018:OBM retical Computer Science, 723(??):1– 10, May 2, 2018. CODEN TC- [1643] Yi-Hua Yang, Chung-Shou Liao, Xin SCDI. ISSN 0304-3975 (print), Han, and Louxin Zhang. Online 1879-2294 (electronic). URL http: buﬀer management for transmitting //www.sciencedirect.com/science/ packets with processing cycles. The- article/pii/S0304397518301762. oretical Computer Science, 723(??): 73–83, May 2, 2018. CODEN Kolpakov:2018:NGR TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1640] Roman Kolpakov. On the number //www.sciencedirect.com/science/ of gapped repeats with arbitrary gap. article/pii/S0304397518301385. Theoretical Computer Science, 723 Anonymous:2018:EBt (??):11–22, May 2, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1644] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 724(??): //www.sciencedirect.com/science/ ii, May 9, 2018. CODEN TC- article/pii/S0304397518301464. SCDI. ISSN 0304-3975 (print), REFERENCES 257

1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518301932. //www.sciencedirect.com/science/ article/pii/S0304397517309076. Kari:2018:Ea Pan:2018:LGA [1645] Lila Kari. Editorial. Theo- retical Computer Science, 724(??): [1649] Linqiang Pan, Bosheng Song, At- iii, May 9, 2018. CODEN TC- ulya K. Nagar, and K. G. Subra- SCDI. ISSN 0304-3975 (print), manian. Language generating alpha- 1879-2294 (electronic). URL http: betic flat splicing P systems. The- //www.sciencedirect.com/science/ oretical Computer Science, 724(??): article/pii/S0304397518302020. 28–34, May 9, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Martinez-del-Amor:2018:P 1879-2294 (electronic). URL http: [1646] Miguel A.´ Mart´ınez del Amor, Agust´ın //www.sciencedirect.com/science/ Riscos-Núñez, and Luis Valencia- article/pii/S0304397517309064. Cabrera. Preface. Theoreti- Kantor:2018:CLC cal Computer Science, 724(??):1– 2, May 9, 2018. CODEN TC- [1650] Kristóf Kántor and György Vaszil. SCDI. ISSN 0304-3975 (print), On the classes of languages charac- 1879-2294 (electronic). URL http: terized by generalized P colony au- //www.sciencedirect.com/science/ tomata. Theoretical Computer Science, article/pii/S030439751730912X. 724(??):35–44, May 9, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Zhang:2018:CPE 1879-2294 (electronic). URL http: [1647] Zhiqiang Zhang, Yansen Su, and //www.sciencedirect.com/science/ Linqiang Pan. The computational article/pii/S0304397517309027. power of enzymatic numerical P sys- Gheorghe:2018:KSM tems working in the sequential mode. Theoretical Computer Science, 724 [1651] Marian Gheorghe, Rodica Ceterchi, (??):3–12, May 9, 2018. CODEN Florentin Ipate, Savas Konur, and TCSCDI. ISSN 0304-3975 (print), Raluca Lefticaru. Kernel P systems: 1879-2294 (electronic). URL http: From modelling to verification and test- //www.sciencedirect.com/science/ ing. Theoretical Computer Science, article/pii/S0304397517309088. 724(??):45–60, May 9, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Wu:2018:SNS 1879-2294 (electronic). URL http: [1648] Tingfang Wu, Yanfeng Wang, Suxia //www.sciencedirect.com/science/ Jiang, Yansen Su, and Xiaolong Shi. article/pii/S0304397517309015. Spiking neural P systems with rules Ciencialova:2018:GCP on synapses and anti-spikes. The- oretical Computer Science, 724(??): [1652] Lucie Ciencialová, Ludek Cienciala, 13–27, May 9, 2018. CODEN and Petr Sos´ık. Generalized P REFERENCES 258

colonies with passive environment. Acharyya:2018:MWC Theoretical Computer Science, 724 (??):61–68, May 9, 2018. CODEN [1656] Ankush Acharyya, Subhas C. Nandy, TCSCDI. ISSN 0304-3975 (print), and Sasanka Roy. Minimum width 1879-2294 (electronic). URL http: color spanning annulus. Theoret- //www.sciencedirect.com/science/ ical Computer Science, 725(??):16– article/pii/S030439751730899X. 30, May 16, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), Wu:2018:SRA 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1653] Zijun Wu, Rolf H. Möhring, and Jian- article/pii/S0304397517308617. hui Lai. Stochastic runtime analy- Flores-Lamas:2018:AFM sis of a cross-entropy algorithm for traveling salesman problems. The- [1657] Alejandro Flores-Lamas, José Alberto oretical Computer Science, 724(??): Fernández-Zepeda, and Joel Antonio 69–86, May 9, 2018. CODEN Trejo-Sánchez. Algorithm to find TCSCDI. ISSN 0304-3975 (print), a maximum 2-packing set in a cac- 1879-2294 (electronic). URL http: tus. Theoretical Computer Science, 725 //www.sciencedirect.com/science/ (??):31–51, May 16, 2018. CODEN article/pii/S0304397517307405. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Anonymous:2018:EBu //www.sciencedirect.com/science/ article/pii/S0304397517308605. [1654] Anonymous. Editorial board. The- oretical Computer Science, 725(??): Larsson:2018:GCT ii, May 16, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), [1658] Urban Larsson, Richard J. Nowakowski, 1879-2294 (electronic). URL http: and Carlos P. Santos. Game com- //www.sciencedirect.com/science/ parison through play. Theoreti- article/pii/S0304397518302135. cal Computer Science, 725(??):52– 63, May 16, 2018. CODEN TC- Cohen:2018:SGG SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1655] Nathann Cohen, N´ıcolas A. Mar- //www.sciencedirect.com/science/ tins, Fionn Mc Inerney, Nicolas Nisse, article/pii/S0304397517308599. Stéphane Pérennes, and Rudini Sam- Jin:2018:NLT paio. Spy-game on graphs: Com- plexity and simple topologies. The- [1659] Kai Jin, Jian Li, Haitao Wang, Bowei oretical Computer Science, 725(??): Zhang, and Ningye Zhang. Near- 1–15, May 16, 2018. CODEN linear time approximation schemes for TCSCDI. ISSN 0304-3975 (print), geometric maximum coverage. The- 1879-2294 (electronic). URL http: oretical Computer Science, 725(??): //www.sciencedirect.com/science/ 64–78, May 16, 2018. CODEN article/pii/S0304397517308459. TCSCDI. ISSN 0304-3975 (print), REFERENCES 259

1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517308563. article/pii/S0304397518300781.

Hong:2018:SAT Fox:2018:EES

[1660] Seok-Hee Hong and Hiroshi Nag- [1664] Kyle Fox, Sungjin Im, and Benjamin amochi. Simpler algorithms for Moseley. Energy efficient schedul- testing two-page book embedding ing of parallelizable jobs. Theo- of partitioned graphs. Theoreti- retical Computer Science, 726(??): cal Computer Science, 725(??):79– 30–40, May 23, 2018. CODEN 98, May 16, 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751830118X. article/pii/S0304397515012207. Biely:2018:GDC Anonymous:2018:EBv [1665] Martin Biely, Peter Robinson, Ul- [1661] Anonymous. Editorial Board. The- rich Schmid, Manfred Schwarz, and oretical Computer Science, 726(??): Kyrill Winkler. Gracefully degrad- ii, May 23, 2018. CODEN TC- ing consensus and k-set agreement SCDI. ISSN 0304-3975 (print), in directed dynamic networks. The- 1879-2294 (electronic). URL http: oretical Computer Science, 726(??): //www.sciencedirect.com/science/ 41–77, May 23, 2018. CODEN article/pii/S0304397518302263. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Gamard:2018:ACF //www.sciencedirect.com/science/ article/pii/S0304397518301166. [1662] Guilhem Gamard, Pascal Ochem, Gwenaël Richomme, and Patrice Dey:2018:CMP Séébold. Avoidability of circular formulas. Theoretical Computer Science, [1666] Palash Dey, Neeldhara Misra, and 726(??):1–4, May 23, 2018. CODEN Y. Narahari. Complexity of manipu- TCSCDI. ISSN 0304-3975 (print), lation with partial information in vot- 1879-2294 (electronic). URL http: ing. Theoretical Computer Science, 726 //www.sciencedirect.com/science/ (??):78–99, May 23, 2018. CODEN article/pii/S0304397517308447. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Chen:2018:SMM //www.sciencedirect.com/science/ article/pii/S0304397518301737. [1663] Yangjun Chen and Yujia Wu. On the string matching with k mismatches. Anonymous:2018:EBw Theoretical Computer Science, 726 (??):5–29, May 23, 2018. CODEN [1667] Anonymous. Editorial board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 727(??): REFERENCES 260

ii, May 30, 2018. CODEN TC- Anonymous:2018:EBx SCDI. ISSN 0304-3975 (print), 1879- 2294 (electronic). URL https:/ [1671] Anonymous. Editorial board. The- /www.sciencedirect.com/science/ oretical Computer Science, 728(??): article/pii/S0304397518302482. ii, June 5, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), 1879- 2294 (electronic). URL Alqarni:2018:ISP https:/ /www.sciencedirect.com/science/ article/pii/S0304397518302548. [1668] Mohammad Alqarni and Ryszard Jan- icki. Interval semantics for Petri Cheng:2018:CEF nets with inhibitor arcs. Theoret- [1672] Qi Cheng, Pingshan Li, and Min ical Computer Science, 727(??):1– Xu. Conditional (edge-)fault-tolerant 23, May 30, 2018. CODEN TC- strong Menger (edge) connectivity SCDI. ISSN 0304-3975 (print), 1879- of folded hypercubes. Theoreti- 2294 (electronic). URL https:/ cal Computer Science, 728(??):1– /www.sciencedirect.com/science/ 8, June 5, 2018. CODEN TC- article/pii/S0304397518301415. SCDI. ISSN 0304-3975 (print), 1879- 2294 (electronic). URL https:/ Chen:2018:PTA /www.sciencedirect.com/science/ article/pii/S0304397518301725. [1669] Taolue Chen, Tingting Han, and Yongzhi Cao. Polynomial-time al- Huang:2018:RAG gorithms for computing distances of [1673] Yanze Huang, Limei Lin, and Dajin fuzzy transition systems. Theoret- Wang. On the reliability of alter- ical Computer Science, 727(??):24– nating group graph-based networks. 36, May 30, 2018. CODEN TC- Theoretical Computer Science, 728 SCDI. ISSN 0304-3975 (print), 1879- (??):9–28, June 5, 2018. CODEN 2294 (electronic). URL https:/ TCSCDI. ISSN 0304-3975 (print), /www.sciencedirect.com/science/ 1879-2294 (electronic). URL https: article/pii/S0304397518301403. //www.sciencedirect.com/science/ article/pii/S0304397518301713. Enqvist:2018:CMC Engelfriet:2018:MCF [1670] Sebastian Enqvist, Fatemeh Seifan, [1674] Joost Engelfriet, Andreas Maletti, and Yde Venema. Completeness for and Sebastian Maneth. Multiple the modal µ-calculus: Separating the context-free tree grammars: Lexical- combinatorics from the dynamics. The- ization and characterization. The- oretical Computer Science, 727(??): oretical Computer Science, 728(??): 37–100, May 30, 2018. CODEN 29–99, June 5, 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879- 1879-2294 (electronic). URL https: 2294 (electronic). URL https:/ //www.sciencedirect.com/science/ /www.sciencedirect.com/science/ article/pii/S0304397518301397. article/pii/S0304397518301750. REFERENCES 261

Anonymous:2018:EBy Buning:2018:FRO [1675] Anonymous. Editorial board. The- [1679] Hans Kleine Büning, Piotr Woj- oretical Computer Science, 729(??): ciechowski, and K. Subramani. Find- ii, June 12, 2018. CODEN TC- ing read-once resolution refutations SCDI. ISSN 0304-3975 (print), in systems of 2CNF clauses. The- 1879-2294 (electronic). URL http: oretical Computer Science, 729(??): //www.sciencedirect.com/science/ 42–56, June 12, 2018. CODEN article/pii/S0304397518302822. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Yamanaka:2018:SCT //www.sciencedirect.com/science/ [1676] Katsuhisa Yamanaka, Takashi Horiyama, article/pii/S0304397518300793. J. Mark Keil, David Kirkpatrick, Yota Sheikhi:2018:PMB Otachi, Toshiki Saitoh, Ryuhei Ue- hara, and Yushi Uno. Swapping [1680] Farnaz Sheikhi and Ali Mohades. Pla- colored tokens on graphs. Theo- nar maximum-box problem revisited. retical Computer Science, 729(??): Theoretical Computer Science, 729 1–10, June 12, 2018. CODEN (??):57–67, June 12, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518301774. article/pii/S0304397518300045. Araujo:2018:RFA Bereg:2018:OSC [1677] Júlio Araújo, Julien Baste, and Ig- [1681] Sergey Bereg, Binay Bhattacharya, nasi Sau. Ruling out FPT algo- Sandip Das, Tsunehiko Kameda, Priya rithms for weighted coloring on forests. Ranjan Sinha Mahapatra, and Zhao Theoretical Computer Science, 729 Song. Optimizing squares cover- (??):11–19, June 12, 2018. CODEN ing a set of points. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 729(??):68– 1879-2294 (electronic). URL http: 83, June 12, 2018. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397518301749. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Giraudo:2018:AAA article/pii/S0304397515011159. [1678] Samuele Giraudo and Stéphane Vialette. Anonymous:2018:EBz Algorithmic and algebraic aspects of unshuffling permutations. The- [1682] Anonymous. Editorial board. The- oretical Computer Science, 729(??): oretical Computer Science, 730(??): 20–41, June 12, 2018. CODEN ii, June 19, 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518300847. article/pii/S0304397518302883. REFERENCES 262

Ling:2018:LBG //www.sciencedirect.com/science/ article/pii/S030439751830183X. [1683] San Ling, Khoa Nguyen, Adeline Roux- Langlois, and Huaxiong Wang. A Anonymous:2018:EBba lattice-based group signature scheme with veriﬁer-local revocation. The- [1687] Anonymous. Editorial board. The- oretical Computer Science, 730(??): oretical Computer Science, 731(??): 1–20, June 19, 2018. CODEN ii, June 30, 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518302056. article/pii/S0304397518303207. Basavaraju:2018:KCS Salem:2018:SOS

[1684] Manu Basavaraju, Fahad Panolan, [1688] Iosif Salem, Elad M. Schiller, Ma- Ashutosh Rai, M. S. Ramanujan, and rina Papatriantaﬁlou, and Philippas Saket Saurabh. On the kerneliza- Tsigas. Shared-object system equi- tion complexity of string problems. libria: Delay and throughput analy- Theoretical Computer Science, 730 sis. Theoretical Computer Science, 731 (??):21–31, June 19, 2018. CODEN (??):1–27, June 30, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518301993. article/pii/S0304397518302081. Bresar:2018:CID Wang:2018:TPM

[1685] Bostjan Bresar, Tanja Gologranc, and [1689] Fan Wang and Wuyang Sun. A Tim Kos. Convex and isometric dom- type of perfect matchings extend to ination of (weak) dominating pair Hamiltonian cycles in k-ary n-cubes. graphs. Theoretical Computer Science, Theoretical Computer Science, 731 730(??):32–43, June 19, 2018. CODEN (??):28–35, June 30, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518301981. article/pii/S030439751830207X. Quaglia:2018:SVA Dey:2018:MEN

[1686] Elizabeth A. Quaglia and Ben Smyth. [1690] Palash Dey. Manipulative elicita- Secret, veriﬁable auctions from election — a new attack on elections tions. Theoretical Computer Science, with incomplete preferences. The- 730(??):44–92, June 19, 2018. CODEN oretical Computer Science, 731(??): TCSCDI. ISSN 0304-3975 (print), 36–49, June 30, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), REFERENCES 263

1879-2294 (electronic). URL http: 99–117, June 30, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518302068. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ He:2018:SME article/pii/S0304397518302184. [1691] Shengjie He, Rong-Xia Hao, and Ed- Anonymous:2018:EBbb die Cheng. Strongly Menger-edge- connectedness and strongly Menger- [1695] Anonymous. Editorial board. The- vertex-connectedness of regular net- oretical Computer Science, 732(??): works. Theoretical Computer Science, ii, July 7, 2018. CODEN TC- 731(??):50–67, June 30, 2018. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518303268. article/pii/S0304397518302093. Masse:2018:LRP Case:2018:MDR [1696] Alexandre Blondin Massé, Julien [1692] Adam Case and Jack H. Lutz. Mu- de Carufel, Alain Goupil, Mélodie La- tual dimension and random sequences. pointe, Emile´ Nadeau, and Elise´ Van- Theoretical Computer Science, 731 domme. Leaf realization problem, (??):68–87, June 30, 2018. CODEN caterpillar graphs and prefix normal TCSCDI. ISSN 0304-3975 (print), words. Theoretical Computer Science, 1879-2294 (electronic). URL http: 732(??):1–13, July 7, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518302172. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Araujo:2018:DIC article/pii/S030439751830241X. [1693] João Araújo, Michael Kinyon, Janusz vanEe:2018:ACM Konieczny, and António Malheiro. De- cidability and independence of con- [1697] Martijn van Ee and René Sitters. Ap- jugacy problems in finitely presented proximation and complexity of multi- monoids. Theoretical Computer Sci- target graph search and the Cana- ence, 731(??):88–98, June 30, 2018. dian traveler problem. Theoreti- CODEN TCSCDI. ISSN 0304- cal Computer Science, 732(??):14– 3975 (print), 1879-2294 (electronic). 25, July 7, 2018. CODEN TC- URL http://www.sciencedirect. SCDI. ISSN 0304-3975 (print), com/science/article/pii/S03043975183021601879-2294. (electronic). URL http: //www.sciencedirect.com/science/ Kelk:2018:TDP article/pii/S0304397518302445. [1694] Steven Kelk, Georgios Stamoulis, Dang:2018:CET and Taoyang Wu. Treewidth distance on phylogenetic trees. The- [1698] Chuangyin Dang and Yinyu Ye. oretical Computer Science, 731(??): On the complexity of an expanded REFERENCES 264

Tarski’s ﬁxed point problem under //www.sciencedirect.com/science/ the componentwise ordering. The- article/pii/S0304397518302573. oretical Computer Science, 732(??): 26–45, July 7, 2018. CODEN Demaine:2018:SPP TCSCDI. ISSN 0304-3975 (print), [1702] Erik D. Demaine and Mikhail Rudoy. 1879-2294 (electronic). URL http: A simple proof that the (n2 − 1)-puzzle //www.sciencedirect.com/science/ is hard. Theoretical Computer Science, article/pii/S0304397518302433. See 732(??):80–84, July 7, 2018. CODEN erratum/correction [2417]. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Farr:2018:SGF //www.sciencedirect.com/science/ . [1699] Graham Farr and Nhan Bao Ho. article/pii/S0304397518302652 The Sprague–Grundy function for Halava:2018:FPR some nearly disjunctive sums of Nim and Silver Dollar games. Theoret- [1703] Vesa Halava, Tero Harju, and Esa ical Computer Science, 732(??):46– Sahla. On ﬁxed points of ra- 59, July 7, 2018. CODEN TC- tional transductions. Theoreti- SCDI. ISSN 0304-3975 (print), cal Computer Science, 732(??):85– 1879-2294 (electronic). URL http: 88, July 7, 2018. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397518302615. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Vagvolgyi:2018:DRT article/pii/S0304397518302640.

[1700] Sándor Vágvölgyi. Descendants of Anonymous:2018:EBbc a recognizable tree language for pre- [1704] Anonymous. Editorial board. The- fix constrained linear monadic term oretical Computer Science, 733(??): rewriting with position cutting strat- ii, ???? 2018. CODEN TC- egy. Theoretical Computer Science, SCDI. ISSN 0304-3975 (print), 732(??):60–72, July 7, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518303463. //www.sciencedirect.com/science/ article/pii/S0304397518302603. Zeugmann:2018:GEF

Dekking:2018:FPH [1705] Thomas Zeugmann. Guest Edi- tor’s foreword [Preface: special is- [1701] Michel Dekking. The Frobenius prob- sue on learning theory and complex- lem for homomorphic embeddings of ity]. Theoretical Computer Science, languages into the integers. The- 733(??):1–3, ???? 2018. CODEN oretical Computer Science, 732(??): TCSCDI. ISSN 0304-3975 (print), 73–79, July 7, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518302718. REFERENCES 265

Bshouty:2018:ELH Kawachi:2018:CLB [1706] Nader H. Bshouty. Exact learn- [1710] Akinori Kawachi. Circuit lower bounds ing from an honest teacher that an- from learning-theoretic approaches. swers membership queries. Theo- Theoretical Computer Science, 733 retical Computer Science, 733(??): (??):83–98, ???? 2018. CODEN 4–43, ???? 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518302767. article/pii/S030439751830272X. Anonymous:2018:EBbd Fernau:2018:RSA [1711] Anonymous. Editorial board. The- [1707] Henning Fernau, Florin Manea, Robert oretical Computer Science, 734(??): Mercas, and Markus L. Schmid. Re- ii, July 22, 2018. CODEN TC- visiting Shinohara’s algorithm for com- SCDI. ISSN 0304-3975 (print), puting descriptive patterns. The- 1879-2294 (electronic). URL http: oretical Computer Science, 733(??): //www.sciencedirect.com/science/ 44–54, ???? 2018. CODEN TC- article/pii/S0304397518303530. SCDI. ISSN 0304-3975 (print), Zhu:2018:P 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1712] Daming Zhu and Sergey Bereg. Pref- article/pii/S0304397518302731. ace. Theoretical Computer Science, 734(??):1–2, July 22, 2018. CODEN Case:2018:EQK TCSCDI. ISSN 0304-3975 (print), [1708] John Case, Sanjay Jain, and Frank 1879-2294 (electronic). URL http: Stephan. Eﬀectivity questions for //www.sciencedirect.com/science/ Kleene’s recursion theorem. The- article/pii/S0304397518303499. oretical Computer Science, 733(??): Chen:2018:NGA 55–70, ???? 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), [1713] Zihe Chen, Danyang Chen, Xiangyu 1879-2294 (electronic). URL http: Wang, Robert J. Damiano, Hui Meng, //www.sciencedirect.com/science/ and Jinhui Xu. Novel geometric article/pii/S0304397518302743. approach for virtual coiling. The- oretical Computer Science, 734(??): Hutter:2018:TBS 3–14, July 22, 2018. CODEN [1709] Marcus Hutter. Tractability of batch TCSCDI. ISSN 0304-3975 (print), to sequential conversion. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 733(??):71– //www.sciencedirect.com/science/ 82, ???? 2018. CODEN TC- article/pii/S0304397518300987. SCDI. ISSN 0304-3975 (print), Zou:2018:FDD 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1714] Peng Zou, Hui Li, Wencheng Wang, article/pii/S0304397518302755. Chunlin Xin, and Binhai Zhu. Find- REFERENCES 266

ing disjoint dense clubs in a social net- Mei:2018:MDO work. Theoretical Computer Science, 734(??):15–23, July 22, 2018. CODEN [1718] Lili Mei, Deshi Ye, and Guochuan TCSCDI. ISSN 0304-3975 (print), Zhang. Mechanism design for one- 1879-2294 (electronic). URL http: facility location game with obnox- //www.sciencedirect.com/science/ ious eﬀects on a line. Theoret- article/pii/S0304397517307466. ical Computer Science, 734(??):46– 57, July 22, 2018. CODEN TC- Tong:2018:ASM SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1715] Weitian Tong, Eiji Miyano, Randy //www.sciencedirect.com/science/ Goebel, and Guohui Lin. An ap- article/pii/S0304397517306825. proximation scheme for minimizing the makespan of the parallel iden- Ma:2018:NPD tical multi-stage ﬂow-shops. The- oretical Computer Science, 734(??): [1719] Yuzhe Ma, Kun He, John Hopcroft, 24–31, July 22, 2018. CODEN and Pan Shi. Neighbourhood- TCSCDI. ISSN 0304-3975 (print), preserving dimension reduction via lo- 1879-2294 (electronic). URL http: calised multidimensional scaling. The- //www.sciencedirect.com/science/ oretical Computer Science, 734(??): article/pii/S0304397517306801. 58–71, July 22, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Li:2018:SMI 1879-2294 (electronic). URL http: [1716] Xingfu Li, Haodi Feng, Haotao Jiang, //www.sciencedirect.com/science/ . and Binhai Zhu. Solving the max- article/pii/S0304397517306837 imum internal spanning tree prob- Yang:2018:KSG lem on interval graphs in polynomial time. Theoretical Computer Science, [1720] Yongjie Yang, Yash Raj Shrestha, 734(??):32–37, July 22, 2018. CODEN Wenjun Li, and Jiong Guo. On TCSCDI. ISSN 0304-3975 (print), the kernelization of split graph prob- 1879-2294 (electronic). URL http: lems. Theoretical Computer Science, //www.sciencedirect.com/science/ 734(??):72–82, July 22, 2018. CODEN article/pii/S0304397517306795. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Pu:2018:CBG //www.sciencedirect.com/science/ [1717] Lianrong Pu, Yu Lin, Daming Zhu, and article/pii/S0304397517306850. Haitao Jiang. Can a breakpoint graph Liu:2018:PCM be decomposed into none other than 2- cycles? Theoretical Computer Science, [1721] Yunlong Liu, Shaokai Wang, and 734(??):38–45, July 22, 2018. CODEN Jianxin Wang. Parameterized count- TCSCDI. ISSN 0304-3975 (print), ing matching and packing: A fam- 1879-2294 (electronic). URL http: ily of hard problems that admit FP- //www.sciencedirect.com/science/ TRAS. Theoretical Computer Science, article/pii/S0304397517306813. 734(??):83–93, July 22, 2018. CODEN REFERENCES 267

TCSCDI. ISSN 0304-3975 (print), Chen:2018:AAS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1725] Zhi-Zhong Chen, Youta Harada, Fei article/pii/S0304397517306849. Guo, and Lusheng Wang. Approx- imation algorithms for the scaffolding problem and its generalizations. Feng:2018:DSP Theoretical Computer Science, 734(??): 131–141, July 22, 2018. CODEN [1722] Qilong Feng, Neng Huang, Xiong TCSCDI. ISSN 0304-3975 (print), Jiang, and Jianxin Wang. Deal- 1879-2294 (electronic). URL http: ing with several parameterized prob- //www.sciencedirect.com/science/ lems by random methods. The- article/pii/S0304397517302815. oretical Computer Science, 734(??): 94–104, July 22, 2018. CODEN Anonymous:2018:EBbe TCSCDI. ISSN 0304-3975 (print), [1726] Anonymous. Editorial board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 735(??): //www.sciencedirect.com/science/ ii, July 29, 2018. CODEN TC- article/pii/S0304397517306862. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Feng:2018:PAE //www.sciencedirect.com/science/ article/pii/S0304397518303591. [1723] Qilong Feng, Shaohua Li, Zeyang Zhou, and Jianxin Wang. Pa- Ouaknine:2018:RPS rameterized algorithms for edge bi- [1727] Joël Ouaknine, Igor Potapov, and clique and related problems. The- James Worrell. Reachability prob- oretical Computer Science, 734(??): lems 2014: Special issue. The- 105–118, July 22, 2018. CODEN oretical Computer Science, 735(??): TCSCDI. ISSN 0304-3975 (print), 1, July 29, 2018. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397517306898. //www.sciencedirect.com/science/ article/pii/S0304397518303621. Fallat:2018:CCG Demri:2018:EBM [1724] Shaun Fallat, Karen Meagher, Abol- [1728] Stéphane Demri, Amit Kumar Dhar, ghasem Soltani, and Boting Yang. and Arnaud Sangnier. Equivalence Compressed cliques graphs, clique cov- between model-checking flat counter erings and positive zero forcing. The- systems and Presburger arithmetic. oretical Computer Science, 734(??): Theoretical Computer Science, 735 119–130, July 22, 2018. CODEN (??):2–23, July 29, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517306278. article/pii/S0304397517305455. REFERENCES 268

Geeraerts:2018:SSS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1729] Gilles Geeraerts, Jo¨el Goossens, Thi- article/pii/S030439751730261X. Van-Anh Nguyen, and Am´elie Stainer. Synthesising succinct strategies in Haddad:2018:IIA safety games with an application [1733] Serge Haddad and Benjamin Mon- to real-time scheduling. Theoret- mege. Interval iteration algorithm ical Computer Science, 735(??):24– for MDPs and IMDPs. Theoreti- 49, July 29, 2018. CODEN TC- cal Computer Science, 735(??):111– SCDI. ISSN 0304-3975 (print), 131, July 29, 2018. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751730511X. //www.sciencedirect.com/science/ Hofman:2018:TIO article/pii/S0304397516307095.

[1730] Piotr Hofman and Patrick Totzke. Bazille:2018:CBT Trace inclusion for one-counter nets re- [1734] Hugo Bazille, Olivier Bournez, Walid visited. Theoretical Computer Science, Gomaa, and Amaury Pouly. On 735(??):50–63, July 29, 2018. CODEN the complexity of bounded time TCSCDI. ISSN 0304-3975 (print), and precision reachability for piece- 1879-2294 (electronic). URL http: wise affine systems. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 735(??):132– article/pii/S0304397517303961. 146, July 29, 2018. CODEN TC- Jovanovic:2018:PSP SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1731] Aleksandra Jovanović and Marta //www.sciencedirect.com/science/ Kwiatkowska. Parameter synthesis article/pii/S0304397516305084. for probabilistic timed automata us- Chistikov:2018:CFC ing stochastic game abstractions. The- oretical Computer Science, 735(??): [1735] Dmitry Chistikov, Christoph Haase, 64–81, July 29, 2018. CODEN and Simon Halfon. Context-free TCSCDI. ISSN 0304-3975 (print), commutative grammars with inte- 1879-2294 (electronic). URL http: ger counters and resets. Theo- //www.sciencedirect.com/science/ retical Computer Science, 735(??): article/pii/S0304397517303833. 147–161, July 29, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Hunter:2018:MPG 1879-2294 (electronic). URL http: [1732] Paul Hunter, Arno Pauly, Guillermo A. //www.sciencedirect.com/science/ Pérez, and Jean-Fran¸cois Raskin. article/pii/S0304397516302535. Mean-payoff games with partial obser- Kari:2018:Eb vation. Theoretical Computer Science, 735(??):82–110, July 29, 2018. CODEN [1736] Lila Kari. Editorial. Theoret- TCSCDI. ISSN 0304-3975 (print), ical Computer Science, 736(??):ii, REFERENCES 269

August 6, 2018. CODEN TC- Rowe:2018:LMO SCDI. ISSN 0304-3975 (print), 1879- 2294 (electronic). URL https:/ [1740] Jonathan E. Rowe. Linear multi- /www.sciencedirect.com/science/ objective drift analysis. Theoret- article/pii/S0304397518303797. ical Computer Science, 736(??):15– 24, August 6, 2018. CODEN TC- Buno:2018:SQP SCDI. ISSN 0304-3975 (print), 1879- 2294 (electronic). URL https:/ [1737] Kelvin C. Buño, Francis George C. /www.sciencedirect.com/science/ Cabarle, Marj Darrel Calabia, and article/pii/S030439751830094X. Henry N. Adorna. Solving the N-Queens problem using dP sys- Regnault:2018:LSS tems with active membranes. The- ´ oretical Computer Science, 736(??): [1741] Damien Regnault and Eric Rémila. iii, August 6, 2018. CODEN TC- Lost in self-stabilization: a local pro- SCDI. ISSN 0304-3975 (print), 1879- cess that aligns connected cells. The- 2294 (electronic). URL https:/ oretical Computer Science, 736(??): /www.sciencedirect.com/science/ 25–40, August 6, 2018. CODEN article/pii/S0304397517309040. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL https: Valencia-Cabrera:2018:DRC //www.sciencedirect.com/science/ article/pii/S0304397518301002. [1738] Luis Valencia-Cabrera, David Orellana- Grillo:2018:QQS Mart´ın, Miguel A.´ Mart´ınez del Amor, Agust´ın Riscos-Núñez, and Mario J. [1742] S. A. Grillo and F. L. Mar- Pérez-Jiménez. From distribution to quezino. Quantum query as a replication in cooperative systems with state decomposition. Theoretical active membranes: a frontier of the ef- Computer Science, 736(??):41–61, ficiency. Theoretical Computer Science, August 6, 2018. CODEN TC- 736(??):1–14, August 6, 2018. CODEN SCDI. ISSN 0304-3975 (print), 1879- TCSCDI. ISSN 0304-3975 (print), 2294 (electronic). URL https:/ 1879-2294 (electronic). URL https: /www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518301786. article/pii/S0304397517309039. Paun:2018:DRT Anonymous:2018:EBbf [1743] Gheorghe Paun. A dozen of research [1739] Anonymous. Editorial Board. The- topics in membrane computing. The- oretical Computer Science, 736(??): oretical Computer Science, 736(??): 1–102, August 6, 2018. CODEN 62–75, August 6, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL https: 1879-2294 (electronic). URL https: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518303761. article/pii/S0304397518302226. REFERENCES 270

Barbuti:2018:PFM DAgostino:2018:CAD

[1744] Roberto Barbuti, Roberta Gori, [1748] Giovanna D’Agostino and Giacomo and Paolo Milazzo. Predictors for Lenzi. The µ-calculus alternation flat membrane systems. Theoret- depth hierarchy is infinite over fi- ical Computer Science, 736(??):76– nite planar graphs. Theoretical Com- 78, August 6, 2018. CODEN TC- puter Science, 737(??):40–61, Au- SCDI. ISSN 0304-3975 (print), 1879- gust 15, 2018. CODEN TC- 2294 (electronic). URL https:/ SCDI. ISSN 0304-3975 (print), /www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518302214. //www.sciencedirect.com/science/ article/pii/S0304397518302317. Anonymous:2018:EBbg Ayala-Rincon:2018:NEI [1745] Anonymous. Editorial board. The- oretical Computer Science, 737(??): [1749] Maur´ıcio Ayala-Rincón, Maribel Fernández, ii, August 15, 2018. CODEN TC- Ana Cristina Rocha-Oliveira, and SCDI. ISSN 0304-3975 (print), Daniel Lima Ventura. Nominal es- 1879-2294 (electronic). URL http: sential intersection types. Theo- //www.sciencedirect.com/science/ retical Computer Science, 737(??): article/pii/S0304397518303839. 62–80, August 15, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Polyvyanyy:2018:IIE 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1746] Artem Polyvyanyy, Jan Sürmeli, and article/pii/S0304397518303141. Matthias Weidlich. Interleaving isotactics — an equivalence notion on Badia:2018:FCG behaviour abstractions. Theoreti- [1750] Guillermo Badia and Carles Noguera. cal Computer Science, 737(??):1–18, Fra¨ıssé classes of graded relational August 15, 2018. CODEN TC- structures. Theoretical Computer SCDI. ISSN 0304-3975 (print), Science, 737(??):81–90, August 15, 1879-2294 (electronic). URL http: 2018. CODEN TCSCDI. ISSN 0304- //www.sciencedirect.com/science/ 3975 (print), 1879-2294 (electronic). . article/pii/S0304397518300161 URL http://www.sciencedirect. Choffrut:2018:TET com/science/article/pii/S0304397518303165. Ibarra:2018:VCS [1747] Ch. Choffrut and Z. Esik.´ Two equational theories of partial words. The- [1751] Oscar H. Ibarra and Ian McQuil- oretical Computer Science, 737(??): lan. Variations of checking stack 19–39, August 15, 2018. CODEN automata: Obtaining unexpected TCSCDI. ISSN 0304-3975 (print), decidability properties. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 738(??):ii, //www.sciencedirect.com/science/ August 22, 2018. CODEN TC- article/pii/S0304397518302329. SCDI. ISSN 0304-3975 (print), 1879- REFERENCES 271

2294 (electronic). URL https:/ mobile robots. Theoretical Com- /www.sciencedirect.com/science/ puter Science, 738(??):25–41, Au- article/pii/S0304397518302585. gust 22, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), 1879- Sun:2018:CBO 2294 (electronic). URL https:/ /www.sciencedirect.com/science/ [1752] Lei Sun and Fang-Wei Fu. Con- article/pii/S0304397518302974. structions of balanced odd-variable rotation symmetric Boolean func- Cornelissen:2018:BPM tions with optimal algebraic immunity and high nonlinearity. The- [1756] Kamiel Cornelissen and Bodo Manthey. oretical Computer Science, 738(??): Belief propagation for the maximum- 1–12, August 22, 2018. CODEN weight independent set and mini- TCSCDI. ISSN 0304-3975 (print), mum spanning tree problems. The- 1879-2294 (electronic). URL https: oretical Computer Science, 738(??): //www.sciencedirect.com/science/ 42–52, August 22, 2018. CODEN article/pii/S0304397518302780. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL https: Anonymous:2018:EBbh //www.sciencedirect.com/science/ article/pii/S0304397518302962. [1753] Anonymous. Editorial Board. The- oretical Computer Science, 738(??): Anthony:2018:LWN 1–80, August 22, 2018. CODEN [1757] Martin Anthony and Joel Ratsaby. TCSCDI. ISSN 0304-3975 (print), Large width nearest prototype clas- 1879-2294 (electronic). URL https: siﬁcation on general distance spaces. //www.sciencedirect.com/science/ Theoretical Computer Science, 738(??): article/pii/S030439751830389X. 53–64, August 22, 2018. CODEN Currie:2018:ABF TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL https: [1754] James D. Currie, Lucas Mol, and //www.sciencedirect.com/science/ Narad Rampersad. Avoidance bases article/pii/S0304397518302950. for formulas with reversal. The- Anonymous:2018:EBbi oretical Computer Science, 738(??): 13–24, August 22, 2018. CODEN [1758] Anonymous. Editorial board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 739(??): 1879-2294 (electronic). URL https: ii, August 29, 2018. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397518302779. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Izumi:2018:TCC article/pii/S0304397518303955. [1755] Taisuke Izumi, Daichi Kaino, Maria Grad- Dondi:2018:PCA inariu Potop-Butucaru, and S´ebastien Tixeuil. On time complexity for [1759] Riccardo Dondi and Florian Sikora. connectivity-preserving scattering of Parameterized complexity and ap- REFERENCES 272

proximation issues for the color- Hatanaka:2018:PCL ful components problems. Theo- retical Computer Science, 739(??): [1763] Tatsuhiko Hatanaka, Takehiro Ito, and 1–12, August 29, 2018. CODEN Xiao Zhou. Parameterized complex- TCSCDI. ISSN 0304-3975 (print), ity of the list coloring reconﬁgura- 1879-2294 (electronic). URL http: tion problem with graph parameters. //www.sciencedirect.com/science/ Theoretical Computer Science, 739(??): article/pii/S0304397518302949. 65–79, August 29, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Chen:2018:RLF 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1760] Yu Chen, Baodong Qin, and Haiyang article/pii/S0304397518303116. Xue. Regular lossy functions and their applications in leakage-resilient Li:2018:KAV cryptography. Theoretical Com- [1764] Wenjun Li and Binhai Zhu. A 2k- puter Science, 739(??):13–38, Au- kernelization algorithm for vertex cover gust 29, 2018. CODEN TC- based on crown decomposition. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 739(??): 1879-2294 (electronic). URL http: 80–85, August 29, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518302937. 1879-2294 (electronic). URL http: Noori:2018:LMG //www.sciencedirect.com/science/ article/pii/S0304397518303104. [1761] Narges Noori and Volkan Isler. The Anonymous:2018:EBbj lion and man game on polyhedral surfaces with obstacles. Theoret- [1765] Anonymous. Editorial board. The- ical Computer Science, 739(??):39– oretical Computer Science, 740(??): 58, August 29, 2018. CODEN ii, September 5, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518302913. article/pii/S0304397518304250. Zhang:2018:ECP Kostolanyi:2018:AWA

[1762] Wenwen Zhang and Jian-Liang Wu. [1766] Peter Kostol´anyi and Filip Mis´un. Edge coloring of planar graphs with- Alternating weighted automata over out adjacent 7-cycles. Theoreti- commutative semirings. Theoret- cal Computer Science, 739(??):59– ical Computer Science, 740(??):1– 64, August 29, 2018. CODEN 27, September 5, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518303128. article/pii/S0304397518303098. REFERENCES 273

Mittelbach:2018:FSH //www.sciencedirect.com/science/ article/pii/S0304397518303323. [1767] Arno Mittelbach and Daniele Ven- turi. Fiat–Shamir for highly sound Hofmann:2018:F protocols is instantiable. Theoret- [1771] Martin Hofmann, David Aspinall, ical Computer Science, 740(??):28– Brian Campbell, Ian Stark, and 62, September 5, 2018. CODEN Perdita Stevens. Foreword. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 741(??): 1879-2294 (electronic). URL http: ii, ???? 2018. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397518303074. 1879-2294 (electronic). URL http: Honkala:2018:ESB //www.sciencedirect.com/science/ article/pii/S0304397518304481. [1768] Juha Honkala. Equality sets of binary D0L sequences. Theoreti- Kennedy:2018:TGC cal Computer Science, 740(??):63– [1772] Andrew J. Kennedy and Claudio V. 67, September 5, 2018. CODEN Russo. Transposing G to C]: Ex- TCSCDI. ISSN 0304-3975 (print), pressivity of generalized algebraic data 1879-2294 (electronic). URL http: types in an object-oriented language. //www.sciencedirect.com/science/ Theoretical Computer Science, 741 article/pii/S0304397518303311. (??):1–2, ???? 2018. CODEN Li:2018:BPL TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1769] Wenhua Li, Xing Chai, and Yali //www.sciencedirect.com/science/ Song. A best possible on-line al- article/pii/S0304397518301270. gorithm for scheduling on uniform Anonymous:2018:EBbk parallel-batch machines. Theoret- ical Computer Science, 740(??):68– [1773] Anonymous. Editorial Board. The- 75, September 5, 2018. CODEN oretical Computer Science, 741(??): TCSCDI. ISSN 0304-3975 (print), 1–70, ???? 2018. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518303347. //www.sciencedirect.com/science/ article/pii/S0304397518304808. Konstantinidis:2018:STC Orejas:2018:INL [1770] Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, and Charis Papadopou- [1774] Fernando Orejas, Elvira Pino, Marisa los. Strong triadic closure in cographs Navarro, and Leen Lambers. In- and graphs of low maximum degree. stitutions for navigational logics Theoretical Computer Science, 740(??): for graphical structures. Theoret- 76–84, September 5, 2018. CODEN ical Computer Science, 741(??):3– TCSCDI. ISSN 0304-3975 (print), 18, ???? 2018. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), REFERENCES 274

1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518301282. article/pii/S0304397518303645.

Harper:2018:ETO Mossakowski:2018:PPS

[1775] Robert Harper. Exception track- [1779] Till Mossakowski and Bernd Krieg- ing in an open world. Theoret- Br¨uckner. Partial pushout seman- ical Computer Science, 741(??):19– tics of generics in DOL. Theo- 24, ???? 2018. CODEN TC- retical Computer Science, 741(??): SCDI. ISSN 0304-3975 (print), 48–57, ???? 2018. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518301294. //www.sciencedirect.com/science/ article/pii/S0304397518301828. Hennicker:2018:BAS Ortner:2018:GEF [1776] Rolf Hennicker, Alexandre Madeira, and Martin Wirsing. Behavioural [1780] Ronald Ortner and Hans Ulrich Si- and abstractor speciﬁcations revis- mon. Guest Editors’ Foreword. The- ited. Theoretical Computer Science, oretical Computer Science, 742(??): 741(??):25–31, ???? 2018. CODEN ii, ???? 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518301300. article/pii/S0304397517309222.

Mosses:2018:CDS Kaufmann:2018:SAA

[1777] Peter D. Mosses. CoFI with Don San- [1781] Emilie Kaufmann, Thomas Bonald, nella. Theoretical Computer Science, and Marc Lelarge. A spectral algo- 741(??):32–43, ???? 2018. CODEN rithm with additive clustering for the TCSCDI. ISSN 0304-3975 (print), recovery of overlapping communities in 1879-2294 (electronic). URL http: networks. Theoretical Computer Sci- //www.sciencedirect.com/science/ ence, 742(??):1–2, ???? 2018. CODEN article/pii/S0304397518301312. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Ghani:2018:CTI //www.sciencedirect.com/science/ article/pii/S0304397517309234. [1778] Neil Ghani, Clemens Kupke, Alas- dair Lambert, and Fredrik Nordvall Anonymous:2018:EBbl Forsberg. A compositional treatment of iterated open games. The- [1782] Anonymous. Editorial Board. The- oretical Computer Science, 741(??): oretical Computer Science, 742(??): 44–47, ???? 2018. CODEN TC- 1–114, ???? 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), REFERENCES 275

1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518305085. article/pii/S0304397517309271.

Zhivotovskiy:2018:LVC Sabato:2018:SLC

[1783] N. Zhivotovskiy and S. Hanneke. Lo- [1787] Sivan Sabato. Submodular learning calization of VC classes: Beyond lo- and covering with response-dependent cal Rademacher complexities. The- costs. Theoretical Computer Science, oretical Computer Science, 742(??): 742(??):82–97, ???? 2018. CODEN 3–26, ???? 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517309283. article/pii/S0304397517309246. Ferenczi:2018:AWE Kotlowski:2018:MFL [1788] S´ebastien Ferenczi, Christian Mauduit, [1784] Wojciech Kotlowski. On minimax- and Carlos Gustavo Moreira. An al- ity of Follow the Leader strategy gorithm for the word entropy. The- in the stochastic setting. Theoret- oretical Computer Science, 743(??): ical Computer Science, 742(??):27– ii, September 26, 2018. CODEN 49, ???? 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518304572. article/pii/S0304397517309258. Holzl:2018:LPL Gabric:2018:CBS [1785] Rupert H¨olzl, Sanjay Jain, and [1789] Daniel Gabric and Joe Sawada. Con- Frank Stephan. Learning pattern structing de Bruijn sequences by con- languages over groups. Theoreti- catenating smaller universal cycles. cal Computer Science, 742(??):50– Theoretical Computer Science, 743(??): 65, ???? 2018. CODEN TC- 1–11, September 26, 2018. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751730926X. article/pii/S0304397518304559. Bshouty:2018:ELJ Anonymous:2018:EBbm [1786] Nader H. Bshouty and Areej Costa. Ex- [1790] Anonymous. Editorial Board. The- act learning of juntas from membership oretical Computer Science, 743(??):1– queries. Theoretical Computer Science, 166, September 26, 2018. CODEN 742(??):66–81, ???? 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: REFERENCES 276

//www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518305140. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Klouda:2018:FPS article/pii/S0304397518303724. [1791] Karel Klouda, Katerina Medková, Currie:2018:UPU Edita Pelantová, and Stepán Starosta. Fixed points of Sturmian morphisms [1795] James Currie, Florin Manea, Dirk and their derivated words. Theo- Nowotka, and Kamellia Reshadi. retical Computer Science, 743(??):12– Unary patterns under permutations. 22, September 26, 2018. CODEN Theoretical Computer Science, 743(??): TCSCDI. ISSN 0304-3975 (print), 64–71, September 26, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518304535. //www.sciencedirect.com/science/ article/pii/S0304397518303712. Cicalese:2018:BFN Teh:2018:OWR [1792] Ferdinando Cicalese, Zsuzsanna Lipták, and Massimiliano Rossi. Bubble- [1796] Wen Chean Teh, K. G. Subramanian, flip — a new generation algorithm and Somnath Bera. Order of weak M- for prefix normal words. Theoret- relation and Parikh matrices. Theo- ical Computer Science, 743(??):23– retical Computer Science, 743(??):72– 37, September 26, 2018. CODEN 82, September 26, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518304377. article/pii/S0304397518302925. Carey:2018:PFC Bertet:2018:LCS [1793] Norman Carey and David Clampitt. [1797] Karell Bertet, Christophe Demko, Partitioned factors in Christoffel Jean-Fran¸cois Viaud, and Clément and Sturmian words. Theoreti- Guérin. Lattices, closures systems and cal Computer Science, 743(??):38– implication bases: a survey of struc- 52, September 26, 2018. CODEN tural aspects and algorithms. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 743(??):83– 1879-2294 (electronic). URL http: 92, September 26, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518304353. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Petersen:2018:TST article/pii/S0304397516306806. [1794] Karl Petersen and Ibrahim Salama. Ge:2018:CEV Tree shift topological entropy. Theo- retical Computer Science, 743(??):53– [1798] Cunjing Ge, Feifei Ma, Peng Zhang, 63, September 26, 2018. CODEN and Jian Zhang. Computing and es- REFERENCES 277

timating the volume of the solution Sampaio:2018:TAC space of SMT(LA) constraints. Theo- retical Computer Science, 743(??):93– [1802] Augusto Sampaio and Farn Wang. 109, September 26, 2018. CODEN Theoretical aspects of computing. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 744 1879-2294 (electronic). URL http: (??):1–2, October 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397516305977. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Bender:2018:RQR article/pii/S0304397518304705. Babari:2018:WRA [1799] Michael A. Bender, Rezaul A. Chowd- hury, Pramod Ganapathi, Samuel Mc- [1803] Parvaneh Babari, Manfred Droste, Cauley, and Yuan Tang. The range and Vitaly Perevoshchikov. Weighted 1 query (R1Q) problem. Theoret- register automata and weighted ical Computer Science, 743(??):110– logic on data words. Theoret- 129, September 26, 2018. CODEN ical Computer Science, 744(??):3– TCSCDI. ISSN 0304-3975 (print), 21, October 2018. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397515012219. //www.sciencedirect.com/science/ article/pii/S030439751830015X. Hendricks:2018:PDS Benevides:2018:TRA

[1800] Jacob Hendricks, Matthew J. Patitz, [1804] Mario Benevides, Bruno Lopes, and Trent A. Rogers, and Scott M. Sum- Edward Hermann Haeusler. Towards mers. The power of duples (in self- reasoning about Petri nets: a Proposi- assembly): It’s not so hip to be square. tional Dynamic Logic based approach. Theoretical Computer Science, 743(??): Theoretical Computer Science, 744 130–147, September 26, 2018. CODEN (??):22–36, October 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751501169X. article/pii/S0304397518300185. Guttmann:2018:AFM Anonymous:2018:EBbn [1805] Walter Guttmann. An algebraic frame- [1801] Anonymous. Editorial Board. The- work for minimum spanning tree prob- oretical Computer Science, 744(??): lems. Theoretical Computer Science, ii, October 2018. CODEN TC- 744(??):37–55, October 2018. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518305450. article/pii/S0304397518302342. REFERENCES 278

Guzman:2018:CRI 113–142, October 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1806] Michell Guzmán, Salim Perchy, Camilo 1879-2294 (electronic). URL http: Rueda, and Frank D. Valencia. Char- //www.sciencedirect.com/science/ acterizing right inverses for spa- article/pii/S0304397517307193. tial constraint systems with applications to modal logic. Theoret- Schwammberger:2018:AMP ical Computer Science, 744(??):56– [1810] Maike Schwammberger. An ab- 77, October 2018. CODEN TC- stract model for proving safety of SCDI. ISSN 0304-3975 (print), autonomous urban traffic. Theo- 1879-2294 (electronic). URL http: retical Computer Science, 744(??): //www.sciencedirect.com/science/ 143–169, October 2018. CODEN article/pii/S0304397518303426. TCSCDI. ISSN 0304-3975 (print), Madeira:2018:LSD 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1807] Alexandre Madeira, Lu´ıs S. Barbosa, article/pii/S0304397518303669. Rolf Hennicker, and Manuel A. Mar- tins. A logic for the stepwise de- Buhmann:2018:PAL velopment of reactive systems. The- [1811] Joachim M. Buhmann, Julien Du- oretical Computer Science, 744(??): mazert, Alexey Gronskiy, and Woj- 78–96, October 2018. CODEN TC- ciech Szpankowski. Posterior agree- SCDI. ISSN 0304-3975 (print), ment for large parameter-rich op- 1879-2294 (electronic). URL http: timization problems. Theoretical //www.sciencedirect.com/science/ Computer Science, 745(??):ii, Oc- article/pii/S0304397518301439. tober 12, 2018. CODEN TC- McIver:2018:SFG SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1808] Annabelle McIver, Tahiry Rabehaja, //www.sciencedirect.com/science/ and Georg Struth. Schedulers and article/pii/S0304397518302378. finishers: On generating and filtering Hanneke:2018:TPF the behaviours of an event structure. Theoretical Computer Science, 744 [1812] Steve Hanneke and Liu Yang. Test- (??):97–112, October 2018. CODEN ing piecewise functions. Theoret- TCSCDI. ISSN 0304-3975 (print), ical Computer Science, 745(??):1– 1879-2294 (electronic). URL http: 22, October 12, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518300410. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Neves:2018:LMH article/pii/S0304397518303396. [1809] Renato Neves and Lu´ıs S. Barbosa. Anonymous:2018:EBbo Languages and models for hybrid automata: a coalgebraic perspective. [1813] Anonymous. Editorial Board. The- Theoretical Computer Science, 744(??): oretical Computer Science, 745(??): REFERENCES 279

1–224, October 12, 2018. CODEN Cao:2018:VDP TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1817] Yixin Cao, Yuping Ke, Yota Otachi, //www.sciencedirect.com/science/ and Jie You. Vertex deletion prob- article/pii/S0304397518305516. lems on chordal graphs. Theoret- ical Computer Science, 745(??):63– Bae:2018:GPG 74, October 12, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1814] Sang Won Bae, Jean-Fran¸cois Baﬃer, 1879-2294 (electronic). URL http: Jinhee Chun, Peter Eades, Kord Eick- //www.sciencedirect.com/science/ meyer, Luca Grilli, Seok-Hee Hong, article/pii/S0304397518304067. Matias Korman, Fabrizio Montecchi- Thorncharoensri:2018:PCS ani, Ignaz Rutter, and Csaba D. T´oth. Gap-planar graphs. The- [1818] Pairat Thorncharoensri, Willy Susilo, oretical Computer Science, 745(??): and Yi Mu. Policy controlled sys- 23–35, October 12, 2018. CODEN tem with anonymity. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 745(??):75– 1879-2294 (electronic). URL http: 86, October 12, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518303670. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Reddy:2018:PAC article/pii/S0304397518304055.

[1815] I. Vinod Reddy. Parameterized Ibarra:2018:SLL algorithms for conﬂict-free colorings of graphs. Theoretical Com- [1819] Oscar H. Ibarra and Ian McQuillan. On puter Science, 745(??):36–52, Oc- store languages of language acceptors. tober 12, 2018. CODEN TC- Theoretical Computer Science, 745(??): SCDI. ISSN 0304-3975 (print), 87–113, October 12, 2018. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518303633. //www.sciencedirect.com/science/ article/pii/S0304397518304031. Mezzini:2018:PTA Garraﬀa:2018:EEB

[1816] Mauro Mezzini. Polynomial time algo- [1820] Michele Garraﬀa, Lei Shang, Fed- rithm for computing a minimum geode- erico Della Croce, and Vincent T’kindt. tic set in outerplanar graphs. The- An exact exponential branch-and- oretical Computer Science, 745(??): merge algorithm for the single ma- 53–62, October 12, 2018. CODEN chine total tardiness problem. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 745(??): 1879-2294 (electronic). URL http: 114–132, October 12, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518303700. 1879-2294 (electronic). URL http: REFERENCES 280

//www.sciencedirect.com/science/ 172–201, October 12, 2018. CODEN article/pii/S0304397518304079. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Gatti:2018:TBM //www.sciencedirect.com/science/ [1821] N. Gatti, M. Rocco, P. Seraﬁno, article/pii/S0304397518304146. and C. Ventre. Towards bet- Anonymous:2018:EBbp ter models of externalities in sponsored search auctions. Theoreti- [1825] Anonymous. Editorial Board. The- cal Computer Science, 745(??):133– oretical Computer Science, 746(??): 149, October 12, 2018. CODEN ii, October 25, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518304195. article/pii/S0304397518305632. Cai:2018:CGH Xu:2018:BGN [1822] Jin-Yi Cai, Heng Guo, and Tyson [1826] Rongxing Xu and Xuding Zhu. Williams. Cliﬀord gates in the Bounded greedy Nim. Theoreti- Holant framework. Theoretical Com- cal Computer Science, 746(??):1–5, puter Science, 745(??):150–162, Oc- October 25, 2018. CODEN TC- tober 12, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518304316. article/pii/S0304397518304183. Komargodski:2018:LRO Escamocher:2018:PFM [1827] Ilan Komargodski. Leakage resilient [1823] Guillaume Escamocher and Barry one-way functions: the auxiliary- O’Sullivan. Pushing the frontier input setting. Theoretical Com- of minimality. Theoretical Com- puter Science, 746(??):6–18, Oc- puter Science, 745(??):163–171, Oc- tober 25, 2018. CODEN TC- tober 12, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518304304. article/pii/S030439751830416X. Beaudou:2018:OGG Watel:2018:TSP [1828] Laurent Beaudou, Pierre Coupe- [1824] Dimitri Watel and Alain Faye. Taxi- choux, Antoine Dailly, Sylvain Gravier, sharing: Parameterized complexity and Julien Moncel, Aline Parreau, and approximability of the dial-a-ride prob- Eric´ Sopena. Octal games on lem with money as an incentive. The- graphs: the game 0.33 on subdi- oretical Computer Science, 745(??): vided stars and bistars. Theoret- REFERENCES 281

ical Computer Science, 746(??):19– Kobayashi:2018:NHF 35, October 25, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), [1832] Yusuke Kobayashi. NP-hardness and 1879-2294 (electronic). URL http: fixed-parameter tractability of the //www.sciencedirect.com/science/ minimum spanner problem. The- article/pii/S0304397518304341. oretical Computer Science, 746(??): 88–97, October 25, 2018. CODEN Alves:2018:PCR TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1829] Sancrey Rodrigues Alves, Konrad K. //www.sciencedirect.com/science/ Dabrowski, Luerbio Faria, Sulamita article/pii/S030439751830447X. Klein, Ignasi Sau, and Uéverton S. Souza. On the (parameterized) com- Biswas:2018:RDR plexity of recognizing well-covered (r, l)-graph. Theoretical Computer [1833] Sudip Biswas, Arnab Ganguly, Rahul Science, 746(??):36–48, October 25, Shah, and Sharma V. Thankachan. 2018. CODEN TCSCDI. ISSN 0304- Ranked document retrieval for mul- 3975 (print), 1879-2294 (electronic). tiple patterns. Theoretical Com- URL http://www.sciencedirect. puter Science, 746(??):98–111, Oc- com/science/article/pii/S0304397518304407tober. 25, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), Diner:2018:CDB 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1830] Oznur¨ Yasar Diner, Daniël Paulusma, article/pii/S0304397518304456. Christophe Picouleau, and Bernard Bang-Jensen:2018:DCP Ries. Contraction and deletion blockers for perfect graphs and H-free graphs. [1834] Jørgen Bang-Jensen and Tilde My Theoretical Computer Science, 746(??): Christiansen. Degree constrained 2- 49–72, October 25, 2018. CODEN partitions of semicomplete digraphs. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 746(??): 1879-2294 (electronic). URL http: 112–123, October 25, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518304390. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Bilo:2018:OFG article/pii/S0304397518304444. [1831] Vittorio Bilò, Angelo Fanelli, and Luca Mitsche:2018:BNG Moscardelli. Opinion formation games with dynamic social influences. The- [1835] Dieter Mitsche, Pawe l Pralat, and oretical Computer Science, 746(??): Elham Roshanbin. Burning num- 73–87, October 25, 2018. CODEN ber of graph products. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 746(??):124– 1879-2294 (electronic). URL http: 135, October 25, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518304419. 1879-2294 (electronic). URL http: REFERENCES 282

//www.sciencedirect.com/science/ URL http://www.sciencedirect. article/pii/S0304397518304523. com/science/article/pii/S0304397518304110.

Ibarra:2018:GCN Kojima:2018:GHP [1836] Oscar H. Ibarra. Grammatical characterizations of NPDAs and VPDAs [1840] Kensuke Kojima, Minoru Kinoshita, with counters. Theoretical Com- and Kohei Suenaga. General- puter Science, 746(??):136–150, Oc- ized homogeneous polynomials for tober 25, 2018. CODEN TC- eﬃcient template-based nonlinear SCDI. ISSN 0304-3975 (print), invariant synthesis. Theoretical 1879-2294 (electronic). URL http: Computer Science, 747(??):33–47, //www.sciencedirect.com/science/ November 7, 2018. CODEN TC- article/pii/S0304397518304511. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Anonymous:2018:EBbq //www.sciencedirect.com/science/ article/pii/S0304397518304134. [1837] Anonymous. Editorial Board. The- oretical Computer Science, 747(??): Bart:2018:RPI ii, November 7, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1841] Anicet Bart, Benoˆıt Delahaye, Paulin ´ //www.sciencedirect.com/science/ Fournier, Didier Lime, Eric Mon- article/pii/S0304397518305814. froy, and Charlotte Truchet. Reach- ability in parametric Interval Markov Matt:2018:TAT Chains using constraints. Theoret- ical Computer Science, 747(??):48– [1838] Christian Matt, Ueli Maurer, Christo- 74, November 7, 2018. CODEN pher Portmann, Renato Renner, and TCSCDI. ISSN 0304-3975 (print), Bj¨orn Tackmann. Toward an al- 1879-2294 (electronic). URL http: gebraic theory of systems. Theo- //www.sciencedirect.com/science/ retical Computer Science, 747(??):1– article/pii/S0304397518304328. 25, November 7, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), Moggi:2018:SRR 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1842] Eugenio Moggi, Amin Farjudian, article/pii/S0304397518304092. Adam Duracz, and Walid Taha. Ishii:2018:PLR Safe and robust reachability analysis of hybrid systems. Theoret- [1839] Katsumasa Ishii. A proof of the ical Computer Science, 747(??):75– leftmost reduction theorem for λβη- 99, November 7, 2018. CODEN calculus. Theoretical Computer Sci- TCSCDI. ISSN 0304-3975 (print), ence, 747(??):26–32, November 7, 1879-2294 (electronic). URL http: 2018. CODEN TCSCDI. ISSN 0304- //www.sciencedirect.com/science/ 3975 (print), 1879-2294 (electronic). article/pii/S0304397518304365. REFERENCES 283

Weinert:2018:VLD Langerman:2018:TFH

[1843] Alexander Weinert and Martin Zim- [1847] Stefan Langerman and Yushi Uno. mermann. Visibly linear dynamic logic. Threes!, ﬁves, 1024!, and 2048 are hard. Theoretical Computer Science, 747(??): Theoretical Computer Science, 748(??): 100–117, November 7, 2018. CODEN 17–27, November 14, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518304468. article/pii/S0304397518301798.

Anonymous:2018:EBbr Demaine:2018:FCP [1848] Erik D. Demaine, Fermi Ma, Ariel [1844] Anonymous. Editorial Board. The- Schvartzman, Erik Waingarten, and oretical Computer Science, 748(??): Scott Aaronson. The fewest clues ii, November 14, 2018. CODEN problem. Theoretical Computer Sci- TCSCDI. ISSN 0304-3975 (print), ence, 748(??):28–39, November 14, 1879-2294 (electronic). URL http: 2018. CODEN TCSCDI. ISSN 0304- //www.sciencedirect.com/science/ 3975 (print), 1879-2294 (electronic). article/pii/S030439751830625X. URL http://www.sciencedirect. Demaine:2018:EF com/science/article/pii/S0304397518300677. Herter:2018:LGC [1845] Erik D. Demaine and Fabrizio Grandoni. Editorial fun. The- [1849] Felix Herter and Günter Rote. Loop- oretical Computer Science, 748(??): less Gray code enumeration and 1, November 14, 2018. CODEN the Tower of Bucharest. Theoret- TCSCDI. ISSN 0304-3975 (print), ical Computer Science, 748(??):40– 1879-2294 (electronic). URL http: 54, November 14, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518304833. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Bekos:2018:AIR article/pii/S0304397517308472. [1846] Michael A. Bekos, Till Bruckdor- DeBiasi:2018:CSU fer, Henry Förster, Michael Kauf- mann, Simon Poschenrieder, and [1850] Marzio De Biasi and Tim Ophelders. Thomas Stüber. Algorithms and The complexity of snake and undi- insights for RaceTrack. Theoret- rected NCL variants. Theoreti- ical Computer Science, 748(??):2– cal Computer Science, 748(??):55– 16, November 14, 2018. CODEN 65, November 14, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518302627. article/pii/S0304397517307946. REFERENCES 284

Almanza:2018:TNH der bounded condition. Theoret- ical Computer Science, 749(??):17– [1851] Matteo Almanza, Stefano Leucci, 25, November 21, 2018. CODEN and Alessandro Panconesi. Train- TCSCDI. ISSN 0304-3975 (print), yard is NP-Hard. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 748(??):66–76, Novem- //www.sciencedirect.com/science/ ber 14, 2018. CODEN TC- article/pii/S0304397517305820. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Liu:2018:TSR //www.sciencedirect.com/science/ article/pii/S030439751730720X. [1856] Xianmin Liu, Zhipeng Cai, Dongjing Anonymous:2018:EBbs Miao, and Jianzhong Li. Tree size reduction with keeping distinguishability. [1852] Anonymous. Editorial Board. The- Theoretical Computer Science, 749(??): oretical Computer Science, 749(??): 26–35, November 21, 2018. CODEN ii, November 21, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517306266. article/pii/S0304397518306182. Anonymous:2018:P Gu:2018:AAR

[1853] Anonymous. Preface. Theoret- [1857] Qian-Ping Gu, Jiajian Leo Liang, and ical Computer Science, 749(??):1, Guochuan Zhang. Algorithmic analy- November 21, 2018. CODEN TC- sis for ridesharing of personal vehicles. SCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 749(??): 1879-2294 (electronic). URL http: 36–46, November 21, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518306212. 1879-2294 (electronic). URL http: Yang:2018:CMA //www.sciencedirect.com/science/ article/pii/S030439751730628X. [1854] Kai Yang, Zhenhua Duan, Cong Tian, and Nan Zhang. A compiler for Zhang:2018:AHR MSVL and its applications. Theo- retical Computer Science, 749(??):2– [1858] Peng Zhang, Chenchen Wu, and 16, November 21, 2018. CODEN Dachuan Xu. Approximation and TCSCDI. ISSN 0304-3975 (print), hardness results for the Max k- 1879-2294 (electronic). URL http: Uncut problem. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 749(??):47–58, Novem- article/pii/S0304397517305807. ber 21, 2018. CODEN TC- SCDI. ISSN 0304-3975 (print), Miao:2018:SVD 1879-2294 (electronic). URL http: [1855] Dongjing Miao, Zhipeng Cai, and //www.sciencedirect.com/science/ Yingshu Li. SEF view deletion un- article/pii/S0304397517306515. REFERENCES 285

Bai:2018:CCP 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1859] Chunsong Bai, Liying Kang, and Er- article/pii/S0304397518306613. fang Shan. The connected p-center problem on cactus graphs. Theo- Larsen:2018:RPS retical Computer Science, 749(??):59– [1863] Kim G. Larsen, Igor Potapov, and Jir´ı 65, November 21, 2018. CODEN Srba. Reachability problems: Special TCSCDI. ISSN 0304-3975 (print), issue. Theoretical Computer Science, 1879-2294 (electronic). URL http: 750(??):1, November 30, 2018. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397517306904. 1879-2294 (electronic). URL http: Gao:2018:RAN //www.sciencedirect.com/science/ article/pii/S030439751830656X. [1860] Xiaofeng Gao, Yueyang Xianzang, Xiaotian You, Yaru Dang, Guihai Jones:2018:WPG Chen, and Xinglong Wang. Reach- [1864] Sam A. M. Jones and Richard M. ability for airline networks: fast Thomas. Word problems of groups: algorithm for shortest path prob- Formal languages, characterizations lem with time windows. Theoret- and decidability. Theoretical Com- ical Computer Science, 749(??):66– puter Science, 750(??):2–23, Novem- 79, November 21, 2018. CODEN ber 30, 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751830063X. article/pii/S030439751830313X. Wu:2018:AAM Hague:2018:DMI [1861] Chenchen Wu, Donglei Du, and [1865] Matthew Hague and Anthony W. Dachuan Xu. An approximation algo- Lin. Decidable models of integer- rithm for the k-median problem with manipulating programs with recur- uniform penalties via pseudo-solution. sive parallelism. Theoretical Com- Theoretical Computer Science, 749(??): puter Science, 750(??):24–37, Novem- 80–92, November 21, 2018. CODEN ber 30, 2018. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518301233. article/pii/S0304397518303049. Anonymous:2018:EBbt Geffroy:2018:ORA [1862] Anonymous. Editorial Board. The- [1866] Thomas Geffroy, Jérôme Leroux, and oretical Computer Science, 750(??): Grégoire Sutre. Occam’s Razor applied ii, November 30, 2018. CODEN to the Petri net coverability problem. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 750(??): REFERENCES 286

38–52, November 30, 2018. CODEN Anonymous:2018:EBbu TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1870] Anonymous. Editorial Board. The- //www.sciencedirect.com/science/ oretical Computer Science, 751(??): article/pii/S0304397518302366. ii, December 3, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), LeCoent:2018:CSS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1867] Adrien Le Co¨ent, Laurent Fribourg, article/pii/S030439751830673X. Nicolas Markey, Florian De Vuyst, and Ludovic Chamoin. Composi- Scheideler:2018:P tional synthesis of state-dependent switching control. Theoretical Com- [1871] Christian Scheideler. Preface. The- puter Science, 750(??):53–68, Novem- oretical Computer Science, 751(??): ber 30, 2018. CODEN TC- 1, December 3, 2018. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518300689. article/pii/S0304397518306698.

Alechina:2018:CRB Barenboim:2018:FND

[1868] N. Alechina, N. Bulling, S. Demri, [1872] Leonid Barenboim, Michael Elkin, and B. Logan. On the complexity and Cyril Gavoille. A fast network- of resource-bounded logics. Theo- decomposition algorithm and its retical Computer Science, 750(??):69– applications to constant-time dis- 100, November 30, 2018. CODEN tributed computation. Theoretical TCSCDI. ISSN 0304-3975 (print), Computer Science, 751(??):2–23, De- 1879-2294 (electronic). URL http: cember 3, 2018. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397518300665. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Best:2018:SCM article/pii/S030439751630319X.

[1869] Eike Best, Thomas Hujsa, and Harro Bury:2018:ROB Wimmel. Suﬃcient conditions for the marked graph realisability of la- [1873] Marc Bury. Randomized OBDD- belled transition systems. Theoret- based graph algorithms. Theoret- ical Computer Science, 750(??):101– ical Computer Science, 751(??):24– 116, November 30, 2018. CODEN 45, December 3, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397517307181. article/pii/S0304397516306910. REFERENCES 287

Moses:2018:MEM Kari:2018:Ec

[1874] Yoram Moses and Katia Patkin. Mu- [1878] Lila Kari. Editorial. Theoretical tual exclusion as a matter of priority. Computer Science, 752(??):iii, De- Theoretical Computer Science, 751(??): cember 15, 2018. CODEN TC- 46–60, December 3, 2018. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518306893. article/pii/S0304397516307435. Aerts:2018:SIQ

Fraigniaud:2018:NLL [1879] Diederik Aerts, Massimo Melucci, Mas- similiano Sassoli de Bianchi, Sandro [1875] Pierre Fraigniaud, Juho Hirvonen, Sozzo, and Tomas Veloz. Special issue: and Jukka Suomela. Node la- Quantum structures in computer sci- bels in local decision. Theoreti- ence: Language, semantics, retrieval. cal Computer Science, 751(??):61– Theoretical Computer Science, 752(??): 73, December 3, 2018. CODEN 1–4, December 15, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751730052X. article/pii/S0304397518306819.

Censor-Hillel:2018:FRI DiBuccio:2018:USE [1880] Emanuele Di Buccio. Utilizing [1876] Keren Censor-Hillel and Tariq Toukan. sources of evidence in relevance feed- On fast and robust information spread- back through geometry. Theoret- ing in the Vertex-Congest model. The- ical Computer Science, 752(??):5– oretical Computer Science, 751(??): 20, December 15, 2018. CODEN 74–90, December 3, 2018. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518303657. article/pii/S0304397517305224. Zhang:2018:QIM Anonymous:2018:EBbv [1881] Yazhou Zhang, Dawei Song, Peng [1877] Anonymous. Editorial Board. The- Zhang, Panpan Wang, Jingfei Li, oretical Computer Science, 752(??): Xiang Li, and Benyou Wang. A ii, December 15, 2018. CODEN quantum-inspired multimodal senti- TCSCDI. ISSN 0304-3975 (print), ment analysis framework. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 752(??):21– //www.sciencedirect.com/science/ 40, December 15, 2018. CODEN article/pii/S0304397518306868. TCSCDI. ISSN 0304-3975 (print), REFERENCES 288

1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518302639. //www.sciencedirect.com/science/ article/pii/S0304397517308575. Busemeyer:2018:DFU [1882] Jerome Busemeyer and Zheng Wang. Danilov:2018:PQB Data fusion using Hilbert space multi-dimensional models. Theoret- [1886] V. I. Danilov and A. Lambert- ical Computer Science, 752(??):41– Mogiliansky. Preparing a (quan- 55, December 15, 2018. CODEN tum) belief system. Theoretical Com- TCSCDI. ISSN 0304-3975 (print), puter Science, 752(??):97–103, De- 1879-2294 (electronic). URL http: cember 15, 2018. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397517308915. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Bruza:2018:MCP article/pii/S0304397518301087. [1883] Peter D. Bruza. Modelling con- Coecke:2018:GRL textuality by probabilistic programs with hypergraph semantics. Theo- [1887] Bob Coecke, Fabrizio Genovese, retical Computer Science, 752(??):56– Martha Lewis, Dan Marsden, and 70, December 15, 2018. CODEN Alex Toumi. Generalized relations TCSCDI. ISSN 0304-3975 (print), in linguistics and cognition. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 752(??):104– //www.sciencedirect.com/science/ 115, December 15, 2018. CODEN article/pii/S0304397517308587. TCSCDI. ISSN 0304-3975 (print), Yan:2018:FRM 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1884] Fei Yan, Abdullah M. Iliyasu, Yim- article/pii/S0304397518301476. ing Guo, and Huamin Yang. Flexi- ble representation and manipulation of Aerts:2018:TQW audio signals on quantum computers. Theoretical Computer Science, 752(??): [1888] Diederik Aerts, Jonito Aerts Argu¨elles, 71–85, December 15, 2018. CODEN Lester Beltran, Lyneth Beltran, TCSCDI. ISSN 0304-3975 (print), Isaac Distrito, Massimiliano Sas- 1879-2294 (electronic). URL http: soli de Bianchi, Sandro Sozzo, and //www.sciencedirect.com/science/ Tomas Veloz. Towards a quan- article/pii/S0304397517309209. tum World Wide Web. Theoreti- Leporini:2018:QSQ cal Computer Science, 752(??):116– 131, December 15, 2018. CODEN [1885] R. Leporini and C. Bertini. Quan- TCSCDI. ISSN 0304-3975 (print), tum structures in qudit spaces. The- 1879-2294 (electronic). URL http: oretical Computer Science, 752(??): //www.sciencedirect.com/science/ 86–96, December 15, 2018. CODEN article/pii/S0304397518301804. REFERENCES 289

Anonymous:2019:EBa Ileri:2019:SSA

[1889] Anonymous. Editorial Board. The- [1893] Can Umut Ileri and Orhan Dagde- oretical Computer Science, 753(??): viren. A self-stabilizing algorithm ii, January 1, 2019. CODEN TC- for b-matching. Theoretical Com- SCDI. ISSN 0304-3975 (print), puter Science, 753(??):64–75, Jan- 1879-2294 (electronic). URL http: uary 1, 2019. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397518306996. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Tomohiro:2019:IUB article/pii/S0304397518304584. [1890] Tomohiro I and Dominik Köppl. Im- Ryzhikov:2019:ARB proved upper bounds on all maximal α- gapped repeats and palindromes. The- [1894] Andrew Ryzhikov. On automata oretical Computer Science, 753(??): recognizing birecurrent sets. The- 1–15, January 1, 2019. CODEN oretical Computer Science, 753(??): TCSCDI. ISSN 0304-3975 (print), 76–79, January 1, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518304493. //www.sciencedirect.com/science/ article/pii/S0304397518304596. Sakai:2019:SSL Bampas:2019:ARG [1891] Yoshifumi Sakai. A substring- substring LCS data structure. The- [1895] Evangelos Bampas, Lélia Blin, Ju- oretical Computer Science, 753(??): rek Czyzowicz, David Ilcinkas, Arnaud 16–34, January 1, 2019. CODEN Labourel, Maria Potop-Butucaru, and TCSCDI. ISSN 0304-3975 (print), Sébastien Tixeuil. On asynchronous 1879-2294 (electronic). URL http: rendezvous in general graphs. The- //www.sciencedirect.com/science/ oretical Computer Science, 753(??): article/pii/S030439751830450X. 80–90, January 1, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Datta:2019:SSS 1879-2294 (electronic). URL http: [1892] Ajoy K. Datta, Stéphane Devismes, //www.sciencedirect.com/science/ and Lawrence L. Larmore. A article/pii/S0304397518304614. silent self-stabilizing algorithm for Anonymous:2019:EBb the generalized minimal k-dominating set problem. Theoretical Com- [1896] Anonymous. Editorial Board. The- puter Science, 753(??):35–63, Jan- oretical Computer Science, 754(??): uary 1, 2019. CODEN TC- ii, January 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518304560. article/pii/S0304397518306935. REFERENCES 290

Fotakis:2019:PSI TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [1897] Dimitris Fotakis, Aris Pagourtzis, and //www.sciencedirect.com/science/ Vangelis Paschos. Preface to spe- article/pii/S030439751830570X. cial issue on algorithms and complexity. Theoretical Computer Science, Gourves:2019:MSA 754(??):1–2, January 2019. CODEN [1901] Laurent Gourvès and Jérôme Monnot. TCSCDI. ISSN 0304-3975 (print), On maximin share allocations in ma- 1879-2294 (electronic). URL http: troids. Theoretical Computer Science, //www.sciencedirect.com/science/ 754(??):50–64, January 2019. CODEN article/pii/S0304397518306820. TCSCDI. ISSN 0304-3975 (print), Golovach:2019:EMI 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1898] Petr A. Golovach, Dieter Kratsch, article/pii/S0304397518303384. and Mohamed Yosri Sayadi. Enu- meration of maximal irredundant Kleer:2019:TIB sets for claw-free graphs. Theo- [1902] Pieter Kleer and Guido Schäfer. Tight retical Computer Science, 754(??):3– inefficiency bounds for perception- 15, January 2019. CODEN TC- parameterized affine congestion games. SCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 754 1879-2294 (electronic). URL http: (??):65–87, January 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518300999. 1879-2294 (electronic). URL http: Hagerup:2019:SEE //www.sciencedirect.com/science/ article/pii/S0304397518302597. [1899] Torben Hagerup, Frank Kammer, and Brauer:2019:CSS Moritz Laudahn. Space-efficient Eu- ler partition and bipartite edge col- [1903] Sascha Brauer. Complexity of single- oring. Theoretical Computer Science, swap heuristics for metric facility lo- 754(??):16–34, January 2019. CODEN cation and related problems. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 754(??): 1879-2294 (electronic). URL http: 88–106, January 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518300197. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ DiLuna:2019:PPF article/pii/S0304397518303025. [1900] Giuseppe A. Di Luna, Paola Floc- Abed:2019:SMJ chini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, and Giovanni Vigli- [1904] Fidaa Abed, Lin Chen, Yann Disser, etta. Population protocols with faulty Martin Groß, Nicole Megow, Julie interactions: the impact of a leader. Meißner, Alexander T. Richter, and Theoretical Computer Science, 754 Roman Rischke. Scheduling main- (??):35–49, January 2019. CODEN tenance jobs in networks. Theo- REFERENCES 291

retical Computer Science, 754(??): oretical Computer Science, 755(??): 107–121, January 2019. CODEN 13–28, January 10, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518301178. article/pii/S0304397518304687. Emek:2019:MCP Guan:2019:LWB [1905] Yuval Emek, Yaacov Shapiro, and Yuyi Wang. Minimum cost perfect match- [1909] Albert Guan and Wen-Guey Tzeng. A ing with delays for two sources. The- light-weight bit commitment protocol oretical Computer Science, 754(??): based on unpredictable channel noise. 122–129, January 2019. CODEN Theoretical Computer Science, 755(??): TCSCDI. ISSN 0304-3975 (print), 29–37, January 10, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518304857. //www.sciencedirect.com/science/ article/pii/S0304397518304675. Anonymous:2019:EBc [1906] Anonymous. Editorial Board. The- Wang:2019:MPNa oretical Computer Science, 755(??): ii, January 10, 2019. CODEN [1910] Zhao Wang, Christopher Melekian, Ed- TCSCDI. ISSN 0304-3975 (print), die Cheng, and Yaping Mao. Matching 1879-2294 (electronic). URL http: preclusion number in product graphs. //www.sciencedirect.com/science/ Theoretical Computer Science, 755(??): article/pii/S0304397518307400. 38–47, January 10, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Wallner:2019:BPI 1879-2294 (electronic). URL http: [1907] Michael Wallner. A bijection of plane //www.sciencedirect.com/science/ increasing trees with relaxed binary article/pii/S0304397518304663. trees of right height at most one. The- oretical Computer Science, 755(??): Leitert:2019:PAA 1–12, January 10, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [1911] Arne Leitert and Feodor F. Dra- 1879-2294 (electronic). URL http: gan. Parameterized approximation //www.sciencedirect.com/science/ algorithms for some location prob- article/pii/S0304397518304699. lems in graphs. Theoretical Com- Nader:2019:PSD puter Science, 755(??):48–64, Jan- uary 10, 2019. CODEN TC- [1908] Raﬁc Nader, Alain Bretto, Bas- SCDI. ISSN 0304-3975 (print), sam Mourad, and Hassan Abbas. 1879-2294 (electronic). URL http: On the positive semi-deﬁnite prop- //www.sciencedirect.com/science/ erty of similarity matrices. The- article/pii/S0304397518304651. REFERENCES 292

Zhang:2019:EPK 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1912] Kai Zhang, Jie Chen, Hyung Tae Lee, article/pii/S0304397518307461. Haifeng Qian, and Huaxiong Wang. Efficient public key encryption with Baghoolizadeh:2019:UBA equality test in the standard model. [1916] Shirin Baghoolizadeh, Ali Movaghar, Theoretical Computer Science, 755(??): and Negin Majidi. A uniformization- 65–80, January 10, 2019. CODEN based algorithm for continuous-time TCSCDI. ISSN 0304-3975 (print), stochastic games model checking. The- 1879-2294 (electronic). URL http: oretical Computer Science, 756(??): //www.sciencedirect.com/science/ 1–18, January 17, 2019. CODEN article/pii/S030439751830464X. TCSCDI. ISSN 0304-3975 (print), Guo:2019:GNC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1913] Jia Guo, Desai Li, and Mei Lu. The article/pii/S0304397518306145. g-good-neighbor conditional diagnosability of the crossed cubes under Ribeiro:2019:APC the PMC and MM* model. The- [1917] Pedro Ribeiro and Ana Cavalcanti. An- oretical Computer Science, 755(??): gelic processes for CSP via the UTP. 81–88, January 10, 2019. CODEN Theoretical Computer Science, 756(??): TCSCDI. ISSN 0304-3975 (print), 19–63, January 17, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518304626. //www.sciencedirect.com/science/ Jing:2019:PTA article/pii/S0304397518306133. Marinkovic:2019:PPC [1914] Rui-Juan Jing, Chun-Ming Yuan, and Xiao-Shan Gao. A polynomial- [1918] Bojan Marinković, Paola Glavan, and time algorithm to compute general- Zoran Ognjanović. Proving prop- ized Hermite normal forms of ma- erties of the Chord protocol us- trices over Z[x]. Theoretical Com- ing the ASM formalism. Theoret- puter Science, 755(??):89–109, Jan- ical Computer Science, 756(??):64– uary 10, 2019. CODEN TC- 93, January 17, 2019. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518304845. article/pii/S0304397518306467. Anonymous:2019:EBd Anonymous:2019:EBe [1915] Anonymous. Editorial Board. The- [1919] Anonymous. Editorial Board. The- oretical Computer Science, 756(??): oretical Computer Science, 757(??): ii, January 17, 2019. CODEN ii, January 24, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), REFERENCES 293

1879-2294 (electronic). URL http: puter Science, 757(??):36–43, Jan- //www.sciencedirect.com/science/ uary 24, 2019. CODEN TC- article/pii/S030439751830759X. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Czygrinow:2019:DCC //www.sciencedirect.com/science/ [1920] Andrzej Czygrinow, Michal Han´ckowiak, article/pii/S0304397518304936. Wojciech Wawrzyniak, and Marcin Lv:2019:RSN Witkowski. Distributed CONGESTBC constant approximation of MDS in [1924] Mengjie Lv, Shuming Zhou, Xueli Sun, bounded genus graphs. Theoret- Guanqin Lian, and Jiafei Liu. Re- ical Computer Science, 757(??):1– liability of (n, k)-star network based 10, January 24, 2019. CODEN on g-extra conditional fault. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 757(??): 1879-2294 (electronic). URL http: 44–55, January 24, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518304894. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Chang:2019:HRF article/pii/S0304397518305000. [1921] Yi-Jun Chang. Hardness of RNA fold- Cheng:2019:GAD ing problem with four symbols. The- oretical Computer Science, 757(??): [1925] Eddie Cheng, Ke Qiu, and Zhizhang 11–26, January 24, 2019. CODEN Shen. A general approach to deriving TCSCDI. ISSN 0304-3975 (print), the g-good-neighbor conditional diag- 1879-2294 (electronic). URL http: nosability of interconnection networks. //www.sciencedirect.com/science/ Theoretical Computer Science, 757(??): article/pii/S0304397518304912. 56–67, January 24, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Bartal:2019:ANN 1879-2294 (electronic). URL http: [1922] Yair Bartal and Lee-Ad Gottlieb. Ap- //www.sciencedirect.com/science/ proximate nearest neighbor search for l article/pii/S0304397518305012. ∞ p-spaces (2

capability analysis of hypercubes un- Stipulanti:2019:CPL der the PMC model and MM∗ model. Theoretical Computer Science, 758(??): [1931] Manon Stipulanti. Convergence 1–8, February 1, 2019. CODEN of Pascal-like triangles in Parry– TCSCDI. ISSN 0304-3975 (print), Bertrand numeration systems. The- 1879-2294 (electronic). URL http: oretical Computer Science, 758(??): //www.sciencedirect.com/science/ 42–60, February 1, 2019. CODEN article/pii/S0304397518305024. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Sun:2019:EFT //www.sciencedirect.com/science/ article/pii/S030439751830519X. [1928] Gaoxing Sun, Shuang Zhao, and Jix- iang Meng. Edge fault tolerance of Li:2019:ACM interconnection networks with respect to maximally edge-connectivity. The- [1932] Shimin Li and Haitao Wang. Algo- oretical Computer Science, 758(??): rithms for covering multiple barriers. 9–16, February 1, 2019. CODEN Theoretical Computer Science, 758(??): TCSCDI. ISSN 0304-3975 (print), 61–72, February 1, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518305036. //www.sciencedirect.com/science/ article/pii/S0304397518305206. Bonomi:2019:AAU Goldberg:2019:AOA [1929] Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, and Sébastien [1933] Leslie Ann Goldberg, John Lapinskas, Tixeuil. Approximate agreement un- Johannes Lengler, Florian Meier, Kon- der mobile Byzantine faults. The- stantinos Panagiotou, and Pascal Pfis- oretical Computer Science, 758(??): ter. Asymptotically optimal ampli- 17–29, February 1, 2019. CODEN fiers for the Moran process. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 758(??): 1879-2294 (electronic). URL http: 73–93, February 1, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518305176. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Escoffier:2019:SCM article/pii/S0304397518305218. [1930] Bruno Escoffier. Saving colors Anonymous:2019:EBg and max coloring: Some fixed- parameter tractability results. The- [1934] Anonymous. Editorial Board. The- oretical Computer Science, 758(??): oretical Computer Science, 759(??): 30–41, February 1, 2019. CODEN ii, February 8, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518305188. article/pii/S0304397519300374. REFERENCES 295

Huang:2019:LRR Libert:2019:ZKA

[1935] Jianye Huang, Qiong Huang, and [1939] Benoˆıt Libert, San Ling, Fabrice Willy Susilo. Leakage-resilient Mouhartem, Khoa Nguyen, and Huax- ring signature schemes. Theoret- iong Wang. Zero-knowledge argu- ical Computer Science, 759(??):1– ments for matrix-vector relations and 13, February 8, 2019. CODEN lattice-based group encryption. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 759(??): 1879-2294 (electronic). URL http: 72–97, February 8, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519300210. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Crespelle:2019:FDR article/pii/S0304397519300167.

[1936] Christophe Crespelle. Fully dynamic Faonio:2019:CNM representations of interval graphs. The- [1940] Antonio Faonio, Jesper Buus Nielsen, oretical Computer Science, 759(??): Mark Simkin, and Daniele Ven- 14–49, February 8, 2019. CODEN turi. Continuously non-malleable TCSCDI. ISSN 0304-3975 (print), codes with split-state refresh. The- 1879-2294 (electronic). URL http: oretical Computer Science, 759(??): //www.sciencedirect.com/science/ 98–132, February 8, 2019. CODEN article/pii/S0304397519300209. TCSCDI. ISSN 0304-3975 (print), Lajou:2019:ANS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1937] Dimitri Lajou. On the achromatic article/pii/S0304397519300064. number of signed graphs. Theo- Anonymous:2019:EBh retical Computer Science, 759(??): 50–60, February 8, 2019. CODEN [1941] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 760(??): 1879-2294 (electronic). URL http: ii, February 14, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519300192. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Wang:2019:MPNb article/pii/S030439751930060X. [1938] Zhao Wang, Yaping Mao, Eddie Cheng, Wei:2019:HFD and Jinyu Zou. Matching preclusion number of graphs. Theoret- [1942] Yulong Wei and Min Xu. Hy- ical Computer Science, 759(??):61– brid fault diagnosis capability anal- 71, February 8, 2019. CODEN ysis of regular graphs. Theoret- TCSCDI. ISSN 0304-3975 (print), ical Computer Science, 760(??):1– 1879-2294 (electronic). URL http: 14, February 14, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519300180. 1879-2294 (electronic). URL http: REFERENCES 296

//www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518305231. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Lafond:2019:CCM article/pii/S0304397518305322. [1943] M. Lafond, N. El-Mabrouk, K. T. Hu- Anonymous:2019:EBi ber, and V. Moulton. The complexity of comparing multiply-labelled trees [1947] Anonymous. Editorial Board. The- by extending phylogenetic-tree metrics. oretical Computer Science, 761(??): Theoretical Computer Science, 760(??): ii, February 21, 2019. CODEN 15–34, February 14, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519300714. article/pii/S030439751830522X. Li:2019:CFT Bringmann:2019:GIR [1948] Xiang-Jun Li, Min Liu, Zheng Yan, and [1944] Karl Bringmann, Ralph Keusch, and Jun-Ming Xu. On conditional fault tol- Johannes Lengler. Geometric inho- erance of hierarchical cubic networks. mogeneous random graphs. Theo- Theoretical Computer Science, 761(??): retical Computer Science, 760(??):35– 1–6, February 21, 2019. CODEN 54, February 14, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518305048. article/pii/S0304397518305309. Yang:2019:CBD Liu:2019:MPE [1945] Yongjie Yang, Yash Raj Shrestha, and [1949] Wen An Liu and Tao Wu. Multi- Jiong Guo. On the complexity of player End-Nim games. Theoret- bribery with distance restrictions. The- ical Computer Science, 761(??):7– oretical Computer Science, 760(??): 22, February 21, 2019. CODEN 55–71, February 14, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518305346. article/pii/S0304397518305292. Lu:2019:HPP Dosa:2019:RAS [1950] Huazhong L¨u and Fan Wang. Hamilto- [1946] Gyorgy Dosa, Hans Kellerer, and Zsolt nian paths passing through prescribed Tuza. Restricted assignment schedul- edges in balanced hypercubes. The- ing with resource constraints. The- oretical Computer Science, 761(??): oretical Computer Science, 760(??): 23–33, February 21, 2019. CODEN 72–87, February 14, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), REFERENCES 297

1879-2294 (electronic). URL http: ii, March 1, 2019. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397518305334. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Khonji:2019:CDS article/pii/S030439751930088X. [1951] Majid Khonji, Areg Karapetyan, He:2019:TRB Khaled Elbassioni, and Sid Chi-Kin Chau. Complex-demand scheduling [1955] Kun He, Qian Li, and Xiaoming Sun. problem with application in smart grid. A tighter relation between sensitiv- Theoretical Computer Science, 761(??): ity complexity and certiﬁcate complex- 34–50, February 21, 2019. CODEN ity. Theoretical Computer Science, 762 TCSCDI. ISSN 0304-3975 (print), (??):1–12, March 1, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518305395. //www.sciencedirect.com/science/ article/pii/S0304397518305413. Takayasu:2019:PKE Sabeti:2019:PEN [1952] Atsushi Takayasu and Noboru Ku- [1956] Rostam Sabeti. Polynomial expres- nihiro. Partial key exposure at- sions for non-binomial structures. The- tacks on RSA: Achieving the Boneh– oretical Computer Science, 762(??): Durfee bound. Theoretical Com- 13–24, March 1, 2019. CODEN puter Science, 761(??):51–77, Febru- TCSCDI. ISSN 0304-3975 (print), ary 21, 2019. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518306418. //www.sciencedirect.com/science/ article/pii/S0304397518305371. Kawachi:2019:GPE Gu:2019:CQT [1957] Akinori Kawachi, Mitsunori Ogihara, and Kei Uchizawa. Generalized prede- [1953] Qian-Ping Gu and Gengchun Xu. Con- cessor existence problems for Boolean stant query time (1 + )-approximate ﬁnite dynamical systems on directed distance oracle for planar graphs. The- graphs. Theoretical Computer Science, oretical Computer Science, 761(??): 762(??):25–40, March 1, 2019. CODEN 78–88, February 21, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518305589. article/pii/S0304397518305401. Navarro:2019:UCT Anonymous:2019:EBj [1958] Gonzalo Navarro and Nicola Prezza. [1954] Anonymous. Editorial Board. The- Universal compressed text indexing. oretical Computer Science, 762(??): Theoretical Computer Science, 762 REFERENCES 298

(??):41–50, March 1, 2019. CODEN (??):12–37, April 4, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518305723. article/pii/S0304397519300672.

Kucera:2019:LBC Bodei:2019:FAO

[1959] Petr Kucera, Petr Savick´y, and Vojtech [1963] Chiara Bodei, Linda Brodo, and Vorel. A lower bound on CNF en- Roberto Bruni. A formal approach codings of the at-most-one constraint. to open multiparty interactions. The- Theoretical Computer Science, 762 oretical Computer Science, 763(??): (??):51–73, March 1, 2019. CODEN 38–65, April 4, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518305681. article/pii/S0304397519300660.

Anonymous:2019:EBk Adamek:2019:FPC [1960] Anonymous. Editorial Board. The- [1964] Jir´ı Ad´amek and Stefan Milius. On oretical Computer Science, 763(??): functors preserving coproducts and ii, April 4, 2019. CODEN TC- algebras with iterativity. Theoret- SCDI. ISSN 0304-3975 (print), ical Computer Science, 763(??):66– 1879-2294 (electronic). URL http: 87, April 4, 2019. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397519300994. 1879-2294 (electronic). URL http: He:2019:WAI //www.sciencedirect.com/science/ article/pii/S030439751930043X. [1961] Qingyu He and Luoshan Xu. Weak algebraic information systems and a Anonymous:2019:EBl new equivalent category of DOM of domains. Theoretical Computer Science, [1965] Anonymous. Editorial Board. The- 763(??):1–11, April 4, 2019. CODEN oretical Computer Science, 764(??): TCSCDI. ISSN 0304-3975 (print), ii, April 11, 2019. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519300830. //www.sciencedirect.com/science/ article/pii/S0304397519301100. deSilva:2019:HLS Bilo:2019:E [1962] Lavindra de Silva, Lin Padgham, and Sebastian Sardina. HTN-like solu- [1966] Vittorio Bil`o and Antonio Caruso. Ed- tions for classical planning problems: itorial. Theoretical Computer Science, an application to BDI agent systems. 764(??):1, April 11, 2019. CODEN Theoretical Computer Science, 763 TCSCDI. ISSN 0304-3975 (print), REFERENCES 299

1879-2294 (electronic). URL http: robots in a ring with mobile faults. //www.sciencedirect.com/science/ Theoretical Computer Science, 764 article/pii/S0304397519301069. (??):42–60, April 11, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Calamoneri:2019:SLT 1879-2294 (electronic). URL http: [1967] Tiziana Calamoneri, Matteo Dell’Orefice, //www.sciencedirect.com/science/ and Angelo Monti. A simple linear article/pii/S0304397518303086. time algorithm for the locally connected spanning tree problem on max- Vinci:2019:NAO imal planar chordal graphs. The- oretical Computer Science, 764(??): [1971] Cosimo Vinci. Non-atomic one-round 2–14, April 11, 2019. CODEN walks in congestion games. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 764(??): 1879-2294 (electronic). URL http: 61–79, April 11, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518301221. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Cordasco:2019:AIS article/pii/S0304397518304547. [1968] Gennaro Cordasco, Luisa Gargano, and Adele A. Rescigno. Active in- Bernardo:2019:CLC fluence spreading in social networks. Theoretical Computer Science, 764 [1972] Marco Bernardo and Marino Mic- (??):15–29, April 11, 2019. CODEN ulan. Constructive logical charac- TCSCDI. ISSN 0304-3975 (print), terizations of bisimilarity for reac- 1879-2294 (electronic). URL http: tive probabilistic systems. Theo- //www.sciencedirect.com/science/ retical Computer Science, 764(??): article/pii/S030439751830121X. 80–99, April 11, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), DAngelo:2019:RLT 1879-2294 (electronic). URL http: [1969] Gianlorenzo D’Angelo, Lorenzo Sev- //www.sciencedirect.com/science/ erini, and Yllka Velaj. Recommend- article/pii/S0304397518307217. ing links through influence maximization. Theoretical Computer Science, Bodei:2019:MSI 764(??):30–41, April 11, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [1973] Chiara Bodei, Stefano Chessa, and 1879-2294 (electronic). URL http: Letterio Galletta. Measuring secu- //www.sciencedirect.com/science/ rity in IoT communications. The- article/pii/S0304397518300641. oretical Computer Science, 764(??): Das:2019:GRR 100–124, April 11, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [1970] Shantanu Das, Riccardo Focardi, 1879-2294 (electronic). URL http: Flaminia L. Luccio, Euripides Markou, //www.sciencedirect.com/science/ and Marco Squarcina. Gathering of article/pii/S0304397518307205. REFERENCES 300

Bozzelli:2019:WFI Feret:2019:P

[1974] Laura Bozzelli, Alberto Molinari, An- [1978] Jérôme Feret, Lo¨ıc Paulevé, and gelo Montanari, Adriano Peron, and David Safránek. Preface. Theo- Pietro Sala. Which fragments of retical Computer Science, 765(??):1– the interval temporal logic HS are 2, April 18, 2019. CODEN TC- tractable in model checking? The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 764(??): 1879-2294 (electronic). URL http: 125–144, April 11, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519302464. 1879-2294 (electronic). URL http: Johnson:2019:VCR //www.sciencedirect.com/science/ article/pii/S0304397518302330. [1979] Robert Johnson, Qing Dong, and Erik Winfree. Verifying chemical Giannini:2019:FRU reaction network implementations: a bisimulation approach. Theoret- [1975] Paola Giannini, Marco Servetto, Elena ical Computer Science, 765(??):3– Zucca, and James Cone. Flexible re- 46, April 18, 2019. CODEN TC- covery of uniqueness and immutabil- SCDI. ISSN 0304-3975 (print), ity. Theoretical Computer Science, 764 1879-2294 (electronic). URL (??):145–172, April 11, 2019. CODEN http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ article/pii/S0304397518300136. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Cardelli:2019:CCR article/pii/S0304397518305668. [1980] Luca Cardelli, Mirco Tribastone, Max Anonymous:2019:EBm Tschaikowski, and Andrea Vandin. Comparing chemical reaction networks: [1976] Anonymous. Editorial Board. The- a categorical and algorithmic perspec- oretical Computer Science, 765(??): tive. Theoretical Computer Science, ii, April 18, 2019. CODEN TC- 765(??):47–66, April 18, 2019. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519301434. article/pii/S0304397517309131. Kari:2019:Ea Shin:2019:VCR

[1977] Lila Kari. Editorial. Theoret- [1981] Seung Woo Shin, Chris Thachuk, and ical Computer Science, 765(??):iii, Erik Winfree. Verifying chemical reac- April 18, 2019. CODEN TC- tion network implementations: a path- SCDI. ISSN 0304-3975 (print), way decomposition approach. The- 1879-2294 (electronic). URL http: oretical Computer Science, 765(??): //www.sciencedirect.com/science/ 67–96, April 18, 2019. CODEN article/pii/S030439751930146X. TCSCDI. ISSN 0304-3975 (print), REFERENCES 301

1879-2294 (electronic). URL http: Jones, and Scott A. Smolka. Probabilis- //www.sciencedirect.com/science/ tic reachability for multi-parameter bi- article/pii/S0304397517307399. furcation analysis of cardiac alternans. Theoretical Computer Science, 765(??): Honorato-Zimmer:2019:CLP 158–169, April 18, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [1982] Ricardo Honorato-Zimmer, Andrew J. 1879-2294 (electronic). URL http: Millar, Gordon D. Plotkin, and Ar- //www.sciencedirect.com/science/ gyris Zardilis. Chromar, a lan- article/pii/S0304397518300823. guage of parameterised agents. The- oretical Computer Science, 765(??): Anonymous:2019:EBn 97–119, April 18, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [1986] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 766(??): //www.sciencedirect.com/science/ ii, April 25, 2019. CODEN TC- article/pii/S0304397517305996. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Kolcak:2019:PSA //www.sciencedirect.com/science/ [1983] Juraj Kolcák, David Safránek, Stefan article/pii/S0304397519301598. Haar, and Lo¨ıc Paulevé. Parameter Bazgan:2019:PAC space abstraction and unfolding semantics of discrete regulatory networks. [1987] Cristina Bazgan, Florent Foucaud, Theoretical Computer Science, 765(??): and Florian Sikora. Parameter- 120–144, April 18, 2019. CODEN ized and approximation complexity TCSCDI. ISSN 0304-3975 (print), of Partial VC Dimension. Theo- 1879-2294 (electronic). URL http: retical Computer Science, 766(??): //www.sciencedirect.com/science/ 1–15, April 25, 2019. CODEN article/pii/S0304397518301701. TCSCDI. ISSN 0304-3975 (print), Bernot:2019:GMH 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [1984] G. Bernot, J.-P. Comet, Z. Khalis, article/pii/S030439751830584X. A. Richard, and O. Roux. A genetically modified Hoare logic. The- Li:2019:ECE oretical Computer Science, 765(??): [1988] Xiaoyan Li, Jianxi Fan, Cheng- 145–157, April 18, 2019. CODEN Kuan Lin, Baolei Cheng, and Xi- TCSCDI. ISSN 0304-3975 (print), aohua Jia. The extra connectiv- 1879-2294 (electronic). URL http: ity, extra conditional diagnosabil- //www.sciencedirect.com/science/ ity and t/k-diagnosability of the article/pii/S030439751830080X. data center network DCell. The- Islam:2019:PRM oretical Computer Science, 766(??): 16–29, April 25, 2019. CODEN [1985] Md. Ariful Islam, Rance Cleaveland, TCSCDI. ISSN 0304-3975 (print), Flavio H. Fenton, Radu Grosu, Paul L. 1879-2294 (electronic). URL http: REFERENCES 302

//www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518305851. //www.sciencedirect.com/science/ article/pii/S0304397519301744. Chitturi:2019:SPT Anonymous:2019:EBp [1989] Bhadrachalam Chitturi and Priyanshu Das. Sorting permutations with trans- [1993] Anonymous. Editorial Board. The- positions in O(n3) amortized time. oretical Computer Science, 767(??): Theoretical Computer Science, 766 ii, May 3, 2019. CODEN TC- (??):30–37, April 25, 2019. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519301756. article/pii/S0304397518305863. Yang:2019:EFF Chang:2019:CCA [1994] Yuxing Yang, Jing Li, and Shiying Wang. Embedding fault-free Hamil- [1990] Jou-Ming Chang, Kung-Jui Pai, Ro- tonian paths with prescribed linear Yu Wu, and Jinn-Shyong Yang. The forests into faulty ternary n-cubes. 4-component connectivity of alter- Theoretical Computer Science, 767 nating group networks. Theoret- (??):1–15, May 3, 2019. CODEN ical Computer Science, 766(??):38– TCSCDI. ISSN 0304-3975 (print), 45, April 25, 2019. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518305917. //www.sciencedirect.com/science/ article/pii/S0304397518305899. Xiao:2019:IPT Henning:2019:AAS [1995] Yuzhi Xiao, Haixing Zhao, Yaping Mao, and Guanrong Chen. Invulner- [1991] Michael A. Henning and Arti Pandey. ability of planar two-tree networks. Algorithmic aspects of semitotal Theoretical Computer Science, 767 domination in graphs. Theoreti- (??):16–25, May 3, 2019. CODEN cal Computer Science, 766(??):46– TCSCDI. ISSN 0304-3975 (print), 57, April 25, 2019. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518305929. //www.sciencedirect.com/science/ article/pii/S0304397518305905. Elbassioni:2019:GPA

Anonymous:2019:EBo [1996] Khaled Elbassioni, Imran Rauf, and Saurabh Ray. A global parallel [1992] Anonymous. Editorial Board. The- algorithm for enumerating minimal oretical Computer Science, 767(??): transversals of geometric hypergraphs. i, May 3, 2019. CODEN TC- Theoretical Computer Science, 767 SCDI. ISSN 0304-3975 (print), (??):26–33, May 3, 2019. CODEN REFERENCES 303

TCSCDI. ISSN 0304-3975 (print), plexity results for identifying and 1879-2294 (electronic). URL http: locating-dominating codes. Theo- //www.sciencedirect.com/science/ retical Computer Science, 767(??): article/pii/S030439751830598X. 83–102, May 3, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Zhang:2019:RNV 1879-2294 (electronic). URL http: [1997] Zhen Zhang, Shu qiang Huang, Dong //www.sciencedirect.com/science/ Guo, and Yong-Hui Li. RVCCC: a new article/pii/S0304397518306054. variational network of cube-connected Anonymous:2019:EBq cycles and its topological properties. Theoretical Computer Science, 767 [2001] Anonymous. Editorial Board. The- (??):34–50, May 3, 2019. CODEN oretical Computer Science, 768(??): TCSCDI. ISSN 0304-3975 (print), ii, May 10, 2019. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518305991. //www.sciencedirect.com/science/ article/pii/S0304397519301847. Jiang:2019:EIB Howe:2019:ICS [1998] Peng Jiang, Fuchun Guo, and Yi Mu. Eﬃcient identity-based broadcast en- [2002] Jacob M. Howe, Andy King, and Axel cryption with keyword search against Simon. Incremental closure for sys- insider attacks for database systems. tems of two variables per inequal- Theoretical Computer Science, 767 ity. Theoretical Computer Science, 768 (??):51–72, May 3, 2019. CODEN (??):1–42, May 10, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518306017. article/pii/S0304397518307199. Ghosal:2019:RMM Vatandoost:2019:GML [1999] Pratik Ghosal, Meghana Nasre, and [2003] Mehdi Vatandoost, Ali Akbar Estaji, Prajakta Nimbhorkar. Rank-maximal and Rahimeh Pourkhandani. A gen- matchings — structure and algorithms. eralized modal logic in causal struc- Theoretical Computer Science, 767 tures. Theoretical Computer Science, (??):73–82, May 3, 2019. CODEN 768(??):43–53, May 10, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518306042. article/pii/S0304397519301045. Hudry:2019:UOS Cintula:2019:SHT [2000] Olivier Hudry and Antoine Lobstein. [2004] Petr Cintula, Denisa Diaconescu, and Unique (optimal) solutions: Com- George Metcalfe. Skolemization and REFERENCES 304

Herbrand theorems for lattice-valued ii, May 17, 2019. CODEN TC- logics. Theoretical Computer Science, SCDI. ISSN 0304-3975 (print), 768(??):54–75, May 10, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519302051. //www.sciencedirect.com/science/ Lafond:2019:WQC article/pii/S0304397519301057. [2009] Manuel Lafond and Celine Scor- Jay:2019:ICH navacca. On the Weighted Quar- [2005] Barry Jay. Intensional computation tet Consensus problem. Theoret- with higher-order functions. The- ical Computer Science, 769(??):1– oretical Computer Science, 768(??): 17, May 17, 2019. CODEN TC- 76–90, May 10, 2019. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518306108. article/pii/S0304397519301227. deBerg:2019:CDS Strassburger:2019:DPM [2010] Mark de Berg, S´andor Kisfaludi-Bak, and Gerhard Woeginger. The com- [2006] Lutz Straßburger. On the deci- plexity of Dominating Set in geo- sion problem for MELL. Theo- metric intersection graphs. The- retical Computer Science, 768(??): oretical Computer Science, 769(??): 91–98, May 10, 2019. CODEN 18–31, May 17, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519301288. article/pii/S0304397518306121. Hirsch:2019:AFQ Bazgan:2019:FPC [2007] Robin Hirsch, Marcel Jackson, and [2011] Cristina Bazgan, Thomas Pontoizeau, Tomasz Kowalski. Algebraic founda- and Zsolt Tuza. Finding a poten- tions for qualitative calculi and net- tial community in networks. The- works. Theoretical Computer Science, oretical Computer Science, 769(??): 768(??):99–116, May 10, 2019. CODEN 32–42, May 17, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519301471. article/pii/S0304397518306285. Anonymous:2019:EBr Dolev:2019:PSM [2008] Anonymous. Editorial Board. The- [2012] Shlomi Dolev, Juan A. Garay, Niv oretical Computer Science, 769(??): Gilboa, Vladimir Kolesnikov, and REFERENCES 305

Muni Venkateswarlu Kumaraman- Manoussakis:2019:NDT galam. Perennial secure multi-party computation of universal Turing ma- [2016] George Manoussakis. A new de- chine. Theoretical Computer Science, composition technique for maximal 769(??):43–62, May 17, 2019. CODEN clique enumeration for sparse graphs. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 770 1879-2294 (electronic). URL http: (??):25–33, May 24, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518306297. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Sadhu:2019:LTA article/pii/S0304397518306315. [2013] Sanjib Sadhu, Sasanka Roy, Sub- Gagie:2019:PQF has C. Nandy, and Suchismita Roy. Linear time algorithm to cover and [2017] Travis Gagie, Meng He, and Gon- hit a set of line segments optimally zalo Navarro. Path queries on func- by two axis-parallel squares. The- tions. Theoretical Computer Science, oretical Computer Science, 769(??): 770(??):34–50, May 24, 2019. CODEN 63–74, May 17, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751830642X. article/pii/S0304397518306303. See Durocher:2019:SLS corrigendum [2415]. Anonymous:2019:EBs [2018] Stephane Durocher and Robby Singh. A simple linear-space data structure for [2014] Anonymous. Editorial Board. The- constant-time range minimum query. oretical Computer Science, 770(??): Theoretical Computer Science, 770 ii, May 24, 2019. CODEN TC- (??):51–61, May 24, 2019. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519302221. article/pii/S0304397518306406. Pena:2019:EDO Telle:2019:FAD

[2015] N. Pena and A. Borodin. On ex- [2019] J. A. Telle and Y. Villanger. FPT tensions of the deterministic online algorithms for domination in sparse model for bipartite matching and max- graphs and beyond. Theoreti- sat. Theoretical Computer Science, 770 cal Computer Science, 770(??):62– (??):1–24, May 24, 2019. CODEN 68, May 24, 2019. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518306327. article/pii/S0304397518306510. REFERENCES 306

Le:2019:CDM Vitanyi:2019:CRD

[2020] Hoang-Oanh Le and Van Bang Le. A [2024] P. M. B. Vitányi. Corrigendum to complexity dichotomy for matching cut “On the rate of decrease in logi- in (bipartite) graphs of fixed diame- cal depth” [Theor. Comput. Sci. 702 ter. Theoretical Computer Science, 770 (2017) 60–64] by L. F. Antunes, (??):69–78, May 24, 2019. CODEN A. Souto, and P. M. B. Vitányi. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 770 1879-2294 (electronic). URL http: (??):101, May 24, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518306509. 1879-2294 (electronic). URL http: Kowaluk:2019:FDD //www.sciencedirect.com/science/ article/pii/S0304397518304900. See [2021] Miroslaw Kowaluk and Andrzej Lingas. [1467]. A fast deterministic detection of small pattern graphs in graphs without large Anonymous:2019:EBt cliques. Theoretical Computer Science, [2025] Anonymous. Editorial Board. The- 770(??):79–87, May 24, 2019. CODEN oretical Computer Science, 771(??): TCSCDI. ISSN 0304-3975 (print), ii, June 1, 2019. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518306492. //www.sciencedirect.com/science/ Lazard:2019:ELR article/pii/S0304397519302282. [2022] Sylvain Lazard, William J. Lenhart, Gharahi:2019:OLS and Giuseppe Liotta. On the edge- length ratio of outerplanar graphs. [2026] Motahhareh Gharahi and Shahram Theoretical Computer Science, 770 Khazaei. Optimal linear secret shar- (??):88–94, May 24, 2019. CODEN ing schemes for graph access struc- TCSCDI. ISSN 0304-3975 (print), tures on six participants. Theo- 1879-2294 (electronic). URL http: retical Computer Science, 771(??): //www.sciencedirect.com/science/ 1–8, June 1, 2019. CODEN TC- article/pii/S0304397518306078. See SCDI. ISSN 0304-3975 (print), corrigendum [2416]. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Harju:2019:SFA article/pii/S0304397518306789. [2023] Tero Harju. On square-free arith- Ravelo:2019:PMC metic progressions in infinite words. Theoretical Computer Science, 770 [2027] Santiago Valdés Ravelo and Car- (??):95–100, May 24, 2019. CODEN los Eduardo Ferreira. A PTAS TCSCDI. ISSN 0304-3975 (print), for the metric case of the opti- 1879-2294 (electronic). URL http: mum weighted source-destination com- //www.sciencedirect.com/science/ munication spanning tree problem. article/pii/S0304397518306030. Theoretical Computer Science, 771 REFERENCES 307

(??):9–22, June 1, 2019. CODEN Dinesh:2019:ASS TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2031] Krishnamoorthy Dinesh and Jayalal //www.sciencedirect.com/science/ Sarma. Alternation, sparsity and article/pii/S0304397518306790. sensitivity: Bounds and exponential gaps. Theoretical Computer Science, Rusu:2019:MCF 771(??):71–82, June 1, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2028] Irena Rusu. Min (a)cyclic feedback 1879-2294 (electronic). URL http: vertex sets and min ones monotone 3- //www.sciencedirect.com/science/ SAT. Theoretical Computer Science, article/pii/S0304397518307059. 771(??):23–38, June 1, 2019. CODEN Farbstein:2019:DT TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2032] Boaz Farbstein and Asaf Levin. Dead- //www.sciencedirect.com/science/ line TSP. Theoretical Computer Sci- article/pii/S0304397518306807. ence, 771(??):83–92, June 1, 2019. CODEN TCSCDI. ISSN 0304- Araujo:2019:WPO 3975 (print), 1879-2294 (electronic). URL http://www.sciencedirect. [2029] Júlio Araújo, Cláudia Linhares Sales, com/science/article/pii/S0304397518307060. Ignasi Sau, and Ana Silva. Weighted Dong:2019:HMT proper orientations of trees and graphs of bounded treewidth. Theoreti- [2033] Qiang Dong and Xi Wang. How cal Computer Science, 771(??):39– many triangles and quadrilaterals are 48, June 1, 2019. CODEN TC- there in an n-dimensional augmented SCDI. ISSN 0304-3975 (print), cube? Theoretical Computer Science, 1879-2294 (electronic). URL http: 771(??):93–98, June 1, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518307035. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Aung:2019:FHE article/pii/S0304397518306686. Anonymous:2019:EBu [2030] Khin Mi Mi Aung, Hyung Tae Lee, Benjamin Hong Meng Tan, [2034] Anonymous. Editorial Board. The- and Huaxiong Wang. Fully homo- oretical Computer Science, 772(??): morphic encryption over the inte- ii, June 7, 2019. CODEN TC- gers for non-binary plaintexts with- SCDI. ISSN 0304-3975 (print), out the sparse subset sum problem. 1879-2294 (electronic). URL http: Theoretical Computer Science, 771 //www.sciencedirect.com/science/ (??):49–70, June 1, 2019. CODEN article/pii/S030439751930235X. TCSCDI. ISSN 0304-3975 (print), Zhou:2019:GCC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2035] Yanwei Zhou, Bo Yang, and Yi Mu. article/pii/S0304397518307047. The generic construction of contin- REFERENCES 308

uous leakage-resilient identity-based Bournat:2019:SSR cryptosystems. Theoretical Com- puter Science, 772(??):1–45, June 7, [2039] Marjorie Bournat, Ajoy K. Datta, 2019. CODEN TCSCDI. ISSN 0304- and Swan Dubois. Self-stabilizing 3975 (print), 1879-2294 (electronic). robots in highly dynamic environ- URL http://www.sciencedirect. ments. Theoretical Computer Science, com/science/article/pii/S0304397518307096772(??):88–110,. June 7, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Ehard:2019:VYT 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2036] Stefan Ehard and Dieter Rauten- article/pii/S0304397518307163. bach. Vaccinate your trees! The- Ito:2019:RCS oretical Computer Science, 772(??): 46–57, June 7, 2019. CODEN [2040] Takehiro Ito and Yota Otachi. Re- TCSCDI. ISSN 0304-3975 (print), configuration of colorable sets in 1879-2294 (electronic). URL http: classes of perfect graphs. Theo- //www.sciencedirect.com/science/ retical Computer Science, 772(??): article/pii/S0304397518307084. 111–122, June 7, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Navarro:2019:DLR 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2037] Gonzalo Navarro. Document list- article/pii/S030439751830714X. ing on repetitive collections with guaranteed performance. Theoret- Xue:2019:ACG ical Computer Science, 772(??):58– 72, June 7, 2019. CODEN TC- [2041] Jie Xue, Huiqiu Lin, and Jinlong SCDI. ISSN 0304-3975 (print), Shu. The algebraic connectivity of 1879-2294 (electronic). URL http: graphs with given circumference. The- //www.sciencedirect.com/science/ oretical Computer Science, 772(??): article/pii/S0304397518307126. 123–131, June 7, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Alizadeh:2019:IOM 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2038] Behrooz Alizadeh, Esmaeil Afrashteh, article/pii/S0304397518307266. and Fahimeh Baroughi. Inverse ob- Kolay:2019:HCP noxious p-median location problems on trees with edge length modifica- [2042] Sudeshna Kolay, Ragukumar Pan- tions under different norms. The- durangan, Fahad Panolan, Venkatesh oretical Computer Science, 772(??): Raman, and Prafullkumar Tale. Har- 73–87, June 7, 2019. CODEN monious coloring: Parameterized al- TCSCDI. ISSN 0304-3975 (print), gorithms and upper bounds. The- 1879-2294 (electronic). URL http: oretical Computer Science, 772(??): //www.sciencedirect.com/science/ 132–142, June 7, 2019. CODEN article/pii/S0304397518307102. TCSCDI. ISSN 0304-3975 (print), REFERENCES 309

1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518307321. //www.sciencedirect.com/science/ article/pii/S0304397518304109. Le:2019:MGH PourAliAkbar:2019:EDR [2043] Hoang-Oanh Le and Van Bang Le. Map graphs having witnesses of large girth. [2047] Ehsan PourAliAkbar and Mohammad Theoretical Computer Science, 772(??): Mosleh. An efficient design for re- 143–148, June 7, 2019. CODEN versible Wallace unsigned multiplier. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 773 1879-2294 (electronic). URL http: (??):43–52, June 14, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751830731X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Anonymous:2019:EBv article/pii/S0304397518304158. [2044] Anonymous. Editorial Board. The- Oliveto:2019:BRU oretical Computer Science, 773(??): ii, June 14, 2019. CODEN TC- [2048] Pietro S. Oliveto, Dirk Sudholt, and SCDI. ISSN 0304-3975 (print), Christine Zarges. On the benefits 1879-2294 (electronic). URL http: and risks of using fitness sharing //www.sciencedirect.com/science/ for multimodal optimisation. The- article/pii/S0304397519302427. oretical Computer Science, 773(??): 53–70, June 14, 2019. CODEN Espitia:2019:CPC TCSCDI. ISSN 0304-3975 (print), [2045] Helbert Eduardo Espitia and Jorge Iván 1879-2294 (electronic). URL http: Sofrony. Considerations for param- //www.sciencedirect.com/science/ eter configuration on Vortex Par- article/pii/S0304397518304882. ticle Swarm Optimization. Theo- Sartakhti:2019:CPL retical Computer Science, 773(??): 1–26, June 14, 2019. CODEN [2049] Javad Salimi Sartakhti and Saeed TCSCDI. ISSN 0304-3975 (print), Jalili. On the computational power 1879-2294 (electronic). URL http: of the light: a plan for breaking //www.sciencedirect.com/science/ Data Encryption Standard. The- article/pii/S0304397518303402. oretical Computer Science, 773(??): 71–78, June 14, 2019. CODEN Dinh:2019:CCD TCSCDI. ISSN 0304-3975 (print), [2046] Hai Q. Dinh, Abhay Kumar Singh, 1879-2294 (electronic). URL http: Sukhamoy Pattanayak, and Songsak //www.sciencedirect.com/science/ Sriboonchitta. Construction of cyclic article/pii/S0304397518305310. h − DNA codes over the ring Z4[u]/ u2 Becker:2019:TRS 1i based on the deletion distance. Theoretical Computer Science, 773 [2050] Ruben Becker, Vincenzo Bonifaci, (??):27–42, June 14, 2019. CODEN Andreas Karrenbauer, Pavel Kolev, REFERENCES 310

and Kurt Mehlhorn. Two results Anonymous:2019:EBw on slime mold computations. The- oretical Computer Science, 773(??): [2054] Anonymous. Editorial Board. The- 79–106, June 14, 2019. CODEN oretical Computer Science, 774(??): TCSCDI. ISSN 0304-3975 (print), ii, June 25, 2019. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518305590. //www.sciencedirect.com/science/ article/pii/S0304397519302518. Wang:2019:GNE Zhang:2019:DDL

[2051] Shiying Wang and Mujiangshan Wang. [2055] Kejia Zhang, Qilong Han, Zhipeng The g-good-neighbor and g-extra di- Cai, Guisheng Yin, and Junyu Lin. agnosability of networks. Theo- DOAMI: a distributed on-line algo- retical Computer Science, 773(??): rithm to minimize interference for 107–114, June 14, 2019. CODEN routing in wireless sensor networks. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 774 1879-2294 (electronic). URL http: (??):1–13, June 25, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751830567X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Doerr:2019:ARS article/pii/S0304397516302298. Mahmoody:2019:OSA [2052] Benjamin Doerr. Analyzing randomized search heuristics via stochastic [2056] Ahmad Mahmoody and Eli Upfal. domination. Theoretical Computer Optimizing static and adaptive prob- Science, 773(??):115–137, June 14, ing schedules for rapid event detec- 2019. CODEN TCSCDI. ISSN 0304- tion. Theoretical Computer Science, 3975 (print), 1879-2294 (electronic). 774(??):14–30, June 25, 2019. CODEN URL http://www.sciencedirect. TCSCDI. ISSN 0304-3975 (print), com/science/article/pii/S03043975183059541879-2294. (electronic). URL http: //www.sciencedirect.com/science/ Pan:2019:EDG article/pii/S0304397516302274. Ding:2019:ARC [2053] Minghua Pan, Daowen Qiu, Paulo Ma- teus, and Jozef Gruska. Entangling [2057] Wei Ding and Ke Qiu. Approximat- and disentangling in Grover’s search ing the restricted 1-center in graphs. algorithm. Theoretical Computer Theoretical Computer Science, 774 Science, 773(??):138–152, June 14, (??):31–43, June 25, 2019. CODEN 2019. CODEN TCSCDI. ISSN 0304- TCSCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397518306066article/pii/S0304397516302237. . REFERENCES 311

Huang:2019:MDC Xu:2019:DMM [2058] Fei Huang, Xueliang Li, Zhongmei Qin, [2062] Yi Xu, Jigen Peng, Yinfeng Xu, and and Colton Magnant. Minimum degree Binhai Zhu. The discrete and mixed condition for proper connection num- minimax 2-center problems. The- ber 2. Theoretical Computer Science, oretical Computer Science, 774(??): 774(??):44–50, June 25, 2019. CODEN 95–102, June 25, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516302213. article/pii/S0304397516302936. Kawase:2019:PCB Miao:2019:VCC [2059] Yasushi Kawase, Xin Han, and [2063] Dongjing Miao, Xianmin Liu, Ying- Kazuhisa Makino. Proportional cost shu Li, and Jianzhong Li. Ver- buyback problem with weight bounds. tex cover in conﬂict graphs. The- Theoretical Computer Science, 774 oretical Computer Science, 774(??): (??):51–64, June 25, 2019. CODEN 103–112, June 25, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516302419. article/pii/S0304397516303231. Tian:2019:MCO Xu:2019:RLC [2060] Cong Tian and Zhenhua Duan. Model [2064] Chao Xu, Jianer Chen, and Jianxin checking open systems with alternat- Wang. Resolution and linear ing projection temporal logic. The- CNF formulas: Improved (n, 3)- oretical Computer Science, 774(??): MaxSAT algorithms. Theoretical 65–81, June 25, 2019. CODEN Computer Science, 774(??):113–123, TCSCDI. ISSN 0304-3975 (print), June 25, 2019. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397516302559. //www.sciencedirect.com/science/ article/pii/S0304397516303954. Zhao:2019:MCP Takaoka:2019:ATS [2061] Liang Zhao, Xiaobing Wang, and Zhen- hua Duan. Model checking of push- [2065] Tadao Takaoka. Algebraic theory on down systems for projection temporal shortest paths for all ﬂows. The- logic. Theoretical Computer Science, oretical Computer Science, 774(??): 774(??):82–94, June 25, 2019. CODEN 124–132, June 25, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397516302766. article/pii/S0304397516303942. REFERENCES 312

Armaselu:2019:DMB //www.sciencedirect.com/science/ article/pii/S0304397518307151. [2066] Bogdan Armaselu and Ovidiu Daescu. Dynamic minimum bichromatic sep- Colucci:2019:TPC arating circle. Theoretical Computer [2070] Lucas Colucci, Péter L. Erd˝os, Ervin Science, 774(??):133–142, June 25, Györi, and Tamás Róbert Mezei. 2019. CODEN TCSCDI. ISSN 0304- Terminal-pairability in complete bi- 3975 (print), 1879-2294 (electronic). partite graphs with non-bipartite de- URL http://www.sciencedirect. mands: Edge-disjoint paths in com- com/science/article/pii/S0304397516307046plete. bipartite graphs. Theoreti- Xu:2019:IAA cal Computer Science, 775(??):16– 25, July 5, 2019. CODEN TC- [2067] Yicheng Xu, Dachuan Xu, Donglei Du, SCDI. ISSN 0304-3975 (print), and Chenchen Wu. Improved approx- 1879-2294 (electronic). URL http: imation algorithm for universal facil- //www.sciencedirect.com/science/ ity location problem with linear penal- article/pii/S030439751830728X. ties. Theoretical Computer Science, 774 (??):143–151, June 25, 2019. CODEN Ahadi:2019:CGM TCSCDI. ISSN 0304-3975 (print), [2071] Arash Ahadi and Alireza Zarei. Con- 1879-2294 (electronic). URL http: necting guards with minimum Steiner //www.sciencedirect.com/science/ points inside simple polygons. The- article/pii/S0304397517302086. oretical Computer Science, 775(??): Anonymous:2019:EBx 26–31, July 5, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2068] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 775(??): //www.sciencedirect.com/science/ ii, July 5, 2019. CODEN TC- article/pii/S0304397518307291. SCDI. ISSN 0304-3975 (print), Zhang:2019:GCT 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2072] Xiao Zhang, Shengli Liu, Dawu Gu, article/pii/S0304397519302609. and Joseph K. Liu. A generic construction of tightly secure signatures Khoshkhah:2019:CAE in the multi-user setting. Theoret- [2069] Kaveh Khoshkhah, Mehdi Khosra- ical Computer Science, 775(??):32– vian Ghadikolaei, Jérôme Monnot, 52, July 5, 2019. CODEN TC- and Dirk Oliver Theis. Complex- SCDI. ISSN 0304-3975 (print), ity and approximability of extended 1879-2294 (electronic). URL http: Spanning Star Forest problems in //www.sciencedirect.com/science/ general and complete graphs. The- article/pii/S0304397518307333. oretical Computer Science, 775(??): Chatterjee:2019:CCT 1–15, July 5, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), [2073] Tanima Chatterjee, Bhaskar Das- 1879-2294 (electronic). URL http: Gupta, Nasim Mobasheri, Venkatku- REFERENCES 313

mar Srinivasan, and Ismael G. Yero. //www.sciencedirect.com/science/ On the computational complexities of article/pii/S0304397518307527. three problems related to a privacy measure for large networks under active Anonymous:2019:EBy attack. Theoretical Computer Science, 775(??):53–67, July 5, 2019. CODEN [2077] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 776(??): 1879-2294 (electronic). URL http: ii, July 12, 2019. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397518307345. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Bonardo:2019:NVF article/pii/S0304397519302671.

[2074] Pierre Bonardo, Anna E. Frid, and Russo:2019:SST Jeﬀrey Shallit. The number of valid factorizations of Fibonacci preﬁxes. [2078] Lu´ıs M. S. Russo. A study on splay Theoretical Computer Science, 775 trees. Theoretical Computer Science, (??):68–75, July 5, 2019. CODEN 776(??):1–18, July 12, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518307497. article/pii/S0304397518307539.

Genc:2019:CSR Goyal:2019:BAG

[2075] Begum Genc, Mohamed Siala, Gilles [2079] Navin Goyal and Manoj Gupta. Bet- Simonin, and Barry O’Sullivan. Com- ter analysis of GREEDY binary search plexity study for the robust sta- tree on decomposable sequences. The- ble marriage problem. Theoreti- oretical Computer Science, 776(??): cal Computer Science, 775(??):76– 19–42, July 12, 2019. CODEN 92, July 5, 2019. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518307540. article/pii/S0304397518307503. Jain:2019:ICP Gurski:2019:KPP [2080] Sanjay Jain and Eﬁm Kinber. In- [2076] Frank Gurski, Carolin Rehs, and trinsic complexity of partial learn- Jochen Rethmann. Knapsack probing. Theoretical Computer Science, 776 lems: a parameterized point of view. (??):43–63, July 12, 2019. CODEN Theoretical Computer Science, 775 TCSCDI. ISSN 0304-3975 (print), (??):93–108, July 5, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518307552. REFERENCES 314

Bang-Jensen:2019:DCP Wu:2019:STS

[2081] Jørgen Bang-Jensen and Stéphane [2085] Guangwei Wu, Jianer Chen, and Bessy. Degree-constrained 2-partitions Jianxin Wang. Scheduling two-stage of graphs. Theoretical Computer Sci- jobs on multiple flowshops. The- ence, 776(??):64–74, July 12, 2019. oretical Computer Science, 776(??): CODEN TCSCDI. ISSN 0304- 117–124, July 12, 2019. CODEN 3975 (print), 1879-2294 (electronic). TCSCDI. ISSN 0304-3975 (print), URL http://www.sciencedirect. 1879-2294 (electronic). URL http: com/science/article/pii/S0304397519300015//www.sciencedirect.com/science/. article/pii/S0304397519300428. Lintzmayer:2019:OCS Park:2019:DPC [2082] Carla Negri Lintzmayer, Flávio Keidi Miyazawa, and Eduardo Candido [2086] Jung-Heum Park, Jae-Hoon Kim, and Xavier. Online circle and sphere pack- Hyeong-Seok Lim. Disjoint path ing. Theoretical Computer Science, 776 covers joining prescribed source and (??):75–94, July 12, 2019. CODEN sink sets in interval graphs. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 776(??): 1879-2294 (electronic). URL http: 125–137, July 12, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519300179. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Bohm:2019:OPS article/pii/S0304397519300441. [2083] Martin Böhm, Marek Chrobak,Lukasz Gu:2019:FDD Je˙z, Fei Li, Jiˇr´ı Sgall, and Pavel Veselý. Online packet scheduling with [2087] Mei-Mei Gu, Rong-Xia Hao, and bounded delay and lookahead. The- Shuming Zhou. Fault diagnosabil- oretical Computer Science, 776(??): ity of data center networks. The- 95–113, July 12, 2019. CODEN oretical Computer Science, 776(??): TCSCDI. ISSN 0304-3975 (print), 138–147, July 12, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751930026X. //www.sciencedirect.com/science/ article/pii/S0304397519300453. Litow:2019:EDD Anonymous:2019:EBz [2084] B. Litow. Existential Diophantine definability of string length. The- [2088] Anonymous. Editorial Board. The- oretical Computer Science, 776(??): oretical Computer Science, 777(??): 114–116, July 12, 2019. CODEN ii, July 19, 2019. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519300271. article/pii/S0304397519302762. REFERENCES 315

Ausiello:2019:P 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2089] Giorgio Ausiello, Lila Kari, Grzegorz article/pii/S0304397518306522. Rozenberg, Donald Sannella, Paul Spi- rakis, and Pierre-Louis Curien. Pref- Beaton:2019:EFF ace. Theoretical Computer Science, [2093] Nicholas R. Beaton, Mathilde Bouvel, 777(??):1–2, July 19, 2019. CODEN Veronica Guerrini, and Simone Rinaldi. TCSCDI. ISSN 0304-3975 (print), Enumerating five families of pattern- 1879-2294 (electronic). URL http: avoiding inversion sequences; and in- //www.sciencedirect.com/science/ troducing the powered Catalan num- article/pii/S0304397519302725. bers. Theoretical Computer Science, Aceto:2019:WPF 777(??):69–92, July 19, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2090] Luca Aceto, Dario Della Monica, Igna- 1879-2294 (electronic). URL http: cio Fábregas, and Anna Ingólfsdóttir. //www.sciencedirect.com/science/ When are prime formulae character- article/pii/S0304397519300933. istic? Theoretical Computer Science, 777(??):3–31, July 19, 2019. CODEN Berthe:2019:BCS TCSCDI. ISSN 0304-3975 (print), [2094] Valérie Berthé and Paulina Cecchi 1879-2294 (electronic). URL http: Bernales. Balancedness and cobound- //www.sciencedirect.com/science/ aries in symbolic systems. The- article/pii/S0304397518307254. oretical Computer Science, 777(??): Alvim:2019:AIF 93–110, July 19, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2091] Mário S. Alvim, Konstantinos Chatzikoko- 1879-2294 (electronic). URL http: lakis, Annabelle McIver, Carroll Mor- //www.sciencedirect.com/science/ gan, Catuscia Palamidessi, and Ge- article/pii/S0304397518305772. offrey Smith. An axiomatization of Blanchette:2019:QAS information flow measures. The- oretical Computer Science, 777(??): [2095] Benjamin Blanchette, Christian Chof- 32–54, July 19, 2019. CODEN frut, and Christophe Reutenauer. TCSCDI. ISSN 0304-3975 (print), Quasi-automatic semigroups. The- 1879-2294 (electronic). URL http: oretical Computer Science, 777(??): //www.sciencedirect.com/science/ 111–120, July 19, 2019. CODEN article/pii/S0304397518306376. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Anselmo:2019:FSP //www.sciencedirect.com/science/ [2092] Marcella Anselmo, Dora Giammar- article/pii/S0304397519300155. resi, and Maria Madonia. Full sets Brzozowski:2019:SCP of pictures to encode pictures. The- oretical Computer Science, 777(??): [2096] Janusz A. Brzozowski, Sylvie Davies, 55–68, July 19, 2019. CODEN and Abhishek Madan. State com- TCSCDI. ISSN 0304-3975 (print), plexity of pattern matching in regu- REFERENCES 316

lar languages. Theoretical Computer case of formal languages. Theo- Science, 777(??):121–131, July 19, retical Computer Science, 777(??): 2019. CODEN TCSCDI. ISSN 0304- 192–203, July 19, 2019. CODEN 3975 (print), 1879-2294 (electronic). TCSCDI. ISSN 0304-3975 (print), URL http://www.sciencedirect. 1879-2294 (electronic). URL http: com/science/article/pii/S0304397518307357//www.sciencedirect.com/science/. article/pii/S030439751830608X. Cardelli:2019:SCD

[2097] Luca Cardelli, Mirco Tribastone, Dershowitz:2019:DCA Max Tschaikowski, and Andrea Vandin. Symbolic computation of [2101] Nachum Dershowitz and Jean-Pierre differential equivalences. Theoreti- Jouannaud. Drags: a compositional cal Computer Science, 777(??):132– algebraic framework for graph rewrit- 154, July 19, 2019. CODEN TC- ing. Theoretical Computer Science, 777 SCDI. ISSN 0304-3975 (print), (??):204–231, July 19, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519301719. //www.sciencedirect.com/science/ article/pii/S0304397519300544. Chen:2019:ASE Dolce:2019:GLW [2098] Jing Chen and Silvio Micali. Algorand: a secure and efficient distributed ledger. Theoretical Computer Science, 777(??): [2102] Francesco Dolce, Antonio Restivo, 155–183, July 19, 2019. CODEN and Christophe Reutenauer. On TCSCDI. ISSN 0304-3975 (print), generalized Lyndon words. Theo- 1879-2294 (electronic). URL http: retical Computer Science, 777(??): //www.sciencedirect.com/science/ 232–242, July 19, 2019. CODEN article/pii/S030439751930091X. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Coquand:2019:CND //www.sciencedirect.com/science/ article/pii/S0304397518307369. [2099] Thierry Coquand. Canonicity and normalization for dependent type the- Dondi:2019:TFD ory. Theoretical Computer Science, 777 (??):184–191, July 19, 2019. CODEN [2103] Riccardo Dondi, Giancarlo Mauri, and TCSCDI. ISSN 0304-3975 (print), Italo Zoppis. On the tractability of 1879-2294 (electronic). URL http: finding disjoint clubs in a network. //www.sciencedirect.com/science/ Theoretical Computer Science, 777(??): article/pii/S0304397519300325. 243–251, July 19, 2019. CODEN Dassow:2019:OCI TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2100] Jürgen Dassow. On the orbit of //www.sciencedirect.com/science/ closure-involution operations — the article/pii/S030439751930218X. REFERENCES 317

Droste:2019:WSR Frosini:2019:TRC

[2104] Manfred Droste, Sven Dziadek, and [2108] Andrea Frosini and Laurent Vuil- Werner Kuich. Weighted simple lon. Tomographic reconstruction reset pushdown automata. Theo- of 2-convex polyominoes using dual retical Computer Science, 777(??): Horn clauses. Theoretical Computer 252–259, July 19, 2019. CODEN Science, 777(??):329–337, July 19, TCSCDI. ISSN 0304-3975 (print), 2019. CODEN TCSCDI. ISSN 0304- 1879-2294 (electronic). URL http: 3975 (print), 1879-2294 (electronic). //www.sciencedirect.com/science/ URL http://www.sciencedirect. article/pii/S0304397519300337. com/science/article/pii/S0304397519300076.

Endrullis:2019:BTR Gerard:2019:RSC

[2105] J¨org Endrullis and Jan Willem Klop. [2109] Yan Gerard. Regular switching Braids via term rewriting. The- components. Theoretical Computer oretical Computer Science, 777(??): Science, 777(??):338–355, July 19, 260–295, July 19, 2019. CODEN 2019. CODEN TCSCDI. ISSN 0304- TCSCDI. ISSN 0304-3975 (print), 3975 (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: URL http://www.sciencedirect. //www.sciencedirect.com/science/ com/science/article/pii/S0304397519300234. article/pii/S0304397518307278. Ibarra:2019:CFS Engeler:2019:NAH [2110] Oscar H. Ibarra, Ian McQuillan, and [2106] E. Engeler. Neural algebra on Bala Ravikumar. On counting func- “how does the brain think?”. The- tions and slenderness of languages. oretical Computer Science, 777(??): Theoretical Computer Science, 777(??): 296–307, July 19, 2019. CODEN 356–378, July 19, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519302117. article/pii/S0304397518307114.

Etessami:2019:RSG Kari:2019:NCP

[2107] Kousha Etessami, Dominik Wojtczak, [2111] Jarkko Kari and Etienne Moutot. Ni- and Mihalis Yannakakis. Recursive vat’s conjecture and pattern com- stochastic games with positive rewards. plexity in algebraic subshifts. The- Theoretical Computer Science, 777(??): oretical Computer Science, 777(??): 308–328, July 19, 2019. CODEN 379–386, July 19, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518307515. article/pii/S0304397519300088. REFERENCES 318

Kimoto:2019:MCR TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2112] Nobuya Kimoto, Ken Komiya, Kenzo //www.sciencedirect.com/science/ Fujimoto, and Satoshi Kobayashi. article/pii/S0304397519300659. Monotonically controlling right linear grammars with unknown behav- Orellana-Martin:2019:PCE iors to output a target string. The- [2116] David Orellana-Mart´ın, Luis Valencia- oretical Computer Science, 777(??): Cabrera, Agust´ın Riscos-Núñez, and 387–408, July 19, 2019. CODEN Mario J. Pérez-Jiménez. A path TCSCDI. ISSN 0304-3975 (print), to computational efficiency through 1879-2294 (electronic). URL http: membrane computing. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 777(??):443– article/pii/S0304397519300222. 453, July 19, 2019. CODEN TC- Kobayashi:2019:IBF SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2113] Naoki Kobayashi. Inclusion be- //www.sciencedirect.com/science/ tween the frontier language of a article/pii/S0304397519300027. non-deterministic recursive program scheme and the Dyck language is Rampersad:2019:CEI undecidable. Theoretical Computer [2117] Narad Rampersad, Jeffrey Shallit, and Science, 777(??):409–416, July 19, Elise´ Vandomme. Critical exponents 2019. CODEN TCSCDI. ISSN 0304- of infinite balanced words. The- 3975 (print), 1879-2294 (electronic). oretical Computer Science, 777(??): URL http://www.sciencedirect. 454–463, July 19, 2019. CODEN com/science/article/pii/S0304397519300283TCSCDI.. ISSN 0304-3975 (print), Okhotin:2019:EDN 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2114] Alexander Okhotin and Kai Salomaa. article/pii/S0304397518306388. Edit distance neighbourhoods of input- vanLeeuwen:2019:QAH driven pushdown automata. The- oretical Computer Science, 777(??): [2118] Jan van Leeuwen and Jir´ı Wiedermann. 417–430, July 19, 2019. CODEN Question answering by humans and TCSCDI. ISSN 0304-3975 (print), machines: a complexity-theoretic view. 1879-2294 (electronic). URL http: Theoretical Computer Science, 777(??): //www.sciencedirect.com/science/ 464–473, July 19, 2019. CODEN article/pii/S0304397519301525. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Okubo:2019:DFC //www.sciencedirect.com/science/ [2115] Fumiya Okubo and Takashi Yoko- article/pii/S0304397518305280. mori. Decomposition and factoriza- Wu:2019:CPA tion of chemical reaction transducers. Theoretical Computer Science, 777 [2119] Tingfang Wu, Linqiang Pan, and Ar- (??):431–442, July 19, 2019. CODEN tiom Alhazov. Computation power REFERENCES 319

of asynchronous spiking neural P 46, July 26, 2019. CODEN TC- systems with polarizations. The- SCDI. ISSN 0304-3975 (print), oretical Computer Science, 777(??): 1879-2294 (electronic). URL http: 474–489, July 19, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519300507. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Mohan:2019:PDC article/pii/S0304397518306455. Anonymous:2019:EBba [2124] Chris Monica Mohan, Samivel San- thakumar, Micheal Arockiaraj, and [2120] Anonymous. Editorial Board. The- Jia-Bao Liu. Partition dimension of oretical Computer Science, 778(??): certain classes of series parallel graphs. ii, July 26, 2019. CODEN TC- Theoretical Computer Science, 778 SCDI. ISSN 0304-3975 (print), (??):47–60, July 26, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519302932. //www.sciencedirect.com/science/ article/pii/S0304397519300519. Zhao:2019:PCG [2121] Xiao Zhao and Sheng Chen. Proper Kao:2019:TAP 2-coloring game on some trees. The- oretical Computer Science, 778(??): [2125] Mong-Jen Kao, Jia-Yau Shiau, Ching- 1–18, July 26, 2019. CODEN Chi Lin, and D. T. Lee. Tight ap- TCSCDI. ISSN 0304-3975 (print), proximation for partial vertex cover 1879-2294 (electronic). URL http: with hard capacities. Theoreti- //www.sciencedirect.com/science/ cal Computer Science, 778(??):61– article/pii/S0304397519300465. 72, July 26, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), Giannakopoulos:2019:ASM 1879-2294 (electronic). URL http: [2122] Yiannis Giannakopoulos, Elias Kout- //www.sciencedirect.com/science/ soupias, and Maria Kyropoulou. The article/pii/S0304397519300520. anarchy of scheduling without money. Theoretical Computer Science, 778 Heckenberger:2019:PLB (??):19–32, July 26, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2126] I. Heckenberger and J. Sawada. A 1879-2294 (electronic). URL http: Pascal-like bound for the number of //www.sciencedirect.com/science/ necklaces with ﬁxed density. The- article/pii/S0304397519300477. oretical Computer Science, 778(??): Kline:2019:GSH 73–77, July 26, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2123] Jeﬀery Kline. Geometric search 1879-2294 (electronic). URL http: for Hadamard matrices. Theoret- //www.sciencedirect.com/science/ ical Computer Science, 778(??):33– article/pii/S0304397519300556. REFERENCES 320

Vitanyi:2019:LDR Cicerone:2019:AAD

[2127] Paul M. B. Vit´anyi. Logical depth [2131] Seraﬁno Cicerone and Gabriele Di Ste- for reversible Turing machines with an fano. Approximation algorithms for de- application to the rate of decrease in composing octilinear polygons. The- logical depth for general Turing ma- oretical Computer Science, 779(??): chines. Theoretical Computer Science, 17–36, August 2, 2019. CODEN 778(??):78–80, July 26, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519300787. article/pii/S0304397519300568. Mohabeddine:2019:NRT Anonymous:2019:EBbb [2132] Amine Mohabeddine and Mourad [2128] Anonymous. Editorial Board. The- Boudhar. New results in two iden- oretical Computer Science, 779(??): tical machines scheduling with agree- ii, August 2, 2019. CODEN TC- ment graphs. Theoretical Com- SCDI. ISSN 0304-3975 (print), puter Science, 779(??):37–46, Au- 1879-2294 (electronic). URL http: gust 2, 2019. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397519303305. 1879-2294 (electronic). URL http: Abam:2019:VTC //www.sciencedirect.com/science/ article/pii/S0304397519300799. [2129] Mohammad Ali Abam, Sharareh Alipour, Mohammad Ghodsi, and Mo- Han:2019:QAD hammad Mahdian. Visibility testing and counting for uncertain seg- [2133] Shuai Han, Shengli Liu, and Lin Lyu. ments. Theoretical Computer Science, QANIZK for adversary-dependent lan- 779(??):1–7, August 2, 2019. CODEN guages and their applications. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 779(??): 1879-2294 (electronic). URL http: 47–71, August 2, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519300763. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Zhang:2019:PCF article/pii/S0304397519300829. [2130] Guozhen Zhang and Shangwei Lin. Bhattacharya:2019:NAC Path and cycle fault tolerance of bubble-sort graph networks. The- [2134] Sayan Bhattacharya, Monika Hen- oretical Computer Science, 779(??): zinger, and Stefan Neumann. New 8–16, August 2, 2019. CODEN amortized cell-probe lower bounds TCSCDI. ISSN 0304-3975 (print), for dynamic problems. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 779(??):72– //www.sciencedirect.com/science/ 87, August 2, 2019. CODEN TC- article/pii/S0304397519300775. SCDI. ISSN 0304-3975 (print), REFERENCES 321

1879-2294 (electronic). URL http: Florian:2019:NTG //www.sciencedirect.com/science/ article/pii/S0304397519300842. [2139] Josef Florian, Tereza Veselá, and Lubom´ıra Dvoráková. Normaliza- Anonymous:2019:EBbc tion of ternary generalized pseudo- [2135] Anonymous. Editorial Board. The- standard words. Theoretical Com- oretical Computer Science, 780(??): puter Science, 780(??):29–53, Au- ii, August 9, 2019. CODEN TC- gust 9, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519303391. article/pii/S0304397519301161. Damaschke:2019:CST Etesami:2019:WOD [2136] Peter Damaschke. Combinatorial [2140] Omid Etesami, Narges Ghareghani, search in two and more rounds. The- Michel Habib, Mohammadreza Hoosh- oretical Computer Science, 780(??): mandasl, Reza Naserasr, and Pouyeh 1–11, August 9, 2019. CODEN Sharifani. When an optimal domi- TCSCDI. ISSN 0304-3975 (print), nating set with given constraints ex- 1879-2294 (electronic). URL http: ists. Theoretical Computer Science, 780 //www.sciencedirect.com/science/ (??):54–65, August 9, 2019. CODEN article/pii/S0304397519300945. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Tsur:2019:SDS //www.sciencedirect.com/science/ article/pii/S0304397519301185. [2137] Dekel Tsur. Succinct data structure for dynamic trees with faster queries. Chen:2019:ACG Theoretical Computer Science, 780(??): 12–19, August 9, 2019. CODEN [2141] Jin Chen and Zhi-Xiong Wen. On TCSCDI. ISSN 0304-3975 (print), the abelian complexity of general- 1879-2294 (electronic). URL http: ized Thue–Morse sequences. The- //www.sciencedirect.com/science/ oretical Computer Science, 780(??): article/pii/S0304397519300957. 66–73, August 9, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Casteigts:2019:COH 1879-2294 (electronic). URL http: [2138] A. Casteigts, Y. Métivier, J. M. Rob- //www.sciencedirect.com/science/ son, and A. Zemmari. Counting article/pii/S0304397519301203. in one-hop beeping networks. The- Ambroz:2019:PLW oretical Computer Science, 780(??): 20–28, August 9, 2019. CODEN [2142] Petr Ambroz, Ondrej Kadlec, Zuzana TCSCDI. ISSN 0304-3975 (print), Masáková, and Edita Pelantová. 1879-2294 (electronic). URL http: Palindromic length of words and //www.sciencedirect.com/science/ morphisms in class P. Theoreti- article/pii/S030439751930115X. cal Computer Science, 780(??):74– REFERENCES 322

83, August 9, 2019. CODEN TC- with A, C, and AC function symbols. SCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 781(??): 1879-2294 (electronic). URL http: 3–23, August 16, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519301306. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Konstantinidis:2019:SCA article/pii/S0304397519301264. [2143] G. Konstantinidis and A. Kehagias. Chaudhuri:2019:FMT Selfish cops and active robber: Multi- player pursuit evasion on graphs. The- [2147] Kaustuv Chaudhuri, Leonardo Lima, oretical Computer Science, 780(??): and Giselle Reis. Formalized meta- 84–102, August 9, 2019. CODEN theory of sequent calculi for linear log- TCSCDI. ISSN 0304-3975 (print), ics. Theoretical Computer Science, 781 1879-2294 (electronic). URL http: (??):24–38, August 16, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), . article/pii/S0304397519301318 1879-2294 (electronic). URL http: Anonymous:2019:EBbd //www.sciencedirect.com/science/ article/pii/S030439751930129X. [2144] Anonymous. Editorial Board. The- oretical Computer Science, 781(??): Caleiro:2019:GPS ii, August 16, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), [2148] Carlos Caleiro, Filipe Casal, and An- 1879-2294 (electronic). URL http: dreia Mordido. Generalized prob- //www.sciencedirect.com/science/ abilistic satisfiability and applica- article/pii/S0304397519303482. tions to modelling attackers with side-channel capabilities. Theoret- Nigam:2019:LSF ical Computer Science, 781(??):39– 62, August 16, 2019. CODEN [2145] Vivek Nigam and René Thiemann. TCSCDI. ISSN 0304-3975 (print), Logical and semantic frameworks with applications. Theoretical Com- 1879-2294 (electronic). URL http: puter Science, 781(??):1–2, Au- //www.sciencedirect.com/science/ . gust 16, 2019. CODEN TC- article/pii/S0304397519301276 SCDI. ISSN 0304-3975 (print), Arieli:2019:LAD 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2149] Ofer Arieli and Christian Straßer. article/pii/S0304397519303445. Logical argumentation by dynamic Ayala-Rincon:2019:FNE proof systems. Theoretical Com- puter Science, 781(??):63–91, Au- [2146] Mauricio Ayala-Rincón, Washing- gust 16, 2019. CODEN TC- ton de Carvalho-Segundo, Maribel SCDI. ISSN 0304-3975 (print), Fernández, Daniele Nantes-Sobrinho, 1879-2294 (electronic). URL http: and Ana Cristina Rocha-Oliveira. A //www.sciencedirect.com/science/ formalisation of nominal α-equivalence article/pii/S0304397519301252. REFERENCES 323

Lombardi:2019:PIR Bentz:2019:WLB

[2150] Carlos Lombardi, Alejandro R´ıos, and [2154] Cédric Bentz. Weighted and locally Roel de Vrijer. Projections for in- bounded list-colorings in split graphs, finitary rewriting (extended version). cographs, and partial k-trees. The- Theoretical Computer Science, 781(??): oretical Computer Science, 782(??): 92–110, August 16, 2019. CODEN 11–29, August 23, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519301239. article/pii/S0304397519301355. Bergougnoux:2019:FEA Ayala-Rincon:2019:TPP [2155] Benjamin Bergougnoux and Mamadou [2151] Mauricio Ayala-Rincón, Eduardo Kanté. Fast exact algorithms for Bonelli, Juan Edi, and Andrés Viso. some connectivity problems param- Typed path polymorphism. The- eterized by clique-width. Theoret- oretical Computer Science, 781(??): ical Computer Science, 782(??):30– 111–130, August 16, 2019. CODEN 53, August 23, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519301240. article/pii/S0304397519301367. Anonymous:2019:EBbe Cohen:2019:FPS [2156] Johanne Cohen, Jonas Lefèvre, Khaled [2152] Anonymous. Editorial Board. The- Maâmra, George Manoussakis, and oretical Computer Science, 782(??): Laurence Pilard. The first polyno- ii, August 23, 2019. CODEN TC- mial self-stabilizing 1-maximal match- SCDI. ISSN 0304-3975 (print), ing algorithm for general graphs. The- 1879-2294 (electronic). URL http: oretical Computer Science, 782(??): //www.sciencedirect.com/science/ 54–78, August 23, 2019. CODEN article/pii/S030439751930355X. TCSCDI. ISSN 0304-3975 (print), Shraibman:2019:NCC 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2153] Adi Shraibman. Nondeterminis- article/pii/S0304397519301379. tic communication complexity with Das:2019:SPF help and graph functions. The- oretical Computer Science, 782(??): [2157] Bireswar Das, Murali Krishna Enduri, 1–10, August 23, 2019. CODEN Masashi Kiyomi, Neeldhara Misra, TCSCDI. ISSN 0304-3975 (print), Yota Otachi, I. Vinod Reddy, and 1879-2294 (electronic). URL http: Shunya Yoshimura. On structural pa- //www.sciencedirect.com/science/ rameterizations of firefighting. The- article/pii/S030439751930132X. oretical Computer Science, 782(??): REFERENCES 324

79–90, August 23, 2019. CODEN 129–144, August 23, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519301392. article/pii/S0304397519301641. Vakhania:2019:FSS Louza:2019:ACB [2158] Nodari Vakhania. Fast solution [2162] Felipe A. Louza, Guilherme P. Telles, of single-machine scheduling prob- Simon Gog, and Liang Zhao. Al- lem with embedded jobs. Theoret- gorithms to compute the Burrows– ical Computer Science, 782(??):91– Wheeler similarity distribution. The- 106, August 23, 2019. CODEN oretical Computer Science, 782(??): TCSCDI. ISSN 0304-3975 (print), 145–156, August 23, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519301483. //www.sciencedirect.com/science/ article/pii/S0304397519301653. Chatterjee:2019:UWC Anonymous:2019:EBbf [2159] Kingshuk Chatterjee and Kumar Sankar Ray. Unary Watson–Crick automata. [2163] Anonymous. Editorial Board. The- Theoretical Computer Science, 782(??): oretical Computer Science, 783(??): 107–112, August 23, 2019. CODEN ii, September 6, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519301628. article/pii/S0304397519303627. Moldagaliyev:2019:RFL Tsur:2019:PAP [2160] Birzhan Moldagaliyev. Random- [2164] Dekel Tsur. Parameterized algo- ness of formal languages via au- rithm for 3-path vertex cover. The- tomatic martingales. Theoretical oretical Computer Science, 783(??): Computer Science, 782(??):113–128, 1–8, September 6, 2019. CODEN August 23, 2019. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519301665. article/pii/S030439751930163X. Gheibi:2019:WMB Xie:2019:NCB [2165] Amin Gheibi, Anil Maheshwari, and [2161] Ning Xie, Shuai Xu, and Yekun Xu. A Jörg-Rüdiger Sack. Weighted mini- new coding-based algorithm for find- mum backward Fréchet distance. The- ing closest pair of vectors. The- oretical Computer Science, 783(??): oretical Computer Science, 782(??): 9–21, September 6, 2019. CODEN REFERENCES 325

TCSCDI. ISSN 0304-3975 (print), Ling:2019:LBG 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2169] San Ling, Khoa Nguyen, Huaxiong article/pii/S0304397519301689. Wang, and Yanhong Xu. Lattice-based group signatures: Achieving full dy- Kim:2019:NAP namicity (and deniability) with ease. Theoretical Computer Science, 783(??): [2166] Sungwook Kim, Jinsu Kim, and 71–94, September 6, 2019. CODEN Jae Hong Seo. A new approach TCSCDI. ISSN 0304-3975 (print), to practical function-private inner 1879-2294 (electronic). URL http: product encryption. Theoretical //www.sciencedirect.com/science/ Computer Science, 783(??):22–40, article/pii/S0304397519301884. September 6, 2019. CODEN TC- Zhang:2019:EFT SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2170] Yaoyao Zhang, Shuang Zhao, and //www.sciencedirect.com/science/ Jixiang Meng. Edge fault tol- article/pii/S0304397519301690. erance of graphs with respect to λ2-optimal property. Theoretical Golovach:2019:EMN Computer Science, 783(??):95–104, September 6, 2019. CODEN TC- [2167] Petr A. Golovach, Dieter Kratsch, SCDI. ISSN 0304-3975 (print), Mathieu Liedloff, and Mohamed Yosri 1879-2294 (electronic). URL http: Sayadi. Enumeration and maxi- //www.sciencedirect.com/science/ mum number of minimal dominat- article/pii/S0304397519301896. ing sets for chordal graphs. The- oretical Computer Science, 783(??): Anonymous:2019:EBbg 41–52, September 6, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2171] Anonymous. Editorial Board. The- 1879-2294 (electronic). URL http: oretical Computer Science, 784(??): //www.sciencedirect.com/science/ ii, September 13, 2019. CODEN article/pii/S0304397519301707. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Dey:2019:PDC //www.sciencedirect.com/science/ article/pii/S0304397519303688. [2168] Palash Dey, Neeldhara Misra, and Budinich:2019:BSP Y. Narahari. Parameterized dichotomy of choosing committees based on ap- [2172] Marco Budinich. The Boolean SAT- proval votes in the presence of outliers. isfiability Problem in Clifford algebra. Theoretical Computer Science, 783(??): Theoretical Computer Science, 784(??): 53–70, September 6, 2019. CODEN 1–10, September 13, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519301872. article/pii/S0304397519301938. REFERENCES 326

Angelini:2019:VRG ical Computer Science, 784(??):65– 74, September 13, 2019. CODEN [2173] Patrizio Angelini, Michael A. Bekos, TCSCDI. ISSN 0304-3975 (print), Michael Kaufmann, and Fabrizio Mon- 1879-2294 (electronic). URL http: tecchiani. On 3D visibility repre- //www.sciencedirect.com/science/ sentations of graphs with few cross- article/pii/S0304397519302087. ings per edge. Theoretical Com- puter Science, 784(??):11–20, Septem- Balister:2019:ANP ber 13, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), [2177] Paul Balister and Stefanie Gerke. 1879-2294 (electronic). URL http: The asymptotic number of prefix //www.sciencedirect.com/science/ normal words. Theoretical Com- article/pii/S0304397519301951. puter Science, 784(??):75–80, Septem- Liu:2019:ECA ber 13, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), [2174] Aixia Liu, Shiying Wang, Jun Yuan, 1879-2294 (electronic). URL http: and Xue Ma. The h-extra connec- //www.sciencedirect.com/science/ tivity of k-ary n-cubes. Theoret- article/pii/S0304397519302099. ical Computer Science, 784(??):21– 45, September 13, 2019. CODEN Merta:2019:CIV TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2178]Lukasz Merta. Composition in- //www.sciencedirect.com/science/ verses of the variations of the . article/pii/S0304397519301963 Baum–Sweet sequence. Theoreti- Chan:2019:DOS cal Computer Science, 784(??):81– 98, September 13, 2019. CODEN [2175] T.-H. Hubert Chan, Zhihao Gavin TCSCDI. ISSN 0304-3975 (print), Tang, Xiaowei Wu, and Chenzi Zhang. 1879-2294 (electronic). URL http: Diffusion operator and spectral analy- //www.sciencedirect.com/science/ sis for directed hypergraph Laplacian. article/pii/S0304397519302142. Theoretical Computer Science, 784(??): 46–64, September 13, 2019. CODEN Said:2019:ADD TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2179] Mouhammad Said and Jacques-Olivier //www.sciencedirect.com/science/ Lachaud. Analytical description of dig- article/pii/S0304397519301987. ital intersections: Minimal parameters Pai:2019:TST and multiscale representation. Theo- retical Computer Science, 784(??):99– [2176] Kung-Jui Pai, Ruay-Shiung Chang, 112, September 13, 2019. CODEN Ro-Yu Wu, and Jou-Ming Chang. TCSCDI. ISSN 0304-3975 (print), A two-stages tree-searching algorithm 1879-2294 (electronic). URL http: for finding three completely inde- //www.sciencedirect.com/science/ pendent spanning trees. Theoret- article/pii/S0304397519302154. REFERENCES 327

Kaminski:2019:PES Noordman:2019:ENS

[2180] Bogumil Kami´nski, Tomasz Ol- [2184] C. R. Noordman and G. A. W. czak, and Pawel Pralat. Paral- Vreeswijk. Evolving novelty strategies lel execution of schedules with ran- for the Iterated Prisoner’s Dilemma dom dependency graph. Theoreti- in deceptive tournaments. Theo- cal Computer Science, 784(??):113– retical Computer Science, 785(??):1– 132, September 13, 2019. CODEN 16, September 20, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519302166. article/pii/S0304397518306479.

Carmi:2019:ACC Breik:2019:CPS [2185] Keenan Breik, Chris Thachuk, Marijn [2181] Paz Carmi, Anil Maheshwari, Saeed Heule, and David Soloveichik. Comput- Mehrabi, and Lu´ıs Fernando Schultz Xavier ing properties of stable conﬁgurations da Silveira. Approximability of cov- of thermodynamic binding networks. ering cells with line segments. Theo- Theoretical Computer Science, 785(??): retical Computer Science, 784(??):133– 17–29, September 20, 2019. CODEN 141, September 13, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518306480. article/pii/S0304397519302804. Spettel:2019:ASA Anonymous:2019:EBbh [2186] Patrick Spettel and Hans-Georg [2182] Anonymous. Editorial Board. The- Beyer. Analysis of the (1,λ)-σ-Self- oretical Computer Science, 785(??): Adaptation Evolution Strategy with re- ii, September 20, 2019. CODEN pair by projection applied to a con- TCSCDI. ISSN 0304-3975 (print), ically constrained problem. Theo- 1879-2294 (electronic). URL http: retical Computer Science, 785(??):30– //www.sciencedirect.com/science/ 45, September 20, 2019. CODEN article/pii/S0304397519304232. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Kari:2019:Eb //www.sciencedirect.com/science/ [2183] Lila Kari. Editorial. Theoret- article/pii/S0304397518306571. ical Computer Science, 785(??):iii, Friedrich:2019:UED September 20, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), [2187] Tobias Friedrich, Timo K¨otzing, and 1879-2294 (electronic). URL http: Martin S. Krejca. Unbiasedness of //www.sciencedirect.com/science/ estimation-of-distribution algorithms. article/pii/S0304397519304268. Theoretical Computer Science, 785(??): REFERENCES 328

46–59, September 20, 2019. CODEN Han:2019:ROI TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2191] Yo-Sub Han and Hwee Kim. Rule- //www.sciencedirect.com/science/ set optimization on isomorphic ori- article/pii/S0304397518306662. tatami systems. Theoretical Computer Science, 785(??):128–139, Septem- Waldmajer:2019:TTA ber 20, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2188] Jacek Waldmajer, Zbigniew Bonikowski, //www.sciencedirect.com/science/ and Sebastian Sakowski. The- article/pii/S0304397519301793. ory of tailor automata. Theoret- ical Computer Science, 785(??):60– Liu:2019:NPS 82, September 20, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2192] Liucheng Liu, Wenmei Yi, Qian Yang, 1879-2294 (electronic). URL http: Hong Peng, and Jun Wang. Numeri- //www.sciencedirect.com/science/ cal P systems with Boolean condition. article/pii/S0304397519300921. Theoretical Computer Science, 785(??): 140–149, September 20, 2019. CODEN Abrahao:2019:ANC TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2189] Felipe S. Abrah˜ao, Klaus Wehmuth, //www.sciencedirect.com/science/ . and Artur Ziviani. Algorithmic net- article/pii/S030439751930180X works: Central time to trigger ex- Einarsson:2019:LHS pected emergent open-endedness. The- oretical Computer Science, 785(??):83– [2193] Hafsteinn Einarsson, Marcelo Matheus 116, September 20, 2019. CODEN Gauy, Johannes Lengler, Florian Meier, TCSCDI. ISSN 0304-3975 (print), Asier Mujika, Angelika Steger, and Fe- 1879-2294 (electronic). URL http: lix Weissenberger. The linear hidden //www.sciencedirect.com/science/ subset problem for the (1 + 1) EA with article/pii/S0304397519301550. scheduled and adaptive mutation rates. Theoretical Computer Science, 785(??): Ellingham:2019:EOG 150–170, September 20, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2190] M. N. Ellingham and Joanna A. Ellis- 1879-2294 (electronic). URL http: Monaghan. Edge-outer graph embed- //www.sciencedirect.com/science/ ding and the complexity of the DNA article/pii/S0304397519303421. reporter strand problem. Theoret- Anonymous:2019:EBbi ical Computer Science, 785(??):117– 127, September 20, 2019. CODEN [2194] Anonymous. Editorial Board. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 786(??): 1879-2294 (electronic). URL http: ii, September 27, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519301781. 1879-2294 (electronic). URL http: REFERENCES 329

//www.sciencedirect.com/science/ 31, September 27, 2019. CODEN article/pii/S0304397519304736. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Xiao:2019:FA //www.sciencedirect.com/science/ [2195] Mingyu Xiao and Frances A. Rosa- article/pii/S0304397518305243. mond. Frontiers in algorithmics. The- oretical Computer Science, 786(??): Yuasa:2019:DIA 1, September 27, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2199] Shota Yuasa, Zhi-Zhong Chen, Bin 1879-2294 (electronic). URL http: Ma, and Lusheng Wang. Design- //www.sciencedirect.com/science/ ing and implementing algorithms for article/pii/S0304397518307023. the closest string problem. Theo- retical Computer Science, 786(??):32– Abu-Khzam:2019:EPA 43, September 27, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2196] Faisal N. Abu-Khzam, Shouwei Li, 1879-2294 (electronic). URL http: Christine Markarian, Friedhelm Meyer //www.sciencedirect.com/science/ auf der Heide, and Pavel Podlipyan. article/pii/S0304397518303372. Eﬃcient parallel algorithms for parameterized problems. Theoreti- Wang:2019:PSZ cal Computer Science, 786(??):2– 12, September 27, 2019. CODEN [2200] Lusheng Wang and Boting Yang. Pos- TCSCDI. ISSN 0304-3975 (print), itive semideﬁnite zero forcing num- 1879-2294 (electronic). URL http: bers of two classes of graphs. Theo- //www.sciencedirect.com/science/ retical Computer Science, 786(??):44– article/pii/S0304397518306777. 54, September 27, 2019. CODEN Luo:2019:LSM TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2197] Kelin Luo, Yinfeng Xu, and Huili //www.sciencedirect.com/science/ Zhang. On-line scheduling with mono- article/pii/S0304397518303153. tone subsequence constraints. Theo- retical Computer Science, 786(??):13– Li:2019:ILK 25, September 27, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2201] Wenjun Li, Haiyan Liu, Jianxin 1879-2294 (electronic). URL http: Wang, Lingyun Xiang, and Yongjie //www.sciencedirect.com/science/ Yang. An improved linear kernel for article/pii/S0304397518305693. complementary maximal strip recov- Bereg:2019:SMP ery: Simpler and smaller. Theo- retical Computer Science, 786(??):55– [2198] Sergey Bereg, Feifei Ma, Wencheng 66, September 27, 2019. CODEN Wang, Jian Zhang, and Binhai Zhu. TCSCDI. ISSN 0304-3975 (print), On some matching problems under 1879-2294 (electronic). URL http: the color-spanning model. Theoret- //www.sciencedirect.com/science/ ical Computer Science, 786(??):26– article/pii/S0304397518302421. REFERENCES 330

Wu:2019:SIJ Carayol:2019:SII

[2202] Guangwei Wu, Jianer Chen, and [2206] Arnaud Carayol and Cyril Nicaud. Spe- Jianxin Wang. On scheduling inclined cial issue — Implementation and Ap- jobs on multiple two-stage ﬂowshops. plication of Automata (CIAA 2017). Theoretical Computer Science, 786(??): Theoretical Computer Science, 787 67–77, September 27, 2019. CODEN (??):1, October 1, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518302196. article/pii/S0304397519303731. Chen:2019:CSC Brzozowski:2019:CPP

[2203] Wei Chen and Hanrui Zhang. Com- [2207] Janusz A. Brzozowski and Corwin plete submodularity characteriza- Sinnamon. Complexity of proper tion in the comparative indepen- preﬁx-convex regular languages. The- dent cascade model. Theoreti- oretical Computer Science, 787(??): cal Computer Science, 786(??):78– 2–13, October 1, 2019. CODEN 87, September 27, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397518304961. article/pii/S0304397518302019. Ferens:2019:CBF Han:2019:OKP [2208] Robert Ferens and Marek Szykula. [2204] Xin Han, Qinyang Chen, and Kazuhisa Complexity of biﬁx-free regular lan- Makino. Online knapsack problem guages. Theoretical Computer Sci- under concave functions. Theoret- ence, 787(??):14–27, October 1, 2019. ical Computer Science, 786(??):88– CODEN TCSCDI. ISSN 0304- 95, September 27, 2019. CODEN 3975 (print), 1879-2294 (electronic). TCSCDI. ISSN 0304-3975 (print), URL http://www.sciencedirect. 1879-2294 (electronic). URL http: com/science/article/pii/S0304397518305875. //www.sciencedirect.com/science/ article/pii/S0304397518302007. Dando:2019:HEW Anonymous:2019:EBbj [2209] Louis-Marie Dando and Sylvain Lom- bardy. From Hadamard expressions to [2205] Anonymous. Editorial Board. The- weighted rotating automata and back. oretical Computer Science, 787(??): Theoretical Computer Science, 787(??): ii, October 1, 2019. CODEN TC- 28–44, October 1, 2019. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519304797. article/pii/S0304397518305887. REFERENCES 331

Szykula:2019:SCB //www.sciencedirect.com/science/ article/pii/S0304397519304128. [2210] Marek Szykula and John Wittnebel. Syntactic complexity of biﬁx-free reg- Han:2019:ADR ular languages. Theoretical Com- puter Science, 787(??):45–76, Oc- [2214] Yo-Sub Han and Sang-Ki Ko. Align- tober 1, 2019. CODEN TC- ment distance of regular tree languages. SCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 787(??): 1879-2294 (electronic). URL http: 127–137, October 1, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519300039. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Ryzhikov:2019:SPA article/pii/S030439751930413X.

[2211] Andrew Ryzhikov. Synchroniza- Anonymous:2019:EBbk tion problems in automata without non-trivial cycles. Theoreti- [2215] Anonymous. Editorial Board. The- cal Computer Science, 787(??):77– oretical Computer Science, 788(??): 88, October 1, 2019. CODEN ii, October 2019. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519300040. article/pii/S0304397519304852. Hospodar:2019:NCS Gao:2019:PSI

[2212] Michal Hospodár, Galina Jirásková, [2216] Xiaofeng Gao and Dongdong Ge. Pref- and Peter Mlynárcik. Nondeter- ace: Special issue on the Annual In- ministic complexity in subclasses ternational Conference on Combina- of convex languages. Theoreti- torial Optimization and Applications cal Computer Science, 787(??):89– (COCOA). Theoretical Computer Sci- 110, October 1, 2019. CODEN ence, 788(??):1, October 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519300052. article/pii/S0304397519303743. Kutrib:2019:TRF Miao:2019:TED

[2213] Martin Kutrib, Andreas Malcher, and [2217] Dongjing Miao, Zhipeng Cai, Jiguo Yu, Matthias Wendlandt. Transducing re- and Yingshu Li. Triangle edge deletion versibly with ﬁnite state machines. on planar glasses-free RGB-digraphs. Theoretical Computer Science, 787(??): Theoretical Computer Science, 788 111–126, October 1, 2019. CODEN (??):2–11, October 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: REFERENCES 332

//www.sciencedirect.com/science/ group budget constraints. Theoret- article/pii/S0304397518306558. ical Computer Science, 788(??):53– 65, October 2019. CODEN TC- Angel:2019:AFR SCDI. ISSN 0304-3975 (print), [2218] Eric Angel, Thang Nguyen Kim, and 1879-2294 (electronic). URL http: Shikha Singh. Approximating k- //www.sciencedirect.com/science/ forest with resource augmentation: article/pii/S0304397519301215. a primal-dual approach. Theoret- ical Computer Science, 788(??):12– Erlebach:2019:COA 20, October 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), [2222] Thomas Erlebach, Fu-Hong Liu, 1879-2294 (electronic). URL http: Hsiang-Hsuan Liu, Mordechai Shalom, //www.sciencedirect.com/science/ Prudence W. H. Wong, and Shmuel article/pii/S0304397518307229. Zaks. Complexity and online algorithms for minimum skyline Duan:2019:ISE coloring of intervals. Theoreti- cal Computer Science, 788(??):66– [2219] Zhenhua Duan, Cong Tian, Nan 78, October 2019. CODEN TC- Zhang, Qian Ma, and Hongwei Du. SCDI. ISSN 0304-3975 (print), Index set expressions can represent 1879-2294 (electronic). URL http: temporal logic formulas. Theoret- //www.sciencedirect.com/science/ ical Computer Science, 788(??):21– article/pii/S0304397519302853. 38, October 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), Gu:2019:EAR 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2223] Qian-Ping Gu, Jiajian Leo Liang, article/pii/S0304397518307230. and Guochuan Zhang. Efficient algo- Huang:2019:ACS rithms for ridesharing of personal vehicles. Theoretical Computer Science, [2220] Jiapeng Huang, Zhenzao Wen, Linghe 788(??):79–94, October 2019. CODEN Kong, Li Ge, Min-You Wu, and Gui- TCSCDI. ISSN 0304-3975 (print), hai Chen. Accelerate the classifi- 1879-2294 (electronic). URL http: cation statistics in RFID systems. //www.sciencedirect.com/science/ Theoretical Computer Science, 788 article/pii/S0304397519303767. (??):39–52, October 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Anonymous:2019:EBbl 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2224] Anonymous. Editorial Board. The- article/pii/S0304397518307242. oretical Computer Science, 789(??): Guo:2019:EAA ii, October 15, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2221] Longkun Guo, Min Li, and Dachuan 1879-2294 (electronic). URL http: Xu. Efficient approximation algo- //www.sciencedirect.com/science/ rithms for maximum coverage with article/pii/S0304397519305171. REFERENCES 333

Yen:2019:SIS 22–33, October 15, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2225] Hsu-Chun Yen, Md. Saidur Rah- 1879-2294 (electronic). URL http: man, and Sheung-Hung Poon. Spe- //www.sciencedirect.com/science/ cial issue on selected papers from article/pii/S0304397519301173. the 11th International Conference and Workshops on Algorithms and Com- Jansen:2019:IAT putation (WALCOM 2017). The- [2229] Klaus Jansen and Malin Rau. Im- oretical Computer Science, 789(??): proved approximation for two di- 1, October 15, 2019. CODEN mensional Strip Packing with poly- TCSCDI. ISSN 0304-3975 (print), nomial bounded width. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 789(??):34– //www.sciencedirect.com/science/ 49, October 15, 2019. CODEN article/pii/S0304397519305134. TCSCDI. ISSN 0304-3975 (print), Oh:2019:CCR 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2226] Eunjin Oh and Hee-Kap Ahn. Comput- article/pii/S0304397519302555. ing the center region and its variants. Theoretical Computer Science, 789(??): Akitaya:2019:MWC 2–12, October 15, 2019. CODEN [2230] Hugo A. Akitaya, Rajasekhar Inkulu, TCSCDI. ISSN 0304-3975 (print), Torrie L. Nichols, Diane L. Sou- 1879-2294 (electronic). URL http: vaine, Csaba D. T´oth, and Charles R. //www.sciencedirect.com/science/ Winston. Minimum weight con- . article/pii/S0304397518304420 nectivity augmentation for planar Bahoo:2019:TST straight-line graphs. Theoretical Com- puter Science, 789(??):50–63, Oc- [2227] Yeganeh Bahoo, Bahareh Banyassady, tober 15, 2019. CODEN TC- Prosenjit K. Bose, Stephane Durocher, SCDI. ISSN 0304-3975 (print), and Wolfgang Mulzer. A time-space 1879-2294 (electronic). URL http: trade-oﬀ for computing the k-visibility //www.sciencedirect.com/science/ region of a point in a polygon. The- article/pii/S0304397518303694. oretical Computer Science, 789(??): 13–21, October 15, 2019. CODEN Jiao:2019:AAR TCSCDI. ISSN 0304-3975 (print), [2231] Yang Jiao, R. Ravi, and Wolfgang 1879-2294 (electronic). URL http: Gatterbauer. Algorithms for auto- //www.sciencedirect.com/science/ matic ranking of participants and article/pii/S030439751830433X. tasks in an anonymized contest. The- Vaezi:2019:VEM oretical Computer Science, 789(??): 64–76, October 15, 2019. CODEN [2228] Arash Vaezi and Mohammad Ghodsi. TCSCDI. ISSN 0304-3975 (print), Visibility extension via mirror-edges 1879-2294 (electronic). URL http: to cover invisible segments. The- //www.sciencedirect.com/science/ oretical Computer Science, 789(??): article/pii/S030439751830495X. REFERENCES 334

Cano:2019:SDL 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2232] Rafael G. Cano, Cid C. de Souza, and article/pii/S0304397519303184. Pedro J. de Rezende. Solving dynamic labeling problems to optimal- Covanov:2019:IMF ity using solution space reductions. [2236] Svyatoslav Covanov. Improved method Theoretical Computer Science, 789(??): for finding optimal formulas for bi- 77–92, October 15, 2019. CODEN linear maps in a finite field. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 790(??): 1879-2294 (electronic). URL http: 41–65, October 22, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397518305267. 1879-2294 (electronic). URL http: Anonymous:2019:EBbm //www.sciencedirect.com/science/ article/pii/S0304397519303172. [2233] Anonymous. Editorial Board. The- oretical Computer Science, 790(??): Liu:2019:ECD ii, October 22, 2019. CODEN [2237] Huiqing Liu, Shunzhe Zhang, and Dong TCSCDI. ISSN 0304-3975 (print), Li. On g-extra conditional diagnos- 1879-2294 (electronic). URL http: ability of hierarchical cubic networks. //www.sciencedirect.com/science/ Theoretical Computer Science, 790(??): article/pii/S0304397519305419. 66–79, October 22, 2019. CODEN Aziz:2019:ERU TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2234] Haris Aziz, Péter Biró, Jérôme Lang, //www.sciencedirect.com/science/ Julien Lesca, and Jérôme Monnot. article/pii/S0304397519303160. Efficient reallocation under additive Gerdjikov:2019:SEB and responsive preferences. The- oretical Computer Science, 790(??): [2238] Stefan Gerdjikov, Stoyan Mihov, and 1–15, October 22, 2019. CODEN Klaus U. Schulz. Space-efficient bi- TCSCDI. ISSN 0304-3975 (print), machine construction based on the 1879-2294 (electronic). URL http: equalizer accumulation principle. The- //www.sciencedirect.com/science/ oretical Computer Science, 790(??): article/pii/S0304397519303196. 80–95, October 22, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Jahannia:2019:PZL 1879-2294 (electronic). URL http: [2235] Marieh Jahannia, Morteza Mohammad- //www.sciencedirect.com/science/ noori, Narad Rampersad, and Manon article/pii/S0304397519303159. Stipulanti. Palindromic Ziv–Lempel Tsur:2019:FDP and Crochemore factorizations of m- Bonacci infinite words. Theoreti- [2239] Dekel Tsur. Faster deterministic pa- cal Computer Science, 790(??):16– rameterized algorithm for k-path. The- 40, October 22, 2019. CODEN oretical Computer Science, 790(??): TCSCDI. ISSN 0304-3975 (print), 96–104, October 22, 2019. CODEN REFERENCES 335

TCSCDI. ISSN 0304-3975 (print), 138–151, October 22, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519303123. //www.sciencedirect.com/science/ article/pii/S0304397519303081. Bae:2019:SPQ Chen:2019:KPC [2240] Sang Won Bae and Haitao Wang. L1 shortest path queries in sim- [2244] Jianer Chen, Henning Fernau, Pe- ple polygons. Theoretical Com- ter Shaw, Jianxin Wang, and Zhib- puter Science, 790(??):105–116, Oc- iao Yang. Kernels for packing tober 22, 2019. CODEN TC- and covering problems. Theoreti- SCDI. ISSN 0304-3975 (print), cal Computer Science, 790(??):152– 1879-2294 (electronic). URL http: 166, October 22, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519303111. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Sun:2019:FTA article/pii/S0304397519303068. [2241] Xueli Sun, Qingfeng Dong, Shuming Anonymous:2019:EBbn Zhou, Mengjie Lv, Guanqin Lian, and Jiafei Liu. Fault tolerance analy- [2245] Anonymous. Editorial Board. The- sis of hierarchical folded cube. The- oretical Computer Science, 791(??): oretical Computer Science, 790(??): ii, October 29, 2019. CODEN 117–130, October 22, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519305353. article/pii/S030439751930310X. Jo:2019:MCP Klouda:2019:CCD [2246] Changseong Jo, Jihoon Choi, Suh- [2242] Karel Klouda and Step´an Starosta. Ryung Kim, and Yoshio Sano. On Characterization of circular D0L- the minimum clique partitioning prob- systems. Theoretical Computer Sci- lem on weighted chordal graphs. The- ence, 790(??):131–137, October 22, oretical Computer Science, 791(??): 2019. CODEN TCSCDI. ISSN 0304- 1–9, October 29, 2019. CODEN 3975 (print), 1879-2294 (electronic). TCSCDI. ISSN 0304-3975 (print), URL http://www.sciencedirect. 1879-2294 (electronic). URL http: com/science/article/pii/S0304397519303093//www.sciencedirect.com/science/. article/pii/S0304397519302841. Machida:2019:SRC Kante:2019:PCG [2243] Motoya Machida and Alexander Y. Shibakov. Stack and register com- [2247] Mamadou Moustapha Kant´e, Thi- plexity of radix conversions. The- ago Marcilon, and Rudini Sampaio. oretical Computer Science, 790(??): On the parameterized complexity of REFERENCES 336

the geodesic hull number. The- Baiocchi:2019:SCG oretical Computer Science, 791(??): 10–27, October 29, 2019. CODEN [2251] Pierluigi Baiocchi, Tiziana Calam- TCSCDI. ISSN 0304-3975 (print), oneri, Angelo Monti, and Rossella 1879-2294 (electronic). URL http: Petreschi. Some classes of graphs //www.sciencedirect.com/science/ that are not PCGs. Theoreti- article/pii/S0304397519302828. cal Computer Science, 791(??):62– 75, October 29, 2019. CODEN Kueng:2019:FRH TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2248] Richard Kueng, Dustin G. Mixon, article/pii/S0304397519303251. and Soledad Villar. Fair redistricting is hard. Theoretical Com- Bahoo:2019:PSM puter Science, 791(??):28–35, Oc- tober 29, 2019. CODEN TC- [2252] Yeganeh Bahoo, Stephane Durocher, SCDI. ISSN 0304-3975 (print), J. Mark Keil, Debajyoti Mondal, 1879-2294 (electronic). URL http: Saeed Mehrabi, and Sahar Mehrpour. //www.sciencedirect.com/science/ Polygon simplification by minimizing article/pii/S0304397519302798. convex corners. Theoretical Com- puter Science, 791(??):76–86, Oc- Hartman:2019:RUF tober 29, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL [2249] Patrick Hartman and Joe Sawada. http: Ranking and unranking fixed-density //www.sciencedirect.com/science/ . necklaces and Lyndon words. The- article/pii/S030439751930324X oretical Computer Science, 791(??): BenBasat:2019:GMS 36–47, October 29, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2253] Ran Ben Basat, Gil Einziger, and Roy 1879-2294 (electronic). URL http: Friedman. Give me some slack: Ef- //www.sciencedirect.com/science/ ficient network measurements. The- article/pii/S0304397519302865. oretical Computer Science, 791(??): 87–108, October 29, 2019. CODEN Fukunaga:2019:CTH TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2250] Takuro Fukunaga and Takanori Mae- //www.sciencedirect.com/science/ hara. Computing a tree having article/pii/S0304397519303202. a small vertex cover. Theoreti- Bruneaux:2019:NAW cal Computer Science, 791(??):48– 61, October 29, 2019. CODEN [2254] Margot Bruneaux. A note about words TCSCDI. ISSN 0304-3975 (print), which coincide except in one position. 1879-2294 (electronic). URL http: Theoretical Computer Science, 791(??): //www.sciencedirect.com/science/ 109–111, October 29, 2019. CODEN article/pii/S0304397519303263. TCSCDI. ISSN 0304-3975 (print), REFERENCES 337

1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519302816. //www.sciencedirect.com/science/ article/pii/S0304397519303342. Recasens:2019:CCP Melekian:2019:NGM [2255] J. Recasens. On a conjecture concerning positive semi-deﬁniteness. The- [2259] Christopher Melekian and Eddie oretical Computer Science, 791(??): Cheng. A note on generalized match- 112–115, October 29, 2019. CODEN ing preclusion in bipartite graphs. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 791(??): 1879-2294 (electronic). URL http: 132–140, October 29, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519303238. 1879-2294 (electronic). URL http: Li:2019:MSB //www.sciencedirect.com/science/ article/pii/S0304397519303433. [2256] Yuan Li and John O. Adeyeye. Max- imal sensitivity of Boolean nested Anonymous:2019:EBbo canalizing functions. Theoretical [2260] Anonymous. Editorial Board. The- Computer Science, 791(??):116–122, oretical Computer Science, 792(??): October 29, 2019. CODEN TC- ii, November 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519303135. article/pii/S0304397519305717. Fleischmann:2019:RAP Crochemore:2019:SIH [2257] Pamela Fleischmann, Pascal Ochem, and Kamellia Reshadi. Repetition [2261] Maxime Crochemore and Jakub Ra- avoidance in products of factors. The- doszewski. Special issue in honor of oretical Computer Science, 791(??): the 70th birthday of Prof. Wojciech 123–126, October 29, 2019. CODEN Rytter. Theoretical Computer Science, TCSCDI. ISSN 0304-3975 (print), 792(??):1, November 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519303019. //www.sciencedirect.com/science/ article/pii/S0304397519305894. Alm:2019:FCT Czumaj:2019:LEM [2258] Jeremy F. Alm and Andrew Ylvisaker. A fast coset-translation algorithm for [2262] Artur Czumaj and Peter Davies. computing the cycle structure of Comer Leader election in multi-hop radio net- relation algebras over Z/pZ. The- works. Theoretical Computer Science, oretical Computer Science, 791(??): 792(??):2–11, November 2019. CODEN 127–131, October 29, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), REFERENCES 338

1879-2294 (electronic). URL http: Labourel. Group search of the //www.sciencedirect.com/science/ plane with faulty robots. Theo- article/pii/S0304397519301331. retical Computer Science, 792(??): 69–84, November 2019. CODEN Alzamel:2019:LLA TCSCDI. ISSN 0304-3975 (print), [2263] Mai Alzamel, Costas S. Iliopoulos, 1879-2294 (electronic). URL http: W. F. Smyth, and Wing-Kin Sung. //www.sciencedirect.com/science/ Off-line and on-line algorithms for article/pii/S0304397518306005. closed string factorization. Theo- Almirantis:2019:OWT retical Computer Science, 792(??): 12–19, November 2019. CODEN [2267] Yannis Almirantis, Panagiotis Char- TCSCDI. ISSN 0304-3975 (print), alampopoulos, Jia Gao, Costas S. Il- 1879-2294 (electronic). URL http: iopoulos, Manal Mohamed, Solon P. //www.sciencedirect.com/science/ Pissis, and Dimitris Polychronopoulos. article/pii/S0304397518306546. On overabundant words and their application to biological sequence analy- Plandowski:2019:PGS sis. Theoretical Computer Science, 792 [2264] Wojciech Plandowski. On PSPACE (??):85–95, November 2019. CODEN generation of a solution set of a word TCSCDI. ISSN 0304-3975 (print), equation and its applications. The- 1879-2294 (electronic). URL http: oretical Computer Science, 792(??): //www.sciencedirect.com/science/ 20–61, November 2019. CODEN article/pii/S0304397518305760. TCSCDI. ISSN 0304-3975 (print), Shallit:2019:SCP 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2268] Jeffrey Shallit and Arseny Shur. Sub- article/pii/S0304397518306443. word complexity and power avoidance. Theoretical Computer Science, 792(??): Plandowski:2019:CCM 96–116, November 2019. CODEN [2265] Wojciech Plandowski and Aleksy Schu- TCSCDI. ISSN 0304-3975 (print), bert. On the complexity of com- 1879-2294 (electronic). URL http: putation maximal exponent of peri- //www.sciencedirect.com/science/ odicity of word equations and ex- article/pii/S0304397518305759. pressible relations (note). Theo- Giancarlo:2019:DCM retical Computer Science, 792(??): 62–68, November 2019. CODEN [2269] Raffaele Giancarlo, Simona E. Rombo, TCSCDI. ISSN 0304-3975 (print), and Filippo Utro. DNA combinato- 1879-2294 (electronic). URL http: rial messages and epigenomics: the case //www.sciencedirect.com/science/ of chromatin organization and nucleo- article/pii/S0304397518306431. some occupancy in eukaryotic genomes. Czyzowicz:2019:GSP Theoretical Computer Science, 792(??): 117–130, November 2019. CODEN [2266] Jurek Czyzowicz, Maxime Godon, TCSCDI. ISSN 0304-3975 (print), Evangelos Kranakis, and Arnaud 1879-2294 (electronic). URL http: REFERENCES 339

//www.sciencedirect.com/science/ AC-automata. Theoretical Computer article/pii/S0304397518304638. Science, 792(??):161–172, November 2019. CODEN TCSCDI. ISSN 0304- Nakashima:2019:SSA 3975 (print), 1879-2294 (electronic). [2270] Yuto Nakashima, Takuya Takagi, URL http://www.sciencedirect. Shunsuke Inenaga, Hideo Bannai, and com/science/article/pii/S030439751830238X. Masayuki Takeda. On the size of the Anonymous:2019:EBbp smallest alphabet for Lyndon trees. Theoretical Computer Science, 792(??): [2274] Anonymous. Editorial Board. The- 131–143, November 2019. CODEN oretical Computer Science, 793(??): TCSCDI. ISSN 0304-3975 (print), ii, November 12, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518304602. //www.sciencedirect.com/science/ article/pii/S0304397519305997. Fici:2019:MFF Gelle:2019:OGO [2271] Gabriele Fici, Antonio Restivo, and Laura Rizzo. Minimal forbidden [2275] Kitti Gelle and Szabolcs Iván. The factors of circular words. Theo- ordinal generated by an ordinal retical Computer Science, 792(??): grammar is computable. Theoret- 144–153, November 2019. CODEN ical Computer Science, 793(??):1– TCSCDI. ISSN 0304-3975 (print), 13, November 12, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518304043. //www.sciencedirect.com/science/ article/pii/S0304397519303044. Avgustinovich:2019:ASI Wang:2019:SSR [2272] Sergey Avgustinovich, Julien Cas- saigne, Juhani Karhumäki, Svetlana [2276] Bin Wang and Guangyan Zhou. Su- Puzynina, and Aleksi Saarela. On per solutions of random (3 + p)-SAT. abelian saturated infinite words. The- Theoretical Computer Science, 793(??): oretical Computer Science, 792(??): 14–27, November 12, 2019. CODEN 154–160, November 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519303032. article/pii/S0304397518303335. Banik:2019:DVG Hendrian:2019:EDD [2277] Aritra Banik, Sandip Das, Anil Ma- [2273] Diptarama Hendrian, Shunsuke In- heshwari, and Michiel Smid. The enaga, Ryo Yoshinaka, and Ayumi discrete Voronoi game in a sim- Shinohara. Efficient dynamic dic- ple polygon. Theoretical Com- tionary matching with DAWGs and puter Science, 793(??):28–35, Novem- REFERENCES 340

ber 12, 2019. CODEN TC- ing problem P ||Cmax. Theoreti- SCDI. ISSN 0304-3975 (print), cal Computer Science, 793(??):70– 1879-2294 (electronic). URL http: 78, November 12, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519303007. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Faal:2019:MVD article/pii/S0304397519303512. [2278] Hossein Teimoori Faal. A multi- Wang:2019:QSS set version of determinants and the Coin arrangements lemma. Theo- [2282] Hui Wang, Cees H. Elzinga, Zhiwei retical Computer Science, 793(??):36– Lin, and Jordan Vincent. Quanti- 43, November 12, 2019. CODEN fying sequential subsumption. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 793(??): 1879-2294 (electronic). URL http: 79–99, November 12, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), . article/pii/S0304397519302981 1879-2294 (electronic). URL http: Yu:2019:NAA //www.sciencedirect.com/science/ article/pii/S030439751930372X. [2279] Wei Yu, Zhaohui Liu, and Xiaoguang Bao. New approximation algorithms Charron-Bost:2019:FSP for the minimum cycle cover problem. Theoretical Computer Science, 793(??): [2283] Bernadette Charron-Bost and Shlomo 44–58, November 12, 2019. CODEN Moran. The ﬁring squad prob- TCSCDI. ISSN 0304-3975 (print), lem revisited. Theoretical Computer 1879-2294 (electronic). URL http: Science, 793(??):100–112, Novem- //www.sciencedirect.com/science/ ber 12, 2019. CODEN TC- article/pii/S030439751930297X. SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Amir:2019:ACS //www.sciencedirect.com/science/ [2280] A. Amir, A. Levy, R. Lubin, and E. Po- article/pii/S030439751930458X. rat. Approximate cover of strings. Lv:2019:PDC Theoretical Computer Science, 793(??): 59–69, November 12, 2019. CODEN [2284] Mengjie Lv, Shuming Zhou, Xueli TCSCDI. ISSN 0304-3975 (print), Sun, Guanqin Lian, Jiafei Liu, and 1879-2294 (electronic). URL http: Dajin Wang. Probabilistic diagno- //www.sciencedirect.com/science/ sis of clustered faults for hypercube- article/pii/S0304397519303354. based multiprocessor system. Theo- Kononov:2019:MMA retical Computer Science, 793(??):113– 131, November 12, 2019. CODEN [2281] A. V. Kononov, M. Y. Kovalyov, TCSCDI. ISSN 0304-3975 (print), and B. M. T. Lin. Minimizing 1879-2294 (electronic). URL http: machine assignment costs over ∆- //www.sciencedirect.com/science/ approximate solutions of the schedul- article/pii/S0304397519304141. REFERENCES 341

Sakai:2019:MCS //www.sciencedirect.com/science/ article/pii/S0304397519304049. [2285] Yoshifumi Sakai. Maximal common subsequence algorithms. Theoreti- Li:2019:DSM cal Computer Science, 793(??):132– 139, November 12, 2019. CODEN [2289] Pingshan Li and Min Xu. The t/k- TCSCDI. ISSN 0304-3975 (print), diagnosability and strong Menger con- 1879-2294 (electronic). URL http: nectivity on star graphs with condi- //www.sciencedirect.com/science/ tional faults. Theoretical Computer article/pii/S0304397519304074. Science, 793(??):181–192, Novem- ber 12, 2019. CODEN TC- Kuo:2019:AHM SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2286] Tung-Wei Kuo. On the approx- //www.sciencedirect.com/science/ imability and hardness of the mini- article/pii/S0304397519304037. mum connected dominating set with routing cost constraint. Theoreti- Blanchette:2019:QAG cal Computer Science, 793(??):140– 151, November 12, 2019. CODEN [2290] Benjamin Blanchette. Quasi-automatic TCSCDI. ISSN 0304-3975 (print), groups are asynchronously automatic. 1879-2294 (electronic). URL http: Theoretical Computer Science, 793(??): //www.sciencedirect.com/science/ 193–195, November 12, 2019. CODEN article/pii/S0304397519304062. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Cho:2019:BDD //www.sciencedirect.com/science/ article/pii/S0304397519303755. [2287] Da-Jung Cho, Yo-Sub Han, and Hwee Kim. Bound-decreasing dupli- Anonymous:2019:EBbq cation system. Theoretical Computer Science, 793(??):152–168, Novem- [2291] Anonymous. Editorial Board. The- ber 12, 2019. CODEN TC- oretical Computer Science, 794(??): SCDI. ISSN 0304-3975 (print), ii, November 19, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519304050. //www.sciencedirect.com/science/ article/pii/S0304397519306115. Brauner:2019:DBW Angelopoulos:2019:PSI [2288] Nadia Brauner, Yves Crama, Eti- enne Delaporte, Vincent Jost, and [2292] Spyros Angelopoulos, Nicolas Nisse, Luc Libralesso. Do balanced words and Dimitrios M. Thilikos. Preface have a short period? Theoreti- to special issue on theory and ap- cal Computer Science, 793(??):169– plications of graph searching. The- 180, November 12, 2019. CODEN oretical Computer Science, 794(??): TCSCDI. ISSN 0304-3975 (print), 1–2, November 19, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), REFERENCES 342

1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519306073. article/pii/S0304397518305735. Pralat:2019:HMZ Dereniowski:2019:CFR [2293] Pawe l Pralat. How many zom- [2297] Dariusz Dereniowski, Tom´as Gaven- bies are needed to catch the sur- ciak, and Jan Kratochv´ıl. Cops, a vivor on toroidal grids? Theo- fast robber and defensive domina- retical Computer Science, 794(??):3– tion on interval graphs. Theoret- 11, November 19, 2019. CODEN ical Computer Science, 794(??):47– TCSCDI. ISSN 0304-3975 (print), 58, November 19, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397518303414. //www.sciencedirect.com/science/ article/pii/S0304397518306029. Bonato:2019:BBN Bonato:2019:HCR [2294] Anthony Bonato and Thomas Lidbet- ter. Bounds on the burning num- [2298] A. Bonato, N. E. Clarke, D. Cox, bers of spiders and path-forests. The- S. Finbow, F. McInerney, and oretical Computer Science, 794(??): M. E. Messinger. Hyperopic cops 12–19, November 19, 2019. CODEN and robbers. Theoretical Com- TCSCDI. ISSN 0304-3975 (print), puter Science, 794(??):59–68, Novem- 1879-2294 (electronic). URL http: ber 19, 2019. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S030439751830402X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Alpern:2019:SIH article/pii/S0304397518306091. [2295] Steve Alpern. Search for an immobile Coupechoux:2019:FT Hider in a known subset of a network. Theoretical Computer Science, 794(??): [2299] Pierre Coupechoux, Marc Demange, 20–26, November 19, 2019. CODEN David Ellison, and Bertrand Jouve. TCSCDI. ISSN 0304-3975 (print), Fireﬁghting on trees. Theoreti- 1879-2294 (electronic). URL http: cal Computer Science, 794(??):69– //www.sciencedirect.com/science/ 84, November 19, 2019. CODEN article/pii/S0304397518304389. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Lamprou:2019:EDL //www.sciencedirect.com/science/ [2296] Ioannis Lamprou, Russell Martin, article/pii/S0304397519300817. and Sven Schewe. Eternally dom- Dereniowski:2019:FSW inating large grids. Theoretical Computer Science, 794(??):27–46, [2300] Dariusz Dereniowski, Dorota Osula, November 19, 2019. CODEN TC- and Pawe l Rzazewski. Finding small- SCDI. ISSN 0304-3975 (print), width connected path decomposi- REFERENCES 343

tions in polynomial time. Theoret- encryption with equality test via ical Computer Science, 794(??):85– hash proof system. Theoretical 100, November 19, 2019. CODEN Computer Science, 795(??):20–35, TCSCDI. ISSN 0304-3975 (print), November 26, 2019. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519302129. //www.sciencedirect.com/science/ article/pii/S0304397519303822. Anonymous:2019:EBbr Huang:2019:EDG [2301] Anonymous. Editorial Board. The- oretical Computer Science, 795(??): [2305] Yanze Huang, Limei Lin, Li Xu, and ii, November 26, 2019. CODEN Xiaoding Wang. Extra diagnosability TCSCDI. ISSN 0304-3975 (print), and good-neighbor diagnosability of n- 1879-2294 (electronic). URL http: dimensional alternating group graph //www.sciencedirect.com/science/ AGn under the PMC model. The- article/pii/S0304397519306358. oretical Computer Science, 795(??): 36–49, November 26, 2019. CODEN Minh:2019:BNM TCSCDI. ISSN 0304-3975 (print), [2302] Do Le Paul Minh and Truong Thi Thuy 1879-2294 (electronic). URL http: Duong. Bayesian networks: the mini- //www.sciencedirect.com/science/ mal triangulations of a graph. The- article/pii/S0304397519303834. oretical Computer Science, 795(??): Akhtar:2019:GCN 1–8, November 26, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2306] Muhammad S. Akhtar, Usman Ali, 1879-2294 (electronic). URL http: Ghulam Abbas, and Mutahira Ba- //www.sciencedirect.com/science/ tool. On the game chromatic number article/pii/S0304397519303792. of splitting graphs of path and cycle. , 795(??): delaMaza:2019:CKP Theoretical Computer Science 50–56, November 26, 2019. CODEN [2303] Sebastián González Hermosillo de la TCSCDI. ISSN 0304-3975 (print), Maza and César Hernández-Cruz. On 1879-2294 (electronic). URL http: the complexity of the k-kernel prob- //www.sciencedirect.com/science/ lem on cyclically k-partite digraphs. article/pii/S0304397519303846. Theoretical Computer Science, 795(??): Lyu:2019:SPP 9–19, November 26, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2307] Lin Lyu, Shengli Liu, and Dawu 1879-2294 (electronic). URL http: Gu. Structure-preserving public- //www.sciencedirect.com/science/ key encryption with leakage-resilient article/pii/S0304397519303809. CCA security. Theoretical Com- Zeng:2019:PKE puter Science, 795(??):57–80, Novem- ber 26, 2019. CODEN TC- [2304] Ming Zeng, Jie Chen, Kai Zhang, SCDI. ISSN 0304-3975 (print), and Haifeng Qian. Public key 1879-2294 (electronic). URL http: REFERENCES 344

//www.sciencedirect.com/science/ adjacent faulty vertices. Theoreti- article/pii/S030439751930386X. cal Computer Science, 795(??):115– 118, November 26, 2019. CODEN Dolev:2019:AAC TCSCDI. ISSN 0304-3975 (print), [2308] Shlomi Dolev, Niv Gilboa, and Xim- 1879-2294 (electronic). URL http: ing Li. Accumulating automata and //www.sciencedirect.com/science/ cascaded equations automata for com- article/pii/S0304397519303913. municationless information theoreti- Pham:2019:IMP cally secure multi-party computation. Theoretical Computer Science, 795(??): [2312] Van Huy Pham and Kien Trung 81–99, November 26, 2019. CODEN Nguyen. Inverse 1-median prob- TCSCDI. ISSN 0304-3975 (print), lem on trees under mixed rectilin- 1879-2294 (electronic). URL http: ear and Chebyshev norms. Theoret- //www.sciencedirect.com/science/ ical Computer Science, 795(??):119– . article/pii/S0304397519303883 127, November 26, 2019. CODEN Gurski:2019:HPB TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2309] Frank Gurski, Carolin Rehs, and //www.sciencedirect.com/science/ Jochen Rethmann. On the hardness article/pii/S0304397519303925. of palletizing bins using FIFO queues. Theoretical Computer Science, 795(??): Chiarelli:2019:NAW 100–107, November 26, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2313] Nina Chiarelli, Tatiana Romina 1879-2294 (electronic). URL http: Hartinger, Valeria Alejandra Leoni, //www.sciencedirect.com/science/ Maria In´es Lopez Pujato, and Martin article/pii/S0304397519303895. Milanic. New algorithms for weighted k-domination and total k-domination Bang-Jensen:2019:PCL problems in proper interval graphs. Theoretical Computer Science, 795(??): [2310] J. Bang-Jensen, Kristine V. K. Knud- sen, Saket Saurabh, and Meirav 128–141, November 26, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Zehavi. The parameterized com- 1879-2294 (electronic). URL plexity landscape of ﬁnding 2- http: partitions of digraphs. Theoreti- //www.sciencedirect.com/science/ . cal Computer Science, 795(??):108– article/pii/S0304397519303937 114, November 26, 2019. CODEN Brimkov:2019:PDT TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2314] Boris Brimkov, Joshua Carlson, //www.sciencedirect.com/science/ Illya V. Hicks, Rutvik Patel, and Logan article/pii/S0304397519303901. Smith. Power domination throttling. Kuo:2019:CFH Theoretical Computer Science, 795(??): 142–153, November 26, 2019. CODEN [2311] Che-Nan Kuo and Yu-Huei Cheng. Cy- TCSCDI. ISSN 0304-3975 (print), cles in folded hypercubes with two 1879-2294 (electronic). URL http: REFERENCES 345

//www.sciencedirect.com/science/ 203, November 26, 2019. CODEN article/pii/S0304397519303949. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Hu:2019:AHD //www.sciencedirect.com/science/ [2315] Yining Hu and Guoniu Wei-Han. article/pii/S0304397519303986. On the automaticity of the Han- Sdroievski:2019:HSP kel determinants of a family of automatic sequences. Theoretical [2319] Nicollas M. Sdroievski, Murilo V. G. Computer Science, 795(??):154–164, da Silva, and André L. Vignatti. The November 26, 2019. CODEN TC- Hidden Subgroup Problem and MKTP. SCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 795(??): 1879-2294 (electronic). URL http: 204–212, November 26, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519303950. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Ramya:2019:LPV article/pii/S0304397519303998. [2316] C. Ramya and B. V. Raghaven- Miao:2019:SFT dra Rao. Linear projections of the Vandermonde polynomial. Theoret- [2320] Lu Miao, Shurong Zhang, Rong hua ical Computer Science, 795(??):165– Li, and Weihua Yang. Structure fault 182, November 26, 2019. CODEN tolerance of k-ary n-cube networks. TCSCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 795(??): 1879-2294 (electronic). URL http: 213–218, November 26, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519303962. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Berge:2019:PCS article/pii/S0304397519304001. [2317] Pierre Bergé, Arpad Rimmel, and Cheng:2019:VDP Joanna Tomasik. On the parameterized complexity of separating cer- [2321] Dongqin Cheng. Vertex-disjoint paths tain sources from the target. Theo- joining adjacent vertices in faulty retical Computer Science, 795(??):183– hypercubes. Theoretical Computer 193, November 26, 2019. CODEN Science, 795(??):219–224, Novem- TCSCDI. ISSN 0304-3975 (print), ber 26, 2019. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519303974. //www.sciencedirect.com/science/ article/pii/S0304397519304025. Terrier:2019:CCT Khalili:2019:STS [2318] Véronique Terrier. Communica- tion complexity tools on recogniz- [2322] Mojtaba Khalili, Mohammad Dakhi- able picture languages. Theoreti- lalian, and Carla Ràfols. Short tightly cal Computer Science, 795(??):194– secure signatures for signing a vector REFERENCES 346

of group elements: a new approach. power covering problems. Theoret- Theoretical Computer Science, 795(??): ical Computer Science, 795(??):285– 225–239, November 26, 2019. CODEN 300, November 26, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S030439751930427X. article/pii/S0304397519304360.

Latteux:2019:POR Glen:2019:MPF

[2323] Michel Latteux and Yves Roos. On [2327] Amy Glen, Jamie Simpson, and W. F. preﬁxal one-rule string rewrite systems. Smyth. More properties of the Fi- Theoretical Computer Science, 795(??): bonacci word on an inﬁnite alphabet. 240–256, November 26, 2019. CODEN Theoretical Computer Science, 795(??): TCSCDI. ISSN 0304-3975 (print), 301–311, November 26, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751930430X. //www.sciencedirect.com/science/ article/pii/S0304397519304372. Otto:2019:DOR Andres:2019:OCG [2324] Friedrich Otto. On deterministic ordered restart-delete automata. Theo- [2328] Stephan Dominique Andres, Melissa retical Computer Science, 795(??):257– Huggan, Fionn Mc Inerney, and 274, November 26, 2019. CODEN Richard J. Nowakowski. The or- TCSCDI. ISSN 0304-3975 (print), thogonal colouring game. Theoret- 1879-2294 (electronic). URL http: ical Computer Science, 795(??):312– //www.sciencedirect.com/science/ 325, November 26, 2019. CODEN article/pii/S0304397519304347. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Cai:2019:TED //www.sciencedirect.com/science/ article/pii/S0304397519304499. See [2325] Leizhen Cai and Junjie Ye. Two edge- corrigendum [2418]. disjoint paths with length constraints. Theoretical Computer Science, 795(??): Zhang:2019:TSS 275–284, November 26, 2019. CODEN [2329] Xiao Zhang, Shengli Liu, Jiaxin Pan, TCSCDI. ISSN 0304-3975 (print), and Dawu Gu. Tightly secure sig- 1879-2294 (electronic). URL http: nature schemes from the LWE and //www.sciencedirect.com/science/ subset sum assumptions. Theoret- article/pii/S0304397519304359. ical Computer Science, 795(??):326– Calinescu:2019:IAA 344, November 26, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2326] Gruia Calinescu, Guy Kortsarz, and 1879-2294 (electronic). URL http: Zeev Nutov. Improved approx- //www.sciencedirect.com/science/ imation algorithms for minimum article/pii/S0304397519304505. REFERENCES 347

Ferraioli:2019:SPO 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2330] Diodato Ferraioli and Carmine Ventre. article/pii/S0304397519304554. Social pressure in opinion dynamics. Theoretical Computer Science, 795(??): Bekosa:2019:PDF 345–361, November 26, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2334] Michael A. Bekosa, Felice De Luca, 1879-2294 (electronic). URL http: Walter Didimo, Tamara Mchedlidze, //www.sciencedirect.com/science/ Martin N¨ollenburg, Antonios Symvo- article/pii/S0304397519304529. nis, and Ioannis Tollis. Planar draw- Czyzowicz:2019:EOB ings of ﬁxed-mobile bigraphs. Theo- retical Computer Science, 795(??):408– [2331] Jurek Czyzowicz, Krzysztof Diks, Jean 419, November 26, 2019. CODEN Moussi, and Wojciech Rytter. Energy- TCSCDI. ISSN 0304-3975 (print), optimal broadcast and exploration in 1879-2294 (electronic). URL http: a tree using mobile agents. Theoret- //www.sciencedirect.com/science/ ical Computer Science, 795(??):362– article/pii/S0304397519304608. 374, November 26, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), Khuller:2019:SPI 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2335] Samir Khuller, Jingling Li, Pascal . article/pii/S0304397519304530 Sturmfels, Kevin Sun, and Prayaag Angelinia:2019:GRD Venkat. Select and permute: an improved online framework for scheduling [2332] Patrizio Angelinia, Michael A. Bekosa, to minimize weighted completion time. Walter Didimo, Luca Grilli, Philipp Theoretical Computer Science, 795(??): Kindermann, Tamara Mchedlidze, Ro- 420–431, November 26, 2019. CODEN man Prutkin, Antonios Symvonis, TCSCDI. ISSN 0304-3975 (print), and Alessandra Tappini. Greedy 1879-2294 (electronic). URL http: rectilinear drawings. Theoretical //www.sciencedirect.com/science/ Computer Science, 795(??):375–397, article/pii/S030439751930461X. November 26, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), Peng:2019:GCS 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2336] Liqiang Peng and Atsushi Takayasu. article/pii/S0304397519304542. Generalized cryptanalysis of small Abam:2019:GSG CRT-exponent RSA. Theoretical Computer Science, 795(??):432–458, [2333] Mohammad Ali Abam and Mahnaz Sa- November 26, 2019. CODEN TC- dat Qafari. Geometric spanner games. SCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 795(??): 1879-2294 (electronic). URL http: 398–407, November 26, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519304669. REFERENCES 348

Amir:2019:PPG Jansen:2019:CCN

[2337] Michael Amir and Alfred M. Bruck- [2341] Bart M. P. Jansen and Jesper stein. Probabilistic pursuits on graphs. Nederlof. Computing the chro- Theoretical Computer Science, 795(??): matic number using graph decompo- 459–477, November 26, 2019. CODEN sitions via matrix rank. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 795(??):520– 1879-2294 (electronic). URL http: 539, November 26, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519304906. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Crampton:2019:PRP article/pii/S0304397519304955. [2338] Jason Crampton, Gregory Gutin, Mar- Xu:2019:ETD tin Koutecký, and Rémi Watrigant. Pa- rameterized resiliency problems. Theo- [2342] Min Xu and Yulong Wei. The retical Computer Science, 795(??):478– h-edge tolerable diagnosability of 491, November 26, 2019. CODEN balanced hypercubes. Theoretical TCSCDI. ISSN 0304-3975 (print), Computer Science, 795(??):540–546, 1879-2294 (electronic). URL http: November 26, 2019. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397519304918. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Garncarek:2019:OPS article/pii/S0304397519304967. [2339] Pawe l Garncarek, Tomasz Jurdziński, Legersky:2019:CAP Dariusz R. Kowalski, and Krzysztof Lory´s. Online packet scheduling [2343] Jan Legerský and Milena Svobodová. under adversarial errors. Theoreti- Construction of algorithms for paral- cal Computer Science, 795(??):492– lel addition in expanding bases via Ex- 509, November 26, 2019. CODEN tending Window Method. Theoret- TCSCDI. ISSN 0304-3975 (print), ical Computer Science, 795(??):547– 1879-2294 (electronic). URL http: 569, November 26, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751930492X. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Kamiyama:2019:DNM article/pii/S0304397519304992. [2340] Naoyuki Kamiyama. Discrete Newton Hara:2019:SBR methods for the evacuation problem. Theoretical Computer Science, 795(??): [2344] Keisuke Hara, Fuyuki Kitagawa, 510–519, November 26, 2019. CODEN Takahiro Matsuda, Goichiro Hanaoka, TCSCDI. ISSN 0304-3975 (print), and Keisuke Tanaka. Simulation- 1879-2294 (electronic). URL http: based receiver selective opening CCA //www.sciencedirect.com/science/ secure PKE from standard com- article/pii/S0304397519304931. putational assumptions. Theoreti- REFERENCES 349

cal Computer Science, 795(??):570– 1879-2294 (electronic). URL http: 597, November 26, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519305079. 1879-2294 (electronic). URL http: DeBonis:2019:NSL //www.sciencedirect.com/science/ article/pii/S0304397519305055. [2349] Annalisa De Bonis. New selectors and locally thin families with applica- Anonymous:2019:PDa tions to multi-access channels support- [2345] Anonymous. Pages 1–308 (3 Decem- ing simultaneous transmissions. The- ber 2019). Theoretical Computer Sci- oretical Computer Science, 796(??): ence, 796(??):1–308, December 3, 2019. 34–50, December 3, 2019. CODEN CODEN TCSCDI. ISSN 0304-3975 TCSCDI. ISSN 0304-3975 (print), (print), 1879-2294 (electronic). 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Anonymous:2019:EBbs article/pii/S0304397519305092.

[2346] Anonymous. Editorial Board. The- Kotzing:2019:FHT oretical Computer Science, 796(??): [2350] Timo K¨otzing and Martin S. Krejca. ii, December 3, 2019. CODEN First-hitting times under drift. The- TCSCDI. ISSN 0304-3975 (print), oretical Computer Science, 796(??): 1879-2294 (electronic). URL http: 51–69, December 3, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519306656. 1879-2294 (electronic). URL http: Banerjee:2019:PRD //www.sciencedirect.com/science/ article/pii/S0304397519305109. [2347] S. Banerjee, J. Mark Keil, and D. Pradhan. Perfect Roman domi- Wang:2019:CPF nation in graphs. Theoretical Com- [2351] Yucheng Wang, Qi Bao, and Zhongzhi puter Science, 796(??):1–21, De- Zhang. Combinatorial properties cember 3, 2019. CODEN TC- of Farey graphs. Theoretical Com- SCDI. ISSN 0304-3975 (print), puter Science, 796(??):70–89, De- 1879-2294 (electronic). URL http: cember 3, 2019. CODEN TC- //www.sciencedirect.com/science/ SCDI. ISSN 0304-3975 (print), article/pii/S0304397519305067. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ DeLuca:2019:RDS article/pii/S0304397519305110. [2348] Felice De Luca, Md Iqbal Hossain, Yang:2019:TAS Stephen Kobourov, Anna Lubiw, and Debajyoti Mondal. Recognition and [2352] Liya Yang and Xiwen Lu. Two-agent drawing of stick graphs. Theoret- scheduling problems with the general ical Computer Science, 796(??):22– position-dependent processing time. 33, December 3, 2019. CODEN Theoretical Computer Science, 796(??): TCSCDI. ISSN 0304-3975 (print), 90–98, December 3, 2019. CODEN REFERENCES 350

TCSCDI. ISSN 0304-3975 (print), Lian:2019:PEH 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2356] Guanqin Lian, Shuming Zhou, Sun- article/pii/S0304397519305122. Yuan Hsieh, Jiafei Liu, Gaolin Chen, and Yihong Wang. Performance eval- Hanneke:2019:OSN uation on hybrid fault diagnosability of regular networks. Theoreti- cal Computer Science, 796(??):147– [2353] Steve Hanneke and Aryeh Kon- 153, December 3, 2019. CODEN torovich. Optimality of SVM: Novel TCSCDI. ISSN 0304-3975 (print), proofs and tighter bounds. Theo- 1879-2294 (electronic). URL http: retical Computer Science, 796(??):99– //www.sciencedirect.com/science/ 113, December 3, 2019. CODEN article/pii/S0304397519305481. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Tellache:2019:TMO //www.sciencedirect.com/science/ article/pii/S0304397519305262. [2357] Nour El Houda Tellache, Mourad Boudhar, and Farouk Yalaoui. Two- Siddiqui:2019:RFT machine open shop problem with agreement graph. Theoretical Com- puter Science, 796(??):154–168, De- [2354] Haﬁz Muhammad Afzal Siddiqui, cember 3, 2019. CODEN TC- Sakander Hayat, Asad Khan, Muham- SCDI. ISSN 0304-3975 (print), mad Imran, Ayesha Razzaq, and Jia- 1879-2294 (electronic). URL Bao Liu. Resolvability and fault- http: tolerant resolvability structures of con- //www.sciencedirect.com/science/ . vex polytopes. Theoretical Com- article/pii/S0304397519305493 puter Science, 796(??):114–128, De- Li:2019:SCS cember 3, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), [2358] Dong Li, Xiaolan Hu, and Huiqing 1879-2294 (electronic). URL http: Liu. Structure connectivity and sub- //www.sciencedirect.com/science/ structure connectivity of twisted hy- article/pii/S0304397519305286. percubes. Theoretical Computer Sci- ence, 796(??):169–179, December 3, Docker:2019:DTA 2019. CODEN TCSCDI. ISSN 0304- 3975 (print), 1879-2294 (electronic). [2355] Janosch D¨ocker, Simone Linz, and URL http://www.sciencedirect. Charles Semple. Displaying trees across com/science/article/pii/S0304397519305511. two phylogenetic networks. Theoret- Rad:2019:CMB ical Computer Science, 796(??):129– 146, December 3, 2019. CODEN [2359] Nader Jafari Rad. On the complexity TCSCDI. ISSN 0304-3975 (print), of multiple bondage in graphs. The- 1879-2294 (electronic). URL http: oretical Computer Science, 796(??): //www.sciencedirect.com/science/ 180–186, December 3, 2019. CODEN article/pii/S030439751930547X. TCSCDI. ISSN 0304-3975 (print), REFERENCES 351

1879-2294 (electronic). URL http: 216–236, December 3, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519305523. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Janczewski:2019:CNR article/pii/S0304397519305560. [2360] Robert Janczewski, Pawe l Obszarski, Moore:2019:FDC and Krzysztof Turowski. 2-coloring number revisited. Theoretical Com- [2364] Matthew Moore. Finite degree puter Science, 796(??):187–195, De- clones are undecidable. Theoreti- cember 3, 2019. CODEN TC- cal Computer Science, 796(??):237– SCDI. ISSN 0304-3975 (print), 271, December 3, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519305535. //www.sciencedirect.com/science/ Schweser:2019:DDC article/pii/S0304397519305584. [2361] Thomas Schweser. DP-degree col- Castelli:2019:CIS orable hypergraphs. Theoretical Com- [2365] Mauro Castelli, Riccardo Dondi, Gi- puter Science, 796(??):196–206, De- ancarlo Mauri, and Italo Zoppis. cember 3, 2019. CODEN TC- Comparing incomplete sequences via SCDI. ISSN 0304-3975 (print), longest common subsequence. The- 1879-2294 (electronic). URL http: oretical Computer Science, 796(??): //www.sciencedirect.com/science/ 272–285, December 3, 2019. CODEN article/pii/S0304397519305547. TCSCDI. ISSN 0304-3975 (print), Majumdar:2019:TKE 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2362] Diptapriyo Majumdar, Rian Neogi, article/pii/S0304397519305663. Venkatesh Raman, and S. Vaishali. Tractability of K¨onig edge dele- Filmus:2019:ALD tion problems. Theoretical Com- puter Science, 796(??):207–215, De- [2366] Yuval Filmus. Another look at degree cember 3, 2019. CODEN TC- lower bounds for polynomial calculus. SCDI. ISSN 0304-3975 (print), Theoretical Computer Science, 796(??): 1879-2294 (electronic). URL http: 286–293, December 3, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519305559. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Jaﬀke:2019:MWI article/pii/S0304397519305675.

[2363] Lars Jaﬀke, O joung Kwon, Torstein Hanaka:2019:MWM J. F. Strømme, and Jan Arne Telle. Mim-width III. Graph powers and gen- [2367] Tesshu Hanaka, Hans L. Bodlaen- eralized distance domination problems. der, Tom C. van der Zanden, and Theoretical Computer Science, 796(??): Hirotaka Ono. On the maximum REFERENCES 352

weight minimal separator. Theoret- Collective singleton-based consistency ical Computer Science, 796(??):294– for qualitative constraint networks: 308, December 3, 2019. CODEN Theory and practice. Theoreti- TCSCDI. ISSN 0304-3975 (print), cal Computer Science, 797(??):17– 1879-2294 (electronic). URL http: 41, December 10, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519305766. 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ Anonymous:2019:EBbt article/pii/S0304397519301343. [2368] Anonymous. Editorial Board. The- Amarilli:2019:CPC oretical Computer Science, 797(??): ii, December 10, 2019. CODEN [2372] Antoine Amarilli, Mouhamadou Lamine TCSCDI. ISSN 0304-3975 (print), Ba, Daniel Deutch, and Pierre Senel- 1879-2294 (electronic). URL http: lart. Computing possible and certain //www.sciencedirect.com/science/ answers over order-incomplete data. article/pii/S0304397519306760. Theoretical Computer Science, 797(??): 42–76, December 10, 2019. CODEN Schewe:2019:SIT TCSCDI. ISSN 0304-3975 (print), [2369] Sven Schewe, Thomas Schneider, and 1879-2294 (electronic). URL http: Jef Wijsen. Special issue on Temporal //www.sciencedirect.com/science/ Representation and Reasoning (TIME article/pii/S0304397519303214. 2017). Theoretical Computer Science, Zavatteri:2019:CST 797(??):1, December 10, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2373] Matteo Zavatteri and Luca Vigan`o. 1879-2294 (electronic). URL http: Conditional simple temporal networks //www.sciencedirect.com/science/ with uncertainty and decisions. Theo- article/pii/S0304397519306723. retical Computer Science, 797(??):77– 101, December 10, 2019. CODEN Cairo:2019:DCS TCSCDI. ISSN 0304-3975 (print), [2370] Massimo Cairo and Romeo Rizzi. Dy- 1879-2294 (electronic). URL http: namic controllability of simple tempo- //www.sciencedirect.com/science/ ral networks with uncertainty: Sim- article/pii/S0304397518305942. ple rules and fast real-time execution. Walega:2019:HFH Theoretical Computer Science, 797(??): 2–16, December 10, 2019. CODEN [2374] Przemys law Andrzej Walega. Hybrid TCSCDI. ISSN 0304-3975 (print), fragments of Halpern–Shoham logic 1879-2294 (electronic). URL http: and their expressive power. Theoret- //www.sciencedirect.com/science/ ical Computer Science, 797(??):102– article/pii/S0304397518306765. 128, December 10, 2019. CODEN Sioutis:2019:CSB TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2371] Michael Sioutis, Anastasia Paparri- //www.sciencedirect.com/science/ zou, and Jean-Fran¸cois Condotta. article/pii/S0304397519300313. REFERENCES 353

Goranko:2019:ATT //www.sciencedirect.com/science/ article/pii/S030439751930550X. [2375] Valentin Goranko, Antti Kuusisto, and Raine Rönnholm. Alternating- Ibarra:2019:SGS time temporal logic ATL with finitely [2379] Oscar H. Ibarra and Ian McQuillan. bounded semantics. Theoretical Com- State grammars with stores. The- puter Science, 797(??):129–155, De- oretical Computer Science, 798(??): cember 10, 2019. CODEN TC- 23–39, December 17, 2019. CODEN SCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519303780. article/pii/S0304397519304165. Anonymous:2019:EBbu Cho:2019:SDI [2376] Anonymous. Editorial Board. The- [2380] Da-Jung Cho, Yo-Sub Han, Kai Sa- oretical Computer Science, 798(??): lomaa, and Taylor J. Smith. Site- ii, December 17, 2019. CODEN directed insertion: Language equa- TCSCDI. ISSN 0304-3975 (print), tions and decision problems. The- 1879-2294 (electronic). URL http: oretical Computer Science, 798(??): //www.sciencedirect.com/science/ 40–51, December 17, 2019. CODEN article/pii/S0304397519306875. TCSCDI. ISSN 0304-3975 (print), Konstantinidis:2019:SSD 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2377] Stavros Konstantinidis and Giovanni article/pii/S030439751930307X. Pighizzini. Special section on De- Jiraskova:2019:SCU scriptional Complexity of Formal Sys- tems. Theoretical Computer Science, [2381] Galina Jirásková and Alexander 798(??):1, December 17, 2019. CODEN Okhotin. State complexity of unam- TCSCDI. ISSN 0304-3975 (print), biguous operations on finite automata. 1879-2294 (electronic). URL http: Theoretical Computer Science, 798(??): //www.sciencedirect.com/science/ 52–64, December 17, 2019. CODEN article/pii/S0304397519306796. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Yamakami:2019:SCC //www.sciencedirect.com/science/ [2378] Tomoyuki Yamakami. State com- article/pii/S0304397519302890. plexity characterizations of parame- Okhotin:2019:FCP terized degree-bounded graph connectivity, sub-linear space computation, [2382] Alexander Okhotin and Kai Salomaa. and the linear space hypothesis. The- Further closure properties of input- oretical Computer Science, 798(??): driven pushdown automata. Theo- 2–22, December 17, 2019. CODEN retical Computer Science, 798(??):65– TCSCDI. ISSN 0304-3975 (print), 77, December 17, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), REFERENCES 354

1879-2294 (electronic). URL http: Anonymous:2019:EBbv //www.sciencedirect.com/science/ article/pii/S030439751930283X. [2387] Anonymous. Editorial Board. The- oretical Computer Science, 799(??): Beier:2019:PRO ii, December 24, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), [2383] Simon Beier and Markus Holzer. Prop- 1879-2294 (electronic). URL http: erties of right one-way jumping ﬁ- //www.sciencedirect.com/science/ nite automata. Theoretical Com- article/pii/S0304397519307108. puter Science, 798(??):78–94, De- cember 17, 2019. CODEN TC- DaLozzo:2019:PSG SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2388] Giordano Da Lozzo and Ignaz Rut- //www.sciencedirect.com/science/ ter. Planarity of streamed graphs. article/pii/S0304397519302178. Theoretical Computer Science, 799(??): 1–21, December 24, 2019. CODEN Guillon:2019:LTL TCSCDI. ISSN 0304-3975 (print), [2384] Bruno Guillon and Luca Prigioniero. 1879-2294 (electronic). URL http: Linear-time limited automata. Theo- //www.sciencedirect.com/science/ retical Computer Science, 798(??):95– article/pii/S0304397519305808. 108, December 17, 2019. CODEN Sabir:2019:ECE TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2389] Eminjan Sabir, Aygul Mamut, and //www.sciencedirect.com/science/ Elkin Vumar. The extra connectiv- article/pii/S0304397519302105. ity of the enhanced hypercubes. The- Hetzl:2019:CCF oretical Computer Science, 799(??): 22–31, December 24, 2019. CODEN [2385] Stefan Hetzl and Simon Wolfsteiner. TCSCDI. ISSN 0304-3975 (print), On the cover complexity of ﬁ- 1879-2294 (electronic). URL http: nite languages. Theoretical Com- //www.sciencedirect.com/science/ puter Science, 798(??):109–125, De- article/pii/S0304397519305869. cember 17, 2019. CODEN TC- SCDI. ISSN 0304-3975 (print), Rahbani:2019:NCL 1879-2294 (electronic). URL http: [2390] Hadi Rahbani, Nader Jafari Rad, //www.sciencedirect.com/science/ and Mohammad-Reza Sadeghi. A article/pii/S0304397519303020. note on the complexity of locating- Anonymous:2019:PDb total domination in graphs. Theo- retical Computer Science, 799(??):32– [2386] Anonymous. Pages 1–160 (24 De- 39, December 24, 2019. CODEN cember 2019). Theoretical Computer TCSCDI. ISSN 0304-3975 (print), Science, 799(??):1–160, December 24, 1879-2294 (electronic). URL http: 2019. CODEN TCSCDI. ISSN 0304- //www.sciencedirect.com/science/ 3975 (print), 1879-2294 (electronic). article/pii/S0304397519306036. REFERENCES 355

Boros:2019:SGF TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2391] Endre Boros, Vladimir Gurvich, //www.sciencedirect.com/science/ Nhan Bao Ho, Kazuhisa Makino, article/pii/S0304397519306176. and Peter Mursic. Sprague–Grundy function of matroids and related Miao:2019:PTE hypergraphs. Theoretical Com- [2395] Runjie Miao, Jinjiang Yuan, and Fei puter Science, 799(??):40–58, De- Huang. Paths and trails in edge- cember 24, 2019. CODEN TC- colored weighted graphs. Theoreti- SCDI. ISSN 0304-3975 (print), cal Computer Science, 799(??):104– 1879-2294 (electronic). URL http: 114, December 24, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S030439751930605X. 1879-2294 (electronic). URL http: Zhang:2019:HFD //www.sciencedirect.com/science/ article/pii/S0304397519306188. [2392] Shunzhe Zhang, Huiqing Liu, and Xi- aolan Hu. Hybrid fault diagnosis capa- Murtaza:2019:LDS bility analysis of triangle-free graphs. [2396] Muhammad Murtaza, Muhammad Theoretical Computer Science, 799(??): Fazil, and Imran Javaid. Locating- 59–70, December 24, 2019. CODEN dominating sets of functigraphs. Theo- TCSCDI. ISSN 0304-3975 (print), retical Computer Science, 799(??):115– 1879-2294 (electronic). URL http: 123, December 24, 2019. CODEN //www.sciencedirect.com/science/ TCSCDI. ISSN 0304-3975 (print), article/pii/S0304397519306061. 1879-2294 (electronic). URL http: Ibarra:2019:FFT //www.sciencedirect.com/science/ article/pii/S0304397519306218. [2393] Oscar H. Ibarra and Ian McQuillan. Dose:2019:BPI On families of full trios containing counter machine languages. Theo- [2397] Titus Dose. Balance problems for retical Computer Science, 799(??):71– integer circuits. Theoretical Com- 93, December 24, 2019. CODEN puter Science, 799(??):124–139, De- TCSCDI. ISSN 0304-3975 (print), cember 24, 2019. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519306152. //www.sciencedirect.com/science/ article/pii/S030439751930622X. Gu:2019:SMC Currie:2019:SFR [2394] Mei-Mei Gu, Shengjie He, Rong-Xia Hao, and Eddie Cheng. Strongly [2398] James Currie, Tero Harju, Pascal Menger connectedness of data center Ochem, and Narad Rampersad. Some network and (n, k)-star graph. Theo- further results on squarefree arithmetic retical Computer Science, 799(??):94– progressions in inﬁnite words. Theo- 103, December 24, 2019. CODEN retical Computer Science, 799(??):140– REFERENCES 356

148, December 24, 2019. CODEN 14, December 31, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519306292. article/pii/S0304397519306395. Pferschy:2019:SKG Caron:2019:SCC [2399] Ulrich Pferschy, Gaia Nicosia, and An- drea Paciﬁci. A Stackelberg knapsack [2403] Pascal Caron, Jean-Gabriel Luque, and game with weight control. Theoret- Bruno Patrou. State complexity of ical Computer Science, 799(??):149– combined operations involving catena- 159, December 24, 2019. CODEN tion and binary Boolean operations: TCSCDI. ISSN 0304-3975 (print), Beyond the Brzozowski conjectures. 1879-2294 (electronic). URL http: Theoretical Computer Science, 800(??): //www.sciencedirect.com/science/ 15–30, December 31, 2019. CODEN article/pii/S0304397519306309. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Anonymous:2019:EBbw //www.sciencedirect.com/science/ [2400] Anonymous. Editorial Board. The- article/pii/S0304397519306425. oretical Computer Science, 800(??): ii, December 31, 2019. CODEN Colbourn:2019:DHF TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: [2404] Charles J. Colbourn, Ryan E. //www.sciencedirect.com/science/ Dougherty, and Daniel Horsley. Dis- article/pii/S0304397519307169. tributing hash families with few rows. Theoretical Computer Science, 800(??): Droste:2019:P 31–41, December 31, 2019. CODEN [2401] Manfred Droste, Ilias Kotsireas, and TCSCDI. ISSN 0304-3975 (print), Robert Rolland. Preface. Theo- 1879-2294 (electronic). URL http: retical Computer Science, 800(??):1– //www.sciencedirect.com/science/ 2, December 31, 2019. CODEN article/pii/S0304397519306437. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: Doukas:2019:HFD //www.sciencedirect.com/science/ article/pii/S0304397519306383. [2405] Nikolaos Doukas, Oleksandr P. Markovskyi, Bard:2019:DWG and Nikolaos G. Bardis. Hash function design for cloud storage data auditing. [2402] Gregory V. Bard. Determining Theoretical Computer Science, 800(??): whether a given cryptographic func- 42–51, December 31, 2019. CODEN tion is a permutation of another given TCSCDI. ISSN 0304-3975 (print), cryptographic function — a prob- 1879-2294 (electronic). URL http: lem in intellectual property. Theo- //www.sciencedirect.com/science/ retical Computer Science, 800(??):3– article/pii/S0304397519306449. REFERENCES 357

Duchamp:2019:KSP 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ [2406] G. H. E. Duchamp, V. Hoang Ngoc article/pii/S0304397519306486. Minh, and Ngo Quoc Hoan. Kleene stars of the plane, polylogarithms Klima:2019:SSR and symmetries. Theoretical Com- [2410] Ondrej Kl´ıma and Libor Pol´ak. Syn- puter Science, 800(??):52–72, De- tactic structures of regular languages. cember 31, 2019. CODEN TC- Theoretical Computer Science, 800(??): SCDI. ISSN 0304-3975 (print), 125–141, December 31, 2019. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519306450. //www.sciencedirect.com/science/ Fotiadis:2019:TRF article/pii/S0304397519306498. Lisonek:2019:KSS [2407] Georgios Fotiadis and Elisavet Kon- stantinou. TNFS resistant families of [2411] Petr Lisonek. Kochen–Specker sets pairing-friendly elliptic curves. The- and Hadamard matrices. Theoret- oretical Computer Science, 800(??): ical Computer Science, 800(??):142– 73–89, December 31, 2019. CODEN 145, December 31, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519306462. article/pii/S0304397519306504. Kampel:2019:PAC Moura:2019:UBS [2408] Ludwig Kampel, Manuel Leithner, [2412] Lucia Moura, Sebastian Raaphorst, Bernhard Garn, and Dimitris E. Simos. and Brett Stevens. Upper bounds on Problems and algorithms for cover- the sizes of variable strength covering ing arrays via set covers. Theoret- arrays using the Lov´asz local lemma. ical Computer Science, 800(??):90– Theoretical Computer Science, 800(??): 106, December 31, 2019. CODEN 146–154, December 31, 2019. CODEN TCSCDI. ISSN 0304-3975 (print), TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/ //www.sciencedirect.com/science/ article/pii/S0304397519306474. article/pii/S0304397519306516. Kampel:2019:SSA Pin:2019:LFG

[2409] Ludwig Kampel and Dimitris E. Simos. [2413] Jean-Eric´ Pin and Xaro Soler-Escriv`a. A survey on the state of the art of com- Languages and formations generated plexity problems for covering arrays. by D4 and Q8. Theoretical Com- Theoretical Computer Science, 800(??): puter Science, 800(??):155–172, De- 107–124, December 31, 2019. CODEN cember 31, 2019. CODEN TC- TCSCDI. ISSN 0304-3975 (print), SCDI. ISSN 0304-3975 (print), REFERENCES 358

1879-2294 (electronic). URL http: article/pii/S0304397519307443. See //www.sciencedirect.com/science/ [2022]. article/pii/S0304397519306528. Dang:2020:ECC Sakkalis:2019:RQP [2417] Chuangyin Dang and Yinyu Ye. Er- ratum/correction to “On the com- [2414] Takis Sakkalis, Kwanghee Ko, and plexity of an expanded Tarski’s ﬁxed Galam Song. Roots of quaternion point problem under the compo- polynomials: Theory and computation. nentwise ordering” [Theor. Comput. Theoretical Computer Science, 800(??): Sci. 732 (2018) 26–45]. Theo- 173–178, December 31, 2019. CODEN retical Computer Science, 817(??): TCSCDI. ISSN 0304-3975 (print), 80, May 12, 2020. CODEN TC- 1879-2294 (electronic). URL http: SCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S030439751930653X. //www.sciencedirect.com/science/ Sadhu:2020:CLT article/pii/S0304397519301677. See [1698]. [2415] Sanjib Sadhu, Xiaozhou He, Sasanka Andres:2020:COC Roy, Subhas C. Nandy, and Suchis- mita Roy. Corrigendum to: “Lin- [2418] Stephan Dominique Andres, Melissa ear time algorithm to cover and hit a Huggan, Fionn Mc Inerney, and set of line segments optimally by two Richard J. Nowakowski. Corrigen- axis-parallel squares” [Theor. Com- dum to “The orthogonal colour- put. Sci. 769 (2019) 63–74]. The- ing game” [Theor. Comput. Sci. oretical Computer Science, 806(??): 795 (2019) 312–325]. Theoreti- 632–640, February 2, 2020. CODEN cal Computer Science, 842(??):133– TCSCDI. ISSN 0304-3975 (print), 135, November 24, 2020. CODEN 1879-2294 (electronic). URL http: TCSCDI. ISSN 0304-3975 (print), //www.sciencedirect.com/science/ 1879-2294 (electronic). URL http: article/pii/S0304397519306140. See //www.sciencedirect.com/science/ [2013]. article/pii/S0304397519307698. See [2328]. Lazard:2020:CEL

[2416] Sylvain Lazard, William J. Lenhart, and Giuseppe Liotta. Corrigen- dum to “On the edge-length ratio of outerplanar graphs” [Theoret. Com- put. Sci. 770 (2019) 88–94]. The- oretical Computer Science, 806(??): 689, February 2, 2020. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). URL http: //www.sciencedirect.com/science/