- Nathan D. Monnig, François G. Meyer
:
The resistance perturbation distance: A metric for the analysis of dynamic networks. Discret. Appl. Math. 236: 347-386 (2018) - James B. Orlin, K. Subramani, Piotr Wojciechowski:
Randomized algorithms for finding the shortest negative cost cycle in networks. Discret. Appl. Math. 236: 387-394 (2018) - Ioannis Papoutsakis:
Tree spanners of bounded degree graphs. Discret. Appl. Math. 236: 395-407 (2018) - Abdelkader Rahmouni, Mustapha Chellali:
Independent Roman -domination in graphs. Discret. Appl. Math. 236: 408-414 (2018) - Erfang Shan, Yanxia Dong, Liying Kang, Shan Li:
Extremal hypergraphs for matching number and domination number. Discret. Appl. Math. 236: 415-421 (2018) - Vaidy Sivaraman:
Some problems on induced subgraphs. Discret. Appl. Math. 236: 422-427 (2018) - Lilla Tóthmérész:
Algorithmic aspects of rotor-routing and the notion of linear equivalence. Discret. Appl. Math. 236: 428-437 (2018) - Fan Wang, Heping Zhang:
Hamiltonian laceability in hypercubes with faulty edges. Discret. Appl. Math. 236: 438-445 (2018) - Johan P. de Wet, Marietjie Frick, Susan A. van Aardt:
Hamiltonicity of locally hamiltonian and locally traceable graphs. Discret. Appl. Math. 236: 137-152 (2018) - Xi-Ying Yuan, Liqun Qi, Jia-Yu Shao, Chen Ouyang:
Some properties and applications of odd-colorable -hypergraphs. Discret. Appl. Math. 236: 446-452 (2018)
