Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 346
Volume 346, 2024
- Hui Ma, Xiaomin Hu, Weihua Yang:
The structure of minimally t-tough, 2K2-free graphs. 1-9 - Miguel A. D. R. Palma, Adriana J. León, Simone Dantas
:
On the AVDTC of Sierpiński-type graphs. 10-29 - Hiroki Numaguchi, Wei Wu, Yannan Hu:
Two-machine job-shop scheduling with one joint job. 30-43 - Jian-Bo Lv, Jianxi Li:
Partition line graphs of multigraphs into two subgraphs with large chromatic numbers. 44-48 - Parameswar Basumatary, Kuldeep Sarma:
On unimodular graphs with a unique perfect matching. 49-61 - Martin Cerný, Michel Grabisch:
Incomplete cooperative games with player-centered information. 62-79 - Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau:
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. 80-94 - Mengdie Ye, Enrico Bartolini, Michael Schneider:
A general variable neighborhood search for the traveling salesman problem with time windows under various objectives. 95-114 - Etienne de Gastines, Arnaud Knippel:
Formulations for the maximum common edge subgraph problem. 115-130 - Jean Bertrand Gauthier, Stefan Irnich:
Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems. 131-153 - Eric Gottlieb, Matjaz Krnc, Peter Mursic:
Sprague-Grundy values and complexity for LCTR. 154-169 - Sumin Huang, Sergey Kitaev, Artem V. Pyatkin:
An embedding technique in the study of word-representability of graphs. 170-182 - Lorenzo Balzotti, Paolo Giulio Franciosa:
Non-crossing shortest paths lengths in planar graphs in linear time. 183-191 - David Dekker, Bart M. P. Jansen:
Kernelization for feedback vertex set via elimination distance to a forest. 192-214 - Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo:
Safe sets and in-dominating sets in digraphs. 215-227 - Julien Bensmail:
A notion of vertex equitability for proper labellings. 228-247 - Zhiqiang Ma, Yaping Mao, Ingo Schiermeyer, Meiqin Wei:
Complete bipartite graphs without small rainbow subgraphs. 248-262 - Ping Li:
Relations of three classes of disconnected coloring. 263-271 - Junxia Zhang, Jianguo Qian, Sumin Huang:
Minimum number of maximal dissociation sets in trees. 272-278 - Masaki Kashima:
Paintability of complete bipartite graphs. 279-289 - Karen Gunderson, Karen Meagher, Joy Morris, Venkata Raghu Tej Pantangi:
Induced forests in some distance-regular graphs. 290-300
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-06-20 21:37 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:
