default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 61
Volume 61, 2026
- Leah Epstein
:
Online speed-robust scheduling. 100954 - C. E. Larson:
Vertex packing linear programs and critical independent sets. 100955 - Manuel Aprile, Marco Di Summa:
The red-blue-yellow matching problem. 100956 - Kien Trung Nguyen, Nguyen Thanh Hung, Nguyen Thanh Luan, Cao Minh Quang:
The inverse 1-median problem on median graphs under l2-norm. 100957 - Zengzhao Xu, Ligong Wang, Weige Xi:
Spectral radius and size conditions for fractional (a,b,l)-critical graphs. 100958 - Wayne Goddard, Michael A. Henning:
On the isolation number of graphs with minimum degree four. 100959
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 2026-08-22 01:43 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
