default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 347
Volume 347, 2024
- Carolina Lucía Gonzalez
, Felix Mann:
On d-stable locally checkable problems parameterized by mim-width. 1-22 - Wenhao Zhen, Dein Wong, Yuanshuai Zhang:
Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices. 23-29 - Akihiro Higashitani, Kazuki Kurimoto, Naoki Matsumoto:
Feedback game on 3-chromatic Eulerian triangulations of surfaces. 30-38 - Meng Liu, Yusheng Li:
Random bipartite Ramsey numbers of long cycles. 39-47 - Pavan P. D, Éric Sopena:
On the oriented achromatic number of graphs. 48-61 - Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani:
Extremal digraphs for open neighbourhood location-domination and identifying codes. 62-74 - Sarah Cannon:
Irreducibility of recombination Markov chains in the triangular lattice. 75-130 - Lawrence Hollom:
On monotonicity in Maker-Breaker graph colouring games. 131-138 - Stijn Cambie:
Corrigendum on Wiener index, Zagreb Indices and Harary index of Eulerian graphs. 139-142 - Yanni Dong, Hajo Broersma, Yuhang Bai, Shenggui Zhang:
The complexity of spanning tree problems involving graphical indices. 143-154 - Dominic Flocco, Jonad Pulaj, Carl Yerger:
Automating weight function generation in graph pebbling. 155-174 - Allan Bickle:
2-tone coloring of cactus graphs. 175-186 - Christina Büsing, Sabrina Schmitz:
Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints. 187-213 - Shujing Miao, Shuchao Li, Wei Wei:
Matching extension and matching exclusion via the size or the spectral radius of graphs. 214-230 - Tabea Brandt, Christina Büsing, Sigrid Knust:
Structural insights about avoiding transfers in the patient-to-room assignment problem. 231-248 - Manuel Iori, Alberto Locatelli, Marco Locatelli, Juan José Salazar González:
Tool switching problems with tool order constraints. 249-262 - Junxue Zhang:
Extremal numbers for disjoint copies of a clique. 263-270 - Marcia Fampa, Jon Lee:
An outer-approximation algorithm for maximum-entropy sampling. 271-284 - Sven Mallach:
A quadratic simplex algorithm for primal optimization over zero-one polytopes. 285-296 - Bassem Jarboui, Mansour Eddaly:
A branch-and-bound approach to the no-idle flowshop scheduling problem. 297-310 - Sasmita Barik, Subhasish Behera, Sukanta Pati:
On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching. 311-318
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-11-05 21:03 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:
