default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 289
Volume 289, January 2021
- Phuc D. Tran
, Nguyen Van The:
Some sum-product type estimates for two-variables over prime fields. 1-11
- Stasys Jukna, Hannes Seiwert:
Tropical Kirchhoff's formula and postoptimality in matroid optimization. 12-21
- Liya Yang, Xiwen Lu:
Approximation algorithms for some position-dependent scheduling problems. 22-31 - Julien Bensmail, Bi Li, Binlong Li, Nicolas Nisse:
On minimizing the maximum color for the 1-2-3 Conjecture. 32-51
- Haiyan Li, Sanyang Liu:
Extensions of the combinatorial game (K, t)-Wythoff. 52-63
- Jung-Heum Park:
Torus-like graphs and their paired many-to-many disjoint path covers. 64-77 - Justo Puerto, Federica Ricca, Andrea Scozzari:
Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem. 78-92 - Odile Favaron, Pawaton Kaemawichanurat:
Inequalities between the Kk-isolation number and the independent Kk-isolation number of a graph. 93-97 - Yipeng Li, Xiaogang Liu, Shenggui Zhang, Sanming Zhou:
Perfect state transfer in NEPS of complete graphs. 98-114 - Florian Hoersch, Zoltán Szigeti:
Eulerian orientations and vertex-connectivity. 115-124 - Liqiong Xu, Shuming Zhou, Jiafei Liu, Shanshan Yin:
Reliability measure of multiprocessor system based on enhanced hypercubes. 125-138 - Huiqiu Lin, Yuke Zhang:
Extremal problems on distance spectra of graphs. 139-147 - Nader Jafari Rad:
Upper bounds on the global offensive alliances in graphs. 148-152 - Andrew J. Goodall, Bart Litjens, Guus Regts, Lluís Vena:
Tutte's dichromate for signed graphs. 153-184 - Julián Fresán-Figueroa, Diego González-Moreno, Mika Olsen:
On the packing chromatic number of Moore graphs. 185-193 - Shu-Li Zhao, Rong-Xia Hao, Jie Wu:
The generalized 4-connectivity of hierarchical cubic networks. 194-206 - Christine T. Cheng, Matthew E. H. Petering, Yong Wu:
The Multi-Spreader Crane Scheduling Problem: Partitions and supersequences. 207-218 - Martijn van Ee:
Approximability of the dispersed p→-neighbor k-supplier problem. 219-229
- Therese Biedl:
A note on 1-planar graphs with minimum degree 7. 230-232
- Rocío M. Casablanca, Lucas Mol, Ortrud R. Oellermann:
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs. 233-247 - Kazumasa Shinagawa, Koji Nuida:
A single shuffle is enough for secure card-based computation of any Boolean circuit. 248-261 - Ervin Györi, Addisu Paulos, Chuanqi Xiao:
Wiener index of quadrangulation graphs. 262-269 - Rebekah Herrman, Peter van Hintum:
The (t, r) broadcast domination number of some regular graphs. 270-280 - Ramin Javadi, Saleh Ashkboos:
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers. 281-291 - Li-Dan Pei, Xiangfeng Pan, Kun Wang, Jing Tian:
Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity. 292-301 - Yun Wang, Jin Yan:
Packing a number of copies of a (p, q)-graph. 302-312 - Hui Gao, Daqing Yang:
Packing of maximal independent mixed arborescences. 313-319 - Bostjan Bresar, Marko Jakovac, Dasa Stesl:
Indicated coloring game on Cartesian products of graphs. 320-326 - István Miklós, Geneva Schlafly, Yuheng Wang, Zhangyang Wei:
Edge disjoint caterpillar realizations. 327-344 - Sadmir Kudin, Enes Pasalic:
Proving the conjecture of O'Donnell in certain cases and disproving its general validity. 345-353 - Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen:
On rectangle intersection graphs with stab number at most two. 354-365 - Chang-Chun Lin, Yen-I Chiang:
Alternative formulations for the obnoxious p-median problem. 366-373 - Simone Costa, Marco Dalai:
New bounds for perfect k-hashing. 374-382 - Kexiang Xu, Sandi Klavzar:
Constructing new families of transmission irregular graphs. 383-391 - Martin Zeiner, Ulrich Schmid, Krishnendu Chatterjee:
Optimal strategies for selecting coordinators. 392-415 - Somayeh Jahari, Saeid Alikhani:
On the independent domination polynomial of a graph. 416-426 - Marcel Milich, Torsten Mütze, Martin Pergel:
On flips in planar matchings. 427-445 - Bjørn Kjos-Hanssen:
Automatic complexity of Fibonacci and Tribonacci words. 446-454 - Ahmad Abdi, Gérard Cornuéjols:
The max-flow min-cut property and ±1-resistant sets. 455-476 - Xi Chen, Longjiang Qu, Shaojing Fu, Chao Li:
The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions. 477-491 - Kazuo Murota:
A note on M-convex functions on jump systems. 492-502 - Ferdinando Cicalese, Eduardo Sany Laber:
On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem. 503-515
- Gábor Wiener, Maho Yokota, Carol T. Zamfirescu:
Spiders everywhere. 516-522 - Samuel G. Corregidor, Álvaro Martínez-Pérez:
A note on k-metric dimensional graphs. 523-533 - Yaguang Yang:
A note on the diameter of convex polytope. 534-538 - Imed Zaguia:
Greedy balanced pairs in N-free ordered sets. 539-544 - Ali Keramatipour, Behnam Bahrak:
Zombie number of the Cartesian product of graphs. 545-549
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:05 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:
