Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 236
Volume 236, February 2018
- Bimal Mandal, Bhupendra Singh, Sugata Gangopadhyay, Subhamoy Maitra, Vellaichamy Vetrivel
:
On non-existence of bent-negabent rotation symmetric Boolean functions. 1-6
- Abhijin Adiga, Jasine Babu, L. Sunil Chandran:
Sublinear approximation algorithms for boxicity and related problems. 7-22 - Toru Araki, Issei Yumoto:
On the secure domination numbers of maximal outerplanar graphs. 23-29 - Niranjan Balachandran, Sajith Padinhatteeri:
The list distinguishing number of Kneser graphs. 30-41 - Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
A faster parameterized algorithm for Pseudoforest Deletion. 42-56 - Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time. 57-65 - Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar:
On upper bounds for the independent transversal domination number. 66-72 - Clément Charpentier, Brice Effantin, Gabriela Paris:
On the game coloring index of -decomposable graphs. 73-83 - Shuya Chiba, Nicolas Lichiardopol:
On the existence of vertex-disjoint subgraphs with high degree sum. 84-95 - Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk:
A hierarchical framework for recovery in compressive sensing. 96-107 - Jared Culbertson, Dan P. Guralnik, Peter F. Stiller:
Functorial hierarchical clustering with overlaps. 108-123 - Benoît Darties, Nicolas Gastineau, Olivier Togni:
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees. 124-136 - Johan P. de Wet, Marietjie Frick, Susan A. van Aardt:
Hamiltonicity of locally hamiltonian and locally traceable graphs. 137-152 - Pietra Delgado-Escalante, Hortensia Galeana-Sánchez, Eugenia O'Reilly Regueiro:
Alternating kernels. 153-164 - Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca:
Some forbidden combinations of branches in minimal-ABC trees. 165-182 - Henning Fernau, Juan A. Rodríguez-Velázquez:
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results. 183-202 - Michael Gentner, Dieter Rautenbach:
Some bounds on the zero forcing number of a graph. 203-213 - Martin Charles Golumbic, Gila Morgenstern, Deepak Rajendraprasad:
Edge-intersection graphs of boundary-generated paths in a grid. 214-222 - Alain Goupil, Marie-Eve Pellerin, Jérôme de Wouters d'oplinter:
Partially directed snake polyominoes. 223-234 - Michael A. Henning, William F. Klostermeyer, Gary MacGillivray:
Perfect Roman domination in trees. 235-245 - Michael A. Henning, Marcin Krzywkowski:
Total domination stability in graphs. 246-255 - Viktória E. Kaszanitzky, Bernd Schulze:
Characterizing minimally flat symmetric hypergraphs. 256-269 - Dorota Kuziak, María Luz Puertas, Juan A. Rodríguez-Velázquez, Ismael González Yero:
Strong resolving graphs: The realization and the characterization problems. 270-287 - Hui Lei, Henry Liu, Colton Magnant, Yongtang Shi:
Total rainbow connection of digraphs. 288-305 - Wen An Liu, Jing Jing Zhou:
Multi-player Small Nim with Passes. 306-314 - Mehar Ali Malik:
Two degree-distance based topological descriptors of some product graphs. 315-328 - A. D. Matushkin, Maksim E. Zhukovskii:
First order sentences about random graphs: Small number of alternations. 329-346 - Nathan D. Monnig, François G. Meyer:
The resistance perturbation distance: A metric for the analysis of dynamic networks. 347-386 - James B. Orlin, K. Subramani, Piotr Wojciechowski:
Randomized algorithms for finding the shortest negative cost cycle in networks. 387-394 - Ioannis Papoutsakis:
Tree spanners of bounded degree graphs. 395-407 - Abdelkader Rahmouni, Mustapha Chellali:
Independent Roman -domination in graphs. 408-414 - Erfang Shan, Yanxia Dong, Liying Kang, Shan Li:
Extremal hypergraphs for matching number and domination number. 415-421 - Vaidy Sivaraman:
Some problems on induced subgraphs. 422-427 - Lilla Tóthmérész:
Algorithmic aspects of rotor-routing and the notion of linear equivalence. 428-437 - Fan Wang, Heping Zhang:
Hamiltonian laceability in hypercubes with faulty edges. 438-445 - Xi-Ying Yuan, Liqun Qi, Jia-Yu Shao, Chen Ouyang:
Some properties and applications of odd-colorable -hypergraphs. 446-452
- Talha Amin, Mikhail Moshkov:
Totally optimal decision rules. 453-458 - Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei:
Terminal-pairability in complete bipartite graphs. 459-463 - Carl Feghali, Matthew Johnson, Daniel Thomas:
Erdős-Ko-Rado theorems for a family of trees. 464-471 - Mirko Hornák, Jakub Przybylo, Mariusz Wozniak:
A note on a directed version of the 1-2-3 Conjecture. 472-476
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 04:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
