default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics & Theoretical Computer Science, Volume 19
Volume 19, Number 1, 2017
- Christoph Brause, Michael A. Henning, Marcin Krzywkowski:
A characterization of trees with equal 2-domination and 2-independence numbers. - Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani:
A New Game Invariant of Graphs: the Game Distinguishing Number. - Colin Defant:
Postorder Preimages. - Susan A. van Aardt, Alewyn Petrus Burger, Marietjie Frick:
The Existence of Planar Hypotraceable Oriented Graphs. - David Callan, Toufik Mansour, Mark Shattuck:
Wilf classification of triples of 4-letter patterns I. - David Callan, Toufik Mansour, Mark Shattuck:
Wilf classification of triples of 4-letter patterns II. - Jean Cardinal, Jean-Paul Doignon, Keno Merckx:
On the shelling antimatroids of split graphs. - John Campbell:
A class of symmetric difference-closed sets related to commuting involutions. - Behrouz Zolfaghari, Mehran S. Fallah, Mehdi Sedighi:
S-Restricted Compositions Revisited. - Yasir Ali, Asma Javaid:
Pairwise Stability in Two Sided Market with Strictly Increasing Valuation Functions. - Wlodzimierz Moczurad:
Decidability of multiset, set and numerically decipherable directed figure codes. - Huihui Zhang, Jing Chen, Shuchao Li:
The quotients between the (revised) Szeged index and Wiener index of graphs. - Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira:
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. - Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Yi Sun:
On universal partial words. - Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. - Alessandra Cherubini, Achille Frigeri, Zuhua Liu:
Composing short 3-compressing words on a 2-letter alphabet. - André Kündgen
, Tonya Talbot:
Nonrepetitive edge-colorings of trees. - Chuanan Wei, Xiaoxia Wang:
Evaluations of series of the q-Watson, q-Dixon, and q-Whipple type. - Jessica A. Enright, Lorna Stewart:
Equivalence of the filament and overlap graphs of subtrees of limited trees. - Jeffrey B. Remmel, Sai-Nan Zheng:
Rises in forests of binary shrubs. - Silvia Businger:
Asymptotics of the occupancy scheme in a random environment and its applications to tries. - Julien Bensmail, Mohammed Senhaji, Kasper Szabo Lyngsie:
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture. - Cyril Banderier, Michael Wallner:
Lattice paths with catastrophes. - Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
On rank-width of even-hole-free graphs. - Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs.
Volume 19, Number 2, 2017
- Megan A. Martinez, Manda Riehl:
A bijection between the set of nesting-similarity classes and L & P matchings. - Christopher Coscia, Jonathan DeWitt, Fan Yang, Yiguang Zhang:
Best and worst case permutations for random online domination of the path. - Jakub Sliacan, Walter Stromquist:
Improving bounds on packing densities of 4-point permutations. - Vít Jelínek, Michal Opler:
Splittability and 1-amalgamability of permutation classes. - Samuel Miner, Douglas Rizzolo, Erik Slivken:
Asymptotic distribution of fixed points of pattern-avoiding involutions. - Murray Tannock, Henning Úlfarsson:
Equivalence classes of mesh patterns with a dominating pattern. - Ryan Alweiss:
Asymptotic results on Klazar set partition avoidance. - Nicholas R. Beaton, Andrew R. Conway, Anthony J. Guttmann:
On consecutive pattern-avoiding permutations of length 4, 5 and beyond. - Lisa Hofer:
A Central Limit Theorem for Vincular Permutation Patterns.
Volume 19, Number 3, 2017
- Matthieu Josuat-Vergès:
Stammering tableaux. - Silvio Capobianco, Jarkko Kari, Siamak Taati:
Post-surjectivity and balancedness of cellular automata over groups. - Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz:
Inkdots as advice for finite automata. - Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski:
Tight Euler tours in uniform hypergraphs - computational aspects. - Jan Kyncl, Bernard Lidický, Tomás Vyskocil:
Irreversible 2-conversion set in graphs of bounded degree. - Sherry H. F. Yan, Robin D. P. Zhou:
Refined Enumeration of Corners in Tree-like Tableaux. - Lingjuan Shi, Heping Zhang:
Tight upper bound on the maximum anti-forcing numbers of graphs. - Colin Defant:
Binary Codes and Period-2 Orbits of Sequential Dynamical Systems. - Andrea Jiménez, Yoshiko Wakabayashi:
On path-cycle decompositions of triangle-free graphs. - Arpitha P. Bharathi, Minati De, Abhiruk Lahiri:
Circular Separation Dimension of a Subclass of Planar Graphs. - Ruixia Wang:
A sufficient condition for a balanced bipartite digraph to be hamiltonian. - Dmitry N. Kozlov:
Witness structures and immediate snapshot complexes. - Jonathan Chappelon:
Periodic balanced binary triangles. - Stéphane Devismes, David Ilcinkas, Colette Johnen:
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. - Robert A. Proctor, Matthew J. Willis:
Parabolic Catalan numbers count flagged Schur functions and their appearances as type A Demazure characters (key polynomials). - Hao Lin, Xiumei Wang:
Three matching intersection property for matching covered graphs. - Alexis Cornet, Christian Laforest:
Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts.
Volume 19, Number 4, 2017
- Marius Dumitran, Pawel Gawrychowski, Florin Manea:
Longest Gapped Repeats and Palindromes. - Philippe Moser, Frank Stephan:
Depth, Highness and DNR degrees. - Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche:
A Characterization for Decidable Separability by Piecewise Testable Languages. - Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant:
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-19 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
