default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 152
Volume 152, Numbers 1-3, 1 November 2005
- Horst W. Hamacher, Matthias Ehrgott:
Special section: Using discrete mathematics to model multileaf collimators in radiation therapy. 4-5 - Davaatseren Baatar
, Horst W. Hamacher, Matthias Ehrgott, Gerhard J. Woeginger:
Decomposition of integer matrices and multileaf collimator sequencing. 6-34 - Konrad Engel:
A new algorithm for optimal multileaf collimator field segmentation. 35-51 - Thomas Kalinowski:
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint. 52-88
- Eduardo A. Canale, José Gómez:
Asymptotically large (Delta, D)-graphs. 89-108 - Katarína Cechlárová, David F. Manlove:
The exchange-stable marriage problem. 109-122 - Amir Daneshgar, Hossein Hajiabolhassan:
Unique list-colourability and the fixing chromatic number of graphs. 123-138 - David Gamarnik, Maxim Sviridenko:
Hamiltonian completions of sparse random graphs. 139-158 - Wei Ho:
The m-step, same-step, and any-step competition graphs. 159-175 - Chính T. Hoàng, Mekkia Kouider:
On the b-dominating coloring of graphs. 176-186 - Wen An Liu, Wei-Guo Zhang, Zan Kan Nie:
Searching for two counterfeit coins with two-arms balance. 187-212 - Meinard Müller, Tomoko Adachi, Masakazu Jimbo:
Cluttered orderings for the complete bipartite graph. 213-228 - Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. 229-245 - Anders Sune Pedersen, Preben D. Vestergaard:
The number of independent sets in unicyclic graphs. 246-256
- Pranava K. Jha, Sandi Klavzar, Aleksander Vesel:
Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles. 257-265 - Mahnhoon Lee, Sridhar Radhakrishnan:
Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph. 266-272
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-07-11 00:13 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.
