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 17 (2015-2016)
no. 1
Précédent
Suivant
Volume 17 (2015-2016) no. 1
Sommaire
A note on a recent attempt to improve the Pin-Frankl bound
Gonze, François
;
Jungers, Raphaël M.
;
Trahtman, Avraham N.
Output sensitive algorithms for covering many points
Ghasemalizadeh, Hossein
;
Razzazi, Mohammadreza
Parameterized complexity of synchronization and road coloring
Vorel, Vojtěch
;
Roman, Adam
Graphs with large disjunctive total domination number
Henning, Michael A.
;
Naicker, Viroshan
Extending a perfect matching to a Hamiltonian cycle
Alahmadi, Adel
;
Aldred, Robert E. L.
;
Alkenani, Ahmad
;
Hijazi, Rola
;
Solé, P.
;
Thomassen, Carsten
An efficient certificateless aggregate signature scheme for vehicular ad-hoc networks
Malhi, Avleen Kaur
;
Batra, Shalini
Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
Pelto, Mikko
On substitution tilings of the plane with n-fold rotational symmetry
Maloney, Gregory R.
How often should you clean your room?
Martin, Kimball
;
Shankar, Krishnan
Intervals and factors in the Bruhat order
Tenner, Bridget Eileen
Snarks with total chromatic number 5
Brinkmann, Gunnar
;
Preissmann, Myriam
;
Sasaki, Diana
On the Hausdorff measure of regular ω-languages in Cantor space
Staiger, Ludwig
A conjecture on the number of Hamiltonian cycles on thin grid cylinder graphs
Bodroža-Pantić, Olga
;
Kwong, Harris
;
Pantić, Milan
Cost-effectiveness of algorithms
Farr, Graham
Connectivity of Fibonacci cubes, Lucas cubes and generalized cubes
Azarija, Jernej
;
Klavžar, Sandi
;
Lee, Jaehun
;
Rho, Yoomi
Classification of skew translation generalized quadrangles, I
Thas, Koen
On the 1-2-3-conjecture
Davoodi, Akbar
;
Omoomi, Behnaz
An approximability-related parameter on graphs―-properties and applications
Engström, Robert
;
Färnqvist, Tommy
;
Jonsson, Peter
;
Thapper, Johan
Symmetric bipartite graphs and graphs with loops
Cairns, Grant
;
Mendan, Stacey
Edge stability in secure graph domination
Burger, Anton Pierre
;
Villiers, Alewyn Petrus
;
Vuuren, Jan Harm
p-box: a new graph model
Soto, Mauricio
;
Thraves-Caro, Christopher
On probe 2-clique graphs and probe diamond-free graphs
Bonomo, Flavia
;
Figueiredo, Celina M. H.
;
Duran, Guillermo
;
Grippo, Luciano N.
;
Safe, Martín D.
;
Szwarcfiter, Jayme L.
Guarded subgraphs and the domination game
Brešar, Boštjan
;
Klavžar, Sandi
;
Košmrlj, Gasper
;
Rall, Doug F.
Avoider-enforcer star games
Grzesik, Andrzej
;
Mikalački, Mirjana
;
Nagy, Zoltán Lóránt
;
Naor, Alon
;
Patkós, Balázs
;
Skerman, Fiona
Bootstrapping and double-exponential limit laws
Prodinger, Helmut
;
Wagner, Stephan
A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
Cabello, Sergio
;
Saumell, Maria
Ore-degree threshold for the square of a Hamiltonian cycle
DeBiasio, Louis
;
Faizullah, Safi
;
Khan, Imdadullah