Last update:
Thu Oct 17 07:17:35 MDT 2024
Guy Feigenblat and
Ofra Itzhaki and
Ely Porat The frequent items problem, under
polynomial decay, in the streaming model 3048--3054
Livio Colussi The convergence classes of Collatz
function . . . . . . . . . . . . . . . . 5409--5419
Jun Hosoda and
Juraj Hromkovic and
Taisuke Izumi and
Hirotaka Ono and
Monika Steinová and
Koichi Wada On the approximability and hardness of
minimum topic connected overlay and its
special instances . . . . . . . . . . . 144--154
T. Calamoneri and
R. Petreschi On pairwise compatibility graphs having
Dilworth number two . . . . . . . . . . 34--40
Graham Cormode and
Hossein Jowhari A second look at counting triangles in
graph streams . . . . . . . . . . . . . 44--51
Kung-Jui Pai and
Jou-Ming Chang and
Jinn-Shyong Yang and
Ro-Yu Wu Incidence coloring on hypercubes . . . . 59--65
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Tobias Friedrich and
Jun He and
Thomas Jansen and
Alberto Moraglio Genetic and Evolutionary Computation . . 1--2
Benjamin Doerr and
Marvin Künnemann Optimizing linear functions with the $
(1 + \lambda) $ evolutionary algorithm
--- different asymptotic runtimes for
different instances . . . . . . . . . . 3--23
Anh Quang Nguyen and
Andrew M. Sutton and
Frank Neumann Population size matters: Rigorous
runtime results for maximizing the
hypervolume indicator . . . . . . . . . 24--36
Pietro S. Oliveto and
Christine Zarges Analysis of diversity mechanisms for
optimisation in dynamic environments
with low frequencies of change . . . . . 37--56
Manuel Schmitt and
Rolf Wanka Particle swarm optimization almost
surely finds local optima . . . . . . . 57--72
Andrei Lissovoi and
Carsten Witt Runtime analysis of ant colony
optimization on dynamic shortest path
problems . . . . . . . . . . . . . . . . 73--85
Michel Raynal and
Franck Petit Special Issue on Distributed Computing
and Networking . . . . . . . . . . . . . 87
Yehuda Afek and
Eli Gafni A simple characterization of
asynchronous computations . . . . . . . 88--95
Seda Davtyan and
Kishori M. Konwar and
Alexander Russell and
Alexander A. Shvartsman Dealing with undependable workers in
decentralized network supercomputing . . 96--112
Atish Das Sarma and
Anisur Rahaman Molla and
Gopal Pandurangan and
Eli Upfal Fast distributed PageRank computation 113--121
Carole Delporte-Gallet and
Hugues Fauconnier and
Eli Gafni and
Sergio Rajsbaum Linear space bootstrap communication
schemes . . . . . . . . . . . . . . . . 122--133
Shay Kutten and
Gopal Pandurangan and
David Peleg and
Peter Robinson and
Amitabh Trehan Sublinear bounds for randomized leader
election . . . . . . . . . . . . . . . . 134--143
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Ching-Hao Liu and
Sheung-Hung Poon and
Jin-Yong Lin Independent dominating set problem
revisited . . . . . . . . . . . . . . . 1--22
Yiannis Giannakopoulos and
Elias Koutsoupias Competitive analysis of maintaining
frequent items of a stream . . . . . . . 23--32
Amihood Amir and
Alberto Apostolico and
Gad M. Landau and
Ely Porat and
Oren Sar Shalom A PTAS for the Square Tiling Problem . . 33--45
Hao Fu and
Guo-Niu Han On $t$-extensions of the Hankel
determinants of certain automatic
sequences . . . . . . . . . . . . . . . 46--56
Yang Wang and
Man Ho Au and
Willy Susilo Optimistic fair exchange in the enhanced
chosen-key model . . . . . . . . . . . . 57--74
O. Delmas and
F. Havet and
M. Montassier and
S. Pérennes Design of fault-tolerant on-board
networks with variable switch sizes . . 75--89
Angelo Fanelli and
Dariusz Leniowski and
Gianpiero Monaco and
Piotr Sankowski The ring design game with fair cost
allocation . . . . . . . . . . . . . . . 90--100
Lucas de Oliveira and
Cid C. de Souza and
Tallys Yunes On the complexity of the traveling
umpire problem . . . . . . . . . . . . . 101--111
Xiaofeng Chen and
Willy Susilo and
Jin Li and
Duncan S. Wong and
Jianfeng Ma and
Shaohua Tang and
Qiang Tang Efficient algorithms for secure
outsourcing of bilinear pairings . . . . 112--121
Tian-Ming Bu and
Chen Yuan and
Peng Zhang Computing on binary strings . . . . . . 122--128
Maximilien Gadouleau and
Sòren Riis Memoryless computation: New results,
constructions, and extensions . . . . . 129--145
Lantao You and
Jianxi Fan and
Yuejuan Han and
Xiaohua Jia One-to-one disjoint path covers on
alternating group graphs . . . . . . . . 146--164
Hans L. Bodlaender and
Dieter Kratsch and
Sjoerd T. Timmer Exact algorithms for Kayles . . . . . . 165--176
Qiong Huang and
Guomin Yang and
Duncan S. Wong and
Willy Susilo Ambiguous optimistic fair exchange:
Definition and constructions . . . . . . 177--193
Xiao Tan and
Qiong Huang and
Duncan S. Wong Concurrent signature without random
oracles . . . . . . . . . . . . . . . . 194--212
Chenchen Wu and
Donglei Du and
Dachuan Xu Primal-dual approximation algorithm for
the two-level facility location problem
via a dual quasi-greedy approach . . . . 213--226
Alexander Gavruskin and
Bakhadyr Khoussainov and
Mikhail Kokho and
Jiamou Liu Dynamic algorithms for monotonic
interval scheduling problem . . . . . . 227--242
Jianxin Wei and
Heping Zhang Solution to a conjecture on words that
are bad and $2$-isometric . . . . . . . 243--251
Pinar Heggernes and
Pim van 't Hof and
Daniel Meister and
Yngve Villanger Induced Subgraph Isomorphism on proper
interval and bipartite permutation
graphs . . . . . . . . . . . . . . . . . 252--269
Sayan Bandyapadhyay and
Aritra Banik and
Sandip Das and
Hirak Sarkar Voronoi game on graphs . . . . . . . . . 270--282
Jòrgen Bang-Jensen and
Frédéric Havet and
A. Karolinna Maia Finding a subdivision of a digraph . . . 283--303
Flavio D'Alessandro and
Benedetto Intrigila On the commutative equivalence of
bounded context-free and regular
languages: the code case . . . . . . . . 304--319
Dekel Tsur Succinct representation of labeled trees 320--329
Sergio Bermudo and
Henning Fernau Combinatorics for smaller kernels: the
differential of a graph . . . . . . . . 330--345
Olivier Ruatta and
Mark Sciabica and
Agnes Szanto Overdetermined Weierstrass iteration and
the nearest consistent system . . . . . 346--364
Shiva Kintali and
Nishad Kothari and
Akash Kumar Approximation algorithms for digraph
width parameters . . . . . . . . . . . . 365--376
Yasmina Seddik and
Christophe Gonzales and
Safia Kedad-Sidhoum Performance guarantees for a scheduling
problem with common stepwise job payoffs 377--394
Xin Han and
Yasushi Kawase and
Kazuhisa Makino Randomized algorithms for online
knapsack problems . . . . . . . . . . . 395--405
Leonardo I. L. Oliveira and
Valmir C. Barbosa and
Fábio Protti The predecessor-existence problem for
$k$-reversible processes . . . . . . . . 406--418
Gruia Calinescu Bounding the payment of approximate
truthful mechanisms . . . . . . . . . . 419--435
Mikael Gast and
Mathias Hauptmann and
Marek Karpinski Inapproximability of dominating set on
power law graphs . . . . . . . . . . . . 436--452
Jean-Claude Bermond and
Bi Li and
Nicolas Nisse and
Hervé Rivano and
Min-Li Yu Data gathering and personalized
broadcasting in radio grids with
interference . . . . . . . . . . . . . . 453--475
Flavio D'Alessandro and
Benedetto Intrigila On the commutative equivalence of
semi-linear sets of $ N^k $ . . . . . . 476--495
Jianer Chen and
Jia-Hao Fan and
Sing-Hoi Sze Parameterized and approximation
algorithms for maximum agreement forest
in multifurcating trees . . . . . . . . 496--512
Asaf Levin and
Aleksander Vainer The benefit of adaptivity in stochastic
packing problems with probing . . . . . 513--523
George B. Mertzios and
Mordechai Shalom and
Ariella Voloshin and
Prudence W. H. Wong and
Shmuel Zaks Optimizing busy time on parallel
machines . . . . . . . . . . . . . . . . 524--541
Yi-Chun Wang and
Justie Su-Tzu Juan Hamiltonicity of the basic WK-recursive
pyramid with and without faulty nodes 542--556
Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Matús Mihalák Improving the $ H_k $-bound on the price
of stability in undirected Shapley
network design games . . . . . . . . . . 557--564
Limei Lin and
Li Xu and
Shuming Zhou Conditional diagnosability and strong
diagnosability of Split-Star Networks
under the PMC model . . . . . . . . . . 565--580
Jing Fan and
Xiwen Lu and
Peihai Liu Integrated scheduling of production and
delivery on a single machine with
availability constraint . . . . . . . . 581--589
Maohua Jing and
Yixian Yang and
Ning Lu and
Wenbo Shi and
Changyong Yu Postfix automata . . . . . . . . . . . . 590--605
Daniel Meister Using swaps and deletes to make strings
match . . . . . . . . . . . . . . . . . 606--620
Atalay Mert Ileri and
M. Oguzhan Külekci and
Bojian Xu A simple yet time-optimal and
linear-space algorithm for shortest
unique substring queries . . . . . . . . 621--633
Jean-François Couturier and
Romain Letourneur and
Mathieu Liedloff On the number of minimal dominating sets
on some graph classes . . . . . . . . . 634--642
Davide Bil\`o and
Luciano Gual\`a and
Stefano Leucci and
Guido Proietti Specializations and generalizations of
the Stackelberg minimum spanning tree
game . . . . . . . . . . . . . . . . . . 643--657
Tero Harju and
Mike Müller A note on short palindromes in
square-free words . . . . . . . . . . . 658--659
Jun Hosoda and
Juraj Hromkovic and
Taisuke Izumi and
Hirotaka Ono and
Monika Steinová and
Koichi Wada Corrigendum to ``On the approximability
and hardness of minimum topic connected
overlay and its special instances''
[Theoret. Comput. Sci. \bf 429 (2012)
144--154] . . . . . . . . . . . . . . . 660--661
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Ana Cavalcanti and
Marie-Claude Gaudel Test selection for traces refinement . . 1--42
Patricia Bouyer and
Nicolas Markey and
Ocan Sankur Robust reachability in timed automata
and games: a game-based approach . . . . 43--74
Giovanna D'Agostino and
Giacomo Lenzi Bisimulation quantifiers and uniform
interpolation for guarded first order
logic . . . . . . . . . . . . . . . . . 75--85
Xuechong Guan and
Yongming Li On conditions for mappings to preserve
optimal solutions of semiring-induced
valuation algebras . . . . . . . . . . . 86--98
Marco Bernardo On the tradeoff between compositionality
and exactness in weak bisimilarity for
integrated-time Markovian process
calculi . . . . . . . . . . . . . . . . 99--143
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Wenhui Zhang Bounded semantics . . . . . . . . . . . 1--29
Willem Conradie and
Yves Fomatati and
Alessandra Palmigiano and
Sumit Sourabh Algorithmic correspondence for
intuitionistic modal mu-calculus . . . . 30--62
Jean-François Dufourd Formal study of functional orbits in
finite domains . . . . . . . . . . . . . 63--88
Abbas Edalat A derivative for complex Lipschitz maps
with generalised Cauchy--Riemann
equations . . . . . . . . . . . . . . . 89--106
Fabrizio Angiulli and
Rachel Ben-Eliyahu-Zohary and
Luigi Palopoli Restricted default theories: Expressive
power and outlier detection tasks . . . 107--130
Barbara Di Giampaolo and
Salvatore La Torre and
Margherita Napoli Parametric metric interval temporal
logic . . . . . . . . . . . . . . . . . 131--148
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Henning Fernau and
Fedor V. Fomin and
Geevarghese Philip and
Saket Saurabh On the parameterized complexity of
vertex cover and edge cover with
connectivity constraints . . . . . . . . 1--15
Marc Hellmuth and
Tilen Marc On the Cartesian skeleton and the
factorization of the strong product of
digraphs . . . . . . . . . . . . . . . . 16--29
Shyong Jian Shyu Visual cryptograms of random grids for
threshold access structures . . . . . . 30--49
Nicholas Faulkner and
Reem Yassawi A family of sand automata . . . . . . . 50--62
Péter Györgyi and
Tamás Kis Reductions between scheduling problems
with non-renewable resources and
knapsack problems . . . . . . . . . . . 63--76
Abraham P. Punnen and
Piyashat Sripratak and
Daniel Karapetyan Average value of solutions for the
bipartite boolean quadratic programs and
rounding algorithms . . . . . . . . . . 77--89
Jean-Marc Fédou and
Gabriele Fici Vertical representation of $ C^\infty
$-words . . . . . . . . . . . . . . . . 90--101
Adam Kasperski and
Pawe\l Zieli\'nski Combinatorial optimization problems with
uncertain costs and the OWA criterion 102--112
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Alexander Okhotin and
Kai Salomaa Descriptional complexity of unambiguous
input-driven pushdown automata . . . . . 1--11
Shiri Chechik and
David Peleg The fault-tolerant capacitated
$K$-center problem . . . . . . . . . . . 12--25
Ondrej Turek Abelian properties of Parry words . . . 26--38
Luisa Gargano and
Adele A. Rescigno Complexity of conflict-free colorings of
graphs . . . . . . . . . . . . . . . . . 39--49
Wenwen Zhang and
Jian-Liang Wu Some sufficient conditions for
$1$-planar graphs to be Class 1 . . . . 50--58
Julio Araujo and
Nathann Cohen and
Susanna F. de Rezende and
Frédéric Havet and
Phablo F. S. Moura On the proper orientation number of
bipartite graphs . . . . . . . . . . . . 59--75
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Anonymous Natural computing . . . . . . . . . . . 1
Turlough Neary Three small universal spiking neural P
systems . . . . . . . . . . . . . . . . 2--20
Ville Salo and
Ilkka Törmä Category theory of symbolic dynamics . . 21--45
Elena Popovici and
Ezra Winston A framework for co-optimization
algorithm performance and its
application to worst-case optimization 46--73
Bosheng Song and
Linqiang Pan Computational efficiency and
universality of timed P systems with
active membranes . . . . . . . . . . . . 74--86
Benjamin Doerr and
Carola Doerr and
Franziska Ebel From black-box complexity to designing
new genetic algorithms . . . . . . . . . 87--104
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Harumichi Nishimura and
Tomoyuki Yamakami Interactive proofs with quantum finite
automata . . . . . . . . . . . . . . . . 1--18
Ming-Xiao Tang and
Jia Lee and
Kenichi Morita General design of reversible sequential
machines based on reversible logic
elements . . . . . . . . . . . . . . . . 19--27
Joan Boyar and
Sushmita Gupta and
Kim S. Larsen Relative interval analysis of paging
algorithms on access graphs . . . . . . 28--48
Maxime Folschette and
Lo\"\ic Paulevé and
Katsumi Inoue and
Morgan Magnin and
Olivier Roux Identification of biological regulatory
networks from Process Hitting models . . 49--71
Laurent Bulteau and
Anna Paola Carrieri and
Riccardo Dondi Fixed-parameter algorithms for scaffold
filling . . . . . . . . . . . . . . . . 72--83
Fukuhito Ooshita and
Sébastien Tixeuil On the self-stabilization of mobile
oblivious robots in uniform rings . . . 84--96
Van Bang Le and
Sheng-Lung Peng Characterizing and recognizing probe
block graphs . . . . . . . . . . . . . . 97--102
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Walter O. Krawec $n$-Player impartial combinatorial games
with random players . . . . . . . . . . 1--12
Liron Levin and
Dariusz R. Kowalski and
Michael Segal Message and time efficient
multi-broadcast schemes . . . . . . . . 13--23
Prosenjit Bose and
Jean-Lou De Carufel and
Stephane Durocher Searching on a line: a complete
characterization of the optimal solution 24--42
Piotr Skowron and
Lan Yu and
Piotr Faliszewski and
Edith Elkind The complexity of fully proportional
representation for single-crossing
electorates . . . . . . . . . . . . . . 43--57
Yu Yu and
Xiangxue Li and
Jian Weng Pseudorandom generators from regular
one-way functions: New constructions
with improved parameters . . . . . . . . 58--69
Nhat X. Lam and
Tien Tran and
Min Kyung An and
Dung T. Huynh A note on the complexity of minimum
latency data aggregation scheduling with
uniform power in physical interference
model . . . . . . . . . . . . . . . . . 70--73
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Julien Baste and
Ignasi Sau The role of planarity in connectivity
problems parameterized by treewidth . . 1--14
Jia-Jie Liu and
Cindy Tzu-Hsin Wang and
Yue-Li Wang and
William Chung-Kung Yen The hub number of co-comparability
graphs . . . . . . . . . . . . . . . . . 15--21
Zhichao Geng and
Jinjiang Yuan Pareto optimization scheduling of family
jobs on a $p$-batch machine to minimize
makespan and maximum lateness . . . . . 22--29
Chung-Lun Li Improved algorithms for single-machine
common due window assignment and
scheduling with batch deliveries . . . . 30--39
Fidaa Abed and
Chien-Chung Huang Coordinating oligopolistic players in
unrelated machine scheduling . . . . . . 40--54
Zhongzhi Zhang and
Bin Wu Pfaffian orientations and perfect
matchings of scale-free networks . . . . 55--69
Antoine Genitrini and
Bernhard Gittenberger and
Veronika Kraus and
Cécile Mailler Associative and commutative tree
representations for Boolean functions 70--101
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Patrizio Angelini and
Giordano Da Lozzo and
Giuseppe Di Battista and
Fabrizio Frati and
Vincenzo Roselli The importance of being proper: (In
clustered-level planarity and $T$-level
planarity) . . . . . . . . . . . . . . . 1--9
Cheng-Nan Lai On the construction of all shortest
vertex-disjoint paths in Cayley graphs
of abelian groups . . . . . . . . . . . 10--20
Piotr Krysta and
Carmine Ventre Combinatorial auctions with verification
are tractable . . . . . . . . . . . . . 21--35
Christopher Auer and
Christian Bachmaier and
Franz J. Brandenburg and
Andreas Gleißner and
Kathrin Hanauer Upward planar graphs and their duals . . 36--49
Wojciech Rytter and
Arseny M. Shur Searching for Zimin patterns . . . . . . 50--57
Limin Wang and
Xiaoyan Zhang and
Zhao Zhang and
Hajo Broersma A PTAS for the minimum weight connected
vertex cover $ P_3 $ problem on unit
disk graphs . . . . . . . . . . . . . . 58--66
Christophe Crespelle and
Thi Ha Duong Phan and
The Hung Tran Termination of the iterated
strong-factor operator on multipartite
graphs . . . . . . . . . . . . . . . . . 67--77
Stephane Durocher and
Debajyoti Mondal and
Md. Saidur Rahman On graphs that are not PCGs . . . . . . 78--87
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Flavio D'Alessandro and
Benedetto Intrigila On the commutative equivalence of
bounded context-free and regular
languages: the semi-linear case . . . . 1--24
Zongyang Zhang and
Sherman S. M. Chow and
Zhenfu Cao Post-challenge leakage in public-key
encryption . . . . . . . . . . . . . . . 25--49
Lingfa Lu and
Liqi Zhang and
Long Wan Integrated production and delivery
scheduling on a serial batch machine to
minimize the makespan . . . . . . . . . 50--57
Jia Xu and
Zhaohui Liu Online scheduling with equal processing
times and machine eligibility
constraints . . . . . . . . . . . . . . 58--65
H. F. Ting and
Xiangzhong Xiang Online pricing for multi-type of items 66--82
Michaël Rao and
Michel Rigo and
Pavel Salimov Avoiding $2$-binomial squares and cubes 83--91
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Monika Henzinger and
Veronika Loitzenbauer Truthful unit-demand auctions with
budgets revisited . . . . . . . . . . . 1--15
Christopher M. Homan and
Sven Kosub Dichotomy results for fixed point
counting in boolean dynamical systems 16--25
B. S. Panda and
S. Paul and
D. Pradhan Hardness results, approximation and
exact algorithms for liar's domination
problem in graphs . . . . . . . . . . . 26--42
Davide Bil\`o and
Luciano Gual\`a and
Stefano Leucci and
Guido Proietti The max-distance network creation game
on general host graphs . . . . . . . . . 43--53
Marziyeh Boroujeni and
Abdolali Basiri and
Sajjad Rahmany and
Annick Valibouze $ F_4 $-invariant algorithm for
computing SAGBI--Gröbner bases . . . . . 54--62
Yunlong Liu and
Jianxin Wang and
Jie You and
Jianer Chen and
Yixin Cao Edge deletion problems: Branching
facilitated by modular decomposition . . 63--70
Krishnendu Chatterjee and
Manas Joglekar and
Nisarg Shah Average case analysis of the classical
algorithm for Markov decision processes
with Büchi objectives . . . . . . . . . . 71--89
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Pavithra Prabhakar and
Vladimeros Vladimerou and
Mahesh Viswanathan and
Geir Dullerud A decidable class of planar linear
hybrid systems . . . . . . . . . . . . . 1--17
Zoltán Ésik and
Panos Rondogiannis A fixed point theorem for non-monotonic
functions . . . . . . . . . . . . . . . 18--38
Eleftherios Matsikoudis and
Edward A. Lee The fixed-point theory of strictly
causal functions . . . . . . . . . . . . 39--77
Wenfeng Zhang and
Xiaoquan Xu $ s_2 $-Quasicontinuous posets . . . . . 78--85
Marc Bezem and
Thierry Coquand A Kripke model for simplicial sets . . . 86--91
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Sudebkumar Prasant Pal and
Kunihiko Sadakane Guest Editors' foreword . . . . . . . . 1--2
Satoshi Fujita Optimal serial broadcast of successive
chunks . . . . . . . . . . . . . . . . . 3--9
Tong-Wook Shinn and
Tadao Takaoka Variations on the bottleneck paths
problem . . . . . . . . . . . . . . . . 10--16
Subir Kumar Ghosh and
Bodhayan Roy Some results on point visibility graphs 17--32
Alka Bhushan and
G. Sajith I/O efficient algorithms for the minimum
cut problem on unweighted undirected
graphs . . . . . . . . . . . . . . . . . 33--41
Selim Akl and
Robert Benkoczi and
Daya Ram Gaur and
Hossam Hassanein and
Shahadat Hossain and
Mark Thom On a class of covering problems with
variable capacities in wireless networks 42--55
N. S. Narayanaswamy and
G. Ramakrishna On minimum average stretch spanning
trees in polygonal $2$-trees . . . . . . 56--70
Patrizio Angelini and
Giordano Da Lozzo and
Daniel Neuwirth Advancements on SEFE and Partitioned
Book Embedding problems . . . . . . . . 71--89
Da-Jung Cho and
Yo-Sub Han and
Hwee Kim Alignment with non-overlapping
inversions and translocations on two
strings . . . . . . . . . . . . . . . . 90--101
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
K. Subramani and
James Worthington Feasibility checking in Horn constraint
systems through a reduction based
approach . . . . . . . . . . . . . . . . 1--17
Nikolaos Fountoulakis and
Tobias Friedrich and
Danny Hermelin On the average-case complexity of
parameterized clique . . . . . . . . . . 18--29
Eddie Cheng and
Robert Connolly and
Christoper Melekian Matching preclusion and conditional
matching preclusion problems for the
folded Petersen cube . . . . . . . . . . 30--44
Farn Wang and
Sven Schewe and
Jung-Hsuan Wu Complexity of node coverage games . . . 45--60
Naonori Kakimura and
Ken-ichi Kawarabayashi Fixed-parameter tractability for subset
feedback set problems with parity
constraints . . . . . . . . . . . . . . 61--76
Sam Buss Quasipolynomial size proofs of the
propositional pigeonhole principle . . . 77--84
Pavel Klavík and
Jan Kratochvíl and
Yota Otachi and
Toshiki Saitoh Extending partial representations of
subclasses of chordal graphs . . . . . . 85--101
Michael R. Fellows and
Uéverton dos Santos Souza and
Fábio Protti and
Maise Dantas da Silva Tractability and hardness of
flood-filling games on trees . . . . . . 102--116
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Andrei Popescu and
Grigore Rosu Term-generic logic . . . . . . . . . . . 1--24
Mikolás Janota and
Joao Marques-Silva Expansion-based QBF solving versus
$Q$-resolution . . . . . . . . . . . . . 25--42
Michele Sevegnani and
Muffy Calder Bigraphs with sharing . . . . . . . . . 43--73
Mila Dalla Preda and
Roberto Giacobazzi and
Saumya Debray Unveiling metamorphism by abstract
interpretation of code properties . . . 74--97
Manfred Schmidt-Schauß and
David Sabel and
Joachim Niehren and
Jan Schwinghammer Observational program calculi and the
correctness of translations . . . . . . 98--124
Qin Li and
Zhe Dang Sampling automata and programs . . . . . 125--140
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Stavros Konstantinidis Implementation and Application of
Automata (CIAA 2013) . . . . . . . . . . 1
Eric Balkanski and
F. Blanchet-Sadri and
Matthew Kilgore and
B. J. Wyatt On the state complexity of partial word
DFAs . . . . . . . . . . . . . . . . . . 2--12
Mathieu Caralp and
Pierre-Alain Reynier and
Jean-Marc Talbot Trimming visibly pushdown automata . . . 13--29
Tomohiro I. and
Takaaki Nishimoto and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda Compressed automata for dictionary
matching . . . . . . . . . . . . . . . . 30--41
Jozef Jirásek and
Galina Jirásková On the boundary of regular languages . . 42--57
Martin Kutrib and
Andreas Malcher and
Carlo Mereghetti and
Beatrice Palano and
Matthias Wendlandt Deterministic input-driven queue
automata: Finite turns, decidability,
and closure properties . . . . . . . . . 58--71
Andreas Maletti Hyper-optimization for deterministic
tree automata . . . . . . . . . . . . . 72--87
Friedrich Otto and
Frantisek Mráz Lambda-confluence for context rewriting
systems . . . . . . . . . . . . . . . . 88--99
Denis Debarbieux and
Olivier Gauwin and
Joachim Niehren and
Tom Sebastian and
Mohamed Zergaoui Early nested word automata for XPath
query answering on XML streams . . . . . 100--125
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
M. P. Dobson and
E. Hinrichsen and
V. Leoni Generalized limited packings of some
graphs with a limited number of $ P_4
$-partners . . . . . . . . . . . . . . . 1--8
Taylor T. Johnson and
Sayan Mitra Safe and stabilizing distributed
multi-path cellular flows . . . . . . . 9--32
Michael Dekhtyar and
Alexander Dikovsky and
Boris Karlov Categorial dependency grammars . . . . . 33--63
Stefan Dobrev and
Stephane Durocher and
Mohsen Eftekhari and
Konstantinos Georgiou and
Evangelos Kranakis and
Danny Krizanc and
Lata Narayanan and
Jaroslav Opatrny and
Sunil Shende and
Jorge Urrutia Complexity of barrier coverage with
relocatable sensors in the plane . . . . 64--73
Jean-Claude Bermond and
David Coudert and
Gianlorenzo D'Angelo and
Fatima Zahra Moataz Finding disjoint paths in networks with
star shared risk link groups . . . . . . 74--87
Ashwin Guha and
Ambedkar Dukkipati A faster algorithm for testing
polynomial representability of functions
over finite integer rings . . . . . . . 88--99
Kwangsu Lee and
Dong Hoon Lee and
Moti Yung Sequential aggregate signatures with
short public keys without random oracles 100--125
Evripidis Bampis and
Dimitrios Letsios and
Giorgio Lucarelli Green scheduling, flows and matchings 126--136
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Clémentine Gritti and
Willy Susilo and
Thomas Plantard and
Khin Than Win Privacy-preserving encryption scheme
using DNA parentage test . . . . . . . . 1--13
Johannes Müller and
Hengrui Jiang Graphical limit sets for general
cellular automata . . . . . . . . . . . 14--27
Fang Xie and
Zhe Xu and
Yuzhong Zhang and
Qingguo Bai Scheduling games on uniform machines
with activation cost . . . . . . . . . . 28--35
Min Ji and
Qinyun Yang and
Danli Yao and
T. C. E. Cheng Single-machine batch scheduling of
linear deteriorating jobs . . . . . . . 36--49
Yuehua Bu and
Xudong Bao Backbone coloring of planar graphs for $
C_8 $-free or $ C_9 $-free . . . . . . . 50--58
Yu Yang and
Hongbo Liu and
Hua Wang and
Scott Makeig Enumeration of BC-subtrees of trees . . 59--74
Peter Damaschke Finding and enumerating large
intersections . . . . . . . . . . . . . 75--82
Gabriel Istrate Reachability and recurrence in a modular
generalization of annihilating random
walks (and lights-out games) to
hypergraphs . . . . . . . . . . . . . . 83--93
Gilad Braunschvig and
Shiri Chechik and
David Peleg and
Adam Sealfon Fault tolerant additive and $ (\mu,
\alpha)$-spanners . . . . . . . . . . . 94--100
Omid Amini and
David Coudert and
Nicolas Nisse Non-deterministic graph searching in
trees . . . . . . . . . . . . . . . . . 101--121
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Teturo Kamae and
Dong Han Kim A characterization of eventual
periodicity . . . . . . . . . . . . . . 1--8
Paolo D'Arco and
Alfredo De Santis Anonymous protocols: Notions and
equivalence . . . . . . . . . . . . . . 9--25
Aldo de Luca and
Alessandro De Luca Sturmian words and the Stern sequence 26--44
Atish Das Sarma and
Anisur Rahaman Molla and
Gopal Pandurangan Distributed computation in dynamic
networks via random walks . . . . . . . 45--66
Peter Jonsson and
Victor Lagerkvist and
Gustav Nordh Constructing NP-intermediate problems by
blowing holes with parameters of various
properties . . . . . . . . . . . . . . . 67--82
Yiannis Giannakopoulos Bounding the optimal revenue of selling
multiple goods . . . . . . . . . . . . . 83--96
Stephane Durocher and
Hicham El-Zein and
J. Ian Munro and
Sharma V. Thankachan Low space data structures for geometric
range mode query . . . . . . . . . . . . 97--101
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Carl Barton and
Tomás Flouri and
Costas S. Iliopoulos and
Solon P. Pissis Global and local sequence alignment with
a bounded number of gaps . . . . . . . . 1--16
Ararat Harutyunyan and
Sylvain Legay Linear time algorithms for weighted
offensive and powerful alliances in
trees . . . . . . . . . . . . . . . . . 17--26
Dariusz Dereniowski and
Adrian Kosowski and
Dominik Pajak Distinguishing views in symmetric
networks: a tight lower bound . . . . . 27--34
Nhan Bao Ho On the expansion of three-element
subtraction sets . . . . . . . . . . . . 35--47
Sulin Song and
Xiaoyan Li and
Shuming Zhou and
Mi Chen Fault tolerance and diagnosability of
burnt pancake networks under the
comparison model . . . . . . . . . . . . 48--59
Wen Chean Teh and
Kiam Heong Kwa Core words and Parikh matrices . . . . . 60--69
Aleksandar Ili\'c On the variable common due date, minimal
tardy jobs bicriteria two-machine flow
shop problem with ordered machines . . . 70--73
Kasper Green Larsen and
J. Ian Munro and
Jesper Sindahl Nielsen and
Sharma V. Thankachan On hardness of several string indexing
problems . . . . . . . . . . . . . . . . 74--82
Jaroslaw Grytczuk and
Karol Kosi\'nski and
Michal Zmarz How to play Thue games . . . . . . . . . 83--88
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Adrien Richard Fixed point theorems for Boolean
networks expressed in terms of forbidden
subnetworks . . . . . . . . . . . . . . 1--26
Shu-Ming Sun and
Ning Zhong Computability aspects for 1st-order
partial differential equations via
characteristics . . . . . . . . . . . . 27--39
Changwook Kim and
Mahiro Ando Node replacement graph grammars with
dynamic node relabeling . . . . . . . . 40--50
Timothy M. Chan and
J. Ian Munro and
Venkatesh Raman Finding median in read-only memory on
integer input . . . . . . . . . . . . . 51--56
Shisheng Li and
T. C. E. Cheng and
C. T. Ng and
Jinjiang Yuan Single-machine batch scheduling with job
processing time compatibility . . . . . 57--66
Youjun Chen and
Lingfa Lu and
Jinjiang Yuan Preemptive scheduling on identical
machines with delivery coordination to
minimize the maximum delivery completion
time . . . . . . . . . . . . . . . . . . 67--77
Pedro García and
Damián López and
Manuel Vázquez de Parga DFA minimization: Double reversal versus
split minimization algorithms . . . . . 78--85
Lorenzo De Stefani and
Francesco Silvestri Exploiting non-constant safe memory in
resilient algorithms and data structures 86--97
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Thomas Moscibroda and
Adele A. Rescigno Guest Editorial: Special issue on
Structural Information and Communication
Complexity . . . . . . . . . . . . . . . 1--2
Nidhi Hegde and
Laurent Massoulié and
Laurent Viennot Self-organizing flows in social networks 3--18
Andrea Clementi and
Miriam Di Ianni and
Giorgio Gambosi and
Emanuele Natale and
Riccardo Silvestri Distributed community detection in
dynamic graphs . . . . . . . . . . . . . 19--41
Amir Levi and
Boaz Patt-Shamir Non-additive two-option ski rental . . . 42--52
Luisa Gargano and
Pavol Hell and
Joseph G. Peters and
Ugo Vaccaro Influence diffusion in social networks
under time window constraints . . . . . 53--66
Sebastian Kniesburges and
Andreas Koutsopoulos and
Christian Scheideler A deterministic worst-case message
complexity optimal solution for resource
discovery . . . . . . . . . . . . . . . 67--79
Étienne Coulouma and
Emmanuel Godard and
Joseph Peters A characterization of oblivious message
adversaries for which consensus is
solvable . . . . . . . . . . . . . . . . 80--90
Chen Avin and
Michael Borokhovich and
Bernhard Haeupler and
Zvi Lotker Self-adjusting grid networks to minimize
expected path length . . . . . . . . . . 91--102
Hadassa Daltrophe and
Shlomi Dolev and
Zvi Lotker Probabilistic connectivity threshold for
directional antenna widths . . . . . . . 103--114
Y. Métivier and
J. M. Robson and
A. Zemmari Analysis of fully distributed splitting
and naming probabilistic procedures and
applications . . . . . . . . . . . . . . 115--130
F. Giroire and
I. Lamprou and
D. Mazauric and
N. Nisse and
S. Pérennes and
R. Soares Connected surveillance game . . . . . . 131--143
Guy Even and
Moti Medina A nonmonotone analysis with the
primal-dual approach: Online routing of
virtual circuits with unknown durations 144--154
Lakshmi Anantharamu and
Bogdan S. Chlebus Broadcasting in ad hoc multiple access
channels . . . . . . . . . . . . . . . . 155--176
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Ugo Dal Lago and
Guillaume Bonfante Developments in Implicit Complexity
(DICE 2012) . . . . . . . . . . . . . . 1--2
Martin Avanzini and
Naohi Eguchi and
Georg Moser A new order-theoretic characterisation
of the polytime computable functions . . 3--24
Guillaume Bonfante and
Florian Deloup and
Antoine Henrot Real or natural number interpretation
and their effect on complexity . . . . . 25--40
Hugo Férée and
Emmanuel Hainry and
Mathieu Hoyrup and
Romain Péchoux Characterizing polynomial time
complexity of stream programs using
interpretations . . . . . . . . . . . . 41--54
Alo\"\is Brunel and
Marco Gaboardi Realizability models for a linear
dependent PCF . . . . . . . . . . . . . 55--70
Yuxin Deng and
Yu Zhang Program equivalence in linear contexts 71--90
Elvira Albert and
Jesús Correas and
Germán Puebla and
Guillermo Román-Díez A multi-domain incremental analysis
engine and its application to
incremental resource analysis . . . . . 91--114
Sebastian Eberhard Applicative theories for logarithmic
complexity classes . . . . . . . . . . . 115--135
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Peter Widmayer FUN with algorithms . . . . . . . . . . 1
Michael Brand No easy puzzles: Hardness results for
jigsaw puzzles . . . . . . . . . . . . . 2--11
Ke Chen and
Adrian Dumitrescu Nonconvex cases for carpenter's rulers 12--25
Guillaume Fertin and
Shahrad Jamshidi and
Christian Komusiewicz Towards an algorithmic guide to Spiral
Galaxies . . . . . . . . . . . . . . . . 26--39
Ferdinando Cicalese and
Gennaro Cordasco and
Luisa Gargano and
Martin Milanic and
Joseph Peters and
Ugo Vaccaro Spread of influence in weighted networks
under time and budget constraints . . . 40--58
Michele Borassi and
Pierluigi Crescenzi and
Michel Habib and
Walter A. Kosters and
Andrea Marino and
Frank W. Takes Fast diameter and radius BFS-based
computation in (weakly connected)
real-world graphs: With an application
to the six degrees of separation games 59--80
Katsuhisa Yamanaka and
Erik D. Demaine and
Takehiro Ito and
Jun Kawahara and
Masashi Kiyomi and
Yoshio Okamoto and
Toshiki Saitoh and
Akira Suzuki and
Kei Uchizawa and
Takeaki Uno Swapping labeled tokens on graphs . . . 81--94
Konstantinos Georgiou and
Evangelos Kranakis and
Danny Krizanc Excuse me! or the courteous
theatregoers' problem . . . . . . . . . 95--110
Erik D. Demaine and
Martin L. Demaine Fun with fonts: Algorithmic typography 111--119
Giovanni Viglietta Lemmings is PSPACE-complete . . . . . . 120--134
Greg Aloupis and
Erik D. Demaine and
Alan Guo and
Giovanni Viglietta Classic Nintendo games are
(computationally) hard . . . . . . . . . 135--160
Irina Kostitsyna and
Maarten Löffler and
Valentin Polishchuk Optimizing airspace closure with respect
to politicians' egos . . . . . . . . . . 161--175
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Paola Giannini and
Emanuela Merelli and
Angelo Troina Interactions between Computer Science
and Biology . . . . . . . . . . . . . . 1--2
Ezio Bartocci and
Luca Bortolussi and
Laura Nenzi and
Guido Sanguinetti System design of stochastic models using
robustness of temporal properties . . . 3--25
Alberto Casagrande and
Carla Piazza Unwinding biological systems . . . . . . 26--48
Alessio Angius and
Gianfranco Balbo and
Marco Beccuti and
Enrico Bibbona and
Andras Horvath and
Roberta Sirovich Approximate analysis of biological
systems by hybrid switching jump
diffusion . . . . . . . . . . . . . . . 49--72
Chiara Bodei and
Roberta Gori and
Francesca Levi Causal static analysis for Brane Calculi 73--103
Giovanni Pardini and
Paolo Milazzo and
Andrea Maggiolo-Schettini Component identification in biochemical
pathways . . . . . . . . . . . . . . . . 104--124
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Anonymous Preface for the special issue on Theory
and Applications of Models of
Computation . . . . . . . . . . . . . . 1
Tor Lattimore and
Marcus Hutter On Martin--Löf (non-)convergence of
Solomonoff's universal mixture . . . . . 2--15
Raghav Kulkarni and
Youming Qiao and
Xiaoming Sun Any monotone property of $3$-uniform
hypergraphs is weakly evasive . . . . . 16--23
Yuya Higashikawa and
John Augustine and
Siu-Wing Cheng and
Mordecai J. Golin and
Naoki Katoh and
Guanqun Ni and
Bing Su and
Yinfeng Xu Minimax regret $1$-sink location problem
in dynamic path networks . . . . . . . . 24--36
Manu Agarwal and
Ragesh Jaiswal and
Arindam Pal $k$-Means++ under approximation
stability . . . . . . . . . . . . . . . 37--51
Alexander Okhotin Improved normal form for grammars with
one-sided contexts . . . . . . . . . . . 52--72
Golnaz Badkobeh and
Pascal Ochem Characterization of some binary words
with few squares . . . . . . . . . . . . 73--80
Wing-Kai Hon and
Ton Kloks and
Ching-Hao Liu and
Hsiang-Hsuan Liu and
Sheung-Hung Poon and
Yue-Li Wang On maximum independent set of
categorical product and ultimate
categorical ratios of graphs . . . . . . 81--95
Boting Yang and
William Hamilton The optimal capture time of the
one-cop-moves game . . . . . . . . . . . 96--113
J. Bastos and
A. Messaoudi and
T. Rodrigues and
D. Smania A class of cubic Rauzy fractals . . . . 114--130
Márcio A. Duarte and
Felix Joos and
Lucia D. Penso and
Dieter Rautenbach and
Uéverton S. Souza Maximum induced matchings close to
maximum matchings . . . . . . . . . . . 131--137
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Claude Sureson Random reals as measures of natural open
sets . . . . . . . . . . . . . . . . . . 1--23
Toshiya Itoh and
Seiji Yoshimoto Buffer management of multi-queue QoS
switches with class segregation . . . . 24--33
Amihood Amir and
Avivit Levy and
Ely Porat and
B. Riva Shalom Dictionary matching with a few gaps . . 34--46
Che-Nan Kuo Every edge lies on cycles embedding in
folded hypercubes with
vertex-fault-tolerant . . . . . . . . . 47--52
Ioannis Caragiannis and
Aris Filos-Ratsikas and
Ariel D. Procaccia An improved $2$-agent kidney exchange
mechanism . . . . . . . . . . . . . . . 53--60
Martin Anthony and
Joel Ratsaby A probabilistic approach to case-based
inference . . . . . . . . . . . . . . . 61--75
Carla Binucci and
Emilio Di Giacomo and
Walter Didimo and
Fabrizio Montecchiani and
Maurizio Patrignani and
Antonios Symvonis and
Ioannis G. Tollis Fan-planarity: Properties and complexity 76--86
Isolde Adler and
Mamadou Moustapha Kanté Linear rank-width and linear
clique-width of trees . . . . . . . . . 87--98
Laurent Bulteau and
Jiehua Chen and
Piotr Faliszewski and
Rolf Niedermeier and
Nimrod Talmon Combinatorial voter control in elections 99--120
Laurent Gourv\`es and
Jérôme Monnot and
Lydia Tlilane Worst case compromises in matroids with
applications to the allocation of
indivisible goods . . . . . . . . . . . 121--140
Colm Ó Dúnlaing An almost-confluent congruential
language which is not Church--Rosser
congruential . . . . . . . . . . . . . . 141--146
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Leszek Gasieniec and
Russell Martin and
Frank Wolter and
Prudence W. H. Wong Fundamentals of Computation Theory . . . 1
Tatsuya Akutsu and
Takeyuki Tamura and
Avraham A. Melkman and
Atsuhiro Takasu On the complexity of finding a largest
common subtree of bounded degree . . . . 2--16
Joan Boyar and
Magnus Gausdal Find Cancellation-free circuits in unbounded
and bounded depth . . . . . . . . . . . 17--26
Arnaud Casteigts and
Paola Flocchini and
Emmanuel Godard and
Nicola Santoro and
Masafumi Yamashita On the expressivity of time-varying
graphs . . . . . . . . . . . . . . . . . 27--37
V. Arvind and
Johannes Köbler and
Sebastian Kuhnert and
Gaurav Rattan and
Yadu Vasudev On the isomorphism problem for decision
trees and decision lists . . . . . . . . 38--54
Evangelos Kranakis and
Fraser MacQuarrie and
Oscar Morales Ponce Connectivity and stretch factor
trade-offs in wireless sensor networks
with directional antennae . . . . . . . 55--72
Miros\law Kowaluk and
Gabriela Majewska New sequential and parallel algorithms
for computing the $ \beta $-spectrum . . 73--85
Steven Chaplick and
Jirí Fiala and
Pim van 't Hof and
Daniël Paulusma and
Marek Tesar Locally constrained homomorphisms on
graphs of bounded treewidth and bounded
degree . . . . . . . . . . . . . . . . . 86--95
S. Nikoletseas and
P. Panagopoulou and
C. Raptopoulos and
P. G. Spirakis On the structure of equilibria in basic
network formation . . . . . . . . . . . 96--105
Neta Barkay and
Ely Porat and
Bar Shalem Efficient sampling of non-strict
turnstile data streams . . . . . . . . . 106--117
Kewen Liao and
Hong Shen and
Longkun Guo Improved approximation algorithms for
constrained fault-tolerant resource
allocation . . . . . . . . . . . . . . . 118--128
Antonio Fernández Anta and
Chryssis Georgiou and
Dariusz R. Kowalski and
Elli Zavou Online parallel scheduling of
non-uniform tasks: Trading failures for
energy . . . . . . . . . . . . . . . . . 129--146
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Maurice Nivat The true story of TCS . . . . . . . . . 1--2
Giorgio Ausiello and
Lila Kari and
Grzegorz Rozenberg and
Donald Sannella TCS in the 21st century . . . . . . . . 3--4
Taisuke Izumi and
Tomoko Izumi and
Hirotaka Ono and
Koichi Wada Approximability of minimum certificate
dispersal with tree structures . . . . . 5--14
S. Köhler and
V. Turau Self-stabilizing local $k$-placement of
replicas with local minimum variance . . 15--27
Dariusz Dereniowski and
Hirotaka Ono and
Ichiro Suzuki and
\Lukasz Wrona and
Masafumi Yamashita and
Pawe\l Zyli\'nski The searchlight problem for road
networks . . . . . . . . . . . . . . . . 28--59
Ferdinando Cicalese and
Martin Milanic and
Romeo Rizzi On the complexity of the vector
connectivity problem . . . . . . . . . . 60--71
Petr A. Golovach Editing to a Graph of Given Degrees . . 72--84
Klaus Meer and
Ameen Naif Generalized finite automata over real
and complex numbers . . . . . . . . . . 85--98
Ching-Chi Lin and
Hai-Lun Tu A linear-time algorithm for
paired-domination on circular-arc graphs 99--105
Christophe Reutenauer Studies on finite Sturmian words . . . . 106--133
Mikhail Barash and
Alexander Okhotin Two-sided context specifications in
formal grammars . . . . . . . . . . . . 134--153
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Jacob Chodoriwsky and
Lucia Moura An adaptive algorithm for group testing
for complexes . . . . . . . . . . . . . 1--8
Hwee Kim and
Yo-Sub Han Non-overlapping inversion on strings and
languages . . . . . . . . . . . . . . . 9--22
Yuichi Kamiya and
Tatsuya Okada and
Takeshi Sekiguchi and
Yasunobu Shiota Power and exponential sums for
generalized coding systems by a measure
theoretic approach . . . . . . . . . . . 23--38
Wanbin Son and
Sang Won Bae and
Hee-Kap Ahn Group nearest-neighbor queries in the $
L_1 $ plane . . . . . . . . . . . . . . 39--48
Serge Gaspers and
Mikko Koivisto and
Mathieu Liedloff and
Sebastian Ordyniak and
Stefan Szeider On finding optimal polytrees . . . . . . 49--58
Richard Beal and
Donald Adjeroh Efficient pattern matching for RNA
secondary structures . . . . . . . . . . 59--71
Jos W. H. M. Uiterwijk and
Michael Barton New results for Domineering from
combinatorial game theory endgame
databases . . . . . . . . . . . . . . . 72--86
Alessandro Conflitti and
Ricardo Mamede Gray codes and lexicographical
combinatorial generation for nonnesting
and sparse nonnesting set partitions . . 87--96
Rishiraj Bhattacharyya and
Pratyay Mukherjee Non-adaptive programmability of random
oracle . . . . . . . . . . . . . . . . . 97--114
Artur Jez Approximation of grammar-based
compression via recompression . . . . . 115--134
Danny Z. Chen and
Jian Li and
Haitao Wang Efficient algorithms for the
one-dimensional $k$-center problem . . . 135--142
Dario Catalano and
Dario Fiore and
Rosario Gennaro and
Konstantinos Vamvourellis Algebraic (trapdoor) one-way functions:
Constructions and applications . . . . . 143--165
Erfang Shan and
Liying Kang Coloring clique-hypergraphs of graphs
with no subdivision of $ K5 $ . . . . . 166--175
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Bruce Kapron and
Lior Malka and
Venkatesh Srinivasan A framework for non-interactive
instance-dependent commitment schemes
(NIC) . . . . . . . . . . . . . . . . . 1--15
David J. Rosenbaum and
Fabian Wagner Beating the generator-enumeration bound
for $p$-group isomorphism . . . . . . . 16--25
Carla Negri Lintzmayer and
Guillaume Fertin and
Zanoni Dias Approximation algorithms for sorting by
length-weighted prefix and suffix
operations . . . . . . . . . . . . . . . 26--41
Jaroslaw Byrka and
Andreas Karrenbauer and
Laura Sanit\`a The interval constrained $3$-coloring
problem . . . . . . . . . . . . . . . . 42--50
Sandy Heydrich and
Rob van Stee Dividing connected chores fairly . . . . 51--61
Ching-Lueh Chang and
Yuh-Dauh Lyuu Triggering cascades on strongly
connected directed graphs . . . . . . . 62--69
Minghui Jiang and
Pedro J. Tejada and
Haitao Wang Quell . . . . . . . . . . . . . . . . . 70--78
Gunjan Kumar and
Saswata Shannigrahi New online algorithm for dynamic speed
scaling with sleep state . . . . . . . . 79--87
Florian Greinecker On the $2$-abelian complexity of the
Thue--Morse word . . . . . . . . . . . . 88--105
Yuke Huang and
Zhiying Wen The sequence of return words of the
Fibonacci sequence . . . . . . . . . . . 106--116
Peng Zhang and
Angsheng Li Algorithmic aspects of homophyly of
networks . . . . . . . . . . . . . . . . 117--131
Stephen T. Hedetniemi and
David P. Jacobs and
K. E. Kennedy A theorem of Ore and self-stabilizing
algorithms for disjoint minimal
dominating sets . . . . . . . . . . . . 132--138
Wenming Zhang and
E. Zhang and
Feifeng Zheng Online $ (J, K) $-search problem and its
competitive analysis . . . . . . . . . . 139--145
Mi-Mi Zhang and
Jin-Xin Zhou On $g$-extra connectivity of folded
hypercubes . . . . . . . . . . . . . . . 146--153
Chen Yuan and
Haibin Kan Revisiting a randomized algorithm for
the minimum rainbow subgraph problem . . 154--159
Przemys\law Gordinowicz Planar graph is on fire . . . . . . . . 160--164
Sudip Biswas and
Manish Patil and
Rahul Shah and
Sharma V. Thankachan Succinct indexes for reporting
discriminating and generic words . . . . 165--173
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Rodrigo Machado and
Leila Ribeiro and
Reiko Heckel Rule-based transformation of graph
rewriting rules: Towards higher-order
graph grammars . . . . . . . . . . . . . 1--23
S. Akshay and
Paul Gastin and
Madhavan Mukund and
K. Narayan Kumar Checking conformance for
time-constrained scenario-based
specifications . . . . . . . . . . . . . 24--43
A. R. Shir Ali Nasab and
S. N. Hosseini Partial pullback complement rewriting 44--64
Armando B. Matos The efficiency of primitive recursive
functions: a programmer's view . . . . . 65--81
Zoltán Fülöp and
Heiko Vogler Characterizing weighted MSO for trees by
branching transitive closure logics . . 82--105
Markus Teichmann and
Johannes Osterholzer A link between multioperator and tree
valuation automata and logics . . . . . 106--119
Nisansala Yatapanage and
Kirsten Winter Next-preserving branching bisimulation 120--142
Xiaodong Jia and
Achim Jung and
Hui Kou and
Qingguo Li and
Haoran Zhao All cartesian closed categories of
quasicontinuous domains consist of
domains . . . . . . . . . . . . . . . . 143--150
Sohei Ito and
Takuma Ichinose and
Masaya Shimakawa and
Naoko Izumi and
Shigeki Hagihara and
Naoki Yonezaki Qualitative analysis of gene regulatory
networks by temporal logic . . . . . . . 151--179
Rachid Rebiha and
Arnaldo V. Moura and
Nadir Matringe Generating invariants for non-linear
hybrid systems . . . . . . . . . . . . . 180--200
Tim French and
John McCabe-Dansted and
Mark Reynolds Synthesis for continuous time . . . . . 201--222
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Tim Smith On infinite words determined by $L$
systems . . . . . . . . . . . . . . . . 1--10
Anna Bernasconi and
Valentina Ciriani and
Lorenzo Lago On the error resilience of ordered
binary decision diagrams . . . . . . . . 11--33
Luciana Vitale and
Álvaro Martín and
Gadiel Seroussi Space-efficient representation of
truncated suffix trees, with
applications to Markov order estimation 34--45
Jian-Jia Chen and
Mong-Jen Kao and
D. T. Lee and
Ignaz Rutter and
Dorothea Wagner Online dynamic power management with
hard real-time guarantees . . . . . . . 46--64
Wenyu Hu and
Xingjun Luo and
Zhongxuan Luo A unified approach to computing the
nearest complex polynomial with a given
zero . . . . . . . . . . . . . . . . . . 65--81
Jianxin Wang and
Weimin Su and
Min Yang and
Jiong Guo and
Qilong Feng and
Feng Shi and
Jianer Chen Parameterized complexity of control and
bribery for $d$-approval elections . . . 82--91
A. Chateau and
R. Giroudeau A complexity and approximation framework
for the maximization scaffolding problem 92--106
J. Bang-Jensen and
A. Yeo Balanced branchings in digraphs . . . . 107--119
Xian Qiu and
Walter Kern Improved approximation algorithms for a
bilevel knapsack problem . . . . . . . . 120--129
Farnoosh Khodakarami and
Farzad Didehvar and
Ali Mohades A fixed-parameter algorithm for guarding
$ 1.5 $D terrains . . . . . . . . . . . 130--142
Yujue Wang and
Duncan S. Wong and
Qianhong Wu and
Sherman S. M. Chow and
Bo Qin and
Jianwei Liu and
Yong Ding Practical (fully) distributed signatures
provably secure in the standard model 143--158
Gabriel Renault and
Simon Schmidt On the complexity of the Mis\`ere
version of three games played on graphs 159--167
Micheal Arockiaraj and
Arul Jeya Shalini Conjectures on wirelength of hypercube
into cylinder and torus . . . . . . . . 168--171
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
S. Brunetti and
E. Lodi and
W. Quattrociocchi An inclusion hierarchy of irreversible
dynamos . . . . . . . . . . . . . . . . 1--11
Andrew Twigg and
Eduardo C. Xavier Locality-preserving allocations problems
and coloured bin packing . . . . . . . . 12--22
Widmer Bland and
W. F. Smyth Three overlapping squares: the general
case characterized & applications . . . . 23--40
F. Blanchet-Sadri and
Andrew Lohr Computing minimum length representations
of sets of words of uniform length . . . 41--54
Gerold Jäger and
Marcin Peczarski Bounding memory for Mastermind might not
make it harder . . . . . . . . . . . . . 55--66
Ahmad Biniaz and
Anil Maheshwari and
Michiel Smid Matchings in higher-order Gabriel graphs 67--78
Marie G. Christ and
Lene M. Favrholdt and
Kim S. Larsen Online multi-coloring with advice . . . 79--91
János Balogh and
József Békési and
György Dósa and
Leah Epstein and
Hans Kellerer and
Asaf Levin and
Zsolt Tuza Offline black and white bin packing . . 92--101
Gianlorenzo D'Angelo and
Daniele Diodati and
Alfredo Navarra and
Cristina M. Pinotti The minimum $k$-storage problem on
directed graphs . . . . . . . . . . . . 102--108
Gaia Nicosia and
Andrea Pacifici and
Ulrich Pferschy Two agent scheduling with a central
selection mechanism . . . . . . . . . . 109--123
Julien David and
Lo\"\ick Lhote and
Arnaud Mary and
François Rioult An average study of hypergraphs and
their minimal transversals . . . . . . . 124--141
Guillaume Guégan and
Pascal Ochem Complexity dichotomy for oriented
homomorphism of planar graphs with large
girth . . . . . . . . . . . . . . . . . 142--148
Gyorgy Dosa The tight absolute bound of First Fit in
the parameterized case . . . . . . . . . 149--154
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Katalin Bimbó The decidability of the intensional
fragment of classical linear logic . . . 1--17
Ferenc Bujtor and
Walter Vogler Error-pruning in interface automata . . 18--39
Michele Boreale and
Michela Paolini Worst- and average-case privacy breaches
in randomization mechanisms . . . . . . 40--61
Fabrizio Biondi and
Axel Legay and
Pasquale Malacaria and
Andrzej Wasowski Quantifying information leakage of
randomized protocols . . . . . . . . . . 62--87
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Lila Kari Editorial . . . . . . . . . . . . . . . 1
Yun Shang and
Xian Lu and
Ruqian Lu Computing power of Turing machines in
the framework of unsharp quantum logic 2--14
Arto Salomaa Applications of the Chinese remainder
theorem to reaction systems with
duration . . . . . . . . . . . . . . . . 15--22
Sepinoud Azimi and
Cristian Gratie and
Sergiu Ivanov and
Ion Petre Dependency graphs and mass conservation
in reaction systems . . . . . . . . . . 23--39
M. Hutchinson and
M. Widom Enumeration of octagonal tilings . . . . 40--50
Yaoyun Shi and
Xiaodi Wu Epsilon-net method for optimizations
over separable states . . . . . . . . . 51--63
Carlos Echegoyen and
Roberto Santana and
Alexander Mendiburu and
Jose A. Lozano Comprehensive characterization of the
behaviors of estimation of distribution
algorithms . . . . . . . . . . . . . . . 64--86
Bogdan Aman and
Gabriel Ciobanu Verification of membrane systems with
delays via Petri nets with delays . . . 87--101
Asja Fischer and
Christian Igel A bound for the convergence rate of
parallel tempering for sampling
restricted Boltzmann machines . . . . . 102--117
Takwa Tlili and
Saoussen Krichen On solving the double loading problem
using a modified particle swarm
optimization . . . . . . . . . . . . . . 118--128
Sylvain Gravier and
Jérôme Javelle and
Mehdi Mhalla and
Simon Perdrix On weak odd domination and graph-based
quantum secret sharing . . . . . . . . . 129--137
Alberto Dennunzio and
Enrico Formenti and
Luca Manzoni Reaction systems and extremal
combinatorics properties . . . . . . . . 138--149
Jason Morton and
Jacob Turner Computing the Tutte polynomial of
lattice path matroids using
determinantal circuits . . . . . . . . . 150--156
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Lila Kari Editorial . . . . . . . . . . . . . . . 1
David Gilbert and
Monika Heiner Advances in Computational Methods in
Systems Biology . . . . . . . . . . . . 2--3
Paolo Ballarini and
Marie Duflot Applications of an expressive
statistical model checking approach to
the analysis of genetic circuits . . . . 4--33
Md. Ariful Islam and
Abhishek Murthy and
Ezio Bartocci and
Elizabeth M. Cherry and
Flavio H. Fenton and
James Glimm and
Scott A. Smolka and
Radu Grosu Model-order reduction of ion channel
dynamics using approximate bisimulation 34--46
Madalena Chaves and
Alfonso Carta Attractor computation using
interconnected Boolean networks: Testing
growth rate models in \bionameE. coli 47--63
François Fages and
Steven Gay and
Sylvain Soliman Inferring reaction systems from ordinary
differential equations . . . . . . . . . 64--78
Santiago Videla and
Carito Guziolowski and
Federica Eduati and
Sven Thiele and
Martin Gebser and
Jacques Nicolas and
Julio Saez-Rodriguez and
Torsten Schaub and
Anne Siegel Learning Boolean logic models of
signaling networks with ASP . . . . . . 79--101
C. Angione and
J. Costanza and
G. Carapezza and
P. Lió and
G. Nicosia Analysis and design of molecular
machines . . . . . . . . . . . . . . . . 102--117
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Gunjan Kumar and
Saswata Shannigrahi On the NP-hardness of speed scaling with
sleep state . . . . . . . . . . . . . . 1--10
Danny Hermelin and
Liat Rozenberg Parameterized complexity analysis for
the Closest String with Wildcards
problem . . . . . . . . . . . . . . . . 11--18
Tullio Ceccherini-Silberstein and
Michel Coornaert and
Francesca Fiorenzi and
Paul E. Schupp and
Nicholas W. M. Touikan Multipass automata and group word
problems . . . . . . . . . . . . . . . . 19--33
Manolis Christodoulakis and
P. J. Ryan and
W. F. Smyth and
Shu Wang Indeterminate strings, prefix arrays &
undirected graphs . . . . . . . . . . . 34--48
Erika M. M. Coelho and
Mitre C. Dourado and
Rudini M. Sampaio Inapproximability results for graph
convexity parameters . . . . . . . . . . 49--58
Flavia Bonomo and
Guillermo Durán and
Mario Valencia-Pabon Complexity of the cluster deletion
problem on subclasses of chordal graphs 59--69
Marin Bougeret and
Pierre-François Dutot and
Denis Trystram and
Klaus Jansen and
Christina Robenek Improved approximation algorithms for
scheduling parallel jobs on identical
clusters . . . . . . . . . . . . . . . . 70--85
David Gajser Verifying time complexity of Turing
machines . . . . . . . . . . . . . . . . 86--97
Aureli Alabert and
Alessandro Berti and
Ricard Caballero and
Marco Ferrante No-Free-Lunch theorems in the continuum 98--106
Alessandro Chiesa and
Zeyuan Allen Zhu Shorter arithmetization of
nondeterministic computations . . . . . 107--131
Erik D. Demaine and
Martin L. Demaine and
Eli Fox-Epstein and
Duc A. Hoang and
Takehiro Ito and
Hirotaka Ono and
Yota Otachi and
Ryuhei Uehara and
Takeshi Yamada Linear-time algorithm for sliding tokens
on trees . . . . . . . . . . . . . . . . 132--142
Marco Chiesa and
Giuseppe Di Battista and
Thomas Erlebach and
Maurizio Patrignani Computational complexity of traffic
hijacking under BGP and S-BGP . . . . . 143--154
Marc P. Renault and
Adi Rosén and
Rob van Stee Online algorithms with advice for bin
packing and scheduling problems . . . . 155--170
Jun Kawahara and
Koji M. Kobayashi An improved lower bound for
one-dimensional online unit clustering 171--173
Ye Du The discrete sell or hold problem with
constraints on asset values . . . . . . 174--179
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
J. Karhumäki and
L. Zamboni Words 2013 . . . . . . . . . . . . . . . 1
Joel D. Day and
Daniel Reidenbach and
Johannes C. Schneider Periodicity forcing words . . . . . . . 2--14
Mari Ernvall and
Vesa Halava and
Tero Harju On the $n$-permutation Post
Correspondence Problem . . . . . . . . . 15--20
Juha Honkala Language-theoretic problems in certain
matrix monoids . . . . . . . . . . . . . 21--28
Tero Harju and
Mike Müller Square-free shuffles of words . . . . . 29--38
Michaël Rao On some generalizations of abelian power
avoidability . . . . . . . . . . . . . . 39--46
M. Rigo and
P. Salimov Another generalization of abelian
equivalence: Binomial complexity of
infinite words . . . . . . . . . . . . . 47--57
G. Castiglione and
M. Sciortino Standard Sturmian words and automata
minimization algorithms . . . . . . . . 58--66
Arseny M. Shur Generating square-free words efficiently 67--72
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Jian Weng and
Yunlei Zhao and
Robert H. Deng and
Shengli Liu and
Yanjiang Yang and
Kouichi Sakurai A note on the security of KHL scheme . . 1--6
T. Kociumaka and
J. Radoszewski and
W. Rytter and
T. Wale\'n Linear-time version of Holub's algorithm
for morphic imprimitivity testing . . . 7--21
Bhadrachalam Chitturi Tighter upper bound for sorting
permutations with prefix transpositions 22--31
Dieter Rautenbach Two greedy consequences for maximum
induced matchings . . . . . . . . . . . 32--38
Van Bang Le and
Andrea Oversberg and
Oliver Schaudt Polynomial time recognition of squares
of Ptolemaic graphs and $3$-sun-free
split graphs . . . . . . . . . . . . . . 39--49
Bertrand LeCun and
Thierry Mautor and
Franck Quessette and
Marc-Antoine Weisser Bin packing with fragmentable items:
Presentation and approximations . . . . 50--59
Bojian Xu Boosting distinct random sampling for
basic counting on the union of
distributed streams . . . . . . . . . . 60--79
Wen An Liu and
Meile Zhao General restrictions of Wythoff-like
games . . . . . . . . . . . . . . . . . 80--88
Luerbio Faria and
Laurent Gourv\`es and
Carlos A. Martinhon and
Jérôme Monnot The edge-recoloring cost of
monochromatic and properly edge-colored
paths and cycles . . . . . . . . . . . . 89--102
Michaël Gabay and
Vladimir Kotov and
Nadia Brauner Online bin stretching with bunch
techniques . . . . . . . . . . . . . . . 103--113
Haitao Wang and
Jingru Zhang One-dimensional $k$-center on uncertain
data . . . . . . . . . . . . . . . . . . 114--124
Che-Nan Kuo Pancyclicity and bipancyclicity of
folded hypercubes with both vertex and
edge faults . . . . . . . . . . . . . . 125--131
Ruo-Wei Hung and
Chih-Chia Yao and
Shang-Ju Chan The Hamiltonian properties of supergrid
graphs . . . . . . . . . . . . . . . . . 132--148
Ching-Lueh Chang A deterministic sublinear-time
nonadaptive algorithm for metric
$1$-median selection . . . . . . . . . . 149--157
T. Calamoneri and
R. Petreschi Corrigendum to ``On pairwise
compatibility graphs having Dilworth
number two'' [Theoret. Comput. Sci. \bf
524 (2014) 34--40] . . . . . . . . . . . 158--159
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Luke Ong and
Ruy J. G. B. de Queiroz Logic, Language, Information and
Computation (WoLLIC 2012) . . . . . . . 1--2
Sergio Abriola and
Santiago Figueira and
Gabriel Senno Linearizing well quasi-orders and
bounding the length of bad sequences . . 3--22
Andrea Asperti and
Wilmer Ricciotti A formalization of multi-tape Turing
machines . . . . . . . . . . . . . . . . 23--42
Paolo Baldi and
Agata Ciabattoni Uniform proofs of standard completeness
for extensions of first-order MTL . . . 43--57
Laura Bozzelli and
Hans van Ditmarsch and
Sophie Pinchinat The complexity of one-agent refinement
modal logic . . . . . . . . . . . . . . 58--83
Carlos Caleiro and
João Marcos and
Marco Volpe Bivalent semantics, generalized
compositionality and analytic
classic-like tableaux for finite-valued
logics . . . . . . . . . . . . . . . . . 84--110
Sebastian Link Frontiers for propositional reasoning
about fragments of probabilistic
conditional independence and
hierarchical database decompositions . . 111--131
L. Menasché Schechter A logic of plausible justifications . . 132--145
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Marcello Bonsangue Preface . . . . . . . . . . . . . . . . 1
Ichiro Hasuo Generic weakest precondition semantics
from monads enriched with order . . . . 2--29
Bart Jacobs Dijkstra and Hoare monads in monadic
computation . . . . . . . . . . . . . . 30--45
Marina Lenisa Multigames and strategies,
coalgebraically . . . . . . . . . . . . 46--62
B. Trancón y Widemann and
M. Hauhs Algebraic-coalgebraic recursion theory
of history-dependent dynamical system
models . . . . . . . . . . . . . . . . . 63--80
Robert S. R. Myers and
Jirí Adámek and
Stefan Milius and
Henning Urbat Coalgebraic constructions of canonical
nondeterministic automata . . . . . . . 81--101
Filippo Bonchi and
Stefan Milius and
Alexandra Silva and
Fabio Zanasi Killing epsilons with a dagger: a
coalgebraic study of systems with
algebraic label structure . . . . . . . 102--126
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Joseph Kempka and
Phil McMinn and
Dirk Sudholt Design and analysis of different
alternating variable searches for
search-based software testing . . . . . 1--20
Pietro S. Oliveto and
Carsten Witt Improved time complexity analysis of the
Simple Genetic Algorithm . . . . . . . . 21--41
Youhei Akimoto and
Sandra Astete-Morales and
Olivier Teytaud Analysis of runtime of optimization
algorithms for noisy functions over
discrete codomains . . . . . . . . . . . 42--50
Michael A. Bender and
Sándor P. Fekete and
Alexander Kröller and
Vincenzo Liberatore and
Joseph S. B. Mitchell and
Valentin Polishchuk and
Jukka Suomela The minimum backlog problem . . . . . . 51--61
Andreas Holzer and
Christian Schallhart and
Michael Tautschnig and
Helmut Veith Closure properties and complexity of
rational sets of regular languages . . . 62--79
Rolf Klein and
David Kriesel and
Elmar Langetepe A local strategy for cleaning expanding
cellular domains by simple robots . . . 80--94
K. Krzywdzi\'nski and
K. Rybarczyk Distributed algorithms for random graphs 95--105
Lucas Bang and
Wolfgang Bein and
Lawrence L. Larmore R-LINE: a better randomized $2$-server
algorithm on the line . . . . . . . . . 106--118
Peter Floderus and
Miros\law Kowaluk and
Andrzej Lingas and
Eva-Marta Lundell Induced subgraph isomorphism: Are some
patterns substantially easier than
others? . . . . . . . . . . . . . . . . 119--128
Mattia D'Emidio and
Daniele Frigioni and
Alfredo Navarra Explore and repair graphs with black
holes using mobile entities . . . . . . 129--145
Ranita Biswas and
Partha Bhowmick On different topological classes of
spherical geodesic paths and circles in
$ \mathbb {Z}^3 $ . . . . . . . . . . . 146--163
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Marcelo Finger and
Delia Kesner Special Issue: Selected papers of the
7th and 8th workshops on Logical and
Semantic Frameworks with Applications
(LSFA) . . . . . . . . . . . . . . . . . 1
Beniamino Accattoli Proof nets and the call-by-value $
\lambda $-calculus . . . . . . . . . . . 2--24
Carlos Areces and
Ezequiel Orbe Symmetric blocking . . . . . . . . . . . 25--41
Walter Carnielli and
Mariana Matulovic The method of polynomial ring calculus
and its potentialities . . . . . . . . . 42--56
Alberto Ciaffaglione and
Ivan Scagnetto Mechanizing type environments in weak
HOAS . . . . . . . . . . . . . . . . . . 57--78
Marcello D'Agostino An informational view of classical logic 79--97
Carlos Olarte and
Elaine Pimentel and
Vivek Nigam Subexponential concurrent constraint
programming . . . . . . . . . . . . . . 98--120
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Qianping Gu and
Pavol Hell and
Boting Yang Preface . . . . . . . . . . . . . . . . 1
Yuya Higashikawa and
Mordecai J. Golin and
Naoki Katoh Multiple sink location problems in
dynamic path networks . . . . . . . . . 2--15
Robert Bredereck and
Vincent Froese and
Sepp Hartung and
André Nichterlein and
Rolf Niedermeier and
Nimrod Talmon The complexity of degree anonymization
by vertex addition . . . . . . . . . . . 16--34
Francis Y. L. Chin and
Bin Fu and
Jiuling Guo and
Shuguang Han and
Jueliang Hu and
Minghui Jiang and
Guohui Lin and
Hing-Fung Ting and
Luping Zhang and
Yong Zhang and
Diwei Zhou Competitive algorithms for unbounded
one-way trading . . . . . . . . . . . . 35--48
Leizhen Cai and
Junjie Ye Parameterized complexity of finding
connected induced subgraphs . . . . . . 49--59
Chengwei Guo and
Leizhen Cai Obtaining split graphs by edge
contraction . . . . . . . . . . . . . . 60--67
Wing-Kai Hon and
Ton Kloks and
Hsiang-Hsuan Liu and
Yue-Li Wang Edge-clique covers of the tensor product 68--74
Taibo Luo and
Yinfeng Xu Semi-online hierarchical load balancing
problem with bounded processing times 75--82
Lucia Draque Penso and
Fábio Protti and
Dieter Rautenbach and
Uéverton dos Santos Souza Complexity analysis of $ P_3 $-convexity
problems on bounded-degree and planar
graphs . . . . . . . . . . . . . . . . . 83--95
Peter Brass and
Hyeon-Suk Na and
Chan-Su Shin Local event boundary detection with
unreliable sensors: Analysis of the
majority vote scheme . . . . . . . . . . 96--112
Tamal T. Biswas and
Kenneth W. Regan Approximation of function evaluation
over sequence arguments via specialized
data structures . . . . . . . . . . . . 113--123
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Jianer Chen and
John E. Hopcroft Frontiers of Algorithmics . . . . . . . 125
Danny Z. Chen and
David Craft and
Lin Yang A circular matrix-merging algorithm with
application in Volumetric
Intensity-Modulated Arc Therapy . . . . 126--134
Dariusz Dereniowski and
Danny Dyer and
Ryan M. Tifenbach and
Boting Yang The complexity of zero-visibility cops
and robber . . . . . . . . . . . . . . . 135--148
Md. Iqbal Hossain and
Md. Saidur Rahman Good spanning trees in graph drawing . . 149--165
Haitao Jiang and
Lusheng Wang and
Binhai Zhu and
Daming Zhu A factor-$ (1.408 + \epsilon) $
approximation for sorting unsigned
genomes by reciprocal translocations . . 166--180
Weidong Li and
Jianping Li and
Xuejie Zhang and
Zhibin Chen Penalty cost constrained identical
parallel machine scheduling problem . . 181--192
Ling Lin and
Xiaochen Xian and
Yujie Yan and
Xing He and
Zhiyi Tan Inefficiency of equilibria for
scheduling game with machine activation
costs . . . . . . . . . . . . . . . . . 193--207
Yuji Obata and
Takao Nishizeki Efficient approximation algorithms for
bandwidth consecutive multicolorings of
graphs . . . . . . . . . . . . . . . . . 208--220
Yangguang Shi and
Fa Zhang and
Jie Wu and
Zhiyong Liu Randomized oblivious integral routing
for minimizing power cost . . . . . . . 221--246
H. F. Ting and
Xiangzhong Xiang Near optimal algorithms for online
maximum edge-weighted $b$-matching and
two-sided vertex-weighted $b$-matching 247--256
Jie You and
Jianxin Wang and
Qilong Feng and
Feng Shi Kernelization and parameterized
algorithms for covering a tree by a set
of stars or paths . . . . . . . . . . . 257--270
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Zhao Zhang and
Lidong Wu and
Ding-Zhu Du Preface . . . . . . . . . . . . . . . . 271
Sicen Guo and
Minming Li and
Yingchao Zhao Optimal trees for minimizing average
individual updating cost . . . . . . . . 272--281
Iyad Kanj and
Stefan Szeider Parameterized and subexponential-time
complexity of satisfiability problems
and applications . . . . . . . . . . . . 282--295
Jianjie Zhou and
Liying Kang and
Erfang Shan Two paths location of a tree with
positive or negative weights . . . . . . 296--305
Jungtaek Seo and
Subhankar Mishra and
Xiang Li and
My T. Thai Catastrophic cascading failures in power
networks . . . . . . . . . . . . . . . . 306--319
Yi-Jun Chang and
Hsu-Chun Yen Constrained floorplans in $2$D and $3$D 320--336
Yoshihiko Ito and
Yuki Kobayashi and
Yuya Higashikawa and
Naoki Katoh and
Sheung-Hung Poon and
Maria Saumell Optimally bracing grid frameworks with
holes . . . . . . . . . . . . . . . . . 337--350
Bogdan Armaselu and
Ovidiu Daescu Algorithms for fair partitioning of
convex polygons . . . . . . . . . . . . 351--362
Xiaofeng Gao and
Jun Li and
Guihai Chen A better approximation for constructing
virtual backbone in $3$D wireless ad-hoc
networks . . . . . . . . . . . . . . . . 363--380
Zaobo He and
Zhipeng Cai and
Siyao Cheng and
Xiaoming Wang Approximate aggregation for tracking
quantiles and range countings in
wireless sensor networks . . . . . . . . 381--390
Zhenhua Duan and
Jin Liu and
Jie Li and
Cong Tian Improved even order magic square
construction algorithms and their
applications in multi-user shared
electronic accounts . . . . . . . . . . 391--410
Binay Bhattacharya and
Tsunehiko Kameda Improved algorithms for computing minmax
regret sinks on dynamic path and tree
networks . . . . . . . . . . . . . . . . 411--425
Faisal N. Abu-Khzam and
Judith Egan and
Michael R. Fellows and
Frances A. Rosamond and
Peter Shaw On the parameterized complexity of
dynamic problems . . . . . . . . . . . . 426--434
Bjòrn Kjos-Hanssen Kolmogorov structure functions for
automatic complexity . . . . . . . . . . 435--445
Lin Chen and
Deshi Ye and
Guochuan Zhang An asymptotic competitive scheme for
online bin packing . . . . . . . . . . . 446--454
Iyad Kanj and
Guohui Lin and
Tian Liu and
Weitian Tong and
Ge Xia and
Jinhui Xu and
Boting Yang and
Fenghui Zhang and
Peng Zhang and
Binhai Zhu Improved parameterized and exact
algorithms for cut problems on trees . . 455--470
Liang Song and
Haibin Chen and
Hao Gu and
Hejiao Huang and
Hongwei Du Set covering in fuel-considered vehicle
routing problems . . . . . . . . . . . . 471--479
Xueliang Li and
Meiqin Wei and
Jun Yue Proper connection number and connected
dominating sets . . . . . . . . . . . . 480--487
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Lila Kari Editorial . . . . . . . . . . . . . . . 1
Emanuela Merelli and
Ion Petre From Computer Science to Biology and
Back . . . . . . . . . . . . . . . . . . 2--3
Andrzej Ehrenfeucht and
Grzegorz Rozenberg Standard and ordered zoom structures . . 4--15
Alberto Dennunzio and
Enrico Formenti and
Luca Manzoni and
Antonio E. Porreca Ancestors, descendants, and gardens of
Eden in reaction systems . . . . . . . . 16--26
Robert Brijder Recombination faults in gene assembly in
ciliates modeled using multimatroids . . 27--35
Roberto Barbuti and
Pasquale Bove and
Paolo Milazzo and
Giovanni Pardini Minimal probabilistic $P$ systems for
modelling ecological systems . . . . . . 36--56
Luis F. Macías-Ramos and
Mario J. Pérez-Jiménez and
Agustín Riscos-Núñez and
Luis Valencia-Cabrera Membrane fission versus cell division:
When membrane proliferation is not
enough . . . . . . . . . . . . . . . . . 57--65
Maxime Folschette and
Lo\"\ic Paulevé and
Morgan Magnin and
Olivier Roux Sufficient conditions for reachability
in automata networks with priorities . . 66--83
Rocco Zaccagnino and
Rosalba Zizza and
Carlo Zottoli Testing DNA code words properties of
regular languages . . . . . . . . . . . 84--97
Olga Hrydziuszko and
Joanna Balbus and
Magdalena Zulpo and
Artur Wrona and
Krystian Kubica Mathematical analyses of two-compartment
model of human cholesterol circulatory
transport in application to high blood
cholesterol prevention, diagnosis and
treatment . . . . . . . . . . . . . . . 98--107
Mihaela Paun and
Yang Li and
Yuan Cheng and
Iris Tusa and
Andrei Paun Segmenting microarray images using a
contour-based method . . . . . . . . . . 108--118
Paola Flocchini and
Jie Gao Preface . . . . . . . . . . . . . . . . 119
Amir Bannoura and
Christian Ortolf and
Leonhard Reindl and
Christian Schindelhauer The wake up dominating set problem . . . 120--134
Avery Miller On the complexity of neighbourhood
learning in radio networks . . . . . . . 135--145
Gokarna Sharma and
Costas Busch Optimal nearest neighbor queries in
sensor networks . . . . . . . . . . . . 146--165
Tigran Tonoyan Conflict graphs and the SINR-capacity of
the mean power scheme . . . . . . . . . 166--177
Christian Ortolf and
Christian Schindelhauer Strategies for parallel unaware cleaners 178--189
Avery Miller and
Andrzej Pelc Fast rendezvous with advice . . . . . . 190--198
Magnús M. Halldórsson Guest editorial: Structural Information
and Communication Complexity . . . . . . 199--200
Jurek Czyzowicz and
Leszek Gasieniec and
Konstantinos Georgiou and
Evangelos Kranakis and
Fraser MacQuarrie The Beachcombers' Problem: Walking and
searching with mobile robots . . . . . . 201--218
Dariusz Dereniowski and
Ralf Klasing and
Adrian Kosowski and
\Lukasz Kuszner Rendezvous of heterogeneous mobile
agents in edge-weighted networks . . . . 219--230
Evangelos Bampas and
Nikos Leonardos and
Euripides Markou and
Aris Pagourtzis and
Matoula Petrolia Improved periodic data retrieval in
asynchronous rings with a faulty host 231--254
Yuval Emek and
Tobias Langner and
David Stolz and
Jara Uitto and
Roger Wattenhofer How many ants does it take to find the
food? . . . . . . . . . . . . . . . . . 255--267
James W. Hegeman and
Sriram V. Pemmaraju Lessons from the Congested Clique
applied to MapReduce . . . . . . . . . . 268--281
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Leo van Iersel and
Steven Kelk and
Nela Leki\'c and
Simone Linz Satisfying ternary permutation
constraints by multiple linear orders or
phylogenetic trees . . . . . . . . . . . 1--21
Bey-Chi Lin and
Chin-Tau Lea Repackable multi-$ \log_2 N $ networks 22--31
Jian Li and
Haitao Wang Range queries on uncertain data . . . . 32--48
Willy Susilo and
Fuchun Guo and
Yi Mu Efficient dynamic threshold
identity-based encryption with
constant-size ciphertext . . . . . . . . 49--59
J. Sawada and
A. Williams Successor rules for flipping pancakes
and burnt pancakes . . . . . . . . . . . 60--75
Ken C. K. Fong and
Minming Li and
Hongyu Liang and
Linji Yang and
Hao Yuan Average-case complexity of the min-sum
matrix product problem . . . . . . . . . 76--86
Jessica Enright and
Lorna Stewart Games on interval and permutation graph
representations . . . . . . . . . . . . 87--103
Jan Kratochvíl and
Jan Arne Telle and
Marek Tesar Computational complexity of covering
three-vertex multigraphs . . . . . . . . 104--117
Eric Goles and
Pedro Montealegre and
Ville Salo and
Ilkka Törmä PSPACE-completeness of majority automata
networks . . . . . . . . . . . . . . . . 118--128
Richard Beal and
Donald Adjeroh Compressed parameterized pattern
matching . . . . . . . . . . . . . . . . 129--142
Ching-Nung Yang and
Li-Zhe Sun and
Song-Ruei Cai Extended color visual cryptography for
black and white secret image . . . . . . 143--161
Cunquan Qu and
Guanghui Wang and
Jianliang Wu and
Xiaowei Yu On the neighbor sum distinguishing total
coloring of planar graphs . . . . . . . 162--170
Shantanu Das and
Paola Flocchini and
Giuseppe Prencipe and
Nicola Santoro and
Masafumi Yamashita Autonomous mobile robots with lights . . 171--184
Xin Han and
Kazuhisa Makino Online minimization knapsack problem . . 185--196
Xi Wang and
Jianxi Fan and
Xiaohua Jia and
Cheng-Kuan Lin An efficient algorithm to construct
disjoint path covers of DCell networks 197--210
Takuya Akiba and
Yoichi Iwata Branch-and-reduce exponential/FPT
algorithms in practice: a case study of
vertex cover . . . . . . . . . . . . . . 211--225
Marie-Pierre Béal and
Michel Blockelet and
C\uat\ualin Dima Sofic--Dyck shifts . . . . . . . . . . . 226--244
Jordan Viard and
Matthieu Latapy and
Clémence Magnien Computing maximal cliques in link
streams . . . . . . . . . . . . . . . . 245--252
Linming Gong and
Shundong Li and
Qing Mao and
Daoshun Wang and
Jiawei Dou A homomorphic encryption scheme with
adaptive chosen ciphertext security but
without random oracle . . . . . . . . . 253--261
Fei-Huang Chang and
Ma-Lian Chia and
David Kuo and
Sheng-Chyang Liaw and
Jen-Chun Ling All-to-all broadcast problems on
Cartesian product graphs . . . . . . . . 262--271
Christopher Hanrui Chak and
Rusins Freivalds and
Frank Stephan and
Henrietta Tan Wan Yik On block pumpable languages . . . . . . 272--285
Fabrício Benevides and
Victor Campos and
Mitre C. Dourado and
Rudini M. Sampaio and
Ana Silva The maximum infection time in the
geodesic and monophonic convexities . . 287--295
Kun-Tze Chen and
Chi-Long Li and
Hsien-Tai Chiu and
Chin Lung Lu An efficient algorithm for one-sided
block ordering problem under
block-interchange distance . . . . . . . 296--305
Thomas Bläsius and
Ignaz Rutter A new perspective on clustered planarity
as a combinatorial embedding problem . . 306--315
Mordecai Golin and
John Iacono and
Danny Krizanc and
Rajeev Raman and
Srinivasa Rao Satti and
Sunil Shende Encoding $2$D range maximum queries . . 316--327
Dieter Kratsch and
Van Bang Le Algorithms solving the Matching Cut
problem . . . . . . . . . . . . . . . . 328--335
Ran Gu and
Xueliang Li and
Zhongmei Qin Proper connection number of random
graphs . . . . . . . . . . . . . . . . . 336--343
Jing Tian and
Xianzhong Zhao and
Yong Shao On structure and representations of
cyclic automata . . . . . . . . . . . . 344--360
François Bonnet and
Xavier Défago and
Thanh Dang Nguyen and
Maria Potop-Butucaru Tight bound on mobile Byzantine
Agreement . . . . . . . . . . . . . . . 361--373
Ljiljana Brankovic and
Costas S. Iliopoulos and
Ritu Kundu and
Manal Mohamed and
Solon P. Pissis and
Fatima Vayani Linear-time superbubble identification
algorithm for genome assembly . . . . . 374--383
Sabina Zejnilovi\'c and
Dieter Mitsche and
João Gomes and
Bruno Sinopoli Extending the metric dimension to graphs
with missing edges . . . . . . . . . . . 384--394
Ming Xu and
Cheng-Chao Huang and
Zhi-Bin Li and
Zhenbing Zeng Analyzing ultimate positivity for
solvable systems . . . . . . . . . . . . 395--412
Rong-Xia Hao and
Mei-Mei Gu and
Yan-Quan Feng The pessimistic diagnosabilities of some
general regular graphs . . . . . . . . . 413--420
Shuming Zhou and
Sulin Song and
Xiaoxue Yang and
Lanxiang Chen On conditional fault tolerance and
diagnosability of hierarchical cubic
networks . . . . . . . . . . . . . . . . 421--433
Wenbin Chen and
Nagiza F. Samatova and
Matthias F. Stallmann and
William Hendrix and
Weiqin Ying On size-constrained minimum $s$--$t$ cut
problems and size-constrained dense
subgraph problems . . . . . . . . . . . 434--442
Zhongzhi Zhang and
Shunqi Wu and
Mingyun Li and
Francesc Comellas The number and degree distribution of
spanning trees in the Tower of Hanoi
graph . . . . . . . . . . . . . . . . . 443--455
James Currie and
Narad Rampersad Growth rate of binary words avoiding
xxx$^R$ . . . . . . . . . . . . . . . . 456--468
Emily Allen and
F. Blanchet-Sadri and
Michelle Bodnar and
Brian Bowers and
Joe Hidakatsu and
John Lensmire Combinatorics on partial word borders 469--493
Xie-Bin Chen Paired $2$-disjoint path covers of
faulty $k$-ary $n$-cubes . . . . . . . . 494--499
Qizhi Fang and
Bo Li and
Xiaoming Sun and
Jia Zhang and
Jialin Zhang Computing the least-core and nucleolus
for threshold cardinality matching games 500--510
Luciano N. Grippo and
Martín Matamala and
Martín D. Safe and
Maya J. Stein Convex $p$-partitions of bipartite
graphs . . . . . . . . . . . . . . . . . 511--514
Zhipeng Cai and
Alexander Zelikovsky Special issue on Computing and
Combinatori's Conference . . . . . . . . 515
Suman K. Bera and
Syamantak Das and
Amit Kumar Minimizing average flow-time under
knapsack constraint . . . . . . . . . . 516--525
Xujin Chen and
Xiaodong Hu and
Changjun Wang Approximation for the minimum cost
doubly resolving set problem . . . . . . 526--543
Zhenhua Duan and
Cong Tian and
Nan Zhang A canonical form based decision
procedure and model checking approach
for propositional projection temporal
logic . . . . . . . . . . . . . . . . . 544--560
Minghui Jiang and
Haitao Wang Shortest color-spanning intervals . . . 561--568
François Le Gall and
Harumichi Nishimura and
Seiichiro Tani Quantum algorithms for finding
constant-sized sub-hypergraphs . . . . . 569--582
Xianmin Liu and
Jianzhong Li and
Hong Gao On the hardness of labeled correlation
clustering problem: a parameterized
complexity view . . . . . . . . . . . . 583--593
Dongjing Miao and
Xianmin Liu and
Jianzhong Li On the complexity of sampling query
feedback restricted database repair of
functional dependency violations . . . . 594--605
Subhankar Mishra and
Thang N. Dinh and
My T. Thai and
Jungtaek Seo and
Incheol Shin Optimal packet scan against malicious
attacks in smart grids . . . . . . . . . 606--619
Weitian Tong and
Randy Goebel and
Guohui Lin Smoothed heights of tries and Patricia
tries . . . . . . . . . . . . . . . . . 620--626
Di Wu and
Zhao Zhang and
Weili Wu Approximation algorithm for the balanced
$2$-connected $k$-partition problem . . 627--638
Nan Zhang and
Zhenhua Duan and
Cong Tian A complete axiom system for
propositional projection temporal logic
with cylinder computation model . . . . 639--657
Peng Zhang A new approximation algorithm for the
unbalanced Min $s$--$t$ Cut problem . . 658--665
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Helmut Jürgensen and
Juhani Karhumäki and
Alexander Okhotin Descriptional Complexity of Formal
Systems . . . . . . . . . . . . . . . . 1
Da-Jung Cho and
Yo-Sub Han and
Sang-Ki Ko and
Kai Salomaa State complexity of inversion operations 2--12
Volker Diekert and
Manfred Kufleitner A survey on the local divisor technique 13--23
Olga Dorzweiler and
Thomas Flamm and
Andreas Krebs and
Michael Ludwig Positive and negative proofs for
circuits and branching programs . . . . 24--36
Mai Gehrke and
Andreas Krebs and
Jean-Éric Pin Ultrafilters on words for a fragment of
logic . . . . . . . . . . . . . . . . . 37--58
Markus Holzer and
Sebastian Jakobi Boundary sets of regular and
context-free languages . . . . . . . . . 59--77
Jozef Jirásek and
Galina Jirásková and
Monika Krausová and
Peter Mlynárcik and
Juraj Sebej Prefix-free languages: Left and right
quotient and reversal . . . . . . . . . 78--90
P. Karandikar and
M. Niewerth and
Ph. Schnoebelen On the state complexity of closures and
interiors of regular languages with
subwords and superwords . . . . . . . . 91--107
Alexandros Palioudakis and
Kai Salomaa and
Selim G. Akl Operational state complexity of unary
NFAs with finite nondeterminism . . . . 108--120
Daniel Prusa Non-recursive trade-offs between
two-dimensional automata and grammars 121--132
Anonymous Guest Editorial: Special issue on
Structural Information and Communication
Complexity . . . . . . . . . . . . . . . 133--134
Amotz Bar-Noy and
Ben Baumer and
Dror Rawitz Changing of the guards: Strip cover with
duty cycling . . . . . . . . . . . . . . 135--148
Ioannis Caragiannis and
Christos Kalaitzis Space lower bounds for low-stretch
greedy embeddings . . . . . . . . . . . 149--157
Gianlorenzo D'Angelo and
Gabriele Di Stefano and
Ralf Klasing and
Alfredo Navarra Gathering of robots on anonymous grids
and trees without multiplicity detection 158--168
B. Balamohan and
S. Dobrev and
P. Flocchini and
N. Santoro Exploring an unknown dangerous graph
with a constant number of tokens . . . . 169--181
Dongxiao Yu and
Qiang-Sheng Hua and
Yuexuan Wang and
Haisheng Tan and
Francis C. M. Lau Distributed multiple-message broadcast
in wireless ad hoc networks under the
SINR model . . . . . . . . . . . . . . . 182--191
Mohsen Eftekhari and
Evangelos Kranakis and
Fraser MacQuarrie and
Oscar Morales-Ponce and
Lata Narayanan Strong connectivity of sensor networks
with double antennae . . . . . . . . . . 192--203
Henning Hasemann and
Juho Hirvonen and
Joel Rybicki and
Jukka Suomela Deterministic local algorithms, unique
identifiers, and fractional graph
colouring . . . . . . . . . . . . . . . 204--217
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Yuxi Fu Theory of interaction . . . . . . . . . 1--49
Frédéric Blanqui Termination of rewrite relations on $
\lambda $-terms based on Girard's notion
of reducibility . . . . . . . . . . . . 50--86
Tetsuo Yokoyama and
Holger Bock Axelsen and
Robert Glück Fundamentals of reversible flowchart
languages . . . . . . . . . . . . . . . 87--115
Ming Xu and
Lijun Zhang and
David N. Jansen and
Huibiao Zhu and
Zongyuan Yang Multiphase until formulas over Markov
reward models: an algebraic approach . . 116--135
Anca Muscholl and
Sven Schewe Controlling loosely cooperating
processes . . . . . . . . . . . . . . . 136--141
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Parosh Aziz Abdulla and
Giorgio Delzanno and
Othmane Rezine and
Arnaud Sangnier and
Riccardo Traverso Parameterized verification of
time-sensitive models of ad hoc network
protocols . . . . . . . . . . . . . . . 1--22
Zhaowei Xu and
Yuefei Sui and
Wenhui Zhang Completeness of Hoare logic with inputs
over the standard model . . . . . . . . 23--28
Bas Luttik Unique parallel decomposition in
branching and weak bisimulation
semantics . . . . . . . . . . . . . . . 29--44
Haiyu Pan and
Yongming Li and
Yongzhi Cao and
Zhanyou Ma Model checking computation tree logic
over finite lattices . . . . . . . . . . 45--62
Chanjuan Liu and
Fenrong Liu and
Kaile Su and
Enqiang Zhu A logical characterization of extensive
games with short sight . . . . . . . . . 63--82
Friedrich Slivovsky and
Stefan Szeider Soundness of $Q$-resolution with
dependency schemes . . . . . . . . . . . 83--101
Jannik Dreier and
Cristian Ene and
Pascal Lafourcade and
Yassine Lakhnech On the existence and decidability of
unique decompositions of processes in
the applied $ \pi $-calculus . . . . . . 102--125
Mingyuan Wu and
Lankun Guo and
Qingguo Li A representation of $L$-domains by
information systems . . . . . . . . . . 126--136
Alex Gavryushkin and
Bakhadyr Khoussainov and
Frank Stephan Reducibilities among equivalence
relations induced by recursively
enumerable structures . . . . . . . . . 137--152
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Tomoyuki Yamakami Pseudorandom generators against advised
context-free languages . . . . . . . . . 1--27
Kevin A. Naudé Refined pivot selection for maximal
clique enumeration in graphs . . . . . . 28--37
Fedor V. Fomin and
Pinar Heggernes and
Erik Jan van Leeuwen The Firefighter problem on graph classes 38--50
Thomas Erlebach and
Michael Hoffmann and
Frank Kammer Query-competitive algorithms for
cheapest set problems under uncertainty 51--64
Vittorio Bil\`o and
Angelo Fanelli and
Michele Flammini and
Gianpiero Monaco and
Luca Moscardelli The price of envy-freeness in machine
scheduling . . . . . . . . . . . . . . . 65--78
Tim Nonner Capacitated Max-Batching with interval
graph compatibilities . . . . . . . . . 79--93
Miriam Di Ianni and
Giorgio Gambosi and
Gianluca Rossi and
Paola Vocca Min-max communities in graphs:
Complexity and computational properties 94--114
Bernd Meyer Generalized Pete's Pike is
PSPACE-complete . . . . . . . . . . . . 115--125
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Chantal Berline and
Klaus Grue A synthetic axiomatization of Map Theory 1--62
Gabrielle Anderson and
David Pym A calculus and logic of bunched
resources and processes . . . . . . . . 63--96
Christoph Dittmann and
Stephan Kreutzer and
Alexandru I. Tomescu Graph operations on parity games and
polynomial-time algorithms . . . . . . . 97--108
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Marc Hellmuth and
Florian Lehner Fast factorization of Cartesian products
of (directed) hypergraphs . . . . . . . 1--11
Karel Klouda and
Katerina Medková Synchronizing delay for binary uniform
morphisms . . . . . . . . . . . . . . . 12--22
Bogdan S. Chlebus and
Gianluca De Marco and
Dariusz R. Kowalski Scalable wake-up of multi-channel
single-hop radio networks . . . . . . . 23--44
Jae Hong Seo and
Keita Emura Revocable hierarchical identity-based
encryption via history-free approach . . 45--60
Binay K. Bhattacharya and
Subhas C. Nandy and
Sasanka Roy Space-efficient algorithm for computing
a centerpoint of a set of points in $
\mathbb {R}^2 $ . . . . . . . . . . . . 61--70
Mingzu Zhang and
Lianzhu Zhang and
Xing Feng Reliability measures in relation to the
$h$-extra edge-connectivity of folded
hypercubes . . . . . . . . . . . . . . . 71--77
Sun-Yuan Hsieh and
Hong-Wen Huang and
Chia-Wei Lee $ \{ 2, 3 \} $-Restricted connectivity
of locally twisted cubes . . . . . . . . 78--90
Eddie Cheng and
Justin Kelm and
Joseph Renzi Strong matching preclusion of $ (n,
k)$-star graphs . . . . . . . . . . . . 91--101
Sayaka Kamei and
Tomoko Izumi and
Yukiko Yamauchi An asynchronous self-stabilizing
approximation for the minimum CDS with
safe convergence in UDGs . . . . . . . . 102--119
Sigve Hortemo Sæther and
Martin Vatshelle Hardness of computing width parameters
based on branch decompositions over the
vertex set . . . . . . . . . . . . . . . 120--125
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Frank Gurski and
Egon Wanke and
Eda Yilmaz Directed NLC-width . . . . . . . . . . . 1--17
Joost Engelfriet and
Sebastian Maneth and
Helmut Seidl Look-ahead removal for total
deterministic top-down tree transducers 18--58
Sergey Avgustinovich and
Sergey Kitaev and
Vladimir N. Potapov and
Vincent Vajnovszki Gray coding cubic planar maps . . . . . 59--69
Prosenjit Bose and
Jean-Lou De Carufel and
Pat Morin and
André van Renssen and
Sander Verdonschot Towards tight bounds on theta-graphs:
More is not always better . . . . . . . 70--93
Dakui Jiang and
Jiayin Tan Scheduling with job rejection and
nonsimultaneous machine available time
on unrelated parallel machines . . . . . 94--99
Xiao-Tao Lü and
Jin Chen and
Ying-Jun Guo and
Zhi-Xiong Wen On the permutation complexity of the
Cantor-like sequences . . . . . . . . . 100--110
Palash Dey and
Neeldhara Misra and
Y. Narahari Kernelization complexity of possible
winner and coalitional manipulation
problems in voting . . . . . . . . . . . 111--125
Nikolett Bereczky and
Amalia Duch and
Krisztián Németh and
Salvador Roura Quad-$k$ $d$ trees: a general framework
for $k$ $d$ trees and quad trees . . . . 126--140
Artur Jez A really simple approximation of
smallest grammar . . . . . . . . . . . . 141--150
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Masahiro Shibata and
Shinji Kawai and
Fukuhito Ooshita and
Hirotsugu Kakugawa and
Toshimitsu Masuzawa Partial gathering of mobile agents in
asynchronous unidirectional rings . . . 1--11
Sandra Astete-Morales and
Marie-Liesse Cauwet and
Jialin Liu and
Olivier Teytaud Simple and cumulative regret for
continuous noisy optimization . . . . . 12--27
Jean-Daniel Boissonnat and
Dorian Mazauric On the complexity of the representation
of simplicial complexes by trees . . . . 28--44
Jung-Heum Park Unpaired many-to-many disjoint path
covers in restricted hypercube-like
graphs . . . . . . . . . . . . . . . . . 45--64
Ji Tian and
Qian Wang and
Ruyan Fu and
Jinjiang Yuan Online scheduling on the unbounded
drop-line batch machines to minimize the
maximum delivery completion time . . . . 65--68
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Yingjie Xia and
Xuejiao Liu and
Fubiao Xia and
Guilin Wang A reduction of security notions in
designated confirmer signatures . . . . 1--20
Limei Lin and
Li Xu and
Shuming Zhou Relating the extra connectivity and the
conditional diagnosability of regular
graphs under the comparison model . . . 21--29
Haibin Zhu and
Dongning Liu and
Siqin Zhang and
Yu Zhu and
Luyao Teng and
Shaohua Teng Solving the Many to Many assignment
problem by improving the Kuhn--Munkr's
algorithm with backtracking . . . . . . 30--41
Markus L. Schmid Computing equality-free and repetitive
string factorisations . . . . . . . . . 42--51
Alexander Okhotin Input-driven languages are linear
conjunctive . . . . . . . . . . . . . . 52--71
Simone Bova and
Robert Ganian and
Stefan Szeider Quantified conjunctive queries on
partially ordered sets . . . . . . . . . 72--84
Nabila Abdessaied and
Matthew Amy and
Rolf Drechsler and
Mathias Soeken Complexity of reversible circuits and
their quantum implementations . . . . . 85--106
Lhouari Nourine and
Jean-Marc Petit Extended dualization: Application to
maximal pattern mining . . . . . . . . . 107--121
Hélio B. Macêdo Filho and
Raphael C. S. Machado and
Celina M. H. de Figueiredo Hierarchical complexity of
$2$-clique-colouring weakly chordal
graphs and perfect graphs having cliques
of size at least $3$ . . . . . . . . . . 122--134
Patrick Chisan Hew Working in binary protects the repetends
of $ 1 / 3^h $: Comment on Colussi's
`The convergence classes of Collatz
function' . . . . . . . . . . . . . . . 135--141
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Paul C. Attie Finite-state concurrent programs can be
expressed in pairwise normal form . . . 1--31
Bruno Courcelle and
Ir\`ene Durand Computations by fly-automata beyond
monadic second-order logic . . . . . . . 32--67
Artur Jez and
Alexander Okhotin Least and greatest solutions of
equations over sets of integers . . . . 68--86
Krzysztof Ziemia\'nski On execution spaces of PV-programs . . . 87--98
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Sanjay Jain and
Rémi Munos and
Frank Stephan and
Thomas Zeugmann Guest Editors' foreword [Preface to the
special issue dedicated to the 24th
International Conference on Algorithmic
Learning Theory (ALT 2013)] . . . . . . 1--3
Jara Uitto and
Roger Wattenhofer On competitive recommendations . . . . . 4--14
Ziyuan Gao and
Frank Stephan and
Sandra Zilles Partial learning of recursively
enumerable languages . . . . . . . . . . 15--32
John Case and
Timo Kötzing Topological separations in inductive
inference . . . . . . . . . . . . . . . 33--45
Chihiro Shibata and
Ryo Yoshinaka Probabilistic learnability of
context-free grammars with basic
distributional properties from positive
examples . . . . . . . . . . . . . . . . 46--72
Malte Darnstädt and
Thorsten Kiss and
Hans Ulrich Simon and
Sandra Zilles Order compression schemes . . . . . . . 73--90
Anna Choromanska and
Krzysztof Choromanski and
Geetha Jagannathan and
Claire Monteleoni Differentially-private learning of low
dimensional manifolds . . . . . . . . . 91--104
Lee-Ad Gottlieb and
Aryeh Kontorovich and
Robert Krauthgamer Adaptive metric dimensionality reduction 105--118
Azadeh Khaleghi and
Daniil Ryabko Nonparametric multiple change point
estimation in highly dependent time
series . . . . . . . . . . . . . . . . . 119--133
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Pierre Leone and
Kasun Samarasinghe Geographic routing on Virtual Raw Anchor
Coordinate systems . . . . . . . . . . . 1--13
Djamal Belazzougui Optimal Las Vegas reduction from one-way
set reconciliation to error correction 14--21
Didem Gözüpek and
Hadas Shachnai and
Mordechai Shalom and
Shmuel Zaks Constructing minimum changeover cost
arborescenses in bounded treewidth
graphs . . . . . . . . . . . . . . . . . 22--36
Fatemeh Keshavarz-Kohjerdi and
Alireza Bagheri Hamiltonian paths in L-shaped grid
graphs . . . . . . . . . . . . . . . . . 37--56
P. Flocchini and
N. Santoro and
G. Viglietta and
M. Yamashita Rendezvous with constant memory . . . . 57--72
Yu-Hsuan Su and
Ching-Chi Lin and
D. T. Lee Broadcasting in weighted trees under the
postal model . . . . . . . . . . . . . . 73--81
Xingwu Liu and
Shang-Hua Teng Maximum bipartite matchings with low
rank data: Locality and perturbation
analysis . . . . . . . . . . . . . . . . 82--91
Dariusz Dereniowski and
Andrzej Pelc Topology recognition and leader election
in colored networks . . . . . . . . . . 92--102
Lianzhi Fu Improvements in the analysis of Kannan's
CVP algorithm . . . . . . . . . . . . . 103--112
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Ran Ben-Basat and
Ariel Gabizon and
Meirav Zehavi The $k$-distinct language: Parameterized
automata constructions . . . . . . . . . 1--15
Sofia Belikovetsky and
Tami Tamir Load rebalancing games in dynamic
systems with migration costs . . . . . . 16--33
Takaaki Mizuki Card-based protocols for securely
computing the conjunction of multiple
variables . . . . . . . . . . . . . . . 34--44
Youjun Chen and
Lingfa Lu and
Jinjiang Yuan Two-stage scheduling on identical
machines with assignable delivery times
to minimize the maximum delivery
completion time . . . . . . . . . . . . 45--65
Valentin Garnero and
Mathias Weller Parameterized certificate dispersal and
its variants . . . . . . . . . . . . . . 66--78
Yongjie Yang and
Jiong Guo Exact algorithms for weighted and
unweighted Borda manipulation problems 79--89
Cristina Bazgan and
Robert Bredereck and
Sepp Hartung and
André Nichterlein and
Gerhard J. Woeginger Finding large degree-anonymous subgraphs
is hard . . . . . . . . . . . . . . . . 90--110
M. Fuchs and
C.-K. Lee and
G.-R. Yu On $2$-protected nodes in random digital
trees . . . . . . . . . . . . . . . . . 111--122
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Lila Kari Editorial . . . . . . . . . . . . . . . 1
Felipe García-Ramos Limit behaviour of $ \mu
$-equicontinuous cellular automata . . . 2--14
Robert J. Colvin Modelling and analysing neural networks
using a hybrid process algebra . . . . . 15--64
Petr Sosík and
Miroslav Langer Small (purely) catalytic P systems
simulating register machines . . . . . . 65--74
Lvzhou Li and
Daowen Qiu Lower bounds on the size of semi-quantum
finite automata . . . . . . . . . . . . 75--82
Linqiang Pan and
Gheorghe Paun and
Bosheng Song Flat maximal parallelism in P systems
with promoters . . . . . . . . . . . . . 83--91
Bogdan Aman and
Gabriel Ciobanu Modelling and verification of weighted
spiking neural systems . . . . . . . . . 92--102
Sepinoud Azimi and
Cristian Gratie and
Sergiu Ivanov and
Luca Manzoni and
Ion Petre and
Antonio E. Porreca Complexity of model checking for
reaction systems . . . . . . . . . . . . 103--113
Roberto Barbuti and
Roberta Gori and
Francesca Levi and
Paolo Milazzo Investigating dynamic causalities in
reaction systems . . . . . . . . . . . . 114--145
Xu Chen and
Mario J. Pérez-Jiménez and
Luis Valencia-Cabrera and
Beizhan Wang and
Xiangxiang Zeng Computing with viruses . . . . . . . . . 146--159
Michael Hellwig and
Hans-Georg Beyer Mutation strength control via meta
evolution strategies on the ellipsoid
model . . . . . . . . . . . . . . . . . 160--179
Tingfang Wu and
Zhiqiang Zhang and
Gheorghe Paun and
Linqiang Pan Cell-like spiking neural P systems . . . 180--189
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Andrea Frosini and
Simone Rinaldi Advances in Discrete Geometry for
Computer Imagery: Preface . . . . . . . 1
Henri-Alex Esbelin and
Rémy Malgouyres Sparse convolution-based digital
derivatives, fast estimation for noisy
signals and approximation results . . . 2--24
Nilanjana Karmakar and
Arindam Biswas and
Partha Bhowmick Reeb graph based segmentation of
articulated components of $3$D digital
objects . . . . . . . . . . . . . . . . 25--40
Yan Gerard and
Antoine Vacavant and
Jean-Marie Favreau Tight bounds in the quadtree complexity
theorem and the maximal number of pixels
crossed by a curve of given length . . . 41--55
Ranita Biswas and
Partha Bhowmick From prima quadraginta octant to lattice
sphere through primitive integer
operations . . . . . . . . . . . . . . . 56--72
Jacques-Olivier Lachaud and
Xavier Provençal and
Tristan Roussillon An output-sensitive algorithm to compute
the normal vector of a digital plane . . 73--88
S. Brunetti and
P. Dulio and
C. Peri On bounded additivity in discrete
tomography . . . . . . . . . . . . . . . 89--100
Eric Domenjoud and
Xavier Provençal and
Laurent Vuillon Palindromic language of thin discrete
planes . . . . . . . . . . . . . . . . . 101--108
Andrea Frosini and
Veronica Guerrini and
Simone Rinaldi Geometric properties of matrices induced
by pattern avoidance . . . . . . . . . . 109--120
Alexandre Blondin Massé and
Srecko Brlek and
Hugo Tremblay Efficient operations on discrete paths 121--135
Stefano Brocchi and
Paolo Dulio and
Silvia M. C. Pagani Reconstruction of convex polyominoes
with a blocking component . . . . . . . 136--146
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Graeme Gange and
Jorge A. Navas and
Peter Schachte and
Harald Sòndergaard and
Peter J. Stuckey A complete refinement procedure for
regular separability of context-free
languages . . . . . . . . . . . . . . . 1--24
Ivan Lanese and
Claudio Antares Mezzina and
Jean-Bernard Stefani Reversibility in the higher-order $ \pi
$-calculus . . . . . . . . . . . . . . . 25--84
Massimo Benerecetti and
Adriano Peron Timed recursive state machines:
Expressiveness and complexity . . . . . 85--124
Federico Aschieri and
Margherita Zorzi On natural deduction in classical
first-order logic: Curry--Howard
correspondence, strong normalization and
Herbrand's theorem . . . . . . . . . . . 125--146
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Olivier Hudry and
Antoine Lobstein More results on the complexity of
identifying problems in graphs . . . . . 1--12
Michel de Rougemont and
Adrien Vieilleribi\`ere Approximate consistency for
transformations on words and trees . . . 13--39
Alain Cournier and
Ajoy K. Datta and
Stéphane Devismes and
Franck Petit and
Vincent Villain The expressive power of
snap-stabilization . . . . . . . . . . . 40--66
Amaury Pouly and
Daniel S. Graça Computational complexity of solving
polynomial differential equations over
unbounded domains . . . . . . . . . . . 67--82
Sanjay Jain and
Bakhadyr Khoussainov and
Philipp Schlicht and
Frank Stephan Tree-automatic scattered linear orders 83--96
Manuel Radons Direct solution of piecewise linear
systems . . . . . . . . . . . . . . . . 97--109
Ajoy K. Datta and
Stéphane Devismes and
Karel Heurtefeux and
Lawrence L. Larmore and
Yvan Rivierre Competitive self-stabilizing
$k$-clustering . . . . . . . . . . . . . 110--133
Alexander Reich Complexity of the maximum leaf spanning
tree problem on planar and regular
graphs . . . . . . . . . . . . . . . . . 134--143
Jun Yuan and
Aixia Liu and
Xiao Qin and
Jifu Zhang and
Jing Li $g$-Good-neighbor conditional
diagnosability measures for $3$-ary
$n$-cube networks . . . . . . . . . . . 144--162
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Christian Glacet and
Nicolas Hanusse and
David Ilcinkas The impact of dynamic events on the
number of errors in networks . . . . . . 1--12
Boaz Ben-Moshe and
Michael Elkin and
Lee-Ad Gottlieb and
Eran Omri Optimizing budget allocation for center
and median points . . . . . . . . . . . 13--25
Xian Qiu and
Walter Kern Approximate core allocations and
integrality gap for the bin packing game 26--35
Rong-Xia Hao and
Zeng-Xian Tian and
Jun-Ming Xu Relationship between conditional
diagnosability and $2$-extra
connectivity of symmetric graphs . . . . 36--53
Katja Losemann and
Wim Martens and
Matthias Niewerth Closure properties and descriptional
complexity of deterministic regular
expressions . . . . . . . . . . . . . . 54--70
Oscar H. Ibarra and
Ian McQuillan The effect of end-markers on counter
machines and commutativity . . . . . . . 71--81
Da-Wei Yang and
Mei-Mei Gu Conditional fault-tolerant
edge-bipancyclicity of hypercubes with
faulty vertices and edges . . . . . . . 82--89
Éric Sopena $i$-Mark: a new subtraction division
game . . . . . . . . . . . . . . . . . . 90--101
Che-Nan Kuo and
Iain A. Stewart Edge-pancyclicity and
edge-bipancyclicity of faulty folded
hypercubes . . . . . . . . . . . . . . . 102--106
William B. Kinnersley and
Pawe\l Pralat and
Douglas B. West To catch a falling robber . . . . . . . 107--111
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Eric Angel and
Evripidis Bampis and
Vincent Chau and
Nguyen Kim Thang Throughput maximization in
multiprocessor speed-scaling . . . . . . 1--12
William Chung-Kung Yen Weighted restrained domination in
subclasses of planar graphs . . . . . . 13--25
Monther Busbait and
Mikhail Moshkov Diagnosis of three types of constant
faults in read-once contact networks
over finite bases . . . . . . . . . . . 26--42
Stefan Hoffmann and
Alina Elterman and
Egon Wanke A linear time algorithm for metric
dimension of cactus block graphs . . . . 43--62
Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch Enumerating minimal connected dominating
sets in graphs of bounded chordality . . 63--75
Qi Wang and
Xiubin Fan and
Hongyan Zang and
Yu Wang The Space Complexity Analysis in the
General Number Field Sieve Integer
Factorization . . . . . . . . . . . . . 76--94
Yusuke Sakai and
Keita Emura and
Jacob C. N. Schuldt and
Goichiro Hanaoka and
Kazuo Ohta Constructions of dynamic and non-dynamic
threshold public-key encryption schemes
with decryption consistency . . . . . . 95--116
Dachuan Xu and
Fengmin Wang and
Donglei Du and
Chenchen Wu Approximation algorithms for submodular
vertex cover problems with
linear/submodular penalties using
primal-dual technique . . . . . . . . . 117--125
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Zuzana Haniková and
Petr Savický Term satisfiability in FL$_{\rm
ew}$-algebras . . . . . . . . . . . . . 1--15
Franck Cassez and
Ron van der Meyden and
Chenyi Zhang The complexity of synchronous notions of
information flow security . . . . . . . 16--42
Pietro Ferrara A generic framework for heap and value
analyses of object-oriented programming
languages . . . . . . . . . . . . . . . 43--72
Mahmudul Faisal Al Ameen and
Makoto Tatsuta Completeness for recursive procedures in
separation logic . . . . . . . . . . . . 73--96
Thomas Kahl Topological abstraction of
higher-dimensional automata . . . . . . 97--117
Laura Bozzelli and
César Sánchez Foundations of Boolean stream runtime
verification . . . . . . . . . . . . . . 118--138
Vojtech Forejt and
Marta Kwiatkowska and
Gethin Norman and
Ashutosh Trivedi Expected reachability-time games . . . . 139--160
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Lila Kari Editorial . . . . . . . . . . . . . . . 1
Marta Kwiatkowska and
Andrew Phillips and
Chris Thachuk Preface . . . . . . . . . . . . . . . . 2--3
Masami Hagiya and
Nathanael Aubert-Kato and
Shaoyu Wang and
Satoshi Kobayashi Molecular computers for molecular robots
as hybrid systems . . . . . . . . . . . 4--20
Matthew R. Lakin and
Darko Stefanovic and
Andrew Phillips Modular verification of chemical
reaction network encodings via
serializability analysis . . . . . . . . 21--42
Rasmus L. Petersen and
Matthew R. Lakin and
Andrew Phillips A strand graph semantics for DNA-based
computation . . . . . . . . . . . . . . 43--73
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Lila Kari Editorial . . . . . . . . . . . . . . . 1
Hava T. Siegelmann Preface . . . . . . . . . . . . . . . . 2--3
Matthew Alden and
Risto Miikkulainen MARLEDA: Effective distribution
estimation through Markov random fields 4--18
Nick Cheney and
Hod Lipson Topological evolution for embodied
cellular automata . . . . . . . . . . . 19--27
Kyle I. S. Harrington A circuit basis for morphogenesis . . . 28--36
Yongseok Yoo and
O. Ozan Koyluoglu and
Sriram Vishwanath and
Ila Fiete Multi-periodic neural coding for
adaptive information transfer . . . . . 37--53
Robert Kozma and
Marko Puljic Pattern-based computing via sequential
phase transitions in hierarchical mean
field neuropercolation . . . . . . . . . 54--70
Craig Schindewolf and
Dongwook Kim and
Andrea Bel and
Horacio G. Rotstein Complex patterns in networks of
hyperexcitable neurons . . . . . . . . . 71--82
Alessandro Betti and
Marco Gori The principle of least cognitive action 83--99
A. Rodriguez and
R. Granger The grammar of mammalian brain capacity 100--111
Fabio Anselmi and
Joel Z. Leibo and
Lorenzo Rosasco and
Jim Mutch and
Andrea Tacchetti and
Tomaso Poggio Unsupervised learning of invariant
representations . . . . . . . . . . . . 112--121
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Othon Michail and
Paul G. Spirakis Traveling salesman problems in temporal
graphs . . . . . . . . . . . . . . . . . 1--23
Jung-Heum Park Paired many-to-many disjoint path covers
in restricted hypercube-like graphs . . 24--34
Leslie Ann Goldberg and
Mark Jerrum The complexity of counting locally
maximal satisfying assignments of
Boolean CSPs . . . . . . . . . . . . . . 35--46
Wenbin Chen and
Hao Lei and
Ke Qi Lattice-based linearly homomorphic
signatures in the standard model . . . . 47--54
Anup Bhattacharya and
Ragesh Jaiswal and
Nir Ailon Tight lower bound instances for
$k$-means++ in two dimensions . . . . . 55--66
Marios Mavronicolas and
Burkhard Monien The complexity of equilibria for
risk-modeling valuations . . . . . . . . 67--96
Cheng-Kuan Lin and
Lili Zhang and
Jianxi Fan and
Dajin Wang Structure connectivity and substructure
connectivity of hypercubes . . . . . . . 97--107
Tsunehiko Kameda and
Ichiro Suzuki and
Masafumi Yamashita An alternative proof for the equivalence
of $ \infty $-searcher and $2$-searcher 108--119
Payam Khanteimouri and
Ali Mohades and
Mohammad Ali Abam and
Mohammad Reza Kazemi Efficiently approximating color-spanning
balls . . . . . . . . . . . . . . . . . 120--126
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Qichao Wang and
Friedrich Otto Weighted restarting automata and
pushdown relations . . . . . . . . . . . 1--15
Gabriele Fici and
Alessio Langiu and
Thierry Lecroq and
Arnaud Lefebvre and
Filippo Mignosi and
Jarkko Peltomäki and
Élise Prieur-Gaston Abelian powers and repetitions in
Sturmian words . . . . . . . . . . . . . 16--34
Jason Rute When does randomness come from
randomness? . . . . . . . . . . . . . . 35--50
Marilena Barnabei and
Flavio Bonetti and
Niccol\`o Castronuovo and
Robert Cori Some permutations on Dyck words . . . . 51--63
Xiaomin Hu and
Yingzhi Tian and
Xiaodong Liang and
Jixiang Meng Strong matching preclusion for
$n$-dimensional torus networks . . . . . 64--73
Mitre Costa Dourado Computing role assignments of split
graphs . . . . . . . . . . . . . . . . . 74--84
Yong He and
Zhenhe Cui and
Zihan Yuan Conjugacy relations of prefix codes . . 85--93
Moshe Lewenstein and
J. Ian Munro and
Yakov Nekrich and
Sharma V. Thankachan Document retrieval with one wildcard . . 94--101
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Franz J. Brandenburg and
Walter Didimo and
William S. Evans and
Philipp Kindermann and
Giuseppe Liotta and
Fabrizio Montecchiani Recognizing and drawing IC-planar graphs 1--16
Shlomi Dolev and
Ephraim Korach and
Ximing Li and
Yin Li and
Galit Uzan Magnifying computing gaps: Establishing
encrypted communication over
unidirectional channels . . . . . . . . 17--26
Paolo Serafino and
Carmine Ventre Heterogeneous facility location without
money . . . . . . . . . . . . . . . . . 27--46
Emilio Di Giacomo and
Giuseppe Liotta and
Tamara Mchedlidze Lower and upper bounds for long induced
paths in $3$-connected planar graphs . . 47--55
Dmitry Kosolobov Finding the leftmost critical
factorization on unordered alphabet . . 56--65
Franz J. Brandenburg and
Andreas Gleißner Ranking chain sum orders . . . . . . . . 66--76
Marina Groshaus and
Leandro Montero Tight lower bounds on the number of
bicliques in false-twin-free graphs . . 77--84
J. Bang-Jensen and
Frédéric Havet Finding good $2$-partitions of digraphs
I. Hereditary properties . . . . . . . . 85--94
Helmut Prodinger Batcher's odd-even exchange revisited: a
generating functions approach . . . . . 95--100
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Pierre Chambart and
Alain Finkel and
Sylvain Schmitz Forward analysis and model checking for
trace bounded WSTS . . . . . . . . . . . 1--29
Jean-René Courtault and
Didier Galmiche and
David Pym A logic of separating modalities . . . . 30--58
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Gary Benson and
Martin Farach-Colton and
Moshe Lewenstein and
Ely Porat Special issue in honor of the 60th
birthday of Amihood Amir . . . . . . . . 1--2
Ariel Shiftan and
Ely Porat Set Intersection and Sequence Matching
with mismatch counting . . . . . . . . . 3--10
G. Benson and
A. Levy and
S. Maimoni and
D. Noifeld and
B. R. Shalom LCSk: a refined similarity measure . . . 11--26
Ayelet Butman and
Noa Lewenstein and
J. Ian Munro Permuted scaled matching . . . . . . . . 27--32
Gerth Stòlting Brodal and
Pooya Davoodi and
Moshe Lewenstein and
Rajeev Raman and
Srinivasa Rao Satti Two dimensional range minimum queries
and Fibonacci lattices . . . . . . . . . 33--43
Tsvi Kopelowitz The property suffix tree with dynamic
properties . . . . . . . . . . . . . . . 44--51
Shmuel T. Klein and
Dana Shapira Compressed matching for feature vectors 52--62
Richard Beigel and
William Gasarch On the sizes of DPDAs, PDAs, LBAs . . . 63--75
Alberto Apostolico and
Concettina Guerra and
Gad M. Landau and
Cinzia Pizzi Sequence similarity measures based on
bounded Hamming distance . . . . . . . . 76--90
J. Ian Munro and
Yakov Nekrich and
Jeffrey S. Vitter Fast construction of wavelet trees . . . 91--97
Philip Bille and
Pawe\l Gawrychowski and
Inge Li Gòrtz and
Gad M. Landau and
Oren Weimann Longest common extensions in trees . . . 98--107
Gonzalo Navarro and
Sharma V. Thankachan Reporting consecutive substring
occurrences under bounded gap
constraints . . . . . . . . . . . . . . 108--111
Maxim Babenko and
Pawe\l Gawrychowski and
Tomasz Kociumaka and
Ignat Kolesnichenko and
Tatiana Starikovskaya Computing minimal and maximal suffixes
of a substring . . . . . . . . . . . . . 112--121
Maxime Crochemore and
Costas S. Iliopoulos and
Tomasz Kociumaka and
Marcin Kubica and
Alessio Langiu and
Solon P. Pissis and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Wale\'n Order-preserving indexing . . . . . . . 122--135
Pawe\l Gawrychowski and
Przemys\law Uzna\'nski Order-preserving pattern matching with
$k$ mismatches . . . . . . . . . . . . . 136--144
Gregory Kucherov and
Kamil Salikhov and
Dekel Tsur Approximate string matching using a
bidirectional index . . . . . . . . . . 145--158
Joong Chae Na and
Hyunjoon Kim and
Heejin Park and
Thierry Lecroq and
Martine Léonard and
Laurent Mouchard and
Kunsoo Park FM-index of alignment: a compressed
index for similar strings . . . . . . . 159--170
Maxime Crochemore and
Chiara Epifanio and
Roberto Grossi and
Filippo Mignosi Linear-size suffix tries . . . . . . . . 171--178
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Richard C. Brewster and
Sean McGuinness and
Benjamin Moore and
Jonathan A. Noel A dichotomy theorem for circular
colouring reconfiguration . . . . . . . 1--13
Julio Araujo and
Frédéric Havet and
Claudia Linhares Sales and
Ana Silva Proper orientation of cacti . . . . . . 14--25
Hooman Reisi Dehkordi and
Peter Eades and
Seok-Hee Hong and
Quan Nguyen Circular right-angle crossing drawings
in linear time . . . . . . . . . . . . . 26--41
Yang Lu and
Jiguo Li Provably secure certificateless proxy
signature scheme in the standard model 42--59
Cristina G. Fernandes and
Marcio T. I. Oshiro Kinetic clustering of points on the line 60--71
David Coudert and
Guillaume Ducoffe Data center interconnection networks are
not hyperbolic . . . . . . . . . . . . . 72--90
Maik Riechert and
Christian Höner zu Siederdissen and
Peter F. Stadler Algebraic dynamic programming for
multiple context-free grammars . . . . . 91--109
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
J. Bang-Jensen and
Nathann Cohen and
Frédéric Havet Finding good $2$-partitions of digraphs
II. Enumerable properties . . . . . . . 1--19
Marek Piotrów Faster merging networks with a small
constant period . . . . . . . . . . . . 20--40
F. Blanchet-Sadri and
Daniel Seita and
David Wise Computing abelian complexity of binary
uniform morphic words . . . . . . . . . 41--51
Mitre C. Dourado and
Lucia D. Penso and
Dieter Rautenbach On the geodetic hull number of $ P_k
$-free graphs . . . . . . . . . . . . . 52--60
Minghui Jiang and
Ge Xia and
Yong Zhang Edge-disjoint packing of stars and
cycles . . . . . . . . . . . . . . . . . 61--69
Petr A. Golovach and
Daniël Paulusma and
Erik Jan van Leeuwen Induced disjoint paths in circular-arc
graphs in linear time . . . . . . . . . 70--83
Chung-Shou Liao and
Chih-Wei Liang and
Sheung Hung Poon Approximation algorithms on consistent
dynamic map labeling . . . . . . . . . . 84--93
Cs. Bujtás and
Gy. Dósa and
Cs. Imreh and
J. Nagy-György and
Zs. Tuza New models of graph-bin packing . . . . 94--103
Hyung Tae Lee and
San Ling and
Huaxiong Wang Analysis of Gong et al.'s CCA2-secure
homomorphic encryption . . . . . . . . . 104--114
Shuli Zhao and
Weihua Yang and
Shurong Zhang Component connectivity of hypercubes . . 115--118
Shuangshuang Li and
Zhao Zhang and
Hong-Jian Lai Algorithm for constraint partial inverse
matroid problem with weight increase
forbidden . . . . . . . . . . . . . . . 119--124
Hong Jie Song and
Wen Hua Pan and
Xiang Nan Gong and
Chang Qing Xu A note on the neighbor sum
distinguishing total coloring of planar
graphs . . . . . . . . . . . . . . . . . 125--129
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Lila Kari Editorial . . . . . . . . . . . . . . . 1
Pierre-Étienne Meunier Unraveling simplicity in elementary
cellular automata . . . . . . . . . . . 2--10
Cristian Gratie and
Ion Petre Complete characterization for the
fit-preserving data refinement of
mass-action reaction networks . . . . . 11--24
C. Olarte and
D. Chiarugi and
M. Falaschi and
D. Hermith A proof theoretic view of spatial and
temporal dependencies in biochemical
systems . . . . . . . . . . . . . . . . 25--42
Bosheng Song and
Linqiang Pan The computational power of tissue-like
$P$ systems with promoters . . . . . . . 43--52
Marisol B. Correia New insights on neutral binary
representations for evolutionary
optimization . . . . . . . . . . . . . . 53--74
Jian-Ding Tan and
Mahidzal Dahari and
Siaw-Paw Koh and
Ying-Ying Koay and
Issa-Ahmed Abed An improved electromagnetism-like
algorithm for numerical optimization . . 75--84
Zhiqiang Zhang and
Tingfang Wu and
Andrei Paun and
Linqiang Pan Numerical $P$ systems with migrating
variables . . . . . . . . . . . . . . . 85--108
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Eva M. Navarro-López and
Rebekah Carter Deadness and how to disprove liveness in
hybrid dynamical systems . . . . . . . . 1--23
Ferenc Bujtor and
Sascha Fendrich and
Gerald Lüttgen and
Walter Vogler Nondeterministic Modal Interfaces . . . 24--53
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Jason Jaskolka and
Ridha Khedri Mitigating covert channels based on
analysis of the potential for
communication . . . . . . . . . . . . . 1--37
Matteo Rossi and
Dino Mandrioli and
Angelo Morzenti and
Luca Ferrucci A temporal logic for micro- and
macro-step-based real-time systems:
Foundations and applications . . . . . . 38--64
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
H. Jaap van den Herik and
Walter A. Kosters and
Aske Plaat Recent Advances in Computer Games . . . 1
Édouard Bonnet and
Florian Jamain and
Abdallah Saffidine On the complexity of connection games 2--28
Cameron Browne Algorithms for interactive Sprouts . . . 29--42
Tristan Cazenave Playout policy adaptation with move
features . . . . . . . . . . . . . . . . 43--52
Tobias Graf and
Marco Platzner Adaptive playouts for online learning of
policies during Monte Carlo Tree Search 53--62
Chu-Hsuan Hsueh and
I-Chen Wu and
Wen-Jie Tseng and
Shi-Jim Yen and
Jr-Chang Chen An analysis for strength improvement of
an MCTS-based program playing Chinese
dark chess . . . . . . . . . . . . . . . 63--75
Vito Janko and
Matej Guid A program for Progressive chess . . . . 76--91
Yun-Ching Liu and
Yoshimasa Tsuruoka Modification of improved upper
confidence bounds for regulating
exploration in Monte-Carlo tree search 92--105
Richard Lorentz Using evaluation functions in
Monte-Carlo Tree Search . . . . . . . . 106--113
Yusaku Mandai and
Tomoyuki Kaneko LinUCB applied to Monte Carlo tree
search . . . . . . . . . . . . . . . . . 114--126
Jakub Pawlewicz and
Ryan B. Hayward Conspiracy number search with relative
sibling scores . . . . . . . . . . . . . 127--142
Jos W. H. M. Uiterwijk Polymerization and crystallization of
Snowflake molecules in Domineering . . . 143--158
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Beno\^\it Libert and
Marc Joye and
Moti Yung Born and raised distributively: Fully
distributed non-interactive
adaptively-secure threshold signatures
with short shares . . . . . . . . . . . 1--24
Marthe Bonamy and
\Lukasz Kowalik A $ 13 k$-kernel for planar feedback
vertex set via region decomposition . . 25--40
Nir Halman A deterministic fully polynomial time
approximation scheme for counting
integer knapsack solutions made easy . . 41--47
G. Konstantinidis and
Ath. Kehagias Simultaneously moving cops and robbers 48--59
Frank Kammer and
Torsten Tholey Approximate tree decompositions of
planar graphs in linear time . . . . . . 60--90
Jia Guo and
Mei Lu The extra connectivity of bubble-sort
star graphs . . . . . . . . . . . . . . 91--99
William S. Evans and
Giuseppe Liotta and
Fabrizio Montecchiani Simultaneous visibility representations
of plane $ s t $-graphs using L-shapes 100--111
Reinhard Bauer and
Tobias Columbus and
Ignaz Rutter and
Dorothea Wagner Search-space size in contraction
hierarchies . . . . . . . . . . . . . . 112--127
Lo\"\ic Mazo and
Étienne Baudrier Non-local estimators: a new class of
multigrid convergent length estimators 128--146
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Steven Kelk and
Mareike Fischer and
Vincent Moulton and
Taoyang Wu Reduction rules for the maximum
parsimony distance on phylogenetic trees 1--15
Stefano Beretta and
Mauro Castelli and
Riccardo Dondi Parameterized tractability of the
maximum-duo preservation string mapping
problem . . . . . . . . . . . . . . . . 16--25
Guy Avni and
Tami Tamir Cost-sharing scheduling games on
restricted unrelated machines . . . . . 26--39
Imed Kacem and
Hans Kellerer Semi-online scheduling on a single
machine with unexpected breakdown . . . 40--48
Nhan Bao Ho Three-pile Sharing Nim and the quadratic
time winning strategy . . . . . . . . . 49--60
James Harland Busy beaver machines and the observant
otter heuristic (or how to tame dreadful
dragons) . . . . . . . . . . . . . . . . 61--85
Christian Glaßer and
Heinz Schmitz and
Victor Selivanov Efficient algorithms for membership in
boolean hierarchies of regular languages 86--108
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Yangjun Chen and
Weixin Shen An efficient method to evaluate
intersections on big data sets . . . . . 1--21
Ferdinando Cicalese and
Balázs Keszegh and
Bernard Lidický and
Dömötör Pálvölgyi and
Tomás Valla On the tree search problem with
non-uniform costs . . . . . . . . . . . 22--32
Aistis Atminas and
Marcin Kami\'nski and
Jean-Florent Raymond Scattered packings of cycles . . . . . . 33--42
Manuel Vázquez de Parga and
Pedro García and
Damián López Minimal consistent DFA revisited . . . . 43--49
Lin Xiao A new design formula exploited for
accelerating Zhang neural network and
its application to time-varying matrix
inversion . . . . . . . . . . . . . . . 50--58
Amr Elmasry and
Meng He and
J. Ian Munro and
Patrick K. Nicholson Dynamic range majority data structures 59--73
Djamal Belazzougui and
Roman Kolpakov and
Mathieu Raffinot Indexing and querying color sets of
images . . . . . . . . . . . . . . . . . 74--84
L'ubomíra Balková and
Michelangelo Bucci and
Alessandro De Luca and
Ji\vrí Hladký and
Svetlana Puzynina Aperiodic pseudorandom number generators
based on infinite words . . . . . . . . 85--100
André L. Vignatti and
Murilo V. G. da Silva Minimum vertex cover in generalized
random graphs with power law degree
distribution . . . . . . . . . . . . . . 101--111
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Bostjan Bresar and
Paul Dorbec and
Sandi Klavzar and
Gasper Kosmrlj and
Gabriel Renault Complexity of the game domination
problem . . . . . . . . . . . . . . . . 1--7
Paolo Boldi and
Sebastiano Vigna Efficient optimally lazy algorithms for
minimal-interval semantics . . . . . . . 8--25
Van Bang Le and
Andrea Oversberg and
Oliver Schaudt A unified approach to recognize squares
of split graphs . . . . . . . . . . . . 26--33
Tridib Dutta and
Lenwood S. Heath and
V. S. Anil Kumar and
Madhav V. Marathe Labeled cuts in graphs . . . . . . . . . 34--39
Meirav Zehavi Parameterized approximation algorithms
for packing problems . . . . . . . . . . 40--55
Carme \`Alvarez and
Maria J. Blesa and
Amalia Duch and
Arnau Messegué and
Maria Serna Celebrity games . . . . . . . . . . . . 56--71
Peng Zhang and
Bin Fu The label cut problem with respect to
path length and label frequency . . . . 72--83
Tomasz Kociumaka and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Wale\'n Maximum number of distinct and
nonequivalent nonstandard squares in a
word . . . . . . . . . . . . . . . . . . 84--95
Diodato Ferraioli and
Paul W. Goldberg and
Carmine Ventre Decentralized dynamics for finite
opinion games . . . . . . . . . . . . . 96--115
Guy Feigenblat and
Ofra Itzhaki and
Ely Porat Corrigendum to ``The frequent items
problem, under polynomial decay, in the
streaming model'' [Theoret. Comput. Sci.
\bf 411(34-36) (2010) 3048--3054] . . . 116
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Cyrille Jegourel and
Axel Legay and
Sean Sedwards Command-based importance sampling for
statistical model checking . . . . . . . 1--24
Flavio Ferrarotti and
Klaus-Dieter Schewe and
Loredana Tec and
Qing Wang A new thesis concerning synchronised
parallel computing --- simplified
parallel ASM thesis . . . . . . . . . . 25--53
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Peter Auer and
Alexander Clark and
Thomas Zeugmann Guest Editors' foreword . . . . . . . . 1--3
Timo Kötzing and
Raphaela Palenta A map of update constraints in inductive
inference . . . . . . . . . . . . . . . 4--24
Sanjay Jain and
Efim Kinber Parallel learning of automatic classes
of languages . . . . . . . . . . . . . . 25--44
Hasan Abasi and
Ali Z. Abdi and
Nader H. Bshouty Learning boolean halfspaces with small
weights from membership queries . . . . 45--56
Dana Angluin and
Dana Fisman Learning regular omega languages . . . . 57--72
Marcus Hutter Extreme state aggregation beyond Markov
decision processes . . . . . . . . . . . 73--91
Nir Ailon and
Kohei Hatano and
Eiji Takimoto Bandit online optimization over the
permutahedron . . . . . . . . . . . . . 92--108
Andreas Maurer A chain rule for the expected suprema of
Gaussian processes . . . . . . . . . . . 109--122
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Michael Elkin and
Ofer Neiman and
Christian Wulff-Nilsen Space-efficient path-reporting
approximate distance oracles . . . . . . 1--10
Paolo D'Arco and
Roberto De Prisco Secure computation without computers . . 11--36
Arash Haddadan and
Takehiro Ito and
Amer E. Mouawad and
Naomi Nishimura and
Hirotaka Ono and
Akira Suzuki and
Youcef Tebbal The complexity of dominating set
reconfiguration . . . . . . . . . . . . 37--49
Klaus Wehmuth and
Éric Fleury and
Artur Ziviani On MultiAspect graphs . . . . . . . . . 50--61
Danny Hermelin and
Moshe Kaspi and
Christian Komusiewicz and
Barak Navon Parameterized complexity of critical
node cuts . . . . . . . . . . . . . . . 62--75
Xingchao Deng and
Hengzhe Li and
Guiying Yan Algorithm on rainbow connection for
maximal outerplanar graphs . . . . . . . 76--86
Kung-Jui Pai and
Jou-Ming Chang and
Jinn-Shyong Yang and
Ro-Yu Wu Corrigendum to ``Incidence coloring on
hypercubes'' [Theoret. Comput. Sci. \bf
557 (2014) 59--65] . . . . . . . . . . . 87--88
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Qian Cao and
Zhaohui Liu Semi-online scheduling with bounded job
sizes on two uniform machines . . . . . 1--17
Kai He and
Jian Weng and
Robert H. Deng and
Joseph K. Liu On the security of two identity-based
conditional proxy re-encryption schemes 18--27
Kung-Jui Pai and
Jou-Ming Chang Constructing two completely independent
spanning trees in hypercube-variant
networks . . . . . . . . . . . . . . . . 28--37
T. Karthick Structure of squares and efficient
domination in graph classes . . . . . . 38--46
Paul C. Bell and
Shang Chen and
Lisa Jackson On the decidability and complexity of
problems for restricted hierarchical
hybrid systems . . . . . . . . . . . . . 47--63
Harry Altman Integer complexity: Representing numbers
of bounded defect . . . . . . . . . . . 64--85
Davide Bil\`o and
Luciano Gual\`a and
Stefano Leucci and
Guido Proietti Exact and approximate algorithms for
movement problems on (special classes
of) graphs . . . . . . . . . . . . . . . 86--101
Daniel Berend and
Aryeh Kontorovich The state complexity of random DFAs . . 102--108
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Ismael González Yero and
Marko Jakovac and
Dorota Kuziak The security number of strong grid-like
graphs . . . . . . . . . . . . . . . . . 1--14
Katarína Cechlárová and
Tamás Fleiner and
David F. Manlove and
Iain McBride Stable matchings of teachers to schools 15--25
Claude Sureson $ \Pi^1_1$--Martin-Löf random reals as
measures of natural open sets . . . . . 26--41
Peter Damaschke Deterministic versus randomized adaptive
test cover . . . . . . . . . . . . . . . 42--52
Özgür Dagdelen and
Payman Mohassel and
Daniele Venturi Rate-limited secure function evaluation 53--78
Xiang-Jun Li and
Qi-Qi Dong and
Zheng Yan and
Jun-Ming Xu Embedded connectivity of recursive
networks . . . . . . . . . . . . . . . . 79--86
Tom Bourne and
Nik Ruskuc On the star-height of subword counting
languages and their relationship to Rees
zero-matrix semigroups . . . . . . . . . 87--96
Rogério Reis and
Emanuele Rodaro Ideal regular languages and strongly
connected synchronizing automata . . . . 97--107
Stefano Beretta and
Mauro Castelli and
Riccardo Dondi Corrigendum to ``Parameterized
tractability of the maximum-duo
preservation string mapping problem''
[Theoret. Comput. Sci. \bf 646 (2016)
16--25] . . . . . . . . . . . . . . . . 108--110
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Dachuan Xu and
Donglei Du and
Ding-Zhu Du Editorial for Computing and
Combinatorics Conference . . . . . . . . 1
Ruiwen Chen and
Valentine Kabanets Correlation bounds and #SAT algorithms
for small linear-size circuits . . . . . 2--10
Nan Zhang and
Zhenhua Duan and
Cong Tian A mechanism of function calls in MSVL 11--25
Dayu He and
Xin He Nearly optimal monotone drawing of trees 26--32
Zhe Dang and
Thomas R. Fischer and
William J. Hutton III and
Oscar H. Ibarra and
Qin Li Quantifying communication in
synchronized languages . . . . . . . . . 33--44
Wei Yu and
Zhaohui Liu Improved approximation algorithms for
some min-max and minimum cycle cover
problems . . . . . . . . . . . . . . . . 45--58
Jens Maßberg Embedding rectilinear Steiner trees with
length restrictions . . . . . . . . . . 59--69
S. M. Meesum and
Pranabendu Misra and
Saket Saurabh Reducing rank of the adjacency matrix by
graph modification . . . . . . . . . . . 70--79
Seungbum Jo and
Srinivasa Rao Satti Simultaneous encodings for range and
next/previous larger/smaller value
queries . . . . . . . . . . . . . . . . 80--91
Sourav Chakraborty and
Raghav Kulkarni and
Satyanarayana V. Lokam and
Nitin Saurabh Upper bounds on Fourier entropy . . . . 92--112
Shenghui Su and
Shuwang Lü and
Maozhi Xu and
Tao Xie A semantically secure public key
cryptoscheme using bit-pair shadows . . 113--127
Shenghui Su and
Tao Xie and
Shuwang Lü A provably secure non-iterative hash
function resisting birthday attack . . . 128--142
Kevin Balas and
Csaba D. Tóth On the number of anchored rectangle
packings for a planar point set . . . . 143--154
Takeaki Uno and
Yushi Uno Mining preserving structures in a graph
sequence . . . . . . . . . . . . . . . . 155--163
Yin Wang and
Yinfeng Xu The approximation algorithms for a class
of multiple-choice problem . . . . . . . 164--174
Kameng Nip and
Zhenbo Wang and
Wenxun Xing A study on several combination problems
of classic shop scheduling and shortest
path . . . . . . . . . . . . . . . . . . 175--187
Deshi Ye and
Guochuan Zhang Approximate composable truthful
mechanism design . . . . . . . . . . . . 188--198
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Fedor V. Fomin and
Pierre Fraigniaud and
Nicolas Nisse and
Dimitrios M. Thilikos Forewords: Special issue on Theory and
Applications of Graph Searching Problems 1
Anthony Bonato and
Dieter Mitsche and
Xavier Pérez-Giménez and
Pawe\l Pralat A probabilistic version of the game of
Zombies and Survivors on graphs . . . . 2--14
Klaus-Tycho Foerster and
Roger Wattenhofer Lower and upper competitive bounds for
online directed graph exploration . . . 15--29
Florian Lehner Pursuit evasion on infinite graphs . . . 30--40
Fabrizio Luccio and
Linda Pagli More agents may decrease global work: a
case in butterfly decontamination . . . 41--57
Bernd Puchala and
Roman Rabinovich Jumping robbers in digraphs . . . . . . 58--77
Saeed Akhoondian Amiri and
Stephan Kreutzer and
Roman Rabinovich DAG-width is PSPACE-complete . . . . . . 78--89
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Dario Carotenuto and
Aniello Murano and
Adriano Peron Ordered multi-stack visibly pushdown
automata . . . . . . . . . . . . . . . . 1--26
Xiang Fu On detecting environment sensitivity
using slicing . . . . . . . . . . . . . 27--45
Razvan Diaconescu Functorial semantics of first-order
views . . . . . . . . . . . . . . . . . 46--59
Samik Basu and
Tevfik Bultan On deciding synchronizability for
asynchronously communicating systems . . 60--75
Björn Lellmann Hypersequent rules with restricted
contexts for propositional modal logics 76--105
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Costas S. Iliopoulos and
Simon J. Pugisi Foreword . . . . . . . . . . . . . . . . 107
A. Heliou and
M. Léonard and
L. Mouchard and
M. Salson Efficient dynamic range minimum query 108--117
Jacqueline W. Daykin and
Richard Groult and
Yannick Guesnet and
Thierry Lecroq and
Arnaud Lefebvre and
Martine Léonard and
Élise Prieur-Gaston Binary block order Rouen Transform . . . 118--134
Joshimar Cordova and
Gonzalo Navarro Simple and efficient fully-functional
succinct trees . . . . . . . . . . . . . 135--145
Amihood Amir and
Alberto Apostolico and
Tirza Hirst and
Gad M. Landau and
Noa Lewenstein and
Liat Rozenberg Algorithms for Jumbled Indexing, Jumbled
Border and Jumbled Square on run-length
encoded strings . . . . . . . . . . . . 146--159
Carl Barton and
Chang Liu and
Solon P. Pissis Linear-time computation of prefix table
for weighted strings & applications . . . 160--172
Youngho Kim and
Joong Chae Na and
Heejin Park and
Jeong Seop Sim A space-efficient alphabet-independent
Four-Russians' lookup table and a
multithreaded Four-Russians' edit
distance algorithm . . . . . . . . . . . 173--179
Wojciech Rytter Two fast constructions of compact
representations of binary words with
given set of periods . . . . . . . . . . 180--187
Fatema Tuz Zohora and
M. Sohel Rahman An efficient algorithm to detect common
ancestor genes for non-overlapping
inversion and applications . . . . . . . 188--214
Tomohiro I. and
Yuto Nakashima and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda Faster Lyndon factorization algorithms
for SLP and LZ78 compressed text . . . . 215--224
Yoshiaki Matsuoka and
Takahiro Aoki and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda Generalized pattern matching and
periodicity under substring consistent
equivalence relations . . . . . . . . . 225--233
Maxime Crochemore and
Robert Mercas On the density of Lyndon roots in
factors . . . . . . . . . . . . . . . . 234--240
Golnaz Badkobeh and
Maxime Crochemore and
Manal Mohamed and
Chalita Toopsuwan Efficient computation of maximal
anti-exponent in palindrome-free strings 241--248
Jamie Simpson An abelian periodicity lemma . . . . . . 249--255
Gabriele Fici and
Tomasz Kociumaka and
Thierry Lecroq and
Arnaud Lefebvre and
Élise Prieur-Gaston Fast computation of abelian runs . . . . 256--264
Juha Kärkkäinen and
Dominik Kempa and
Marcin Pi\katkowski Tighter bounds for the sum of
irreducible LCP values . . . . . . . . . 265--278
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Usha Mohan and
Sivaramakrishnan Ramani and
Sounaka Mishra Constant factor approximation algorithm
for TSP satisfying a biased triangle
inequality . . . . . . . . . . . . . . . 111--126
Marcella Anselmo and
Dora Giammarresi and
Maria Madonia Non-expandable non-overlapping sets of
pictures . . . . . . . . . . . . . . . . 127--136
Luis A. A. Meira and
Flávio K. Miyazawa and
Lehilton L. C. Pedrosa Clustering through Continuous Facility
Location Problems . . . . . . . . . . . 137--145
Chen Fei Du and
Hamoon Mousavi and
Eric Rowland and
Luke Schaeffer and
Jeffrey Shallit Decision algorithms for
Fibonacci-automatic words, II: Related
sequences and avoidability . . . . . . . 146--162
Jia Guo and
Mei Lu Conditional diagnosability of the round
matching composition networks . . . . . 163--172
Jun Kawahara and
Koji M. Kobayashi and
Shuichi Miyazaki Better bounds for online $k$-frame
throughput maximization in network
switches . . . . . . . . . . . . . . . . 173--190
Haixia Zhang and
Yi Wang The minimal Laplacian spectral radius of
trees with diameter $4$ . . . . . . . . 191--195
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Jianxin Wang and
Chee K. Yap Preface . . . . . . . . . . . . . . . . 1--2
Martin Fürer Efficient computation of the
characteristic polynomial of a threshold
graph . . . . . . . . . . . . . . . . . 3--10
Mugang Lin and
Qilong Feng and
Jianer Chen and
Wenjun Li Partition on trees with supply and
demand: Kernelization and algorithms . . 11--19
Wenjun Li and
Qilong Feng and
Jianer Chen and
Shuai Hu Improved kernel results for some FPT
problems based on simple observations 20--27
Jinyan Wang and
Minghao Yin and
Jingli Wu Two approximate algorithms for model
counting . . . . . . . . . . . . . . . . 28--37
Yang Liu and
Shengyu Zhang Fast quantum algorithms for least
squares regression and statistic
leverage scores . . . . . . . . . . . . 38--47
Jie Cheng and
Daming Zhu and
Binhai Zhu Improved algorithms for intermediate
dataset storage in a cloud-based
dataflow . . . . . . . . . . . . . . . . 48--53
Aiyong Xian and
Kaiyuan Zhu and
Daming Zhu and
Lianrong Pu and
Hong Liu Approximating Max NAE-$k$-SAT by
anonymous local search . . . . . . . . . 54--63
Jianming Dong and
Weitian Tong and
Taibo Luo and
Xueshi Wang and
Jueliang Hu and
Yinfeng Xu and
Guohui Lin An FPTAS for the parallel two-stage
flowshop problem . . . . . . . . . . . . 64--72
Gábor Ivanyos and
Miklos Santha Solving systems of diagonal polynomial
equations over finite fields . . . . . . 73--85
Mingyu Xiao and
Shaowei Kou Exact algorithms for the maximum
dissociation set and minimum $3$-path
vertex cover problems . . . . . . . . . 86--97
Peng Zhang and
Yong Gao A probabilistic study of generalized
solution concepts in satisfiability
testing and constraint programming . . . 98--110
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Dora Giammarresi and
Sabrina Mantaci and
Marinella Sciortino and
Filippo Mignosi Preface . . . . . . . . . . . . . . . . 1--3
Marcella Anselmo and
Maria Madonia Two-dimensional comma-free and cylindric
codes . . . . . . . . . . . . . . . . . 4--17
Marie-Pierre Béal and
Pavel Heller Shifts of $k$-nested sequences . . . . . 18--26
Golnaz Badkobeh and
Maxime Crochemore and
Robert Mercas Counting maximal-exponent factors in
words . . . . . . . . . . . . . . . . . 27--35
Elena Barcucci and
Antonio Bernini and
Stefano Bilotta and
Renzo Pinzani Non-overlapping matrices . . . . . . . . 36--45
Marcello M. Bersani and
Matteo Rossi and
Pierluigi San Pietro A logical characterization of timed
regular languages . . . . . . . . . . . 46--59
Paola Bonizzoni and
Anna Paola Carrieri and
Gianluca Della Vedova and
Raffaella Rizzi and
Gabriella Trucco A colored graph approach to perfect
phylogeny with persistent characters . . 60--73
Giusi Castiglione and
Paolo Massazza On a class of languages with holonomic
generating functions . . . . . . . . . . 74--84
Christian Choffrut Sequences of words defined by two-way
transducers . . . . . . . . . . . . . . 85--96
R. Cori and
C. Reutenauer On Sillke's bijection . . . . . . . . . 97--104
Stefano Crespi Reghizzi and
Violetta Lonati and
Dino Mandrioli and
Matteo Pradella Toward a theory of input-driven locally
parsable languages . . . . . . . . . . . 105--121
Alma D'Aniello and
Aldo de Luca and
Alessandro De Luca On Christoffel and standard words and
their derivatives . . . . . . . . . . . 122--147
Clelia De Felice and
Rocco Zaccagnino and
Rosalba Zizza Unavoidable sets and circular splicing
languages . . . . . . . . . . . . . . . 148--158
Francesco Dolce and
Dominique Perrin Neutral and tree sets of arbitrary
characteristic . . . . . . . . . . . . . 159--174
Giovanna Guaiana Local testability from words to traces,
a suitable definition . . . . . . . . . 175--189
Juhani Karhumäki and
Svetlana Puzynina and
Michaël Rao and
Markus A. Whiteland On cardinalities of $k$-abelian
equivalence classes . . . . . . . . . . 190--204
Jetty Kleijn and
Maciej Koutny and
Marta Pietkiewicz-Koutny and
Grzegorz Rozenberg Applying regions . . . . . . . . . . . . 205--215
Victor Marsault and
Jacques Sakarovitch The signature of rational languages . . 216--234
Nelma Moreira and
Giovanni Pighizzini and
Rogério Reis Optimal state reductions of automata
with partially specified behaviors . . . 235--245
Jean-Éric Pin and
Pedro V. Silva On uniformly continuous functions for
some profinite topologies . . . . . . . 246--262
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Kira Adaricheva and
Giuseppe F. Italiano and
Hans Kleine Büning and
György Turán Foreword . . . . . . . . . . . . . . . . 263
Marcel Wild The joy of implications, aka pure Horn
formulas: Mainly a survey . . . . . . . 264--292
Giorgio Ausiello and
Luigi Laura Directed hypergraphs: Introduction and
fundamental algorithms --- a survey . . 293--306
K. Adaricheva and
J. B. Nation Discovery of the $D$-basis in binary
tables based on hypergraph dualization 307--315
Mikhail A. Babin and
Sergei O. Kuznetsov Dualization in lattices given by ordered
sets of irreducibles . . . . . . . . . . 316--326
Sebastian Rudolph Succinctness and tractability of closure
operator representations . . . . . . . . 327--345
Marta Arias and
José L. Balcázar and
Cristina T\^\irnauca Learning definite Horn formulas from
closure queries . . . . . . . . . . . . 346--356
Brice Chardin and
Emmanuel Coquery and
Marie Pailloux and
Jean-Marc Petit RQL: a Query Language for Rule Discovery
in Databases . . . . . . . . . . . . . . 357--374
Sergei Obiedkov Parameterized ceteris paribus
preferences over atomic conjunctions
under conservative semantics . . . . . . 375--390
Laurent Beaudou and
Arnaud Mary and
Lhouari Nourine Algorithms for $k$-meet-semidistributive
lattices . . . . . . . . . . . . . . . . 391--398
Petr Kucera Hydras: Complexity on general graphs and
a subclass of trees . . . . . . . . . . 399--416
Robert H. Sloan and
Despina Stasi and
György Turán Hydras: Directed hypergraphs and Horn
formulas . . . . . . . . . . . . . . . . 417--428
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Péter Burcsi and
Gabriele Fici and
Zsuzsanna Lipták and
Frank Ruskey and
Joe Sawada On prefix normal words and prefix normal
forms . . . . . . . . . . . . . . . . . 1--13
Wen An Liu and
Ming Yue Wang Multi-player subtraction games . . . . . 14--35
Nicolas Bacquey Leader election on two-dimensional
periodic cellular automata . . . . . . . 36--52
Xiang Xu and
Xiaowang Li and
Shuming Zhou and
Rong-Xia Hao and
Mei-Mei Gu The $g$-good-neighbor diagnosability of
$ (n, k)$-star graphs . . . . . . . . . 53--63
Hans Kellerer and
Rebecca Sarto Basso and
Vitaly A. Strusevich Approximability issues for unconstrained
and constrained maximization of
half-product related functions . . . . . 64--71
Mingyu Xiao and
Hiroshi Nagamochi Complexity and kernels for bipartition
into degree-bounded induced graphs . . . 72--82
Shiva Kintali Directed width parameters and
circumference of digraphs . . . . . . . 83--87
Michal Karpi\'nski Vertex $2$-coloring without
monochromatic cycles of fixed size is
NP-complete . . . . . . . . . . . . . . 88--94
Naoyuki Kamiyama A note on the submodular vertex cover
problem with submodular penalties . . . 95--97
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Irena Rusu log-Lists and their applications to
sorting by transpositions, reversals and
block-interchanges . . . . . . . . . . . 1--15
George Barmpalias and
Andrew Lewis-Pye Computing halting probabilities from
other halting probabilities . . . . . . 16--22
Antonio Faonio and
Jesper Buus Nielsen and
Daniele Venturi Fully leakage-resilient signatures
revisited: Graceful degradation, noisy
leakage, and construction in the
bounded-retrieval model . . . . . . . . 23--56
Tatsuya Akutsu and
Jesper Jansson and
Atsuhiro Takasu and
Takeyuki Tamura On the parameterized complexity of
associative and commutative unification 57--74
Siyao Guo and
Ilan Komargodski Negation-limited formulas . . . . . . . 75--85
Maggie X. Cheng and
Yi Ling and
Brian M. Sadler Network connectivity assessment and
improvement through relay node
deployment . . . . . . . . . . . . . . . 86--101
Yaroslav Shitov On the complexity of failed zero forcing 102--104
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Jihui Wang and
Jiansheng Cai and
Baojian Qiu Neighbor sum distinguishing total
choosability of planar graphs without
adjacent triangles . . . . . . . . . . . 1--7
Ricardo C. Corrêa and
Pablo M. S. Farias Linear time computation of the maximal
linear and circular sums of multiple
independent insertions into a sequence 8--17
Martin Birks and
Stanley P. Y. Fung Temperature aware online algorithms for
minimizing flow time . . . . . . . . . . 18--34
Nathalie Aubrun and
Sebastián Barbieri and
Mathieu Sablik A notion of effectiveness for subshifts
on finitely generated groups . . . . . . 35--55
Pradeesha Ashok and
Sudeshna Kolay and
S. M. Meesum and
Saket Saurabh Parameterized complexity of Strip
Packing and Minimum Volume Packing . . . 56--64
Farnoosh Khodakarami and
Farzad Didehvar and
Ali Mohades $ 1.5 $D terrain guarding problem
parameterized by guard range . . . . . . 65--69
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
A. Czygrinow and
M. Han\'ckowiak and
E. Szyma\'nska and
W. Wawrzyniak and
M. Witkowski Improved distributed local approximation
algorithm for minimum $2$-dominating set
in planar graphs . . . . . . . . . . . . 1--8
Vittorio Bil\`o and
Michele Flammini and
Gianpiero Monaco Approximating the revenue maximization
problem with sharp demands . . . . . . . 9--30
Luis Pedro Montejano and
Ignasi Sau On the complexity of computing the
$k$-restricted edge-connectivity of a
graph . . . . . . . . . . . . . . . . . 31--39
Shiva Kintali and
Qiuyi Zhang Forbidden directed minors and
Kelly-width . . . . . . . . . . . . . . 40--47
Jung Yeon Hwang and
Boyeon Song and
Daeseon Choi and
Seung-Hun Jin and
Hyun Sook Cho and
Mun-Kyu Lee Simplified small exponent test for batch
verification . . . . . . . . . . . . . . 48--58
William J. Lenhart and
Giuseppe Liotta and
Fabrizio Montecchiani On partitioning the edges of $1$-plane
graphs . . . . . . . . . . . . . . . . . 59--65
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
José L. Fiadeiro and
Antónia Lopes Heterogeneous and asynchronous networks
of timed systems . . . . . . . . . . . . 1--33
Jonathan P. Seldin The search for a reduction in
combinatory logic equivalent to $
\lambda \beta $-reduction, Part II . . . 34--58
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Paola Campadelli and
Giovanni Pighizzini and
Massimiliano Goldwurm Preface . . . . . . . . . . . . . . . . 1--1
Paola Campadelli and
Massimiliano Goldwurm and
Giovanni Pighizzini Alberto Bertoni: a scientist and a
friend . . . . . . . . . . . . . . . . . 2--11
Alessandro Adamo and
Giuliano Grossi and
Raffaella Lanzarotti and
Jianyi Lin Sparse decomposition by iterating
Lipschitzian-type mappings . . . . . . . 12--28
Elena Barcucci and
Antonio Bernini and
Stefano Bilotta and
Renzo Pinzani Cross-bifix-free sets in two dimensions 29--38
Maria Paola Bianchi and
Carlo Mereghetti and
Beatrice Palano Quantum finite automata: Advances on
Bertoni's ideas . . . . . . . . . . . . 39--53
Stefano Brocchi and
Giusi Castiglione and
Paolo Massazza On the exhaustive generation of
$k$-convex polyominoes . . . . . . . . . 54--66
Arturo Carpi and
Flavio D'Alessandro On incomplete and synchronizing finite
sets . . . . . . . . . . . . . . . . . . 67--77
Christian Choffrut An Hadamard operation on rational
relations . . . . . . . . . . . . . . . 78--90
Stefano Crespi Reghizzi and
Pierluigi San Pietro Counter machines, Petri Nets, and
consensual computation . . . . . . . . . 91--116
Clelia De Felice and
Sabrina Mantaci and
Antonio Restivo On the decomposition of prefix codes . . 117--130
Alberto Dennunzio and
Enrico Formenti and
Luca Manzoni and
Giancarlo Mauri and
Antonio E. Porreca Computational complexity of finite
asynchronous cellular automata . . . . . 131--143
N. Sabadini and
F. Schiavio and
R. F. C. Walters On the geometry and algebra of networks
with state . . . . . . . . . . . . . . . 144--163
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Petr A. Golovach and
George B. Mertzios Graph editing to a given degree sequence 1--12
Artur Jez and
Alexander Okhotin Unambiguous conjunctive grammars over a
one-symbol alphabet . . . . . . . . . . 13--39
Ioannis Giotis and
Lefteris Kirousis and
Kostas I. Psaromiligkos and
Dimitrios M. Thilikos Acyclic edge coloring through the Lovász
Local Lemma . . . . . . . . . . . . . . 40--50
Ajoy K. Datta and
Stéphane Devismes and
Lawrence L. Larmore Self-stabilizing silent disjunction in
an anonymous network . . . . . . . . . . 51--72
Giuseppe Lancia and
Luke Mathieson and
Pablo Moscato Separating sets of strings by finding
matching patterns is almost always hard 73--86
Omar Al-Bataineh and
Mark Reynolds and
Tim French Finding minimum and maximum termination
time of timed automata models with
cyclic behaviour . . . . . . . . . . . . 87--104
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Apoorva Mishra and
Anupam Shukla Mathematical analysis of the cumulative
effect of novel ternary crossover
operator and mutation on probability of
survival of a schema . . . . . . . . . . 1--11
Wen Chean Teh and
Adrian Atanasiu Irreducible reaction systems and
reaction system rank . . . . . . . . . . 12--20
Dmitry A. Zaitsev A generalized neighborhood for cellular
automata . . . . . . . . . . . . . . . . 21--35
Bruno Durand and
Guilhem Gamard and
Anaël Grandjean Aperiodic tilings and entropy . . . . . 36--47
Shenggen Zheng and
Lvzhou Li and
Daowen Qiu and
Jozef Gruska Promise problems solved by quantum and
classical finite automata . . . . . . . 48--64
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Cameron T. Chalk and
Bin Fu and
Eric Martinez and
Robert Schweller and
Tim Wylie Concentration independent random number
generation in tile self-assembly . . . . 1--15
Pratish Datta and
Ratna Dutta and
Sourav Mukhopadhyay Strongly full-hiding inner product
encryption . . . . . . . . . . . . . . . 16--50
Kwangsu Lee and
Seung Geol Choi and
Dong Hoon Lee and
Jong Hwan Park and
Moti Yung Self-updatable encryption: Time
constrained access control with hidden
attributes and better efficiency . . . . 51--92
Michael Gentner and
Dieter Rautenbach Dynamic monopolies for degree
proportional thresholds in connected
graphs of girth at least five and trees 93--100
M. Flammini and
V. Gallotti and
G. Melideo and
G. Monaco and
L. Moscardelli Network Movement Games . . . . . . . . . 101--118
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Y. Sreenivasa Rao and
Ratna Dutta Computational friendly attribute-based
encryptions with short ciphertext . . . 1--26
Angelos Charalambidis and
Panos Rondogiannis and
Ioanna Symeonidou Equivalence of two fixed-point semantics
for definitional higher-order logic
programs . . . . . . . . . . . . . . . . 27--42
Florent Foucaud and
George B. Mertzios and
Reza Naserasr and
Aline Parreau and
Petru Valicov Identification, location-domination and
metric dimension on interval and
permutation graphs. I. Bounds . . . . . 43--58
F. Michel Dekking and
Michael S. Keane On the conjugacy class of the Fibonacci
dynamical system . . . . . . . . . . . . 59--69
Tomás Dvorák and
Petr Gregor and
Václav Koubek Generalized Gray codes with prescribed
ends . . . . . . . . . . . . . . . . . . 70--94
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Aleksandra Jovanovi\'c and
Marta Kwiatkowska and
Gethin Norman and
Quentin Peyras Symbolic optimal expected time
reachability computation and controller
synthesis for probabilistic timed
automata . . . . . . . . . . . . . . . . 1--21
Xiaoyong Xi and
Qingyu He and
Lingyun Yang On the largest Cartesian closed category
of stable domains . . . . . . . . . . . 22--32
Laura Bocchi and
Tzu-Chun Chen and
Romain Demangeon and
Kohei Honda and
Nobuko Yoshida Monitoring networks through multiparty
session types . . . . . . . . . . . . . 33--58
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Laurent Gourv\`es and
Jérôme Monnot and
Fanny Pascual and
Daniel Vanderpooten Bi-objective matchings with the triangle
inequality . . . . . . . . . . . . . . . 1--10
Spyros Angelopoulos and
Diogo Arsénio and
Christoph Dürr Infinite linear programming and online
searching with turn cost . . . . . . . . 11--22
Yan Wang and
Hong Shen and
Jianxi Fan Edge-independent spanning trees in
augmented cubes . . . . . . . . . . . . 23--32
Jianer Chen and
Chao Xu and
Jianxin Wang Dealing with $4$-variables by
resolution: an improved MaxSAT algorithm 33--44
Tzu-Liang Kung and
Chun-Nan Hung Estimating the subsystem reliability of
bubblesort networks . . . . . . . . . . 45--55
Barnaby Martin and
András Pongrácz and
Michal Wrona The complexity of counting quantifiers
on equality languages . . . . . . . . . 56--67
Zsuzsa Mészáros-Karkus Hardness results for stable exchange
problems . . . . . . . . . . . . . . . . 68--78
Yan Lan and
Xin Han and
Yinling Wang and
Min Ge and
He Guo and
Xin Chen Flowshop problem $ F2 \to D | v = 1, c
\geq 1 | C_{\rm max} $ revisited . . . . 79--85
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Lila Kari Editorial . . . . . . . . . . . . . . . 1--1
Matthew J. Patitz TCS Special Issue on Computational
Self-Assembly . . . . . . . . . . . . . 2--3
Erik D. Demaine and
Sándor P. Fekete and
Christian Scheffer and
Arne Schmidt New geometric algorithms for fully
connected staged self-assembly . . . . . 4--18
Dhananjay Ipparthi and
Massimo Mastrangeli and
Andrew Winslow Dipole codes attractively encode glue
functions . . . . . . . . . . . . . . . 19--25
Makoto Ota and
Shinnosuke Seki Rule set design problems for oritatami
systems . . . . . . . . . . . . . . . . 26--35
Othon Michail and
Paul G. Spirakis Connectivity preserving network
transformers . . . . . . . . . . . . . . 36--55
Zahra Derakhshandeh and
Robert Gmyr and
Andréa W. Richa and
Christian Scheideler and
Thim Strothmann Universal coating for programmable
matter . . . . . . . . . . . . . . . . . 56--68
Joanna A. Ellis-Monaghan and
Greta Pangborn and
Nadrian C. Seeman and
Sam Blakeley and
Conor Disher and
Mary Falcigno and
Brianna Healy and
Ada Morse and
Bharti Singh and
Melissa Westland Design tools for reporter strands and
DNA origami scaffold strands . . . . . . 69--78
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
José Meseguer Strict coherence of conditional
rewriting modulo axioms . . . . . . . . 1--35
Eduardo Bonelli and
Delia Kesner and
Carlos Lombardi and
Alejandro Ríos On abstract normalisation beyond
neededness . . . . . . . . . . . . . . . 36--63
Mauricio Ayala-Rincón and
Maribel Fernández and
Daniele Nantes-Sobrinho Intruder deduction problem for locally
stable theories with normal forms and
inverses . . . . . . . . . . . . . . . . 64--100
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
George Barmpalias and
Douglas Cenzer and
Christopher P. Porter Random numbers as probabilities of
machine behavior . . . . . . . . . . . . 1--18
Hitoshi Furusawa Uniform continuity of relations and
nondeterministic cellular automata . . . 19--29
Linqiang Pan and
Zhiqiang Zhang and
Tingfang Wu and
Jinbang Xu Numerical $P$ systems with production
thresholds . . . . . . . . . . . . . . . 30--41
Alberto Leporati and
Luca Manzoni and
Giancarlo Mauri and
Antonio E. Porreca and
Claudio Zandron A toolbox for simpler active membrane
algorithms . . . . . . . . . . . . . . . 42--57
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Tara Brough and
Alan J. Cain Automaton semigroups: New constructions
results and examples of non-automaton
semigroups . . . . . . . . . . . . . . . 1--15
Wei Ding and
Ke Qiu Incremental single-source shortest paths
in digraphs with arbitrary positive arc
weights . . . . . . . . . . . . . . . . 16--31
Guy Kortsarz and
Zeev Nutov Approximating source location and star
survivable network problems . . . . . . 32--42
Min Xu and
Krishnaiyan Thulasiraman and
Qiang Zhu Conditional diagnosability of a class of
matching composition networks under the
comparison model . . . . . . . . . . . . 43--52
Desai Li and
Mei Lu The $g$-good-neighbor conditional
diagnosability of star graphs under the
PMC and MM* model . . . . . . . . . . . 53--59
Arash Ahadi and
Ali Dehghan and
Mohsen Mollahajiaghaei Algorithmic complexity of weakly
semiregular partitioning and the
representation number . . . . . . . . . 60--72
Iskander Kalimullin and
Alexander Melnikov and
Keng Meng Ng Algebraic structures computable without
delay . . . . . . . . . . . . . . . . . 73--98
Robert Fraser and
Alejandro López-Ortiz The within-strip discrete unit disk
cover problem . . . . . . . . . . . . . 99--115
Yaroslav Shitov A tractable NP-completeness proof for
the two-coloring without monochromatic
cycles of fixed length . . . . . . . . . 116--118
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Claus Kadelka and
Yuan Li and
Jack Kuipers and
John O. Adeyeye and
Reinhard Laubenbacher Multistate nested canalizing functions
and their networks . . . . . . . . . . . 1--14
Sang Duk Yoon and
Hee-Kap Ahn and
Jessica Sherette Realistic roofs without local minimum
edges over a rectilinear polygon . . . . 15--26
Koji M. Kobayashi and
Shuichi Miyazaki and
Yasuo Okabe Competitive buffer management for
multi-queue switches in QoS networks
using packet buffering algorithms . . . 27--42
Jean-François Baffier and
Man-Kwun Chiu and
Yago Diez and
Matias Korman and
Valia Mitsou and
André van Renssen and
Marcel Roeloffzen and
Yushi Uno Hanabi is NP-hard, even for cheaters who
look at their cards . . . . . . . . . . 43--55
Arne C. Reimers and
Alexandra-M. Reimers and
Yaron Goldstein Minimal equivalent subgraphs containing
a given set of arcs . . . . . . . . . . 56--63
Huan Li and
Zhongzhi Zhang Maximum matchings in scale-free networks
with identical degree distribution . . . 64--81
Yuqing Lin and
Fuji Zhang A linear algorithm for a perfect
matching in polyomino graphs . . . . . . 82--88
George Barmpalias and
Rodney G. Downey Kobayashi compressibility . . . . . . . 89--100
Marcello Mamino Strategy recovery for stochastic mean
payoff games . . . . . . . . . . . . . . 101--104
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
James Abello and
Pavel Klavík and
Jan Kratochvíl and
Tomás Vyskocil MSOL restricted contractibility to
planar graphs . . . . . . . . . . . . . 1--14
Palash Dey and
Neeldhara Misra and
Y. Narahari Frugal bribery in voting . . . . . . . . 15--32
Mathieu Chapelle and
Manfred Cochefert and
Dieter Kratsch and
Romain Letourneur and
Mathieu Liedloff Exact exponential algorithms to find
tropical connected sets of minimum size 33--41
Janka Chlebíková and
Morgan Chopin The firefighter problem: Further steps
in understanding its complexity . . . . 42--51
Zhenyu Huang and
Dongdai Lin Solving polynomial systems with noise
over $ \mathbb {F}_2 $: Revisited . . . 52--68
Lucy Ham Gap theorems for robust satisfiability:
Boolean CSPs and beyond . . . . . . . . 69--91
M. Badano and
D. Vaggione Characterization of context-free
languages . . . . . . . . . . . . . . . 92--96
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Jing Li and
Guoren Wang and
Lichao Chen Paired $2$-disjoint path covers of
multi-dimensional torus networks with $
2 n - 3$ faulty edges . . . . . . . . . 1--11
Liren Shan and
Huan Li and
Zhongzhi Zhang Domination number and minimum dominating
sets in pseudofractal scale-free web and
Sierpi\'nski graph . . . . . . . . . . . 12--30
Weihua He and
Ziwen Liu and
Chao Yang Snowman is PSPACE-complete . . . . . . . 31--40
Gadi Taubenfeld Contention-sensitive data structures and
algorithms . . . . . . . . . . . . . . . 41--55
Luke Mathieson Graph editing problems with extended
regularity constraints . . . . . . . . . 56--68
Takehiro Ito and
Naonori Kakimura and
Naoyuki Kamiyama and
Yusuke Kobayashi and
Yoshio Okamoto Efficient stabilization of cooperative
matching games . . . . . . . . . . . . . 69--82
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Antonios Antoniadis and
Peter Kling and
Sebastian Ott and
Sören Riechers Continuous speed scaling with
variability: a simple and direct
approach . . . . . . . . . . . . . . . . 1--13
Edith Hemaspaandra and
Lane A. Hemaspaandra and
Jörg Rothe The complexity of controlling
candidate-sequential elections . . . . . 14--21
Felipe A. Louza and
Simon Gog and
Guilherme P. Telles Inducing enhanced suffix arrays for
string collections . . . . . . . . . . . 22--39
Evangelos Markakis and
Orestis Telelis Item bidding for combinatorial public
projects . . . . . . . . . . . . . . . . 40--55
Monika Pil\'sniak Edge motion and the distinguishing index 56--62
Jing Liu and
Minmin Liu and
Changji Wang and
Shaowen Yao Group Rekeying in the Exclusive
Subset-Cover Framework . . . . . . . . . 63--77
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Frank Drewes Preface . . . . . . . . . . . . . . . . 1--1
Andreas Maletti Survey: Finite-state technology in
natural language processing . . . . . . 2--17
Hermann Gruber and
Markus Holzer and
Sebastian Jakobi More on deterministic and
nondeterministic finite cover automata 18--30
Henning Fernau and
Meenakshi Paramasivan and
Markus L. Schmid and
Vojtech Vorel Characterization and complexity results
on jumping finite automata . . . . . . . 31--52
Mehryar Mohri and
Michael D. Riley A disambiguation algorithm for weighted
automata . . . . . . . . . . . . . . . . 53--68
Martin Berglund and
Brink van der Merwe On the semantics of regular expression
parsing in the wild . . . . . . . . . . 69--82
Martin Kutrib and
Matthias Wendlandt Concatenation-free languages . . . . . . 83--94
Pascal Caron and
Ludovic Mignot and
Clément Miklarz On the hierarchy of generalizations of
one-unambiguous regular languages . . . 95--106
Timothy Ng and
David Rappaport and
Kai Salomaa State complexity of prefix distance . . 107--117
Daniel Prusa and
Klaus Reinhardt Undecidability of the emptiness problem
for context-free picture languages . . . 118--125
Abhijin Adiga and
Chris J. Kuhlman and
Madhav V. Marathe and
S. S. Ravi and
Daniel J. Rosenkrantz and
Richard E. Stearns Inferring local transition functions of
discrete dynamical systems from
observations of system behavior . . . . 126--144
Stefan Hoffmann and
Sibylle Schwarz and
Ludwig Staiger Shift-invariant topologies for the
Cantor space $ X^\omega $ . . . . . . . 145--161
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Nathanaël Fijalkow Profinite techniques for probabilistic
automata and the Markov Monoid algorithm 1--14
Peter M. Higgins and
Suhear Alwan Languages with membership determined by
single letter factors . . . . . . . . . 15--24
Ath. Kehagias and
G. Konstantinidis Selfish cops and passive robber:
Qualitative games . . . . . . . . . . . 25--35
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Jan Verschelde and
Stephen M. Watt and
Lihong Zhi TCS SNC Preface . . . . . . . . . . . . 1--2
Moulay Barkatou and
Paola Boito and
Esteban Segura Ugalde A contour integral approach to the
computation of invariant pairs . . . . . 3--26
Dmitry Batenkov Accurate solution of near-colliding
Prony systems via decimation and
homotopy continuation . . . . . . . . . 27--40
Mohamed Elkadi and
André Galligo On mixed polynomials of bidegree $ (n,
1) $ . . . . . . . . . . . . . . . . . . 41--53
Martin Helmer A direct algorithm to compute the
topological Euler characteristic and
Chern--Schwartz--MacPherson class of
projective complete intersection
varieties . . . . . . . . . . . . . . . 54--74
Yi Li Witness to non-termination of linear
programs . . . . . . . . . . . . . . . . 75--100
Victor Y. Pan and
Liang Zhao Real polynomial root-finding by means of
matrix and polynomial iterations . . . . 101--116
Victor Y. Pan and
Elias P. Tsigaridas Nearly optimal computations with
structured matrices . . . . . . . . . . 117--137
Victor Y. Pan and
Elias Tsigaridas Accelerated approximation of the complex
roots and factors of a univariate
polynomial . . . . . . . . . . . . . . . 138--145
Dierk Schleicher and
Robin Stoll Newton's method in practice: Finding all
roots of polynomials of degree one
million efficiently . . . . . . . . . . 146--166
Hiroshi Sekigawa The nearest polynomial to multiple given
polynomials with a given zero in the
real case . . . . . . . . . . . . . . . 167--175
Konstantin Usevich and
Ivan Markovsky Variable projection methods for
approximate (greatest) common divisor
computations . . . . . . . . . . . . . . 176--198
Wei-guo Wang and
Yimin Wei Mixed and componentwise condition
numbers for matrix decompositions . . . 199--216
Wenyuan Wu and
Greg Reid and
Yong Feng Computing real witness points of
positive dimensional polynomial systems 217--231
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Lila Kari Editorial . . . . . . . . . . . . . . . 1--1
Florin Manea and
Bianca Truthe and
György Vaszil TCS Special Issue on Languages and
Combinatorics in Theory and Nature . . . 2--4
Artiom Alhazov and
Henning Fernau and
Rudolf Freund and
Sergiu Ivanov and
Rani Siromoney and
K. G. Subramanian Contextual array grammars with matrix
control, regular control languages, and
tissue P systems control . . . . . . . . 5--21
Fernando Arroyo and
Sandra Gómez-Canaval and
Victor Mitrana and
José Ramón Sánchez-Couso Transducers based on networks of
polarized evolutionary processors . . . 22--29
Johanna Björklund and
Frank Drewes and
Anna Jonsson Finding the $N$ best vertices in an
infinite weighted hypergraph . . . . . . 30--41
Henning Bordihn Active symbols in grammars with
valuations . . . . . . . . . . . . . . . 42--48
Paolo Bottoni and
Anna Labella and
Victor Mitrana Prefix-suffix square reduction . . . . . 49--56
Haiming Chen and
Mihai Ionescu and
Andrei Paun and
Gheorghe Paun On trace languages generated by (small)
spiking neural P systems . . . . . . . . 57--66
Da-Jung Cho and
Daniel Goc and
Yo-Sub Han and
Sang-Ki Ko and
Alexandros Palioudakis and
Kai Salomaa State complexity of permutation on
finite languages over a binary alphabet 67--78
Andrzej Ehrenfeucht and
Jetty Kleijn and
Maciej Koutny and
Grzegorz Rozenberg Evolving reaction systems . . . . . . . 79--99
Henning Fernau and
Lakshmanan Kuppusamy and
Indhumathi Raman On the computational completeness of
graph-controlled insertion-deletion
systems with binary sizes . . . . . . . 100--121
Markus Holzer and
Sebastian Jakobi and
Martin Kutrib The chop of languages . . . . . . . . . 122--137
Helmut Jürgensen Higher-level constructs for families and
multisets . . . . . . . . . . . . . . . 138--148
Martin Kutrib and
Andreas Malcher One-way reversible multi-head finite
automata . . . . . . . . . . . . . . . . 149--164
Tomás Masopust and
Michaël Thomazo On Boolean combinations forming
piecewise testable languages . . . . . . 165--179
Robert Mercas On the aperiodic avoidability of binary
patterns with variables and reversals 180--189
Friedrich Otto and
Frantisek Mráz Regulated variants of limited context
restarting automata . . . . . . . . . . 190--207
Arto Salomaa Minimal reaction systems: Duration and
blips . . . . . . . . . . . . . . . . . 208--216
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Maurice Herlihy and
Sergio Rajsbaum and
Michel Raynal and
Julien Stainer From wait-free to arbitrary concurrent
solo executions in colorless distributed
computing . . . . . . . . . . . . . . . 1--21
Graham Cormode and
Hossein Jowhari A second look at counting triangles in
graph streams (corrected) . . . . . . . 22--30
Graham Cormode and
Hossein Jowhari Corrigendum to ``A second look at
counting triangles in graph streams''
[Theoret. Comput. Sci. \bf 552 (2014)
44--51] . . . . . . . . . . . . . . . . 31--32
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Florin Manea and
Dirk Nowotka TCS Special Issue: Combinatorics on
Words --- WORDS 2015 . . . . . . . . . . 1--2
Valérie Berthé and
Clelia De Felice and
Vincent Delecroix and
Francesco Dolce and
Julien Leroy and
Dominique Perrin and
Christophe Reutenauer and
Giuseppina Rindone Specular sets . . . . . . . . . . . . . 3--28
Gabriele Fici and
Filippo Mignosi and
Jeffrey Shallit Abelian-square-rich words . . . . . . . 29--42
Stepán Holub Prefix frequency of lost positions . . . 43--52
Stepán Holub and
Mike Müller Fully bordered words . . . . . . . . . . 53--58
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Mauricio Ayala-Rincón and
Ian Mackie and
Ugo Montanari Logical and Semantic Frameworks with
Applications . . . . . . . . . . . . . . 1--2
Sandra Alves and
Maribel Fernández A graph-based framework for the analysis
of access control policies . . . . . . . 3--22
Mario Benevides Bisimilar and logically equivalent
programs in PDL with parallel operator 23--45
Carlos Olarte and
Elaine Pimentel On concurrent behaviors and focusing in
linear logic . . . . . . . . . . . . . . 46--64
Ernesto Copello and
Nora Szasz and
Álvaro Tasistro Formal metatheory of the Lambda calculus
using Stoughton's substitution . . . . . 65--82
Paulo A. S. Veloso and
Sheila R. M. Veloso and
Mario R. F. Benevides On a graph calculus for modalities . . . 83--103
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Daniel Gaina Foundations of logic programming in
hybrid logics with user-defined sharing 1--24
Simone André da Costa Cavalheiro and
Luciana Foss and
Leila Ribeiro Theorem proving graph grammars with
attributes and negative application
conditions . . . . . . . . . . . . . . . 25--77
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Shangwei Lin and
Chanchan Zhou and
Chunfang Li Arc fault tolerance of Kautz digraphs 1--10
Andrei Bulatov and
Leslie Ann Goldberg and
Mark Jerrum and
David Richerby and
Stanislav Zivný Functional clones and expressibility of
partition functions . . . . . . . . . . 11--39
Xiaomin Hu and
Yingzhi Tian and
Xiaodong Liang and
Jixiang Meng Matching preclusion for $n$-dimensional
torus networks . . . . . . . . . . . . . 40--47
Jetro Vesti Rich square-free words . . . . . . . . . 48--61
Aleksandra Gorzkowska and
Monika Pil\'sniak Precise bounds for the distinguishing
index of the Cartesian product . . . . . 62--69
V. Arvind Finding fixed point free elements and
small bases in permutation groups . . . 70--78
Daxin Zhu and
Lei Wang and
Tinran Wang and
Xiaodong Wang A space efficient algorithm for the
longest common subsequence in $k$-length
substrings . . . . . . . . . . . . . . . 79--92
Jianming Dong and
Jueliang Hu and
Mikhail Y. Kovalyov and
Guohui Lin and
Taibo Luo and
Weitian Tong and
Xueshi Wang and
Yinfeng Xu Corrigendum to ``An FPTAS for the
parallel two-stage flowshop problem''
[Theoret. Comput. Sci. \bf 657 (2017)
64--72] . . . . . . . . . . . . . . . . 93--94
Anonymous Editorial Board . . . . . . . . . . . . iii--ix
Kishore Kothapalli and
Sergio Rajsbaum Preface . . . . . . . . . . . . . . . . 1--1
Uri Abraham and
Gal Amram Two-process synchronization . . . . . . 2--23
Aravind Natarajan and
Himanshu Chauhan and
Neeraj Mittal and
Vijay K. Garg Efficient abstraction algorithms for
predicate detection . . . . . . . . . . 24--48
Karine Altisen and
Stéphane Devismes On probabilistic snap-stabilization . . 49--76
Ofer Feinerman and
Amos Korman and
Shay Kutten and
Yoav Rodeh Fast rendezvous on a cycle by agents
with different speeds . . . . . . . . . 77--85
Sachin Hirve and
Roberto Palmieri and
Binoy Ravindran HiperTM: High performance,
fault-tolerant transactional memory . . 86--102
Petr Kuznetsov and
Sathya Peri Non-interference and local correctness
in transactional memory . . . . . . . . 103--116
Xueling Zhong and
Jinwen Ou Parallel machine scheduling with
restricted job rejection . . . . . . . . 1--11
Wing-Kai Hon and
Sharma V. Thankachan and
Bojian Xu In-place algorithms for exact and
approximate shortest unique substring
problems . . . . . . . . . . . . . . . . 12--25
Fatemeh Keshavarz-Kohjerdi and
Alireza Bagheri A linear-time algorithm for finding
Hamiltonian $ (s, t)$-paths in
even-sized rectangular grid graphs with
a rectangular hole . . . . . . . . . . . 26--58
Mei-Mei Gu and
Rong-Xia Hao and
Jun-Ming Xu and
Yan-Quan Feng Equal relation between the extra
connectivity and pessimistic
diagnosability for some regular graphs 59--72
Lo\"\ic Mazo and
Étienne Baudrier Non-local length estimators and concave
functions . . . . . . . . . . . . . . . 73--90
Didem Gözüpek and
Sibel Özkan and
Christophe Paul and
Ignasi Sau and
Mordechai Shalom Parameterized complexity of the MINCCA
problem on graphs of bounded
decomposability . . . . . . . . . . . . 91--103
Sounaka Mishra and
Shijin Rajakrishnan and
Saket Saurabh On approximability of optimization
problems related to Red/Blue-split
graphs . . . . . . . . . . . . . . . . . 104--113
Nathann Cohen and
David Coudert and
Guillaume Ducoffe and
Aurélien Lancin Applying clique-decomposition for
computing Gromov hyperbolicity . . . . . 114--139
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Zhongxi Zhang and
Qingguo Li On cartesian closed extensions of
non-pointed domains . . . . . . . . . . 1--9
Paul Bilokon and
Abbas Edalat A domain-theoretic approach to Brownian
motion and general continuous stochastic
processes . . . . . . . . . . . . . . . 10--26
Cristian-Ioan Vasile and
Derya Aksaray and
Calin Belta Time window temporal logic . . . . . . . 27--54
Florian Rabe Morphism axioms . . . . . . . . . . . . 55--80
Kevin H. Xu A class of bounded functions, a database
language and an extended lambda calculus 81--106
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Véronique Terrier Recognition of poly-slender context-free
languages by trellis automata . . . . . 1--24
Maciej Li\'skiewicz and
Rüdiger Reischuk and
Ulrich Wölfel Security levels in steganography ---
Insecurity does not imply detectability 25--45
Andrea Munaro Boundary classes for graph problems
involving non-local properties . . . . . 46--71
Antonio Fernández Anta and
Chryssis Georgiou and
Dariusz R. Kowalski and
Elli Zavou Adaptive packet scheduling over a
wireless channel under constrained
jamming . . . . . . . . . . . . . . . . 72--89
Silvio Biagioni and
Daniel Masny and
Daniele Venturi Naor--Yung paradigm with shared
randomness and applications . . . . . . 90--113
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Hans van Ditmarsch and
Wiebe van der Hoek and
Louwe B. Kuijer The undecidability of arbitrary arrow
update logic . . . . . . . . . . . . . . 1--12
Ferenc Bujtor and
Walter Vogler ACTL for Modal Interface Automata . . . 13--34
Vivek Nigam and
Carlos Olarte and
Elaine Pimentel On subexponentials, focusing and
modalities in concurrent systems . . . . 35--58
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Weian Li and
Wenjing Liu and
Tiantian Chen and
Xiaoying Qu and
Qizhi Fang and
Ker-I Ko Competitive profit maximization in
social networks . . . . . . . . . . . . 1--9
Jaclyn Anderson and
Kristina C. Garrett and
Brian Hopkins Garden of Eden partitions in the sand
pile and related models . . . . . . . . 10--20
Thomas Lukasiewicz and
Enrico Malizia A novel characterization of the
complexity class $ \Theta^P_k $ based on
counting and comparison . . . . . . . . 21--33
B. Jayaram and
S. Arumugam and
K. Thulasiraman Dominator sequences in bipartite graphs 34--41
Leah Epstein and
Elena Kleiman Scheduling selfish jobs on
multidimensional parallel machines . . . 42--59
Meijie Ma and
Douglas B. West and
Jun-Ming Xu The vulnerability of the diameter of the
enhanced hypercubes . . . . . . . . . . 60--65
Feodor F. Dragan and
Arne Leitert On the minimum eccentricity shortest
path problem . . . . . . . . . . . . . . 66--78
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Pascal Halffmann and
Stefan Ruzika and
Clemens Thielen and
David Willems A general approximation method for
bicriteria minimization problems . . . . 1--15
Irena Rusu Graph matching problems and the
NP-hardness of sortedness constraints 16--27
Christoph Dürr and
\Lukasz Je\.z and
Óscar C. Vásquez Mechanism design for aggregating energy
consumption and quality of service in
speed scaling scheduling . . . . . . . . 28--41
Axel Bacher and
Olivier Bodini and
Alice Jacquot Efficient random sampling of binary and
unary-binary trees via holonomic
equations . . . . . . . . . . . . . . . 42--53
Roland Glantz and
Henning Meyerhenke On finding convex cuts in general,
bipartite and plane graphs . . . . . . . 54--73
Shurong Zhang and
Lin Chen and
Weihua Yang On fault-tolerant path optimization
under QoS constraint in multi-channel
wireless networks . . . . . . . . . . . 74--82
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Jianxin Wei and
Yujun Yang and
Guangfu Wang Infinite families of $2$-isometric and
not $3$-isometric binary words . . . . . 1--10
C. Bodei and
L. Brodo and
R. Gori and
F. Levi and
A. Bernini and
D. Hermith A static analysis for Brane Calculi
providing global occurrence counting
information . . . . . . . . . . . . . . 11--51
Da-Jung Cho and
Yo-Sub Han and
Timothy Ng and
Kai Salomaa Pseudoknot-generating operation . . . . 52--64
Wantao Ning The $h$-connectivity of exchanged
crossed cube . . . . . . . . . . . . . . 65--68
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Michael Elkin and
Arnold Filtser and
Ofer Neiman Terminal embeddings . . . . . . . . . . 1--36
Carlo Fuerst and
Maciej Pacut and
Stefan Schmid Data locality and replica aware virtual
cluster embeddings . . . . . . . . . . . 37--57
Takayuki Sakai and
Kazuhisa Seto and
Suguru Tamaki and
Junichi Teruyama Improved exact algorithms for mildly
sparse instances of Max SAT . . . . . . 58--68
Faisal N. Abu-Khzam and
Édouard Bonnet and
Florian Sikora On the complexity of various
parameterizations of common induced
subgraph isomorphism . . . . . . . . . . 69--78
Yulong Wei and
Min Xu On $g$-good-neighbor conditional
diagnosability of $ (n, k)$-star
networks . . . . . . . . . . . . . . . . 79--90
Yunxia Ren and
Shiying Wang The $g$-good-neighbor diagnosability of
locally twisted cubes . . . . . . . . . 91--97
Alfredo Navarra and
Cristina M. Pinotti Online knapsack of unknown capacity: How
to optimize energy consumption in
smartphones . . . . . . . . . . . . . . 98--109
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Simona E. Rombo and
Filippo Utro Foreword: Algorithms, Strings and
Theoretical Approaches in the Big Data
Era --- Special Issue in Honor of the
60th Birthday of Professor Raffaele
Giancarlo . . . . . . . . . . . . . . . 1--3
Amihood Amir and
Alberto Apostolico and
Travis Gagie and
Gad M. Landau String cadences . . . . . . . . . . . . 4--8
Arash Jamshidpey and
David Sankoff Asymptotic medians of random
permutations sampled from reversal
random walks . . . . . . . . . . . . . . 9--13
Jihyuk Lim and
Kunsoo Park A fast algorithm for the all-pairs
suffix--prefix problem . . . . . . . . . 14--24
Maxime Crochemore and
Costas S. Iliopoulos and
Tomasz Kociumaka and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Wale\'n Covering problems for partial words and
for indeterminate strings . . . . . . . 25--39
Loukas Georgiadis and
Giuseppe F. Italiano and
Aikaterini Karanasiou and
Charis Papadopoulos and
Nikos Parotsidis Sparse certificates for $2$-connectivity
in directed graphs . . . . . . . . . . . 40--66
Travis Gagie and
Giovanni Manzini and
Jouni Sirén Wheeler graphs: a framework for
BWT-based data structures . . . . . . . 67--78
Sabrina Mantaci and
Antonio Restivo and
Giovanna Rosone and
Marinella Sciortino and
Luca Versari Measuring the clustering effect of BWT
via RLE . . . . . . . . . . . . . . . . 79--87
Samuele Girotto and
Matteo Comin and
Cinzia Pizzi Metagenomic reads binning with spaced
seeds . . . . . . . . . . . . . . . . . 88--99
Umberto Ferraro Petrillo and
Concettina Guerra and
Cinzia Pizzi A new distributed alignment-free
approach to compare whole proteomes . . 100--112
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Chris Whidden and
Frederick A. Matsen IV Ricci--Ollivier curvature of the rooted
phylogenetic subtree--prune--regraft
graph . . . . . . . . . . . . . . . . . 1--20
Prateek Bhakta and
Dana Randall Sampling weighted perfect matchings on
the square--octagon lattice . . . . . . 21--32
Kevin Durant and
Stephan Wagner On the distribution of betweenness
centrality in random trees . . . . . . . 33--52
Yusuke Kobayashi and
Kenjiro Takazawa Randomized strategies for cardinality
robustness in the knapsack problem . . . 53--62
Takeharu Shiraga and
Yukiko Yamauchi and
Shuji Kijima and
Masafumi Yamashita Total variation discrepancy of
deterministic random walks for ergodic
Markov chains . . . . . . . . . . . . . 63--74
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
José Fuentes-Sepúlveda and
Leo Ferres and
Meng He and
Norbert Zeh Parallel construction of succinct trees 1--22
Shih-Ming Lo and
Wu-Hsiung Lin and
Chiuyuan Chen and
Yu-Chee Tseng Optimal coloring for data collection in
tree-based wireless sensor networks . . 23--36
Qian Wang and
Ji Tian and
Ruyan Fu and
Xiangjuan Yao Online algorithms for scheduling on
batch processing machines with interval
graph compatibilities between jobs . . . 37--44
Mika Amit and
Maxime Crochemore and
Gad M. Landau and
Dina Sokol Locating maximal approximate runs in a
string . . . . . . . . . . . . . . . . . 45--62
Vadim Lozin and
Dmitriy Malyshev and
Raffaele Mosca and
Viktor Zamaraev More results on weighted independent
domination . . . . . . . . . . . . . . . 63--74
Arnab Ganguly and
Wing-Kai Hon and
Rahul Shah and
Sharma V. Thankachan Space-time trade-offs for finding
shortest unique substrings and maximal
unique matches . . . . . . . . . . . . . 75--88
Sanjay Jain and
Jason Teutsch Enumerations including laconic
enumerators . . . . . . . . . . . . . . 89--95
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Lila Kari Editorial . . . . . . . . . . . . . . . 1--1
Gheorghe Paun and
Ion Petre and
Grzegorz Rozenberg and
Arto Salomaa From finite state grammars to natural
computing --- In memory of Solomon
Marcus . . . . . . . . . . . . . . . . . 2--7
Solomon Marcus Ten human needs that education should
take into account . . . . . . . . . . . 8--11
Artiom Alhazov and
Svetlana Cojocaru Small asynchronous $P$ systems with
inhibitors defining non-semilinear sets 12--19
Sepinoud Azimi Steady states of constrained reaction
systems . . . . . . . . . . . . . . . . 20--26
Tim Boykett and
Jarkko Kari and
Ville Salo Finite generating sets for reversible
gate sets under general conservation
laws . . . . . . . . . . . . . . . . . . 27--39
Robert Brijder Sorting by reversals and the theory of
$4$-regular graphs . . . . . . . . . . . 40--53
Cristian S. Calude and
Michael J. Dinneen and
Richard Hua QUBO formulations for the graph
isomorphism problem and related problems 54--69
Da-Jung Cho and
Yo-Sub Han and
Timothy Ng and
Kai Salomaa Outfix-guided insertion . . . . . . . . 70--84
Gabriel Ciobanu and
Eneia Nicolae Todoran Denotational semantics of membrane
systems by using complete metric spaces 85--108
Daniela Genova and
Hendrik Jan Hoogeboom and
Natasa Jonoska A graph isomorphism condition and
equivalence of reaction systems . . . . 109--119
Vesa Halava and
Tero Harju Walks on tilings of polygons . . . . . . 120--124
Juha Honkala Discrete Watson--Crick dynamical systems 125--131
Jetty Kleijn and
Maciej Koutny and
Marta Pietkiewicz-Koutny Signal set tissue systems and
overlapping localities . . . . . . . . . 132--145
Shankara Narayanan Krishna and
Marian Gheorghe and
Florentin Ipate and
Erzsébet Csuhaj-Varjú and
Rodica Ceterchi Further results on generalised
communicating $P$ systems . . . . . . . 146--160
Alberto Leporati and
Luca Manzoni and
Giancarlo Mauri and
Antonio E. Porreca and
Claudio Zandron The counting power of $P$ systems with
antimatter . . . . . . . . . . . . . . . 161--173
Yang Li and
Andrei Paun and
Mihaela Paun Improvements on contours based
segmentation for DNA microarray image
processing . . . . . . . . . . . . . . . 174--189
Vincenzo Manca The principles of informational genomics 190--202
Abdulmelik Mohammed and
Elena Czeizler and
Eugen Czeizler Computational modelling of the kinetic
Tile Assembly Model using a rule-based
approach . . . . . . . . . . . . . . . . 203--215
Mario J. Pérez-Jiménez and
Carmen Graciani and
David Orellana-Martín and
Agustín Riscos-Núñez and
Álvaro Romero-Jiménez and
Luis Valencia-Cabrera Fuzzy reasoning spiking neural $P$
systems revisited: a formalization . . . 216--225
Luis Valencia-Cabrera and
David Orellana-Martín and
Miguel A. Martínez-del-Amor and
Agustín Riscos-Núñez and
Mario J. Pérez-Jiménez Reaching efficiency through
collaboration in membrane systems:
Dissolution, polarization and
cooperation . . . . . . . . . . . . . . 226--234
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Célia Borlido The $ \kappa $-word problem over $ D R
H$ . . . . . . . . . . . . . . . . . . . 1--22
Rod Downey and
Michael McInerney and
Keng Meng Ng Lowness and logical depth . . . . . . . 23--33
Tobias Walter Parikh-reducing Church--Rosser
representations for some classes of
regular languages . . . . . . . . . . . 34--47
Saeed Asaeedi and
Farzad Didehvar and
Ali Mohades $ \alpha $-Concave hull, a
generalization of convex hull . . . . . 48--59
L. F. Antunes and
A. Souto and
P. M. B. Vitányi On the rate of decrease in logical depth 60--64
Hao Zhou and
Yiwei Jiang and
Ping Zhou and
Min Ji and
Yun Zhao Total completion time minimization
scheduling on two hierarchical uniform
machines . . . . . . . . . . . . . . . . 65--76
Sergio Cabello and
Pablo Pérez-Lantero Interval selection in the streaming
model . . . . . . . . . . . . . . . . . 77--96
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Prosenjit Bose and
Jean-Lou De Carufel A general framework for searching on a
line . . . . . . . . . . . . . . . . . . 1--17
Christian Glaßer and
Peter Jonsson and
Barnaby Martin Circuit satisfiability and constraint
satisfaction around Skolem Arithmetic 18--36
Yujia Jin and
Huan Li and
Zhongzhi Zhang Maximum matchings and minimum dominating
sets in Apollonian networks and extended
Tower of Hanoi graphs . . . . . . . . . 37--54
Jugal Garg Market equilibrium under piecewise
Leontief concave utilities . . . . . . . 55--65
Dawei Li and
Xiwen Lu Two-agent parallel-machine scheduling
with rejection . . . . . . . . . . . . . 66--75
Balázs Bulyovszky and
Gábor Horváth Polynomial functions over finite
commutative rings . . . . . . . . . . . 76--86
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Dong Yeap Kang and
O-joung Kwon and
Torstein J. F. Stròmme and
Jan Arne Telle A width parameter useful for chordal and
co-comparability graphs . . . . . . . . 1--17
M. A. Abam and
F. Baharifard and
M. S. Borouny and
H. Zarrabi-Zadeh Fault-tolerant spanners in networks with
symmetric directional antennas . . . . . 18--27
Varukumar Jayapaul and
J. Ian Munro and
Venkatesh Raman and
Srinivas Rao Satti Finding modes with equality comparisons 28--41
F. Blanchet-Sadri and
Sinziana Munteanu Computing generalized de Bruijn
sequences . . . . . . . . . . . . . . . 42--61
Aixia Liu and
Shiying Wang and
Jun Yuan and
Jing Li On $g$-extra conditional diagnosability
of hypercubes and folded hypercubes . . 62--73
Martin Bunder and
Abderrahmane Nitaj and
Willy Susilo and
Joseph Tonien A generalized attack on RSA type
cryptosystems . . . . . . . . . . . . . 74--81
Xiang-Jun Li and
Yong-Ni Guan and
Zheng Yan and
Jun-Ming Xu On fault tolerance of $ (n, k) $-star
networks . . . . . . . . . . . . . . . . 82--86
Ali Reza Sepasian and
Ehsan Monabbati Upgrading min--max spanning tree problem
under various cost functions . . . . . . 87--91
Lucia Draque Penso and
Fábio Protti and
Dieter Rautenbach and
Uéverton dos Santos Souza Corrigendum to ``Complexity analysis of
$ P_3 $-convexity problems on
bounded-degree and planar graphs''
[Theoret. Comput. Sci. 607 Part 1 (2015)
83--95] . . . . . . . . . . . . . . . . 92--93
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Ernst L. Leiss and
Isaac Mackey The worst parallel Hanoi graphs . . . . 1--8
Masahiro Shibata and
Fukuhito Ooshita and
Hirotsugu Kakugawa and
Toshimitsu Masuzawa Move-optimal partial gathering of mobile
agents in asynchronous trees . . . . . . 9--30
Benjamin Hackl and
Clemens Heuberger and
Helmut Prodinger Reductions of binary trees and lattice
paths induced by the register function 31--57
Hung-I Yu and
Cheng-Chung Li and
D. T. Lee The multi-service center problem . . . . 58--74
Nina Chiarelli and
Tatiana R. Hartinger and
Matthew Johnson and
Martin Milanic and
Daniël Paulusma Minimum connected transversals in
graphs: New hardness results and
tractable cases using the price of
connectivity . . . . . . . . . . . . . . 75--83
Koji M. Kobayashi Improved lower bounds for online
scheduling to minimize total stretch . . 84--98
Noam Greenberg and
Joseph S. Miller and
Alexander Shen and
Linda Brown Westrick Dimension 1 sequences are close to
randoms . . . . . . . . . . . . . . . . 99--112
Kingshuk Chatterjee and
Kumar Sankar Ray Non-regular unary language and parallel
communicating Watson-Crick automata
systems . . . . . . . . . . . . . . . . 113--117
Wantao Ning Erratum and corrections to ``The
$h$-connectivity of exchanged crossed
cube'' [Theoret. Comput. Sci. 696 (2017)
65--68] . . . . . . . . . . . . . . . . 118--121
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
M. M. Ebrahimi and
Kh. Keshvardoost and
M. Mahmoudi Simple and subdirectly irreducible
finitely supported $ C b $-sets . . . . 1--21
Chunna Zhao and
Shanshan Li Formalization of fractional order PD
control systems in HOL4 . . . . . . . . 22--34
Aleksandar S. Dimovski Verifying annotated program families
using symbolic game semantics . . . . . 35--53
Paolo Baldan and
Alessandro Beggiato Multilevel transitive and intransitive
non-interference, causally . . . . . . . 54--82
Alexander Leitsch and
Michael Lettmann The problem of $ \Pi_2
$-cut-introduction . . . . . . . . . . . 83--116
Anonymous Editorial Board . . . . . . . . . . . . ifc--ifc
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Enver Kayaaslan and
Thomas Lambert and
Loris Marchal and
Bora Uçar Scheduling series-parallel task graphs
to minimize peak memory . . . . . . . . 1--23
Thibault Godin and
Ines Klimann On bireversible Mealy automata and the
Burnside problem . . . . . . . . . . . . 24--35
Behrooz Alizadeh and
Roghayeh Etemad Optimal algorithms for inverse vertex
obnoxious center location problems on
graphs . . . . . . . . . . . . . . . . . 36--45
Sharareh Alipour and
Mohammad Ghodsi and
Amir Jafari Randomized approximation algorithms for
planar visibility counting problem . . . 46--55
Pingshan Li and
Min Xu Fault-tolerant strong Menger (edge)
connectivity and $3$-extra
edge-connectivity of balanced hypercubes 56--68
Nicolas Martins and
Rudini Sampaio Locally identifying coloring of graphs
with few P4s . . . . . . . . . . . . . . 69--76
Michal Karpi\'nski Encoding cardinality constraints using
standard encoding of generalized
selection networks preserves
arc-consistency . . . . . . . . . . . . 77--81
Jie-Meng Zhang and
Ying-Jun Guo and
Zhi-Xiong Wen On the regularity of $ \{ \lfloor \log_b
(\alpha n + \beta) \rfloor \}_{n \geq 0}
$ . . . . . . . . . . . . . . . . . . . 82--88
Marcin Bienkowski and
Martin Böhm and
\Lukasz Je\.z and
Pawe\l Lasko\'s-Grabowski and
Jan Marcinkowski and
Jirí Sgall and
Aleksandra Spyra and
Pavel Veselý Logarithmic price of buffer downscaling
on line metrics . . . . . . . . . . . . 89--93
Wangwei Li and
Xianhua Li On two problems of almost synchronizing
groups . . . . . . . . . . . . . . . . . 94--95
Litao Guo Reliability analysis of twisted cubes 96--101
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Thiago Marcilon and
Rudini Sampaio The maximum time of $2$-neighbor
bootstrap percolation: Complexity
results . . . . . . . . . . . . . . . . 1--17
Ashutosh Rai and
Saket Saurabh Bivariate complexity analysis of Almost
Forest Deletion . . . . . . . . . . . . 18--33
Meena Mahajan and
Anuj Tawari Sums of read-once formulas: How many
summands are necessary? . . . . . . . . 34--45
Fei Ma and
Bing Yao An iteration method for computing the
total number of spanning trees and its
applications in graph theory . . . . . . 46--57
Nimrod Talmon Structured proportional representation 58--74
Kuo-Tsung Tseng and
De-Sheng Chan and
Chang-Biau Yang and
Shou-Fu Lo Efficient merged longest common
subsequence algorithms for similar
sequences . . . . . . . . . . . . . . . 75--90
B. Litow A transfer method from bounded
existential Diophantine equations to
Tarski algebra formulas . . . . . . . . 91--95
Patryk Mikos A new lower bound for the on-line
coloring of intervals with bandwidth . . 96--100
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Gopal Pandurangan and
Peter Robinson Special Issue of ICDCN 2016 (Distributed
Computing Track) . . . . . . . . . . . . 1--1
Armando Castañeda and
Danny Dolev and
Amitabh Trehan Compact routing messages in self-healing
trees . . . . . . . . . . . . . . . . . 2--19
Jurek Czyzowicz and
Stefan Dobrev and
Konstantinos Georgiou and
Evangelos Kranakis and
Fraser MacQuarrie Evacuating two robots from multiple
unknown exits in a circle . . . . . . . 20--30
Yuan He and
K. Gopalakrishnan and
Eli Gafni Group mutual exclusion in linear time
and space . . . . . . . . . . . . . . . 31--47
Klaus-Tycho Foerster and
Thomas Luedi and
Jochen Seidel and
Roger Wattenhofer Local checkability, no strings attached:
(A)cyclicity, reachability, loop free
updates in SDNs . . . . . . . . . . . . 48--63
Silvia Bonomi and
Antonella Del Pozzo and
Maria Potop-Butucaru Optimal self-stabilizing synchronous
mobile Byzantine-tolerant atomic
register . . . . . . . . . . . . . . . . 64--79
Achour Mostéfaoui and
Hamouma Moumen and
Michel Raynal Randomized $k$-set agreement in
crash-prone and Byzantine asynchronous
systems . . . . . . . . . . . . . . . . 80--97
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Maxime Crochemore and
Solon P. Pissis Advances in Algorithms & Combinatorics on
Strings (Honoring 60th birthday for
Prof. Costas S. Iliopoulos) . . . . . . 1--1
Amihood Amir and
Mika Amit and
Gad M. Landau and
Dina Sokol Period recovery of strings over the
Hamming and edit distances . . . . . . . 2--18
Salvatore Aronica and
Alessio Langiu and
Francesca Marzi and
Salvatore Mazzola and
Filippo Mignosi On optimal parsing for LZ78-like
compressors . . . . . . . . . . . . . . 19--28
Sang Won Bae and
Inbok Lee On finding a longest common palindromic
subsequence . . . . . . . . . . . . . . 29--34
Sukhyeun Cho and
Joong Chae Na and
Jeong Seop Sim An $ O(n^2 \log m) $-time algorithm for
the boxed-mesh permutation pattern
matching problem . . . . . . . . . . . . 35--43
Jacqueline W. Daykin and
Frantisek Franek and
Jan Holub and
A. S. M. Sohidull Islam and
W. F. Smyth Reconstructing a string from its Lyndon
arrays . . . . . . . . . . . . . . . . . 44--51
Jacqueline W. Daykin and
Richard Groult and
Yannick Guesnet and
Thierry Lecroq and
Arnaud Lefebvre and
Martine Léonard and
Élise Prieur-Gaston A survey of string orderings and their
application to the Burrows--Wheeler
transform . . . . . . . . . . . . . . . 52--65
Pawe\l Gawrychowski and
Gad M. Landau and
Shay Mozes and
Oren Weimann The nearest colored node in a tree . . . 66--73
Roberto Grossi and
Giulia Menconi and
Nadia Pisanti and
Roberto Trani and
Sòren Vind Motif trie: an efficient text index for
pattern discovery with don't cares . . . 74--87
Joel Helling and
P. J. Ryan and
W. F. Smyth and
Michael Soltys Constructing an indeterminate string
from its associated graph . . . . . . . 88--96
Michael Hoffmann and
John Iacono and
Patrick K. Nicholson and
Rajeev Raman Encoding nearest larger values . . . . . 97--115
Nantia D. Iakovidou and
Nikos A. Laskaris and
Costas Tsichlas and
Yannis Manolopoulos and
Manolis Christodoulakis and
Eleftherios S. Papathanasiou and
Savvas S. Papacostas and
Georgios D. Mitsis A symbolic dynamics approach to
Epileptic Chronnectomics: Employing
strings to predict crisis onset . . . . 116--125
Tomasz Kociumaka and
Jakub W. Pachocki and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Wale\'n On the string consensus problem and the
Manhattan sequence consensus problem . . 126--138
Tomasz Kociumaka and
Solon P. Pissis and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Wale\'n Efficient algorithms for shortest
partial seeds in words . . . . . . . . . 139--147
Joong Chae Na and
Hyunjoon Kim and
Seunghwan Min and
Heejin Park and
Thierry Lecroq and
Martine Léonard and
Laurent Mouchard and
Kunsoo Park FM-index of alignment with gaps . . . . 148--157
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Yuyan Guo and
Jiguo Li and
Yang Lu and
Yichen Zhang and
Futai Zhang Provably secure certificate-based
encryption with leakage resilience . . . 1--10
Shay Mozes and
Yahav Nussbaum and
Oren Weimann Faster shortest paths in dense distance
graphs, with applications . . . . . . . 11--35
Xiaomin Hu and
Yingzhi Tian and
Xiaodong Liang and
Jixiang Meng Strong matching preclusion for
$k$-composition networks . . . . . . . . 36--43
Eminjan Sabir and
Jixiang Meng Structure fault tolerance of hypercubes
and folded hypercubes . . . . . . . . . 44--55
Marek Karpinski and
Andrzej Lingas and
Dzmitry Sledneu A QPTAS for the base of the number of
crossing-free structures on a planar
point set . . . . . . . . . . . . . . . 56--65
Valentin Garnero and
Konstanty Junosza-Szaniawski and
Mathieu Liedloff and
Pedro Montealegre and
Pawe\l Rz\ka\.zewski Fixing improper colorings of graphs . . 66--78
Farzam Ebrahimnejad On the gap between separating words and
separating their reversals . . . . . . . 79--91
Patrice Séébold Sturmian images of non Sturmian words
and standard morphisms . . . . . . . . . 92--104
Erez Kantor and
Zvi Lotker and
Merav Parter and
David Peleg The topology of wireless communication
on a line . . . . . . . . . . . . . . . 105--108
Tomá\vs Masopust Separability by piecewise testable
languages is PTime-complete . . . . . . 109--114
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
James Lipton and
Susana Nieva Kripke semantics for higher-order type
theory applied to constraint logic
programming languages . . . . . . . . . 1--37
K. Kalorkoti Solving \Lukasiewicz $ \mu $-terms . . . 38--49
Guy Avni and
Orna Kupferman Synthesis from component libraries with
costs . . . . . . . . . . . . . . . . . 50--72
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Átila A. Jones and
Fábio Protti and
Renata R. Del-Vecchio Cograph generation with linear delay . . 1--10
Yaping Mao and
Zhao Wang and
Eddie Cheng and
Christopher Melekian Strong matching preclusion number of
graphs . . . . . . . . . . . . . . . . . 11--20
Eric J. Friedman and
Adam S. Landsberg Duality and nonlinear graph Laplacians 21--30
Kalle Rutanen Minimal characterization of $O$-notation
in algorithm analysis . . . . . . . . . 31--41
Lantao You and
Jianxi Fan and
Yuejuan Han Super spanning connectivity on
WK-recursive networks . . . . . . . . . 42--55
Bennet Goeckner and
Corbin Groothuis and
Cyrus Hettle and
Brian Kell and
Pamela Kirkpatrick and
Rachel Kirsch and
Ryan Solava Universal partial words over non-binary
alphabets . . . . . . . . . . . . . . . 56--65
Philip Bille and
Mikko Berggren Ettienne and
Inge Li Gòrtz and
Hjalte Wedel Vildhòj Time-space trade-offs for Lempel--Ziv
compressed indexing . . . . . . . . . . 66--77
Emilio Di Giacomo and
Walter Didimo and
William S. Evans and
Giuseppe Liotta and
Henk Meijer and
Fabrizio Montecchiani and
Stephen K. Wismath New results on edge partitions of
$1$-plane graphs . . . . . . . . . . . . 78--84
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
K. K. Kayibi and
S. Pirzada $T$-tetrominoes tiling's Markov chain
mixes fast . . . . . . . . . . . . . . . 1--14
Jianchang Lai and
Yi Mu and
Fuchun Guo and
Rongmao Chen and
Sha Ma Efficient $k$-out-of-$n$ oblivious
transfer scheme with the ideal
communication cost . . . . . . . . . . . 15--26
Huabin Cao and
Bicheng Zhang and
Zhiheng Zhou One-to-one disjoint path covers in
digraphs . . . . . . . . . . . . . . . . 27--35
Janosch Döcker and
Simone Linz On the existence of a cherry-picking
sequence . . . . . . . . . . . . . . . . 36--50
Emilio Di Giacomo and
Giuseppe Liotta and
Fabrizio Montecchiani Drawing subcubic planar graphs with four
slopes and optimal angular resolution 51--73
Petr Gregor and
Torsten Mütze Trimming and gluing Gray codes . . . . . 74--95
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Kaourintin Le Guiban and
Arpad Rimmel and
Marc-Antoine Weisser and
Joanna Tomasik Completion of partial Latin Hypercube
Designs: NP-completeness and
inapproximability . . . . . . . . . . . 1--20
Peter Jonsson and
Johan Thapper Tractability conditions for numeric CSPs 21--34
Carla Negri Lintzmayer and
Guillaume Fertin and
Zanoni Dias Sorting permutations and binary strings
by length-weighted rearrangements . . . 35--59
Sang Duk Yoon and
Min-Gyu Kim and
Wanbin Son and
Hee-Kap Ahn Geometric matching algorithms for two
realistic terrains . . . . . . . . . . . 60--70
Eric Duchêne and
Marc Heinrich and
Urban Larsson and
Aline Parreau The switch operators and push-the-button
games: A sequential compound over
rulesets . . . . . . . . . . . . . . . . 71--85
Claire Capdevielle and
Colette Johnen and
Alessia Milani On the complexity of basic abstractions
to implement consensus . . . . . . . . . 86--96
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Kamalika Chaudhuri and
Claudio Gentile Special Issue on ALT 2015: Guest
Editors' Introduction . . . . . . . . . 1--3
Montserrat Hermo and
Ana Ozaki Exact learning of multivalued dependency
formulas . . . . . . . . . . . . . . . . 4--14
Hasan Abasi and
Nader H. Bshouty and
Hanna Mazzawi Non-adaptive learning of a hidden
hypergraph . . . . . . . . . . . . . . . 15--27
Jan Leike and
Marcus Hutter On the computability of Solomonoff
induction and AIXI . . . . . . . . . . . 28--49
Francesco Orabona and
Dávid Pál Scale-free online learning . . . . . . . 50--69
Malte Darnstädt and
Christoph Ries and
Hans Ulrich Simon Hierarchical design of fast Minimum
Disagreement algorithms . . . . . . . . 70--88
Borja Balle and
Mehryar Mohri Generalization bounds for learning
weighted automata . . . . . . . . . . . 89--106
Ziyuan Gao and
Hans Ulrich Simon and
Sandra Zilles On the teaching complexity of linear
sets . . . . . . . . . . . . . . . . . . 107--123
Liu Yang and
Steve Hanneke and
Jaime Carbonell Bounds on the minimax rate for
estimating a prior over a VC class from
independent learning tasks . . . . . . . 124--140
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Riccardo Dondi and
Guillaume Fertin and
Giancarlo Mauri Editorial . . . . . . . . . . . . . . . 1--1
Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim-Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
Jérôme Monnot and
Vangelis Th. Paschos The many facets of upper domination . . 2--25
Robert Bredereck and
Jiehua Chen and
Falk Hüffner and
Stefan Kratsch Parameterized complexity of team
formation in social networks . . . . . . 26--36
Massimiliano Goldwurm and
Jianyi Lin and
Francesco Sacc\`a On the complexity of clustering with
relaxed size constraints in fixed
dimension . . . . . . . . . . . . . . . 37--46
Konstantinos Georgiou and
George Karakostas and
Evangelos Kranakis and
Danny Krizanc Know when to persist: Deriving value
from a stream buffer . . . . . . . . . . 47--61
Christos Kaklamanis and
Panagiotis Kanellopoulos and
Sophia Tsokana On network formation games with
heterogeneous players and basic network
creation games . . . . . . . . . . . . . 62--72
Thomas Bellitto Separating codes and traffic monitoring 73--85
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Rossella Petreschi and
Mohammad Kaykobad Preface . . . . . . . . . . . . . . . . 1--1
Sang Won Bae Computing a minimum-width square annulus
in arbitrary orientation . . . . . . . . 2--13
Sang Won Bae and
Hwan-Gue Cho and
William Evans and
Noushin Saeedi and
Chan-Su Shin Covering points with convex sets of
minimum size . . . . . . . . . . . . . . 14--23
Oliver G. Czibula and
Hanyu Gu and
Yakov Zinder Lagrangian relaxation versus genetic
algorithm based metaheuristic for a
large partitioning problem . . . . . . . 24--36
Alonso Gragera and
Vorapong Suppakitpaisarn Relaxed triangle inequality ratio of the
Sòrensen--Dice and Tversky indexes . . . 37--45
Tiziana Calamoneri and
Angelo Monti and
Rossella Petreschi On dynamic threshold graphs and related
classes . . . . . . . . . . . . . . . . 46--57
Shun Hasegawa and
Toshiya Itoh Optimal online algorithms for the
multi-objective time series search
problem . . . . . . . . . . . . . . . . 58--66
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Catherine Greenhill and
Matteo Sfragara The switch Markov chain for sampling
irregular graphs and digraphs . . . . . 1--20
Christian Schridde On the construction of graphs with a
planar bipartite double cover from
boolean formulas and its application to
counting satisfying solutions . . . . . 21--45
Alexander Golovnev and
Alexander S. Kulikov and
Alexander V. Smal and
Suguru Tamaki Gate elimination: Circuit size lower
bounds and #SAT upper bounds . . . . . . 46--63
J. Bang-Jensen and
S. Bessy and
F. Havet and
A. Yeo Out-degree reducing partitions of
digraphs . . . . . . . . . . . . . . . . 64--72
Mikhail Barash and
Alexander Okhotin Linear-space recognition for grammars
with contexts . . . . . . . . . . . . . 73--85
Wen Chean Teh and
Adrian Atanasiu and
Ghajendran Poovanandran On strongly $M$-unambiguous prints and
Serb\uanut\ua's conjecture for Parikh
matrices . . . . . . . . . . . . . . . . 86--93
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Jirí Síma and
Petr Savický Quasi-periodic $ \beta $-expansions and
cut languages . . . . . . . . . . . . . 1--23
Shaheena Sultana and
Md. Saidur Rahman Realizability of graphs as triangle
cover contact graphs . . . . . . . . . . 24--35
Joan Boyar and
Magnus Gausdal Find Multiplicative complexity of vector
valued Boolean functions . . . . . . . . 36--46
Liren Shan and
Huan Li and
Zhongzhi Zhang Independence number and the number of
maximum independent sets in
pseudofractal scale-free web and
Sierpi\'nski gasket . . . . . . . . . . 47--54
Damian Repke and
Wojciech Rytter On semi-perfect de Bruijn words . . . . 55--63
Maximilian Fürst and
Marilena Leichter and
Dieter Rautenbach Locally searching for large induced
matchings . . . . . . . . . . . . . . . 64--72
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Vincent Moulton and
Andreas Spillner and
Taoyang Wu UPGMA and the normalized equidistant
minimum evolution problem . . . . . . . 1--15
Chu-Han Cheng and
Po-An Chen and
Wing-Kai Hon Budget-constrained multi-battle
contests: A new perspective and analysis 16--26
Zhiqiang Liu and
Yukiko Yamauchi and
Shuji Kijima and
Masafumi Yamashita Team assembling problem for asynchronous
heterogeneous mobile robots . . . . . . 27--41
Sergei Bezrukov and
Pavle Bulatovic and
Nikola Kuzmanovski New infinite family of regular
edge-isoperimetric graphs . . . . . . . 42--53
Harry Altman Internal structure of addition chains:
Well-ordering . . . . . . . . . . . . . 54--69
Yassine Ouazene and
Farouk Yalaoui Identical parallel machine scheduling
with time-dependent processing times . . 70--77
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Ales Bizjak and
Lars Birkedal A model of guarded recursion via
generalised equilogical spaces . . . . . 1--18
Mario Bravetti and
Marco Carbone and
Gianluigi Zavattaro On the boundary between decidability and
undecidability of asynchronous session
subtyping . . . . . . . . . . . . . . . 19--51
Min Zhang and
Kazuhiro Ogata From hidden to visible: A unified
framework for transforming behavioral
theories into rewrite theories . . . . . 52--75
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Deeksha Adil and
Sushmita Gupta and
Sanjukta Roy and
Saket Saurabh and
Meirav Zehavi Parameterized algorithms for stable
matching with ties and incomplete lists 1--10
Roman Kolpakov On the number of gapped repeats with
arbitrary gap . . . . . . . . . . . . . 11--22
Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Philipp Kindermann and
Thomas Schneck $1$-Fan-bundle-planar drawings of graphs 23--50
S. Canard and
D. H. Phan and
D. Pointcheval and
V. C. Trinh A new technique for compacting
ciphertext in multi-channel broadcast
encryption and attribute-based
encryption . . . . . . . . . . . . . . . 51--72
Yi-Hua Yang and
Chung-Shou Liao and
Xin Han and
Louxin Zhang Online buffer management for
transmitting packets with processing
cycles . . . . . . . . . . . . . . . . . 73--83
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Lila Kari Editorial . . . . . . . . . . . . . . . iii--iii
Miguel Á. Martínez-del-Amor and
Agustín Riscos-Núñez and
Luis Valencia-Cabrera Preface . . . . . . . . . . . . . . . . 1--2
Zhiqiang Zhang and
Yansen Su and
Linqiang Pan The computational power of enzymatic
numerical $P$ systems working in the
sequential mode . . . . . . . . . . . . 3--12
Tingfang Wu and
Yanfeng Wang and
Suxia Jiang and
Yansen Su and
Xiaolong Shi Spiking neural $P$ systems with rules on
synapses and anti-spikes . . . . . . . . 13--27
Linqiang Pan and
Bosheng Song and
Atulya K. Nagar and
K. G. Subramanian Language generating alphabetic flat
splicing $P$ systems . . . . . . . . . . 28--34
Kristóf Kántor and
György Vaszil On the classes of languages
characterized by generalized $P$ colony
automata . . . . . . . . . . . . . . . . 35--44
Marian Gheorghe and
Rodica Ceterchi and
Florentin Ipate and
Savas Konur and
Raluca Lefticaru Kernel $P$ systems: From modelling to
verification and testing . . . . . . . . 45--60
Lucie Ciencialová and
Ludek Cienciala and
Petr Sosík Generalized $P$ colonies with passive
environment . . . . . . . . . . . . . . 61--68
Zijun Wu and
Rolf H. Möhring and
Jianhui Lai Stochastic runtime analysis of a
Cross-Entropy algorithm for traveling
salesman problems . . . . . . . . . . . 69--86
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Nathann Cohen and
Nícolas A. Martins and
Fionn Mc Inerney and
Nicolas Nisse and
Stéphane Pérennes and
Rudini Sampaio Spy-game on graphs: Complexity and
simple topologies . . . . . . . . . . . 1--15
Ankush Acharyya and
Subhas C. Nandy and
Sasanka Roy Minimum width color spanning annulus . . 16--30
Alejandro Flores-Lamas and
José Alberto Fernández-Zepeda and
Joel Antonio Trejo-Sánchez Algorithm to find a maximum $2$-packing
set in a cactus . . . . . . . . . . . . 31--51
Urban Larsson and
Richard J. Nowakowski and
Carlos P. Santos Game comparison through play . . . . . . 52--63
Kai Jin and
Jian Li and
Haitao Wang and
Bowei Zhang and
Ningye Zhang Near-linear time approximation schemes
for geometric maximum coverage . . . . . 64--78
Seok-Hee Hong and
Hiroshi Nagamochi Simpler algorithms for testing two-page
book embedding of partitioned graphs . . 79--98
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Guilhem Gamard and
Pascal Ochem and
Gwenaël Richomme and
Patrice Séébold Avoidability of circular formulas . . . 1--4
Yangjun Chen and
Yujia Wu On the string matching with $k$
mismatches . . . . . . . . . . . . . . . 5--29
Kyle Fox and
Sungjin Im and
Benjamin Moseley Energy efficient scheduling of
parallelizable jobs . . . . . . . . . . 30--40
Martin Biely and
Peter Robinson and
Ulrich Schmid and
Manfred Schwarz and
Kyrill Winkler Gracefully degrading consensus and
$k$-set agreement in directed dynamic
networks . . . . . . . . . . . . . . . . 41--77
Palash Dey and
Neeldhara Misra and
Y. Narahari Complexity of manipulation with partial
information in voting . . . . . . . . . 78--99
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Mohammad Alqarni and
Ryszard Janicki Interval semantics for Petri nets with
inhibitor arcs . . . . . . . . . . . . . 1--23
Taolue Chen and
Tingting Han and
Yongzhi Cao Polynomial-time algorithms for computing
distances of fuzzy transition systems 24--36
Sebastian Enqvist and
Fatemeh Seifan and
Yde Venema Completeness for the modal $ \mu
$-calculus: Separating the combinatorics
from the dynamics . . . . . . . . . . . 37--100
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Qi Cheng and
Pingshan Li and
Min Xu Conditional (edge-)fault-tolerant strong
Menger (edge) connectivity of folded
hypercubes . . . . . . . . . . . . . . . 1--8
Yanze Huang and
Limei Lin and
Dajin Wang On the reliability of alternating group
graph-based networks . . . . . . . . . . 9--28
Joost Engelfriet and
Andreas Maletti and
Sebastian Maneth Multiple context-free tree grammars:
Lexicalization and characterization . . 29--99
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Katsuhisa Yamanaka and
Takashi Horiyama and
J. Mark Keil and
David Kirkpatrick and
Yota Otachi and
Toshiki Saitoh and
Ryuhei Uehara and
Yushi Uno Swapping colored tokens on graphs . . . 1--10
Júlio Araújo and
Julien Baste and
Ignasi Sau Ruling out FPT algorithms for Weighted
Coloring on forests . . . . . . . . . . 11--19
Samuele Giraudo and
Stéphane Vialette Algorithmic and algebraic aspects of
unshuffling permutations . . . . . . . . 20--41
Hans Kleine Büning and
Piotr Wojciechowski and
K. Subramani Finding read-once resolution refutations
in systems of 2CNF clauses . . . . . . . 42--56
Farnaz Sheikhi and
Ali Mohades Planar maximum-box problem revisited . . 57--67
Sergey Bereg and
Binay Bhattacharya and
Sandip Das and
Tsunehiko Kameda and
Priya Ranjan Sinha Mahapatra and
Zhao Song Optimizing squares covering a set of
points . . . . . . . . . . . . . . . . . 68--83
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
San Ling and
Khoa Nguyen and
Adeline Roux-Langlois and
Huaxiong Wang A lattice-based group signature scheme
with verifier-local revocation . . . . . 1--20
Manu Basavaraju and
Fahad Panolan and
Ashutosh Rai and
M. S. Ramanujan and
Saket Saurabh On the kernelization complexity of
string problems . . . . . . . . . . . . 21--31
Bostjan Bresar and
Tanja Gologranc and
Tim Kos Convex and isometric domination of
(weak) dominating pair graphs . . . . . 32--43
Elizabeth A. Quaglia and
Ben Smyth Secret, verifiable auctions from
elections . . . . . . . . . . . . . . . 44--92
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Iosif Salem and
Elad M. Schiller and
Marina Papatriantafilou and
Philippas Tsigas Shared-object system equilibria: Delay
and throughput analysis . . . . . . . . 1--27
Fan Wang and
Wuyang Sun A type of perfect matchings extend to
Hamiltonian cycles in $k$-ary $n$-cubes 28--35
Palash Dey Manipulative elicitation --- a new
attack on elections with incomplete
preferences . . . . . . . . . . . . . . 36--49
Shengjie He and
Rong-Xia Hao and
Eddie Cheng Strongly Menger-edge-connectedness and
strongly Menger-vertex-connectedness of
regular networks . . . . . . . . . . . . 50--67
Adam Case and
Jack H. Lutz Mutual dimension and random sequences 68--87
João Araújo and
Michael Kinyon and
Janusz Konieczny and
António Malheiro Decidability and independence of
conjugacy problems in finitely presented
monoids . . . . . . . . . . . . . . . . 88--98
Steven Kelk and
Georgios Stamoulis and
Taoyang Wu Treewidth distance on phylogenetic trees 99--117
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Alexandre Blondin Massé and
Julien de Carufel and
Alain Goupil and
Mélodie Lapointe and
Émile Nadeau and
Élise Vandomme Leaf realization problem, caterpillar
graphs and prefix normal words . . . . . 1--13
Martijn van Ee and
René Sitters Approximation and complexity of
multi-target graph search and the
Canadian traveler problem . . . . . . . 14--25
Chuangyin Dang and
Yinyu Ye On the complexity of an expanded
Tarski's fixed point problem under the
componentwise ordering . . . . . . . . . 26--45
Graham Farr and
Nhan Bao Ho The Sprague--Grundy function for some
nearly disjunctive sums of Nim and
Silver Dollar games . . . . . . . . . . 46--59
Sándor Vágvölgyi Descendants of a recognizable tree
language for prefix constrained linear
monadic term rewriting with position
cutting strategy . . . . . . . . . . . . 60--72
Michel Dekking The Frobenius problem for homomorphic
embeddings of languages into the
integers . . . . . . . . . . . . . . . . 73--79
Erik D. Demaine and
Mikhail Rudoy A simple proof that the $ (n^2 -
1)$-puzzle is hard . . . . . . . . . . . 80--84
Vesa Halava and
Tero Harju and
Esa Sahla On fixed points of rational
transductions . . . . . . . . . . . . . 85--88
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Thomas Zeugmann Guest Editor's Foreword [Preface:
special issue on learning theory and
complexity] . . . . . . . . . . . . . . 1--3
Nader H. Bshouty Exact learning from an honest teacher
that answers membership queries . . . . 4--43
Henning Fernau and
Florin Manea and
Robert Mercas and
Markus L. Schmid Revisiting Shinohara's algorithm for
computing descriptive patterns . . . . . 44--54
John Case and
Sanjay Jain and
Frank Stephan Effectivity questions for Kleene's
recursion theorem . . . . . . . . . . . 55--70
Marcus Hutter Tractability of batch to sequential
conversion . . . . . . . . . . . . . . . 71--82
Akinori Kawachi Circuit lower bounds from
learning-theoretic approaches . . . . . 83--98
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Daming Zhu and
Sergey Bereg Preface . . . . . . . . . . . . . . . . 1--2
Zihe Chen and
Danyang Chen and
Xiangyu Wang and
Robert J. Damiano and
Hui Meng and
Jinhui Xu Novel geometric approach for virtual
coiling . . . . . . . . . . . . . . . . 3--14
Peng Zou and
Hui Li and
Wencheng Wang and
Chunlin Xin and
Binhai Zhu Finding disjoint dense clubs in a social
network . . . . . . . . . . . . . . . . 15--23
Weitian Tong and
Eiji Miyano and
Randy Goebel and
Guohui Lin An approximation scheme for minimizing
the makespan of the parallel identical
multi-stage flow-shops . . . . . . . . . 24--31
Xingfu Li and
Haodi Feng and
Haotao Jiang and
Binhai Zhu Solving the maximum internal spanning
tree problem on interval graphs in
polynomial time . . . . . . . . . . . . 32--37
Lianrong Pu and
Yu Lin and
Daming Zhu and
Haitao Jiang Can a breakpoint graph be decomposed
into none other than $2$-cycles? . . . . 38--45
Lili Mei and
Deshi Ye and
Guochuan Zhang Mechanism design for one-facility
location game with obnoxious effects on
a line . . . . . . . . . . . . . . . . . 46--57
Yuzhe Ma and
Kun He and
John Hopcroft and
Pan Shi Neighbourhood-preserving dimension
reduction via localised multidimensional
scaling . . . . . . . . . . . . . . . . 58--71
Yongjie Yang and
Yash Raj Shrestha and
Wenjun Li and
Jiong Guo On the kernelization of split graph
problems . . . . . . . . . . . . . . . . 72--82
Yunlong Liu and
Shaokai Wang and
Jianxin Wang Parameterized counting matching and
packing: A family of hard problems that
admit FPTRAS . . . . . . . . . . . . . . 83--93
Qilong Feng and
Neng Huang and
Xiong Jiang and
Jianxin Wang Dealing with several parameterized
problems by random methods . . . . . . . 94--104
Qilong Feng and
Shaohua Li and
Zeyang Zhou and
Jianxin Wang Parameterized algorithms for Edge
Biclique and related problems . . . . . 105--118
Shaun Fallat and
Karen Meagher and
Abolghasem Soltani and
Boting Yang Compressed cliques graphs, clique
coverings and positive zero forcing . . 119--130
Zhi-Zhong Chen and
Youta Harada and
Fei Guo and
Lusheng Wang Approximation algorithms for the
scaffolding problem and its
generalizations . . . . . . . . . . . . 131--141
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Joël Ouaknine and
Igor Potapov and
James Worrell Reachability Problems 2014: Special
issue . . . . . . . . . . . . . . . . . 1--1
Stéphane Demri and
Amit Kumar Dhar and
Arnaud Sangnier Equivalence between model-checking flat
counter systems and Presburger
arithmetic . . . . . . . . . . . . . . . 2--23
Gilles Geeraerts and
Joël Goossens and
Thi-Van-Anh Nguyen and
Amélie Stainer Synthesising succinct strategies in
safety games with an application to
real-time scheduling . . . . . . . . . . 24--49
Piotr Hofman and
Patrick Totzke Trace inclusion for one-counter nets
revisited . . . . . . . . . . . . . . . 50--63
Aleksandra Jovanovi\'c and
Marta Kwiatkowska Parameter synthesis for probabilistic
timed automata using stochastic game
abstractions . . . . . . . . . . . . . . 64--81
Paul Hunter and
Arno Pauly and
Guillermo A. Pérez and
Jean-François Raskin Mean-payoff games with partial
observation . . . . . . . . . . . . . . 82--110
Serge Haddad and
Benjamin Monmege Interval iteration algorithm for MDPs
and IMDPs . . . . . . . . . . . . . . . 111--131
Hugo Bazille and
Olivier Bournez and
Walid Gomaa and
Amaury Pouly On the complexity of bounded time and
precision reachability for piecewise
affine systems . . . . . . . . . . . . . 132--146
Dmitry Chistikov and
Christoph Haase and
Simon Halfon Context-free commutative grammars with
integer counters and resets . . . . . . 147--161
Lila Kari Editorial . . . . . . . . . . . . . . . ii--ii
Kelvin C. Buño and
Francis George C. Cabarle and
Marj Darrel Calabia and
Henry N. Adorna Solving the $N$-Queens problem using dP
systems with active membranes . . . . . iii--iii
Luis Valencia-Cabrera and
David Orellana-Martín and
Miguel Á. Martínez-del-Amor and
Agustín Riscos-Núñez and
Mario J. Pérez-Jiménez From distribution to replication in
cooperative systems with active
membranes: a frontier of the efficiency 1--14
Anonymous Editorial Board . . . . . . . . . . . . 1--102
Jonathan E. Rowe Linear multi-objective drift analysis 15--24
Damien Regnault and
Éric Rémila Lost in self-stabilization: a local
process that aligns connected cells . . 25--40
S. A. Grillo and
F. L. Marquezino Quantum Query as a state decomposition 41--61
Gheorghe Paun A dozen of research topics in membrane
computing . . . . . . . . . . . . . . . 62--75
Roberto Barbuti and
Roberta Gori and
Paolo Milazzo Predictors for flat membrane systems . . 76--78
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Artem Polyvyanyy and
Jan Sürmeli and
Matthias Weidlich Interleaving isotactics --- An
equivalence notion on behaviour
abstractions . . . . . . . . . . . . . . 1--18
Ch. Choffrut and
Z. Ésik Two equational theories of partial words 19--39
Giovanna D'Agostino and
Giacomo Lenzi The $ \mu $-Calculus Alternation Depth
Hierarchy is infinite over finite planar
graphs . . . . . . . . . . . . . . . . . 40--61
Maurício Ayala-Rincón and
Maribel Fernández and
Ana Cristina Rocha-Oliveira and
Daniel Lima Ventura Nominal essential intersection types . . 62--80
Guillermo Badia and
Carles Noguera Fra\"\issé classes of graded relational
structures . . . . . . . . . . . . . . . 81--90
Oscar H. Ibarra and
Ian McQuillan Variations of checking stack automata:
Obtaining unexpected decidability
properties . . . . . . . . . . . . . . . ii--ii
Lei Sun and
Fang-Wei Fu Constructions of balanced odd-variable
rotation symmetric Boolean functions
with optimal algebraic immunity and high
nonlinearity . . . . . . . . . . . . . . 1--12
Anonymous Editorial Board . . . . . . . . . . . . 1--80
James D. Currie and
Lucas Mol and
Narad Rampersad Avoidance bases for formulas with
reversal . . . . . . . . . . . . . . . . 13--24
Taisuke Izumi and
Daichi Kaino and
Maria Gradinariu Potop-Butucaru and
Sébastien Tixeuil On time complexity for
connectivity-preserving scattering of
mobile robots . . . . . . . . . . . . . 25--41
Kamiel Cornelissen and
Bodo Manthey Belief propagation for the
maximum-weight independent set and
minimum spanning tree problems . . . . . 42--52
Martin Anthony and
Joel Ratsaby Large width nearest prototype
classification on general distance
spaces . . . . . . . . . . . . . . . . . 53--64
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Riccardo Dondi and
Florian Sikora Parameterized complexity and
approximation issues for the colorful
components problems . . . . . . . . . . 1--12
Yu Chen and
Baodong Qin and
Haiyang Xue Regular lossy functions and their
applications in leakage-resilient
cryptography . . . . . . . . . . . . . . 13--38
Narges Noori and
Volkan Isler The lion and man game on polyhedral
surfaces with obstacles . . . . . . . . 39--58
Wenwen Zhang and
Jian-Liang Wu Edge coloring of planar graphs without
adjacent $7$-cycles . . . . . . . . . . 59--64
Tatsuhiko Hatanaka and
Takehiro Ito and
Xiao Zhou Parameterized complexity of the list
coloring reconfiguration problem with
graph parameters . . . . . . . . . . . . 65--79
Wenjun Li and
Binhai Zhu A $ 2 k $-kernelization algorithm for
vertex cover based on crown
decomposition . . . . . . . . . . . . . 80--85
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Peter Kostolányi and
Filip Misún Alternating weighted automata over
commutative semirings . . . . . . . . . 1--27
Arno Mittelbach and
Daniele Venturi Fiat--Shamir for highly sound protocols
is instantiable . . . . . . . . . . . . 28--62
Juha Honkala Equality sets of binary D0L sequences 63--67
Wenhua Li and
Xing Chai and
Yali Song A best possible on-line algorithm for
scheduling on uniform parallel-batch
machines . . . . . . . . . . . . . . . . 68--75
Athanasios L. Konstantinidis and
Stavros D. Nikolopoulos and
Charis Papadopoulos Strong triadic closure in cographs and
graphs of low maximum degree . . . . . . 76--84
Martin Hofmann and
David Aspinall and
Brian Campbell and
Ian Stark and
Perdita Stevens Foreword . . . . . . . . . . . . . . . . ii--ii
Andrew J. Kennedy and
Claudio V. Russo Transposing G to C$^\sharp $:
Expressivity of generalized algebraic
data types in an object-oriented
language . . . . . . . . . . . . . . . . 1--2
Anonymous Editorial Board . . . . . . . . . . . . 1--70
Fernando Orejas and
Elvira Pino and
Marisa Navarro and
Leen Lambers Institutions for navigational logics for
graphical structures . . . . . . . . . . 3--18
Robert Harper Exception tracking in an open world . . 19--24
Rolf Hennicker and
Alexandre Madeira and
Martin Wirsing Behavioural and abstractor
specifications revisited . . . . . . . . 25--31
Peter D. Mosses CoFI with Don Sannella . . . . . . . . . 32--43
Neil Ghani and
Clemens Kupke and
Alasdair Lambert and
Fredrik Nordvall Forsberg A compositional treatment of iterated
open games . . . . . . . . . . . . . . . 44--47
Till Mossakowski and
Bernd Krieg-Brückner Partial pushout semantics of generics in
DOL . . . . . . . . . . . . . . . . . . 48--57
Ronald Ortner and
Hans Ulrich Simon Guest Editors' Foreword . . . . . . . . ii--ii
Emilie Kaufmann and
Thomas Bonald and
Marc Lelarge A spectral algorithm with additive
clustering for the recovery of
overlapping communities in networks . . 1--2
Anonymous Editorial Board . . . . . . . . . . . . 1--114
N. Zhivotovskiy and
S. Hanneke Localization of VC classes: Beyond local
Rademacher complexities . . . . . . . . 3--26
Wojciech Kotlowski On minimaxity of Follow the Leader
strategy in the stochastic setting . . . 27--49
Rupert Hölzl and
Sanjay Jain and
Frank Stephan Learning pattern languages over groups 50--65
Nader H. Bshouty and
Areej Costa Exact learning of juntas from membership
queries . . . . . . . . . . . . . . . . 66--81
Sivan Sabato Submodular learning and covering with
response-dependent costs . . . . . . . . 82--97
Sébastien Ferenczi and
Christian Mauduit and
Carlos Gustavo Moreira An algorithm for the word entropy . . . ii--ii
Daniel Gabric and
Joe Sawada Constructing de Bruijn sequences by
concatenating smaller universal cycles 1--11
Anonymous Editorial Board . . . . . . . . . . . . 1--166
Karel Klouda and
Katerina Medková and
Edita Pelantová and
Stepán Starosta Fixed points of Sturmian morphisms and
their derivated words . . . . . . . . . 12--22
Ferdinando Cicalese and
Zsuzsanna Lipták and
Massimiliano Rossi Bubble-Flip --- a new generation
algorithm for prefix normal words . . . 23--37
Norman Carey and
David Clampitt Partitioned factors in Christoffel and
Sturmian words . . . . . . . . . . . . . 38--52
Karl Petersen and
Ibrahim Salama Tree shift topological entropy . . . . . 53--63
James Currie and
Florin Manea and
Dirk Nowotka and
Kamellia Reshadi Unary patterns under permutations . . . 64--71
Wen Chean Teh and
K. G. Subramanian and
Somnath Bera Order of weak $M$-relation and Parikh
matrices . . . . . . . . . . . . . . . . 72--82
Karell Bertet and
Christophe Demko and
Jean-François Viaud and
Clément Guérin Lattices, closures systems and
implication bases: a survey of
structural aspects and algorithms . . . 83--92
Cunjing Ge and
Feifei Ma and
Peng Zhang and
Jian Zhang Computing and estimating the volume of
the solution space of SMT(LA)
constraints . . . . . . . . . . . . . . 93--109
Michael A. Bender and
Rezaul A. Chowdhury and
Pramod Ganapathi and
Samuel McCauley and
Yuan Tang The range 1 query (R1Q) problem . . . . 110--129
Jacob Hendricks and
Matthew J. Patitz and
Trent A. Rogers and
Scott M. Summers The power of duples (in self-assembly):
It's not so hip to be square . . . . . . 130--147
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Augusto Sampaio and
Farn Wang Theoretical aspects of computing . . . . 1--2
Parvaneh Babari and
Manfred Droste and
Vitaly Perevoshchikov Weighted register automata and weighted
logic on data words . . . . . . . . . . 3--21
Mario Benevides and
Bruno Lopes and
Edward Hermann Haeusler Towards reasoning about Petri nets: a
Propositional Dynamic Logic based
approach . . . . . . . . . . . . . . . . 22--36
Walter Guttmann An algebraic framework for minimum
spanning tree problems . . . . . . . . . 37--55
Michell Guzmán and
Salim Perchy and
Camilo Rueda and
Frank D. Valencia Characterizing right inverses for
spatial constraint systems with
applications to modal logic . . . . . . 56--77
Alexandre Madeira and
Luís S. Barbosa and
Rolf Hennicker and
Manuel A. Martins A logic for the stepwise development of
reactive systems . . . . . . . . . . . . 78--96
Annabelle McIver and
Tahiry Rabehaja and
Georg Struth Schedulers and finishers: On generating
and filtering the behaviours of an event
structure . . . . . . . . . . . . . . . 97--112
Renato Neves and
Luís S. Barbosa Languages and models for hybrid
automata: a coalgebraic perspective . . 113--142
Maike Schwammberger An abstract model for proving safety of
autonomous urban traffic . . . . . . . . 143--169
Joachim M. Buhmann and
Julien Dumazert and
Alexey Gronskiy and
Wojciech Szpankowski Posterior agreement for large
parameter-rich optimization problems . . ii--ii
Steve Hanneke and
Liu Yang Testing piecewise functions . . . . . . 1--22
Anonymous Editorial Board . . . . . . . . . . . . 1--224
Sang Won Bae and
Jean-François Baffier and
Jinhee Chun and
Peter Eades and
Kord Eickmeyer and
Luca Grilli and
Seok-Hee Hong and
Matias Korman and
Fabrizio Montecchiani and
Ignaz Rutter and
Csaba D. Tóth Gap-planar graphs . . . . . . . . . . . 23--35
I. Vinod Reddy Parameterized algorithms for
conflict-free colorings of graphs . . . 36--52
Mauro Mezzini Polynomial time algorithm for computing
a minimum geodetic set in outerplanar
graphs . . . . . . . . . . . . . . . . . 53--62
Yixin Cao and
Yuping Ke and
Yota Otachi and
Jie You Vertex deletion problems on chordal
graphs . . . . . . . . . . . . . . . . . 63--74
Pairat Thorncharoensri and
Willy Susilo and
Yi Mu Policy controlled system with anonymity 75--86
Oscar H. Ibarra and
Ian McQuillan On store languages of language acceptors 87--113
Michele Garraffa and
Lei Shang and
Federico Della Croce and
Vincent T'kindt An exact exponential branch-and-merge
algorithm for the single machine total
tardiness problem . . . . . . . . . . . 114--132
N. Gatti and
M. Rocco and
P. Serafino and
C. Ventre Towards better models of externalities
in sponsored search auctions . . . . . . 133--149
Jin-Yi Cai and
Heng Guo and
Tyson Williams Clifford gates in the Holant framework 150--162
Guillaume Escamocher and
Barry O'Sullivan Pushing the frontier of minimality . . . 163--171
Dimitri Watel and
Alain Faye Taxi-sharing: Parameterized complexity
and approximability of the dial-a-ride
problem with money as an incentive . . . 172--201
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Rongxing Xu and
Xuding Zhu Bounded Greedy Nim . . . . . . . . . . . 1--5
Ilan Komargodski Leakage resilient one-way functions: the
auxiliary-input setting . . . . . . . . 6--18
Laurent Beaudou and
Pierre Coupechoux and
Antoine Dailly and
Sylvain Gravier and
Julien Moncel and
Aline Parreau and
Éric Sopena Octal games on graphs: the game 0.33 on
subdivided stars and bistars . . . . . . 19--35
Sancrey Rodrigues Alves and
Konrad K. Dabrowski and
Luerbio Faria and
Sulamita Klein and
Ignasi Sau and
Uéverton S. Souza On the (parameterized) complexity of
recognizing well-covered $ (r, l)$-graph 36--48
Öznur Yasar Diner and
Daniël Paulusma and
Christophe Picouleau and
Bernard Ries Contraction and deletion blockers for
perfect graphs and $H$-free graphs . . . 49--72
Vittorio Bil\`o and
Angelo Fanelli and
Luca Moscardelli Opinion formation games with dynamic
social influences . . . . . . . . . . . 73--87
Yusuke Kobayashi NP-hardness and fixed-parameter
tractability of the minimum spanner
problem . . . . . . . . . . . . . . . . 88--97
Sudip Biswas and
Arnab Ganguly and
Rahul Shah and
Sharma V. Thankachan Ranked document retrieval for multiple
patterns . . . . . . . . . . . . . . . . 98--111
Jòrgen Bang-Jensen and
Tilde My Christiansen Degree constrained $2$-partitions of
semicomplete digraphs . . . . . . . . . 112--123
Dieter Mitsche and
Pawe\l Pralat and
Elham Roshanbin Burning number of graph products . . . . 124--135
Oscar H. Ibarra Grammatical characterizations of NPDAs
and VPDAs with counters . . . . . . . . 136--150
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Christian Matt and
Ueli Maurer and
Christopher Portmann and
Renato Renner and
Björn Tackmann Toward an algebraic theory of systems 1--25
Katsumasa Ishii A proof of the leftmost reduction
theorem for $ \lambda \beta \eta
$-calculus . . . . . . . . . . . . . . . 26--32
Kensuke Kojima and
Minoru Kinoshita and
Kohei Suenaga Generalized homogeneous polynomials for
efficient template-based nonlinear
invariant synthesis . . . . . . . . . . 33--47
Anicet Bart and
Beno\^ìt Delahaye and
Paulin Fournier and
Didier Lime and
Éric Monfroy and
Charlotte Truchet Reachability in parametric Interval
Markov Chains using constraints . . . . 48--74
Eugenio Moggi and
Amin Farjudian and
Adam Duracz and
Walid Taha Safe and robust reachability analysis of
hybrid systems . . . . . . . . . . . . . 75--99
Alexander Weinert and
Martin Zimmermann Visibly linear dynamic logic . . . . . . 100--117
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Erik D. Demaine and
Fabrizio Grandoni Editorial fun . . . . . . . . . . . . . 1--1
Michael A. Bekos and
Till Bruckdorfer and
Henry Förster and
Michael Kaufmann and
Simon Poschenrieder and
Thomas Stüber Algorithms and insights for RaceTrack 2--16
Stefan Langerman and
Yushi Uno Threes!, Fives, 1024!, and 2048 are hard 17--27
Erik D. Demaine and
Fermi Ma and
Ariel Schvartzman and
Erik Waingarten and
Scott Aaronson The fewest clues problem . . . . . . . . 28--39
Felix Herter and
Günter Rote Loopless Gray code enumeration and the
Tower of Bucharest . . . . . . . . . . . 40--54
Marzio De Biasi and
Tim Ophelders The complexity of snake and undirected
NCL variants . . . . . . . . . . . . . . 55--65
Matteo Almanza and
Stefano Leucci and
Alessandro Panconesi Trainyard is NP-Hard . . . . . . . . . . 66--76
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Anonymous Preface . . . . . . . . . . . . . . . . 1--1
Kai Yang and
Zhenhua Duan and
Cong Tian and
Nan Zhang A compiler for MSVL and its applications 2--16
Dongjing Miao and
Zhipeng Cai and
Yingshu Li SEF view deletion under bounded
condition . . . . . . . . . . . . . . . 17--25
Xianmin Liu and
Zhipeng Cai and
Dongjing Miao and
Jianzhong Li Tree size reduction with keeping
distinguishability . . . . . . . . . . . 26--35
Qian-Ping Gu and
Jiajian Leo Liang and
Guochuan Zhang Algorithmic analysis for ridesharing of
personal vehicles . . . . . . . . . . . 36--46
Peng Zhang and
Chenchen Wu and
Dachuan Xu Approximation and hardness results for
the Max $k$-Uncut problem . . . . . . . 47--58
Chunsong Bai and
Liying Kang and
Erfang Shan The connected $p$-center problem on
cactus graphs . . . . . . . . . . . . . 59--65
Xiaofeng Gao and
Yueyang Xianzang and
Xiaotian You and
Yaru Dang and
Guihai Chen and
Xinglong Wang Reachability for airline networks: fast
algorithm for shortest path problem with
time windows . . . . . . . . . . . . . . 66--79
Chenchen Wu and
Donglei Du and
Dachuan Xu An approximation algorithm for the
$k$-median problem with uniform
penalties via pseudo-solution . . . . . 80--92
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Kim G. Larsen and
Igor Potapov and
Jirí Srba Reachability problems: Special issue . . 1--1
Sam A. M. Jones and
Richard M. Thomas Word problems of groups: Formal
languages, characterizations and
decidability . . . . . . . . . . . . . . 2--23
Matthew Hague and
Anthony W. Lin Decidable models of integer-manipulating
programs with recursive parallelism . . 24--37
Thomas Geffroy and
Jérôme Leroux and
Grégoire Sutre Occam's Razor applied to the Petri net
coverability problem . . . . . . . . . . 38--52
Adrien Le Coënt and
Laurent Fribourg and
Nicolas Markey and
Florian De Vuyst and
Ludovic Chamoin Compositional synthesis of
state-dependent switching control . . . 53--68
N. Alechina and
N. Bulling and
S. Demri and
B. Logan On the complexity of resource-bounded
logics . . . . . . . . . . . . . . . . . 69--100
Eike Best and
Thomas Hujsa and
Harro Wimmel Sufficient conditions for the marked
graph realisability of labelled
transition systems . . . . . . . . . . . 101--116
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Christian Scheideler Preface . . . . . . . . . . . . . . . . 1--1
Leonid Barenboim and
Michael Elkin and
Cyril Gavoille A fast network-decomposition algorithm
and its applications to constant-time
distributed computation . . . . . . . . 2--23
Marc Bury Randomized OBDD-based graph algorithms 24--45
Yoram Moses and
Katia Patkin Mutual exclusion as a matter of priority 46--60
Pierre Fraigniaud and
Juho Hirvonen and
Jukka Suomela Node labels in local decision . . . . . 61--73
Keren Censor-Hillel and
Tariq Toukan On fast and robust information spreading
in the Vertex-Congest model . . . . . . 74--90
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Lila Kari Editorial . . . . . . . . . . . . . . . iii--iii
Diederik Aerts and
Massimo Melucci and
Massimiliano Sassoli de Bianchi and
Sandro Sozzo and
Tomas Veloz Special Issue: Quantum structures in
computer science: Language, semantics,
retrieval . . . . . . . . . . . . . . . 1--4
Emanuele Di Buccio Utilizing sources of evidence in
relevance feedback through geometry . . 5--20
Yazhou Zhang and
Dawei Song and
Peng Zhang and
Panpan Wang and
Jingfei Li and
Xiang Li and
Benyou Wang A quantum-inspired multimodal sentiment
analysis framework . . . . . . . . . . . 21--40
Jerome Busemeyer and
Zheng Wang Data fusion using Hilbert space
multi-dimensional models . . . . . . . . 41--55
Peter D. Bruza Modelling contextuality by probabilistic
programs with hypergraph semantics . . . 56--70
Fei Yan and
Abdullah M. Iliyasu and
Yiming Guo and
Huamin Yang Flexible representation and manipulation
of audio signals on quantum computers 71--85
R. Leporini and
C. Bertini Quantum structures in qudit spaces . . . 86--96
V. I. Danilov and
A. Lambert-Mogiliansky Preparing a (quantum) belief system . . 97--103
Bob Coecke and
Fabrizio Genovese and
Martha Lewis and
Dan Marsden and
Alex Toumi Generalized relations in linguistics and
cognition . . . . . . . . . . . . . . . 104--115
Diederik Aerts and
Jonito Aerts Arguëlles and
Lester Beltran and
Lyneth Beltran and
Isaac Distrito and
Massimiliano Sassoli de Bianchi and
Sandro Sozzo and
Tomas Veloz Towards a quantum World Wide Web . . . . 116--131
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Tomohiro I and
Dominik Köppl Improved upper bounds on all maximal $
\alpha $-gapped repeats and palindromes 1--15
Yoshifumi Sakai A substring-substring LCS data structure 16--34
Ajoy K. Datta and
Stéphane Devismes and
Lawrence L. Larmore A silent self-stabilizing algorithm for
the generalized minimal $k$-dominating
set problem . . . . . . . . . . . . . . 35--63
Can Umut Ileri and
Orhan Dagdeviren A self-stabilizing algorithm for
$b$-matching . . . . . . . . . . . . . . 64--75
Andrew Ryzhikov On automata recognizing birecurrent sets 76--79
Evangelos Bampas and
Lélia Blin and
Jurek Czyzowicz and
David Ilcinkas and
Arnaud Labourel and
Maria Potop-Butucaru and
Sébastien Tixeuil On asynchronous rendezvous in general
graphs . . . . . . . . . . . . . . . . . 80--90
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Paschos Preface to Special Issue on Algorithms
and Complexity . . . . . . . . . . . . . 1--2
Petr A. Golovach and
Dieter Kratsch and
Mohamed Yosri Sayadi Enumeration of maximal irredundant sets
for claw-free graphs . . . . . . . . . . 3--15
Torben Hagerup and
Frank Kammer and
Moritz Laudahn Space-efficient Euler partition and
bipartite edge coloring . . . . . . . . 16--34
Giuseppe A. Di Luna and
Paola Flocchini and
Taisuke Izumi and
Tomoko Izumi and
Nicola Santoro and
Giovanni Viglietta Population protocols with faulty
interactions: the impact of a leader . . 35--49
Laurent Gourv\`es and
Jérôme Monnot On maximin share allocations in matroids 50--64
Pieter Kleer and
Guido Schäfer Tight inefficiency bounds for
perception-parameterized affine
congestion games . . . . . . . . . . . . 65--87
Sascha Brauer Complexity of single-swap heuristics for
metric facility location and related
problems . . . . . . . . . . . . . . . . 88--106
Fidaa Abed and
Lin Chen and
Yann Disser and
Martin Groß and
Nicole Megow and
Julie Meißner and
Alexander T. Richter and
Roman Rischke Scheduling maintenance jobs in networks 107--121
Yuval Emek and
Yaacov Shapiro and
Yuyi Wang Minimum cost perfect matching with
delays for two sources . . . . . . . . . 122--129
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Michael Wallner A bijection of plane increasing trees
with relaxed binary trees of right
height at most one . . . . . . . . . . . 1--12
Rafic Nader and
Alain Bretto and
Bassam Mourad and
Hassan Abbas On the positive semi-definite property
of similarity matrices . . . . . . . . . 13--28
Albert Guan and
Wen-Guey Tzeng A light-weight bit commitment protocol
based on unpredictable channel noise . . 29--37
Zhao Wang and
Christopher Melekian and
Eddie Cheng and
Yaping Mao Matching preclusion number in product
graphs . . . . . . . . . . . . . . . . . 38--47
Arne Leitert and
Feodor F. Dragan Parameterized approximation algorithms
for some location problems in graphs . . 48--64
Kai Zhang and
Jie Chen and
Hyung Tae Lee and
Haifeng Qian and
Huaxiong Wang Efficient public key encryption with
equality test in the standard model . . 65--80
Jia Guo and
Desai Li and
Mei Lu The $g$-good-neighbor conditional
diagnosability of the crossed cubes
under the PMC and MM* model . . . . . . 81--88
Rui-Juan Jing and
Chun-Ming Yuan and
Xiao-Shan Gao A polynomial-time algorithm to compute
generalized Hermite normal forms of
matrices over $ Z[x] $ . . . . . . . . . 89--109
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Shirin Baghoolizadeh and
Ali Movaghar and
Negin Majidi A uniformization-based algorithm for
continuous-time stochastic games model
checking . . . . . . . . . . . . . . . . 1--18
Pedro Ribeiro and
Ana Cavalcanti Angelic processes for CSP via the UTP 19--63
Bojan Marinkovi\'c and
Paola Glavan and
Zoran Ognjanovi\'c Proving properties of the Chord protocol
using the ASM formalism . . . . . . . . 64--93
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Andrzej Czygrinow and
Micha\l Han\'ckowiak and
Wojciech Wawrzyniak and
Marcin Witkowski Distributed CONGESTBC constant
approximation of MDS in bounded genus
graphs . . . . . . . . . . . . . . . . . 1--10
Yi-Jun Chang Hardness of RNA folding problem with
four symbols . . . . . . . . . . . . . . 11--26
Yair Bartal and
Lee-Ad Gottlieb Approximate nearest neighbor search for
$l$ $p$-spaces ($ 2 < p < \infty $) via
embeddings . . . . . . . . . . . . . . . 27--35
Rodrigo Ferreira da Silva and
Sebastián Urrutia and
Vinícius Fernandes dos Santos One-Sided Weak Dominance Drawing . . . . 36--43
Mengjie Lv and
Shuming Zhou and
Xueli Sun and
Guanqin Lian and
Jiafei Liu Reliability of $ (n, k)$-star network
based on $g$-extra conditional fault . . 44--55
Eddie Cheng and
Ke Qiu and
Zhizhang Shen A general approach to deriving the
$g$-good-neighbor conditional
diagnosability of interconnection
networks . . . . . . . . . . . . . . . . 56--67
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Qiang Zhu and
Lili Li and
Sanyang Liu and
Xing Zhang Hybrid fault diagnosis capability
analysis of hypercubes under the PMC
model and MM$ \ast $ model . . . . . . . 1--8
Gaoxing Sun and
Shuang Zhao and
Jixiang Meng Edge fault tolerance of interconnection
networks with respect to maximally
edge-connectivity . . . . . . . . . . . 9--16
Silvia Bonomi and
Antonella Del Pozzo and
Maria Potop-Butucaru and
Sébastien Tixeuil Approximate Agreement under Mobile
Byzantine Faults . . . . . . . . . . . . 17--29
Bruno Escoffier Saving colors and Max Coloring: Some
fixed-parameter tractability results . . 30--41
Manon Stipulanti Convergence of Pascal-like triangles in
Parry--Bertrand numeration systems . . . 42--60
Shimin Li and
Haitao Wang Algorithms for covering multiple
barriers . . . . . . . . . . . . . . . . 61--72
Leslie Ann Goldberg and
John Lapinskas and
Johannes Lengler and
Florian Meier and
Konstantinos Panagiotou and
Pascal Pfister Asymptotically optimal amplifiers for
the Moran process . . . . . . . . . . . 73--93
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Jianye Huang and
Qiong Huang and
Willy Susilo Leakage-resilient ring signature schemes 1--13
Christophe Crespelle Fully dynamic representations of
interval graphs . . . . . . . . . . . . 14--49
Dimitri Lajou On the achromatic number of signed
graphs . . . . . . . . . . . . . . . . . 50--60
Zhao Wang and
Yaping Mao and
Eddie Cheng and
Jinyu Zou Matching preclusion number of graphs . . 61--71
Beno\^\it Libert and
San Ling and
Fabrice Mouhartem and
Khoa Nguyen and
Huaxiong Wang Zero-knowledge arguments for
matrix-vector relations and
lattice-based group encryption . . . . . 72--97
Antonio Faonio and
Jesper Buus Nielsen and
Mark Simkin and
Daniele Venturi Continuously non-malleable codes with
split-state refresh . . . . . . . . . . 98--132
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Yulong Wei and
Min Xu Hybrid fault diagnosis capability
analysis of regular graphs . . . . . . . 1--14
M. Lafond and
N. El-Mabrouk and
K. T. Huber and
V. Moulton The complexity of comparing
multiply-labelled trees by extending
phylogenetic-tree metrics . . . . . . . 15--34
Karl Bringmann and
Ralph Keusch and
Johannes Lengler Geometric inhomogeneous random graphs 35--54
Yongjie Yang and
Yash Raj Shrestha and
Jiong Guo On the complexity of bribery with
distance restrictions . . . . . . . . . 55--71
Gyorgy Dosa and
Hans Kellerer and
Zsolt Tuza Restricted assignment scheduling with
resource constraints . . . . . . . . . . 72--87
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Xiang-Jun Li and
Min Liu and
Zheng Yan and
Jun-Ming Xu On conditional fault tolerance of
hierarchical cubic networks . . . . . . 1--6
Wen An Liu and
Tao Wu Multi-player End-Nim games . . . . . . . 7--22
Huazhong Lü and
Fan Wang Hamiltonian paths passing through
prescribed edges in balanced hypercubes 23--33
Majid Khonji and
Areg Karapetyan and
Khaled Elbassioni and
Sid Chi-Kin Chau Complex-demand scheduling problem with
application in smart grid . . . . . . . 34--50
Atsushi Takayasu and
Noboru Kunihiro Partial key exposure attacks on RSA:
Achieving the Boneh--Durfee bound . . . 51--77
Qian-Ping Gu and
Gengchun Xu Constant query time $ (1 +
\epsilon)$-approximate distance oracle
for planar graphs . . . . . . . . . . . 78--88
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Kun He and
Qian Li and
Xiaoming Sun A tighter relation between sensitivity
complexity and certificate complexity 1--12
Rostam Sabeti Polynomial expressions for non-binomial
structures . . . . . . . . . . . . . . . 13--24
Akinori Kawachi and
Mitsunori Ogihara and
Kei Uchizawa Generalized predecessor existence
problems for Boolean finite dynamical
systems on directed graphs . . . . . . . 25--40
Gonzalo Navarro and
Nicola Prezza Universal compressed text indexing . . . 41--50
Petr Kucera and
Petr Savický and
Vojtech Vorel A lower bound on CNF encodings of the
at-most-one constraint . . . . . . . . . 51--73
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Qingyu He and
Luoshan Xu Weak algebraic information systems and a
new equivalent category of DOM of
domains . . . . . . . . . . . . . . . . 1--11
Lavindra de Silva and
Lin Padgham and
Sebastian Sardina HTN-like solutions for classical
planning problems: an application to BDI
agent systems . . . . . . . . . . . . . 12--37
Chiara Bodei and
Linda Brodo and
Roberto Bruni A formal approach to open multiparty
interactions . . . . . . . . . . . . . . 38--65
Jirí Adámek and
Stefan Milius On functors preserving coproducts and
algebras with iterativity . . . . . . . 66--87
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Vittorio Bil\`o and
Antonio Caruso Editorial . . . . . . . . . . . . . . . 1--1
Tiziana Calamoneri and
Matteo Dell'Orefice and
Angelo Monti A simple linear time algorithm for the
locally connected spanning tree problem
on maximal planar chordal graphs . . . . 2--14
Gennaro Cordasco and
Luisa Gargano and
Adele A. Rescigno Active influence spreading in social
networks . . . . . . . . . . . . . . . . 15--29
Gianlorenzo D'Angelo and
Lorenzo Severini and
Yllka Velaj Recommending links through influence
maximization . . . . . . . . . . . . . . 30--41
Shantanu Das and
Riccardo Focardi and
Flaminia L. Luccio and
Euripides Markou and
Marco Squarcina Gathering of robots in a ring with
mobile faults . . . . . . . . . . . . . 42--60
Cosimo Vinci Non-atomic one-round walks in congestion
games . . . . . . . . . . . . . . . . . 61--79
Marco Bernardo and
Marino Miculan Constructive logical characterizations
of bisimilarity for reactive
probabilistic systems . . . . . . . . . 80--99
Chiara Bodei and
Stefano Chessa and
Letterio Galletta Measuring security in IoT communications 100--124
Laura Bozzelli and
Alberto Molinari and
Angelo Montanari and
Adriano Peron and
Pietro Sala Which fragments of the interval temporal
logic HS are tractable in model
checking? . . . . . . . . . . . . . . . 125--144
Paola Giannini and
Marco Servetto and
Elena Zucca and
James Cone Flexible recovery of uniqueness and
immutability . . . . . . . . . . . . . . 145--172
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Lila Kari Editorial . . . . . . . . . . . . . . . iii--iii
Jérôme Feret and
Lo\"\ic Paulevé and
David Safránek Preface . . . . . . . . . . . . . . . . 1--2
Robert Johnson and
Qing Dong and
Erik Winfree Verifying chemical reaction network
implementations: a bisimulation approach 3--46
Luca Cardelli and
Mirco Tribastone and
Max Tschaikowski and
Andrea Vandin Comparing chemical reaction networks: a
categorical and algorithmic perspective 47--66
Seung Woo Shin and
Chris Thachuk and
Erik Winfree Verifying chemical reaction network
implementations: a pathway decomposition
approach . . . . . . . . . . . . . . . . 67--96
Ricardo Honorato-Zimmer and
Andrew J. Millar and
Gordon D. Plotkin and
Argyris Zardilis Chromar, a language of parameterised
agents . . . . . . . . . . . . . . . . . 97--119
Juraj Kolcák and
David Safránek and
Stefan Haar and
Lo\"\ic Paulevé Parameter space abstraction and
unfolding semantics of discrete
regulatory networks . . . . . . . . . . 120--144
G. Bernot and
J.-P. Comet and
Z. Khalis and
A. Richard and
O. Roux A genetically modified Hoare logic . . . 145--157
Md. Ariful Islam and
Rance Cleaveland and
Flavio H. Fenton and
Radu Grosu and
Paul L. Jones and
Scott A. Smolka Probabilistic reachability for
multi-parameter bifurcation analysis of
cardiac alternans . . . . . . . . . . . 158--169
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Cristina Bazgan and
Florent Foucaud and
Florian Sikora Parameterized and approximation
complexity of Partial VC Dimension . . . 1--15
Xiaoyan Li and
Jianxi Fan and
Cheng-Kuan Lin and
Baolei Cheng and
Xiaohua Jia The extra connectivity, extra
conditional diagnosability and $ t /
k$-diagnosability of the data center
network DCell . . . . . . . . . . . . . 16--29
Bhadrachalam Chitturi and
Priyanshu Das Sorting permutations with transpositions
in $ O(n^3) $ amortized time . . . . . . 30--37
Jou-Ming Chang and
Kung-Jui Pai and
Ro-Yu Wu and
Jinn-Shyong Yang The $4$-component connectivity of
alternating group networks . . . . . . . 38--45
Michael A. Henning and
Arti Pandey Algorithmic aspects of semitotal
domination in graphs . . . . . . . . . . 46--57
Anonymous Editorial Board . . . . . . . . . . . . i--i
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Yuxing Yang and
Jing Li and
Shiying Wang Embedding fault-free Hamiltonian paths
with prescribed linear forests into
faulty ternary $n$-cubes . . . . . . . . 1--15
Yuzhi Xiao and
Haixing Zhao and
Yaping Mao and
Guanrong Chen Invulnerability of planar two-tree
networks . . . . . . . . . . . . . . . . 16--25
Khaled Elbassioni and
Imran Rauf and
Saurabh Ray A global parallel algorithm for
enumerating minimal transversals of
geometric hypergraphs . . . . . . . . . 26--33
Zhen Zhang and
Shu-qiang Huang and
Dong Guo and
Yong-Hui Li RVCCC: a new variational network of
cube-connected cycles and its
topological properties . . . . . . . . . 34--50
Peng Jiang and
Fuchun Guo and
Yi Mu Efficient identity-based broadcast
encryption with keyword search against
insider attacks for database systems . . 51--72
Pratik Ghosal and
Meghana Nasre and
Prajakta Nimbhorkar Rank-maximal matchings --- structure and
algorithms . . . . . . . . . . . . . . . 73--82
Olivier Hudry and
Antoine Lobstein Unique (optimal) solutions: Complexity
results for identifying and
locating-dominating codes . . . . . . . 83--102
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Jacob M. Howe and
Andy King and
Axel Simon Incremental Closure for Systems of Two
Variables Per Inequality . . . . . . . . 1--42
Mehdi Vatandoost and
Ali Akbar Estaji and
Rahimeh Pourkhandani A generalized modal logic in causal
structures . . . . . . . . . . . . . . . 43--53
Petr Cintula and
Denisa Diaconescu and
George Metcalfe Skolemization and Herbrand theorems for
lattice-valued logics . . . . . . . . . 54--75
Barry Jay Intensional computation with
higher-order functions . . . . . . . . . 76--90
Lutz Straßburger On the decision problem for MELL . . . . 91--98
Robin Hirsch and
Marcel Jackson and
Tomasz Kowalski Algebraic foundations for qualitative
calculi and networks . . . . . . . . . . 99--116
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Manuel Lafond and
Celine Scornavacca On the Weighted Quartet Consensus
problem . . . . . . . . . . . . . . . . 1--17
Mark de Berg and
Sándor Kisfaludi-Bak and
Gerhard Woeginger The complexity of Dominating Set in
geometric intersection graphs . . . . . 18--31
Cristina Bazgan and
Thomas Pontoizeau and
Zsolt Tuza Finding a potential community in
networks . . . . . . . . . . . . . . . . 32--42
Shlomi Dolev and
Juan A. Garay and
Niv Gilboa and
Vladimir Kolesnikov and
Muni Venkateswarlu Kumaramangalam Perennial secure multi-party computation
of universal Turing machine . . . . . . 43--62
Sanjib Sadhu and
Sasanka Roy and
Subhas C. Nandy and
Suchismita Roy Linear time algorithm to cover and hit a
set of line segments optimally by two
axis-parallel squares . . . . . . . . . 63--74
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
N. Pena and
A. Borodin On extensions of the deterministic
online model for bipartite matching and
max-sat . . . . . . . . . . . . . . . . 1--24
George Manoussakis A new decomposition technique for
maximal clique enumeration for sparse
graphs . . . . . . . . . . . . . . . . . 25--33
Travis Gagie and
Meng He and
Gonzalo Navarro Path queries on functions . . . . . . . 34--50
Stephane Durocher and
Robby Singh A simple linear-space data structure for
constant-time range minimum query . . . 51--61
J. A. Telle and
Y. Villanger FPT algorithms for domination in sparse
graphs and beyond . . . . . . . . . . . 62--68
Hoang-Oanh Le and
Van Bang Le A complexity dichotomy for matching cut
in (bipartite) graphs of fixed diameter 69--78
Miroslaw Kowaluk and
Andrzej Lingas A fast deterministic detection of small
pattern graphs in graphs without large
cliques . . . . . . . . . . . . . . . . 79--87
Sylvain Lazard and
William J. Lenhart and
Giuseppe Liotta On the edge-length ratio of outerplanar
graphs . . . . . . . . . . . . . . . . . 88--94
Tero Harju On square-free arithmetic progressions
in infinite words . . . . . . . . . . . 95--100
P. M. B. Vitányi Corrigendum to ``On the rate of decrease
in logical depth'' [Theor. Comput. Sci.
\bf 702 (2017) 60--64] by L. F. Antunes,
A. Souto, and P. M. B. Vitányi . . . . . 101--101
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Motahhareh Gharahi and
Shahram Khazaei Optimal linear secret sharing schemes
for graph access structures on six
participants . . . . . . . . . . . . . . 1--8
Santiago Valdés Ravelo and
Carlos Eduardo Ferreira A PTAS for the metric case of the
optimum weighted source-destination
communication spanning tree problem . . 9--22
Irena Rusu Min (a)cyclic feedback vertex sets and
min ones monotone 3-SAT . . . . . . . . 23--38
Júlio Araújo and
Cláudia Linhares Sales and
Ignasi Sau and
Ana Silva Weighted proper orientations of trees
and graphs of bounded treewidth . . . . 39--48
Khin Mi Mi Aung and
Hyung Tae Lee and
Benjamin Hong Meng Tan and
Huaxiong Wang Fully homomorphic encryption over the
integers for non-binary plaintexts
without the sparse subset sum problem 49--70
Krishnamoorthy Dinesh and
Jayalal Sarma Alternation, sparsity and sensitivity:
Bounds and exponential gaps . . . . . . 71--82
Boaz Farbstein and
Asaf Levin Deadline TSP . . . . . . . . . . . . . . 83--92
Qiang Dong and
Xi Wang How many triangles and quadrilaterals
are there in an $n$-dimensional
augmented cube? . . . . . . . . . . . . 93--98
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Yanwei Zhou and
Bo Yang and
Yi Mu The generic construction of continuous
leakage-resilient identity-based
cryptosystems . . . . . . . . . . . . . 1--45
Stefan Ehard and
Dieter Rautenbach Vaccinate your trees! . . . . . . . . . 46--57
Gonzalo Navarro Document listing on repetitive
collections with guaranteed performance 58--72
Behrooz Alizadeh and
Esmaeil Afrashteh and
Fahimeh Baroughi Inverse obnoxious $p$-median location
problems on trees with edge length
modifications under different norms . . 73--87
Marjorie Bournat and
Ajoy K. Datta and
Swan Dubois Self-stabilizing robots in highly
dynamic environments . . . . . . . . . . 88--110
Takehiro Ito and
Yota Otachi Reconfiguration of colorable sets in
classes of perfect graphs . . . . . . . 111--122
Jie Xue and
Huiqiu Lin and
Jinlong Shu The algebraic connectivity of graphs
with given circumference . . . . . . . . 123--131
Sudeshna Kolay and
Ragukumar Pandurangan and
Fahad Panolan and
Venkatesh Raman and
Prafullkumar Tale Harmonious coloring: Parameterized
algorithms and upper bounds . . . . . . 132--142
Hoang-Oanh Le and
Van Bang Le Map graphs having witnesses of large
girth . . . . . . . . . . . . . . . . . 143--148
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Helbert Eduardo Espitia and
Jorge Iván Sofrony Considerations for parameter
configuration on Vortex Particle Swarm
Optimization . . . . . . . . . . . . . . 1--26
Hai Q. Dinh and
Abhay Kumar Singh and
Sukhamoy Pattanayak and
Songsak Sriboonchitta Construction of cyclic DNA codes over
the ring $ Z_4 [u] / \langle u_2 - 1
\rangle $ based on the deletion distance 27--42
Ehsan PourAliAkbar and
Mohammad Mosleh An efficient design for reversible
Wallace unsigned multiplier . . . . . . 43--52
Pietro S. Oliveto and
Dirk Sudholt and
Christine Zarges On the benefits and risks of using
fitness sharing for multimodal
optimisation . . . . . . . . . . . . . . 53--70
Javad Salimi Sartakhti and
Saeed Jalili On the computational power of the light:
a plan for breaking Data Encryption
Standard . . . . . . . . . . . . . . . . 71--78
Ruben Becker and
Vincenzo Bonifaci and
Andreas Karrenbauer and
Pavel Kolev and
Kurt Mehlhorn Two results on slime mold computations 79--106
Shiying Wang and
Mujiangshan Wang The $g$-good-neighbor and $g$-extra
diagnosability of networks . . . . . . . 107--114
Benjamin Doerr Analyzing randomized search heuristics
via stochastic domination . . . . . . . 115--137
Minghua Pan and
Daowen Qiu and
Paulo Mateus and
Jozef Gruska Entangling and disentangling in Grover's
search algorithm . . . . . . . . . . . . 138--152
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Kejia Zhang and
Qilong Han and
Zhipeng Cai and
Guisheng Yin and
Junyu Lin DOAMI: a distributed on-line algorithm
to minimize interference for routing in
wireless sensor networks . . . . . . . . 1--13
Ahmad Mahmoody and
Eli Upfal Optimizing static and adaptive probing
schedules for rapid event detection . . 14--30
Wei Ding and
Ke Qiu Approximating the restricted $1$-center
in graphs . . . . . . . . . . . . . . . 31--43
Fei Huang and
Xueliang Li and
Zhongmei Qin and
Colton Magnant Minimum degree condition for proper
connection number $2$ . . . . . . . . . 44--50
Yasushi Kawase and
Xin Han and
Kazuhisa Makino Proportional cost buyback problem with
weight bounds . . . . . . . . . . . . . 51--64
Cong Tian and
Zhenhua Duan Model checking open systems with
alternating projection temporal logic 65--81
Liang Zhao and
Xiaobing Wang and
Zhenhua Duan Model checking of pushdown systems for
projection temporal logic . . . . . . . 82--94
Yi Xu and
Jigen Peng and
Yinfeng Xu and
Binhai Zhu The discrete and mixed minimax
$2$-center problems . . . . . . . . . . 95--102
Dongjing Miao and
Xianmin Liu and
Yingshu Li and
Jianzhong Li Vertex cover in conflict graphs . . . . 103--112
Chao Xu and
Jianer Chen and
Jianxin Wang Resolution and linear CNF formulas:
Improved $ (n, 3)$-MaxSAT algorithms . . 113--123
Tadao Takaoka Algebraic theory on shortest paths for
all flows . . . . . . . . . . . . . . . 124--132
Bogdan Armaselu and
Ovidiu Daescu Dynamic minimum bichromatic separating
circle . . . . . . . . . . . . . . . . . 133--142
Yicheng Xu and
Dachuan Xu and
Donglei Du and
Chenchen Wu Improved approximation algorithm for
universal facility location problem with
linear penalties . . . . . . . . . . . . 143--151
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Kaveh Khoshkhah and
Mehdi Khosravian Ghadikolaei and
Jérôme Monnot and
Dirk Oliver Theis Complexity and approximability of
extended Spanning Star Forest problems
in general and complete graphs . . . . . 1--15
Lucas Colucci and
Péter L. Erd\Hos and
Ervin Györi and
Tamás Róbert Mezei Terminal-pairability in complete
bipartite graphs with non-bipartite
demands: Edge-disjoint paths in complete
bipartite graphs . . . . . . . . . . . . 16--25
Arash Ahadi and
Alireza Zarei Connecting guards with minimum Steiner
points inside simple polygons . . . . . 26--31
Xiao Zhang and
Shengli Liu and
Dawu Gu and
Joseph K. Liu A generic construction of tightly secure
signatures in the multi-user setting . . 32--52
Tanima Chatterjee and
Bhaskar DasGupta and
Nasim Mobasheri and
Venkatkumar Srinivasan and
Ismael G. Yero On the computational complexities of
three problems related to a privacy
measure for large networks under active
attack . . . . . . . . . . . . . . . . . 53--67
Pierre Bonardo and
Anna E. Frid and
Jeffrey Shallit The number of valid factorizations of
Fibonacci prefixes . . . . . . . . . . . 68--75
Begum Genc and
Mohamed Siala and
Gilles Simonin and
Barry O'Sullivan Complexity Study for the Robust Stable
Marriage Problem . . . . . . . . . . . . 76--92
Frank Gurski and
Carolin Rehs and
Jochen Rethmann Knapsack problems: a parameterized point
of view . . . . . . . . . . . . . . . . 93--108
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Luís M. S. Russo A study on splay trees . . . . . . . . . 1--18
Navin Goyal and
Manoj Gupta Better analysis of \sc GREEDY binary
search tree on decomposable sequences 19--42
Sanjay Jain and
Efim Kinber Intrinsic complexity of partial learning 43--63
Jòrgen Bang-Jensen and
Stéphane Bessy Degree-constrained $2$-partitions of
graphs . . . . . . . . . . . . . . . . . 64--74
Carla Negri Lintzmayer and
Flávio Keidi Miyazawa and
Eduardo Candido Xavier Online circle and sphere packing . . . . 75--94
Martin Böhm and
Marek Chrobak and
\Lukasz Je\.z and
Fei Li and
Ji\vr\'ì Sgall and
Pavel Veselý Online packet scheduling with bounded
delay and lookahead . . . . . . . . . . 95--113
B. Litow Existential Diophantine definability of
string length . . . . . . . . . . . . . 114--116
Guangwei Wu and
Jianer Chen and
Jianxin Wang Scheduling two-stage jobs on multiple
flowshops . . . . . . . . . . . . . . . 117--124
Jung-Heum Park and
Jae-Hoon Kim and
Hyeong-Seok Lim Disjoint path covers joining prescribed
source and sink sets in interval graphs 125--137
Mei-Mei Gu and
Rong-Xia Hao and
Shuming Zhou Fault diagnosability of data center
networks . . . . . . . . . . . . . . . . 138--147
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Giorgio Ausiello and
Lila Kari and
Grzegorz Rozenberg and
Donald Sannella and
Paul Spirakis and
Pierre-Louis Curien Preface . . . . . . . . . . . . . . . . 1--2
Luca Aceto and
Dario Della Monica and
Ignacio Fábregas and
Anna Ingólfsdóttir When are prime formulae characteristic? 3--31
Mário S. Alvim and
Konstantinos Chatzikokolakis and
Annabelle McIver and
Carroll Morgan and
Catuscia Palamidessi and
Geoffrey Smith An axiomatization of information flow
measures . . . . . . . . . . . . . . . . 32--54
Marcella Anselmo and
Dora Giammarresi and
Maria Madonia Full sets of pictures to encode pictures 55--68
Nicholas R. Beaton and
Mathilde Bouvel and
Veronica Guerrini and
Simone Rinaldi Enumerating five families of
pattern-avoiding inversion sequences;
and introducing the powered Catalan
numbers . . . . . . . . . . . . . . . . 69--92
Valérie Berthé and
Paulina Cecchi Bernales Balancedness and coboundaries in
symbolic systems . . . . . . . . . . . . 93--110
Benjamin Blanchette and
Christian Choffrut and
Christophe Reutenauer Quasi-automatic semigroups . . . . . . . 111--120
Janusz A. Brzozowski and
Sylvie Davies and
Abhishek Madan State complexity of pattern matching in
regular languages . . . . . . . . . . . 121--131
Luca Cardelli and
Mirco Tribastone and
Max Tschaikowski and
Andrea Vandin Symbolic computation of differential
equivalences . . . . . . . . . . . . . . 132--154
Jing Chen and
Silvio Micali Algorand: a secure and efficient
distributed ledger . . . . . . . . . . . 155--183
Thierry Coquand Canonicity and normalization for
dependent type theory . . . . . . . . . 184--191
Jürgen Dassow On the orbit of closure-involution
operations --- The case of formal
languages . . . . . . . . . . . . . . . 192--203
Nachum Dershowitz and
Jean-Pierre Jouannaud Drags: a compositional algebraic
framework for graph rewriting . . . . . 204--231
Francesco Dolce and
Antonio Restivo and
Christophe Reutenauer On generalized Lyndon words . . . . . . 232--242
Riccardo Dondi and
Giancarlo Mauri and
Italo Zoppis On the tractability of finding disjoint
clubs in a network . . . . . . . . . . . 243--251
Manfred Droste and
Sven Dziadek and
Werner Kuich Weighted simple reset pushdown automata 252--259
Jörg Endrullis and
Jan Willem Klop Braids via term rewriting . . . . . . . 260--295
E. Engeler Neural algebra on ``how does the brain
think?'' . . . . . . . . . . . . . . . . 296--307
Kousha Etessami and
Dominik Wojtczak and
Mihalis Yannakakis Recursive stochastic games with positive
rewards . . . . . . . . . . . . . . . . 308--328
Andrea Frosini and
Laurent Vuillon Tomographic reconstruction of $2$-convex
polyominoes using dual Horn clauses . . 329--337
Yan Gerard Regular switching components . . . . . . 338--355
Oscar H. Ibarra and
Ian McQuillan and
Bala Ravikumar On counting functions and slenderness of
languages . . . . . . . . . . . . . . . 356--378
Jarkko Kari and
Etienne Moutot Nivat's conjecture and pattern
complexity in algebraic subshifts . . . 379--386
Nobuya Kimoto and
Ken Komiya and
Kenzo Fujimoto and
Satoshi Kobayashi Monotonically controlling right linear
grammars with unknown behaviors to
output a target string . . . . . . . . . 387--408
Naoki Kobayashi Inclusion between the frontier language
of a non-deterministic recursive program
scheme and the Dyck language is
undecidable . . . . . . . . . . . . . . 409--416
Alexander Okhotin and
Kai Salomaa Edit distance neighbourhoods of
input-driven pushdown automata . . . . . 417--430
Fumiya Okubo and
Takashi Yokomori Decomposition and factorization of
chemical reaction transducers . . . . . 431--442
David Orellana-Martín and
Luis Valencia-Cabrera and
Agustín Riscos-Núñez and
Mario J. Pérez-Jiménez A path to computational efficiency
through membrane computing . . . . . . . 443--453
Narad Rampersad and
Jeffrey Shallit and
Élise Vandomme Critical exponents of infinite balanced
words . . . . . . . . . . . . . . . . . 454--463
Jan van Leeuwen and
Jirí Wiedermann Question answering by humans and
machines: a complexity-theoretic view 464--473
Tingfang Wu and
Linqiang Pan and
Artiom Alhazov Computation power of asynchronous
spiking neural P systems with
polarizations . . . . . . . . . . . . . 474--489
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Xiao Zhao and
Sheng Chen Proper $2$-coloring game on some trees 1--18
Yiannis Giannakopoulos and
Elias Koutsoupias and
Maria Kyropoulou The anarchy of scheduling without money 19--32
Jeffery Kline Geometric search for Hadamard matrices 33--46
Chris Monica Mohan and
Samivel Santhakumar and
Micheal Arockiaraj and
Jia-Bao Liu Partition dimension of certain classes
of series parallel graphs . . . . . . . 47--60
Mong-Jen Kao and
Jia-Yau Shiau and
Ching-Chi Lin and
D. T. Lee Tight approximation for partial vertex
cover with hard capacities . . . . . . . 61--72
I. Heckenberger and
J. Sawada A Pascal-like bound for the number of
necklaces with fixed density . . . . . . 73--77
Paul M. B. Vitányi Logical depth for reversible Turing
machines with an application to the rate
of decrease in logical depth for general
Turing machines . . . . . . . . . . . . 78--80
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Mohammad Ali Abam and
Sharareh Alipour and
Mohammad Ghodsi and
Mohammad Mahdian Visibility testing and counting for
uncertain segments . . . . . . . . . . . 1--7
Guozhen Zhang and
Shangwei Lin Path and cycle fault tolerance of
bubble-sort graph networks . . . . . . . 8--16
Serafino Cicerone and
Gabriele Di Stefano Approximation algorithms for decomposing
octilinear polygons . . . . . . . . . . 17--36
Amine Mohabeddine and
Mourad Boudhar New results in two identical machines
scheduling with agreement graphs . . . . 37--46
Shuai Han and
Shengli Liu and
Lin Lyu QANIZK for adversary-dependent languages
and their applications . . . . . . . . . 47--71
Sayan Bhattacharya and
Monika Henzinger and
Stefan Neumann New amortized cell-probe lower bounds
for dynamic problems . . . . . . . . . . 72--87
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Peter Damaschke Combinatorial search in two and more
rounds . . . . . . . . . . . . . . . . . 1--11
Dekel Tsur Succinct data structure for dynamic
trees with faster queries . . . . . . . 12--19
A. Casteigts and
Y. Métivier and
J. M. Robson and
A. Zemmari Counting in one-hop beeping networks . . 20--28
Josef Florian and
Tereza Veselá and
Lubomíra Dvoráková Normalization of ternary generalized
pseudostandard words . . . . . . . . . . 29--53
Omid Etesami and
Narges Ghareghani and
Michel Habib and
Mohammadreza Hooshmandasl and
Reza Naserasr and
Pouyeh Sharifani When an optimal dominating set with
given constraints exists . . . . . . . . 54--65
Jin Chen and
Zhi-Xiong Wen On the abelian complexity of generalized
Thue--Morse sequences . . . . . . . . . 66--73
Petr Ambroz and
Ondrej Kadlec and
Zuzana Masáková and
Edita Pelantová Palindromic length of words and
morphisms in class P . . . . . . . . . . 74--83
G. Konstantinidis and
A. Kehagias Selfish cops and active robber:
Multi-player pursuit evasion on graphs 84--102
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Vivek Nigam and
René Thiemann Logical and Semantic Frameworks with
Applications . . . . . . . . . . . . . . 1--2
Mauricio Ayala-Rincón and
Washington de Carvalho-Segundo and
Maribel Fernández and
Daniele Nantes-Sobrinho and
Ana Cristina Rocha-Oliveira A formalisation of nominal $ \alpha
$-equivalence with A, C, and AC function
symbols . . . . . . . . . . . . . . . . 3--23
Kaustuv Chaudhuri and
Leonardo Lima and
Giselle Reis Formalized meta-theory of sequent
calculi for linear logics . . . . . . . 24--38
Carlos Caleiro and
Filipe Casal and
Andreia Mordido Generalized probabilistic satisfiability
and applications to modelling attackers
with side-channel capabilities . . . . . 39--62
Ofer Arieli and
Christian Straßer Logical argumentation by dynamic proof
systems . . . . . . . . . . . . . . . . 63--91
Carlos Lombardi and
Alejandro Ríos and
Roel de Vrijer Projections for infinitary rewriting
(extended version) . . . . . . . . . . . 92--110
Mauricio Ayala-Rincón and
Eduardo Bonelli and
Juan Edi and
Andrés Viso Typed path polymorphism . . . . . . . . 111--130
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Adi Shraibman Nondeterministic communication
complexity with help and graph functions 1--10
Cédric Bentz Weighted and locally bounded
list-colorings in split graphs,
cographs, and partial $k$-trees . . . . 11--29
Benjamin Bergougnoux and
Mamadou Kanté Fast exact algorithms for some
connectivity problems parameterized by
clique-width . . . . . . . . . . . . . . 30--53
Johanne Cohen and
Jonas Lef\`evre and
Khaled Maâmra and
George Manoussakis and
Laurence Pilard The first polynomial self-stabilizing
$1$-maximal matching algorithm for
general graphs . . . . . . . . . . . . . 54--78
Bireswar Das and
Murali Krishna Enduri and
Masashi Kiyomi and
Neeldhara Misra and
Yota Otachi and
I. Vinod Reddy and
Shunya Yoshimura On structural parameterizations of
firefighting . . . . . . . . . . . . . . 79--90
Nodari Vakhania Fast solution of single-machine
scheduling problem with embedded jobs 91--106
Kingshuk Chatterjee and
Kumar Sankar Ray Unary Watson--Crick automata . . . . . . 107--112
Birzhan Moldagaliyev Randomness of formal languages via
automatic martingales . . . . . . . . . 113--128
Ning Xie and
Shuai Xu and
Yekun Xu A new coding-based algorithm for finding
closest pair of vectors . . . . . . . . 129--144
Felipe A. Louza and
Guilherme P. Telles and
Simon Gog and
Liang Zhao Algorithms to compute the
Burrows--Wheeler Similarity Distribution 145--156
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Dekel Tsur Parameterized algorithm for $3$-path
vertex cover . . . . . . . . . . . . . . 1--8
Amin Gheibi and
Anil Maheshwari and
Jörg-Rüdiger Sack Weighted minimum backward Fréchet
distance . . . . . . . . . . . . . . . . 9--21
Sungwook Kim and
Jinsu Kim and
Jae Hong Seo A new approach to practical
function-private inner product
encryption . . . . . . . . . . . . . . . 22--40
Petr A. Golovach and
Dieter Kratsch and
Mathieu Liedloff and
Mohamed Yosri Sayadi Enumeration and maximum number of
minimal dominating sets for chordal
graphs . . . . . . . . . . . . . . . . . 41--52
Palash Dey and
Neeldhara Misra and
Y. Narahari Parameterized dichotomy of choosing
committees based on approval votes in
the presence of outliers . . . . . . . . 53--70
San Ling and
Khoa Nguyen and
Huaxiong Wang and
Yanhong Xu Lattice-based group signatures:
Achieving full dynamicity (and
deniability) with ease . . . . . . . . . 71--94
Yaoyao Zhang and
Shuang Zhao and
Jixiang Meng Edge fault tolerance of graphs with
respect to $ \lambda_2$-optimal property 95--104
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Marco Budinich The Boolean SATisfiability Problem in
Clifford algebra . . . . . . . . . . . . 1--10
Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Fabrizio Montecchiani On $3$D visibility representations of
graphs with few crossings per edge . . . 11--20
Aixia Liu and
Shiying Wang and
Jun Yuan and
Xue Ma The $h$-extra connectivity of $k$-ary
$n$-cubes . . . . . . . . . . . . . . . 21--45
T.-H. Hubert Chan and
Zhihao Gavin Tang and
Xiaowei Wu and
Chenzi Zhang Diffusion operator and spectral analysis
for directed hypergraph Laplacian . . . 46--64
Kung-Jui Pai and
Ruay-Shiung Chang and
Ro-Yu Wu and
Jou-Ming Chang A two-stages tree-searching algorithm
for finding three completely independent
spanning trees . . . . . . . . . . . . . 65--74
Paul Balister and
Stefanie Gerke The asymptotic number of prefix normal
words . . . . . . . . . . . . . . . . . 75--80
\Lukasz Merta Composition inverses of the variations
of the Baum--Sweet sequence . . . . . . 81--98
Mouhammad Said and
Jacques-Olivier Lachaud Analytical description of digital
intersections: Minimal parameters and
multiscale representation . . . . . . . 99--112
Bogumil Kami\'nski and
Tomasz Olczak and
Pawel Pralat Parallel execution of schedules with
random dependency graph . . . . . . . . 113--132
Paz Carmi and
Anil Maheshwari and
Saeed Mehrabi and
Luís Fernando Schultz Xavier da Silveira Approximability of covering cells with
line segments . . . . . . . . . . . . . 133--141
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Lila Kari Editorial . . . . . . . . . . . . . . . iii--iii
C. R. Noordman and
G. A. W. Vreeswijk Evolving novelty strategies for the
Iterated Prisoner's Dilemma in deceptive
tournaments . . . . . . . . . . . . . . 1--16
Keenan Breik and
Chris Thachuk and
Marijn Heule and
David Soloveichik Computing properties of stable
configurations of thermodynamic binding
networks . . . . . . . . . . . . . . . . 17--29
Patrick Spettel and
Hans-Georg Beyer Analysis of the $ (1, \lambda)$-$ \sigma
$-Self-Adaptation Evolution Strategy
with repair by projection applied to a
conically constrained problem . . . . . 30--45
Tobias Friedrich and
Timo Kötzing and
Martin S. Krejca Unbiasedness of
estimation-of-distribution algorithms 46--59
Jacek Waldmajer and
Zbigniew Bonikowski and
Sebastian Sakowski Theory of tailor automata . . . . . . . 60--82
Felipe S. Abrahão and
Klaus Wehmuth and
Artur Ziviani Algorithmic networks: Central time to
trigger expected emergent open-endedness 83--116
M. N. Ellingham and
Joanna A. Ellis-Monaghan Edge-outer graph embedding and the
complexity of the DNA reporter strand
problem . . . . . . . . . . . . . . . . 117--127
Yo-Sub Han and
Hwee Kim Ruleset optimization on isomorphic
oritatami systems . . . . . . . . . . . 128--139
Liucheng Liu and
Wenmei Yi and
Qian Yang and
Hong Peng and
Jun Wang Numerical P systems with Boolean
condition . . . . . . . . . . . . . . . 140--149
Hafsteinn Einarsson and
Marcelo Matheus Gauy and
Johannes Lengler and
Florian Meier and
Asier Mujika and
Angelika Steger and
Felix Weissenberger The linear hidden subset problem for the
$ (1 + 1) $ EA with scheduled and
adaptive mutation rates . . . . . . . . 150--170
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Mingyu Xiao and
Frances A. Rosamond Frontiers in Algorithmics . . . . . . . 1--1
Faisal N. Abu-Khzam and
Shouwei Li and
Christine Markarian and
Friedhelm Meyer auf der Heide and
Pavel Podlipyan Efficient parallel algorithms for
parameterized problems . . . . . . . . . 2--12
Kelin Luo and
Yinfeng Xu and
Huili Zhang On-line scheduling with monotone
subsequence constraints . . . . . . . . 13--25
Sergey Bereg and
Feifei Ma and
Wencheng Wang and
Jian Zhang and
Binhai Zhu On some matching problems under the
color-spanning model . . . . . . . . . . 26--31
Shota Yuasa and
Zhi-Zhong Chen and
Bin Ma and
Lusheng Wang Designing and implementing algorithms
for the closest string problem . . . . . 32--43
Lusheng Wang and
Boting Yang Positive semidefinite zero forcing
numbers of two classes of graphs . . . . 44--54
Wenjun Li and
Haiyan Liu and
Jianxin Wang and
Lingyun Xiang and
Yongjie Yang An improved linear kernel for
complementary maximal strip recovery:
Simpler and smaller . . . . . . . . . . 55--66
Guangwei Wu and
Jianer Chen and
Jianxin Wang On scheduling inclined jobs on multiple
two-stage flowshops . . . . . . . . . . 67--77
Wei Chen and
Hanrui Zhang Complete submodularity characterization
in the comparative independent cascade
model . . . . . . . . . . . . . . . . . 78--87
Xin Han and
Qinyang Chen and
Kazuhisa Makino Online knapsack problem under concave
functions . . . . . . . . . . . . . . . 88--95
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Arnaud Carayol and
Cyril Nicaud Special issue --- Implementation and
Application of Automata (CIAA 2017) . . 1--1
Janusz A. Brzozowski and
Corwin Sinnamon Complexity of proper prefix-convex
regular languages . . . . . . . . . . . 2--13
Robert Ferens and
Marek Szyku\la Complexity of bifix-free regular
languages . . . . . . . . . . . . . . . 14--27
Louis-Marie Dando and
Sylvain Lombardy From Hadamard expressions to weighted
rotating automata and back . . . . . . . 28--44
Marek Szyku\la and
John Wittnebel Syntactic complexity of bifix-free
regular languages . . . . . . . . . . . 45--76
Andrew Ryzhikov Synchronization problems in automata
without non-trivial cycles . . . . . . . 77--88
Michal Hospodár and
Galina Jirásková and
Peter Mlynárcik Nondeterministic complexity in
subclasses of convex languages . . . . . 89--110
Martin Kutrib and
Andreas Malcher and
Matthias Wendlandt Transducing reversibly with finite state
machines . . . . . . . . . . . . . . . . 111--126
Yo-Sub Han and
Sang-Ki Ko Alignment distance of regular tree
languages . . . . . . . . . . . . . . . 127--137
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Xiaofeng Gao and
Dongdong Ge Preface: Special Issue on the Annual
International Conference on
Combinatorial Optimization and
Applications (COCOA) . . . . . . . . . . 1--1
Dongjing Miao and
Zhipeng Cai and
Jiguo Yu and
Yingshu Li Triangle edge deletion on planar
glasses-free RGB-digraphs . . . . . . . 2--11
Eric Angel and
Thang Nguyen Kim and
Shikha Singh Approximating $k$-forest with resource
augmentation: a primal-dual approach . . 12--20
Zhenhua Duan and
Cong Tian and
Nan Zhang and
Qian Ma and
Hongwei Du Index set expressions can represent
temporal logic formulas . . . . . . . . 21--38
Jiapeng Huang and
Zhenzao Wen and
Linghe Kong and
Li Ge and
Min-You Wu and
Guihai Chen Accelerate the classification statistics
in RFID systems . . . . . . . . . . . . 39--52
Longkun Guo and
Min Li and
Dachuan Xu Efficient approximation algorithms for
maximum coverage with group budget
constraints . . . . . . . . . . . . . . 53--65
Thomas Erlebach and
Fu-Hong Liu and
Hsiang-Hsuan Liu and
Mordechai Shalom and
Prudence W. H. Wong and
Shmuel Zaks Complexity and online algorithms for
minimum skyline coloring of intervals 66--78
Qian-Ping Gu and
Jiajian Leo Liang and
Guochuan Zhang Efficient algorithms for ridesharing of
personal vehicles . . . . . . . . . . . 79--94
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Hsu-Chun Yen and
Md. Saidur Rahman and
Sheung-Hung Poon Special Issue on Selected Papers from
the 11th International Conference and
Workshops on Algorithms and Computation
(WALCOM 2017) . . . . . . . . . . . . . 1--1
Eunjin Oh and
Hee-Kap Ahn Computing the center region and its
variants . . . . . . . . . . . . . . . . 2--12
Yeganeh Bahoo and
Bahareh Banyassady and
Prosenjit K. Bose and
Stephane Durocher and
Wolfgang Mulzer A time-space trade-off for computing the
$k$-visibility region of a point in a
polygon . . . . . . . . . . . . . . . . 13--21
Arash Vaezi and
Mohammad Ghodsi Visibility extension via mirror-edges to
cover invisible segments . . . . . . . . 22--33
Klaus Jansen and
Malin Rau Improved approximation for two
dimensional Strip Packing with
polynomial bounded width . . . . . . . . 34--49
Hugo A. Akitaya and
Rajasekhar Inkulu and
Torrie L. Nichols and
Diane L. Souvaine and
Csaba D. Tóth and
Charles R. Winston Minimum weight connectivity augmentation
for planar straight-line graphs . . . . 50--63
Yang Jiao and
R. Ravi and
Wolfgang Gatterbauer Algorithms for automatic ranking of
participants and tasks in an anonymized
contest . . . . . . . . . . . . . . . . 64--76
Rafael G. Cano and
Cid C. de Souza and
Pedro J. de Rezende Solving dynamic labeling problems to
optimality using solution space
reductions . . . . . . . . . . . . . . . 77--92
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Haris Aziz and
Péter Biró and
Jérôme Lang and
Julien Lesca and
Jérôme Monnot Efficient reallocation under additive
and responsive preferences . . . . . . . 1--15
Marieh Jahannia and
Morteza Mohammad-noori and
Narad Rampersad and
Manon Stipulanti Palindromic Ziv--Lempel and Crochemore
factorizations of $m$-Bonacci infinite
words . . . . . . . . . . . . . . . . . 16--40
Svyatoslav Covanov Improved method for finding optimal
formulas for bilinear maps in a finite
field . . . . . . . . . . . . . . . . . 41--65
Huiqing Liu and
Shunzhe Zhang and
Dong Li On $g$-extra conditional diagnosability
of hierarchical cubic networks . . . . . 66--79
Stefan Gerdjikov and
Stoyan Mihov and
Klaus U. Schulz Space-efficient bimachine construction
based on the equalizer accumulation
principle . . . . . . . . . . . . . . . 80--95
Dekel Tsur Faster deterministic parameterized
algorithm for $k$-path . . . . . . . . . 96--104
Sang Won Bae and
Haitao Wang $ L_1 $ shortest path queries in simple
polygons . . . . . . . . . . . . . . . . 105--116
Xueli Sun and
Qingfeng Dong and
Shuming Zhou and
Mengjie Lv and
Guanqin Lian and
Jiafei Liu Fault tolerance analysis of hierarchical
folded cube . . . . . . . . . . . . . . 117--130
Karel Klouda and
Stepán Starosta Characterization of circular D0L-systems 131--137
Motoya Machida and
Alexander Y. Shibakov Stack and register complexity of radix
conversions . . . . . . . . . . . . . . 138--151
Jianer Chen and
Henning Fernau and
Peter Shaw and
Jianxin Wang and
Zhibiao Yang Kernels for packing and covering
problems . . . . . . . . . . . . . . . . 152--166
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Changseong Jo and
Jihoon Choi and
Suh-Ryung Kim and
Yoshio Sano On the minimum clique partitioning
problem on weighted chordal graphs . . . 1--9
Mamadou Moustapha Kanté and
Thiago Marcilon and
Rudini Sampaio On the parameterized complexity of the
geodesic hull number . . . . . . . . . . 10--27
Richard Kueng and
Dustin G. Mixon and
Soledad Villar Fair redistricting is hard . . . . . . . 28--35
Patrick Hartman and
Joe Sawada Ranking and unranking fixed-density
necklaces and Lyndon words . . . . . . . 36--47
Takuro Fukunaga and
Takanori Maehara Computing a tree having a small vertex
cover . . . . . . . . . . . . . . . . . 48--61
Pierluigi Baiocchi and
Tiziana Calamoneri and
Angelo Monti and
Rossella Petreschi Some classes of graphs that are not PCGs 62--75
Yeganeh Bahoo and
Stephane Durocher and
J. Mark Keil and
Debajyoti Mondal and
Saeed Mehrabi and
Sahar Mehrpour Polygon simplification by minimizing
convex corners . . . . . . . . . . . . . 76--86
Ran Ben Basat and
Gil Einziger and
Roy Friedman Give me some slack: Efficient network
measurements . . . . . . . . . . . . . . 87--108
Margot Bruneaux A note about words which coincide except
in one position . . . . . . . . . . . . 109--111
J. Recasens On a conjecture concerning positive
semi-definiteness . . . . . . . . . . . 112--115
Yuan Li and
John O. Adeyeye Maximal sensitivity of Boolean nested
canalizing functions . . . . . . . . . . 116--122
Pamela Fleischmann and
Pascal Ochem and
Kamellia Reshadi Repetition avoidance in products of
factors . . . . . . . . . . . . . . . . 123--126
Jeremy F. Alm and
Andrew Ylvisaker A fast coset-translation algorithm for
computing the cycle structure of Comer
relation algebras over $ \mathbb {Z} / p
\mathbb {Z} $ . . . . . . . . . . . . . 127--131
Christopher Melekian and
Eddie Cheng A note on generalized matching
preclusion in bipartite graphs . . . . . 132--140
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Maxime Crochemore and
Jakub Radoszewski Special issue in honor of the 70th
birthday of Prof. Wojciech Rytter . . . 1--1
Artur Czumaj and
Peter Davies Leader election in multi-hop radio
networks . . . . . . . . . . . . . . . . 2--11
Mai Alzamel and
Costas S. Iliopoulos and
W. F. Smyth and
Wing-Kin Sung Off-line and on-line algorithms for
closed string factorization . . . . . . 12--19
Wojciech Plandowski On PSPACE generation of a solution set
of a word equation and its applications 20--61
Wojciech Plandowski and
Aleksy Schubert On the complexity of computation maximal
exponent of periodicity of word
equations and expressible relations
(note) . . . . . . . . . . . . . . . . . 62--68
Jurek Czyzowicz and
Maxime Godon and
Evangelos Kranakis and
Arnaud Labourel Group search of the plane with faulty
robots . . . . . . . . . . . . . . . . . 69--84
Yannis Almirantis and
Panagiotis Charalampopoulos and
Jia Gao and
Costas S. Iliopoulos and
Manal Mohamed and
Solon P. Pissis and
Dimitris Polychronopoulos On overabundant words and their
application to biological sequence
analysis . . . . . . . . . . . . . . . . 85--95
Jeffrey Shallit and
Arseny Shur Subword complexity and power avoidance 96--116
Raffaele Giancarlo and
Simona E. Rombo and
Filippo Utro DNA combinatorial messages and
Epigenomics: the case of chromatin
organization and nucleosome occupancy in
eukaryotic genomes . . . . . . . . . . . 117--130
Yuto Nakashima and
Takuya Takagi and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda On the size of the smallest alphabet for
Lyndon trees . . . . . . . . . . . . . . 131--143
Gabriele Fici and
Antonio Restivo and
Laura Rizzo Minimal forbidden factors of circular
words . . . . . . . . . . . . . . . . . 144--153
Sergey Avgustinovich and
Julien Cassaigne and
Juhani Karhumäki and
Svetlana Puzynina and
Aleksi Saarela On abelian saturated infinite words . . 154--160
Diptarama Hendrian and
Shunsuke Inenaga and
Ryo Yoshinaka and
Ayumi Shinohara Efficient dynamic dictionary matching
with DAWGs and AC-automata . . . . . . . 161--172
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Kitti Gelle and
Szabolcs Iván The ordinal generated by an ordinal
grammar is computable . . . . . . . . . 1--13
Bin Wang and
Guangyan Zhou Super solutions of random $ (3 + p)$-SAT 14--27
Aritra Banik and
Sandip Das and
Anil Maheshwari and
Michiel Smid The discrete Voronoi game in a simple
polygon . . . . . . . . . . . . . . . . 28--35
Hossein Teimoori Faal A multiset version of determinants and
the Coin arrangements lemma . . . . . . 36--43
Wei Yu and
Zhaohui Liu and
Xiaoguang Bao New approximation algorithms for the
minimum cycle cover problem . . . . . . 44--58
A. Amir and
A. Levy and
R. Lubin and
E. Porat Approximate cover of strings . . . . . . 59--69
A. V. Kononov and
M. Y. Kovalyov and
B. M. T. Lin Minimizing machine assignment costs over
$ \Delta $-approximate solutions of the
scheduling problem $ P || C_{\rm max} $ 70--78
Hui Wang and
Cees H. Elzinga and
Zhiwei Lin and
Jordan Vincent Quantifying sequential subsumption . . . 79--99
Bernadette Charron-Bost and
Shlomo Moran The firing squad problem revisited . . . 100--112
Mengjie Lv and
Shuming Zhou and
Xueli Sun and
Guanqin Lian and
Jiafei Liu and
Dajin Wang Probabilistic diagnosis of clustered
faults for hypercube-based
multiprocessor system . . . . . . . . . 113--131
Yoshifumi Sakai Maximal common subsequence algorithms 132--139
Tung-Wei Kuo On the approximability and hardness of
the minimum connected dominating set
with routing cost constraint . . . . . . 140--151
Da-Jung Cho and
Yo-Sub Han and
Hwee Kim Bound-decreasing duplication system . . 152--168
Nadia Brauner and
Yves Crama and
Etienne Delaporte and
Vincent Jost and
Luc Libralesso Do balanced words have a short period? 169--180
Pingshan Li and
Min Xu The $ t / k$-diagnosability and strong
Menger connectivity on star graphs with
conditional faults . . . . . . . . . . . 181--192
Benjamin Blanchette Quasi-automatic groups are
asynchronously automatic . . . . . . . . 193--195
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Spyros Angelopoulos and
Nicolas Nisse and
Dimitrios M. Thilikos Preface to special issue on Theory and
Applications of Graph Searching . . . . 1--2
Pawe\l Pra\lat How many zombies are needed to catch the
survivor on toroidal grids? . . . . . . 3--11
Anthony Bonato and
Thomas Lidbetter Bounds on the burning numbers of spiders
and path-forests . . . . . . . . . . . . 12--19
Steve Alpern Search for an immobile Hider in a known
subset of a network . . . . . . . . . . 20--26
Ioannis Lamprou and
Russell Martin and
Sven Schewe Eternally dominating large grids . . . . 27--46
Dariusz Dereniowski and
Tomás Gavenciak and
Jan Kratochvíl Cops, a fast robber and defensive
domination on interval graphs . . . . . 47--58
A. Bonato and
N. E. Clarke and
D. Cox and
S. Finbow and
F. McInerney and
M. E. Messinger Hyperopic Cops and Robbers . . . . . . . 59--68
Pierre Coupechoux and
Marc Demange and
David Ellison and
Bertrand Jouve Firefighting on trees . . . . . . . . . 69--84
Dariusz Dereniowski and
Dorota Osula and
Pawe\l Rzazewski Finding small-width connected path
decompositions in polynomial time . . . 85--100
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Do Le Paul Minh and
Truong Thi Thuy Duong Bayesian networks: the minimal
triangulations of a graph . . . . . . . 1--8
Sebastián González Hermosillo de la Maza and
César Hernández-Cruz On the complexity of the $k$-kernel
problem on cyclically $k$-partite
digraphs . . . . . . . . . . . . . . . . 9--19
Ming Zeng and
Jie Chen and
Kai Zhang and
Haifeng Qian Public key encryption with equality test
via hash proof system . . . . . . . . . 20--35
Yanze Huang and
Limei Lin and
Li Xu and
Xiaoding Wang Extra diagnosability and good-neighbor
diagnosability of $n$-dimensional
alternating group graph AG$_n$ under the
PMC model . . . . . . . . . . . . . . . 36--49
Muhammad S. Akhtar and
Usman Ali and
Ghulam Abbas and
Mutahira Batool On the game chromatic number of
splitting graphs of path and cycle . . . 50--56
Lin Lyu and
Shengli Liu and
Dawu Gu Structure-preserving public-key
encryption with leakage-resilient CCA
security . . . . . . . . . . . . . . . . 57--80
Shlomi Dolev and
Niv Gilboa and
Ximing Li Accumulating automata and cascaded
equations automata for communicationless
information theoretically secure
multi-party computation . . . . . . . . 81--99
Frank Gurski and
Carolin Rehs and
Jochen Rethmann On the hardness of palletizing bins
using FIFO queues . . . . . . . . . . . 100--107
J. Bang-Jensen and
Kristine V. K. Knudsen and
Saket Saurabh and
Meirav Zehavi The parameterized complexity landscape
of finding $2$-partitions of digraphs 108--114
Che-Nan Kuo and
Yu-Huei Cheng Cycles in folded hypercubes with two
adjacent faulty vertices . . . . . . . . 115--118
Van Huy Pham and
Kien Trung Nguyen Inverse $1$-median problem on trees
under mixed rectilinear and Chebyshev
norms . . . . . . . . . . . . . . . . . 119--127
Nina Chiarelli and
Tatiana Romina Hartinger and
Valeria Alejandra Leoni and
Maria Inés Lopez Pujato and
Martin Milanic New algorithms for weighted
$k$-domination and total $k$-domination
problems in proper interval graphs . . . 128--141
Boris Brimkov and
Joshua Carlson and
Illya V. Hicks and
Rutvik Patel and
Logan Smith Power domination throttling . . . . . . 142--153
Yining Hu and
Guoniu Wei-Han On the automaticity of the Hankel
determinants of a family of automatic
sequences . . . . . . . . . . . . . . . 154--164
C. Ramya and
B. V. Raghavendra Rao Linear projections of the Vandermonde
polynomial . . . . . . . . . . . . . . . 165--182
Pierre Bergé and
Arpad Rimmel and
Joanna Tomasik On the parameterized complexity of
separating certain sources from the
target . . . . . . . . . . . . . . . . . 183--193
Véronique Terrier Communication complexity tools on
recognizable picture languages . . . . . 194--203
Nicollas M. Sdroievski and
Murilo V. G. da Silva and
André L. Vignatti The Hidden Subgroup Problem and MKTP . . 204--212
Lu Miao and
Shurong Zhang and
Rong-hua Li and
Weihua Yang Structure fault tolerance of $k$-ary
$n$-cube networks . . . . . . . . . . . 213--218
Dongqin Cheng Vertex-disjoint paths joining adjacent
vertices in faulty hypercubes . . . . . 219--224
Mojtaba Khalili and
Mohammad Dakhilalian and
Carla R\`afols Short tightly secure signatures for
signing a vector of group elements: a
new approach . . . . . . . . . . . . . . 225--239
Michel Latteux and
Yves Roos On prefixal one-rule string rewrite
systems . . . . . . . . . . . . . . . . 240--256
Friedrich Otto On deterministic ordered restart-delete
automata . . . . . . . . . . . . . . . . 257--274
Leizhen Cai and
Junjie Ye Two edge-disjoint paths with length
constraints . . . . . . . . . . . . . . 275--284
Gruia Calinescu and
Guy Kortsarz and
Zeev Nutov Improved approximation algorithms for
minimum power covering problems . . . . 285--300
Amy Glen and
Jamie Simpson and
W. F. Smyth More properties of the Fibonacci word on
an infinite alphabet . . . . . . . . . . 301--311
Stephan Dominique Andres and
Melissa Huggan and
Fionn Mc Inerney and
Richard J. Nowakowski The orthogonal colouring game . . . . . 312--325
Xiao Zhang and
Shengli Liu and
Jiaxin Pan and
Dawu Gu Tightly secure signature schemes from
the LWE and subset sum assumptions . . . 326--344
Diodato Ferraioli and
Carmine Ventre Social pressure in opinion dynamics . . 345--361
Jurek Czyzowicz and
Krzysztof Diks and
Jean Moussi and
Wojciech Rytter Energy-optimal broadcast and exploration
in a tree using mobile agents . . . . . 362--374
Patrizio Angelinia and
Michael A. Bekosa and
Walter Didimo and
Luca Grilli and
Philipp Kindermann and
Tamara Mchedlidze and
Roman Prutkin and
Antonios Symvonis and
Alessandra Tappini Greedy rectilinear drawings . . . . . . 375--397
Mohammad Ali Abam and
Mahnaz Sadat Qafari Geometric spanner games . . . . . . . . 398--407
Michael A. Bekosa and
Felice De Luca and
Walter Didimo and
Tamara Mchedlidze and
Martin Nöllenburg and
Antonios Symvonis and
Ioannis Tollis Planar drawings of fixed-mobile bigraphs 408--419
Samir Khuller and
Jingling Li and
Pascal Sturmfels and
Kevin Sun and
Prayaag Venkat Select and permute: an improved online
framework for scheduling to minimize
weighted completion time . . . . . . . . 420--431
Liqiang Peng and
Atsushi Takayasu Generalized cryptanalysis of small
CRT-exponent RSA . . . . . . . . . . . . 432--458
Michael Amir and
Alfred M. Bruckstein Probabilistic pursuits on graphs . . . . 459--477
Jason Crampton and
Gregory Gutin and
Martin Koutecký and
Rémi Watrigant Parameterized resiliency problems . . . 478--491
Pawe\l Garncarek and
Tomasz Jurdzi\'nski and
Dariusz R. Kowalski and
Krzysztof Lory\'s Online packet scheduling under
adversarial errors . . . . . . . . . . . 492--509
Naoyuki Kamiyama Discrete Newton methods for the
evacuation problem . . . . . . . . . . . 510--519
Bart M. P. Jansen and
Jesper Nederlof Computing the chromatic number using
graph decompositions via matrix rank . . 520--539
Min Xu and
Yulong Wei The $h$-edge tolerable diagnosability of
balanced hypercubes . . . . . . . . . . 540--546
Jan Legerský and
Milena Svobodová Construction of algorithms for parallel
addition in expanding bases via
Extending Window Method . . . . . . . . 547--569
Keisuke Hara and
Fuyuki Kitagawa and
Takahiro Matsuda and
Goichiro Hanaoka and
Keisuke Tanaka Simulation-based receiver selective
opening CCA secure PKE from standard
computational assumptions . . . . . . . 570--597
Anonymous Pages 1--308 (3 December 2019) . . . . . 1--308
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
S. Banerjee and
J. Mark Keil and
D. Pradhan Perfect Roman domination in graphs . . . 1--21
Felice De Luca and
Md Iqbal Hossain and
Stephen Kobourov and
Anna Lubiw and
Debajyoti Mondal Recognition and drawing of stick graphs 22--33
Annalisa De Bonis New selectors and locally thin families
with applications to multi-access
channels supporting simultaneous
transmissions . . . . . . . . . . . . . 34--50
Timo Kötzing and
Martin S. Krejca First-hitting times under drift . . . . 51--69
Yucheng Wang and
Qi Bao and
Zhongzhi Zhang Combinatorial properties of Farey graphs 70--89
Liya Yang and
Xiwen Lu Two-agent scheduling problems with the
general position-dependent processing
time . . . . . . . . . . . . . . . . . . 90--98
Steve Hanneke and
Aryeh Kontorovich Optimality of SVM: Novel proofs and
tighter bounds . . . . . . . . . . . . . 99--113
Hafiz Muhammad Afzal Siddiqui and
Sakander Hayat and
Asad Khan and
Muhammad Imran and
Ayesha Razzaq and
Jia-Bao Liu Resolvability and fault-tolerant
resolvability structures of convex
polytopes . . . . . . . . . . . . . . . 114--128
Janosch Döcker and
Simone Linz and
Charles Semple Displaying trees across two phylogenetic
networks . . . . . . . . . . . . . . . . 129--146
Guanqin Lian and
Shuming Zhou and
Sun-Yuan Hsieh and
Jiafei Liu and
Gaolin Chen and
Yihong Wang Performance evaluation on hybrid fault
diagnosability of regular networks . . . 147--153
Nour El Houda Tellache and
Mourad Boudhar and
Farouk Yalaoui Two-machine open shop problem with
agreement graph . . . . . . . . . . . . 154--168
Dong Li and
Xiaolan Hu and
Huiqing Liu Structure connectivity and substructure
connectivity of twisted hypercubes . . . 169--179
Nader Jafari Rad On the complexity of multiple bondage in
graphs . . . . . . . . . . . . . . . . . 180--186
Robert Janczewski and
Pawe\l Obszarski and
Krzysztof Turowski $2$-Coloring number revisited . . . . . 187--195
Thomas Schweser DP-degree colorable hypergraphs . . . . 196--206
Diptapriyo Majumdar and
Rian Neogi and
Venkatesh Raman and
S. Vaishali Tractability of König edge deletion
problems . . . . . . . . . . . . . . . . 207--215
Lars Jaffke and
O-joung Kwon and
Torstein J. F. Stròmme and
Jan Arne Telle Mim-width III. Graph powers and
generalized distance domination problems 216--236
Matthew Moore Finite degree clones are undecidable . . 237--271
Mauro Castelli and
Riccardo Dondi and
Giancarlo Mauri and
Italo Zoppis Comparing incomplete sequences via
longest common subsequence . . . . . . . 272--285
Yuval Filmus Another look at degree lower bounds for
polynomial calculus . . . . . . . . . . 286--293
Tesshu Hanaka and
Hans L. Bodlaender and
Tom C. van der Zanden and
Hirotaka Ono On the maximum weight minimal separator 294--308
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Sven Schewe and
Thomas Schneider and
Jef Wijsen Special issue on Temporal Representation
and Reasoning (TIME 2017) . . . . . . . 1--1
Massimo Cairo and
Romeo Rizzi Dynamic controllability of simple
temporal networks with uncertainty:
Simple rules and fast real-time
execution . . . . . . . . . . . . . . . 2--16
Michael Sioutis and
Anastasia Paparrizou and
Jean-François Condotta Collective singleton-based consistency
for qualitative constraint networks:
Theory and practice . . . . . . . . . . 17--41
Antoine Amarilli and
Mouhamadou Lamine Ba and
Daniel Deutch and
Pierre Senellart Computing possible and certain answers
over order-incomplete data . . . . . . . 42--76
Matteo Zavatteri and
Luca Vigan\`o Conditional simple temporal networks
with uncertainty and decisions . . . . . 77--101
Przemys\law Andrzej Wa\lega Hybrid fragments of Halpern--Shoham
logic and their expressive power . . . . 102--128
Valentin Goranko and
Antti Kuusisto and
Raine Rönnholm Alternating-time temporal logic ATL with
finitely bounded semantics . . . . . . . 129--155
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Stavros Konstantinidis and
Giovanni Pighizzini Special section on Descriptional
Complexity of Formal Systems . . . . . . 1--1
Tomoyuki Yamakami State complexity characterizations of
parameterized degree-bounded graph
connectivity, sub-linear space
computation, and the linear space
hypothesis . . . . . . . . . . . . . . . 2--22
Oscar H. Ibarra and
Ian McQuillan State grammars with stores . . . . . . . 23--39
Da-Jung Cho and
Yo-Sub Han and
Kai Salomaa and
Taylor J. Smith Site-directed insertion: Language
equations and decision problems . . . . 40--51
Galina Jirásková and
Alexander Okhotin State complexity of unambiguous
operations on finite automata . . . . . 52--64
Alexander Okhotin and
Kai Salomaa Further closure properties of
input-driven pushdown automata . . . . . 65--77
Simon Beier and
Markus Holzer Properties of right one-way jumping
finite automata . . . . . . . . . . . . 78--94
Bruno Guillon and
Luca Prigioniero Linear-time limited automata . . . . . . 95--108
Stefan Hetzl and
Simon Wolfsteiner On the cover complexity of finite
languages . . . . . . . . . . . . . . . 109--125
Anonymous Pages 1--160 (24 December 2019) . . . . 1--160
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Giordano Da Lozzo and
Ignaz Rutter Planarity of streamed graphs . . . . . . 1--21
Eminjan Sabir and
Aygul Mamut and
Elkin Vumar The extra connectivity of the enhanced
hypercubes . . . . . . . . . . . . . . . 22--31
Hadi Rahbani and
Nader Jafari Rad and
Mohammad-Reza Sadeghi A note on the complexity of
locating-total domination in graphs . . 32--39
Endre Boros and
Vladimir Gurvich and
Nhan Bao Ho and
Kazuhisa Makino and
Peter Mursic Sprague--Grundy function of matroids and
related hypergraphs . . . . . . . . . . 40--58
Shunzhe Zhang and
Huiqing Liu and
Xiaolan Hu Hybrid fault diagnosis capability
analysis of triangle-free graphs . . . . 59--70
Oscar H. Ibarra and
Ian McQuillan On families of full trios containing
counter machine languages . . . . . . . 71--93
Mei-Mei Gu and
Shengjie He and
Rong-Xia Hao and
Eddie Cheng Strongly Menger connectedness of data
center network and $ (n, k)$-star graph 94--103
Runjie Miao and
Jinjiang Yuan and
Fei Huang Paths and trails in edge-colored
weighted graphs . . . . . . . . . . . . 104--114
Muhammad Murtaza and
Muhammad Fazil and
Imran Javaid Locating-dominating sets of functigraphs 115--123
Titus Dose Balance problems for integer circuits 124--139
James Currie and
Tero Harju and
Pascal Ochem and
Narad Rampersad Some further results on squarefree
arithmetic progressions in infinite
words . . . . . . . . . . . . . . . . . 140--148
Ulrich Pferschy and
Gaia Nicosia and
Andrea Pacifici A Stackelberg knapsack game with weight
control . . . . . . . . . . . . . . . . 149--159
Anonymous Editorial Board . . . . . . . . . . . . ii--ii
Manfred Droste and
Ilias Kotsireas and
Robert Rolland Preface . . . . . . . . . . . . . . . . 1--2
Gregory V. Bard Determining whether a given
cryptographic function is a permutation
of another given cryptographic function
--- a problem in intellectual property 3--14
Pascal Caron and
Jean-Gabriel Luque and
Bruno Patrou State complexity of combined operations
involving catenation and binary Boolean
operations: Beyond the Brzozowski
conjectures . . . . . . . . . . . . . . 15--30
Charles J. Colbourn and
Ryan E. Dougherty and
Daniel Horsley Distributing hash families with few rows 31--41
Nikolaos Doukas and
Oleksandr P. Markovskyi and
Nikolaos G. Bardis Hash function design for cloud storage
data auditing . . . . . . . . . . . . . 42--51
G. H. E. Duchamp and
V. Hoang Ngoc Minh and
Ngo Quoc Hoan Kleene stars of the plane,
polylogarithms and symmetries . . . . . 52--72
Georgios Fotiadis and
Elisavet Konstantinou TNFS resistant families of
pairing-friendly elliptic curves . . . . 73--89
Ludwig Kampel and
Manuel Leithner and
Bernhard Garn and
Dimitris E. Simos Problems and algorithms for covering
arrays via set covers . . . . . . . . . 90--106
Ludwig Kampel and
Dimitris E. Simos A survey on the state of the art of
complexity problems for covering arrays 107--124
Ondrej Klíma and
Libor Polák Syntactic structures of regular
languages . . . . . . . . . . . . . . . 125--141
Petr Lisonek Kochen--Specker sets and Hadamard
matrices . . . . . . . . . . . . . . . . 142--145
Lucia Moura and
Sebastian Raaphorst and
Brett Stevens Upper bounds on the sizes of variable
strength covering arrays using the Lovász
local lemma . . . . . . . . . . . . . . 146--154
Jean-Éric Pin and
Xaro Soler-Escriv\`a Languages and formations generated by $
D_4 $ and $ Q_8 $ . . . . . . . . . . . 155--172
Takis Sakkalis and
Kwanghee Ko and
Galam Song Roots of quaternion polynomials: Theory
and computation . . . . . . . . . . . . 173--178
Sanjib Sadhu and
Xiaozhou He and
Sasanka Roy and
Subhas C. Nandy and
Suchismita Roy Corrigendum to: ``Linear time algorithm
to cover and hit a set of line segments
optimally by two axis-parallel squares''
[Theor. Comput. Sci. \bf 769 (2019)
63--74] . . . . . . . . . . . . . . . . 632--640
Sylvain Lazard and
William J. Lenhart and
Giuseppe Liotta Corrigendum to ``On the edge-length
ratio of outerplanar graphs'' [Theoret.
Comput. Sci. \bf 770 (2019) 88--94] . . 689--689
Chuangyin Dang and
Yinyu Ye Erratum/Correction to ``On the
complexity of an expanded Tarski's fixed
point problem under the componentwise
ordering'' [Theor. Comput. Sci. \bf 732
(2018) 26--45] . . . . . . . . . . . . . 80--80
Stephan Dominique Andres and
Melissa Huggan and
Fionn Mc Inerney and
Richard J. Nowakowski Corrigendum to ``The orthogonal
colouring game'' [Theor. Comput. Sci.
\bf 795 (2019) 312--325] . . . . . . . . 133--135