default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 296
Volume 296, June 2021
- Fabio Furini, Amélie Lambert, Lucas Létocart, Leo Liberti, Emiliano Traversi
:
Preface: CTW 2018. 1 - Gabriel Deza, Shmuel Onn:
Optimization over degree sequences of graphs. 2-8 - Ali Dehghan, Frédéric Havet:
On the semi-proper orientations of graphs. 9-25 - Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu:
On sufficient spectral radius conditions for hamiltonicity. 26-38 - Arijit Bishnu, Arijit Ghosh, Rogers Mathew, Gopinath Mishra, Subhabrata Paul:
Grid obstacle representation of graphs. 39-51 - Elham Aboomahigir, Milad Ahanjideh, Saieed Akbari:
Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs. 52-55 - Anderson G. da Silva, Simone Dantas, Diana Sasaki:
Determining equitable total chromatic number for infinite classes of complete r-partite graphs. 56-67 - Nili Guttmann-Beck, Roni Rozen, Michal Stern:
Vertices removal for feasibility of clustered spanning trees. 68-84 - Tomislav Letnik, Stane Bozicnik, Simon Spacapan, Matej Mencinger:
Optimal covering of the equidistant square grid network. 85-89 - Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta:
On characterizing the class of cographic signed-graphic matroids. 90-102 - Peter J. C. Dickinson, Reinier de Zeeuw:
Generating irreducible copositive matrices using the stable set problem. 103-117 - Fabrizio Marinelli, Andrea Pizzuti, Fabrizio Rossi:
LP-based dual bounds for the maximum quasi-clique problem. 118-140 - André B. Chassein, Marc Goerigk:
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. 141-163 - Ariel Kulik, Hadas Shachnai, Gal Tamir:
On Lagrangian relaxation for constrained maximization and reoptimization problems. 164-178 - Sune Lauth Gadegaard, Jens Lysgaard:
A symmetry-free polynomial formulation of the capacitated vehicle routing problem. 179-192 - Barbara Altenbokum, Winfried Hochstättler, Johanna Wiehe:
The NL-flow polynomial. 193-202 - Mathilde Vernet, Maciej Drozdowski, Yoann Pigné, Eric Sanlaville:
A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs. 203-216 - Teresa Schnepper, Kathrin Klamroth, Justo Puerto, Michael Stiglmayr:
A local analysis to determine all optimal solutions of p-k-max location problems on networks. 217-234
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-01-26 23:51 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:
