Login / Signup
Discret. Math. Theor. Comput. Sci.
1997
2007
2012
2023
1997
2023
Keyphrases
Publications
volume 25, 2023
Sylwia Cichacz
,
Karol Suchan
Zero-sum partitions of Abelian groups of order $2^n$.
Discret. Math. Theor. Comput. Sci.
25 (2023)
Ruben Ascoli
,
Livia Betti
,
Jacob Lehmann Duke
,
Xuyan Liu
,
Wyatt Milgrim
,
Steven J. Miller
,
Eyvindur A. Palsson
,
Francisco Romero Acosta
,
Santiago Velazquez Iannuzzelli
Distinct Angles and Angle Chains in Three Dimensions.
Discret. Math. Theor. Comput. Sci.
25 (2023)
Lélia Blin
,
Laurent Feuilloley
,
Gabriel Le Bouder
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms.
Discret. Math. Theor. Comput. Sci.
25 (2023)
Juan Carlos García-Altamirano
,
Mika Olsen
,
Jorge Cervantes-Ojeda
How to construct the symmetric cycle of length 5 using Hajós construction with an adapted Rank Genetic Algorithm.
Discret. Math. Theor. Comput. Sci.
25 (2023)
Nils Jakob Eckstein
,
Niels Grüttemeier
,
Christian Komusiewicz
,
Frank Sommer
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs.
Discret. Math. Theor. Comput. Sci.
25 (2023)
Rémy Belmonte
,
Tesshu Hanaka
,
Ioannis Katsikarelis
,
Eun Jung Kim
,
Michael Lampis
New Results on Directed Edge Dominating Set.
Discret. Math. Theor. Comput. Sci.
25 (2023)
Gerold Jäger
,
Klas Markström
,
Denys Shcherbak
,
Lars-Daniel Öhman
Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs.
Discret. Math. Theor. Comput. Sci.
25 (2023)
Iztok Banic
,
Andrej Taranenko
Span of a Graph: Keeping the Safety Distance.
Discret. Math. Theor. Comput. Sci.
25 (2023)
volume 24, number 1, 2022
Andrei Asinowski
,
Benjamin Hackl
,
Sarah J. Selkirk
Down-step statistics in generalized Dyck paths.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Helena Bergold
,
Winfried Hochstättler
,
Uwe Mayer
The Neighborhood Polynomial of Chordal Graphs.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Jesse Racicot
,
Giovanni Rosso
Domination in Knödel Graphs.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Michel Rigo
,
Manon Stipulanti
Automatic sequences: from rational bases to trees.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Isolde Adler
,
Noleen Köhler
An explicit construction of graphs of bounded degree that are far from being Hamiltonian.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Julien Baste
,
Stefan Ehard
,
Dieter Rautenbach
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Ruy Fabila Monroy
,
Jesús Leaños
,
Ana Laura Trujillo-Negrete
On the Connectivity of Token Graphs of Trees.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Nicolas Ollinger
,
Guillaume Theyssier
Freezing, Bounded-Change and Convergent Cellular Automata.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Jesús Leaños
,
Christophe Ndjatchi
,
Luis Manuel Ríos-Castro
On the connectivity of the disjointness graph of segments of point sets in general position in the plane.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Wenjie Fang
Efficient recurrence for the enumeration of permutations with fixed pinnacle set.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Lukasz Bozyk
,
Michal Pilipczuk
On the Erdős-Pósa property for immersions and topological minors in tournaments.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Meike Hatzel
,
Pawel Komosa
,
Marcin Pilipczuk
,
Manuel Sorge
Constant Congestion Brambles.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Angsuman Das
,
Hiranya Kishore Dey
Determining Number of Kneser Graphs: Exact Values and Improved Bounds.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Toufik Mansour
,
Mark Shattuck
Further enumeration results concerning a recent equivalence of restricted inversion sequences.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Anna M. Brandenberger
,
Luc Devroye
,
Marcel K. Goh
,
Rosie Zhao
Leaf multiplicity in a Bienaymé-Galton-Watson tree.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Sittipong Thamrongpairoj
,
Jeffrey B. Remmel
Positional Marked Patterns in Permutations.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Jovana Forcan
,
Mirjana Mikalacki
Maker-Breaker total domination game on cubic graphs.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Daniel Birmajer
,
Juan B. Gil
,
David S. Kenepp
,
Michael D. Weiner
Restricted generating trees for weak orderings.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Sulin Song
,
Lan Lei
,
Yehong Shao
,
Hong-Jian Lai
Asymptotically sharpening the $s$-Hamiltonian index bound.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Prosenjit Bose
,
Vida Dujmovic
,
Mehrnoosh Javarsineh
,
Pat Morin
,
David R. Wood
Separating layered treewidth and row treewidth.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Marthe Bonamy
,
Lukasz Bozyk
,
Andrzej Grzesik
,
Meike Hatzel
,
Tomás Masarík
,
Jana Novotná
,
Karolina Okrasa
Tuza's Conjecture for Threshold Graphs.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Márcia R. Cappelle
,
Erika M. M. Coelho
,
Les R. Foulds
,
Humberto J. Longo
Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
Kenjiro Takazawa
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs.
Discret. Math. Theor. Comput. Sci.
24 (1) (2022)
volume 24, number 2, 2022
Luciano Margara
A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum.
Discret. Math. Theor. Comput. Sci.
24 (2) (2022)
Paul Levrie
,
John Campbell
Series acceleration formulas obtained from experimentally discovered hypergeometric recursions.
Discret. Math. Theor. Comput. Sci.
24 (2) (2022)
Yen Hung Chen
Approximability results for the $p$-centdian and the converse centdian problems.
Discret. Math. Theor. Comput. Sci.
24 (2) (2022)
Manuel Lafond
,
Ben Seamone
,
Rezvan Sherkati
Further results on Hendry's Conjecture.
Discret. Math. Theor. Comput. Sci.
24 (2) (2022)
Ahmad Biniaz
,
Kshitij Jain
,
Anna Lubiw
,
Zuzana Masárová
,
Tillmann Miltzow
,
Debajyoti Mondal
,
Anurag Murty Naredla
,
Josef Tkadlec
,
Alexi Turcotte
Token Swapping on Trees.
Discret. Math. Theor. Comput. Sci.
24 (2) (2022)
Richard C. Brewster
,
Arnott Kidner
,
Gary MacGillivray
The 2-colouring problem for $(m, n)$-mixed graphs with switching is polynomial.
Discret. Math. Theor. Comput. Sci.
24 (2) (2022)
Khaled M. Elbassioni
On Dualization over Distributive Lattices.
Discret. Math. Theor. Comput. Sci.
24 (2) (2022)
Mitre Costa Dourado
,
Vitor S. Ponciano
,
Rômulo L. O. da Silva
On the monophonic rank of a graph.
Discret. Math. Theor. Comput. Sci.
24 (2) (2022)
Marc Distel
,
Robert Hickingbotham
,
Tony Huynh
,
David R. Wood
Improved product structure for graphs on surfaces.
Discret. Math. Theor. Comput. Sci.
24 (2) (2022)
Tiziana Calamoneri
,
Angelo Monti
,
Blerina Sinaimeri
On the domination number of $t$-constrained de Bruijn graphs.
Discret. Math. Theor. Comput. Sci.
24 (2) (2022)
Peter Dankelmann
,
Sonwabile Mafunda
,
Sufiyan Mallu
Proximity, remoteness and maximum degree in graphs.
Discret. Math. Theor. Comput. Sci.
24 (2) (2022)
volume 24, 2022
Rémy Belmonte
,
Michael Lampis
,
Valia Mitsou
Defective Coloring on Classes of Perfect Graphs.
Discret. Math. Theor. Comput. Sci.
24 (2022)
volume 23, number 3, 2021
Ke Liu
,
Mei Lu
The treewidth of 2-section of hypergraphs.
Discret. Math. Theor. Comput. Sci.
23 (3) (2021)
Yuan Li
,
Frank Ingram
,
Huaming Zhang
Certificate complexity and symmetry of nested canalizing functions.
Discret. Math. Theor. Comput. Sci.
23 (3) (2021)
Yan Li
,
Xin Zhang
The structure and the list 3-dynamic coloring of outer-1-planar graphs.
Discret. Math. Theor. Comput. Sci.
23 (3) (2021)
Guillaume Ducoffe
,
Michel Habib
,
Laurent Viennot
Fast Diameter Computation within Split Graphs.
Discret. Math. Theor. Comput. Sci.
23 (3) (2021)
Stijn Cambie
Five results on maximizing topological indices in graphs.
Discret. Math. Theor. Comput. Sci.
23 (3) (2021)
Dániel Gerbner
,
Máté Vizer
On non-adaptive majority problems of large query size.
Discret. Math. Theor. Comput. Sci.
23 (3) (2021)
Yoshiharu Kohayakawa
,
Flávio Keidi Miyazawa
,
Yoshiko Wakabayashi
A tight lower bound for the online bounded space hypercube bin packing problem.
Discret. Math. Theor. Comput. Sci.
23 (3) (2021)