Journal: Discrete Mathematics & Theoretical Computer Science

Volume 19, Issue 4

0 -- 0Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche. A Characterization for Decidable Separability by Piecewise Testable Languages
0 -- 0Marius Dumitran, Pawel Gawrychowski, Florin Manea. Longest Gapped Repeats and Palindromes
0 -- 0Philippe Moser, Frank Stephan 0001. Depth, Highness and DNR degrees
0 -- 0Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant. Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations

Volume 19, Issue 3

0 -- 0Robert A. Proctor, Matthew J. Willis. Parabolic Catalan numbers count flagged Schur functions and their appearances as type A Demazure characters (key polynomials)
0 -- 0Matthieu Josuat-Vergès. Stammering tableaux
0 -- 0Silvio Capobianco, Jarkko Kari, Siamak Taati. Post-surjectivity and balancedness of cellular automata over groups
0 -- 0Hao Lin, Xiumei Wang. Three matching intersection property for matching covered graphs
0 -- 0Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski. Tight Euler tours in uniform hypergraphs - computational aspects
0 -- 0Arpitha P. Bharathi, Minati De, Abhiruk Lahiri. Circular Separation Dimension of a Subclass of Planar Graphs
0 -- 0Lingjuan Shi, Heping Zhang. Tight upper bound on the maximum anti-forcing numbers of graphs
0 -- 0Alexis Cornet, Christian Laforest. Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts
0 -- 0Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz. Inkdots as advice for finite automata
0 -- 0Ruixia Wang. A sufficient condition for a balanced bipartite digraph to be hamiltonian
0 -- 0Dmitry N. Kozlov. Witness structures and immediate snapshot complexes
0 -- 0Andrea Jiménez, Yoshiko Wakabayashi. On path-cycle decompositions of triangle-free graphs
0 -- 0Colin Defant. Binary Codes and Period-2 Orbits of Sequential Dynamical Systems
0 -- 0Jonathan Chappelon. Periodic balanced binary triangles
0 -- 0Stéphane Devismes, David Ilcinkas, Colette Johnen. Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps
0 -- 0Sherry H. F. Yan, Robin D. P. Zhou. Refined Enumeration of Corners in Tree-like Tableaux
0 -- 0Jan Kyncl, Bernard Lidický, Tomás Vyskocil. Irreversible 2-conversion set in graphs of bounded degree

Volume 19, Issue 2

0 -- 0Lisa Hofer. A Central Limit Theorem for Vincular Permutation Patterns
0 -- 0Megan A. Martinez, Manda Riehl. A bijection between the set of nesting-similarity classes and L & P matchings
0 -- 0Vít Jelínek, Michal Opler. Splittability and 1-amalgamability of permutation classes
0 -- 0Christopher Coscia, Jonathan DeWitt, Fan Yang, Yiguang Zhang. Best and worst case permutations for random online domination of the path
0 -- 0Murray Tannock, Henning Úlfarsson. Equivalence classes of mesh patterns with a dominating pattern
0 -- 0Ryan Alweiss. Asymptotic results on Klazar set partition avoidance
0 -- 0Jakub Sliacan, Walter Stromquist. Improving bounds on packing densities of 4-point permutations
0 -- 0Nicholas R. Beaton, Andrew R. Conway, Anthony J. Guttmann. On consecutive pattern-avoiding permutations of length 4, 5 and beyond
0 -- 0Samuel Miner, Douglas Rizzolo, Erik Slivken. Asymptotic distribution of fixed points of pattern-avoiding involutions

Volume 19, Issue 1

0 -- 0Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira. Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs
0 -- 0Didem Gözüpek, Ademir Hujdurovic, Martin Milanic. Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
0 -- 0Jeffrey B. Remmel, Sai-nan Zheng. Rises in forests of binary shrubs
0 -- 0Arman Boyaci, Tinaz Ekim, Mordechai Shalom, Shmuel Zaks. Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid
0 -- 0Susan A. van Aardt, Alewyn Petrus Burger, Marietjie Frick. The Existence of Planar Hypotraceable Oriented Graphs
0 -- 0Cyril Banderier, Michael Wallner. Lattice paths with catastrophes
0 -- 0David Callan, Toufik Mansour, Mark Shattuck. Wilf classification of triples of 4-letter patterns II
0 -- 0David Callan, Toufik Mansour, Mark Shattuck. Wilf classification of triples of 4-letter patterns I
0 -- 0Christoph Brause, Michael A. Henning, Marcin Krzywkowski. A characterization of trees with equal 2-domination and 2-independence numbers
0 -- 0Alessandra Cherubini, Achille Frigeri, Zuhua Liu. Composing short 3-compressing words on a 2-letter alphabet
0 -- 0John Campbell. A class of symmetric difference-closed sets related to commuting involutions
0 -- 0Chuanan Wei, Xiaoxia Wang. Evaluations of series of the $q$-Watson, $q$-Dixon, and $q$-Whipple type
0 -- 0Julien Bensmail, Mohammed Senhaji, Kasper Szabo Lyngsie. On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture
0 -- 0Behrouz Zolfaghari, Mehran S. Fallah, Mehdi Sedighi. S-Restricted Compositions Revisited
0 -- 0Yasir Ali, Asma Javaid. Pairwise Stability in Two Sided Market with Strictly Increasing Valuation Functions
0 -- 0André Kündgen, Tonya Talbot. Nonrepetitive edge-colorings of trees
0 -- 0Jean Cardinal, Jean-Paul Doignon, Keno Merckx. On the shelling antimatroids of split graphs
0 -- 0Colin Defant. Postorder Preimages
0 -- 0Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani. A New Game Invariant of Graphs: the Game Distinguishing Number
0 -- 0Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic. On rank-width of even-hole-free graphs
0 -- 0Silvia Businger. Asymptotics of the occupancy scheme in a random environment and its applications to tries
0 -- 0Wlodzimierz Moczurad. Decidability of multiset, set and numerically decipherable directed figure codes
0 -- 0HuiHui Zhang, Jing Chen, Shuchao Li. The quotients between the (revised) Szeged index and Wiener index of graphs
0 -- 0Jessica Enright, Lorna Stewart. Equivalence of the filament and overlap graphs of subtrees of limited trees
0 -- 0Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Y. Sun. On universal partial words