default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 291
Volume 291, March 2021
- Dekel Tsur
:
An O∗(2.619k) algorithm for 4-Path Vertex Cover. 1-14 - Erel Segal-Halevi:
Fair multi-cake cutting. 15-35
- Longfei Fang, Mingqing Zhai, Bing Wang:
Complete subgraphs in connected graphs and its application to spectral moment. 36-42
- Lang Tang, Shenglin Zhou, Jing Chen, Zhilin Zhang:
Metric dimension and metric independence number of incidence graphs of symmetric designs. 43-50 - Antoine Dailly, Adriana Hansberg, Denae Ventura:
On the balanceability of some graph classes. 51-63 - Zequn Lv, Mei Lu:
The terminal-pairability problem in complete bipartite graphs. 64-67 - B. S. Panda, Priyamvada:
Injective coloring of some subclasses of bipartite graphs and chordal graphs. 68-87
- Noah A. Rosenberg:
On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees. 88-98
- Guillaume Bagan, Alice Joffard, Hamamache Kheddouci:
Eternal dominating sets on digraphs and orientations of graphs. 99-115 - Primoz Potocnik, Gabriel Verret, Stephen E. Wilson:
Base graph-connection graph: Dissection and construction. 116-128 - Chunqiu Fang, Ervin Györi, Mei Lu, Jimeng Xiao:
On the anti-Ramsey number of forests. 129-142 - Pu Gao, Catherine S. Greenhill:
Mixing time of the switch Markov chain and stable degree sequences. 143-162 - Zi-Xia Song, Donglei Yang, Fangfang Zhang:
Antimagic orientations of graphs with given independence number. 163-170 - Igor Fabrici, Mirko Hornák, Simona Rindosová:
Facial unique-maximum edge and total coloring of plane graphs. 171-179
- Jinping Fan, Hung-Lin Fu, Yujie Gu, Ying Miao, Maiko Shigeno:
Strongly separable matrices for nonadaptive combinatorial group testing. 180-187
- Daniela Gaul, Daniel R. Schmidt:
Chvátal-Gomory cuts for the Steiner tree problem. 188-200 - Guillaume Ducoffe, Alexandru Popa:
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes. 201-222 - Jesmmer Alves, Diane Castonguay, Thomas Brüstle:
Unit form recognition by mutations: Application of mutations in the search of positive roots. 223-236 - Ho-Won Choi, Hyoungjun Kim, Sungjong No:
The minor minimal intrinsically chiral graphs. 237-245 - Reaz Huq, Bogumil Kaminski, Atefeh Mashatan, Pawel Pralat, Przemyslaw Szufel:
On broadcasting time in the model of travelling agents. 246-263 - Fei-Huang Chang, Ma-Lian Chia, Shih-Ang Jiang, David Kuo, Sheng-Chyang Liaw:
L(p, q)-labelings of subdivisions of graphs. 264-270
- Han Xiao, Yuanxi Wang, Qizhi Fang:
On the convexity of independent set games. 271-276
- Michele Barbato, Dario Bezzi:
Monopolar graphs: Complexity of computing classical graph parameters. 277-285 - R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale:
Parameterized and exact algorithms for class domination coloring. 286-299
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 2025-09-26 23:41 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:
