Discrete Mathematics & Theoretical Computer Science, Volume 17

Volume 17, Number 1, 2015

Discrete Algorithms

• 
  Sergio Cabello, Maria Saumell:
  A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon. 1-12

Graph Theory

• 
  Louis DeBiasio, Safi Faizullah, Imdadullah Khan:
  Ore-degree threshold for the square of a Hamiltonian cycle. 13-32
• 
  Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper:
  An Approximability-related Parameter on Graphs - Properties and Applications. 33-66
• 
  Akbar Davoodi, Behnaz Omoomi:
  On the 1-2-3-conjecture. 67-78
• 
  Jernej Azarija, Sandi Klavzar, Jaehun Lee, Yoomi Rho:
  Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes. 79-88

Combinatorics

• 
  Koen Thas:
  Classification of skew translation generalized quadrangles, I. 89-96

Graph Theory

• 
  Grant Cairns, Stacey Mendan:
  Symmetric Bipartite Graphs and Graphs with Loops. 97-102
• 
  Anton Pierre de Villiers, Alewyn Petrus Burger, Jan Harm van Vuuren:
  Edge stability in secure graph domination. 103-122

Combinatorics

• 
  Helmut Prodinger, Stephan G. Wagner:
  Bootstrapping and double-exponential limit laws. 123-144
• 
  Andrzej Grzesik, Mirjana Mikalacki, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman:
  Avoider-Enforcer star games. 145-160

Graph Theory

• 
  Bostjan Bresar, Sandi Klavzar, Gasper Kosmrlj, Douglas F. Rall:
  Guarded subgraphs and the domination game. 161-168
• 
  Mauricio Soto, Christopher Thraves Caro:
  p-Box: A new graph model. 169-186
• 
  Flavia Bonomo, Celina Miraglia Herrera de Figueiredo, Guillermo Alfredo Durán, Luciano Norberto Grippo, Martín Darío Safe, Jayme Luiz Szwarcfiter:
  On probe co-bipartite and probe diamond-free graphs. 187-200

Discrete Algorithms

• 
  Graham Farr:
  Cost-effectiveness of algorithms. 201-218

Graph Theory

• 
  Olga Bodroza-Pantic, Harris Kwong, Milan Pantic:
  A Conjecture on the Number of Hamiltonian Cycles on Thin Grid Cylinder Graphs. 219-240
• 
  Adel Alahmadi, Robert E. L. Aldred, Ahmad Alkenani, Rola Hijazi, Patrick Solé, Carsten Thomassen:
  Extending a perfect matching to a Hamiltonian cycle. 241-254
• 
  Michael Anthony Henning, Viroshan Naicker:
  Graphs with Large Disjunctive Total Domination Number. 255-282

Automata, Logic and Semantics

• 
  Vojtech Vorel, Adam Roman:
  Parameterized Complexity of Synchronization and Road Coloring. 283-306
• 
  François Gonze, Raphaël M. Jungers, Avraham Trakhtman:
  A Note on a Recent Attempt to Improve the Pin-Frankl Bound. 307-308

Discrete Algorithms

• 
  Hossein Ghasemalizadeh, Mohammadreza Razzazi:
  Output sensitive algorithm for covering many points. 309-316

Distributed Computing and Networking

• 
  Avleen Kaur Malhi, Shalini Batra:
  An Efficient Certificateless Aggregate Signature Scheme for Vehicular Ad-Hoc Networks. 317-338

Graph Theory

• 
  Mikko Pelto:
  Maximum difference about the size of optimal identifying codes in graphs differing by one vertex. 339-356

Automata, Logic and Semantics

• 
  Ludwig Staiger:
  On the Hausdorff measure of regular ω-languages in Cantor space. 357-368

Graph Theory

• 
  Gunnar Brinkmann, Myriam Preissmann, Diana Sasaki:
  Snarks with total chromatic number 5. 369-382

Combinatorics

• 
  Bridget Eileen Tenner:
  Intervals and factors in the Bruhat order. 382-394

Discrete Algorithms

• 
  Gregory Ross Maloney:
  On substitution tilings of the plane with n-fold rotational symmetry. 395-412

Analysis of Algorithms

• 
  Kimball Martin, Krishnan Shankar:
  How often should you clean your room? 415-444

Volume 17, Number 2, 2015

Combinatorics

• 
  Pedro Lopes, João Matias:
  Minimum Number of Colors: the Turk's Head Knots Case Study. 1-30

Graph Theory

• 
  Charles L. Dunn, Victor Larsen, Kira Lindke, Troy Retter, Dustin Toci:
  The game chromatic number of trees and forests. 31-48
• 
  Matthias Kriesell, Anders Sune Pedersen:
  On graphs double-critical with respect to the colouring number. 49-62
• 
  Ajit A. Diwan, Justine E. Dion, David J. Mendell, Michael Plantholt, Shailesh K. Tipnis:
  The complexity of P₄-decomposition of regular graphs and multigraphs. 63-76

Discrete Algorithms

• 
  Robert Ganian:
  Improving Vertex Cover as a Graph Parameter. 77-100

Graph Theory i

• 
  Martiniano Eguía, Francisco J. Soulignac:
  Disimplicial arcs, transitive vertices, and disimplicial eliminations. 101-118
• 
  Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
  Packing Plane Perfect Matchings into a Point Set. 119-142

Discrete Algorithms

• 
  Gwenaël Joret, Adrian Vetta:
  Reducing the rank of a matroid. 143-156

Automata, Logic and Semantics

• 
  Viliam Geffert, Abuzer Yakaryilmaz:
  Classical Automata on Promise Problems. 157-180

Combinatorics

• 
  Toufik Mansour, Mark Shattuck:
  On avoidance of patterns of the form σ-τ by words over a finite alphabet. 181-202
• 
  Dirk Frettlöh, Alexey Garber:
  Symmetries of Monocoronal Tilings. 203-234

Analysis of Algorithms

• 
  Marek Klonowski, Jacek Cichon, Rafal Kapelko:
  On the Dynamics of Systems of Urns. 235-250

Graph Theory

• 
  Robert Sámal:
  Cubical coloring - fractional covering by cuts and semidefinite programming. 251-266

Automata, Logic and Semantics

• 
  Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés:
  Some undecidable problems about the trace-subshift associated to a Turing machine. 267-284

Combinatorics

• 
  Natalie Aisbett:
  A relation on 132-avoiding permutation patterns. 285-302

Graph Theory

• 
  Jeongmi Park, Yoshio Sano:
  The double competition multigraph of a digraph. 303-310

Volume 17, Number 3, 2016

Graph Theory

• 
  Hongliang Lu:
  Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights. 1-12

Combinatorics

• 
  Jean-Luc Baril:
  Avoiding patterns in irreducible permutations. 13-30

Graph Theory

• 
  Julien Bensmail, Romaric Duvignau, Sergey Kirgizov:
  The complexity of deciding whether a graph admits an orientation with fixed weak diameter. 31-42
• 
  Julien Bensmail, Brett Stevens:
  Edge-partitioning graphs into regular and locally irregular components. 43-58

Special issue PRIMA 2013

• 
  Jacobus H. Koolen, Woo-Sun Lee, William J. Martin, Hajime Tanaka:
  Arithmetic completely regular codes. 59-76

Combinatorics

• 
  Adrian Tanasa, Nguyen Hoang Nghia, Christophe Tollu:
  Dendriform structures for restriction-deletion and restriction-contraction matroid Hopf algebras. 77-90
• 
  Susana-Clara López, Francesc Antoni Muntaner-Batle:
  Rainbow eulerian multidigraphs and the product of cycles. 90-104

Distributed Computing and Networking

• 
  Milan Erdelj, Nathalie Mitton, Tahiry Razafindralambo:
  Robust Wireless Sensor Network Deployment. 105-130

Graph Theory

• 
  Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
  Planar graphs with Δ≥7 and no triangle adjacent to a C₄ are minimally edge and total choosable. 131-146

Combinatorics

• 
  Armend Shaban Shabani, Gjergji Rexhep:
  Statistics for 3-letter patterns with repetitions in compositions. 147-166

Automata, Logic and Semantics

• 
  Tara Brough, Laura Ciobanu, Murray Elder, Georg Zetzsche:
  Permutations of context-free, ET0L and indexed languages. 167-178
• 
  Inna Mikhaylova:
  A proof of Zhil'tsov's theorem on decidability of equational theory of epigroups. 179-202

Graph Theory

• 
  Jianxi Li, Yang Liu, Wai Chee Shiu:
  The irregularity of two types of trees. 203-216
• 
  Arash Ahadi, Ali Dehghan:
  The inapproximability for the (0, 1)-additive number. 217-226

Discrete Algorithms

• 
  Xiaoyan Zhang, Zan-Bo Zhang, Hajo Broersma, Xuelian Wen:
  On the complexity of edge-colored subgraph partitioning problems in network optimization. 227-244

Graph Theory

• 
  Johan P. de Wet, Susan A. van Aardt:
  Traceability of locally hamiltonian and locally traceable graphs. 245-262
• 
  Palanivel Subramania Nadar Paulraja, S. Sampath Kumar:
  Edge Disjoint Hamilton Cycles in Knödel Graphs. 263-284

Discrete Algorithms

• 
  Marek Klonowski, Malgorzata Sulkowska:
  Energy-optimal algorithms for computing aggregative functions in random networks. 285-306

Graph Theory

• 
  Shih-Yan Chen, Shin-Shin Kao, Hsun Su:
  On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance. 307-314
• 
  Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis:
  Connected Tropical Subgraphs in Vertex-Colored Graphs.
• 
  Deyan Zeng, Jian-Hua Yin:
  An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size.
• 
  Yoomi Rho, Aleksander Vesel:
  Linear recognition of generalized Fibonacci cubes Q_h(111).