- 2021
- Elham Aboomahigir, Milad Ahanjideh, Saieed Akbari:
Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs. Discret. Appl. Math. 296: 52-55 (2021) - Barbara Altenbokum, Winfried Hochstättler, Johanna Wiehe:
The NL-flow polynomial. Discret. Appl. Math. 296: 193-202 (2021) - Arijit Bishnu, Arijit Ghosh, Rogers Mathew, Gopinath Mishra, Subhabrata Paul:
Grid obstacle representation of graphs. Discret. Appl. Math. 296: 39-51 (2021) - André B. Chassein, Marc Goerigk:
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. Discret. Appl. Math. 296: 141-163 (2021) - Ali Dehghan, Frédéric Havet:
On the semi-proper orientations of graphs. Discret. Appl. Math. 296: 9-25 (2021) - Gabriel Deza, Shmuel Onn:
Optimization over degree sequences of graphs. Discret. Appl. Math. 296: 2-8 (2021) - Peter J. C. Dickinson, Reinier de Zeeuw:
Generating irreducible copositive matrices using the stable set problem. Discret. Appl. Math. 296: 103-117 (2021) - Fabio Furini, Amélie Lambert, Lucas Létocart, Leo Liberti, Emiliano Traversi:
Preface: CTW 2018. Discret. Appl. Math. 296: 1 (2021) - Sune Lauth Gadegaard, Jens Lysgaard:
A symmetry-free polynomial formulation of the capacitated vehicle routing problem. Discret. Appl. Math. 296: 179-192 (2021) - Nili Guttmann-Beck, Roni Rozen, Michal Stern:
Vertices removal for feasibility of clustered spanning trees. Discret. Appl. Math. 296: 68-84 (2021) - Ariel Kulik, Hadas Shachnai, Gal Tamir:
On Lagrangian relaxation for constrained maximization and reoptimization problems. Discret. Appl. Math. 296: 164-178 (2021) - Tomislav Letnik, Stane Bozicnik, Simon Spacapan, Matej Mencinger:
Optimal covering of the equidistant square grid network. Discret. Appl. Math. 296: 85-89 (2021) - Fabrizio Marinelli, Andrea Pizzuti, Fabrizio Rossi:
LP-based dual bounds for the maximum quasi-clique problem. Discret. Appl. Math. 296: 118-140 (2021) - Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta:
On characterizing the class of cographic signed-graphic matroids. Discret. Appl. Math. 296: 90-102 (2021) - Teresa Schnepper, Kathrin Klamroth, Justo Puerto, Michael Stiglmayr:
A local analysis to determine all optimal solutions of p-k-max location problems on networks. Discret. Appl. Math. 296: 217-234 (2021) - Anderson G. da Silva, Simone Dantas, Diana Sasaki:
Determining equitable total chromatic number for infinite classes of complete r-partite graphs. Discret. Appl. Math. 296: 56-67 (2021) - Mathilde Vernet, Maciej Drozdowski, Yoann Pigné, Eric Sanlaville:
A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs. Discret. Appl. Math. 296: 203-216 (2021) - Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu:
On sufficient spectral radius conditions for hamiltonicity. Discret. Appl. Math. 296: 26-38 (2021) - 2016
- Jesmmer Alves, Diane Castonguay, Thomas Brüstle:
A Polynomial Recognition of Unit Forms. Electron. Notes Discret. Math. 55: 203-206 (2016) - Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
A preliminary analysis of the Distance Based Critical Node Problem. Electron. Notes Discret. Math. 55: 25-28 (2016) - Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
Proper connection number 2, connectivity, and forbidden subgraphs. Electron. Notes Discret. Math. 55: 105-108 (2016) - Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
On the minimum degree and the proper connection number of graphs. Electron. Notes Discret. Math. 55: 109-112 (2016) - Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
On the chromatic number of (P5, K2, t)-free graphs. Electron. Notes Discret. Math. 55: 127-130 (2016) - Maurizio Bruglieri, Roberto Cordone:
Partitioning a graph into minimum gap components. Electron. Notes Discret. Math. 55: 33-36 (2016) - Maurizio Bruglieri, Simona Mancini, Ferdinando Pezzella, Ornella Pisacane:
A new Mathematical Programming Model for the Green Vehicle Routing Problem. Electron. Notes Discret. Math. 55: 89-92 (2016) - Christina Büsing, Sarah Kirchner, Annika Thome:
The Capacitated Budgeted Minimum Cost Flow Problem with Unit Upgrading Costs. Electron. Notes Discret. Math. 55: 135-138 (2016) - Valentina Cacchiani, Feng Jiang, Paolo Toth:
Timetable Optimization for High-Speed Trains at Chinese Railways. Electron. Notes Discret. Math. 55: 29-32 (2016) - Becky Callaghan, Saïd Salhi, Gábor Nagy:
Drezner's Exact Method for the Continuous p-Centre Problem Revisited. Electron. Notes Discret. Math. 55: 41-44 (2016) - Marco Casazza, Alberto Ceselli:
Column generation for the variable cost and size bin packing problem with fragmentation. Electron. Notes Discret. Math. 55: 61-64 (2016) - Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia:
Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems. Electron. Notes Discret. Math. 55: 85-88 (2016)