default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 364
Volume 364, 2025
- Jean-Luc Baril, Sergey Kirgizov, José Luis Ramírez, Diego Villamizar:
The combinatorics of Motzkin polyominoes. 1-15 - Július Czap
, Stanislav Jendrol':
Facial matchings in plane graphs. 16-22 - Aniruddha Biswas, Palash Sarkar:
A lower bound on the constant in the Fourier min-entropy/influence conjecture. 23-32 - Hosein Salami, Mostafa Nouri Baygi:
Further acceleration in computing the gap greedy spanner: An empirical approach. 33-52 - Jinqiu Zhou, Yuefen Cao, Weigen Yan:
On saturated non-covered graphs. 53-59 - Liu Mei, Guo Chen, Qiuming Liu, Leng Ming:
The cyclic diagnosability of star graphs under the PMC and MM* models. 60-73 - Nina Klobas, Matjaz Krnc:
Distinguishing graphs via cycles. 74-98 - Arnab Char, T. Karthick:
χ-boundedness and related problems on graphs without long induced paths: A survey. 99-119 - Peter Frankl, Jian Wang:
On the maximum diversity of hypergraphs with fixed matching number. 120-135 - Jiangdong Ai, Qiming Dai, Qiwen Guo, Yingqi Hu, Changxin Wang:
A new perspective from hypertournaments to tournaments. 136-142 - Kaustav Paul, Ankit Sharma, Arti Pandey:
Exploring algorithmic solutions for the Independent Roman Domination problem in graphs. 143-152 - Xiaoling He, Fuliang Lu:
Thin edges in the subgraph induced by noncubic vertices of a brace. 153-156 - Sudong Ma, Chenhui Jin, Jie Guan, Ziyu Guan, Shuai Liu:
Fast computation of linear approximation of general word-oriented composite function. 157-172 - Khaled Elbassioni:
Dual bounded generation: Polynomial, second-order cone and positive semidefinite matrix inequalities. 173-188 - Tom Ashitha, Thangaraj Asir, Mohammad Reza Pournaki:
A class of graphs that complementation makes infinitely many Cohen-Macaulay members. 189-198 - Hugo Callebaut, Jérôme De Boeck, Bernard Fortz:
Leveraging duality for the gamma-robust segment routing traffic engineering problem. 199-212 - Yan-Jiao Liu, Jian-Hua Yin:
On the generalized Turán number of star forests. 213-221 - Sandip Das, Koushik Kumar Dey, Pavan P. D, Sagnik Sen:
Counting the minimum number of arcs in an oriented graph having weak diameter 2. 222-236 - Nengjin Zhuo, Shumin Zhang, Jou-Ming Chang, Chengfu Ye:
Non-inclusive diagnosability of folded hypercube-like networks. 237-246 - Cristina Bazgan, Pinar Heggernes, André Nichterlein, Thomas Pontoizeau:
On the hardness of problems around s-clubs on split graphs. 247-254
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 2026-08-11 00:23 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
