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 22 (2020-2021)
no. 4
Précédent
Suivant
Volume 22 (2020-2021) no. 4
Sommaire
A Type System Describing Unboundedness
Parys, Paweł
(Open) packing number of some graph products
Mojdeh, Doost Ali
;
Peterin, Iztok
;
Samadi, Babak
;
Yero, Ismael G.
Evacuating Robots from a Disk Using Face-to-Face Communication
Czyzowicz, Jurek
;
Georgiou, Konstantinos
;
Kranakis, Evangelos
;
Narayanan, Lata
;
Opatrny, Jarda
;
Vogtenhuber, Birgit
A B\"uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
Engelfriet, Joost
;
Vogler, Heiko
A Double Exponential Lower Bound for the Distinct Vectors Problem
Pilipczuk, Marcin
;
Sorge, Manuel
Taking-and-merging games as rewrite games
Duchêne, Eric
;
Marsault, Victor
;
Parreau, Aline
;
Rigo, Michel
Extension Complexity, MSO Logic, and Treewidth
Kolman, Petr
;
Koutecký, Martin
;
Tiwary, Hans Raj
Even cycles and perfect matchings in claw-free plane graphs
Zhang, Shanshan
;
Wang, Xiumei
;
Yuan, Jinjiang
Two lower bounds for
$p$
-centered colorings
Dubois, Loïc
;
Joret, Gwenaël
;
Perarnau, Guillem
;
Pilipczuk, Marcin
;
Pitois, François
The LexCycle on
$\overline{P_{2}\cup P_{3}}$
-free Cocomparability Graphs
Gao, Xiao-Lu
;
Xu, Shou-Jun
A Note on Graphs of Dichromatic Number 2
Steiner, Raphael
A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
Darbinyan, Samvel Kh.
The number of distinct adjacent pairs in geometrically distributed words
Archibald, Margaret
;
Blecher, Aubrey
;
Brennan, Charlotte
;
Knopfmacher, Arnold
;
Wagner, Stephan
;
Ward, Mark