Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 343
Volume 343, January 2024
- Ioannis Mantas
, Marko Savic, Hendrik Schrezenmaier:
New variants of perfect non-crossing matchings. 1-14
- Liwen Zhang, Yuke Zhang:
Maximizing the degree powers of graphs with fixed size. 15-24 - Marc Hellmuth, Guillaume E. Scholz:
Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs. 25-43
- Abel Cabrera Martínez:
An improved upper bound on the domination number of a tree. 44-48
- José E. Calderón-Gómez, Luis A. Medina, Carlos A. Molina-Salazar:
Short k-rotation symmetric Boolean functions. 49-64 - Egor Lappo, Noah A. Rosenberg:
A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees. 65-81 - Wayne Goddard, Julia VanLandingham:
The fully weighted toughness of a graph. 82-90 - Alexandru Chirvasitu, Thomas W. Cusick:
Quadratic rotation symmetric Boolean functions. 91-105 - Hojin Chu, Suh-Ryung Kim:
Competition graphs of degree bounded digraphs. 106-114 - Jelena Sedlar, Riste Skrekovski:
Local Irregularity Conjecture vs. cacti. 115-133
- Yong-De Feng, Yan-Ting Xie, Shou-Jun Xu:
The extendability of Cayley graphs generated by transpositions. 134-139
- Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev:
Graphs with minimum fractional domatic number. 140-148 - Eshwar Srinivasan, Ramesh Hariharasubramanian:
Minimum length word-representants of word-representable graphs. 149-158
- Daniel Owusu Adu, Daniel Keliher:
Optimal transport for some symmetric, multidimensional integer partitions. 159-165
- Kirpa Garg, Sartaj Ul Hasan, Pantelimon Stanica:
Boomerang uniformity of some classes of functions over finite fields. 166-179 - Young-Soo Myung:
A polynomial time algorithm for the triangle packing problem on interval graphs. 180-183 - Yanfang Liang, Baoyindureng Wu:
On some conjectures on biclique graphs. 184-190
- Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena:
Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches. 191-207
- Pierre Miasnikof, Mohammad Bagherbeik, Ali Sheikholeslami:
Graph clustering with Boltzmann machines. 208-223
- Neethu P. K., S. V. Ullas Chandran, Julliano R. Nascimento:
On the monophonic convexity in complementary prisms. 224-230
- Amir Barghi, Daryl R. DeFord:
Ranking trees based on global centrality measures. 231-257 - Jianliang Wu, Xingqin Qi, Zhulou Cao:
H-sequences and 2-step coreness in graphs. 258-268 - Yuuho Tanaka:
On the average hitting times of Cay(ZN,{+1,+2}). 269-276 - Tomislav Doslic, László Németh, Luka Podrug:
Hosoya index of thorny polymers. 277-287 - Tianjiao Dai, Hao Li, Qiancheng Ouyang, Zeng-Xian Tian:
On (2,k)-Hamilton-connected graphs. 288-299 - Enide Andrade Martins, Eber Lenes, Pamela Pizarro, María Robbiano, Jonnathan Rodríguez:
On spectral invariants of the α-mixed adjacency matrix. 300-327 - Tai-Yu Su:
Minimum spanning tree cycle intersection problem on outerplanar graphs. 328-339 - Simon Brezovnik, Zhongyuan Che, Niko Tratnik, Petra Zigert Pletersek:
Outerplane bipartite graphs with isomorphic resonance graphs. 340-349
- Lkhagva Buyantogtokh, Batmend Horoldagva:
(n,m)-graphs with maximum exponential second Zagreb index. 350-354
- Marc Goerigk, Stefan Lendl, Lasse Wulf:
On the complexity of robust multi-stage problems with discrete recourse. 355-370
a service of 
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-04-26 18:29 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:
