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