default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics & Theoretical Computer Science, Volume 23
Volume 23, Number 1, 2021
- Alex McDonough:
Determining Genus From Sandpile Torsor Algorithms. - Patryk Mikos:
Efficient enumeration of non-isomorphic interval graphs. - Éva Czabarka
, Peter Dankelmann, Trevor Olsen, László A. Székely:
Wiener Index and Remoteness in Triangulations and Quadrangulations. - Julien Bensmail, Foivos Fioravantes:
On BMRN*-colouring of planar digraphs. - Marisa R. Gaetz:
Anti-power j-fixes of the Thue-Morse word. - Christopher Duffy, Sonja Linghui Shan:
On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets. - Travis Dillon, Attila Sali:
Exponential multivalued forbidden configurations. - Robert A. Proctor, Matthew J. Willis:
Row bounds needed to justifiably express flagged Schur functions with Gessel-Viennot determinants. - Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
New Algorithms for Mixed Dominating Set. - Thomas Kahl:
Weak equivalence of higher-dimensional automata. - Peter Dankelmann, Alex Alochukwu:
Wiener index in graphs with given minimum degree and maximum degree. - Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler:
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees. - Darij Grinberg:
The Elser nuclei sum revisited. - Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer:
Destroying Bicolored P3s by Deleting Few Edges. - Xiao Zhao, Sheng Chen:
A note on tight cuts in matching-covered graphs. - Zoltán Fülöp, Dávid Kószó, Heiko Vogler:
Crisp-determinization of weighted tree automata over strong bimonoids. - Michael A. Henning, Arti Pandey, Vikash Tripathi:
Semipaired Domination in Some Subclasses of Chordal Graphs. - Michael Joseph, Tom Roby:
A birational lifting of the Stanley-Thomas word on products of two chains. - Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot:
On the density of sets of the Euclidean plane avoiding distance 1.
Volume 23, Number 2, 2021
Special Issue in Honour of Maurice Pouzet
- André Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
The algebra of binary trees is affine complete. - Endre Tóth, Tamás Waldhauser:
Polymorphism-homogeneity and universal algebraic geometry. - Maurice Pouzet, Imed Zaguia:
Graphs containing finite induced paths of unbounded length. - Manuel Bodirsky, Jakub Rydval, André Schrottenloher:
Universal Horn Sentences and the Joint Embedding Property. - Maurice Pouzet, Hamza Si Kaddour, Bhalchandra D. Thatte:
On the Boolean dimension of a graph and other related parameters. - Bruno Courcelle:
Induced betweenness in order-theoretic trees. - Hanna Furmanczyk, Vahan Mkrtchyan:
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs. - Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet:
On the inversion number of oriented graphs.
Volume 23, Number 3, 2021
- Ke Liu, Mei Lu:
The treewidth of 2-section of hypergraphs. - Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow, Shakhar Smorodinsky:
On the VC-dimension of half-spaces with respect to convex sets. - Aleksander Kelenc:
Determining the Hausdorff Distance Between Trees in Polynomial Time. - Yan Li, Xin Zhang:
The structure and the list 3-dynamic coloring of outer-1-planar graphs. - Zhanar Berikkyzy, Axel Brandt, Sogol Jahanbekam, Victor Larsen, Danny Rorabaugh:
List-antimagic labeling of vertex-weighted graphs. - Jorge Almeida, Ondrej Klíma:
Binary patterns in the Prouhet-Thue-Morse sequence. - Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
A tight lower bound for the online bounded space hypercube bin packing problem. - Ruixia Wang, Linxin Wu, Wei Meng:
Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs. - Laurent Feuilloley:
Introduction to local certification. - Stijn Cambie:
Five results on maximizing topological indices in graphs. - Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Fast Diameter Computation within Split Graphs. - Yuan Li, Frank Ingram, Huaming Zhang:
Certificate complexity and symmetry of nested canalizing functions. - Gunnar Brinkmann, Thomas W. Tucker, Nico Van Cleemput:
On the genera of polyhedral embeddings of cubic graph. - Swapnil Garg:
Antipowers in Uniform Morphic Words and the Fibonacci Word. - Dániel Gerbner, Máté Vizer:
On non-adaptive majority problems of large query size. - Michael D. Barrus, Jean A. Guillaume:
Upward-closed hereditary families in the dominance order. - Hadi Alizadeh, Didem Gözüpek:
Upper paired domination versus upper domination.
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-09-21 01:47 CEST 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:
