default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 220
Volume 220, March 2017
- Srikumar Ramalingam
, Chris Russell, Lubor Ladicky, Philip H. S. Torr:
Efficient minimization of higher order submodular functions using monotonic Boolean functions. 1-19
- Eric Ould Dadah Andriantiana, Stephan G. Wagner, Hua Wang:
Extremal problems for trees with given segment sequence. 20-34 - Agnese Baldisserri, Elena Rubei:
A characterization of dissimilarity families of trees. 35-45 - Zhen Cui, Ze-Chun Hu:
On variants of conflict-free-coloring for hypergraphs. 46-54 - Che-Nan Kuo, Yu-Huei Cheng:
Cycles embedding in folded hypercubes with conditionally faulty vertices. 55-59 - Shangwei Lin, Qianhua Zhang:
The generalized 4-connectivity of hypercubes. 60-67 - Gaia Moravcik, Ortrud R. Oellermann, Samuel Yusim:
Comparing the metric and strong dimensions of graphs. 68-79 - Christina M. Mynhardt, Adriana Roux:
Dominating and irredundant broadcasts in graphs. 80-90 - Richard B. Tan, Erik Jan van Leeuwen, Jan van Leeuwen:
Shortcutting directed and undirected networks with a degree constraint. 91-117 - Xiaoguo Tian, Ligong Wang:
The trees with the second smallest normalized Laplacian eigenvalue at least. 118-133 - René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-parameter algorithms for DAG Partitioning. 134-160 - Yuxing Yang, Jing Li, Shiying Wang:
Embedding various cycles with prescribed paths into k-ary n-cubes. 161-169
- Qing Cui, Qiuping Qian, Lingping Zhong:
The maximum atom-bond connectivity index for graphs with edge-connectivity one. 170-173
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-12-13 19:02 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:
