The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2005, volume: 152, number: 1-3

  1. Horst W. Hamacher, Matthias Ehrgott
    Special section: Using discrete mathematics to model multileaf collimators in radiation therapy. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:4-5 [Journal]
  2. Davaatseren Baatar, Horst W. Hamacher, Matthias Ehrgott, Gerhard J. Woeginger
    Decomposition of integer matrices and multileaf collimator sequencing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:6-34 [Journal]
  3. Konrad Engel
    A new algorithm for optimal multileaf collimator field segmentation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:35-51 [Journal]
  4. Thomas Kalinowski
    A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:52-88 [Journal]
  5. Eduardo A. Canale, José Gómez
    Asymptotically large (Delta, D)-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:89-108 [Journal]
  6. Katarína Cechlárová, David Manlove
    The exchange-stable marriage problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:109-122 [Journal]
  7. Amir Daneshgar, Hossein Hajiabolhassan
    Unique list-colourability and the fixing chromatic number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:123-138 [Journal]
  8. David Gamarnik, Maxim Sviridenko
    Hamiltonian completions of sparse random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:139-158 [Journal]
  9. Wei Ho
    The m-step, same-step, and any-step competition graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:159-175 [Journal]
  10. Chính T. Hoàng, Mekkia Kouider
    On the b-dominating coloring of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:176-186 [Journal]
  11. Wen An Liu, Wei-Guo Zhang, Zan Kan Nie
    Searching for two counterfeit coins with two-arms balance. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:187-212 [Journal]
  12. Meinard Müller, Tomoko Adachi, Masakazu Jimbo
    Cluttered orderings for the complete bipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:213-228 [Journal]
  13. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:229-245 [Journal]
  14. Anders Sune Pedersen, Preben D. Vestergaard
    The number of independent sets in unicyclic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:246-256 [Journal]
  15. Pranava K. Jha, Sandi Klavzar, Aleksander Vesel
    Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:257-265 [Journal]
  16. Mahnhoon Lee, Sridhar Radhakrishnan
    Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:266-272 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002