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)
no. 2
Précédent
Suivant
Volume 20 (2018) no. 2
Sommaire
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