![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Discrete Optimization, Volume 48
Volume 48, Number Part 1, May 2023
- Piotr Wojciechowski
, K. Subramani
, Alvaro Velasquez:
Reachability in choice networks. 100761 - Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Maximizing the Mostar index for bipartite graphs and split graphs. 100768 - Jan Boeckmann
, Clemens Thielen, Ulrich Pferschy:
Approximating single- and multi-objective nonlinear sum and product knapsack problems. 100771 - Ádám Fraknói, Dávid Á. Márton
, Dániel G. Simon
, Dániel Lenger:
On the Rényi-Ulam game with restricted size queries. 100772 - Natalia de Castro
, María Ángeles Garrido, Rafael Robles, María Trinidad Villar-Liñán:
Minimum gradation in greyscales of graphs. 100773 - Florian Hörsch, Zoltán Szigeti:
The complexity of 2-vertex-connected orientation in mixed graphs. 100774 - G. Jaykrishnan
, Asaf Levin
:
EPTAS for load balancing problem on parallel machines with a non-renewable resource. 100775 - Christoph Buchheim, Maja Hügging:
The polytope of binary sequences with bounded variation. 100776
Volume 48, Number Part 2, May 2023
- Gábor Bacsó, Bostjan Bresar
, Kirsti Kuenzel, Douglas F. Rall:
Graphs with equal Grundy domination and independence number. 100777 - Antonios Antoniadis
, Themis Gouleakis, Pieter Kleer
, Pavel Kolev:
Secretary and online matching problems with machine learned advice. 100778
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.