default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 204
Volume 204, May 2016
- Vladimir E. Alekseev
, Dmitry B. Mokeev:
König graphs for 3-paths and 3-cycles. 1-5
- Asghar Asgharian-Sardroud, Alireza Bagheri:
An approximation algorithm for the longest cycle problem in solid grid graphs. 6-12 - Boris Brimkov, Illya V. Hicks:
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs. 13-21 - Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
Roman {2}-domination. 22-28 - Jihoon Choi, Kyeong Seok Kim, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
On the competition graphs of d-partial orders. 29-37 - Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Polynomial-time approximation algorithms for weighted LCS problem. 38-48 - Mateus de Oliveira Oliveira:
An algorithmic metatheorem for directed treewidth. 49-76 - Marc Demange, Tínaz Ekim, Bernard Ries:
On the minimum and maximum selective graph coloring problems in some graph classes. 77-89 - Darko Dimitrov:
On structural properties of trees with minimal atom-bond connectivity index II: Bounds on B1- and B2-branches. 90-116 - Phillip M. Duxbury, L. Granlund, S. R. Gujarathi, Pavol Juhas, Simon J. L. Billinge:
The unassigned distance geometry problem. 117-132 - Janusz Dybizbanski, Tomasz Dzido, Stanislaw P. Radziszowski:
On some three-color Ramsey numbers for paths. 133-141 - Kim A. S. Factor, Larry J. Langley:
Kings and Heirs: A characterization of the (2, 2)-domination graphs of tournaments. 142-149 - Cheng He, Joseph Y.-T. Leung, Kangbok Lee, Michael L. Pinedo:
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost. 150-163 - Raed Jaberi:
On computing the 2-vertex-connected components of directed graphs. 164-172 - Ronald G. McGarvey, Brian Q. Rieksts, José A. Ventura, Namsu Ahn:
Binary linear programming models for robust broadcasting in communication networks. 173-184 - Yanwei Zhou, Bo Yang, Wenzheng Zhang:
Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing. 185-202
- Hassan AbouEisha, Igor Chikalov, Mikhail Moshkov:
Decision trees with minimum average depth for sorting eight elements. 203-207 - Ronald D. Hagan, Michael A. Langston, Kai Wang:
Lower bounds on paraclique density. 208-212 - Mauro Mezzini, Marina Moscarini:
The contour of a bridged graph is geodetic. 213-215 - Liqun Pu, Yajuan Cui:
Weak saturation number for multiple copies of the complete graph with a star removed. 216-220
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-10-31 20:16 CET 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:
