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 20 (2018)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Monotone Simultaneous Paths Embeddings in
$\mathbb{R}^d$
Bremner, David
;
Devillers, Olivier
;
Glisse, Marc
;
Lazard, Sylvain
;
Liotta, Giuseppe
;
Mchedlidze, Tamara
;
Moroz, Guillaume
;
Whitesides, Sue
;
Wismath, Stephen
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II
Boyacı, Arman
;
Ekim, Tınaz
;
Shalom, Mordechai
;
Zaks, Shmuel
On Minimum Maximal Distance-k Matchings
Kartynnik, Yury
;
Ryzhikov, Andrew
Hitting minors, subdivisions, and immersions in tournaments
Raymond, Jean-Florent
A Variation on Chip-Firing: the diffusion game
Duffy, C.
;
Lidbetter, T. F.
;
Messinger, M. E.
;
Nowakowski, R. J.
Weak embeddings of posets to the Boolean lattice
Pálvölgyi, Dömötör
A Study of
$k$
-dipath Colourings of Oriented Graphs
Duffy, Christopher
;
MacGillivray, Gary
;
Sopena, Éric
Growing and Destroying Catalan-Stanley Trees
Hackl, Benjamin
;
Prodinger, Helmut
On subtrees of the representation tree in rational base numeration systems
Akiyama, Shigeki
;
Marsault, Victor
;
Sakarovitch, Jacques
Finding Hamilton cycles in random intersection graphs
Rybarczyk, Katarzyna
Non-adaptive Group Testing on Graphs
Kameli, Hamid
Protected node profile of Tries
Javanian, Mehri
On interval number in cycle convexity
Araujo , Julio
;
Ducoffe , Guillaume
;
Nisse , Nicolas
;
Suchan , Karol
A Linear Kernel for Planar Total Dominating Set
Garnero, Valentin
;
Sau, Ignasi
Rowmotion and generalized toggle groups
Striker, Jessica
Weakly threshold graphs
Barrus, Michael D.
Annular and pants thrackles
Misereh, Grace
;
Nikolayevsky, Yuri
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs
Keranen, Melissa
;
Lauri, Juho
Forbidden subgraphs for constant domination number
Furuya, Michitaka
On a Class of Graphs with Large Total Domination Number
Bahadır, Selim
;
Gözüpek, Didem
Proof of a local antimagic conjecture
Haslegrave, John
Permutation complexity of images of Sturmian words by marked morphisms
Borchert, Adam
;
Rampersad, Narad
On neighbour sum-distinguishing
$\{0,1\}$
-edge-weightings of bipartite graphs
Lyngsie, Kasper Szabo
A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum
Cloteaux, Brian
Group twin coloring of graphs
Cichacz, Sylwia
;
Przybyło, Jakub
Weighted Regular Tree Grammars with Storage
Fülöp, Zoltán
;
Herrmann, Luisa
;
Vogler, Heiko
Sommaire du
Fascicule no. 2
On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
Rajaati, M.
;
Hooshmandasl, M. R.
;
Dinneen, M. J.
;
Shakiba, A.
Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent
Highley, Timothy
;
Le, Hoang
Convexity of tableau sets for type A Demazure characters (key polynomials), parabolic Catalan numbers
Proctor, Robert A.
;
Willis, Matthew J.
Semitotal domination in trees
Wei, Zhuang
;
Guoliang, Hao
On locally irregular decompositions and the 1-2 Conjecture in digraphs
Baudon , Olivier
;
Bensmail , Julien
;
Przybyło , Jakub
;
Woźniak , Mariusz
Parameterized Power Vertex Cover
Angel, Eric
;
Bampis, Evripidis
;
Escoffier, Bruno
;
Lampis, Michael
Fast strategies in biased Maker--Breaker games
Mikalački, Mirjana
;
Stojaković, Miloš
Steiner Distance in Product Networks
Mao, Yaping
;
Cheng, Eddie
;
Wang, Zhao
Summation formulas for Fox-Wright function
Wei, Chuanan
;
Liu, Lily Li
;
Gong, Dianxuan
The 26 Wilf-equivalence classes of length five quasi-consecutive patterns
Chen, Evan
;
Narayanan, Shyam
General bounds on limited broadcast domination
Cáceres, José
;
Hernando, Carmen
;
Mora, Mercè
;
Pelayo, Ignacio M.
;
Puertas, María Luz
IMP with exceptions over decorated logic
Ekici , Burak
A Note on Flips in Diagonal Rectangulations
Cardinal, Jean
;
Sacristán, Vera
;
Silveira, Rodrigo I.
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs
Protti, Fábio
;
Souza, Uéverton S.
On Almost Well-Covered Graphs of Girth at Least 6
Ekim, Tınaz
;
Gözüpek, Didem
;
Hujdurović, Ademir
;
Milanič, Martin
Complexity of locally-injective homomorphisms to tournaments
Bard, Stefan
;
Bellitto, Thomas
;
Duffy, Christopher
;
MacGillivray, Gary
;
Yang, Feiran
Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments
Galeana-Sánchez, H.
;
Olsen, M.
Sigma Partitioning: Complexity and Random Graphs
Dehghan, Ali
;
Sadeghi, Mohammad-Reza
;
Ahadi, Arash
An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums
Büchel, Alexander
;
Gilleßen, Ulrich
;
Witt, Kurt-Ulrich